Given a string s and an array of strings words, wrap all occurrences of any substring in s that appears in words with the bold tags <b> and </b>.

If two substrings overlap or are directly consecutive, they should be merged and enclosed within a single pair of bold tags.

Return the modified string after adding the bold tags.

Note: This question is the same as $758$: Bold Words in String.

Constraints:

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

• $0 \leq$ words.length $\leq 100$

• $1 \leq$ words[i].length $\leq 1000$

• s and words[i] consist of English letters and digits.

• All the values of words are unique.

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.