It was a fairly interesting interview with a mix of technical questions and also puzzles. Lot of the questions were centered around time complexity. The logical puzzle was a question about three light bulbs that are present in a room, but the switches are present in another room. How do we put on all the bulbs with minimum tries? (You can't leave the room.)

What is the best case time complexity of quick sort?