Course details

Competitive Programming - Advanced

A brief summary

If you want to improve your algorithmic problem solving skill and improve in National contests and Codeforces contests, you should enroll in this course. We will conduct the course in a suitable way for the students who can solve beginner level problems. After completing this course, you should be able to cope with medium level algorithmic and data-structure problems which can improve your ranking in programming contests.

Prerequisite

Basic Number Theory, Basic Graph Theory algorighms, Basic Data Structures and most of the topics which we cover in our Beginner course.

Course highlight

  • Learn to solve advanced level problems
  • Focus on various type of problems
  • This can help you to achive better rank in programming contests
  • You will learn how to write clean and bug free codes

What you will learn

At the end of the course, you should be able to touch Codeforces div2 D, E problems. You will also have clear idea of what to learn next for upgrading your level.


01

Searching Algorithms

Binary Search and Ternary Search

02

Data Structures

Disjoint Set Union, STL, Complexity

03

Data Structures

Basic Segment Tree, Lazy Propagation

04

Data Structures

Advanced Segment Tree problems

05

Graph Theory

Dijkstra, Bellman Ford, Floyd Warshall, MST

06

Graph Theory

Articulation Point / Bridges, Biconnected Components, Strongly Connected Components

07

Network Flows

Maximum Flow

08

Network Flows

Bipartite Matching

09

Dynamic Programming

DP with Bitmask

10

Dynamic Programming

Common DP Techniques, Iterative DP

11

Dynamic Programming

Discussion on advanced DP problems

12

Data Structures

Sparse Table, Lowest Common Ancestor

13

Data Structures

Hashing

14

Data Structures

Trie

15

Strings

KMP

16

Mathematics

Advanced Number Theory

17

Mathematics

Matrix exponentiation, Gaussian elimination


Next Batches

No upcoming batches available.
Back to top