From dca831041a6a52a1eefa7c5cf1e08ab90a39f73b Mon Sep 17 00:00:00 2001
From: sap <sabark@eluocnc.com>
Date: Mon, 12 Aug 2024 17:21:01 +0900
Subject: [PATCH 1/2] contains-duplicate solution

---
 contains-duplicate/seona926.js | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 contains-duplicate/seona926.js

diff --git a/contains-duplicate/seona926.js b/contains-duplicate/seona926.js
new file mode 100644
index 000000000..2721c3e59
--- /dev/null
+++ b/contains-duplicate/seona926.js
@@ -0,0 +1,16 @@
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+let containsDuplicate = function (nums) {
+  let counts = {};
+
+  return nums.some((num) => {
+    if (counts[num] === undefined) {
+      counts[num] = 1;
+      return false;
+    } else {
+      return true;
+    }
+  });
+};

From 07db313f486e0acff4bc78b0422b5b6e43b9536f Mon Sep 17 00:00:00 2001
From: sap <sabark@eluocnc.com>
Date: Wed, 14 Aug 2024 18:17:40 +0900
Subject: [PATCH 2/2] number-of-1-bits solution

---
 number-of-1-bits/seona926.js | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)
 create mode 100644 number-of-1-bits/seona926.js

diff --git a/number-of-1-bits/seona926.js b/number-of-1-bits/seona926.js
new file mode 100644
index 000000000..a3def9ccf
--- /dev/null
+++ b/number-of-1-bits/seona926.js
@@ -0,0 +1,19 @@
+/**
+ * @param {number} n
+ * @return {number}
+ */
+let hammingWeight = function (n) {
+  let count = 0;
+  let sum = n;
+
+  while (sum > 0) {
+    // n에서 가장 오른쪽 비트가 1인 경우 count 증가
+    if (sum % 2 === 1) {
+      count++;
+    }
+    // sum을 2로 나누어서 다음 비트를 확인
+    sum = Math.floor(sum / 2);
+  }
+
+  return count;
+};