Larry's Array | HackerRank (JavaScript)

CORRECTION: I forgot to include the time complexity of the while-loop, which should be O(n), making the entire for-loop quadratic time O(n^2). This will be the most significant component of the entire function, therefore the total time complexity will be O(n^2).

Intro: (0:00)
Solution Explained: (:49)
Solution Code: (4:30)

As a way to improve my coding skills and technical interview prep, I practice HackerRank, Code Wars, and Code Signal problems and solve them live with minimal edits. This allows viewers to see my thought process and problem-solving techniques along with the true struggles I go through when solving these technical coding problems. I also delve into tutorials about building out data structures, algorithms, and various other relevant and practical topics.

I mainly code in JavaScript, Python, and SQL. I also occasionally detour onto other challenges, like those from my own technical interviews, daily coding challenges, or just fun coding puzzles I come across.

[MateoVidal]

you are using the rotation rule wrongly