Depth First Search Interview Questions
Master 32 depth first search problems frequently asked in technical interviews. These questions test your understanding of depth first searchconcepts and are essential for coding interview success.
32
Total Problems
6
Easy
21
Medium
5
Hard
#3613MediumFrequency: 100%
Maximize Amount After Two Days of Conversions
#1
Rank
#694MediumFrequency: 98%
Number of Distinct Islands
#2
Rank
#314MediumFrequency: 97%
Binary Tree Vertical Order Traversal
#3
Rank
#4
Rank
#364MediumFrequency: 88%
Nested List Weight Sum II
#5
Rank
#6
Rank
#366MediumFrequency: 84%
Find Leaves of Binary Tree
#7
Rank
#124HardFrequency: 84%
Binary Tree Maximum Path Sum
#8
Rank
#200MediumFrequency: 82%
Number of Islands
#9
Rank
#10
Rank
#104EasyFrequency: 80%
Maximum Depth of Binary Tree
#11
Rank
#236MediumFrequency: 79%
Lowest Common Ancestor of a Binary Tree
#12
Rank
#269HardFrequency: 79%
Alien Dictionary
#13
Rank
#329HardFrequency: 79%
Longest Increasing Path in a Matrix
#14
Rank
#199MediumFrequency: 76%
Binary Tree Right Side View
#15
Rank
#16
Rank
#975EasyFrequency: 73%
Range Sum of BST
#17
Rank
#235MediumFrequency: 72%
Lowest Common Ancestor of a Binary Search Tree
#18
Rank
#1029HardFrequency: 69%
Vertical Order Traversal of a Binary Tree
#19
Rank
#758MediumFrequency: 64%
Convert Binary Search Tree to Sorted Doubly Linked List
#20
Rank
#893MediumFrequency: 64%
All Nodes Distance K in Binary Tree
#21
Rank
#399MediumFrequency: 63%
Evaluate Division
#22
Rank
#270EasyFrequency: 62%
Closest Binary Search Tree Value
#23
Rank
#721MediumFrequency: 62%
Accounts Merge
#24
Rank
#133MediumFrequency: 60%
Clone Graph
#25
Rank
#854HardFrequency: 60%
Making A Large Island
#26
Rank
#207MediumFrequency: 56%
Course Schedule
#27
Rank
#114MediumFrequency: 53%
Flatten Binary Tree to Linked List
#28
Rank
#116MediumFrequency: 51%
Populating Next Right Pointers in Each Node
#29
Rank
#30
Rank
#100EasyFrequency: 44%
Same Tree
#31
Rank
#230MediumFrequency: 37%
Kth Smallest Element in a BST
#32
Rank
Master Depth First Search in Real Interviews
Get AI-powered assistance when solving depth first search problems during your actual interviews.
Get Started FreeNo credit card required