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 length $N$. Rotate it clockwise by $d$ or cyclic shift the element to the right by $d$.
**Input format**

The first line consists of two space-separated integers $N,d$ $(1 \leq N \leq 10^5)$.

The second line consists of $N$ space-separated integers representing the array $A[]$ $(1 \leq A[i] \leq 10^5)$.

---

## Sample

**Input**:  
```
8 3
1 2 3 4 5 6 7 8
```

**Output** 
```
6 7 8 1 2 3 4 5
```

---

## Solution

Let's see what happens when we cyclic shift by one. The last element comes to the first place and each other element moves one place to the right. We can do this $d$ times. The complexity of this solution would be $O(Nd)$.

We can optimize it further based on the observation that after $d$ operation, the last dd elements become the first $d$ elements and the remaining $N-d$ elements each shift to the right by dd places. We can do that in a single go.

# Problem statement
Given an array, $A[]$ of length $N$. Rotate it clockwise by $d$ or cyclic shift the element to the right by $d$.
**Input format**

The first line consists of two space-separated integers $N,d$ $(1 \leq N \leq 10^5)$.

The second line consists of $N$ space-separated integers representing the array $A[]$ $(1 \leq A[i] \leq 10^5)$.

---

# Sample

**Input**:  
```
8 3
1 2 3 4 5 6 7 8
```

**Output** 
```
6 7 8 1 2 3 4 5
```

---

# Solution

Let's see what happens when we cyclic shift by one. The last element comes to the first place and each other element moves one place to the right. We can do this $d$ times. The complexity of this solution would be $O(Nd)$.

We can optimize it further based on the observation that after $d$ operation, the last dd elements become the first $d$ elements and the remaining $N-d$ elements each shift to the right by dd places. We can do that in a single go.

In this lesson, we'll see how to rotate an array.

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 - Rotate Array

Problem statement