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

Knowing how to traverse a binary search will help in understanding graph traversals later on. Different types of traversals have different properties and use cases. 

Even though you will not need to implement traversals over Binary Search Trees in competitions, this will be the basis for higher-level graph data structures.

We’ll go over three types of traversals over binary trees (not only BSTs) in general:


* In-Order
* Pre-Order
* Post-Order

They differ in the order in which the left child, the right child, and the root are traversed recursively.

In this lesson, we'll look at the different ways that a BST can be traversed. 

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

Traversals