Check If Array Pairs Are Divisible by k LeetCode solution in Java

1
class Solution {
2
  public boolean canArrange(int[] arr, int k) {
3
    int[] frequency = new int[k];
4
    for (int num : arr) {
5
      num %= k;
6
      if (num < 0) num += k;
7
      frequency[num]++;
8
    }
9
    if (frequency[0] % 2 != 0) return false;
10

11
    for (int i = 1; i <= k / 2; i++) if (frequency[i] != frequency[k - i]) return false;
12

13
    return true;
14
  }
15
}