The problem I am given a string of possible digits 2 through 9. These digits are mapped to letters, like an old T9 cell phone, and I need to return all possible letter combinations that the digits can produce. I've looking into this problem for long enough...

The problem Aight, back to difficult problems. I need to find all collections of three digits in a collection that sum to zero. I feel like the first thing to do is sort the array - O(N logn) time - because we are trying to target a specific number - 0 - a...

The problem in question I have an array of integers and a numeric target, and I need to identify the two indices in the array that point to the integers that sum to the target. For example, if the target is 3 and our input array is [1, 4, 2, 5], the answer...

Hey folks. This is my study and accountability blog for making my way through the Grind 75 set of LeetCode problems. I’ve never found much success studying Data Structures and Algorithms, so I'm going to focus on the patterns used for each solution more ...