Burst Balloons

There are n balloons with values nums[i]. Bursting balloon i gives nums[i-1] * nums[i] * nums[i+1] coins (out-of-range neighbours count as 1). Print the maximum coins obtainable by bursting them all.

1 <= n <= 300 0 <= nums[i] <= 100