I was asked to find the most time-efficient route between a start and destination in a 2D matrix, given four different modes of transportation represented by 1, 2, 3, and 4. Each mode has a specific time and cost associated with it. The goal was to find the ro...
Showing 11-20 of 46 forum items
I was asked to implement a snapshot set iterator. The problem stated that the return order was not important. I described that I would need a list of logs and a dictionary, and explained my general approach. The interviewer then asked if I could think of anoth...
I had two phone screen rounds. In the first round, I was asked to find the optimal path in a grid using BFS, optimizing for both time and cost. It was straightforward, and the interviewer was friendly. In the second round, the question seemed to be one the int...
The interviewer gave a list of reserved seat sections and asked what the layout looks like after removing one seat. I handled cases where removing a seat shrinks a range, splits a range into two, or removes the whole range. I used sorted intervals and walked t...
The interviewer described an inventory service where items can be added or removed, and queries ask whether an item existed at a past timestamp. I used a hash map from item id to a sorted list of version events, then binary searched the latest event at or befo...
I think I failed due to my coding performance, and likely the ML coding as well. The interviewers were all very nice, but unfortunately, my abilities were limited. **Coding:** The question seemed to be custom-made. I was given a string as a "password book", an...
The round started with a file-system style data structure where every folder had sorted child intervals. Given a route string, I had to find the matching node or report that it did not exist. I parsed the route into segments and used binary search among childr...
I had a virtual onsite interview in early March, consisting of four rounds. I was targeting the L4 level. **Coding Round 1:** I was asked about a Lazy Array problem and how to test for laziness. **Coding Round 2:** I had to implement a KV store with a hit coun...
The problem given to me was to find the best commute to Databricks HQ. I was given a 2D grid representing the city blocks, with S as the source and D as the destination. X represents a roadblock. The numbers 1-4 represent the transportation modes (1=Walk, 2=Bi...
