Oracle

It was a medium-hard interview process. The first interview involved an assignment, the second was a technical interview, and the last was a final HR interview. So, it wasn’t that easy or that hard.

Detect if a directed graph has a cycle. This problem tests understanding of DFS, visited sets, and recursion stacks. This problem is frequently asked in technical interviews to assess a candidate's grasp of graph traversal algorithms, particularly

It was straightforward. HR will provide you with the available slots and schedule the interview. It was an online, one-hour interview, and a general discussion about the role and responsibilities.