1. You are given an array(arr) of length N which represents N number of balloons. 2. Each balloon is painted with a number on it. 3. You have to collect maximum coins by bursting all the balloons. 4. If you burst a balloon with index i, you will get (arr[i-1] * arr[i] * arr[i+1]) number of coins. 5. If arr[i-1] and arr[i+1] don't exist, then you may assume their value as 1.
1 <= N <= 1000 1 <= arr[i] <= 100
A number N a1 a2.. N integers
Check the sample output and question video.
3 1 2 3