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

Author: rain84

solution/0200-0299/0215.Kth Largest Element in an Array/README.md

@@ -335,4 +335,36 @@ function findKthLargest(nums: number[], k: number): number {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 4: Hash + counting
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function findKthLargest(nums: number[], k: number): number {
+    const n = 10 ** 4;
+    const length = n * 2 + 1;
+    const cnt = Array(length);
+
+    for (const x of nums) {
+        cnt[x + n] = (cnt[x + n] ?? 0) + 1;
+    }
+
+    for (let i = length; i >= 0; i--) {
+        if (!cnt[i]) continue;
+        k -= cnt[i];
+        if (k <= 0) return i - n;
+    }
+
+    return -1;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/0200-0299/0215.Kth Largest Element in an Array/README_EN.md

@@ -327,4 +327,38 @@ function findKthLargest(nums: number[], k: number): number {
 
 <!-- solution:end -->
 
+<!-- solution:end -->
+
+<!-- solution:start -->
+
+### Solution 4: Hash + counting
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function findKthLargest(nums: number[], k: number): number {
+    const n = 10 ** 4;
+    const length = n * 2 + 1;
+    const cnt = Array(length);
+
+    for (const x of nums) {
+        cnt[x + n] = (cnt[x + n] ?? 0) + 1;
+    }
+
+    for (let i = length; i >= 0; i--) {
+        if (!cnt[i]) continue;
+        k -= cnt[i];
+        if (k <= 0) return i - n;
+    }
+
+    return -1;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/0200-0299/0215.Kth Largest Element in an Array/Solution4.ts

@@ -0,0 +1,17 @@
+function findKthLargest(nums: number[], k: number): number {
+    const n = 10 ** 4;
+    const length = n * 2 + 1;
+    const cnt = Array(length);
+
+    for (const x of nums) {
+        cnt[x + n] = (cnt[x + n] ?? 0) + 1;
+    }
+
+    for (let i = length; i >= 0; i--) {
+        if (!cnt[i]) continue;
+        k -= cnt[i];
+        if (k <= 0) return i - n;
+    }
+
+    return -1;
+}