New batches start 11 August 2026. Enrol now →
Maruti AI Technology Enrol now

← Programming & Computer Science Foundations

Programming & Computer Science Foundations

Competitive Programming

Sharpen your competitive programming edge with STL, graphs, and dynamic programming

Go beyond basic DSA into contest-ready problem solving with the Standard Template Library, bit manipulation, and modulo arithmetic. You'll work through graphs, segment trees, backtracking, greedy algorithms, and dynamic programming, all in C++, building toward the advanced concepts that separate strong coders from the rest.

39h
of content
9
modules
126
lessons
Fees from
₹4,500

per level · 3 levels · complete programme ₹18,500

Duration
5 mo
Enrol now Talk to us first

Fees by level

Start at any level, or take the complete programme. The fee you pay for a level is locked for you.

LevelWhat it coversDurationFee
Beginner Start from zero 1 mo ₹4,500
Intermediate Build working projects 2 mo ₹6,000
Advanced Get job-ready 2 mo ₹8,000
Complete programme (all levels) ₹18,500

All fees are in Indian Rupees and include applicable taxes. See our pricing & payment terms.

The complete curriculum

This is the entire syllabus — all 9 modules and 126 lessons, in the order you'll learn them. Nothing hidden.

↓ Download full curriculum (PDF)
01 Introduction to Competitive Programming 13 lessons ▶
  1. 1.1Introduction to the Course
  2. 1.2What is Competitive Programming
  3. 1.3Competitive Programming Competitions
  4. 1.4Websites for Competitive Programming
  5. 1.5Terminologies in Competitive Programming
  6. 1.6Choosing a Programming Language
  7. 1.7Taking Input & Output in Competitive Programming Contests
  8. 1.8Cout vs Printf
  9. 1.9Endl vs Back n
  10. 1.10Fast cin cout Methods _ Conclusion
  11. 1.11Time Complexity in Competitive Programming
  12. 1.12Calculating Time Complexity of Code
  13. 1.13Importance of English in Competitive Programming
02 Standard Template Library (STL) 17 lessons ▶
  1. 2.1Introduction to STL in C++
  2. 2.2Standard Array
  3. 2.3Standard Vector
  4. 2.4Standard Set
  5. 2.5Standard Multiset
  6. 2.6Standard Map
  7. 2.7Standard Multimap
  8. 2.8Standard Pair
  9. 2.9Standard Forward List
  10. 2.10Standard List
  11. 2.11Standard Unordered Set
  12. 2.12Standard Unordered Multiset
  13. 2.13Unordered Map and Unordered Multimap
  14. 2.14Standard Stack
  15. 2.15Standard Queue
  16. 2.16Standard Priority Queue
  17. 2.17Standard Deque
03 Bit Manipulation and Modulo Arithmetic 12 lessons ▶
  1. 3.1Importance of Bit Manipulation Techniques
  2. 3.2Basic Binary Operations
  3. 3.3Bit Operations in C++
  4. 3.4Check ith bit is SET or NOT SET
  5. 3.5Toggle ith bit
  6. 3.6Check odd or even using bits
  7. 3.7Check if Number is Power of 2
  8. 3.8Need for Modulo 10^9 + 7
  9. 3.9Modulo Arithmetic
  10. 3.10[A3.1] Problem XOR ORED
  11. 3.11[A3.2] Solution - XOR-ORED
  12. 3.12[A3.3] Solution with Code - XOR-ORED
04 Graphs 17 lessons ▶
  1. 4.1Introduction to Graphs
  2. 4.2Weights in Graphs
  3. 4.3Why Study Graphs
  4. 4.4Edge List
  5. 4.5Adjacenty Matrix
  6. 4.6Adjacenty List
  7. 4.7DFS Traversal
  8. 4.8Implementing DFS Traversal
  9. 4.9BFS Traversal
  10. 4.10Implementing BFS Traversal
  11. 4.11Minimum Spanning Tree
  12. 4.12Concept of Kruskal_s Algorithm
  13. 4.13Concept of Prim_s Algorithm
  14. 4.14Concept of Dijkstra Algorithm
  15. 4.15[A4.1] Problem - CHFPLN
  16. 4.16[A4.2] Solution - CHFPLN
  17. 4.17[A4.3] Solution with Code - CHFPLN
