## What we have here for you?

• Unified Place for studying Data Structure, Algorithms, and Maths for Competitive Programming and College Interview.
• Collected video resources from YouTube and our own written tutorial and selected practice problems from Codeforces, CodeChef, AtCoder, HackerEarth, HackerRank, etc.
• At last – Freely available to all and all can Contribute.

## Introduction to Strongly connected components and how to find them using Kosaraju’s Algorithm

Things we will discuss Introduction Strongly Connected Components Kosaraju's algorithm to compute strongly connected components in a directed graph Practice ...

## Successor Graphs and Cycle Detection using Floyd’s Algorithm

Things to be discussed here, Successor Graphs Cycle Detection in Successor Graphs Floyd's Algorithm Practice Problems Successor Graphs Successor Graphs ...

## Acyclic Graph Problem Solving using Dynamic Programming

In this article, we will be solving some of the Classic Problem from the Acyclic Graph which requires the Dynamic ...

## Introduction to Directed Graph and Topological Sorting in Graph

Things to be discussed here, Directed Graph Topological Sorting Application of Topological Sorting Algorithm to find Topological Order Implementation in ...

## Introduction to Minimum Spanning Tree and How to find them using Kruskal’s Algorithm

Things to be discussed here. Spanning Tree Minimum Spanning Tree ( MST ) Kruskal's Algorithm Practice Problem Before discussing MST, ...

## REference Books

Introduction to Algorithms

Elementary Number Threory

C++ | How to Program

Guide to Competitive Programming