From bceafb3f5b202697570c3a6f335518232a54af07 Mon Sep 17 00:00:00 2001
From: doitchuu <seulgichu14@gmail.com>
Date: Sun, 22 Mar 2026 14:36:37 +0900
Subject: [PATCH 1/4] =?UTF-8?q?feat:=20Backspace=20String=20Compare=20?=
 =?UTF-8?q?=ED=92=80=EC=9D=B4=20=EC=9E=91=EC=84=B1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 doitchuu/BackspaceStringCompare.js | 22 ++++++++++++++++++++++
 1 file changed, 22 insertions(+)
 create mode 100644 doitchuu/BackspaceStringCompare.js

diff --git a/doitchuu/BackspaceStringCompare.js b/doitchuu/BackspaceStringCompare.js
new file mode 100644
index 0000000..ba47a24
--- /dev/null
+++ b/doitchuu/BackspaceStringCompare.js
@@ -0,0 +1,22 @@
+/**
+ * @param {string} s
+ * @param {string} t
+ * @return {boolean}
+ */
+var backspaceCompare = function(s, t) {
+    return getRemainString(s) === getRemainString(t);
+};
+
+function getRemainString(str) {
+    const stack = [];
+
+    for (let i = 0; i < str.length; i++) {
+        if (str[i] === "#") {
+            stack.pop();
+        } else {
+            stack.push(str[i]);
+        }
+    }
+
+    return stack.join("");
+}

From 5caf350351d9fa1edc1c11b7d64d935ea7b5f96c Mon Sep 17 00:00:00 2001
From: doitchuu <seulgichu14@gmail.com>
Date: Sun, 22 Mar 2026 14:37:18 +0900
Subject: [PATCH 2/4] =?UTF-8?q?feat:=20Counting=20Bits=20=ED=92=80?=
 =?UTF-8?q?=EC=9D=B4=20=EC=9E=91=EC=84=B1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 doitchuu/CountingBits.js | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)
 create mode 100644 doitchuu/CountingBits.js

diff --git a/doitchuu/CountingBits.js b/doitchuu/CountingBits.js
new file mode 100644
index 0000000..7fd6778
--- /dev/null
+++ b/doitchuu/CountingBits.js
@@ -0,0 +1,18 @@
+/**
+ * @param {number} n
+ * @return {number[]}
+ */
+var countBits = function(n) {
+    const dp = [0];
+
+    if (n === 0) {
+        return dp;
+    }
+
+    for (let i = 1; i <= n; i++) {
+        const count = i.toString(2).replaceAll("0", "").length;
+        dp.push(count);
+    }
+
+    return dp;
+};

From 5944d55e6c24d5283f49b9aa7441c43bf8fac3a2 Mon Sep 17 00:00:00 2001
From: doitchuu <seulgichu14@gmail.com>
Date: Fri, 27 Mar 2026 08:17:53 +0900
Subject: [PATCH 3/4] =?UTF-8?q?feat:=20Same=20Tree=20=ED=92=80=EC=9D=B4=20?=
 =?UTF-8?q?=EC=9E=91=EC=84=B1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 doitchuu/SameTree.js | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 doitchuu/SameTree.js

diff --git a/doitchuu/SameTree.js b/doitchuu/SameTree.js
new file mode 100644
index 0000000..e0a108b
--- /dev/null
+++ b/doitchuu/SameTree.js
@@ -0,0 +1,28 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} p
+ * @param {TreeNode} q
+ * @return {boolean}
+ */
+var isSameTree = function(p, q) {
+    if (p === null && q === null) {
+        return true;
+    }
+
+    if (p === null || q === null) {
+        return false;
+    }
+
+    if (p.val !== q.val) {
+        return false;
+    }
+
+    return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
+};

From 3be8f8528eb6cb75e0708fc77cede47e2aba39b6 Mon Sep 17 00:00:00 2001
From: doitchuu <seulgichu14@gmail.com>
Date: Fri, 27 Mar 2026 08:17:56 +0900
Subject: [PATCH 4/4] =?UTF-8?q?feat:=20Number=20of=201=20Bits=20=ED=92=80?=
 =?UTF-8?q?=EC=9D=B4=20=EC=9E=91=EC=84=B1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 doitchuu/NumberOf1Bits.js | 15 +++++++++++++++
 1 file changed, 15 insertions(+)
 create mode 100644 doitchuu/NumberOf1Bits.js

diff --git a/doitchuu/NumberOf1Bits.js b/doitchuu/NumberOf1Bits.js
new file mode 100644
index 0000000..66c9a45
--- /dev/null
+++ b/doitchuu/NumberOf1Bits.js
@@ -0,0 +1,15 @@
+/**
+ * @param {number} n - a positive integer
+ * @return {number}
+ */
+var hammingWeight = function(n) {
+    let current = n >>> 0;
+    let count = 0;
+
+    while (current !== 0) {
+        current &= current - 1;
+        count++;
+    }
+
+    return count;
+};