Pancake Sorting | Leet code 969 | Theory explained + Python code

This video is a solution to Leet code 969, Pancake Sorting. I explain the question and the best way to solve it and then solve it using Python.

Comment below if you have a better solution to this problem!

Let me know if you have any feedback and don't forget to subscribe for more videos!

More leetcode questions solved:

Gear used:

[hamzakivideo]

Was wondering, you said 2 is already in it's correct place, can you elaborate on that? How do we end up getting 1 after 3, 4, 2, 3 and not 2?

[MP-nyep]

I think you made a mistake at 5:47, you didn't reverse 21 but you added the index 1 at k.