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.
  • Downloadable PDF books for Competitive Programming and Mathematics.
  • At last – Freely available to all and all can Contribute.

Recent Competitive Programming Articles

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 ...
Read More

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 ...
Read More

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 ...
Read More

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 ...
Read More

Prim’s Algorithm to find Minimum Spanning Trees

Things to be discussed here. Prim's Algorithms Practice Problem The prerequisite for this article is "Introduction to Minimum Spanning Tree ...
Read More

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, ...
Read More

REference Books

Introduction to algorithm

Introduction to Algorithms


Elementary Number Threory

How to program in C++

C++ | How to Program


Guide to Competitive Programming

Sign up for our weekly Mailing list.

* indicates required