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

# Application
Since the 3 operations (*insertion, searching and deletion*) take $O(logN)$ time each. One straightforward application is a set where you can insert and remove elements and check if a given element belongs in the set.

This will become more evident as we solve some sample problems in later lessons.

---

# Competitions
Similar to a data structure like queue and stacks. Self-balancing is a standard data structure with enormous application in problems of every difficulty and in a complex, compound data structure.

So it becomes necessary to have this data structure as a block box that you can use as a set in competition and not implement pointer-based, rotating BSTs during a live contest.

Once we've understood the workings, we'll see how to leverage STL to do exactly this.

---

There are 3 containers from C++ STL that we will be using for Balanced BST operations. These are

1. Set
2. MultiSet
3. Map

In this lesson, I'll share some points of applications of self-balancing BST and what we expect in competitions.

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

Competitions

Application