Implement Depth-First Search Traversal
Company: Cadence
Role: Machine Learning Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
Given a graph represented as an adjacency list and a starting node, write a depth-first search function that returns the nodes visited in DFS order. Your solution should avoid revisiting nodes when the graph contains cycles. Briefly state how you would extend the approach to traverse all connected components if the graph is disconnected.
Quick Answer: This question evaluates implementation and conceptual understanding of graph traversal algorithms, specifically depth-first search on adjacency-list representations and handling cycles, and is categorized under Coding & Algorithms and graph theory.