4.4
Intermediate
5h
Competitive Programming in C++: The Keys to Success
Gain insights into competitive programming, explore C++ skills with theory, code samples, practice problems, and master faster implementation for contests like ACM ICPC, Google CodeJam, and HackerCup.
Content
1.
Introduction
4 Lessons
Get familiar with competitive programming essentials, C++ techniques, built-in methods, and efficient I/O handling.
2.
Complexity Analysis
6 Lessons
Walk through analyzing algorithm complexity, runtime categories, and their impact on competitive programming.
3.
Number Theory
12 Lessons
Examine key number theory concepts, including algebraic formulas, set theory, geometry, progressions, permutations, combinations, and prime factorization.
4.
Arrays and Vectors
6 Lessons
Grasp the fundamentals of arrays, vectors, and solving array-related problems efficiently.
5.
Sieve of Eratosthenes
4 Lessons
Map out the steps for Sieve of Eratosthenes, its implementation, complexity, and segmented variant.
6.
Strings
4 Lessons
Investigate string manipulation, STL methods, and solve complex palindrome and number comparison problems.
7.
Sorting
8 Lessons
Build on foundational sorting techniques and library functions for competitive coding.
8.
Linked List
4 Lessons
Break down linked lists, including arrays comparison, and singling out searching, insertion, and deletion.
9.
Stack
4 Lessons
Get started with stack data structure, its operations, implementation, STL use, and practical applications.
10.
Queue
3 Lessons
Master the steps to using and implementing queues in competitive programming with C++.
11.
Binary Tree
3 Lessons
Grasp the fundamentals of binary trees, their types, and their uses in competitive programming.
12.
2 Pointers
2 Lessons
Solve problems in competitive programming using the efficient two-pointer technique.
13.
Heap
6 Lessons
Simplify complex topics on heap properties, implementation, complexity, STL usage, and solved problems.
14.
Binary Search Tree
7 Lessons
Master the steps to understanding, searching, inserting, traversing, and deleting nodes in a Binary Search Tree.
15.
Balanced Binary Search Tree
6 Lessons
Learn how to use balanced binary search trees for efficient data structures in competitions.
16.
Course Conclusion
1 Lessons
Look at the importance of programming contests, upsolving, and future advanced topics.
Certificate of Completion
Showcase your accomplishment by sharing your certificate of completion.
Course Author:
Developed by MAANG Engineers
Trusted by 2.8 million developers working at companies
"These are high-quality courses. Trust me. I own around 10 and the price is worth it for the content quality. EducativeInc came at the right time in my career. I'm understanding topics better than with any book or online video tutorial I've done. Truly made for developers. Thanks"
Anthony Walker
@_webarchitect_
"Just finished my first full #ML course: Machine learning for Software Engineers from Educative, Inc. ... Highly recommend!"
Evan Dunbar
ML Engineer
"You guys are the gold standard of crash-courses... Narrow enough that it doesn't need years of study or a full blown book to get the gist, but broad enough that an afternoon of Googling doesn't cut it."
Software Developer
Carlos Matias La Borde
"I spend my days and nights on Educative. It is indispensable. It is such a unique and reader-friendly site"
Souvik Kundu
Front-end Developer
"Your courses are simply awesome, the depth they go into and the breadth of coverage is so good that I don't have to refer to 10 different websites looking for interview topics and content."
Vinay Krishnaiah
Software Developer
Hands-on Learning Powered by AI
See how Educative uses AI to make your learning more immersive than ever before.
AI Prompt
Code Feedback
Explain with AI
AI Code Mentor
Free Resources
