Three-Step Reversal Algorithm
This technique is a popular and efficient approach for rotating an array to the right without using any extra space.
Involves three main steps:
Reverse the entire array, Reverse the first k elements of the array, and Reverse the remaining n-k elements of the array.