Available question text
Given an array of song durations, count pairs (i < j) whose sum is divisible by 60; this is solved efficiently by grouping durations by remainder mod 60 and pairing each remainder with its complement (with special handling for remainders 0 and 30) to compute the total pairs in linear time.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1010. Pairs of Songs With Total Durations Divisible by 60
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source