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

# Problem Statement
Given an array $A$, of $N$ integers. Print the maximum integer in that subarray for all subarrays of length $K$.

**Input format**

The first line contains two space-separated integers $N$ and $K$ $(1 \leq K \leq N \leq 10^5)$.
The second line contains $N$ space separated integers representing the array $A[]$ $(1 \leq A[i] \leq 10^5).$

**Output format**

Print a single line containing $N-K+1$ integers—the maximum integer in each subarray of size $K$ from left to right.

---

# Sample

**Input**
```
6 3
3 8 4 5 1 9
```

**Output**
```
8 8 5 9
```

---

# Brute force
The brute force solution would simply use 2 for-loops. The first loop will determine the endpoint of the $K$-sized subarray. Second loop to iterate through that subarray to find the maximum integer.

See the below code for a better understanding.




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

Solved Problem - Sliding Window Maximum

Problem Statement