diff --git a/JAVA/Fibonacci.java b/JAVA/Fibonacci.java
new file mode 100644
index 0000000..e17b229
--- /dev/null
+++ b/JAVA/Fibonacci.java
@@ -0,0 +1,32 @@
+import java.util.*;
+import java.math.BigInteger;
+
+public class Fibonacci {
+    public static void main(String[] args) {
+     Scanner sc = new Scanner(System.in);
+     System.out.print("Enter N (number of terms): ");
+        int n = sc.nextInt();
+
+        if (n <= 0) {
+            System.out.println("No terms to display.");
+            return;
+        }
+
+
+        BigInteger a = BigInteger.ZERO;   // F0
+        BigInteger b = BigInteger.ONE;    // F1
+
+
+        StringBuilder out = new StringBuilder();
+
+        for (int i = 1; i <= n; i++) {
+        out.append(a);
+        if(i < n) out.append(" ");
+        BigInteger next = a.add(b); // next = a + b
+        a = b;
+        b = next;
+        }
+
+        System.out.println(out.toString());
+    }
+}
diff --git a/JAVA/Palindrome.java b/JAVA/Palindrome.java
new file mode 100644
index 0000000..c490d6d
--- /dev/null
+++ b/JAVA/Palindrome.java
@@ -0,0 +1,18 @@
+import java.util.Scanner;
+
+public class Palindrome {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter a string: ");
+        String input = sc.nextLine();
+
+        // Normalize (ignore case and spaces)
+        String str = input.replaceAll("\\s+", "").toLowerCase();
+        String reversed = new StringBuilder(str).reverse().toString();
+
+        if (str.equals(reversed))
+            System.out.println("✅ '" + input + "' is a palindrome.");
+        else
+            System.out.println("❌ '" + input + "' is not a palindrome.");
+    }
+}