text function wordBreak(s, wordDict): wordSet = set(wordDict) n = length(s) dp = array of size (n + 1) filled with false dp[0] = true for i from 1 to n: for j from 0 to i - 1: if dp[j] AND s[j:i] in wordSet: dp[i] = true break return dp[n] Time complexity: where k is max word length for substring. Space complexity: for dp plus for the word set.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/dynamic-programming/word-break-pseudocode
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████████████████████████████████████████████████████████████████████████████████████████