Scribd
Upload
5 views

Batch-5 Competitive Programming Complete Course

The Competitive Programming Complete Course offers over 100 live classes, programming contests, and 1000+ practice problems, starting from April 24, 2025, with an admission period from March 1 to April 15, 2025. The course covers a wide range of topics from basic programming to advanced algorithms and data structures, with no prerequisites required for enrollment. It includes features such as industry-specific interview guidelines, problem-solving help, and access to recorded classes for one year.

Uploaded by

souvik23440
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

Batch-5 Competitive Programming Complete Course

The Competitive Programming Complete Course offers over 100 live classes, programming contests, and 1000+ practice problems, starting from April 24, 2025, with an admission period from March 1 to April 15, 2025. The course covers a wide range of topics from basic programming to advanced algorithms and data structures, with no prerequisites required for enrollment. It includes features such as industry-specific interview guidelines, problem-solving help, and access to recorded classes for one year.

Uploaded by

souvik23440
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

In the Name of ALLAH

Competitive Programming Complete Course: Basic to Intermediate Level

Batch-5 (No prerequisites required)

| 100+ Live Classes | 100+ Programming Contests | 1000+ Problems |

💰
| Job Interview Guidelines |​
Fee: 4000/- Only

📝 Admission Period: March 1st – April 15th​


📅
April 15th (After this date, enrollment will officially be closed)​
Class Starts: April 24th, Thursday, 2025 (InShaALLAH)

Who can take this course?​


Anyone can enroll in this course, whether you are a CS student or a non-CS student, a
first-year student, or a job seeker. No prerequisites are required.

What are the features of the course?

●​ 100+ live classes


●​ 100+ programming contests (topic-wise marathon + Codeforces speed contests)
●​ 1000+ practice problems (video solutions will be provided)
●​ 70+ topics
●​ Industry-specific interview guideline classes
●​ Problem understanding and code debugging help on Discord
●​ Guidelines and Codeforces profile review
●​ CV review
●​ 1 year of live classes (4 years of course access and guidelines)
●​ Topic-wise marathon/long contests
●​ Weekly Codeforces speed contests
●​ Videos of each live class will be provided within 1 day
●​ Topics will be discussed based on problem-solving
●​ A complete recorded course will be provided for free
●​ The course is divided into 5 modules, including an STL series
Course Structure

Module 1: Basic Programming and Problem-Solving Techniques

📌 30 Classes | 12 Topics | 300+ Practice Problems | 10+ Topic-wise Marathon/Long


Programming Contests

Topics Covered:

●​ Basic I/O, Datatypes, 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

C++ STL

📌 8 Classes | 10 Topics | 100+ Practice Problems | 3+ Topic-wise Marathon/Long


Programming Contests

Topics Covered:

●​ Vector, String, Map, Pair


●​ Set, Multiset, Queue
●​ Priority Queue, Deque
●​ Programming Contest Template with Debugger
Module 2: Basic Algorithms and Data Structures

📌 25 Classes | 16 Topics | 200+ Practice Problems | 8+ Topic-wise Marathon/Long


Programming Contests

Topics Covered:

●​ 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 3: Basic Number Theory

📌 10 Classes | 8 Topics | 100+ Practice Problems | 5+ Topic-wise Marathon/Long


Programming Contests

Topics Covered:

●​ Harmony Series
●​ Prime Generation (Sieve of Eratosthenes)
●​ Prime Factorization
●​ Number of Divisors and Sum of Divisors
●​ Euler Phi Function
●​ Modular Arithmetic
●​ Fermat's Little Theorem
Module 4: Basic Graph Theory and Dynamic Programming

📌 15 Classes | 12 Topics | 100+ Practice Problems | 5+ Topic-wise Marathon/Long


Programming Contests

Topics Covered:

●​ 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: Intermediate Graph Theory, Dynamic Programming, and


Segment Tree

📌 30 Classes | 12 Topics | 200+ Practice Problems | 10+ Topic-wise Marathon/Long


Programming Contests

Topics Covered:

●​ 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

You might also like