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

If two or more bolded substrings overlap or are directly consecutive, they should be merged and enclosed within a single pair of <b> and </b> tags to minimize the total number of tags used.

Return the resulting string after bolding all matching substrings.

Constraints:

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

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

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

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

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.