Given an integer array nums sorted in nondecreasing order, return the maximum value between the count of positive integers and the count of negative integers.

Note: The integer $0$ is neither positive nor negative.

Constraints:

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

• $-2000 \leq$ nums[i] $\leq 2000$

• nums is sorted in nondecreasing order.

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.