breadth-first search Problems

Algorithms

breadth-first search

52 problems

#	Title	Acceptance	Difficulty
1	Shortest Word Distance (easy) array string two pointers +1 more	27.9%	easy
2	Squaring a Sorted Array (easy) array sorting two pointers +3 more	35.6%	easy
3	Problem Challenge 3: Smallest Window containing Substring (hard) sliding window string backtracking +1 more	20.0%	hard
4	Problem Challenge 2: Find the Smallest Missing Positive Number (medium) array sorting recursion +3 more	28.9%	Med.
5	Problem Challenge 3: Find the First K Missing Positive Numbers (hard) array sorting recursion +2 more	16.8%	hard
6	Binary Tree Level Order Traversal (easy) breadth-first search binary tree level order traversal +1 more	73.5%	easy
7	Reverse Level Order Traversal (easy) breadth-first search binary tree queue +1 more	89.2%	easy
8	Zigzag Traversal (medium) binary tree breadth-first search level order traversal +3 more	64.1%	Med.
9	Level Averages in a Binary Tree (easy) binary tree breadth-first search level order traversal +1 more	82.1%	easy
10	Find Largest Value in Each Tree Row (medium) breadth-first search binary tree queue +1 more	90.5%	Med.
11	Maximum Level Sum of a Binary Tree (medium) binary tree breadth-first search level order traversal	54.0%	Med.
12	Even Odd Tree (medium) binary tree tree breadth first search level order traversal +2 more	56.9%	Med.
13	Minimum Depth of a Binary Tree (easy) binary tree breadth-first search depth-first search +1 more	21.5%	easy
14	Level Order Successor (easy) breadth-first search level order traversal graph algorithms +1 more	63.9%	easy
15	Connect Level Order Siblings (medium) breadth-first search binary tree level order traversal +1 more	78.0%	Med.
16	Maximum Width of Binary Tree (medium) binary tree breadth-first search tree depth first search +3 more	32.1%	Med.
17	N-ary Tree Level Order Traversal (hard) n-ary tree level order traversal breadth-first search +1 more	92.5%	hard
18	Problem Challenge 1: Connect All Level Order Siblings (medium) breadth-first search level order traversal binary tree +1 more	80.1%	Med.
19	Count Paths for a Sum (medium) binary tree recursion depth-first search +2 more	24.5%	Med.
20	Problem Challenge 1: Tree Diameter (medium) binary tree graph algorithms recursion +2 more	59.3%	Med.
21	Find if Path Exists in Graph (easy) graph depth-first search breadth-first search +2 more	42.8%	easy
22	Number of Provinces (medium) graph breadth-first search depth-first search +1 more	41.6%	Med.
23	Find Eventual Safe States (medium) graph depth-first search breadth-first search +2 more	64.2%	Med.
24	Minimum Number of Vertices to Reach All Nodes (medium) graph topological sort breadth-first search +1 more	45.0%	Med.
25	Solution: Minimum Number of Vertices to Reach All Nodes (medium) graph algorithms depth-first search breadth-first search	0.0%	Med.
26	Bus Routes (hard) breadth-first search graph graph algorithms +1 more	69.5%	hard
27	Number of Islands (easy) graph breadth-first search depth-first search +3 more	49.4%	easy
28	Biggest Island (easy) graph matrix depth-first search +2 more	47.5%	easy
29	Flood Fill (easy) breadth-first search depth-first search recursion +2 more	38.5%	easy
30	Number of Closed Islands (easy) graph matrix traversal breadth-first search +2 more	44.1%	easy
31	Problem Challenge 2 (medium) graph breadth-first search depth-first search +4 more	62.6%	Med.
32	String Permutations by changing case (medium) recursion backtracking string +2 more	56.7%	Med.
33	Minimum Add to Make Parentheses Valid (medium) string stack recursion +2 more	48.3%	Med.
34	Remove Duplicate Letters (medium) string greedy algorithm stack +3 more	18.0%	Med.
35	Topological Sort (medium) topological sort graph algorithms recursion +1 more	26.0%	Med.
36	Tasks Scheduling Order (medium) graph algorithms topological sort recursion +2 more	47.1%	Med.
37	Alien Dictionary (hard) graph topological sort depth-first search +2 more	45.7%	hard
38	Problem Challenge 1: Reconstructing a Sequence (hard) graph algorithms topological sort recursion +2 more	31.9%	hard
39	Problem Challenge 2: Minimum Height Trees (hard) graph breadth-first search simulation	29.1%	hard
40	Number of Provinces (medium) graph breadth-first search depth-first search +1 more	41.6%	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 shortest path dynamic programming +2 more	40.8%	Med.
43	Same Tree (medium) binary tree binary search tree recursion +2 more	47.2%	Med.
44	Invert Binary Tree (medium) binary tree recursion tree depth first search +1 more	77.6%	Med.
45	Binary Search Tree Iterator (medium) binary search tree recursion breadth-first search +2 more	89.6%	Med.
46	Subtree of Another Tree (easy) binary tree recursion breadth-first search +2 more	35.5%	easy
47	Remove Nth Node From End of List (medium) linked list two pointers recursion +1 more	30.0%	Med.
48	Pacific Atlantic Water Flow (medium) depth-first search breadth-first search graph +1 more	30.3%	Med.
49	Clone Graph (medium) graph clone depth-first search +1 more	46.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	Longest Valid Parentheses (hard) stack string breadth-first search +3 more	15.8%	hard