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

# Implementation
The Boolean array i$is\_prime[]$ of Boolean is initialized to $true$ and denotes that all numbers are assumed prime initially and marks them $false$ as we proceed.

We start with $i=2$ and only go up to $ceil(\sqrt{N})$ as explained in previous chapter.

>Instead of comparing as $i <= \sqrt(N)$, we are comparing as $i*i <= N$. It's essentially the same comparison and we avoid dealing with the floating-point variable. 



In this lesson, we'll see the implementation of Sieve of Eratosthenes.


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

Implementation

Implementation