fix: change to ts

Author: HerrineKim

contains-duplicate/HerrineKim.js renamed to contains-duplicate/HerrineKim.ts

@@ -6,7 +6,7 @@
  */
 var longestConsecutive = function (nums) {
   // Set을 사용해 중복 제거
-  const numSet = new Set(nums);
+  const numSet: Set<number> = new Set(nums);
   let longestStreak = 0;
 
   // 각 숫자를 기준으로 연속 시퀀스를 탐색

house-robber/HerrineKim.js renamed to house-robber/HerrineKim.ts

@@ -7,19 +7,21 @@
  */
 var topKFrequent = function (nums, k) {
   // 빈도 계산
-  const frequencyMap = new Map();
+  const frequencyMap: Map<number, number> = new Map();
   for (let num of nums) {
     frequencyMap.set(num, (frequencyMap.get(num) || 0) + 1);
   }
 
   // 버킷 정렬
-  const bucket = Array(nums.length + 1).fill(null).map(() => []);
+  const bucket: number[][] = Array(nums.length + 1)
+    .fill(null)
+    .map(() => []);
   for (let [num, freq] of frequencyMap) {
     bucket[freq].push(num);
   }
 
   // 빈도 높은 요소들 추출
-  const result = [];
+  const result: number[] = [];
   for (let i = bucket.length - 1; i >= 0 && result.length < k; i--) {
     if (bucket[i].length > 0) {
       result.push(...bucket[i]);

longest-consecutive-sequence/HerrineKim.js renamed to longest-consecutive-sequence/HerrineKim.ts

@@ -9,7 +9,8 @@ var isPalindrome = function (s) {
   const cleanString = s.toLowerCase().replace(/[^a-z0-9]/g, "");
 
   // 양 끝에서 포인터를 이동하며 확인
-  let left = 0, right = cleanString.length - 1;
+  let left = 0,
+    right = cleanString.length - 1;
 
   while (left < right) {
     if (cleanString[left] !== cleanString[right]) {