•PRACTICE

Depth-First Search Interview Questions

27 Depth-First Search problems asked across FAANG and top tech companies. Approach hints, optimal solutions, and related problems.

Filter by company

Clear all ✕
Amazon (3)Anthropic (1)Apple (3)Atlassian (4)Bloomberg (1)Databricks (1)Google (2)Meta (2)Microsoft (3)Netflix (3)Rippling (3)Salesforce (3)Uber (5)

Filter by topic

Array (178)Backtracking (17)BFS (23)Binary Search (34)Binary Tree (13)Bit Manipulation (16)Breadth-First Search (20)Counting (7)Data Stream (6)Database (6)Depth-First Search (27)Design (37)DFS (24)Divide and Conquer (7)Doubly-Linked List (5)DP (10)Dynamic Programming (39)Graph (6)Graph Theory (13)Greedy (31)Hash Table (87)Heap (12)Heap (Priority Queue) (13)Linked List (15)Math (32)Matrix (22)Monotonic Stack (6)Ordered Set (8)Prefix Sum (11)Queue (10)Recursion (7)Simulation (11)Sliding Window (21)Sorting (45)Stack (24)String (85)Topological Sort (6)Tree (30)Trie (10)Two Pointers (30)Union-Find (13)
🔒

to save your progress.

✓ 0ProblemDifficultyCompaniesBreakdown / SolutionLeetCode
All Paths From Source to TargetMedium1 companiesView breakdown →
Amount of Time for Binary Tree to Be InfectedMedium1 companiesView breakdown →
Binary Tree Inorder TraversalEasy1 companiesView breakdown →
Binary Tree Preorder TraversalEasy1 companiesView breakdown →
Binary Tree Vertical Order TraversalMedium1 companiesView breakdown →
Count Pairs of Connectable Servers in a Weighted Tree NetworkMedium1 companiesView breakdown →
Count Paths That Can Form a Palindrome in a TreeHard1 companiesView breakdown →
Distance to a Cycle in Undirected GraphHard1 companiesView breakdown →
House Robber IIIMEDIUM1 companiesView breakdown →
Is Graph Bipartite?MEDIUM1 companiesView breakdown →
Find Eventual Safe StatesMEDIUM1 companiesView breakdown →
Network Delay TimeMEDIUM1 companiesView breakdown →
Number of ProvincesMEDIUM1 companiesView breakdown →
Making A Large IslandHARD1 companiesView breakdown →
Maximize Amount After Two Days of ConversionsMEDIUM1 companiesView breakdown →
Maximize Sum of Weights after Edge RemovalsHARD1 companiesView breakdown →
Sentence Similarity IIMEDIUM1 companiesView breakdown →
Last Day Where You Can Still CrossHARD1 companiesView breakdown →
Lowest Common Ancestor of a Binary Tree IIMEDIUM1 companiesView breakdown →
Lowest Common Ancestor of a Binary Tree IVMEDIUM1 companiesView breakdown →
Reconstruct ItineraryHARD1 companiesView breakdown →
Serialize and Deserialize N-ary TreeHard1 companiesView breakdown →
Step-By-Step Directions From a Binary Tree Node to AnotherMedium1 companiesView breakdown →
Vertical Order Traversal of a Binary TreeHARD1 companiesView breakdown →
Web CrawlerMEDIUM1 companiesView breakdown →
Design Add and Search Words Data StructureMedium4 companiesView breakdown →
Populating Next Right Pointers in Each NodeMedium5 companiesView breakdown →

Practice with a Mock Interview

Solve these Depth-First Search problems under real interview pressure with our AI interviewer.

Start Mock Interview →