You are given a list of songs, where the duration of each song is represented by an integer array time, where time[i] indicates the length of the $i^{th}$ song in seconds.

Your task is to find and return the number of pairs of songs (i, j) such that:

• i < j (i.e., the pair should consist of two distinct songs)

• The sum of their durations is divisible by 60, i.e., (time[i] + time[j]) % 60 == 0.

Constraints:

• $1 \leq$ time.length $\leq 1000$

• $1 \leq$ time[i] $\leq 500$

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.