Dynamic Programming, Recursion, Competitive Programming, Leetcode, 3sum.
substructures(function calls to be cached/memoized). I’ll apply this line of thinking for 3Sum problem. 3Sum Problem Statement: Given an array and a number, return all triples that add up to the number. Small examples: If I have an array with 3 elements, then all I can do is check if they are equal