On-campus:

The process started with an online assessment that included two coding problems and some MCQs on behavior. After shortlisting, there was only one interview round: one technical.

The technical round focused on data structures and algorithms, with emphasis on problem-solving, coding efficiency, and explaining the approach clearly.

They asked me to solve a problem on finding the longest substring without repeating characters.

I explained my approach using a sliding window technique.

I optimized it to O(n) and implemented it in C++.