You are given n balloons with numbers on them. Bursting balloon i earns nums[i - 1] * nums[i] * nums[i + 1] coins, where a neighbour outside the array counts as 1. Return the maximum coins you can collect by bursting all the balloons in the best order.
Practise this challenge
All coding challenges