Learn the art of writing the time and space efficient code and compete in code competitions worldwide.

C++ is one of the preferred languages for Competitive Programming because of its vast library like STL (Standard Template Library). C++ is faster than other programming languages in producing the results which are a plus for competitive coders.

- Understand concepts of data structures & algorithms
- Practice 300 coding problems
- Form the base for web development, mobile development or machine learning

- Make sure you are thorough with the concepts of trees, graphs and important algorithms
- Practice 300+ coding problems on platforms like CodeStudio, Leetcode etc.
- Take part in Codechef Long and short challenges. Read the code of the masters to understand their way of solving problems

- Strong GitHub profile
- Aptitude tricks and tips
- Mock Interviews to help prepare you
- Non-Tech Preparation like LinkedIn Profile, How to crack HR round

Basic

EMI Starts at: $38 per month*

Standard

With Data Structures & Algorithms

EMI Starts at: $65 per month*

Pro

With Mock Interviews & Placement Preparation

EMI Starts at: $92 per month*

Premium

With Data Structures & Algorithms

With Mock Interviews & Placement Preparation

EMI Starts at: $119 per month*

Premium Hirist Account

Dedicated Placement Cell with curated job openings

Introduction to Programming

Data Structures and Algorithms

Competitive Programming

Mock interview/Industry mentor guidance sessions

Workshops for building your resume and Linkedin/Github profiles

Curated interview problems

DSA based product companies Mock Test Series

21 Jun'21

$329/-

12 Jul'21

$230/-

Find more batch dates which suit your schedule __View more batches__

More reviews

Still unsure about the course?

Get a free counselling session from our experts

Call us on our toll free number

1800-123-3598

Best Investment Ever

who complete this course get jobs in tech roles

â‚¹ 10 lpa CTC

Average salary for college students

65x

course fees recovered within first year of new job

achieve career transition within 12 months of the program

â‚¹ 24 lpa CTC

Average salary for working professionals

60x

course fees recovered within first year of new job*

Meet the team that is invested in your success throughout your journey with us

Score at least 60% for lifetime access to Coding Ninjas placement cell and become eligible for FREE Premium Hirist Account labeled as Coding Ninjas Certified Expert

*Available in select plans only

Appreciation shown by our students for this course

#### Basics of Competitive Programming

8.5 hrsIntroduction to Competitive ProgrammingWhy Competitive Programming?, How To Approach A Problem In Contest, Various Types Of ErrorsBasics Of RecursionIntroduction to Recursion, Recursion and PMI, Fibonacci Number, Recursion and ArraysTime and Space Complexity AnalysisOrder Complexity Analysis, Theoretical Analysis, Linear Search time complexity, Insertion Sort time complexity, Selection Sort time complexity, Theoretical Analysis - Recursive Algorithms, Merge Sort Time complexity, Fibonacci Time Complexity Analysis, Space Complexity Analysis, Merge Sort Space Complexity Analysis, Fibonacci Space Complexity Analysis, Kadane's AlgorithmLanguage ToolsSTL - Data Structures, STL - Functions, Hussain Set, Voters List, Permutation & PalindromeSearching & Sorting ApplicationsAggressive Cows, Inversion Count#### Applications of Recursion

2.5 hrsAdvanced RecursionRecursion and Strings, Merge Sort Algorithm, Quick Sort Algorithm, Strings, Return Subsequences of a String, Return Keypad ApproachBacktrackingBacktracking ( N-Queen), N-Queen Code, Rat In A Maze code#### Bit Manipulation and Modulo Arithmetic

1.5 hrsBit ManipulationFlip ith bit, Check Odd-Even, Introduction & Shift Operators, Clear All Bits From LSB, Remaining Bitwise Operators, Check Power of 2, Check nth bitModulo ArithmeticModulo Operations, Modulo Properties, Modulo Operations - Continue, Number Of Balanced Binary Trees#### Dynamic Programming

