Table of Contents:

The Problem Introduction 0:00 - 1:33

Why Not Just Sort It? 1:33 - 2:08

Investigating How We Can Actually Use K 2:08 - 3:22

Expressing The Exhaustive Set of Possibilities 3:22 - 5:57

Analyzing The Critical Information 5:57 - 7:17

We Begin Doing Placements 7:17 - 10:51

Time Complexity 10:51 - 12:47

Space Complexity 12:47 - 13:27

Wrap Up 13:27 - 14:05

Code: https://github.com/bephrem1/backtobackswe/blob/master/Sorting%2C%20Searching%2C%20%26%20Heaps/SortAnAlmostSortedArray/SortAnAlmostSortedArray.java

GeeksForGeeks: https://www.geeksforgeeks.org/nearly-sorted-algorithm/

Elements of Programming Interviews: 11.3