You are given a string s containing lowercase English letters and a $2 ext{D}$ array shift where shift[i] = [direction_i, amount_i].

Each operation shifts the string s according to the following rules:

• If direction_i $= 0$, shift the string s to the left by amount_i positions. A left shift of $1$ moves the first character of s to the end.

• If direction_i $= 1$, shift the string s to the right by amount_i positions. A right shift of $1$ moves the last character of s to the beginning.

Return the resulting string after performing all shift operations on s in the given order.

Constraints:

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

• s only contains lowercase English letters.

• $1 \leq$ shift.length $\leq 100$

• shift[i].length $= 2$

• direction_i is either $0$ or $1$.

• $0 \leq$ amount_i $\leq 100$

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.