feat: add ts solution to lc problem: No.0533

solution/0500-0599/0523.Continuous Subarray Sum/README.md

@@ -156,6 +156,27 @@ func checkSubarraySum(nums []int, k int) bool {
 }
 ```
 
+#### TypeScript
+
+```ts
+function checkSubarraySum(nums: number[], k: number): boolean {
+    const n = nums.length;
+    let prefixSum = 0;
+    const map = new Map([[0, 0]]);
+
+    for (let i = 0; i < n; i++) {
+        prefixSum += nums[i];
+        const remainder = prefixSum % k;
+
+        if (!map.has(remainder)) {
+            map.set(remainder, i + 1);
+        } else if (i - map.get(remainder)! > 0) return true;
+    }
+
+    return false;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0500-0599/0523.Continuous Subarray Sum/README_EN.md

@@ -160,6 +160,27 @@ func checkSubarraySum(nums []int, k int) bool {
 }
 ```
 
+#### TypeScript
+
+```ts
+function checkSubarraySum(nums: number[], k: number): boolean {
+    const n = nums.length;
+    let prefixSum = 0;
+    const map = new Map([[0, 0]]);
+
+    for (let i = 0; i < n; i++) {
+        prefixSum += nums[i];
+        const remainder = prefixSum % k;
+
+        if (!map.has(remainder)) {
+            map.set(remainder, i + 1);
+        } else if (i - map.get(remainder)! > 0) return true;
+    }
+
+    return false;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0500-0599/0523.Continuous Subarray Sum/Solution.ts

@@ -0,0 +1,16 @@
+function checkSubarraySum(nums: number[], k: number): boolean {
+    const n = nums.length;
+    let prefixSum = 0;
+    const map = new Map([[0, 0]]);
+
+    for (let i = 0; i < n; i++) {
+        prefixSum += nums[i];
+        const remainder = prefixSum % k;
+
+        if (!map.has(remainder)) {
+            map.set(remainder, i + 1);
+        } else if (i - map.get(remainder)! > 0) return true;
+    }
+
+    return false;
+}