I applied online through my college job portal and received an email from the recruiter three weeks later, asking me to schedule a 30-minute on-campus interview.

The interviewer was very friendly and asked many questions about my resume and previous work experiences. Afterward, she asked me to design an employee feedback application that would record employee goals/achievements for manager review. I was prompted to propose a design pattern for this problem and consider all possible test cases. It was a very open-ended question, so I wasn't sure if I covered everything.

Nevertheless, I received a call 15 days later asking me to come onsite.

I had four 1:1 technical rounds on-site. All the interviewers were very friendly. They gave us a tour of the campus and took us to the store. They treated the candidates very well and provided us with some awesome coupons for the store.

The interviews were a mixture of coding, design, behavioral questions, puzzles, and resume questions. Many distributed network questions were asked. It's beneficial to have well-rounded preparation; don't just concentrate on Data Structures and OOPS. Some of the questions included:

• "How would you design the swimming pool for a resort in Mexico?"
• "What data structure would you use for a website like Ancestry.com, and how and why?" I had to write code for this.
• "You have a website that displays the stock prices of every company daily with trends. How would you test the accuracy of the data displayed on the website?"
• "You have billions of strings sorted in an array, but you have no access to it. You only have a method that returns the string pertaining to an index. Use only that method to find the location of a given string." I started at O(n^2) and improved to O(logn).

Afterward, they gave me the results the very next day, which was very considerate of them.

You have billions of strings sorted in an array. You do not have any access to it. You just have a method that returns the string pertaining to an index. Use only that method to find the location of a given string.

I started out at O(n^2) and kept on improving to O(log n).