Oracle

Round 1: Online coding + basic DBMS + basic OOPs + basic cloud + basic OS + basic computer architecture + basic computer networks [elimination round] Round 2: A DSA + DBMS question Round 3: Coding round Round 4: HR

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

This was an on-campus opportunity with three rounds. The first round was an online test. The test included different sections covering: * Computer fundamentals * Coding concepts * Logical reasoning * Numerical reasoning * English All que