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.

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.