The interviews started at 9:45 AM and ended at 2:00 PM.

• Technique interview: A person with long hair started with a technique question immediately.
• Technique interview: The interviewer started by introducing the project they are working on at Google, followed by a technique question.
• Technique interview: Two technique questions were asked. The first was easy, while the second was not.
• Lunch
• Technique interview: A tall, blonde-haired person asked one technical question.

I managed to write the code for all the questions asked by the interviewer. Then, I got stuck on questions where the interviewer asked me to improve the time complexity. I think it's important to solve problems with an efficient solution, not just a working one, for Google.

1. Find k numbers which sum to n. (I think the interviewer wanted to ask me to optimize the solution, but we ran out of time.)

2. Find a path from source to target in a tree where each node can have an arbitrary number of children. (Follow-up: How to do this in sub-O(n) time and linear space, given that you can store reachability in each node?)

3. OOP: Add URLs and find the median. (Follow-up: Do it in O(log n).)

4. Decide if there is a cycle in a graph.