Given an integer array nums, rotate the array to the right by k steps, where k is non-negative. rotate 1 steps to the right: [7,1,2,3,4,5,6] rotate 2 steps to the right: [6,7,1,2,3,4,5] rotate 3 steps ...

// step 0: Ensure k is within the array bounds. In case k is larger nums.length take modulo // For example, if k = 3 and nums.length = 7, k = 3 % 7 = 3 (no change) ...