graph Problems | Design Gurus

Data Structures

graph

28 problems

#	Title	Acceptance	Difficulty
1	Zigzag Traversal (medium) binary tree breadth-first search level order traversal +3 more	64.0%	Med.
2	Zigzag Traversal (medium) binary tree breadth-first search level order traversal +3 more	64.0%	Med.
3	Level Order Successor (easy) breadth-first search level order traversal binary tree +1 more	63.9%	easy
4	Problem Challenge 1: Tree Diameter (medium) binary tree tree depth first search recursion +1 more	59.2%	Med.
5	Find if Path Exists in Graph(easy) graph breadth-first search depth-first search +2 more	42.8%	easy
6	Solution: Find if Path Exists in Graph(easy) graph depth-first search recursion	0.0%	easy
7	Number of Provinces (medium) graph depth-first search union-find +3 more	41.5%	Med.
8	Find Eventual Safe States (medium) graph depth-first search breadth-first search +2 more	64.2%	Med.
9	Minimum Number of Vertices to Reach All Nodes(medium) graph topological sort breadth-first search +1 more	45.0%	Med.
10	Bus Routes (hard) breadth-first search graph queue +2 more	69.5%	hard
11	Number of Islands (easy) matrix graph matrix traversal +4 more	49.3%	easy
12	Biggest Island (easy) matrix breadth-first search depth-first search +4 more	47.4%	easy
13	Flood Fill (easy) breadth-first search depth-first search recursion +3 more	38.4%	easy
14	Number of Closed Islands (easy) graph matrix traversal breadth-first search +2 more	44.0%	easy
15	Problem Challenge 2 (medium) graph matrix breadth-first search +3 more	62.6%	Med.
16	Problem Challenge 3 (medium) graph depth-first search matrix +1 more	19.1%	Med.
17	Word Search (medium) depth-first search backtracking graph +2 more	28.6%	Med.
18	Tasks Scheduling (medium) graph algorithms topological sort graph +2 more	46.4%	Med.
19	All Tasks Scheduling Orders (hard) topological sort graph algorithms graph +2 more	20.0%	hard
20	Alien Dictionary (hard) graph topological sort sorting +1 more	45.6%	hard
21	Problem Challenge 1: Reconstructing a Sequence (hard) graph algorithms topological sort graph +1 more	31.9%	hard
22	Problem Challenge 2: Minimum Height Trees (hard) graph breadth-first search simulation	29.1%	hard
23	Redundant Connection (medium) graph breadth-first search depth-first search +1 more	45.5%	Med.
24	Number of Provinces (medium) graph depth-first search union-find +3 more	41.5%	Med.
25	Is Graph Bipartite? (medium) graph breadth-first search depth-first search +2 more	37.5%	Med.
26	Pacific Atlantic Water Flow (medium) depth-first search breadth-first search graph +1 more	30.2%	Med.
27	Clone Graph (medium) clone graph depth-first search +3 more	46.3%	Med.
28	Number of Connected Components in an Undirected Graph (medium) graph graph algorithms breadth-first search +1 more	31.7%	Med.