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.

Competitive programming can be a great way to build out your programming skills, get on any major company’s radar, and earn a little extra cash along the way.

In this course, you will learn to prepare for competitive programming contests like ACM ICPC, Google CodeJam, Facebook HackerCup, and many more.

Each topic is broken down with a healthy mix of theory, code samples, step-by-step solved sample problems, illustrations, useful practice problems, and tips and tricks for faster implementation.

You will need some solid C++ foundations coming into this course, but by the end it, you will be confident enough in your C++ skills to take home the win.

Competitive Programming in C++: The Keys to Success

# Competitions
Binary search trees have unique properties, but they’re not that useful when you want to use them to speed up certain operations, because they can get skewed based on the input and order of construction. 


For that reason, you will not find yourself coding BSTs in competitions, but self-balancing BSTs are used to solve this problem.

# Balancing BSTs
Self-Balancing BSTs maintain their height by rotating skewed subtrees. Balancing BSTs are powerful structures that we will be using very often.


In this lesson, we'll learn some more about BSTs.

Introduction

Complexity Analysis

Number Theory

Arrays and Vectors

Sieve of Eratosthenes

Strings

Sorting

Linked List

Stack

Queue

Binary Tree

2 Pointers

Heap

Binary Search Tree

Balanced Binary Search Tree

Course Conclusion

More on BSTs

Competitions