#We need to traverse the string s and check if each word is able to be broken into words from the dictionary #We can build a substring for each letter in word and try matching it to a word in wordDict ...

#With an array of positive integers nums, partition the entire array into two halves / subsets where the sum of each #Half is equal to one another #[1,2,3,4] can be partitioned into two subsets [2,3] ...