You are given a string s that you must perform k replacement operations on, along with three arrays of length k: indices, sources, and targets.

For each operation i:

1. Check if the substring in s starting at index indices[i] matches sources[i].

2. If it matches, replace that occurrence with targets[i].

3. If it does not match, do not perform any modification for this operation.

All replacement operations occur simultaneously on the original string s, meaning that replacements do not affect the index positions or text examined by other operations.

Return the resulting string after executing all valid replacement operations.

Constraints:

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

• k $==$ indices.length $==$ sources.length $==$ targets.length

• $1 \leq$ k $\leq 100$

• $0 \leq$ indices[i] $<$ s.length

• $1 \leq$ sources[i].length, targets[i].length $\leq 50$

• s consists of only lowercase English letters.

• sources[i] and targets[i] consist of only 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.