I contacted a recruiter and sent my resume to her. I was then contacted for an initial phone screening.

The screening included a few behavioral questions (Why Yelp, three things looking for in an internship, etc.) and a series of easy technical questions, all of which can be found on Glassdoor.

I was told immediately at the end of the call that I passed and then moved on to a Skype interview. The interviewer was a little unprepared because my original interviewer got pulled for a meeting last minute. She picked some knowledge-based questions to ask me based on my resume (SQL questions, pros and cons of Java, C, C++).

The coding question was a little tricky, but if you know your data structures, it's not hard. They are just looking for the most efficient way to solve the problem. I didn't code the most efficient way, but then, when asked if I could make it better, I thought of a better way and told her.

I passed that round and then moved on to two back-to-back Skype interviews. The first one was tough as it was with a manager. He grilled me on my past experience and asked two technical questions along with a coding question.

The second interview went really well with an engineer working under that manager. They asked me a mix of behavioral and technical questions along with a coding question.

I'm pretty sure I wowed the engineer but not the manager. I got both of the coding questions right. I didn't move on from there, but overall, it was a great experience and the interviewers were extremely friendly.

Write a text wrapper function that takes a width in pixels and a string and returns a string with new lines inserted. (You are also given a function that takes a string and gives you its pixel width).

Write a function that reverses a linked list.

List of tickets, in the form (origin, destination)

ORIGINAL_TICKETS = [ ('SFO', 'LAX'), ('LAX', 'JFK'), ('JFK', 'LHR'), ('LHR', 'CDG'), ('CDG', 'DXB'), ('DXB', 'HKG'), ('HKG', 'HAM'), ]

Write a function that, given the original origin, finds the final destination. Then, write a function that would find both the original origin and final destination with only access to that ticket list. Finally, write a function that finds a missing ticket given the original origin and final destination.