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

# Library
While solving a problem, we’ll be using the queue from C++ STL.

**Include statement:** `#include <queue>`

Below are some of the operations we’ll be using frequently. For complete documentation of how they work, check
[here](https://en.cppreference.com/w/cpp/container/queue).

```
queue<int> Q; //empty queue
int x = Q.front(); // get front element
int x = Q.back(); //get back element
Q.pop(); // pop front element
Q.push(x); //push x at back
bool x = Q.empty(); // to check if stack is empty
int sz = Q.size(); // get size of stack
```

---

In the next chapter, we'll move onto tree data structures starting with Binary Trees.

In the lesson, we'll see how to use C++ STL queue.


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

STL

Library