InterviewDigestTechnical2026-08-12
Solve a medium-level DSA graph problem.
AI-Expanded — inferred from the question title, not from the original candidate report
Given a directed graph represented as an adjacency list and a starting node, determine if there is a path that visits every node in the graph exactly once. If such a path exists, return the sequence of nodes; otherwise, return an empty list or indicate that no Hamiltonian path is possible.
Context & Summary
A 1-hour technical interview with 10 questions: one medium-level DSA graph question and nine cloud-based scenario questions requiring solution proposals.
💻 Coding practice works best on desktop.
Code editors are too cramped on mobile screens.
Loading editor...
AI can automatically infer and generate example test cases for this question based on standard algorithmic constraints.