DaleStudy · Cyjin-jani · Mar 3, 2026 · Mar 3, 2026 · Mar 5, 2026 · doh6077
diff --git a/contains-duplicate/Cyjin-jani.js b/contains-duplicate/Cyjin-jani.js
@@ -0,0 +1,4 @@
+const containsDuplicate = function (nums) {
+  const data = new Set(nums);
+  return data.size !== nums.length;
+};
diff --git a/top-k-frequent-elements/Cyjin-jani.js b/top-k-frequent-elements/Cyjin-jani.js
@@ -0,0 +1,16 @@
+const topKFrequent = function (nums, k) {
+  const tempArr = Array.from({ length: nums.length }, () => []);
+  const obj = {};
+
+  for (let num of nums) {
+    obj[num] = (obj[num] || 0) + 1;
+  }
+
+  for (let key in obj) {
+    const val = obj[key] - 1;
+    tempArr[val].push(+key);
+  }
+
+  const answer = tempArr.flat();
-  const answer = tempArr.flat();
+  const answer = [];
+  for (let i = tempArr.length - 1; i >= 0; i--) {
+    for (let num of tempArr[i]) {
+      answer.push(num);
+      if (answer.length === k) return answer;
+    }
+  }
+
+  return answer;
-  const answer = tempArr.flat();
+  const answer = [];
+  for (let i = tempArr.length - 1; i >= 0; i--) {
+    for (let num of tempArr[i]) {
+      answer.push(num);
+      if (answer.length === k) return answer;
+    }
+  }
+
+  return answer;
+  return answer.slice(-k);
+};
diff --git a/two-sum/Cyjin-jani.js b/two-sum/Cyjin-jani.js
@@ -0,0 +1,14 @@
+const twoSum = function (nums, target) {
+  let memo = {};
+
+  for (let i = 0; i < nums.length; i++) {
+    let current = nums[i];
+    let needed = target - current;
+
+    if (needed in memo) {
+      return [memo[needed], i];
+    }
+
+    memo[current] = i;
+  }
+};