There were 3 rounds:
Round 1:
- Online Assessment on HackerEarth
- 3 coding questions purely based on DSA
- Problems asked were based on
- Arrays & Maths
- Dynamic Programming
- Segment Trees
Result: Shortlisted for the next round.
Round 2:
- Technical Round
- Purely based on DSA
- Problems asked in Round 1 were based on:
- Binary Search
- Largest Sum Subarray (Kadane’s Algorithm)
- Merge two Binary Trees with node sum
Result: Shortlisted for the next round.
Round 3:
- Hiring Manager Round
- Based on System Design and Computer Science and Fundamentals
- Problems asked in Round 2:
- Questions on my past Internship work and projects.
- What are ACID properties?
- Mutex and Semaphores
- Process & Threads
- An in-depth discussion on URL Shortner.
- Indexes in Databases
- Hashing Mechanisms
- Some more conceptual questions on OS & DBMS
Result: Rolled out an offer.