+1-5714784200

Depth First Search - Interview Questions

1
Binary Tree Maximum Path Sum
2
All Nodes Distance K In Binary Tree
3
Course Schedule Ii
4
Find Bottom Left Tree Value
5
Reorder Routes To Make All Paths Lead To The City Zero
6
Minimum Depth Of Binary Tree
7
Strange Printer
8
Path Sum Ii
9
Remove Invalid Parentheses
10
Tree Diameter
11
Construct Binary Tree From Preorder And Inorder Traversal
12
Recover Binary Search Tree
13
Reconstruct Itinerary
14
Binary Tree Paths
15
Binary Tree Right Side View
16
Sum Of Nodes With Even Valued Grandparent
17
Shopping Offers
18
Surrounded Regions
19
Balanced Binary Tree
20
Find Largest Value In Each Tree Row
21
Zuma Game
22
Lonely Pixel I
23
Remove Boxes
24
Cracking The Safe
25
Maximum Depth Of N Ary Tree
26
Count Good Nodes In Binary Tree
27
All Paths From Source Lead To Destination
28
Unknown
29
Maximum Difference Between Node And Ancestor
30
Nested List Weight Sum
31
01 Matrix
32
Out Of Boundary Paths
33
Convert Sorted Array To Binary Search Tree
34
Nested List Weight Sum Ii
35
Minesweeper
36
Recover A Tree From Preorder Traversal
37
Path Sum
38
Longest Increasing Path In A Matrix
39
Course Schedule
40
Clone Graph
41
Maximum Depth Of Binary Tree
42
Unknown
43
Freedom Trail
44
Sum Root To Leaf Numbers
45
Symmetric Tree
46
Binary Tree Coloring Game
47
Flatten Binary Tree To Linked List
48
Matchsticks To Square
49
Smallest String Starting From Leaf
50
Deepest Leaves Sum
51
Lowest Common Ancestor Of Deepest Leaves
52
Delete Nodes And Return Forest
53
Distribute Coins In Binary Tree
54
Binary Tree Level Order Traversal
55
Sum Of Distances In Tree
56
Populating Next Right Pointers In Each Node
57
Number Of Connected Components In An Undirected Graph
58
Minimum Time To Collect All Apples In A Tree
59
Convert Sorted List To Binary Search Tree
60
Increasing Order Search Tree
61
Pseudo Palindromic Paths In A Binary Tree
62
Number Of Islands
63
Construct Binary Tree From Inorder And Postorder Traversal
64
Leaf Similar Trees
65
Binary Tree Vertical Order Traversal
66
Populating Next Right Pointers In Each Node Ii
67
Binary Tree Cameras
68
Graph Valid Tree
69
Unknown
70
Flip Binary Tree To Match Preorder Traversal
71
Same Tree
72
Redundant Connection Ii
73
Maximum Product Of Splitted Binary Tree