I recently appeared for an interview where the overall difficulty level was easy to medium.

The DSA round mainly focused on two coding questions:

Lowest Common Ancestor (LCA) in a Binary Tree. A Max Heap-based problem involving heap operations.

The questions were straightforward and tested core data structure concepts rather than tricky edge cases. If you're preparing for similar interviews, make sure you're comfortable with binary trees (especially LCA), heaps, and their standard implementations.

Overall, it was a manageable interview with a strong emphasis on fundamental DSA concepts.

Some of the HR questions asked were:

Tell me about yourself. Why are you interested in this role? What are your strengths and weaknesses? Describe a challenging project you've worked on. How do you handle tight deadlines or pressure? Are you comfortable working in a team? Do you have any questions for us?