Package g1401_1500.s1497_check_if_array_pairs_are_divisible_by_k

Class Solution

java.lang.Object

g1401_1500.s1497_check_if_array_pairs_are_divisible_by_k.Solution

public class Solution
extends Object

1497 - Check If Array Pairs Are Divisible by k.<p>Medium</p> <p>Given an array of integers <code>arr</code> of even length <code>n</code> and an integer <code>k</code>.</p> <p>We want to divide the array into exactly <code>n / 2</code> pairs such that the sum of each pair is divisible by <code>k</code>.</p> <p>Return <code>true</code> <em>If you can find a way to do that or</em> <code>false</code> <em>otherwise</em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> arr = [1,2,3,4,5,10,6,7,8,9], k = 5</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> Pairs are (1,9),(2,8),(3,7),(4,6) and (5,10).</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> arr = [1,2,3,4,5,6], k = 7</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> Pairs are (1,6),(2,5) and(3,4).</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> arr = [1,2,3,4,5,6], k = 10</p> <p><strong>Output:</strong> false</p> <p><strong>Explanation:</strong> You can try all possible pairs to see that there is no way to divide arr into 3 pairs each with sum divisible by 10.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>arr.length == n</code></li> <li><code>1 <= n <= 10⁵</code></li> <li><code>n</code> is even.</li> <li><code>-10⁹ <= arr[i] <= 10⁹</code></li> <li><code>1 <= k <= 10⁵</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	canArrange(int[] arr, int k)

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

canArrange

public boolean canArrange(int[] arr,
 int k)