Count Pairs That Form a Complete Day I

Given an integer array hours representing times in hours, return an integer denoting the number of pairs i, j where i < j and hours[i] + hours[j] forms a complete day.

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

For example, 1 day is 24 hours, 2 days is 48 hours, 3 days is 72 hours, and so on.

LeetCode Problem - 3184

class Solution {
    public int countCompleteDayPairs(int[] hours) {
        // Initialize the answer to store the count of valid pairs
        int answer = 0;

        // Iterate through each hour in the array
        for(int i = 0; i < hours.length; i++) {
            // For each hour, iterate through the subsequent hours
            for(int j = i + 1; j < hours.length; j++) {
                // Check if the sum of the two hours is a multiple of 24
                if((hours[i] + hours[j]) % 24 == 0) {
                    // If it is, increment the answer count
                    answer++;
                }
            }
        }

        // Return the total count of pairs that sum to a complete day
        return answer;
    }
}