Given an integer array nums where each element is either a positive integer or $-1$.

You start with an empty array seen and an empty array ans. You iterate through nums from left to right:

• If the current element is positive, prepend it to the front of seen and reset the count of consecutive $-1$ elements to $0$.

• If the current element is $-1$, increment the count of consecutive $-1$ elements by $1$. Let this count be k.

  • If k is less than or equal to the length of seen, append the $k$-th element of seen to ans.

  • Otherwise, if k is strictly greater than the length of seen, append $-1$ to ans.

Return the array ans.

Constraints:

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

• nums[i] $= -1$ or $1 \leq$ nums[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.