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

# Definition
A Set is an unordered collection of objects. 

Eg: $\{2, 3\}, \{\}, \{1, 5, 6\}$

Objects don't repeat in a set.

Unordered collection means the two sets $\{1,7,3\}$ and $\{7,1,3\}$ are equal.

---

# Subsets

A set $A$ is subset of set $B$ ($A \subset B$) if every element of $A$ is also part of $B$.

For eg: $\{1\}, \{1, 2\}, \{\}$ are subsets of $\{1,2\}$ but $\{3\}, \{1,3\}$ are not.

For a set of size $N$, it has $2^N$ unique subsets including an empty set and set containing all the elements.

Subset of $\{a,b,c\}$:

* $\{\}$
* $\{a\}$
* $\{b\}$
* $\{c\}$
* $\{a,b\}$
* $\{a,c\}$
* $\{b,c\}$
* $\{a,b,c\}$

---

# Operations

## Union

Union of set $A$ and $B$ denoted by $A \cup B$ is another set of elements that belong to set $A$ or set $B$ or both.

For eg: $\{1,2\} \cup \{2,4\} = \{1,2,4\}$

## Intersection

Intersection of set $A$ and $B$ denoted by $A \cap B$ is another set of elements that belong to **both** set $A$ and set $B$.

For eg: $\{1,2\} \cap \{2,4\} = \{2\}$


Most of you should already be familiar with all the topics in this lesson. This lesson should be a quick refresher on sets and set operations.

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

Set Theory

Definition

Subsets