One OA and three interview rounds took place on campus at IIIT Hyderabad.

The initial two rounds were technical, while the last was HR.

The OA was simple.

The interviews focused more on my projects, especially the 'Smart India Hackathon' project and a distributed systems project.

1. Explain all 4 OOPS pillars in detail.

2. Given a system of McDonald's, show how you would apply all 4 OOPS pillars to it.

3. In the same McDonald's system, when a user gives a bill, they receive the order. Which OOPS pillar is this? (Abstraction)

   • Follow-up: Why abstraction and not encapsulation?
     • Reason:
       1. Abstraction works at the design level.
       2. Encapsulation works at the implementation level.

4. How would you design your own Google Maps? What factors would you consider, and which algorithm would you use?

   • Algorithm: Shortest path, like Dijkstra/Bellman Ford.
   • Factors considered: Distance + Heuristic Traffic values (I mentioned generating these based on intensity on each road from satellite images).
   • How would you handle the case when Google Maps suggests another route in the middle of travel?
     1. Running my algorithm on updated factors (mentioned above) after every specific time interval would address this.

5. What is normalization? What is its need, and explain with an example.

   • After giving a relation, for example, decompose it to BCNF.

6. What are commit and rollback in transactions? Why are they needed?

7. HR Questions:

   • Any software you are attached to because of a specific feature?
   • Any topic you have studied beyond academics?

Anchal

1. Question 1: Given a sorted array (may contain duplicates) and a number 'num', return the frequency of 'num'. (I explained all possible approaches and finally coded the most optimized way: binary search).

2. Question 2: Detect a cycle in the given linked list. Return a boolean answer. (I explained all possible approaches and finally coded the most optimized way: slow and fast pointer approach).

3. Follow-up of Question 2: Return the entry point in the linked list given that the linked list contains a cycle. (I explained all possible approaches and finally coded the most optimized way).

4. Explain any one of your projects.