Dynamic Programming, Recursion, Competitive Programming, Leetcode, 3sum.
cases. Either the element is in the sum, or it is not. So, we look at 2 cases for each element; (1) Ask for the 3Sum of the rest of the array, (2) ask for all 2Sum’s of the rest of the array, check if adding my element to them results in the asked number. Overlapping Substructure: As I would