You are selected to play a game with n balloons. Each balloon is painted with a number on it representing the score you can get by popping the balloon. But there is a rule that you can not pop adjacent balloons.
Assume integers, return the maximum sum you can get by popping balloons.
Ex: [1, 99, 102]
Ans: 103
Follow up 1 - first and last element are connected
Follow up 2 - elements in a binary tree
