Package g3101_3200.s3184_count_pairs_that_form_a_complete_day_i

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3184 - Count Pairs That Form a Complete Day I.

    Easy

    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.

    Example 1:

    Input: hours = 12,12,30,24,24

    Output: 2

    Explanation:

    The pairs of indices that form a complete day are (0, 1) and (3, 4).

    Example 2:

    Input: hours = 72,48,24,3

    Output: 3

    Explanation:

    The pairs of indices that form a complete day are (0, 1), (0, 2), and (1, 2).

    Constraints:

    • 1 <= hours.length <= 100

    • <code>1 <= hoursi<= 10<sup>9</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer countCompleteDayPairs(IntArray hours)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait