From 792d625cdd140b0fc427ce9d34ca7f2713200be1 Mon Sep 17 00:00:00 2001
From: Abinash Karmakar <codeAbinash@gmail.com>
Date: Tue, 1 Oct 2024 11:24:17 +0530
Subject: [PATCH] Add some code

---
 .../check-if-array-pairs-are-divisible-by-k.java | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 leetcode/problems/java/check-if-array-pairs-are-divisible-by-k.java

diff --git a/leetcode/problems/java/check-if-array-pairs-are-divisible-by-k.java b/leetcode/problems/java/check-if-array-pairs-are-divisible-by-k.java
new file mode 100644
index 0000000..d11d49a
--- /dev/null
+++ b/leetcode/problems/java/check-if-array-pairs-are-divisible-by-k.java
@@ -0,0 +1,16 @@
+class Solution {
+  public boolean canArrange(int[] arr, int k) {
+    int freq[] = new int[k];
+    for (int n : arr)
+      freq[(n % k + k) % k]++;
+
+    if (freq[0] % 2 != 0) // k - 0 = k and it does not exist in the array
+      return false;
+
+    for (int i = 1; i <= k / 2; i++)
+      if (freq[i] != freq[k - i])
+        return false;
+
+    return true;
+  }
+}
\ No newline at end of file