diff --git a/solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/README.md b/solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/README.md
index 331b0100e0dea..d6ff9c9e445ce 100644
--- a/solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/README.md	
+++ b/solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/README.md	
@@ -145,6 +145,42 @@ func canArrange(arr []int, k int) bool {
 }
 ```
 
+#### TypeScript
+
+```ts
+function canArrange(arr: number[], k: number): boolean {
+    const cnt = Array(k).fill(0);
+
+    for (const x of arr) {
+        cnt[((x % k) + k) % k]++;
+    }
+
+    for (let i = 1; i < k; i++) {
+        if (cnt[i] !== cnt[k - i]) return false;
+    }
+
+    return cnt[0] % 2 === 0;
+}
+```
+
+#### JavaScript
+
+```js
+function canArrange(arr, k) {
+    const cnt = Array(k).fill(0);
+
+    for (const x of arr) {
+        cnt[((x % k) + k) % k]++;
+    }
+
+    for (let i = 1; i < k; i++) {
+        if (cnt[i] !== cnt[k - i]) return false;
+    }
+
+    return cnt[0] % 2 === 0;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/README_EN.md b/solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/README_EN.md
index 4ea03c3efc755..b1b762b569682 100644
--- a/solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/README_EN.md	
+++ b/solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/README_EN.md	
@@ -137,6 +137,42 @@ func canArrange(arr []int, k int) bool {
 }
 ```
 
+#### TypeScript
+
+```ts
+function canArrange(arr: number[], k: number): boolean {
+    const cnt = Array(k).fill(0);
+
+    for (const x of arr) {
+        cnt[((x % k) + k) % k]++;
+    }
+
+    for (let i = 1; i < k; i++) {
+        if (cnt[i] !== cnt[k - i]) return false;
+    }
+
+    return cnt[0] % 2 === 0;
+}
+```
+
+#### JavaScript
+
+```js
+function canArrange(arr, k) {
+    const cnt = Array(k).fill(0);
+
+    for (const x of arr) {
+        cnt[((x % k) + k) % k]++;
+    }
+
+    for (let i = 1; i < k; i++) {
+        if (cnt[i] !== cnt[k - i]) return false;
+    }
+
+    return cnt[0] % 2 === 0;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/Solution.js b/solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/Solution.js
new file mode 100644
index 0000000000000..b20f91df54692
--- /dev/null
+++ b/solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/Solution.js	
@@ -0,0 +1,13 @@
+function canArrange(arr, k) {
+    const cnt = Array(k).fill(0);
+
+    for (const x of arr) {
+        cnt[((x % k) + k) % k]++;
+    }
+
+    for (let i = 1; i < k; i++) {
+        if (cnt[i] !== cnt[k - i]) return false;
+    }
+
+    return cnt[0] % 2 === 0;
+}
diff --git a/solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/Solution.ts b/solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/Solution.ts
new file mode 100644
index 0000000000000..e82a97cf6949e
--- /dev/null
+++ b/solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/Solution.ts	
@@ -0,0 +1,13 @@
+function canArrange(arr: number[], k: number): boolean {
+    const cnt = Array(k).fill(0);
+
+    for (const x of arr) {
+        cnt[((x % k) + k) % k]++;
+    }
+
+    for (let i = 1; i < k; i++) {
+        if (cnt[i] !== cnt[k - i]) return false;
+    }
+
+    return cnt[0] % 2 === 0;
+}