An ant starts at a boundary at position $0$. You are given an array of non zero integers nums.

At each step, the ant moves according to the value of nums[i]. If nums[i] > 0, the ant moves to the right by nums[i] units. If nums[i] < 0, the ant moves to the left by $|$nums[i]$|$ units.

Return the total number of times the ant returns to the boundary.

Constraints:

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

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

• nums[i] $\neq 0$

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.