Tree and Graphs
- Tree BFS, Tree DFS (Related Problems: Problem 1, Problem 2, Problem 3)
- Graph BFS, Graph BFS 2, Graph DFS (Related Problems: Problem 1, Problem 2)
- Dijkstra’s Shortest Path Algorithm(Related Problems: Problem 1, Problem 2)
- Bellman – Ford Algorithm(Related Problem)
- Floyd Warshall Algorithm(Related Problem)
- 0-1 BFS, Dial’s Algorithm
- Detect cycle: Directed, Undirected(Related Problems: Problem 1, Problem 2)
- Disjoint set(union-find): Set 1, Set 2, Set 3(Related Problem)
- Topological Sorting, Kahn’s Algorithm(Related Problem)
- Minimum Spanning Tree: Prim’s Algorithm, Kruskal Algorithm(Related Problem)
- Bipartite or not, M-Coloring(Related Problems: Problem 1, Problem 2, Problem 3)
- Strongly Connected Components: Tarjan, Kosaraju(Related Problems: Problem 1, Problem 2)
- Euler Path: Undirected, Directed(Related Problem)
- Flow Algorithms: Set 1, Set 2, Dinic’s Algorithm(Related Problems: Problem 1, Problem 2)
- Diameter of Tree
- Centroid Decomposition
- Lowest Common Ancestor
- Top 50 Tree Coding Problems for Interviews
Competitive Programming – A Complete GuideWhy Should You Do Competitive Programming?
Competitive Programming is a mental sport that enables you to code a given problem under provided constraints. The purpose of this article is to guide every individual possessing a desire to excel in this sport. This article provides a detailed syllabus for Competitive Programming designed by industry experts to boost the preparation of the readers.
Related Course
Competitive Programming – Live Course
Get ready to level up your programming skills with this Competitive Programming – Live Course. Learn the Fundamentals of programming, DSA, Mathematical algorithms, and much more. So, why wait? Dive into the world of Programming by enrolling in this course today!
Table of Content
- What is Competitive Programming?
- Basics of Competitive Programming
- Basics Of Array , String, Greedy and Bit Manipulation
- Number Theory and Combinatorics
- Searching, Sorting and Basic Data Structures
- Tree and Graphs
- Recursion and Dynamic Programming
- String Algorithms
- Geometry and Game Theory
- Advance Data Structures