Tap here to switch tabs
Problem
Submissions

Problem: Pairs of Songs With Total Durations Divisible by 60

Pairs of Songs With Total Durations Divisible by 60 counts distinct pairs in an array of song durations whose combined time is divisible by 60, returning the total number of qualifying pairs.

Statement

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 ithi^{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≤1 \leq time.length ≤1000\leq 1000

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

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Pairs of Songs With Total Durations Divisible by 60

Pairs of Songs With Total Durations Divisible by 60 counts distinct pairs in an array of song durations whose combined time is divisible by 60, returning the total number of qualifying pairs.

Statement

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 ithi^{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≤1 \leq time.length ≤1000\leq 1000

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