Available question text
Find the minimum number of steps in a walk that visits every node of an undirected connected graph (n ≤ 12), where revisiting nodes/edges is allowed. This is solved by searching the shortest path in the augmented state space (current node, visited-node bitmask) — typically via BFS/bitmask DP over O(n·2^n) states.
Related questions
Continue with questions that share topics or the same question type.
- Shortest Path Between Two Nodes in a Graph
Coding
- Shortest Path to Get All Keys
Coding
- Add Edges to Make Degrees of All Nodes Even
Coding
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 3 records
Google
Leetcode 847. Shortest Path Visiting All Nodes
Reported Dec 25, 2024 · 2 source reports
MID_LEVEL
Source snapshot: Nov 12, 2026
View sourceIntuit
Leetcode 847. Shortest Path Visiting All Nodes
Reported Mar 1, 2026 · 2 source reports
SENIOR, STAFF
Source snapshot: Nov 12, 2026
View sourceLinkedIn
Leetcode 847. Shortest Path Visiting All Nodes
Reported Aug 5, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source