Competitive Programming Live Classes for Students

View Details

Skip to content

- Tutorials
- Practice DS & Algo.
- Algorithms
- Analysis of Algorithms
- Asymptotic Analysis
- Worst, Average and Best Cases
- Asymptotic Notations
- Little o and little omega notations
- Lower and Upper Bound Theory
- Analysis of Loops
- Solving Recurrences
- Amortized Analysis
- What does 'Space Complexity' mean ?
- Pseudo-polynomial Algorithms
- Polynomial Time Approximation Scheme
- A Time Complexity Question

- Searching Algorithms
- Sorting Algorithms
- Graph Algorithms
- Pattern Searching
- Geometric Algorithms
- Mathematical
- Bitwise Algorithms
- Randomized Algorithms
- Greedy Algorithms
- Dynamic Programming
- Divide and Conquer
- Backtracking
- Branch and Bound
- All Algorithms

- Analysis of Algorithms
- Data Structures
- Interview Corner
- Languages
- CS Subjects
- GATE
- Web Technologies
- Software Designs
- School Learning
- School Programming
- Mathematics
- Maths Notes (Class 8-12)
- NCERT Solutions
- RD Sharma Solutions
- Physics Notes (Class 8-11)

- ISRO CS
- UGC NET CS

- Student
- Jobs
- Courses

**Multi Source Shortest Path in Unweighted Graph**- Shortest path in an unweighted graph
- Kruskal’s Minimum Spanning Tree Algorithm | Greedy Algo-2
- Prim’s Minimum Spanning Tree (MST) | Greedy Algo-5
- Prim’s MST for Adjacency List Representation | Greedy Algo-6
- Dijkstra’s shortest path algorithm | Greedy Algo-7
- Dijkstra’s Algorithm for Adjacency List Representation | Greedy Algo-8
- Dijkstra’s shortest path algorithm using set in STL
- Dijkstra’s Shortest Path Algorithm using priority_queue of STL
- Dijkstra’s shortest path algorithm in Java using PriorityQueue
- Java Program for Dijkstra’s shortest path algorithm | Greedy Algo-7
- Java Program for Dijkstra’s Algorithm with Path Printing
- Printing Paths in Dijkstra’s Shortest Path Algorithm
- Shortest Path in a weighted Graph where weight of an edge is 1 or 2
- N Queen Problem | Backtracking-3
- Printing all solutions in N-Queen Problem
- Warnsdorff’s algorithm for Knight’s tour problem
- The Knight’s tour problem | Backtracking-1
- Rat in a Maze | Backtracking-2
- Count number of ways to reach destination in a Maze
- Count all possible paths from top left to bottom right of a mXn matrix
- Print all possible paths from top left to bottom right of a mXn matrix
- Unique paths in a Grid with Obstacles
- Unique paths covering every non-obstacle block exactly once in a grid
- Depth First Search or DFS for a Graph
- Top 50 Array Coding Problems for Interviews
- Recursion
- Difference between BFS and DFS
- A* Search Algorithm
- How to write a Pseudo Code?

Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.