With Competitive Programming in C++: The Keys to Success you will get a 40% discount on yearly plans and a 20% monthly discount oneducative.io. It is one of the popular courses from educative.io
In this course, you will learn to prepare for competitive programming contests like ACM ICPC, Google CodeJam, Facebook HackerCup, and many more.
Competitive Programming in C++: The Keys to Success– Developer Discount
With the exclusive Holiday discount, you can get a 20% discount on two years of access to educative.io which includes all the existing and future courses. Two-year access is just $199 after the discount. Lockin this price before it expires.
Get an additional 20 discount on Handling Financial Services with Square API course
Coupon: Use code devops at checkout
Also, you can get a 10% discount on all educative courses using the exclusive discount.
Coupon: Use Code Educative10 at checkout
Here is what you will Learn from Competitive Programming in C++: The Keys to Success
1. Introduction
- The Course
- C++ Refresher
- C++ Built-in methods
- C++ I/O
2. Complexity Analysis
- Algorithm Analysis
- Trivial Runtime Analysis
- Logarithmic Runtime
- Non Trivial Runtime
3. Number Theory
- Geometric Progression (GP)
- Permutations
- Combinations
- Solved Problem – PnC
- Prime Factors
- Solved Problem – Prime Factorization
4. Arrays and Vectors
- Introduction
- Vectors
- Solved Problem – Reverse Subarray
- Solved Problem – Rotate Array
- Solved Problem – Merge Sorted Arrays
- Solved Problem – Subarray Sum
5. Sieve of Eratosthenes
- Sieve of Eratosthenes
- Implementation
- Complexity Analysis
- Solved Problem – Segmented Sieve
6. Strings
- Strings
- STL
- Solved Problem – Make String Palindrome
- Solved Problem – Compare Numbers
7. Sorting
- Introduction
- Selection Sort
- Bubble Sort
- Insertion Sort
- STL
8. Linked List
- Linked List vs Array
- Singly Linked List – Searching
- Singly Linked List – Insertion
- Singly Linked List – Deletion
9. Stack
- Stack
- Implementation
- STL
- Solved Problem – Balanced Parentheses Sequence
10. Queue
- Queue
- Implementation
- STL
11. Binary Tree
- Introduction
- Types of Binary Trees
- More on Binary Trees
12. 2 Pointers
- Solved Problem – Pair Sum
- Solved Problem – Triplet Sum
13. Heap
- Heap
- Implementation
- Complexity Analysis
- STL
- Solved Problem – Kth Largest element
- Solved Problem – Merge K Sorted Arrays
14. Binary Search Tree
- Binary Search Tree
- Searching
- Insertion
- Traversals
- Properties