# Flipping Burnt Pancakes, but Optimally!
This is based on the [Burnt Pancake problem](https://en.wikipedia.org/wiki/Pancake_sorting#The_burnt_pancake_problem).

For a given array, determine the minimal number of flips needed to be made burnt pancake sorting.

Note that this is an **NP-HARD** problem. You may not make an approximation algorithm.
# Testcases
    [1,2,3,4,5] returns 0,
    [3,2,1,4,5] returns (probably 10, need to verify)
    [9,3,1] returns (probably 6, need to verify)
This is fastest-algorithm, so the minimal time complexity wins.