Given a directed or undirected graph, find if a cycle exists and print the nodes in the cycle. If multiple cycles exist, print the cycle starting from the lowest index.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.