Name	Name	Last commit message	Last commit date
Latest commit History 1 Commit
01-Find Center of Star Graph.cpp	01-Find Center of Star Graph.cpp
02-Maximal Network Rank.cpp	02-Maximal Network Rank.cpp
03-Minimum Degree of a Connected Trio in a Graph.cpp	03-Minimum Degree of a Connected Trio in a Graph.cpp
04-Snakes and Ladder Game.cpp	04-Snakes and Ladder Game.cpp
05-Message Route.cpp	05-Message Route.cpp
06-Word Ladder.cpp	06-Word Ladder.cpp
07-Valid Bfs.cpp	07-Valid Bfs.cpp
08-Keys and Rooms.cpp	08-Keys and Rooms.cpp
09-Largest Island.cpp	09-Largest Island.cpp
10-Astronaut Pairs.cpp	10-Astronaut Pairs.cpp
11-Reconstruct Itinerary.cpp	11-Reconstruct Itinerary.cpp
12-Cycle Detection in Undirected Graph.cpp	12-Cycle Detection in Undirected Graph.cpp
13-Directed Graph Cycle Detection.cpp	13-Directed Graph Cycle Detection.cpp
14-Course Schedule.cpp	14-Course Schedule.cpp
15-Is Graph Bipartite.cpp	15-Is Graph Bipartite.cpp
16-Detecting an Odd Length Cycle.cpp	16-Detecting an Odd Length Cycle.cpp
17-Detect Cycles in Grid.cpp	17-Detect Cycles in Grid.cpp
18-Shortest Cycle in Undirected Graph.cpp	18-Shortest Cycle in Undirected Graph.cpp
19-All Paths From Source to Target.cpp	19-All Paths From Source to Target.cpp
20-Course Schedule II.cpp	20-Course Schedule II.cpp
21-Largest Color Value in a Directed Graph.cpp	21-Largest Color Value in a Directed Graph.cpp
22-Game Routes.cpp	22-Game Routes.cpp
23-Disjoint Set Union.cpp	23-Disjoint Set Union.cpp
24-Forest Detection.cpp	24-Forest Detection.cpp
25-Useless Connection.cpp	25-Useless Connection.cpp
26-Communication Between Towers.cpp	26-Communication Between Towers.cpp
27-Make Network Connected.cpp	27-Make Network Connected.cpp
28-Special Paths.cpp	28-Special Paths.cpp
29-Minimum Spanning Cost.cpp	29-Minimum Spanning Cost.cpp
30-Connect All.cpp	30-Connect All.cpp
31-Remove Maximum Number of Edges.cpp	31-Remove Maximum Number of Edges.cpp
32-Build Roads.cpp	32-Build Roads.cpp
33-Find Critical and Pseudo-Critical Edges in MST.cpp	33-Find Critical and Pseudo-Critical Edges in MST.cpp
34-Dijkstra.cpp	34-Dijkstra.cpp
35-Delay Time in Network.cpp	35-Delay Time in Network.cpp
36-Shortest Grid Path.cpp	36-Shortest Grid Path.cpp
37-Cheapest Flight Within K Stops.cpp	37-Cheapest Flight Within K Stops.cpp
38-City With the Smallest Number of Neighbours at a Threshold Distance.cpp	38-City With the Smallest Number of Neighbours at a Threshold Distance.cpp
39-Travel by Car.cpp	39-Travel by Car.cpp
40-Shortest Superstring.cpp	40-Shortest Superstring.cpp
41-Number of Islands.cpp	41-Number of Islands.cpp
42-Flood Fill.cpp	42-Flood Fill.cpp
43-Number of Closed Islands.cpp	43-Number of Closed Islands.cpp
44-Border Coloring.cpp	44-Border Coloring.cpp
45-Make Largest Island.cpp	45-Make Largest Island.cpp
46-Rotting Oranges.cpp	46-Rotting Oranges.cpp
47-Shortest Bridge.cpp	47-Shortest Bridge.cpp
48-Highest Peak.cpp	48-Highest Peak.cpp
49-Minimum Height Trees.cpp	49-Minimum Height Trees.cpp
50-Minimum Cost to Make Valid Path in a Grid.cpp	50-Minimum Cost to Make Valid Path in a Grid.cpp
51-Bob and Destructive Mind.cpp	51-Bob and Destructive Mind.cpp
52-Fault in a Network.cpp	52-Fault in a Network.cpp
53-Connected Cities.cpp	53-Connected Cities.cpp
54-GCD on Directed Path.cpp	54-GCD on Directed Path.cpp
55-Subtree Problem.cpp	55-Subtree Problem.cpp
56-Path on Tree.cpp	56-Path on Tree.cpp
57-Cut'em All!.cpp	57-Cut'em All!.cpp
58-Tree Diameter.cpp	58-Tree Diameter.cpp
59-Tree Distances.cpp	59-Tree Distances.cpp
60-Path Queries.cpp	60-Path Queries.cpp
61-Subtree Queries.cpp	61-Subtree Queries.cpp
62-Tree Queries.cpp	62-Tree Queries.cpp
63-Count Descendants.cpp	63-Count Descendants.cpp
64-New Year Tree.cpp	64-New Year Tree.cpp
65-Lowest Common Ancestor.cpp	65-Lowest Common Ancestor.cpp
66-Distance Queries.cpp	66-Distance Queries.cpp
67-Path Xor.cpp	67-Path Xor.cpp
68-A maximum Path.cpp	68-A maximum Path.cpp
69-Xor Distances.cpp	69-Xor Distances.cpp
70-Distance Sum.cpp	70-Distance Sum.cpp
71-Maximum White Subtree.cpp	71-Maximum White Subtree.cpp
72-Choosing Capital for Treeland.cpp	72-Choosing Capital for Treeland.cpp
73-Distance in tree.cpp	73-Distance in tree.cpp
74-Tree with Maximum Cost.cpp	74-Tree with Maximum Cost.cpp
75-Maximum Students Taking Exam.cpp	75-Maximum Students Taking Exam.cpp
76-Download Speed.cpp	76-Download Speed.cpp
77-Count Pair of Nodes.cpp	77-Count Pair of Nodes.cpp
78-Longest Increasing Path.cpp	78-Longest Increasing Path.cpp
79-Holiday Accommodation.cpp	79-Holiday Accommodation.cpp
80-Distinct Colors.cpp	80-Distinct Colors.cpp
README.md	README.md

Name

Last commit message

Last commit date

1 Commit

01-Find Center of Star Graph.cpp

02-Maximal Network Rank.cpp

03-Minimum Degree of a Connected Trio in a Graph.cpp

04-Snakes and Ladder Game.cpp

05-Message Route.cpp

06-Word Ladder.cpp

07-Valid Bfs.cpp

08-Keys and Rooms.cpp