The problem requires us to rotate an array to the right byksteps. A straightforward way to achieve this is by reversing parts of the array. The intuition is based on the fact that reversing an array ...

There are multiple ways to rotate array by k times. Here I am using one of the approach which called reverse array approach. First check if k steps is within limit of reverse array. If it is not, then ...

Due to the low number of test cases and linear runtime, I am able to consistently score 100% time efficiency. There should be more of such test cases, especially large testcases. This applies to both ...