Given a $0$ indexed integer array nums, a pair of indices (i, j) is considered a bad pair if $i < j$ and $j - i \neq$ nums[j] $-$ nums[i].

Return the total number of bad pairs in nums.

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.