Given a string, s, and a dictionary of strings, word_dict, check if s can be segmented into a space-separated sequence of one or more dictionary words. If yes, return TRUE; else, return FALSE.

Note: The same word in the dictionary may be used multiple times.

Constraints:

• $1 \leq$ s.length $\leq 250$

• $1 \leq$ word_dict.length $\leq 1000$

• $1 \leq$ word_dict[i].length $\leq 20$

• s and word_dict[i] consist of only lowercase English letters.

• All the strings of word_dict are unique.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.