Back to course home

0% completed

# Problem Challenge 3: Rotation Count (medium)

## Problem Statement

Given an array of numbers which is sorted in ascending order and is rotated ‘k’ times around a pivot, find ‘k’.

You can assume that the array does not have any duplicates.

**Example 1**:

```
Input: [10, 15, 1, 3, 8]
Output: 2
Explanation: The array has been rotated 2 times.
```

**Example 2**:

```
Input: [4, 5, 7, 9, 10, -1, 2]
Output: 5
Explanation: The array has been rotated 5 times.
```

**Example 3**:

```
Input: [1, 3, 8, 10]
Output: 0
Explanation: The array has not been rotated.
```

**Constraints:**

`1 <= arr.length <= 5000`

.....

.....

.....

Like the course? Get enrolled and start learning!