You are given two strings skill of length $n$ and station of length $m$.

There are $n$ workers where the $i^{\text{th}}$ worker requires skill[i]. There are $m$ stations where the $j^{\text{th}}$ station provides station[j].

Each worker must be assigned to an available station such that:

• The assigned indices form a strictly increasing sequence $0 \leq p[0] < p[1] < \dots < p[n - 1] < m$.

• station[p[i]] equals skill[i] for all $0 \leq i < n$.

The gap between two adjacent assigned stations is $p[i + 1] - p[i]$ for $0 \leq i < n - 1$.

Return the maximum possible value of $\max_{0 \leq i < n - 1} (p[i + 1] - p[i])$ among all valid assignments.

Constraints:

• skill.length $= n$

• station.length $= m$

• $1 \leq n \leq m \leq 10^5$

• skill and station consist of lowercase English letters.

• It is guaranteed that a valid assignment exists for every worker.

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.