wordBreak = (s, wordDict) => {
    const wordSet = new Set(wordDict);/* Time O(N)   | Space O(N) */

    return canBreak(s, wordSet);      /* Time O(2^N) | Space O(N) */
}
Brute Force - DFS
Hash Set - Distinct Keys
Time O(2^N) | Space O(N)
https://leetcode.com/problems/word-break/
@param {string} s
@param {string[]} wordDict
@return {boolean}