30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 847. Shortest Path Visiting All Nodes

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.

Asked at:

Google

Intuit

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late October, 2025

Intuit

Senior

Early August, 2025

Mid-level

Late November, 2024

Google

Mid-level

Find the shortest path visiting all nodes in a graph using BFS, with a hard follow-up involving a constructive algorithm

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 847. Shortest Path Visiting All Nodes

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact