Define = max coins from bursting all balloons strictly between i and j (exclusive). We add virtual balloons with value at positions and n+.
Base case: = . No balloons between adjacent positions. Goal: , the max coins from bursting all balloons between the virtual boundaries. Choosing what dp[i][j] represents is often the hardest part. It must capture everything needed to solve that range on its own.