You have matrices with numbers on them. Bursting balloon i gives you coins. After bursting, the neighbors become adjacent. Find the maximum coins you can collect by bursting all balloons in the optimal order.
This looks like you could pick the locally best choice each time, but that approach fails. The order matters because bursting changes the neighbors. This is interval DP in disguise. Before reading the solution, try to identify the base case and recursive relationship yourself.