You are given two arrays of length n: a string array instructions and an integer array values.

A simulation begins at index $0$ with an initial score of $0$. At each step at index i:

• If index i has already been visited or is out of bounds (meaning i $< 0$ or i $\geq$ n), the process ends immediately.

• If instructions[i] is equal to "add", add values[i] to the score and advance to index i $+ 1$.

• If instructions[i] is equal to "jump", move directly to index i $+$ values[i].

Return the total score accumulated when the process terminates.

Constraints:

• n $=$ instructions.length $=$ values.length

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

• instructions[i] is either "add" or "jump".

• $-10^5 \leq$ values[i] $\leq 10^5$

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.