You are given a string s of lowercase English letters and a $2$D integer array shifts, where each element shifts[i] $= [$start_i, end_i, direction_i$]$.

For every operation in shifts:

• If direction_i $= 1$, shift the characters in s from index start_i to index end_i (inclusive) forward by $1$ in the alphabet, wrapping around such that 'z' becomes 'a'.

• If direction_i $= 0$, shift the characters in s from index start_i to index end_i (inclusive) backward by $1$ in the alphabet, wrapping around such that 'a' becomes 'z'.

Return the final string after all the shifts have been applied to s.

Constraints:

• $1 \leq$ s.length, shifts.length $\leq 5 imes 10^4$

• shifts[i].length $= 3$

• $0 \leq$ start_i $\leq$ end_i $<$ s.length

• $0 \leq$ direction_i $\leq 1$

• s consists of 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.