Files

 main

/

Geeksforgeeks

/

Copy path

Directory actions

More options

Directory actions

More options

Latest commit

 

History

History

/

Geeksforgeeks

/

Top

Folders and files

Name		Name	Last commit message	Last commit date
parent directory ..
Alex Travelling using Bellman Ford.cpp		Alex Travelling using Bellman Ford.cpp
Alex Travelling using Dijkstra.cpp		Alex Travelling using Dijkstra.cpp
Alien Dictionary.cpp		Alien Dictionary.cpp
BFS of Graph.cpp		BFS of Graph.cpp
Bipartite Graph.cpp		Bipartite Graph.cpp
Cheapest Flights Within K Stops.cpp		Cheapest Flights Within K Stops.cpp
City With the Smallest Number of Neighbors at a Threshold Distance.cpp		City With the Smallest Number of Neighbors at a Threshold Distance.cpp
Connecting the graph.cpp		Connecting the graph.cpp
Course Schedule.cpp		Course Schedule.cpp
DFS of Graph.cpp		DFS of Graph.cpp
Detect cycle in a directed graph.cpp		Detect cycle in a directed graph.cpp
Detect cycle in an undirected graph BFS.cpp		Detect cycle in an undirected graph BFS.cpp
Detect cycle in an undirected graph DFS.cpp		Detect cycle in an undirected graph DFS.cpp
Disjoint set (Union-Find).cpp		Disjoint set (Union-Find).cpp
Distance from the Source (Bellman-Ford Algorithm).cpp		Distance from the Source (Bellman-Ford Algorithm).cpp
Distance of nearest cell having 1.cpp		Distance of nearest cell having 1.cpp
Eventual Safe States.cpp		Eventual Safe States.cpp
Find the number of islands using DFS.cpp		Find the number of islands using DFS.cpp
Flood fill Algorithm.cpp		Flood fill Algorithm.cpp
Floyd Warshall.cpp		Floyd Warshall.cpp
Implementing Dijkstra Algorithm using priority queue.cpp		Implementing Dijkstra Algorithm using priority queue.cpp
Implementing Dijkstra Algorithm using set.cpp		Implementing Dijkstra Algorithm using set.cpp
Minimum Multiplications to reach End.cpp		Minimum Multiplications to reach End.cpp
Minimum Spanning Tree using Kruskal Algorithm.cpp		Minimum Spanning Tree using Kruskal Algorithm.cpp
Minimum Spanning Tree using Prims Algorithm.cpp		Minimum Spanning Tree using Prims Algorithm.cpp
Number Of Enclaves.cpp		Number Of Enclaves.cpp
Number of Distinct Islands.cpp		Number of Distinct Islands.cpp
Number of Provinces using Disjoint Set.cpp		Number of Provinces using Disjoint Set.cpp
Number of Provinces.cpp		Number of Provinces.cpp
Number of Ways to Arrive at Destination.cpp		Number of Ways to Arrive at Destination.cpp
Path With Minimum Effort.cpp		Path With Minimum Effort.cpp
Print adjacency list.cpp		Print adjacency list.cpp
README.md		README.md
Replace O's with X's.cpp		Replace O's with X's.cpp
Rotten Oranges.cpp		Rotten Oranges.cpp
Shortest Distance in a Binary Maze.cpp		Shortest Distance in a Binary Maze.cpp
Strongly Connected Components (Kosaraju's Algo).cpp		Strongly Connected Components (Kosaraju's Algo).cpp
Topological sort.cpp		Topological sort.cpp
Word Ladder I.cpp		Word Ladder I.cpp
Word Ladder II.cpp		Word Ladder II.cpp
View all files

README.md

✔ Problems

SNo	Name	Difficulty	Question	Solution
1	BFS of Graph	Easy	view	view
2	DFS of Graph	Easy	view	view
3	Print adjacency list	Easy	view	view
4	Flood fill Algorithm	Medium	view	view
5	Rotten Oranges	Medium	view	view
6	Number of Distinct Islands	Medium	view	view
7	Bipartite Graph	Medium	view	view
8	Detect cycle in a directed graph	Medium	view	view
9	Detect cycle in an undirected graph BFS	Medium	view	view
10	Detect cycle in an undirected graph DFS	Medium	view	view
11	Distance of nearest cell having 1	Medium	view	view
12	Number of Enclaves	Medium	view	view
13	Number of Provinces	Medium	view	view
14	Replace O's with X's	Medium	view	view
15	Word Ladder I	Hard	view	view
16	Word Ladder II	Hard	view	view
17	Topological sort	Medium	view	view
18	Eventual Safe States	Medium	view	view
19	Course Schedule	Medium	view	view
20	Alien Dictionary	Hard	view	view
21	Shortest Distance in a Binary Maze	Medium	view	view
22	Path With Minimum Effort	Medium	view	view
23	Number of Ways to Arrive at Destination	Medium	view	view
24	Minimum Multiplications to reach End	Medium	view	view
25	Implementing Dijkstra Algorithm using set	Medium	view	view
26	Implementing Dijkstra Algorithm using priority queue	Medium	view	view
27	Cheapest Flights Within K Stops	Medium	view	view
28	Floyd Warshall	Medium	view	view
29	Minimum Spanning Tree using Prims Algorithm	Medium	view	view
30	Distance from the Source (Bellman-Ford Algorithm)	Medium	view	view
31	Find the number of islands using DFS	Medium	view	view
32	Alex Travelling using Bellman Ford	Medium	view	view
33	Alex Travelling using Dijkstra	Medium	view	view
34	Disjoint set (Union-Find)	Easy	view	view
35	Strongly Connected Components (Kosaraju's Algo)	Medium	view	view
36	Connecting the graph	Medium	view	view
37	Number of Provinces using Disjoint Set	Medium	view	view
38	Minimum Spanning Tree using Kruskal Algorithm	Medium	view	view
39	City With the Smallest Number of Neighbors at a Threshold Distance	Medium	view	view