Description
In this course we teach you how to be more focused on the task and not only complete it quickly, but accurately. These skills are highly beneficial for any job, not just in coding.
Course Curriculum
Basics Of Competitive Coding
- Programming Fundamentals
- Introduction
- Various type of errors
- Basics of Recursion
- Time Complexity
- Space Complexity
- Language Tools
- STL
- Sorting and Searching Applications
- Binary Search Applications
Recursion
- Backtracking
- Recursion 2
- Recursion Applications
- Bit Manipulation
- Applications of Bit Manipulation
- Greedy problems
- Greedy Mathematics
Modulo Arithmetic
- Applications of Modulo Operations
- Dynamic Programming-1
- Dynamic Programming-2
- DP plus Maths problems
- Segment Tree with Lazy Propagation
- Applications of Segment Tree
Graphs
- Graphs 1
- Graphs 2
- DFS/BFS
- String Processing
- Bitmasking
- Searching Operations
- DP with Bitmasking
- Game Theory
Number Theory
- Number Theory-1
- Number Theory-2
- Number Theory-3 and Maths
- Applications of Number Theory
- Computational Geometry
- Applications of Computational Geometry
Fenwick Tree
- Introduction
- Applications of Fenwick Tree
- Mixed problems (DP, Graphs etc)
- Heavy Light Decomposition
- Fast Fourier Transform
Structure your learning and get a certificate to prove it.