Given an array of positive integers nums, find the smallest balanced index i.

An index i is defined as balanced if the sum of all elements strictly to the left of i is equal to the product of all elements strictly to the right of i.

Return the smallest balanced index i. If no balanced index exists, return $-1$.

Note: The sum of elements to the left of index $0$ is considered to be $0$, and the product of elements to the right of the last index is considered to be $1$.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

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

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.