Problem Problem_Link Solutions (time, space) O(n), O(n) class Solution { public void rotate(int[] nums, int k) { int len = nums.length; int[] rtnNums = new int[len]; // Rotate elements for (int i = 0; i < len; i++...