graph Problems | Design Gurus

Data Structures

graph

23 problems

#	Title	Acceptance	Difficulty
1	Problem Challenge 3: Cycle in a Circular Array (hard) graph array two pointers +1 more	17.3%	hard
2	Zigzag Traversal (medium) binary tree breadth-first search level order traversal +3 more	64.1%	Med.
3	Find if Path Exists in Graph (easy) graph depth-first search breadth-first search +2 more	42.8%	easy
4	Solution: Find if Path Exists in Graph (easy) graph algorithms depth-first search graph +1 more	0.0%	easy
5	Number of Provinces (medium) graph breadth-first search depth-first search +1 more	41.6%	Med.
6	Find Eventual Safe States (medium) graph depth-first search breadth-first search +2 more	64.2%	Med.
7	Minimum Number of Vertices to Reach All Nodes (medium) graph topological sort breadth-first search +1 more	45.0%	Med.
8	Bus Routes (hard) breadth-first search graph graph algorithms +1 more	69.5%	hard
9	Number of Islands (easy) graph breadth-first search depth-first search +3 more	49.4%	easy
10	Biggest Island (easy) graph matrix depth-first search +2 more	47.5%	easy
11	Number of Closed Islands (easy) graph matrix traversal breadth-first search +2 more	44.1%	easy
12	Problem Challenge 2 (medium) graph breadth-first search depth-first search +4 more	62.6%	Med.
13	Problem Challenge 3 (medium) graph matrix depth-first search +1 more	19.1%	Med.
14	Tasks Scheduling (medium) graph algorithms topological sort graph +2 more	46.4%	Med.
15	All Tasks Scheduling Orders (hard) graph topological sort recursion +1 more	20.0%	hard
16	Alien Dictionary (hard) graph topological sort depth-first search +2 more	45.7%	hard
17	Problem Challenge 2: Minimum Height Trees (hard) graph breadth-first search simulation	29.1%	hard
18	Redundant Connection (medium) graph graph algorithms two pointers	45.6%	Med.
19	Number of Provinces (medium) graph breadth-first search depth-first search +1 more	41.6%	Med.
20	Is Graph Bipartite? (medium) graph breadth-first search depth-first search +2 more	37.5%	Med.
21	Pacific Atlantic Water Flow (medium) depth-first search breadth-first search graph +1 more	30.3%	Med.
22	Clone Graph (medium) graph clone depth-first search +1 more	46.4%	Med.
23	Number of Connected Components in an Undirected Graph (medium) graph graph algorithms breadth-first search +1 more	31.7%	Med.