breadth-first search Problems

Algorithms

breadth-first search

55 problems

#	Title	Acceptance	Difficulty
1	Shortest Word Distance (easy) array string two pointers +3 more	27.8%	easy
2	Find Non-Duplicate Number Instances (easy) array two pointers sorting +3 more	42.5%	easy
3	Squaring a Sorted Array (easy) array sorting two pointers +3 more	35.5%	easy
4	Middle of the LinkedList (easy) linked list fast and slow pointers two pointers +3 more	59.9%	easy
5	Problem Challenge 2: Find the Smallest Missing Positive Number (medium) array sorting recursion +3 more	28.8%	Med.
6	Reverse a Sub-list (medium) linked list linked list reversal recursion +2 more	31.4%	Med.
7	Problem Challenge 2: Rotate a LinkedList (medium) linked list doubly linked list recursion +2 more	22.8%	Med.
8	Problem 4: Next Greater Element (easy) array stack two pointers +3 more	31.5%	easy
9	Problem 1: First Non-repeating Character (easy) string hash map counting +1 more	55.3%	easy
10	Reverse Level Order Traversal (easy) breadth-first search binary tree queue +1 more	89.2%	easy
11	Find Largest Value in Each Tree Row (medium) tree breadth first search binary tree breadth-first search +2 more	90.5%	Med.
12	Maximum Width of Binary Tree (medium) binary tree breadth-first search tree depth first search +3 more	32.1%	Med.
13	Maximum Level Sum of a Binary Tree (medium) breadth-first search binary tree level order traversal +1 more	54.0%	Med.
14	Zigzag Traversal (medium) binary tree breadth-first search level order traversal +3 more	64.0%	Med.
15	Even Odd Tree (medium) binary tree tree breadth first search level order traversal +2 more	56.9%	Med.
16	N-ary Tree Level Order Traversal (hard) breadth-first search n-ary tree level order traversal	92.5%	hard
17	Binary Tree Level Order Traversal (easy) breadth-first search binary tree level order traversal +1 more	73.4%	easy
18	Reverse Level Order Traversal (easy) breadth-first search binary tree queue +1 more	89.2%	easy
19	Zigzag Traversal (medium) binary tree breadth-first search level order traversal +3 more	64.0%	Med.
20	Level Averages in a Binary Tree (easy) binary tree breadth-first search level order traversal +1 more	82.0%	easy
21	Minimum Depth of a Binary Tree (easy) binary tree breadth-first search depth-first search +1 more	21.5%	easy
22	Level Order Successor (easy) breadth-first search level order traversal binary tree +1 more	63.9%	easy
23	Connect Level Order Siblings (medium) breadth-first search binary tree level order traversal +1 more	78.1%	Med.
24	Problem Challenge 1: Connect All Level Order Siblings (medium) breadth-first search level order traversal binary tree +1 more	80.1%	Med.
25	Find if Path Exists in Graph(easy) graph breadth-first search depth-first search +2 more	42.8%	easy
26	Number of Provinces (medium) graph depth-first search union-find +3 more	41.5%	Med.
27	Find Eventual Safe States (medium) graph depth-first search breadth-first search +2 more	64.2%	Med.
28	Minimum Number of Vertices to Reach All Nodes(medium) graph topological sort breadth-first search +1 more	45.0%	Med.
29	Solution: Minimum Number of Vertices to Reach All Nodes(medium) graph algorithms topological sort depth-first search +2 more	0.0%	Med.
30	Bus Routes (hard) breadth-first search graph queue +2 more	69.5%	hard
31	Number of Islands (easy) matrix graph matrix traversal +4 more	49.3%	easy
32	Biggest Island (easy) matrix breadth-first search depth-first search +4 more	47.4%	easy
33	Flood Fill (easy) breadth-first search depth-first search recursion +3 more	38.4%	easy
34	Number of Closed Islands (easy) graph matrix traversal breadth-first search +2 more	44.0%	easy
35	Problem Challenge 1 (easy) array matrix depth-first search +2 more	27.3%	easy
36	Problem Challenge 2 (medium) graph matrix breadth-first search +3 more	62.6%	Med.
37	String Permutations by changing case (medium) recursion backtracking string +2 more	56.7%	Med.
38	Minimum Add to Make Parentheses Valid (medium) string stack recursion +2 more	48.3%	Med.
39	Topological Sort (medium) topological sort graph algorithms recursion +3 more	25.9%	Med.
40	Tasks Scheduling Order (medium) graph algorithms topological sort recursion +2 more	47.0%	Med.
41	Problem Challenge 2: Minimum Height Trees (hard) graph breadth-first search simulation	29.1%	hard
42	Redundant Connection (medium) graph breadth-first search depth-first search +1 more	45.5%	Med.
43	Number of Provinces (medium) graph depth-first search union-find +3 more	41.5%	Med.
44	Is Graph Bipartite? (medium) graph breadth-first search depth-first search +2 more	37.5%	Med.
45	Path With Minimum Effort (medium) graph algorithms breadth-first search depth-first search +3 more	40.8%	Med.
46	Same Tree (medium) binary tree binary search tree recursion +2 more	47.1%	Med.
47	Invert Binary Tree (medium) binary tree recursion depth-first search +1 more	77.7%	Med.
48	Binary Search Tree Iterator (medium) binary search tree recursion breadth-first search +2 more	90.0%	Med.
49	Subtree of Another Tree (easy) binary tree recursion breadth-first search +2 more	35.4%	easy
50	Remove Nth Node From End of List (medium) linked list two pointers recursion +1 more	30.1%	Med.
51	Pacific Atlantic Water Flow (medium) depth-first search breadth-first search graph +1 more	30.2%	Med.
52	Clone Graph (medium) clone graph depth-first search +3 more	46.3%	Med.
53	Number of Connected Components in an Undirected Graph (medium) graph graph algorithms breadth-first search +1 more	31.7%	Med.
54	Graph Valid Tree (medium) graph algorithms depth-first search breadth-first search +3 more	30.7%	Med.
55	Longest Valid Parentheses (hard) stack string breadth-first search +3 more	15.7%	hard