Data structures and algorithms are among the most fundamental concepts of Computer Science. Whether it’s real-world problems you’re trying to solve or the typical coding question asked in an interview, almost every problem requires you to demonstrate a deep understanding of data structures and algorithms. 

This course is a detailed review of some of the most common data structures and algorithms that you’ll see in interviews and your everyday work. With implementation details, thorough explanations, and hands-on coding exercises, you’ll quickly gain the confidence you need to solve any problem, no matter the situation.

Data Structures and Algorithms in Python

## Problem
You are required to write a function that determines the index of the smallest element
of the cyclically shifted array.

An array is **"cyclically shifted"** if it is possible to shift its entries cyclically so that it becomes sorted.

The following list is an example of a cyclically shifted array:
```
    A = [4, 5, 6, 7, 1, 2, 3]
````

Below are all the possible cyclic shifts of an array:

# Problem
You are required to write a function that determines the index of the smallest element
of the cyclically shifted array.

An array is **"cyclically shifted"** if it is possible to shift its entries cyclically so that it becomes sorted.

The following list is an example of a cyclically shifted array:
```
    A = [4, 5, 6, 7, 1, 2, 3]
````

Below are all the possible cyclic shifts of an array:

Challenge yourself with an exercise in which you'll have to return the index of the smallest number in a cyclically shifted array. 

Introduction

Stack

Singly Linked Lists

Circular Linked Lists

Doubly Linked Lists

Arrays

Binary Trees

Binary Search Trees

Binary Search

Recursion

String Processing

Exercise: Cyclically Shifted Array

Problem