Overview
The online Competitive Programming course by TechElite India is an ultimate online competitive coding training. With an aim to leverage and optimize the problem-solving skills of the young programmers, the course structure of this 3 Months long online course is most extensively crafted to ensure their swift sail through the online coding challenges and code-athons.

These online coding classes will cover concepts of Advanced Data Structures such as Segment Trees, Binary Index / Fenwick Trees. The students will be taught to construct algorithms involving Dynamic Programming, Bitmasking, Greedy Algorithms, and Divide & Conquer along with the essentials of advanced competitive programming topics. A good knowledge of basics (like sorting, searching, recursion ), data-structures and space-time complexity analysis on problems will definitely ensure nifty learning. Along with 24x7 doubt clearing support to your aid, anyone on a binge to master the competitive coding tricks and techniques has absolutely no looking back!

This course is a complete guide to master the SDIs. It is created by hiring managers who’ve been working at Google, Facebook, Microsoft, and Amazon. We've carefully chosen a set of questions that have not only been repeatedly asked at top companies, but also provide a thorough experience to handle any Competitive Programming problem.

Let’s get started!
Course Content
Basics for Competitive Programming
  • Intro to CP
  • Time Complexity
  • Basic Concepts
  • Searching
  • Sorting
  • CP Basic Techniques
Key Concepts
  • Prefix Sum
  • Binary Search
  • Euler totient Function
  • Prime Numbers
Step By Step Approach to Solving
  • Binary Exponentiation
  • LDE Approach
  • Sieve of Erastothenes
  • Segmented Seive
  • Wilson's Theorem
  • Modular Arithmetic
  • Combinatorics
Advanced DS Algo
  • Bit Manipulation
  • Recursion
  • Back-Tracking
  • Divide and Conquer
  • Stacks
  • Queues
  • Priority Queues
  • Hashing
  • Greedy Algorithms
  • String Matching Algorithms
  • Trees
  • Graphs
Most Important Topics
  • Dynamic Programming- 1 (Basic Medium DP)
  • Dynamic Programming- 2 (Hard DP, Bitmask DP)
  • Disjoint Sets
  • Sparse Table
  • Sparse Matrices
Interview Specific Topics
  • FenWick Trees
  • Binary Indexed Trees
  • Segment Trees
  • Sqrt Root Decomposition
  • Mo's Algorithm
Pricing
COMPETITIVE
PROGRAMMING

ON DEMAND

₨ 11999
Duration: 3 Months