Back to Questions

Shortest Path Visiting All Nodes

24.2K views•Asked at Airbnb•
Hard

Question Explain

Given a graph, find the length of the shortest path that visits every node. This is a variation of the Traveling Salesperson Problem (TSP) solvable with BFS and Bitmasking DP.

Start Trying This Question Simulation

Practice answering orally or with text to get instant AI feedback.

Practice with This Question

Other interview questions like this

Two Sum

104.4K views

Longest Substring Without Repeating Characters

62.2K views

Median of Two Sorted Arrays

107.8K views
Shortest Path Visiting All Nodes - Interview Question