Leetcode 3184. Count Pairs That Form a Complete Day I

Count the number of index pairs i<j such that hours[i] + hours[j] is a multiple of 24 — equivalently, whose remainders modulo 24 sum to 0 mod 24. This is a remainder-frequency / complementary-pair counting problem (n ≤ 100, values up to 1e9).