2301 - Match Substring After Replacement\.

Hard

You are given two strings s and sub. You are also given a 2D character array mappings where <code>mappingsi = old_i, new_i</code> indicates that you may replace any number of <code>old_i</code> characters of sub with <code>new_i</code>. Each character in sub cannot be replaced more than once.

Return true if it is possible to make sub a substring of s by replacing zero or more characters according to mappings. Otherwise, return false.

A substring is a contiguous non-empty sequence of characters within a string.

Example 1:

Input: s = "fool3e7bar", sub = "leet", mappings = \[\["e","3"],"t","7","t","8"]

Output: true

Explanation: Replace the first 'e' in sub with '3' and 't' in sub with '7'.

Now sub = "l3e7" is a substring of s, so we return true.

Example 2:

Input: s = "fooleetbar", sub = "f00l", mappings = \[\["o","0"]]

Output: false

Explanation: The string "f00l" is not a substring of s and no replacements can be made.

Note that we cannot replace '0' with 'o'.

Example 3:

Input: s = "Fool33tbaR", sub = "leetd", mappings = \[\["e","3"],"t","7","t","8","d","b","p","b"]

Output: true

Explanation: Replace the first and second 'e' in sub with '3' and 'd' in sub with 'b'.

Now sub = "l33tb" is a substring of s, so we return true.

Constraints:

• 1 <= sub.length <= s.length <= 5000

• 0 <= mappings.length <= 1000

• mappings[i].length == 2

• <code>old_i != new_i</code>

• s and sub consist of uppercase and lowercase English letters and digits.

• <code>old_i</code> and <code>new_i</code> are either uppercase or lowercase English letters or digits.