05 Segment Trees 19 lessons ▶
  1. 5.1Sum of Updated Range Problem
  2. 5.2Solving Sum of Range Problem with Segment Trees
  3. 5.3Segment Trees - Update Queries
  4. 5.4Segment Trees - Calculate Sum
  5. 5.5Implementing Segment Tree - Part 1
  6. 5.6Implementing Segment Tree - Part 2
  7. 5.7Problem - Range Minimum Query
  8. 5.8Implementing Range Minimum Query
  9. 5.9Implementing Segment Tree - Tricks
  10. 5.10Lazy Propagation in Segment Trees - Part 1
  11. 5.11Lazy Propagation in Segment Trees - Part 2
  12. 5.12Implementing Lazy Propagation in Segment Trees - Part 1
  13. 5.13Implementing Lazy Propagation in Segment Trees - Part 2
  14. 5.14Problem - Xenia and Bit Operations
  15. 5.15Solution - Xenia and Bit Operations
  16. 5.16Solution with Code - Xenia and Bit Operations
  17. 5.17Problem - Circular RMQ
  18. 5.18Solution with Code - Circular RMQ - Part 1
  19. 5.19Solution with Code - Circular RMQ - Part 2
06 Backtracking 11 lessons ▶
  1. 6.1Introduction to Backtracking
  2. 6.2N Queens Problem Explained
  3. 6.3N Queens Solved
  4. 6.4Knights Tour Problem Explained
  5. 6.5Knight's Tour Solved
  6. 6.6Rat in Maze Problem Explained
  7. 6.7Rat in Maze Solved
  8. 6.8Problem Richie Rich
  9. 6.9Solving Richie Rich
  10. 6.10Problem False Number
  11. 6.11Solving False Number
07 Greedy Algorithms 12 lessons ▶
  1. 7.1Introduction to Greedy Algorithms
  2. 7.2Understanding Greedy with Fractional Knapsack Problem
  3. 7.3Solving Fractional Knapsack Problem
  4. 7.4Tasks and Deadlines Problem
  5. 7.5Solving Tasks and Deadlines Problem
  6. 7.6Optimal File Merging Problem
  7. 7.7Solving Optimal File Merge Patterns Problem
  8. 7.8Huffman Coding
  9. 7.9[A7.1] Problem - Dragons
  10. 7.10[A7.2] Solution with Code - Dragons
  11. 7.11[A7.3] Problem - Little Elephant and Bits
  12. 7.12[A7.4] Solution with Code - Little Elephant and Bits
08 Dynamic Programming 14 lessons ▶
  1. 8.1Introduction to Dynamic Programming
  2. 8.2Top down vs Bottom Up
  3. 8.3Fibbonacci Problem Top Down
  4. 8.4Implementing Fibonnaci with DP
  5. 8.52D Grid Traversal Problem
  6. 8.6Implementing 2D Grid Traversal Problem
  7. 8.7Understanding Memoization
  8. 8.8Fibbonacci with Tabulation
  9. 8.9Implementing Fibbonacci with Tabulation
  10. 8.102D Grid Traversal Problem with Tabulation
  11. 8.11Implementing 2D Grid Traversal Problem with Tabulation
  12. 8.12Understanding Tabulation
  13. 8.13[A8.1] Problem - Subset Sum Problem
  14. 8.14[A8.2] Solving - Subset Sum Problem
09 Advanced Concepts 11 lessons ▶
  1. 9.1Binary Lifting (Kth Ancestor of a Tree Node)
  2. 9.2LCA (Lowest Common Ancestor) Problem
  3. 9.3Fenwick Trees - Introduction
  4. 9.4Fenwick Trees - Sum of Range (Range Find Query)
  5. 9.5Fenwick Trees - Update (Point Update Query)
  6. 9.6Problem - Distance between nodes in Trees
  7. 9.7Solution - Distance between nodes in Trees
  8. 9.8Implementing Fenwick Trees
  9. 9.9Implementing Binary Uplifting
  10. 9.10Implementing LCA
  11. 9.11Solution with Code - Distance between nodes in Trees

Tools you'll use

C++

Every course includes

Live, instructor-led classes Course materials & lab access Doubt-clearing sessions Final assessment + one free re-attempt Verifiable certificate

How certification works

Related courses

Programming & Computer Science Foundations

C++

Master C++ fundamentals — OOP, STL, and file streams — with hands-on practice

from ₹2,200· 3 levels
4 mo
Programming & Computer Science Foundations

DBMS

Database fundamentals through Oracle SQL, PL/SQL, and transaction management

from ₹3,000· 3 levels
4 mo
Programming & Computer Science Foundations

DSA with C++

Data structures and algorithms in C++ — from arrays and linked lists to AVL trees

from ₹4,000· 3 levels
5 mo