•PRACTICE

DFS Interview Questions

24 DFS problems asked across FAANG and top tech companies. Approach hints, optimal solutions, and related problems.

Filter by company

Clear all ✕
Adobe (3)Amazon (14)Anthropic (1)Apple (13)Atlassian (5)Google (11)Meta (12)Microsoft (12)Netflix (6)OpenAI (1)Oracle (3)Ripple (2)Salesforce (3)Uber (12)Walmart (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
Number of IslandsMedium5 companiesView breakdown →
Course Schedule IIMedium5 companiesView breakdown →
Course ScheduleMedium4 companiesView breakdown →
Validate Binary Search TreeMedium7 companiesView breakdown →
Maximum Depth of Binary TreeEasy7 companiesView breakdown →
Invert Binary TreeEasy5 companiesView breakdown →
Same TreeEasy6 companiesView breakdown →
Symmetric TreeEasy5 companiesView breakdown →
Design Add and Search Words Data StructureMedium5 companiesView breakdown →
Alien DictionaryHard6 companiesView breakdown →
Kth Smallest Element in a BSTMedium6 companiesView breakdown →
Lowest Common Ancestor of a Binary TreeMedium8 companiesView breakdown →
Clone GraphMedium5 companiesView breakdown →
Serialize and Deserialize Binary TreeHard8 companiesView breakdown →
Flatten Nested List IteratorMedium3 companiesView breakdown →
Word SearchMedium4 companiesView breakdown →
Evaluate DivisionMedium2 companiesView breakdown →
Minimum Edge Reversals So Every Node Is ReachableHard3 companiesView breakdown →
Accounts MergeMedium2 companiesView breakdown →
Binary Tree Maximum Path SumHard3 companiesView breakdown →
Lowest Common Ancestor of a Binary Search TreeMedium1 companiesView breakdown →
Flatten a Multilevel Doubly Linked ListMedium1 companiesView breakdown →
Minimum Fuel Cost to Report to the CapitalMedium1 companiesView breakdown →
Web Crawler MultithreadedMedium1 companiesView breakdown →

Practice with a Mock Interview

Solve these DFS problems under real interview pressure with our AI interviewer.

Start Mock Interview →