You are given a string s and an array of strings dictionary. You can partition s into one or more non overlapping substrings such that each chosen substring appears in dictionary.

There may be some leftover characters in s that do not belong to any chosen substring.

Return the minimum number of extra characters remaining in s after breaking it up optimally.

Constraints:

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

• $1 \leq$ dictionary.length $\leq 50$

• $1 \leq$ dictionary[i].length $\leq 50$

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

• dictionary contains distinct words

Now, 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.

Implement your solution in the following coding playground.