Leetcode 969. Pancake Sorting

Given a permutation of 1..n, sort the array using pancake flips that reverse a prefix arr[0..k-1] and return a sequence of k-values that produce a sorted array. n ≤ 100 and any valid sequence of flips of length ≤ 10*n is accepted.