Darbar · Graphs

68 slots in the Leetcode Darbar catalog.

Darbar

Slot	Problem	Subtopic	Difficulty
100	All Paths From Source To Target	backtracking	medium
101	Maximum Path Quality Of A Graph	backtracking	hard
102	Find If Path Exists In Graph	bfs	easy
103	All Paths From Source To Target	bfs	medium
104	Keys And Rooms	bfs	medium
105	Number Of Provinces	bfs	medium
106	Redundant Connection	bfs	medium
107	Shortest Path Visiting All Nodes	bit manipulation	hard
108	Possible Bipartition	coloring	medium
109	Is Graph Bipartite	coloring	medium
110	Possible Bipartition	coloring	medium
111	Is Graph Bipartite	coloring	medium
112	Shortest Path With Alternating Colors	coloring	medium
113	Number Of Operations To Make Network Connected	connected components	medium
114	Number Of Provinces	connected components	medium
115	Critical Connections In A Network	connected components	hard
116	Find Critical And Pseudo Critical Edges In Minimum Spanning Tree	connected components	hard
117	Minimum Degree Of A Connected Trio In A Graph	connected components	hard
118	Course Schedule Ii	cycle detection	medium
119	Redundant Connection	cycle detection	medium
120	Course Schedule	cycle detection	medium
121	Find Eventual Safe States	cycle detection	hard
122	Find If Path Exists In Graph	dfs	easy
123	All Paths From Source To Target	dfs	medium
124	Minimum Number Of Vertices To Reach All Nodes	dfs	medium
125	Keys And Rooms	dfs	medium
126	Number Of Provinces	dfs	medium
127	Find The City With The Smallest Number Of Neighbors At A Threshold Distance	dp based	medium
128	Number Of Ways To Arrive At Destination	dp based	medium
129	Cheapest Flights Within K Stops	dp based	medium
130	Shortest Path Visiting All Nodes	dp based	hard
131	Parallel Courses Iii	dp based	hard
132	Reconstruct Itinerary	eulerian circuit	hard
133	Detonate The Maximum Bombs	geometry	medium
134	Find The Town Judge	hashing	easy
135	Minimum Number Of Vertices To Reach All Nodes	hashing	medium
136	Maximal Network Rank	hashing	medium
137	Count Sub Islands	matrix	medium
138	Number Of Closed Islands	matrix	medium
139	Max Area Of Island	matrix	medium
140	Count Servers That Communicate	matrix	medium
141	Evaluate Division	shortest path	medium
142	Find The City With The Smallest Number Of Neighbors At A Threshold Distance	shortest path	medium
143	Network Delay Time	shortest path	medium
144	Number Of Ways To Arrive At Destination	shortest path	medium
145	Cheapest Flights Within K Stops	shortest path	medium
146	Find Center Of Star Graph	simple graph	easy
147	Find If Path Exists In Graph	simple graph	easy
148	Find The Town Judge	simple graph	easy
149	Minimum Number Of Vertices To Reach All Nodes	simple graph	medium
150	Maximal Network Rank	simple graph	medium
151	Find Critical And Pseudo Critical Edges In Minimum Spanning Tree	spanning tree	hard
152	Min Cost To Connect All Points	spanning tree	medium
153	Number Of Operations To Make Network Connected	strongly connected components	medium
154	Number Of Provinces	strongly connected components	medium
155	Critical Connections In A Network	strongly connected components	hard
156	Find Critical And Pseudo Critical Edges In Minimum Spanning Tree	strongly connected components	hard
157	Minimum Degree Of A Connected Trio In A Graph	strongly connected components	hard
158	Number Of Ways To Arrive At Destination	topological sorting	medium
159	Minimum Height Trees	topological sorting	medium
160	Course Schedule	topological sorting	medium
161	Course Schedule Ii	topological sorting	medium
162	All Ancestors Of A Node In A Directed Acyclic Graph	topological sorting	medium
163	Number Of Provinces	union find	medium
164	Redundant Connection	union find	medium
165	Evaluate Division	union find	medium
166	Number Of Operations To Make Network Connected	union find	medium
167	Is Graph Bipartite	union find	medium

All topics · Syllabus