[40%OFF]Competitive Programming -Crack Your Coding Interview, C++ Coupon-Educative.io

With Competitive Programming – Crack Your Coding Interview, C++ 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

Whether you’re gearing up for online coding challenges, code-a-thons, or interviews, then this course is for you. With this course, you will solidify your problem-solving skills ensuring a swift sail through any problem.

Competitive Programming – Crack Your Coding Interview, C++– 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 – Crack Your Coding Interview, C++

1. Overview

1. Introduction to the Course

2. Number Theory

1. Greatest Common Divisor (Euclid’s Algorithm)
2. Check Prime Number
3. Sieve of Eratosthenes
4. Sieve of Eratosthenes – Optimized
5. Find Prime Factors of a Number

4. Divide and Conquer

1. Binary Search
2. Implementation of Binary Search
3. First and Last Occurrence of an Element
4. Painter’s Partition Problem

5. Greedy Algorithms

1. Introduction to Greedy Algorithms
2. Activity Scheduling Problem
3. Biased Standing Problem
4. Load Balancer Problem
5. Defense of a Kingdom Problem

7. Recursion and Backtracking

1. Introduction to Recursion & Backtracking
2. Multiplication Without Using * Operator
3. Tower of Hanoi
4. Bubble Sort
5. Merge Sort

9. Dynamic Programming

1. Introduction to Dynamic Programming
2. Minimum Steps to One Problem
3. Minimum Steps to One Problem – Solution Using Top-Down DP
4. Minimum Steps to One Problem – Solution Using Bottom-Up DP

10. Graphs

1. Introduction to Graphs
2. Graph Representation
3. Adjacency List Representation – Implementation
4. Graph Traversal – Breadth-First Search

11. Bonus Lessons

1. Introduction to Bit-masking
2. Find the Unique Number
3. Introduction to Segment Trees
4. Where to Go Next ?