commit easy

AldythNahak · AldythNahak · commit cb7db5e7d1d8 · 2025-05-14T00:55:23.000+07:00
diff --git a/Easy/palindrome_number.java b/Easy/palindrome_number.java
@@ -0,0 +1,16 @@
+class Solution {
+    public boolean isPalindrome(int x) {
+        String strX = String.valueOf(x);
+        String strXR = new StringBuilder(strX).reverse().toString();
+        return strX.equals(strXR);
+    }
+}
+
+public class palindrome_number {
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+        System.out.println(solution.isPalindrome(121)); // true
+        System.out.println(solution.isPalindrome(-121)); // false
+        System.out.println(solution.isPalindrome(10)); // false
+    }
+}
diff --git a/Easy/two_sum.java b/Easy/two_sum.java
@@ -0,0 +1,31 @@
+import java.util.HashMap;
+import java.util.Map;
+
+class Solution {
+    public int[] twoSum(int[] nums, int target) {
+        Map<Integer, Integer> map = new HashMap<>();
+
+        for (int i = 0; i < nums.length; i++) {
+            int s = target - nums[i];
+
+            if (map.containsKey(s)) {
+                return new int[] { map.get(s), i };
+            }
+
+            map.put(nums[i], i);
+        }
+
+        return new int[0];
+    }
+
+}
+
+public class two_sum {
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+        System.out.println(solution.twoSum(new int[] { 2, 7, 11, 15 }, 9));
+        System.out.println(solution.twoSum(new int[] { 3, 2, 4 }, 6));
+        System.out.println(solution.twoSum(new int[] { 3, 3 }, 6));
+        System.out.println(solution.twoSum(new int[] { -3, 4, 3, 90 }, 0));
+    }
+}
