SRI-D

I appeared for the SWC Software Online Assessment (OA), where one of the coding questions was a standard LeetCode medium-level graph problem. After successfully clearing the OA, I was shortlisted for two interview rounds. In the first round (Technical Interview), I was asked to solve a standard array problem with a slight twist. I used a `map` in my solution, which led to a discussion on the time complexity of map operations. The interviewer further explored my understanding of how a `map` is implemented internally, including its underlying balanced binary search tree data structure and the reasoning behind its logarithmic time complexity. I successfully cleared this round. The second round was an HR interview, which primarily consisted of behavioral and general discussion questions. I was able to answer them confidently and successfully cleared the round as well.