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

# Queue
A queue is a linear data structure where a particular order in operations is maintained i.e., FIFO (First In First Out).

In Queue, we remove the least recently added element. In Stack, we remove the most recently added element.


We maintain `front` and `back`, meaning elements are inserted at the back and removed from the front.

The operations on Queue are:
* **Push**: Insert an element at the end
* **Pop**: Remove the first element
* **Front**: Get the front element
* **Back**: Get the last element

Optionally you have **isEmpty** and  **size** functions.

All operations take $O(1)$ time.

# Visualize

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

Queue

Queue