Given an integer array hours representing durations in hours, determine the number of index pairs $(i, j)$ such that $i < j$ and hours[i] + hours[j] forms a complete day.

A complete day is defined as any duration of time that is an exact integer multiple of $24$ hours.

Constraints:

• $1 \leq$ hours.length $\leq 5 imes 10^5$

• $1 \leq$ hours[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.