Soup Servings - LeetCode 808 - Python - DP

[@Alpha-Code]

forgot to add time and space complexity, we can argue that they are both O(1) since our biggest number in the dp is around 150 which is constant no matter how big N is. time and space would be O(n^2) or O(150^2) which is constant time