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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 969. Pancake Sorting

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact