Foundation for Competitive Programming offered by Coding Ninjas
Foundation for Competitive Programming at Coding Ninjas Overview
Duration | 4 months |
Mode of learning | Online |
Schedule type | Self paced |
Difficulty level | Beginner |
Official Website | Go to Website |
Credential | Certificate |
Foundation for Competitive Programming at Coding Ninjas Highlights
- Proven Content: Our placement record corroborates the quality of our course content
- Seasoned Faculty: Alumnus of Stanford, IITs, IIITs and other top-notch universities
- Live Doubt Support: Live mentor support, solving over 1500+ doubts a day
- Classroom Experience: A chatroom on Slack, Batch Wall, Leaderboard to interact with the faculty and batch mates
Foundation for Competitive Programming at Coding Ninjas Course details
- The programme will benefit those who want to up-skill their coding experience and want to build themselves for global coding competitions. Join the league of intellectuals with the expert problem-solving abilities that will help you conquer the toughest coding problems.
- Competitive Programming course helps in enhancing your cognitive and problem-solving abilities. After completing this course, you will be able to solve hard coding problems efficiently and participate in global coding competitions such as ACM-ICPC, IPC and more.
Foundation for Competitive Programming at Coding Ninjas Curriculum
Class 1 to 5
Getting started
Conditions and Loops
Operators and For Loop
Functions, Variables and their scope
Class 6 to 10
Arrays
Searching and Sorting
Strings and 2D Arrays
Class 11 to 15
Pointers
Dynamic Allocation
OOPS 1
OOPS 2
Class 16 to 20
Basics Of Competitive Coding
Various type of errors
Basics of Recursion
Time Complexity
Space Complexity
Language Tools
STL
Sorting and Searching Applications
Binary Search Applications
Live questions on above topics
Class 21 to 25
Backtracking
Recursion 2
Recursion Applications
Bit Manipulation
Applications of Bit Manipulation
Greedy problems
Greedy Mathematics
Live Questions on above topics
Class 26 to 30
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
Live questions on the above topics
Class 31 to 35
Graphs 1 and 2
DFS/BFS
Application of Graphs
String Processing
Bitmasking
Game Theory
Class 36 to 40
Number Theory-1
Number Theory-2
Number Theory-3 and Maths
Applications of Number Theory
Computational Geometry
Applications of Computational Geometry
Live questions on the above topics
Class 41 and above
Fenwick Tree
Applications of Fenwick Tree
Mixed problems (DP, Graphs etc)
Heavy Light Decomposition
Fast Fourier Transform
Live Questions on above topics
Other courses offered by Coding Ninjas
Foundation for Competitive Programming at Coding Ninjas Students Ratings & Reviews
- 4-51
Student Forum
Foundation for Competitive Programming at Coding Ninjas Contact Information
Plot Number 360, Kohat Enclave, Opposite Kohat Metro Station, exit 3
Delhi