Breaking Down the Cyclic Sort Interview Pattern with Javascript - Part 3 of 3 

This is the third and last video on the cyclic sort interview pattern.
Watch part 1 here: • Cracking the Cyclic So...
This pattern is best used for problems involving arrays containing numbers in a given range. Using this pattern we can do things such as determining what order the numbers should be in, missing numbers, and duplicate numbers all with maximum linear time complexity aka O(n).
The Challenge (Hard Difficulty):
Given an unsorted array containing both positive and negative numbers, find the smallest missing positive number in it. You should do this in-place with a max time complexity of O(n).
Video Overview:
0:28 Cyclic sort overview
2:12 Problem
3:25 Approach
6:58 Javascript solution
18:12 Recap
Join us next week for part 3 of this pattern where we’ll walk through a more challenging problem.
Please subscribe to our channel :)
Additional Resources:
* Practice hundreds of real coding challenges at coderbyte.com/
* Check out our tiktoks @coderbyte