One of the main OA questions was a hard DSA problem involving graphs and optimization, which could be solved using multiple approaches. During the interview, I explained my complete thought process starting from the brute-force idea to optimized solutions. We discussed different methods, their trade-offs, time complexities, edge cases, and why one approach was more efficient than the others.

Tell me about yourself, your studies and experience.