Oracle came to our campus for recruitment. Sixty students were selected after an MCQs round.

The interview process was a bit chaotic, and there was very little management from their side. I reached the 3rd round.

First two rounds were of moderate difficulty.

They asked questions about linked lists, stacks, binary trees, arrays, and strings, along with 2-3 puzzles in the first round. In the second round, they inquired about my ML project, DBMS project, ER diagram, and one algorithm question.

In the 3rd round, the interviewer asked only one graph question, which was tough, and I could only offer a brute-force approach.

P.S. Do the puzzles from GeeksforGeeks in the Oracle section.

Find if two linked lists have a common node.

Find the left-closest greater element in an array for each element.

Transform a given binary tree into its mirror image (in-place).

Find the longest palindromic substring of a given string.

Find the shortest path between two points in a graph, without using a visited array or extra memory.