1. Similar to [Coin sum](https://leetcode.com/problems/coin-change/), like an unbounded knapsack.\n2. Similar to [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree), except it was to find the maximum average node excluding the last leaf node of a N-ary tree.

Similar to Coin sum, like an unbounded knapsack.\n2. Similar to Maximum Binary Tree, except it was to find the maximum average node excluding the last leaf node