Enrollment Open

Master Competitive Programming

Basic to Intermediate Level - No prerequisite needed

4000/- Only

Message Our Facebook Page for Enrollment →
Course Highlights
Live Classes
100+
Programming Contests
100+
Practice Problems
1000+

Meet Your Trainers

Trainer 1

Rohit Negi

Senior Software Engineer, Uber

  • 🏅 ICPC Asia West Continent Finals, 2020
  • Founder of Coder Army
  • Indian Institue of Technology, Guwahati
  • Codeforces Master
  • Codechef 7 star

@rohitnegi9 (2183)

Trainer 2

Saiful Islam Nirob

Software Engineer, Cefalo

  • 🏅 ICPC Asia West Continent Finals, 2025
  • 🥇 ICPC Dhaka Regional Finalist, 2025
  • Prime University, Dhaka
  • Codeforces Expert
  • Codechef 5 star

@lsMorningstar (1757)

Trainer 3

Aditya Tandon

Co-Founder @ Coder Army

  • 🏅 ICPC Asia West Continent Finals, 2021
  • 🥇 ICPC kanpur Regional Finalist, 2022
  • Codeforces Candidate Master
  • Codechef 4 star
  • Leetcode Knight

@lsMorningstar (2183)

Our Students' Success

Codeforces Expert

40

Codeforces Specialist

69

Codeforces Pupil

106

BD Big Tech

15

Course Modules

Module 1: Programming Fundamentals

Module Overview

Classes: 30

Topics: 12

Practice Problems: 300+

Programming Contests: 10+

Key Topics

  • Basic I/O, Data Types, and Variables
  • Operations, Conditions, and Loops
  • Arrays and Strings
  • Complexity Analysis
  • Functions and Built-in Functions
  • Converting to C++
  • Brute Force and Greedy Algorithms
  • Constructive Algorithms
Module 2: C++ STL

Module Overview

Classes: 8

Topics: 10

Practice Problems: 100+

Programming Contests: 3+

Key Topics

  • Vector, String, Map, Pair
  • Set, Multiset, Queue
  • Priority Queue, Deque
  • Programming Contest Template with Debugger
Module 3: Basic Algorithms and Data Structures

Module Overview

Classes: 25

Topics: 16

Practice Problems: 200+

Programming Contests: 8+

Key Topics

  • Recursion and Basic Dynamic Programming
  • Merge Sort and Partial Sum
  • Contribution Technique
  • Binary Search (Basic, Upper Bound, Lower Bound, Integer & Fractional Bisection, Binary Search with Prefix Sum)
  • Policy-Based Data Structure (PBDS) (Basic PBDS, PBDS with Partial Sum and Contribution Technique)
  • Sliding Windows and Two-Pointer Technique
  • Structure and Structure Sorting
Module 4: Basic Graph Theory and Dynamic Programming

Module Overview

Classes: 15

Topics: 12

Practice Problems: 100+

Programming Contests: 5+

Key Topics

  • Graph and Tree Representations
  • Adjacency Matrix and Adjacency List
  • Depth-First Search (DFS) and Breadth-First Search (BFS)
  • Shortest Path on an Unweighted Graph
  • Bi-Coloring of a Bipartite Graph
  • Topological Sorting
  • Cycle Finding
  • 0-1 Knapsack and Coin Change
  • DP Solution Printing
  • Shortest Path in Graph
Module 5: Basic Number Theory

Module Overview

Classes: 10

Topics: 8

Practice Problems: 200+

Programming Contests: 5+

Key Topics

  • Harmony Series
  • Prime Generation (Sieve of Eratosthenes)
  • Prime Factorization
  • Number of Divisors and Sum of Divisors
  • Euler Phi Function
  • Modular Arithmetic
  • Brute Force and Greedy Algorithms
  • Fermat's Little Theorem
Module 6: Intermediate Graph Theory, Dynamic Programming and Segment Tree

Module Overview

Classes: 30

Topics: 12

Practice Problems: 200+

Programming Contests: 10+

Key Topics

  • Dijkstra's Algorithm
  • Bellman-Ford Algorithm
  • Floyd-Warshall Algorithm
  • Disjoint Set Union (DSU)
  • Minimum Spanning Tree (MST)
  • Longest Common Subsequence (LCS)
  • Longest Increasing Subsequence (LIS) (Using DP and Binary Search)
  • Bitmask DP and Digit DP
  • Segment Tree and Lazy Propagation
  • Merge Sort Tree

Course Details

Key Features

  • 100+ Live classes
  • 70+ Topics covered
  • 1 year of Live class access
  • Videos of each live class provided
  • Previous batch videos available
  • Topicwise marathon/long contests
  • Weekly codeforces speed contests

Course Structure

The course is divided into 6 modules:

  1. Basic Programming and Problem-Solving Techniques
  2. C++ STL
  3. Basic Algorithms and Data Structures
  4. Basic Graph Theory and Dynamic Programming
  5. Basic Number Theory
  6. Intermediate Graph Theory, Dynamic Programming, and Segment Tree

Who Can Enroll?

  • ✅ CS Student
  • ✅ 1st-Year Student
  • ✅ Non-CS Student
  • ✅ Job Seeker

No prerequisite is needed! 🚀

Important Dates

Course Start Date

InShaALLAH the classes will start from 18th October, 2025.

Enroll before 18th October, 2025 to get the course at a discounted price of 4000/- only!