Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- array sorting, classes, polymorphism, traveling salesman
Coding
- Find Target Indices After Sorting Array
Coding
- Solve this impossible leetcode hard problem that involves figuring out an alogrithms that can crack any RSA encryption in O(1) time.
All jokes aside, it was a question about topological sorting. You have to find manager and employees given a list of their names and ids and print them out in a pyramid sideway pyramid.
Coding
- Sorting the Sentence
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 969. Pancake Sorting
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source