Skip to content

Commit 4a9a8ee

Browse files
JawadSherJawadSher
authored
Create README.md
1 parent dec0498 commit 4a9a8ee

File tree

1 file changed

+48
-0
lines changed

1 file changed

+48
-0
lines changed

‎23 - Graph Data Structure Problems/README.md‎

Lines changed: 48 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,48 @@
1+
<h1 align='center'>GRAPH - DATA STRUCTURE - PROBLEMS</h1>
2+
3+
4+
This repository contains a comprehensive collection of data structure and algorithm (DSA) problems from both LeetCode and GeeksforGeeks (GFG). The problems are organized based on various topics, such as Graphs, Arrays, Dynamic Programming, Linked Lists, Trees, and more. Each problem is accompanied by detailed solutions, including the step-by-step explanation and code walkthroughs to help users grasp the underlying concepts.
5+
6+
The main objective of this repository is to serve as a resource for individuals preparing for technical interviews, improving their problem-solving skills, and gaining hands-on experience with common DSA problems. The repository provides links to the solutions available on LeetCode and GFG, making it a valuable reference for anyone looking to practice DSA problems across multiple platforms.
7+
8+
## Key Features:
9+
- **Structured Organization:** Problems are grouped by topics like Graphs, Arrays, Trees, Dynamic Programming, and more.
10+
- **Step-by-Step Solutions:** Each problem comes with a detailed explanation, code, and approach.
11+
- **LeetCode & GFG Links:** Direct links to the problems on LeetCode and GFG (where available).
12+
- **Interview Preparation:** Aiming to help users prepare for coding interviews, competitive programming, and academic learning.
13+
14+
## Repository Content
15+
16+
<p>
17+
<img src="https://img.shields.io/badge/problems%20count-01-orange?logo=leetcode" alt="LeetCode">
18+
<img src="https://img.shields.io/badge/problems%20count-14-darkgreen?logo=geeksforGeeks" alt="GeeksforGeeks">
19+
<img src="https://img.shields.io/badge/total%20problems%20count-20-blue" alt="Problem Count">
20+
</p>
21+
22+
23+
| No | Problem Name | Description | LeetCode | GFG |
24+
|----|--------------|-------------|----------|-----|
25+
| 01 | [Example](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/01%20-%20Example) | A basic example problem demonstrating the use of Graphs. | Non | Non |
26+
| 02 | [BFS Traversal in Graph](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/02%20-%20BFS%20Traversal%20in%20Graph) | Perform Breadth-First Search traversal in a graph. | Non | Non |
27+
| 03 | [DFS Traversal in Graph](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/03%20-%20DFS%20Traversal%20in%20Graph) | Perform Depth-First Search traversal in a graph. | Non | Non |
28+
| 04 | [Print Adjacency List](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/04%20-%20Print%20Adjacency%20List) | Print the adjacency list of a graph. | Non | [Link](https://www.geeksforgeeks.org/problems/print-adjacency-list-1587115620/1) |
29+
| 05 | [BFS of Graph](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/05%20-%20BFS%20of%20Graph) | Implement BFS to traverse a graph. | Non | [Link](https://www.geeksforgeeks.org/problems/bfs-traversal-of-graph/1) |
30+
| 06 | [DFS of Graph](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/06%20-%20DFS%20of%20Graph) | Implement DFS to traverse a graph. | Non | [Link](https://www.geeksforgeeks.org/problems/depth-first-traversal-for-a-graph/1) |
31+
| 07 | [Undirected Graph Cycle - BFS - DFS](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/07%20-%20Undirected%20Graph%20Cycle%20%7C%20BFS%20-%20DFS) | Detect cycles in an undirected graph using BFS and DFS. | Non | [Link](https://www.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1) |
32+
| 08 | [Cycle Detection in Directed Graphs](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/08%20-%20Cycle%20Detection%20in%20Directed%20Graphs) | Detect cycles in a directed graph. | Non | [Link](https://www.geeksforgeeks.org/problems/detect-cycle-in-a-directed-graph/1) |
33+
| 09 | [Topological Sort using DFS](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/09%20-%20Topological%20Sort%20using%20DFS) | Perform topological sort using DFS. | Non | [Link](https://www.geeksforgeeks.org/topological-sorting/) |
34+
| 10 | [Topological Sort using Kahn's Algorithm](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/10%20-%20Topological%20Sort%20using%20Kahn's%20Algorithm) | Perform topological sort using Kahn's Algorithm. | Non | Non |
35+
| 11 | [Shortest Path in Undirected Graph](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/11%20-%20Shortest%20Path%20in%20Undirected%20Graph) | Find the shortest path in an undirected graph. | Non | [Link](https://www.geeksforgeeks.org/problems/shortest-path-in-undirected-graph-having-unit-distance/1) |
36+
| 12 | [Shortest path in Directed Acyclic Graph](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/12%20-%20Shortest%20path%20in%20Directed%20Acyclic%20Graph) | Find the shortest path in a directed acyclic graph. | Non | [Link](https://www.geeksforgeeks.org/problems/shortest-path-in-undirected-graph/0) |
37+
| 13 | [Shortest Path in Undirected Graph - Dijkstra's Algorithm](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/13%20-%20Shortest%20Path%20in%20Undirected%20Graph%20%7C%20Dijkstra's%20Algorithm) | Implement Dijkstra's Algorithm to find the shortest path in an undirected graph. | Non | Non |
38+
| 14 | [Minimum Spanning Tree Prim's Algorithm](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/14%20-%20Minimum%20Spanning%20Tree%20%7C%20Prim's%20Algorithm) | Implement Prim's Algorithm to find the minimum spanning tree. | Non | [Link](https://www.geeksforgeeks.org/problems/minimum-spanning-tree/1) |
39+
| 15 | [Minimum Spanning Tree Kruskal's Algorithm - Disjoint Set - Union by Rank and Path Compression](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/15%20-%20Minimum%20Spanning%20Tree%20%7C%20Kruskal's%20Algorithm%20%7C%20Disjoint%20Set%20%7C%20Union%20by%20Rank%20and%20Path%20Compression) | Implement Kruskal's Algorithm with disjoint set, union by rank, and path compression to find the minimum spanning tree. | Non | [Link](https://www.geeksforgeeks.org/problems/minimum-spanning-tree/1) |
40+
| 16 | [Bridge Edge in a Graph](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/16%20-%20Bridge%20Edge%20in%20a%20Graph) | Find bridge edges in a graph. | Non | [Link](https://www.geeksforgeeks.org/problems/bridge-edge-in-graph/1) |
41+
| 17 | [Critical Connections in a Network](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/17%20-%20Critical%20Connections%20in%20a%20Network) | Identify critical connections in a network. | [Link](https://leetcode.com/problems/critical-connections-in-a-network/) | Non |
42+
| 18 | [Articulation Point in Graph](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/18%20-%20Articulation%20Point%20in%20Graph) | Find articulation points in a graph. | Non | [Link](https://www.geeksforgeeks.org/problems/articulation-point-1/1) |
43+
| 19 | [Strongly Connected Components - Kosaraju's Algorithm](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/19%20-%20Strongly%20Connected%20Components%20%7C%20Kosaraju's%20Algorithm) | Find strongly connected components using Kosaraju's Algorithm. | Non | [Link](https://www.geeksforgeeks.org/problems/strongly-connected-components-kosarajus-algo/1) |
44+
| 20 | [Shortest Path in Directed & Undirected Graph - Bellman Ford Algorithm](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/23%20-%20Graph%20Data%20Structure%20Problems/20%20-%20Shortest%20Path%20in%20Directed%20&%20Undirected%20Graph%20%7C%20Bellman%20Ford%20Algorithm) | Implement Bellman-Ford Algorithm to find the shortest path in directed and undirected graphs. | Non | [Link](https://www.geeksforgeeks.org/problems/distance-from-the-source-bellman-ford-algorithm/1?itm_source=geeksforgeeks&itm_medium=article&itm_campaign=practice_card) |
45+
46+
47+
---
48+
Happy Coding! 😊

0 commit comments

Comments
 (0)