depth-first search Problems

Algorithms

depth-first search

53 problems

#	Title	Acceptance	Difficulty
1	Shortest Word Distance (easy) array string two pointers +3 more	27.8%	easy
2	Squaring a Sorted Array (easy) array sorting two pointers +3 more	35.5%	easy
3	Middle of the LinkedList (easy) linked list fast and slow pointers two pointers +3 more	59.9%	easy
4	Problem Challenge 2: Find the Smallest Missing Positive Number (medium) array sorting recursion +3 more	28.8%	Med.
5	Reverse a Sub-list (medium) linked list linked list reversal recursion +2 more	31.4%	Med.
6	Problem Challenge 2: Rotate a LinkedList (medium) linked list doubly linked list recursion +2 more	22.8%	Med.
7	Problem 1: Balanced Parentheses (easy) stack string depth-first search +1 more	30.1%	easy
8	Problem 4: Next Greater Element (easy) array stack two pointers +3 more	31.5%	easy
9	Minimum Depth of a Binary Tree (easy) binary tree breadth-first search depth-first search +1 more	21.5%	easy
10	Binary Tree Path Sum (easy) binary tree depth-first search recursion +1 more	38.3%	easy
11	All Paths for a Sum (medium) binary tree depth-first search recursion +2 more	56.9%	Med.
12	Sum of Path Numbers (medium) binary tree recursion depth-first search	69.0%	Med.
13	Path With Given Sequence (medium) binary tree recursion depth-first search +1 more	25.9%	Med.
14	Count Paths for a Sum (medium) binary tree depth-first search recursion +2 more	24.5%	Med.
15	Problem Challenge 2: Path with Maximum Sum (hard) binary tree tree depth first search recursion +2 more	17.7%	hard
16	Find if Path Exists in Graph(easy) graph breadth-first search depth-first search +2 more	42.8%	easy
17	Solution: Find if Path Exists in Graph(easy) graph depth-first search recursion	0.0%	easy
18	Number of Provinces (medium) graph depth-first search union-find +3 more	41.5%	Med.
19	Find Eventual Safe States (medium) graph depth-first search breadth-first search +2 more	64.2%	Med.
20	Minimum Number of Vertices to Reach All Nodes(medium) graph topological sort breadth-first search +1 more	45.0%	Med.
21	Solution: Minimum Number of Vertices to Reach All Nodes(medium) graph algorithms topological sort depth-first search +2 more	0.0%	Med.
22	Number of Islands (easy) matrix graph matrix traversal +4 more	49.3%	easy
23	Biggest Island (easy) matrix breadth-first search depth-first search +4 more	47.4%	easy
24	Flood Fill (easy) breadth-first search depth-first search recursion +3 more	38.4%	easy
25	Number of Closed Islands (easy) graph matrix traversal breadth-first search +2 more	44.0%	easy
26	Problem Challenge 1 (easy) array matrix depth-first search +2 more	27.3%	easy
27	Problem Challenge 2 (medium) graph matrix breadth-first search +3 more	62.6%	Med.
28	Problem Challenge 3 (medium) graph depth-first search matrix +1 more	19.1%	Med.
29	String Permutations by changing case (medium) recursion backtracking string +2 more	56.7%	Med.
30	Minimum Add to Make Parentheses Valid (medium) string stack recursion +2 more	48.3%	Med.
31	Combination Sum (medium) backtracking recursion array +2 more	46.3%	Med.
32	Word Search (medium) depth-first search backtracking graph +2 more	28.6%	Med.
33	Design Add and Search Words Data Structure (medium) trie string depth-first search +3 more	35.5%	Med.
34	Topological Sort (medium) topological sort graph algorithms recursion +3 more	25.9%	Med.
35	Tasks Scheduling (medium) graph algorithms topological sort graph +2 more	46.4%	Med.
36	Tasks Scheduling Order (medium) graph algorithms topological sort recursion +2 more	47.0%	Med.
37	All Tasks Scheduling Orders (hard) topological sort graph algorithms graph +2 more	20.0%	hard
38	Alien Dictionary (hard) graph topological sort sorting +1 more	45.6%	hard
39	Redundant Connection (medium) graph breadth-first search depth-first search +1 more	45.5%	Med.
40	Number of Provinces (medium) graph depth-first search union-find +3 more	41.5%	Med.
41	Is Graph Bipartite? (medium) graph breadth-first search depth-first search +2 more	37.5%	Med.
42	Path With Minimum Effort (medium) graph algorithms breadth-first search depth-first search +3 more	40.8%	Med.
43	Same Tree (medium) binary tree binary search tree recursion +2 more	47.1%	Med.
44	Invert Binary Tree (medium) binary tree recursion depth-first search +1 more	77.7%	Med.
45	Binary Search Tree Iterator (medium) binary search tree recursion breadth-first search +2 more	90.0%	Med.
46	Subtree of Another Tree (easy) binary tree recursion breadth-first search +2 more	35.4%	easy
47	Pacific Atlantic Water Flow (medium) depth-first search breadth-first search graph +1 more	30.2%	Med.
48	Clone Graph (medium) clone graph depth-first search +3 more	46.3%	Med.
49	Lowest Common Ancestor of a Binary Search Tree (medium) binary search tree binary tree recursion +1 more	37.4%	Med.
50	Number of Connected Components in an Undirected Graph (medium) graph graph algorithms breadth-first search +1 more	31.7%	Med.
51	Graph Valid Tree (medium) graph algorithms depth-first search breadth-first search +3 more	30.7%	Med.
52	Design Add and Search Words Data Structure (medium) trie string depth-first search +3 more	35.5%	Med.
53	Longest Valid Parentheses (hard) stack string breadth-first search +3 more	15.7%	hard