Detailed explanation of the rounds :- 🔹Round 1 - Online Assessment (DSA Round) • Participants - approx. 400 • Time - 90 mins • 3 DSA Questions • Topics - Tree, Graph, Stack 🔹Round 2 - Aptitude (Online) • Participants - 26 • Time - 60 mins • 16 MCQ Questions • Topics - CS, System, Maths, Physics 🔹Round 3 - Hackathon Part A (HackerEarth) • Participants - 16 • Time - 180 mins • Tree of Space - Implement 3 functions; Lock, Unlock and Upgrade • Topics - Tree, Graph, OOP 🔹Round 4 - Elimination Round [NEW!

(GMeet) • Interviewer - PIYUSH GARG 🧠 • Participants - 12 • Time - 60-120 mins • Interview - 2 Coding Question (DSA/CP) • Topics (For coding question) - I was asked a CP question where I first explained the brute-force approach (O(2ⁿ)) and then optimized it to O(n), followed by a medium LeetCode problem. 🔹Round 5 - Hackathon Part B (Slack) • Interviewer - VIVEK SHUKLA 💡💯 • Participants - 3 • Time - 8 hours • i) Explaining the complete approach of Part A and deriving time and space complexities. ii) Improving time and space complexities. iii) Making the solution thread. I wasn’t allowed to lock the entire tree or use any atomic variables. • Topics - Parallel Computing, Threading 𝐕𝐞𝐫𝐝𝐢𝐜𝐭: Rejected

During the process, I realized that I took more time than expected to explain my approach in round 5, which led to a communication gap.

While it resulted in a rejection, the experience taught me the importance of concise articulation and active listening.