You are given an integer array nums and a binary string s, both of length n.

A token is initially located at index i if s[i] == '1'. For each token at index i, you may choose one of the following actions:

• Keep the token at index i.

• Shift the token to index $i - 1$, provided that $i > 0$.

At most one token can occupy any index after all choices are made.

Return the maximum possible sum of nums[j] across all indices j covered by a token.

Constraints:

• $1 \leq$ n $==$ nums.length $==$ s.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^5$

• s[i] is either '0' or '1'

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.