depth-first search Problems

Algorithms

depth-first search

49 problems

#	Title	Acceptance	Difficulty
1	Squaring a Sorted Array (easy) array sorting two pointers +3 more	35.6%	easy
2	Triplet Sum to Zero (medium) sorting two pointers array +3 more	22.2%	Med.
3	Problem Challenge 2: Find the Smallest Missing Positive Number (medium) array sorting recursion +3 more	28.9%	Med.
4	Problem Challenge 3: Find the First K Missing Positive Numbers (hard) array sorting recursion +2 more	16.8%	hard
5	Minimum Depth of a Binary Tree (easy) binary tree breadth-first search depth-first search +1 more	21.5%	easy
6	Binary Tree Path Sum (easy) binary tree depth-first search recursion	38.3%	easy
7	All Paths for a Sum (medium) binary tree recursion depth-first search	56.9%	Med.
8	Sum of Path Numbers (medium) binary tree recursion depth-first search	69.0%	Med.
9	Path With Given Sequence (medium) binary tree recursion depth-first search +1 more	25.9%	Med.
10	Count Paths for a Sum (medium) binary tree recursion depth-first search +2 more	24.5%	Med.
11	Problem Challenge 1: Tree Diameter (medium) binary tree graph algorithms recursion +2 more	59.3%	Med.
12	Problem Challenge 2: Path with Maximum Sum (hard) binary tree graph algorithms recursion +1 more	17.7%	hard
13	Find if Path Exists in Graph (easy) graph depth-first search breadth-first search +2 more	42.8%	easy
14	Solution: Find if Path Exists in Graph (easy) graph algorithms depth-first search recursion +2 more	0.0%	easy
15	Number of Provinces (medium) graph breadth-first search depth-first search +1 more	41.6%	Med.
16	Find Eventual Safe States (medium) graph depth-first search breadth-first search +2 more	64.2%	Med.
17	Minimum Number of Vertices to Reach All Nodes (medium) graph topological sort breadth-first search +1 more	45.0%	Med.
18	Solution: Minimum Number of Vertices to Reach All Nodes (medium) graph algorithms depth-first search breadth-first search	0.0%	Med.
19	Number of Islands (easy) graph breadth-first search depth-first search +3 more	49.4%	easy
20	Biggest Island (easy) graph matrix depth-first search +2 more	47.5%	easy
21	Flood Fill (easy) breadth-first search depth-first search recursion +2 more	38.5%	easy
22	Number of Closed Islands (easy) graph matrix traversal breadth-first search +2 more	44.1%	easy
23	Problem Challenge 1 (easy) matrix recursion depth-first search	27.4%	easy
24	Problem Challenge 2 (medium) graph breadth-first search depth-first search +4 more	62.6%	Med.
25	Problem Challenge 3 (medium) graph matrix depth-first search +1 more	19.1%	Med.
26	String Permutations by changing case (medium) recursion backtracking string +2 more	56.7%	Med.
27	Search in a Sorted Infinite Array (medium) binary search array recursion +1 more	33.7%	Med.
28	Minimum Add to Make Parentheses Valid (medium) string stack recursion +2 more	48.3%	Med.
29	Remove Duplicate Letters (medium) string greedy algorithm stack +3 more	18.0%	Med.
30	Word Search (medium) depth-first search backtracking graph algorithms +3 more	28.7%	Med.
31	Design Add and Search Words Data Structure (medium) trie string depth-first search +3 more	35.5%	Med.
32	Tasks Scheduling (medium) graph algorithms topological sort graph +2 more	46.4%	Med.
33	Tasks Scheduling Order (medium) graph algorithms topological sort recursion +2 more	47.1%	Med.
34	Alien Dictionary (hard) graph topological sort depth-first search +2 more	45.7%	hard
35	Problem Challenge 1: Reconstructing a Sequence (hard) graph algorithms topological sort recursion +2 more	31.9%	hard
36	Number of Provinces (medium) graph breadth-first search depth-first search +1 more	41.6%	Med.
37	Is Graph Bipartite? (medium) graph breadth-first search depth-first search +2 more	37.5%	Med.
38	Path With Minimum Effort (medium) graph algorithms shortest path dynamic programming +2 more	40.8%	Med.
39	Same Tree (medium) binary tree binary search tree recursion +2 more	47.2%	Med.
40	Binary Search Tree Iterator (medium) binary search tree recursion breadth-first search +2 more	89.6%	Med.
41	Subtree of Another Tree (easy) binary tree recursion breadth-first search +2 more	35.5%	easy
42	Pacific Atlantic Water Flow (medium) depth-first search breadth-first search graph +1 more	30.3%	Med.
43	Validate Binary Search Tree (medium) binary tree binary search tree recursion +1 more	28.3%	Med.
44	Clone Graph (medium) graph clone depth-first search +1 more	46.4%	Med.
45	Lowest Common Ancestor of a Binary Search Tree (medium) binary search tree binary tree recursion +1 more	37.5%	Med.
46	Number of Connected Components in an Undirected Graph (medium) graph graph algorithms breadth-first search +1 more	31.7%	Med.
47	Graph Valid Tree (medium) graph algorithms depth-first search breadth-first search +3 more	30.7%	Med.
48	Design Add and Search Words Data Structure (medium) trie string depth-first search +3 more	35.5%	Med.
49	Longest Valid Parentheses (hard) stack string breadth-first search +3 more	15.8%	hard