Given an array of integers arr, sort the array by performing a series of pancake flips.

In a single pancake flip, choose an integer k such that $1 \le k \le$ arr.length, and reverse the prefix containing the first k elements of arr.

Return a list of values of k corresponding to a sequence of pancake flips that sorts arr. Any valid sequence of pancake flips that sorts the array is acceptable.

Constraints:

• $1 \le$ arr.length $\le 100$

• $1 \le$ arr[i] $\le$ arr.length

• All integers in arr are unique (that is, arr is a permutation of the integers from $1$ to arr.length).

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.