From 2646492e5eea527ac224f83b7515285785faac8a Mon Sep 17 00:00:00 2001
From: toychip <dlawnsgud427@naver.com>
Date: Tue, 15 Apr 2025 20:24:51 +0900
Subject: [PATCH 1/3] valid-palindrome solution

---
 valid-palindrome/toychip.java | 33 +++++++++++++++++++++++++++++++++
 1 file changed, 33 insertions(+)
 create mode 100644 valid-palindrome/toychip.java

diff --git a/valid-palindrome/toychip.java b/valid-palindrome/toychip.java
new file mode 100644
index 000000000..bc62fee73
--- /dev/null
+++ b/valid-palindrome/toychip.java
@@ -0,0 +1,33 @@
+class Solution {
+    public boolean isPalindrome(String s) {
+        char[] charArray = s.toCharArray();
+        StringBuilder stringBuilder = new StringBuilder();
+
+        for (char c : charArray) {
+            if (Character.isLetterOrDigit(c)) {
+                stringBuilder.append(c);
+            }
+        }
+
+        String validChars = stringBuilder.toString();
+
+        char[] validArray = validChars.toCharArray();
+        char[] reversArray = new char[validArray.length];
+
+        for (int i = 0; i < validArray.length; i++) {
+            validArray[i] = Character.toLowerCase(validArray[i]);
+            reversArray[i] = Character.toLowerCase(reversArray[i]);
+        }
+
+        for (int i = 0; i < validArray.length; i++) {
+            reversArray[validArray.length - 1 - i] = validArray[i];
+        }
+
+        for (int i = 0; i < validArray.length; i++) {
+            if (reversArray[i] != validArray[i]) {
+                return false;
+            }
+        }
+        return true;
+    }
+}

From bc61f75fa819d3b0920b38399636d4ad49ab0c5e Mon Sep 17 00:00:00 2001
From: toychip <dlawnsgud427@naver.com>
Date: Thu, 17 Apr 2025 18:32:04 +0900
Subject: [PATCH 2/3] maximum-subarray solution

---
 maximum-subarray/toychip.java | 12 ++++++++++++
 1 file changed, 12 insertions(+)
 create mode 100644 maximum-subarray/toychip.java

diff --git a/maximum-subarray/toychip.java b/maximum-subarray/toychip.java
new file mode 100644
index 000000000..3bc51f3fd
--- /dev/null
+++ b/maximum-subarray/toychip.java
@@ -0,0 +1,12 @@
+class Solution {
+    public int maxSubArray(int[] nums) {
+        int maxSum = nums[0];
+        int currentSum = nums[0];
+
+        for (int i = 1; i < nums.length; i++) {
+            currentSum = Math.max(nums[i], currentSum + nums[i]);
+            maxSum = Math.max(maxSum, currentSum);
+        }
+        return maxSum;
+    }
+}
\ No newline at end of file

From 4a3e9bb6307b4ab246ead3bcfa559a4f2840e44d Mon Sep 17 00:00:00 2001
From: toychip <dlawnsgud427@naver.com>
Date: Thu, 17 Apr 2025 18:32:48 +0900
Subject: [PATCH 3/3] blank lint

---
 maximum-subarray/toychip.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/maximum-subarray/toychip.java b/maximum-subarray/toychip.java
index 3bc51f3fd..30c491520 100644
--- a/maximum-subarray/toychip.java
+++ b/maximum-subarray/toychip.java
@@ -9,4 +9,4 @@ public int maxSubArray(int[] nums) {
         }
         return maxSum;
     }
-}
\ No newline at end of file
+}