Started with a brief professional introduction covering my background, skills, and key projects. The interviewer then asked about searching algorithms, where I listed the different techniques I know and wrote down their time and space complexities on paper for a direct comparative analysis. Next, we shifted to the real-world applications of non-linear data structures: • Trees: Discussed their usage in hierarchical systems like OS file directories and database indexing. • Graphs (BFS): Explained applications in shortest-path routing for GPS navigation and mapping social network connections. • Graphs (DFS): Highlighted their role in deep-dive web crawling and constraint-satisfaction problems like maze solving. Finished with a live coding segment involving two DSA problems. I walked through my thought process by discussing the brute-force methods first, then successfully optimized the logic, analyzed the algorithmic complexities, and wrote clean, production-ready code. Overall, it was a comprehensive round well-balanced between core computer science theory and practical problem-solving.

round -2 also went in a similar way dsa is the driving factor (practice questions and be confident with the concepts)