6.5 hrsDynamic ProgrammingBasics Of Dynamic programming: Fibonacci Numbers, AlphaCode, Longest Increasing Subsequence, Coin Change And StairCase, Minimum Cost, Magic Grid, Maximum Sum Rectangle, Longest Common Subsequence, Knapsnack - Iterative, Subset SumGreedy ProblemsIntroduction To Greedy Techniques, Minimum Absolute Difference In Array, Nikunj And Donuts, Fractional Knapsack, Weighted Job SchedulingDP & BitmaskingDP With Bitmasking, What is Bit Masking?, Minimum Cost for Jobs, Mehta and Bank Robbery#### Range Queries

4 hrsSegment TreeIntroduction to Segment Tree, Update On A Segment Tree, Size Of Segment Tree, Sum Of Squares Video, Maximum Sum in Subarray, Lazy Propagation, How To Build A Segment Tree, Query On A Segment Tree, Segment Tree Max Pair SumFenwick TreeIntroduction to Fenwick Tree, Coordinate Compression, OrderSet Problem, Distinct Query#### Graphs

5 hrsGraph ImplementationReturn all connected components, Get Path - BFS, Get Path - DFS, Has path, Solution: BFS Traversal, DFS - Adjacency Matrix, Graphs Terminology, Graphs Introduction, Graphs Implementation, BFS Traversal, BFS & DFS for disconnected graph, Weighted & Directed GraphsGraph AlgorithmsDijkstraâ€™s Algorithm, Prim's Algorithm, Kruskal's Algorithm, Minimum Spanning Trees, Detect Cycle, Union Find AlgorithmAdvanced GraphsPermutation Swaps, Connected Components, Fill Matrix Question, Connected Horses, Strongly Connected Components, Bipartite Graph#### Strings and Tries

2.5 hrsString AlgorithmsLongest Prefix Suffix, Z-Algorithm Pattern Matching, Longest Palindromic Substring Basics, KMP Algorithm, Pattern Matching Basics, Longest Prefix SuffixTriesSearch Engine, SUBXOR, Maximum XOR Subarra, XOR Maximum Pair, Tries & XOR#### Mathematics for Competitive Programming

8 hrsNumber TheoryGCD(Euclid Algorithm), Diophantine Equations, Multiplicative Modulo Inverse, Find Prime Numbers From 1 To N, Sieve Of Eratosthenes, Divisors Of Factorial, Advanced GCD, Euler's Totient Function, Segmented Sieve,Wilson's Theorem, Modular Exponentiation, Nth Fibonacci Number - Log(n), Fermatâ€™s Little Theorem, Matrix Exponentiation, Optimized Power Function, Recurrence RelationsGame TheoryOthello, Othello Evaluation Function, MinMax Algorithm, Sprague Grundy Theorem, Grundy Numbers, Game Of Nim, Intro To Game Theory, Proof Of Nim Formula, Evaluation Function In MinMax AlgorithmComputational GeometryConvex Hull, Area Of A Polygon, Distance Of A Point, Intro To Computational Geometry, Intersection Of Two Lines#### FFT and HLD

3 hrsFFTIntroduction To FFT, Lemma 3 and 4, Point Value Form, Applying Point Value Form, Lemma 1 and 2, Testing FFT Code, Multiply Polynomials using FFT, Overview of Complex Numbers, Lemma 5, Multiply Two PolynomialsHLDIntroduction To HLD, Algorithm behind HLD, Complexity Of Operations, Importance Of HLD, Basics Of HLD

Frequently Asked Questions

How do I get my doubts resolved?

Which plan should I take? Basic, Standard, Pro or Premium?

Where will the classes be conducted? What are the course timings?

I have done a Coding Ninjas course before. Is there any alumni discount?

How will I benefit from Industry Mentors?

Do I need a computer science background to enrol for this course?

Is there a guarantee that I will get an Internship or job after taking this course?

Which companies hire from Coding Ninjas?

Can I do this program along with my college?

What is the approximate stipend offered in internships through Coding Ninjas placement cell after completing this course?

Can I pay using EMIs?

My exams are coming; I donâ€™t know when my college will start due to COVID; I have lots of work at office, should I take the course or not?

My course is complete and I am unable to access all my content. What should I do?