dp[i] = dp[i-26] + dp[i-26+1] explaination
\n\nAfter t>=26, for each level t, the characters progess adds up t-26 level and t-26+i levels.\n\n\nHard to analyze, but once you create the tree, the observat
![IMG_2762.JPG](https://assets.leetcode.com/users/images/4ca0ee77-b285-4c8c-a79a-94711239414c_1731386922.0505927.jpeg)\n\nAfter t>=26, for each level t, the characters progess adds up t-26 level and t-26+i levels.\n\n\nHard to analyze, but once you create the tree, the observation is clear. \n\n
['C++']