From 03151087404a9f184f8a16dfbad8b5a52c6d222a Mon Sep 17 00:00:00 2001
From: mintheon <mintheon@mintheon.com>
Date: Thu, 19 Dec 2024 00:43:48 +0900
Subject: [PATCH 1/4] valid anagram solved

---
 valid-anagram/mintheon.java | 13 +++++++++++++
 1 file changed, 13 insertions(+)
 create mode 100644 valid-anagram/mintheon.java

diff --git a/valid-anagram/mintheon.java b/valid-anagram/mintheon.java
new file mode 100644
index 000000000..7755b4af6
--- /dev/null
+++ b/valid-anagram/mintheon.java
@@ -0,0 +1,13 @@
+import java.util.Arrays;
+
+class Solution {
+  public boolean isAnagram(String s, String t) {
+    char[] sChar = s.toCharArray();
+    char[] tChar = t.toCharArray();
+
+    Arrays.sort(sChar);
+    Arrays.sort(tChar);
+
+    return Arrays.equals(sChar, tChar);
+  }
+}
\ No newline at end of file

From c0433e1a4a30437f1c0586faef812bb53a0249cd Mon Sep 17 00:00:00 2001
From: mintheon <mintheon@mintheon.com>
Date: Fri, 20 Dec 2024 02:06:15 +0900
Subject: [PATCH 2/4] climbing-stairs solved

---
 climbing-stairs/mintheon.java | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)
 create mode 100644 climbing-stairs/mintheon.java

diff --git a/climbing-stairs/mintheon.java b/climbing-stairs/mintheon.java
new file mode 100644
index 000000000..f9a3dcfef
--- /dev/null
+++ b/climbing-stairs/mintheon.java
@@ -0,0 +1,17 @@
+class Solution {
+  public int climbStairs(int n) {
+    int[] stepCount = new int[n + 1];
+
+    if(n == 1) {
+      return 1;
+    }
+
+    stepCount[1] = 1;
+    stepCount[2] = 2;
+    for(int i = 3; i <= n; i++) {
+      stepCount[i] = stepCount[i - 1] + stepCount[i - 2];
+    }
+
+    return stepCount[n];
+  }
+}
\ No newline at end of file

From 415e9e9ae2c2cd18a5ac92403cc0c0cfa1669851 Mon Sep 17 00:00:00 2001
From: mintheon <mintheon@mintheon.com>
Date: Fri, 20 Dec 2024 02:09:18 +0900
Subject: [PATCH 3/4] =?UTF-8?q?=EC=BD=94=EB=93=9C=20=EB=92=A4=20=EB=9D=BC?=
 =?UTF-8?q?=EC=9D=B8=20=EC=B6=94=EA=B0=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 climbing-stairs/mintheon.java | 2 +-
 valid-anagram/mintheon.java   | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/climbing-stairs/mintheon.java b/climbing-stairs/mintheon.java
index f9a3dcfef..9ab63331c 100644
--- a/climbing-stairs/mintheon.java
+++ b/climbing-stairs/mintheon.java
@@ -14,4 +14,4 @@ public int climbStairs(int n) {
 
     return stepCount[n];
   }
-}
\ No newline at end of file
+}
diff --git a/valid-anagram/mintheon.java b/valid-anagram/mintheon.java
index 7755b4af6..0fa6917b2 100644
--- a/valid-anagram/mintheon.java
+++ b/valid-anagram/mintheon.java
@@ -10,4 +10,4 @@ public boolean isAnagram(String s, String t) {
 
     return Arrays.equals(sChar, tChar);
   }
-}
\ No newline at end of file
+}

From 6779b7fcc56350ca9239de5658bc5954f952cb73 Mon Sep 17 00:00:00 2001
From: mintheon <mintheon@mintheon.com>
Date: Sat, 21 Dec 2024 17:02:14 +0900
Subject: [PATCH 4/4] 3sum solved

---
 3sum/mintheon.java | 35 +++++++++++++++++++++++++++++++++++
 1 file changed, 35 insertions(+)
 create mode 100644 3sum/mintheon.java

diff --git a/3sum/mintheon.java b/3sum/mintheon.java
new file mode 100644
index 000000000..37d39e3cc
--- /dev/null
+++ b/3sum/mintheon.java
@@ -0,0 +1,35 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Set;
+
+class Solution {
+  public List<List<Integer>> threeSum(int[] nums) {
+    Arrays.sort(nums);
+
+    Set<List<Integer>> answer = new HashSet<>();
+
+    for(int i = 0; i < nums.length - 2; i++) {
+      int left = i + 1;
+      int right = nums.length - 1;
+
+      while(left < right) {
+        int sum = nums[i] + nums[left] + nums[right];
+
+        if(sum < 0) {
+          left++;
+        } else if(sum > 0) {
+          right--;
+        } else{
+          answer.add(List.of(nums[i], nums[left], nums[right]));
+
+          left++;
+          right--;
+        }
+      }
+    }
+
+    return new ArrayList<>(answer);
+  }
+}