LeetCode
Experience
#2204 Distance to a Cycle in Undirected Graph
Interview Experience
LeetCode #2204: Distance to a Cycle in Undirected Graph. Difficulty: Hard. Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort. Asked at Oracle in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →Topics
Breadth-First Search
Depth-First Search
Graph Theory
Topological Sort
Graph
More from Oracle
1p3a
Oracle Software Engineer 3 Technical Interview, 6 YOE, Rejected, Q3 2025
1p3a
Oracle OCI SMTS Interview Experience with 5 YOE System Design and Coding
1p3a
Oracle OCI IC3 Software Engineer Interview Experience Networking Team
1p3a
Oracle Senior Application Developer Interview Questions and Experience
1p3a
Oracle Senior Software Engineer Technical Phone Interview Throttling Design