Oracle

1. Round: DSA questions (medium and easy) from Love Babbar's resources, primarily focusing on linked lists and trees. Important questions include reversing a linked list and various sorting algorithms. 2nd Round: CS concepts, mainly from OOPs, oper

Three skill-based rounds plus a one-hour round. Queries were based on real-time topics, with approximately 70% new content and 30% review. The questions were good enough to make me question if I was right, as each query could have multiple solutions.

The interview started with introductions from both sides. Then, the interviewer shared a HackerRank link for a coding assessment. The question asked was to merge two sorted arrays. I discussed the approach, and after the interviewer was satisfied, I