I applied on the Uber website. I had a one-hour phone interview, followed by an onsite interview with five people (one-on-one, an hour each).

Scheduling both interviews was a quick process, and in both cases, I was informed about the decision the very next day.

The interview was pretty intense, and I did not finish the implementation for the first question in time (although I formulated the solution correctly). Therefore, there was no offer.

Implement a data structure "Map" storing pairs of integers (key, value) and define the following member functions in O(1) runtime:

• void insert(key, value)
• void delete(key)
• int get(key)
• int getRandomKey()

Given strings A and B, find the smallest substring of A that contains all the characters from B. Implement the solution in O(n), keeping in mind that characters in B can repeat.

Given a picture of a square with a bunch of horizontal and vertical lines in it (lines are not necessarily spanning the full square length; in other words, think of a fine grid with many holes in it), design data structure(s) to represent the data and a function that returns the number of squares pictured. An actual implementation is expected.

How would you design YouTube (considering needs for low latency, robustness against data loss, etc.)? No implementation is necessary.

Sketch the design of a project you participated in (on a whiteboard).