You are given a string word and an array of strings forbidden.

A substring of word is called valid if none of the strings present in forbidden appear as a substring within it.

Return the length of the longest valid substring of word.

Constraints:

• $1 \leq$ word.length $\leq 10^5$

• word consists only of lowercase English letters.

• $1 \leq$ forbidden.length $\leq 10^5$

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

• forbidden[i] consists only 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.