You are given an integer array nums of length n and an integer k, where n is divisible by k.

Divide the array into k contiguous subarrays of equal size. Reverse each of the k subarrays in place and return the modified array.

Constraints:

• $1 \leq$ n $==$ nums.length $\leq 1000$

• $1 \leq$ nums[i] $\leq 1000$

• $1 \leq$ k $\leq$ n

• n is divisible by k.

Input: nums = [9,1,7,3,2]-List[int], k = 5-int
Output: [9,1,7,3,2]-List[int]
Explanation: The array is divided into 5 subarrays of size 1. Reversing each single-element subarray leaves the array unchanged.

Input: nums = [8,6,1]-List[int], k = 1-int
Output: [1,6,8]-List[int]
Explanation: The array is divided into 1 subarray containing all elements. Reversing it produces [1,6,8].

Input: nums = [10,3,8,2,7,4,6,1,9,5,12,11]-List[int], k = 3-int
Output: [2,8,3,10,1,6,4,7,11,12,5,9]-List[int]
Explanation: The array is divided into [10,3,8,2], [7,4,6,1], and [9,5,12,11]. Reversing each subarray produces [2,8,3,10,1,6,4,7,11,12,5,9].

Input: nums = [4,4,2,9,1,1,7,6]-List[int], k = 4-int
Output: [4,4,9,2,1,1,6,7]-List[int]
Explanation: The array is divided into [4,4], [2,9], [1,1], and [7,6]. Reversing each subarray produces [4,4,9,2,1,1,6,7].

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.