🔹 Round 1 – Online Coding Challenge 90 minutes | 3 DSA problems (Graphs and Trees) - This round had three medium to hard level problems. I had to manage time well and make sure my logic was clean and efficient. It tested my speed and how calmly I could think with the timer running. 🔹 Round 2 – Technical MCQ Round 60 minutes | 16 questions (Physics, Math, CS basics) - The questions required real thinking with a mix of logic, math puzzles, basic physics and core CS topics like DBMS, OS, CN and OOPs. It checked how strong my fundamentals were. 🔹 Round 3 – Hackathon Part A 3 hours | Tree of Space - Implement 3 functions; Lock, Unlock and Upgrade - We were given a tree based locking-unlocking problem.

I had to use object-oriented design and write modular clean code. 🔹 Round 4 – Elimination Interview 1 to 2 hours | Live coding and explanation - This was a technical round where I had to solve two coding problems based on stacks and trees. The focus was on how clearly I approached the problem. 🔹 Round 5 – Hackathon Part B (Slack Based) 7 hours | Optimization and Concurrency - The problem was shared on Slack. It involved: i) Explaining the complete approach of Part A and improving time and space complexities. ii) Making the solution thread-safe by introducing locking mechanisms. I wasn’t allowed to lock the entire tree or use any atomic variables.

The interviewer was very helpful and it felt more like a learnathon. 🔹 Round 6 – Final Onsite Interview in Bangalore✈️(System + Cultural)| System Design, OS, DBMS, CN and Resume

This is a tree-based locking and unlocking problem.