Given a 0-indexed 1-dimensional (1D) integer array original and two integers, m and n, your task is to reshape the array into a 2-dimensional (2D) array with m rows and n columns while preserving the order of elements in original.

To construct the 2D array, the first n elements in the original should populate the first row. The next n elements should populate the second row, and so on, until all rows are filled. Your goal is to return the resulting m x n 2D array.

Note: If it is impossible to create an m x n array (e.g., if the total number of elements in the original is not equal to m * n), return an empty array.

Constraints:

• $1 <=$ original.length $<= 10^3$

• $1 <=$ original[i] $<= 10^3$

• $1 <=$ m, n $<= 33$

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 on how to solve this problem.

Implement your solution in the following coding playground.