I recently got [1423. Maximum Points You Can Obtain from Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/) as my interview question.\n\nI gave a brute force recursive solution similar to the subsets and combinations problem as follows:\n\n```\nclass Solution:\n    def maxScore(self, cardPoints: List[int], k: int) -> int:\n        \n        def maxHelper(nums, curr_sum, k, result, choices, idx):\n            if idx==k:\n                if curr_sum>result[0]:\n                    result[0] = curr_sum\n                return    \n            \n            for index in range(2):\n                # choose\n                curr_sum += nums[choices[index]]\n                # explore\n                if index==0:\n                    maxHelper(nums[choices[index]+1:], curr_sum, k, result, choices, idx+1)\n                if index==1:    \n                    maxHelper(nums[:choices[index]], curr_sum, k, result, choices, idx+1)\n                # un-choose\n                curr_sum -= nums[choices[index]]\n                \n        if len(cardPoints)==k:\n            return sum(cardPoints)\n        result = [float(\'-Inf\')]   \n        choices = {0:0, 1:-1}\n        maxHelper(cardPoints, 0, k, result, choices, 0)\n        return result[0]\n```\n\nCould anyone tell me how do I memoize this solution? While there are other methods like sliding window etc., I specifically wanted to know if ***this*** particular solution can be memoized and converted into a DP solution or not.\nAppreciate your time.

I recently got 1423. Maximum Points You Can Obtain from Cards as my interview question.\n\nI gave a brute force recursive solution similar to the subsets and co