Terrible LeetCode in Kotlin: #189 Rotate Array

Another day, another LeetCode question (for now). Today, I'm running through #189 Rotate Array. The problem provides an integer array and an integer k, with the expected output being the array, but rotated k times to the right. In short, for all items within the array, the current value at index i should now be at index (i + k) mod n, where n is the length of the array.

This one was a bit rough, and admittedly my mind was just not in peak condition today. I took a stab at establishing a pattern within shifting, and attempting to optimize from the O(nk) naive solution, but couldn't figure out how to.

Looking at the solution, there exists various flavors of reversing the array, then reversing the subarrays bounded at k on each end (exclusive in the first, incluse in the second). I will make a better explanation on this solution tomorrow.

I work in Kotlin as my LeetCode programming language because my current focus is on Android app development. Kotlin is interoperable with Java, so the solution should be relatively similar albeit with some more boilerplate checks for nulls and such.

Current Grind:
- Grind75 list, 22 weeks/16 hours per week, [98/169]
(https://www.techinterviewhandbook.org/grind75)

Chapters:
00:00 - Problem discussion
30:52 - Coding Begins (Two Pointer Swapping)
47:12 - Solution Discussion (Reverse array, then reverse halves)