I went through campus recruiting. The process took two days.

For the Software Engineer position, they hire two kinds of candidates: one with a programming background and another without. I went for the latter.

They were really nice and gentlemanly about it. They inquired about what we were comfortable with and asked questions in that area.

They do want to make sure that you know basic programming and are familiar with data structures. Logic and understanding a problem are what they look for. So be prepared for a lot of puzzles and situational questions. They don't expect you to answer them right away; they help you through the process. I guess they want to test how you approach a problem.

The first round had puzzles and basic data structures questions regarding hash tables, trees, etc.

The second round had more programming in it. They asked more data structures questions and a little bit about architecture.

In the third round, I was asked to build an architecture connecting a front-end UI and key-value data at the back. They asked me to design what DB, what APIs, and data structures I would employ for that. This discussion alone went for an hour. But they were very understanding and encouraging if we got stuck.

And then, in the HR round, I was asked about why I chose to apply for this and a little bit about my background.

Finally, I spoke for half an hour with a managing director, who asked me about all the projects I undertook during my work experience and master's.

Overall, it was a very positive experience. Even though I did not get the offer, it is one of the best interviews I attended because of the way they treated the person being interviewed.

You have 12 marbles, out of which only one is of different weight. You don't know if it's less or more than the others. What is the least number of weighings you have to make to find it?

How do we find if a linked list has a loop?

In what situations are hash tables better than trees, and vice versa?

What is the functional need for the private modifier?