diff --git a/Anisha_AbundantNumber.java b/Anisha_AbundantNumber.java
new file mode 100644
index 0000000..ac0b0c8
--- /dev/null
+++ b/Anisha_AbundantNumber.java
@@ -0,0 +1,23 @@
+import java.util.Scanner;
+public class Anisha_AbundantNumber {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter a number: ");
+        int num = sc.nextInt();
+        sc.close();
+
+        int sum = 0;
+        
+        for (int i = 1; i <= num / 2; i++) {
+            if (num % i == 0) {
+                sum += i;
+            }
+        }
+
+        if (sum > num) {
+            System.out.println("It's an Abundant Number");
+        } else {
+            System.out.println("Not an Abundant Number");
+        }
+    }
+}
diff --git a/Anisha_AddTwoFractions.java b/Anisha_AddTwoFractions.java
new file mode 100644
index 0000000..2e9260f
--- /dev/null
+++ b/Anisha_AddTwoFractions.java
@@ -0,0 +1,52 @@
+import java.util.Scanner;
+
+public class Anisha_AddTwoFractions {
+
+    // Method to find HCF (GCD)
+    static int findHCF(int a, int b) {
+        while (b != 0) {
+            int temp = b;
+            b = a % b;
+            a = temp;
+        }
+        return a;
+    }
+
+    // Method to find LCM
+    static int findLCM(int a, int b) {
+        return (a * b) / findHCF(a, b);
+    }
+
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+
+        // Input first fraction
+        System.out.print("Enter numerator of first fraction: ");
+        int n1 = sc.nextInt();
+        System.out.print("Enter denominator of first fraction: ");
+        int d1 = sc.nextInt();
+
+        // Input second fraction
+        System.out.print("Enter numerator of second fraction: ");
+        int n2 = sc.nextInt();
+        System.out.print("Enter denominator of second fraction: ");
+        int d2 = sc.nextInt();
+
+        // Find LCM of denominators
+        int lcm = findLCM(d1, d2);
+
+        // Convert fractions and add
+        int sumNumerator = (n1 * (lcm / d1)) + (n2 * (lcm / d2));
+        int sumDenominator = lcm;
+
+        // Simplify the fraction
+        int hcf = findHCF(sumNumerator, sumDenominator);
+        sumNumerator /= hcf;
+        sumDenominator /= hcf;
+
+        // Output result
+        System.out.println("Sum of fractions = " + sumNumerator + "/" + sumDenominator);
+
+        sc.close();
+    }
+}
diff --git a/Anisha_AreaOfCircle.java b/Anisha_AreaOfCircle.java
new file mode 100644
index 0000000..a225f58
--- /dev/null
+++ b/Anisha_AreaOfCircle.java
@@ -0,0 +1,10 @@
+import java.util.Scanner;
+public class Anisha_AreaOfCircle {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        double r = sc.nextDouble();
+        double area = 3.14*r*r;
+        System.out.println("Radius od circle is: "+area);
+        sc.close();
+    }
+}
diff --git a/Anisha_ArmstrongNumber.java b/Anisha_ArmstrongNumber.java
new file mode 100644
index 0000000..bbd1ecf
--- /dev/null
+++ b/Anisha_ArmstrongNumber.java
@@ -0,0 +1,35 @@
+import java.util.Scanner;
+public class Anisha_ArmstrongNumber {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.println("Enter a number: ");
+        int num = sc.nextInt();
+        sc.close();
+        int len = count(num);
+        if(armstrong(num,len)){
+            System.out.println(num + " is an armstrong");
+        }
+        else{
+            System.out.println(num + " is not  an armstrong");
+        }
+
+    }
+    static int count (int x){
+        int c = 0;
+        while(x>0){
+            c++;
+            x = x/10;
+        }
+        return c;
+    }
+    static boolean armstrong(int num,int len){
+        int sum =0;
+        int temp = num;
+        while(temp!=0){
+            int ld = temp%10;
+            sum = sum + (int)Math.pow(ld,len);
+            temp/=10;
+        };
+        return sum==num;
+    }
+}
diff --git a/Anisha_ArmstrongNumberinGivenRange.java b/Anisha_ArmstrongNumberinGivenRange.java
new file mode 100644
index 0000000..bda9f08
--- /dev/null
+++ b/Anisha_ArmstrongNumberinGivenRange.java
@@ -0,0 +1,36 @@
+import java.util.Scanner;
+public class Anisha_ArmstrongNumberinGivenRange {
+
+    static int count(int n){
+        int c =0;
+        while(n>0){
+            c++;
+            n = n/10;
+        }
+        return c;
+    }
+    static boolean isArmStrong(int num){
+        int len = count(num);
+        int temp = num;
+        int sum = 0;
+        while(temp>0){
+            int di = temp%10;
+            sum = sum + (int) Math.pow(di,len);
+            temp/=10;
+        }
+        return sum==num;
+    }
+
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.println("Enter the range: ");
+        int low = sc.nextInt();
+        int high = sc.nextInt();
+        for(int i = low;i<=high;i++){
+            if(isArmStrong(i)){
+                System.out.print(i + " ");
+            }
+        }
+        sc.close();
+    }
+}
diff --git a/Anisha_AutomorphicNumber.java b/Anisha_AutomorphicNumber.java
new file mode 100644
index 0000000..6b98d92
--- /dev/null
+++ b/Anisha_AutomorphicNumber.java
@@ -0,0 +1,20 @@
+import java.util.Scanner;
+public class Anisha_AutomorphicNumber {
+    public static void main(String[] args) {
+        Scanner sc  = new Scanner(System.in);
+        System.out.println("Enter a number: ");
+        int n = sc.nextInt();
+        sc.close();
+        int sq = n*n;
+        String num = String.valueOf(n);
+        String square = String.valueOf(sq);
+        if(square.endsWith(num)){
+            System.out.println("Yes, it's an AUtomorphic Number");
+
+        }
+        else{
+            System.out.println("No it's not an Automorphic Number");
+        }
+
+    }
+}
diff --git a/Anisha_BinaryToOctal.java b/Anisha_BinaryToOctal.java
new file mode 100644
index 0000000..32ec800
--- /dev/null
+++ b/Anisha_BinaryToOctal.java
@@ -0,0 +1,36 @@
+import java.util.Scanner;
+
+public class Anisha_BinaryToOctal {
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter a Binary Number: ");
+        String binary = sc.next();
+        sc.close();
+
+        // Step 1: Binary to Decimal
+        int decimal = 0;
+        int power = 0;
+
+        for (int i = binary.length() - 1; i >= 0; i--) {
+            int digit = binary.charAt(i) - '0';
+            decimal += digit * Math.pow(2, power);
+            power++;
+        }
+
+        // Step 2: Decimal to Octal
+        int[] octal = new int[32];
+        int index = 0;
+
+        while (decimal > 0) {
+            octal[index] = decimal % 8;
+            decimal = decimal / 8;
+            index++;
+        }
+
+        System.out.print("Octal value = ");
+        for (int i = index - 1; i >= 0; i--) {
+            System.out.print(octal[i]);
+        }
+    }
+}
diff --git a/Anisha_BinearyToDecimal.java b/Anisha_BinearyToDecimal.java
new file mode 100644
index 0000000..4623eaa
--- /dev/null
+++ b/Anisha_BinearyToDecimal.java
@@ -0,0 +1,23 @@
+import java.util.Scanner;
+
+public class Anisha_BinearyToDecimal {
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter a binary number: ");
+        int binary = sc.nextInt();
+        sc.close();
+
+        int decimal = 0;
+        int power = 0;
+
+        while (binary > 0) {
+            int digit = binary % 10;
+            decimal = decimal + digit * (int)Math.pow(2, power);
+            binary = binary / 10;
+            power++;
+        }
+
+        System.out.println("Decimal equivalent: " + decimal);
+    }
+}
diff --git a/Anisha_CountNumberOfDigitsInInteger.java b/Anisha_CountNumberOfDigitsInInteger.java
new file mode 100644
index 0000000..f34520c
--- /dev/null
+++ b/Anisha_CountNumberOfDigitsInInteger.java
@@ -0,0 +1,31 @@
+import java.util.Scanner;
+
+public class Anisha_CountNumberOfDigitsInInteger {
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter an integer: ");
+        int num = sc.nextInt();
+
+        int count = 0;
+        int temp = num;
+
+        if (temp == 0) {
+            count = 1;
+        } else {
+            if (temp < 0) {
+                temp = -temp;  // convert negative to positive
+            }
+
+            while (temp != 0) {
+                temp = temp / 10;
+                count++;
+            }
+        }
+
+        System.out.println("Number of digits = " + count);
+        sc.close();
+    }
+}
diff --git a/Anisha_CountNumbersWithExactlyXDivisors.java b/Anisha_CountNumbersWithExactlyXDivisors.java
new file mode 100644
index 0000000..d36f9d0
--- /dev/null
+++ b/Anisha_CountNumbersWithExactlyXDivisors.java
@@ -0,0 +1,45 @@
+import java.util.Scanner;
+public class Anisha_CountNumbersWithExactlyXDivisors {
+    static int countDivisors(int num) {
+        int count = 0;
+
+        for (int i = 1; i <= num; i++) {
+            if (num % i == 0) {
+                count++;
+            }
+        }
+        return count;
+    }
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter starting range: ");
+        int start = sc.nextInt();
+
+        System.out.print("Enter ending range: ");
+        int end = sc.nextInt();
+
+        System.out.print("Enter X (number of divisors): ");
+        int x = sc.nextInt();
+
+        int totalNumbers = 0;
+
+        System.out.println("\nNumbers having exactly " + x + " divisors are:");
+
+        for (int num = start; num <= end; num++) {
+            int divisors = countDivisors(num);
+
+            if (divisors == x) {
+                System.out.print(num + " ");
+                totalNumbers++;
+            }
+        }
+
+        System.out.println("\n\nTotal count = " + totalNumbers);
+
+        sc.close();
+    }
+}
+
diff --git a/Anisha_DaysInMonthGivenYear.java b/Anisha_DaysInMonthGivenYear.java
new file mode 100644
index 0000000..911f37a
--- /dev/null
+++ b/Anisha_DaysInMonthGivenYear.java
@@ -0,0 +1,33 @@
+import java.util.Scanner;
+public class Anisha_DaysInMonthGivenYear {
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter month (1-12): ");
+        int month = sc.nextInt();
+
+        System.out.print("Enter year: ");
+        int year = sc.nextInt();
+
+        if (month < 1 || month > 12) {
+            System.out.println("Invalid month! Enter between 1 to 12.");
+        }
+
+        else if ((month == 2) && ((year % 400 == 0) || (year % 4 == 0 && year % 100 != 0)))
+            System.out.println("Number of days is 29");
+
+        else if (month == 2)
+            System.out.println("Number of days is 28");
+
+        else if (month == 1 || month == 3 || month == 5 || month == 7 ||
+                 month == 8 || month == 10 || month == 12)
+            System.out.println("Number of days is 31");
+
+        else
+            System.out.println("Number of days is 30");
+
+        sc.close();
+    }
+}
diff --git a/Anisha_DecimalToBinary.java b/Anisha_DecimalToBinary.java
new file mode 100644
index 0000000..89f0d8e
--- /dev/null
+++ b/Anisha_DecimalToBinary.java
@@ -0,0 +1,20 @@
+import java.util.Scanner;
+public class Anisha_DecimalToBinary {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter a Decimal Number: ");
+        int num = sc.nextInt();
+        sc.close();
+        int[] binary = new int[32];
+        int index = 0;
+        while (num > 0) {
+            binary[index] = num % 2;
+            num = num / 2;
+            index++;
+        }
+        System.out.print("Binary value = ");
+        for (int i = index - 1; i >= 0; i--) {
+            System.out.print(binary[i]);
+        }
+    }
+}
diff --git a/Anisha_DecimalToHexadecimal.java b/Anisha_DecimalToHexadecimal.java
new file mode 100644
index 0000000..cb9dbc7
--- /dev/null
+++ b/Anisha_DecimalToHexadecimal.java
@@ -0,0 +1,33 @@
+
+import java.util.Scanner;
+
+public class Anisha_DecimalToHexadecimal {
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter a Decimal Number: ");
+        int num = sc.nextInt();
+        sc.close();
+
+        char[] hex = new char[32];
+        int index = 0;
+
+        while (num > 0) {
+            int rem = num % 16;
+
+            if (rem < 10) {
+                hex[index] = (char)(rem + '0');
+            } else {
+                hex[index] = (char)(rem - 10 + 'A');
+            }
+
+            num = num / 16;
+            index++;
+        }
+
+        System.out.print("Hexadecimal value = ");
+        for (int i = index - 1; i >= 0; i--) {
+            System.out.print(hex[i]);
+        }
+    }
+}
diff --git a/Anisha_DecimalToOctal.java b/Anisha_DecimalToOctal.java
new file mode 100644
index 0000000..9857bd9
--- /dev/null
+++ b/Anisha_DecimalToOctal.java
@@ -0,0 +1,21 @@
+import java.util.Scanner;
+public class Anisha_DecimalToOctal {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter a Decimal Number: ");
+        int num = sc.nextInt();
+        sc.close();
+        int[] octal = new int[32];
+        int index = 0;
+        while (num > 0) {
+            octal[index] = num % 8;
+            num = num / 8;
+            index++;
+        }
+        System.out.print("Octal value = ");
+        for (int i = index - 1; i >= 0; i--) {
+            System.out.print(octal[i]);
+        }
+    }
+}
+
diff --git a/Anisha_EvenOrOdd.java b/Anisha_EvenOrOdd.java
new file mode 100644
index 0000000..c709ecb
--- /dev/null
+++ b/Anisha_EvenOrOdd.java
@@ -0,0 +1,14 @@
+import java.util.Scanner;
+
+public class Anisha_EvenOrOdd {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int num = sc.nextInt();
+        sc.close();
+
+        if (num % 2 == 0)
+            System.out.println("Even");
+        else
+            System.out.println("Odd");
+    }
+}
diff --git a/Anisha_FactorOfANumber.java b/Anisha_FactorOfANumber.java
new file mode 100644
index 0000000..1b6d0de
--- /dev/null
+++ b/Anisha_FactorOfANumber.java
@@ -0,0 +1,15 @@
+import java.util.Scanner;
+public class Anisha_FactorOfANumber {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.println("Enter a numbr: ");
+        int num = sc.nextInt();
+        sc.close();
+        System.out.println(" Factors of " + num + " are ");
+        for(int i = 1;i<=num;i++){
+            if(num%i==0){
+                System.out.print(i + " ");
+            }
+        }
+    }
+}
diff --git a/Anisha_FactorialOfnum.java b/Anisha_FactorialOfnum.java
new file mode 100644
index 0000000..59fdce6
--- /dev/null
+++ b/Anisha_FactorialOfnum.java
@@ -0,0 +1,14 @@
+import java.util.Scanner;
+public class Anisha_FactorialOfnum {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.println("Enter the number: ");
+        int num = sc.nextInt();
+        sc.close();
+        int fac = 1;
+        for(int i =1;i<=num;i++){
+            fac*=i;
+        }
+        System.out.println("Factorial = " + fac);
+    }
+}
diff --git a/Anisha_FibonacciSerirsuptoN.java b/Anisha_FibonacciSerirsuptoN.java
new file mode 100644
index 0000000..45c4242
--- /dev/null
+++ b/Anisha_FibonacciSerirsuptoN.java
@@ -0,0 +1,17 @@
+import java.util.Scanner;
+public class Anisha_FibonacciSerirsuptoN {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.println("Enter a number: ");
+        int num = sc.nextInt();
+        sc.close();
+        int a = 0,b = 1;
+        for(int i =0;i<=num;i++){
+            System.out.print(a + " ");
+            int c = a+b;
+            a = b;
+            b = c;
+        }
+    }
+    
+}
diff --git a/Anisha_FnthTerm.java b/Anisha_FnthTerm.java
new file mode 100644
index 0000000..41287dc
--- /dev/null
+++ b/Anisha_FnthTerm.java
@@ -0,0 +1,28 @@
+import java.util.Scanner;
+public class Anisha_FnthTerm {
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter N: ");
+        int N = sc.nextInt();
+
+        long sum = 0;
+        int num = 1; // number starts from 1
+
+        for (int i = 1; i <= N; i++) {
+            long product = 1;
+
+            // multiply i numbers
+            for (int j = 1; j <= i; j++) {
+                product = product * num;
+                num++;
+            }
+
+            sum = sum + product;
+        }
+
+        System.out.println(sum);
+        sc.close();
+    }
+}
+
diff --git a/Anisha_FriendlyPair.java b/Anisha_FriendlyPair.java
new file mode 100644
index 0000000..f8595b4
--- /dev/null
+++ b/Anisha_FriendlyPair.java
@@ -0,0 +1,35 @@
+import java.util.Scanner;
+
+public class Anisha_FriendlyPair {
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter first number: ");
+        int num1 = sc.nextInt();
+
+        System.out.print("Enter second number: ");
+        int num2 = sc.nextInt();
+
+        sc.close();
+
+        int sum1 = 0, sum2 = 0;
+        for (int i = 1; i <= num1; i++) {
+            if (num1 % i == 0) {
+                sum1 += i;
+            }
+        }
+        for (int i = 1; i <= num2; i++) {
+            if (num2 % i == 0) {
+                sum2 += i;
+            }
+        }
+
+        if ((sum1 / num1) == (sum2 / num2)) {
+            System.out.println("Yes, they are a Friendly Pair.");
+        } else {
+            System.out.println("No, they are not a Friendly Pair.");
+        }
+    }
+}
+
diff --git a/Anisha_GreatestOfThree.java b/Anisha_GreatestOfThree.java
new file mode 100644
index 0000000..a369570
--- /dev/null
+++ b/Anisha_GreatestOfThree.java
@@ -0,0 +1,32 @@
+import java.util.Scanner;
+
+public class Anisha_GreatestOfThree {
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter first number: ");
+        int a = sc.nextInt();
+
+        System.out.print("Enter second number: ");
+        int b = sc.nextInt();
+
+        System.out.print("Enter third number: ");
+        int c = sc.nextInt();
+        sc.close();
+
+        if (a > b && a > c) {
+            System.out.println(a + " is the greatest number");
+        }
+        else if (b > a && b > c) {
+            System.out.println(b + " is the greatest number");
+        }
+        else if (c > a && c > b) {
+            System.out.println(c + " is the greatest number");
+        }
+        else {
+            System.out.println("All three numbers are equal or two are equal and greatest");
+        }
+    }
+}
+
diff --git a/Anisha_GreatestOfTwo.java b/Anisha_GreatestOfTwo.java
new file mode 100644
index 0000000..308862e
--- /dev/null
+++ b/Anisha_GreatestOfTwo.java
@@ -0,0 +1,15 @@
+import java.util.Scanner;
+
+public class Anisha_GreatestOfTwo {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int a = sc.nextInt();
+        int b = sc.nextInt();
+        sc.close();
+
+        if (a > b)
+            System.out.println(a);
+        else
+            System.out.println(b);
+    }
+}
diff --git a/Anisha_HCF.java b/Anisha_HCF.java
new file mode 100644
index 0000000..2bd0d9a
--- /dev/null
+++ b/Anisha_HCF.java
@@ -0,0 +1,20 @@
+import java.util.Scanner;
+public class Anisha_HCF {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+
+        int a = sc.nextInt();
+        int b = sc.nextInt();
+        sc.close();
+
+        int hcf = 1;
+
+        for (int i = 1; i <= Math.min(a, b); i++) {
+            if (a % i == 0 && b % i == 0) {
+                hcf = i;
+            }
+        }
+
+        System.out.println("HCF = " + hcf);
+    }
+}
diff --git a/Anisha_HCFRecursion.java b/Anisha_HCFRecursion.java
new file mode 100644
index 0000000..17f90f4
--- /dev/null
+++ b/Anisha_HCFRecursion.java
@@ -0,0 +1,26 @@
+import java.util.Scanner;
+public class Anisha_HCFRecursion {
+
+    static int hcf(int a, int b) {
+
+        if (b == 0)
+            return a;
+        return hcf(b, a % b);
+    }
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter first number: ");
+        int a = sc.nextInt();
+
+        System.out.print("Enter second number: ");
+        int b = sc.nextInt();
+
+        int result = hcf(a, b);
+
+        System.out.println("HCF of " + a + " and " + b + " is " + result);
+        sc.close();
+    }
+}
diff --git a/Anisha_HandShake.java b/Anisha_HandShake.java
new file mode 100644
index 0000000..3b6b435
--- /dev/null
+++ b/Anisha_HandShake.java
@@ -0,0 +1,10 @@
+import java.util.Scanner;
+public class Anisha_HandShake {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int num = sc.nextInt();
+        sc.close();
+        int total = (num-1)*num /2;
+        System.out.println("for "+num+" people there will be "+total+" handshakes");
+    }
+}
diff --git a/Anisha_HarshadNumber.java b/Anisha_HarshadNumber.java
new file mode 100644
index 0000000..97624d6
--- /dev/null
+++ b/Anisha_HarshadNumber.java
@@ -0,0 +1,21 @@
+import java.util.Scanner;
+public class Anisha_HarshadNumber {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.println("Enter a number: ");
+        int num = sc.nextInt();
+        sc.close();
+        int sum =0;
+        while(num>0){
+            int ld = num%10;
+            sum = sum+ld;
+            num/=10;
+        }
+        if(num%sum==0){
+            System.out.println("Harshad Number.");
+        }
+        else{
+            System.out.println("Not a Harshad Number");
+        }
+    }
+}
diff --git a/Anisha_HexadecimalToDecimal.java b/Anisha_HexadecimalToDecimal.java
new file mode 100644
index 0000000..1e8be29
--- /dev/null
+++ b/Anisha_HexadecimalToDecimal.java
@@ -0,0 +1,28 @@
+import java.util.Scanner;
+public class Anisha_HexadecimalToDecimal {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter a Hexadecimal Number: ");
+        String hex = sc.next().toUpperCase();
+        sc.close();
+
+        int decimal = 0;
+        int power = 0;
+
+        for (int i = hex.length() - 1; i >= 0; i--) {
+            char ch = hex.charAt(i);
+            int value;
+
+            if (ch >= '0' && ch <= '9') {
+                value = ch - '0';
+            } else {
+                value = ch - 'A' + 10;
+            }
+
+            decimal += value * Math.pow(16, power);
+            power++;
+        }
+
+        System.out.println("Decimal value = " + decimal);
+    }
+}
diff --git a/Anisha_LCM.java b/Anisha_LCM.java
new file mode 100644
index 0000000..c6ac769
--- /dev/null
+++ b/Anisha_LCM.java
@@ -0,0 +1,21 @@
+
+import java.util.Scanner;
+public class Anisha_LCM {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+
+        int a = sc.nextInt();
+        int b = sc.nextInt();
+        sc.close();
+
+        int max = Math.max(a, b);
+
+        while (true) {
+            if (max % a == 0 && max % b == 0) {
+                System.out.println("LCM = " + max);
+                break;
+            }
+            max++;
+        }
+    }
+}
diff --git a/Anisha_LCMRecusion.java b/Anisha_LCMRecusion.java
new file mode 100644
index 0000000..9c60d8b
--- /dev/null
+++ b/Anisha_LCMRecusion.java
@@ -0,0 +1,31 @@
+import java.util.Scanner;
+public class Anisha_LCMRecusion {
+
+    // Recursive function to find HCF
+    static int hcf(int a, int b) {
+        if (b == 0)
+            return a;
+
+        return hcf(b, a % b);
+    }
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter first number: ");
+        int num1 = sc.nextInt();
+
+        System.out.print("Enter second number: ");
+        int num2 = sc.nextInt();
+
+        int hcfValue = hcf(num1, num2);
+
+        int lcm = (num1 * num2) / hcfValue;
+
+        System.out.println("LCM of " + num1 + " and " + num2 + " is " + lcm);
+        sc.close();
+    }
+}
+
+
diff --git a/Anisha_LargestElemenetRecursion.java b/Anisha_LargestElemenetRecursion.java
new file mode 100644
index 0000000..282c942
--- /dev/null
+++ b/Anisha_LargestElemenetRecursion.java
@@ -0,0 +1,30 @@
+import java.util.Scanner;
+public class Anisha_LargestElemenetRecursion {
+    static int findMax(int[] arr, int n) {
+
+        if (n == 1)
+            return arr[0];
+
+        int maxOfRest = findMax(arr, n - 1);
+
+        return Math.max(arr[n - 1], maxOfRest);
+    }
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter size of array: ");
+        int n = sc.nextInt();
+
+        int[] arr = new int[n];
+
+        System.out.println("Enter array elements:");
+        for (int i = 0; i < n; i++) {
+            arr[i] = sc.nextInt();
+        }
+        int max = findMax(arr, n);
+
+        System.out.println("Largest Element is " + max);
+        sc.close();
+    }
+}
diff --git a/Anisha_LeapYear.java b/Anisha_LeapYear.java
new file mode 100644
index 0000000..a74ce46
--- /dev/null
+++ b/Anisha_LeapYear.java
@@ -0,0 +1,14 @@
+import java.util.Scanner;
+
+public class Anisha_LeapYear {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int year = sc.nextInt();
+        sc.close();
+
+        if ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0))
+            System.out.println("Leap Year");
+        else
+            System.out.println("Not a Leap Year");
+    }
+}
diff --git a/Anisha_LengthOfString.java b/Anisha_LengthOfString.java
new file mode 100644
index 0000000..ea86533
--- /dev/null
+++ b/Anisha_LengthOfString.java
@@ -0,0 +1,27 @@
+import java.util.Scanner;
+public class Anisha_LengthOfString {
+
+    static int lengthRec(String str) {
+
+        // Base case: empty string
+        if (str.equals(""))
+            return 0;
+
+        // Recursive call (remove first character)
+        return 1 + lengthRec(str.substring(1));
+    }
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter a string: ");
+        String str = sc.nextLine();
+
+        int len = lengthRec(str);
+
+        System.out.println("Length of " + str + " is " + len);
+        sc.close();
+    }
+}
+
diff --git a/Anisha_Nthibonacci.java b/Anisha_Nthibonacci.java
new file mode 100644
index 0000000..910a0d7
--- /dev/null
+++ b/Anisha_Nthibonacci.java
@@ -0,0 +1,19 @@
+import java.util.Scanner;
+public class Anisha_Nthibonacci {
+     public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter N: ");
+        int n = sc.nextInt();
+        sc.close();
+
+        int a = 0, b = 1;
+
+        for (int i = 1; i <= n; i++) {
+            System.out.print(a + " ");
+            int c = a + b;
+            a = b;
+            b = c;
+        }
+    }
+}
diff --git a/Anisha_NumberToWords0To9999.java b/Anisha_NumberToWords0To9999.java
new file mode 100644
index 0000000..8eee9c7
--- /dev/null
+++ b/Anisha_NumberToWords0To9999.java
@@ -0,0 +1,75 @@
+import java.util.Scanner;
+
+public class Anisha_NumberToWords0To9999 {
+
+    // Function to convert 1 to 999 into words
+    static String display(int num) {
+
+        String[] ones = {
+                "", "One", "Two", "Three", "Four", "Five",
+                "Six", "Seven", "Eight", "Nine", "Ten",
+                "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen",
+                "Sixteen", "Seventeen", "Eighteen", "Nineteen"
+        };
+
+        String[] tens = {
+                "", "", "Twenty", "Thirty", "Forty", "Fifty",
+                "Sixty", "Seventy", "Eighty", "Ninety"
+        };
+
+        String words = "";
+
+        // Hundreds place
+        if (num >= 100) {
+            words += ones[num / 100] + " Hundred ";
+            num = num % 100;
+        }
+
+        // Tens and Ones
+        if (num >= 20) {
+            words += tens[num / 10] + " ";
+            num = num % 10;
+        }
+
+        // 1 to 19
+        if (num > 0) {
+            words += ones[num] + " ";
+        }
+
+        return words.trim();
+    }
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter a number (0 to 9999): ");
+        int n = sc.nextInt();
+
+        if (n < 0 || n > 9999) {
+            System.out.println("Invalid input! Enter number only between 0 to 9999.");
+        }
+        else if (n == 0) {
+            System.out.println("Zero");
+        }
+        else {
+
+            String result = "";
+
+            // Thousands place
+            if (n >= 1000) {
+                result += display(n / 1000) + " Thousand ";
+                n = n % 1000;
+            }
+
+            // Remaining 1 to 999
+            if (n > 0) {
+                result += display(n);
+            }
+
+            System.out.println("In Words: " + result.trim());
+        }
+
+        sc.close();
+    }
+}
diff --git a/Anisha_OccurrenceOfDigitInNumber.java b/Anisha_OccurrenceOfDigitInNumber.java
new file mode 100644
index 0000000..dc460a3
--- /dev/null
+++ b/Anisha_OccurrenceOfDigitInNumber.java
@@ -0,0 +1,44 @@
+import java.util.Scanner;
+
+public class Anisha_OccurrenceOfDigitInNumber {
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter a number: ");
+        long num = sc.nextLong();
+
+        System.out.print("Enter digit (0-9): ");
+        int digit = sc.nextInt();
+
+        int count = 0;
+
+        long temp = Math.abs(num); // handle negative numbers
+
+        if (digit < 0 || digit > 9) {
+            System.out.println("Invalid digit! Enter between 0 to 9.");
+            sc.close();
+            return;
+        }
+
+        // Special case: if number is 0
+        if (temp == 0 && digit == 0) {
+            count = 1;
+        } else {
+            while (temp != 0) {
+                int lastDigit = (int) (temp % 10);
+
+                if (lastDigit == digit) {
+                    count++;
+                }
+
+                temp = temp / 10;
+            }
+        }
+
+        System.out.println("Occurrence of digit " + digit + " = " + count);
+
+        sc.close();
+    }
+}
diff --git a/Anisha_OctalToBinary.java b/Anisha_OctalToBinary.java
new file mode 100644
index 0000000..6cc23da
--- /dev/null
+++ b/Anisha_OctalToBinary.java
@@ -0,0 +1,36 @@
+import java.util.Scanner;
+
+public class Anisha_OctalToBinary {
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter an Octal Number: ");
+        String octal = sc.next();
+        sc.close();
+
+        // Step 1: Octal to Decimal
+        int decimal = 0;
+        int power = 0;
+
+        for (int i = octal.length() - 1; i >= 0; i--) {
+            int digit = octal.charAt(i) - '0';
+            decimal += digit * Math.pow(8, power);
+            power++;
+        }
+
+        // Step 2: Decimal to Binary
+        int[] binary = new int[32];
+        int index = 0;
+
+        while (decimal > 0) {
+            binary[index] = decimal % 2;
+            decimal = decimal / 2;
+            index++;
+        }
+
+        System.out.print("Binary value = ");
+        for (int i = index - 1; i >= 0; i--) {
+            System.out.print(binary[i]);
+        }
+    }
+}
diff --git a/Anisha_OctalToDecimal.java b/Anisha_OctalToDecimal.java
new file mode 100644
index 0000000..0a8df82
--- /dev/null
+++ b/Anisha_OctalToDecimal.java
@@ -0,0 +1,24 @@
+import java.util.Scanner;
+
+public class Anisha_OctalToDecimal {
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter an octal number: ");
+        int octal = sc.nextInt();
+        sc.close();
+
+        int decimal = 0;
+        int power = 0;
+
+        while (octal > 0) {
+            int digit = octal % 10;
+            decimal = decimal + digit * (int)Math.pow(8, power);
+            octal = octal / 10;
+            power++;
+        }
+
+        System.out.println("Decimal equivalent: " + decimal);
+    }
+}
+
diff --git a/Anisha_PalindromeNumber.java b/Anisha_PalindromeNumber.java
new file mode 100644
index 0000000..06bf121
--- /dev/null
+++ b/Anisha_PalindromeNumber.java
@@ -0,0 +1,24 @@
+import java.util.Scanner;
+public class Anisha_PalindromeNumber {
+    public static void main(String[] args) {
+    Scanner sc = new Scanner(System.in);
+    System.out.println("Enter a number: ");
+    int num = sc.nextInt();
+    sc.close();
+    int temp = num;
+    int rev = 0;
+    while(temp>0){
+        int ld = temp%10;
+        rev = rev*10+ld;
+        temp/=10;
+    }
+    if(num==rev){
+        System.out.println("Palindrome");
+    }
+    else{
+        System.out.println("Not a palindrome");
+    }
+
+}
+
+}
diff --git a/Anisha_PerfectNumber.java b/Anisha_PerfectNumber.java
new file mode 100644
index 0000000..32c0896
--- /dev/null
+++ b/Anisha_PerfectNumber.java
@@ -0,0 +1,21 @@
+import java.util.Scanner;
+public class Anisha_PerfectNumber {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.println("Enter a number: ");
+        int n = sc.nextInt();
+        sc.close();
+        int sum =0;
+        for(int i =1;i<n;i++){
+            if(n%i==0){
+                sum = sum+i;
+            }
+        }
+        if(sum==n){
+            System.out.println(n + " Is a perfect number");
+        }
+        else{
+            System.out.println(n + " is not a perfect number");
+        }
+    }
+}
diff --git a/Anisha_PermutaionOfString.java b/Anisha_PermutaionOfString.java
new file mode 100644
index 0000000..582bed3
--- /dev/null
+++ b/Anisha_PermutaionOfString.java
@@ -0,0 +1,42 @@
+import java.util.Scanner;
+public class Anisha_PermutaionOfString {
+
+
+    // Recursive function to generate permutations
+    static void permute(String str, String ans) {
+
+        // Base case: if string becomes empty
+        if (str.length() == 0) {
+            System.out.print(ans + " ");
+            return;
+        }
+
+        // Pick each character one by one
+        for (int i = 0; i < str.length(); i++) {
+
+            char ch = str.charAt(i);
+
+            // Remaining string after removing chosen character
+            String left = str.substring(0, i);
+            String right = str.substring(i + 1);
+
+            String remaining = left + right;
+
+            // Recursive call
+            permute(remaining, ans + ch);
+        }
+    }
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter a string: ");
+        String str = sc.nextLine();
+
+        System.out.println("All permutations are:");
+        permute(str, "");
+        sc.close();
+    }
+}
+
diff --git a/Anisha_Permutation.java b/Anisha_Permutation.java
new file mode 100644
index 0000000..d998b85
--- /dev/null
+++ b/Anisha_Permutation.java
@@ -0,0 +1,18 @@
+import java.util.Scanner;
+public class Anisha_Permutation {
+    public  static int fact(int n){
+        int  fact = 1;
+        for(int i =1;i<=n;i++){
+            fact = fact*i;
+        }
+        return fact;
+    }
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        int r = sc.nextInt();
+        sc.close();
+        int res = fact(n)/fact(n-r);
+        System.out.println(res);
+    }
+}
diff --git a/Anisha_PositiveOrNegative.java b/Anisha_PositiveOrNegative.java
new file mode 100644
index 0000000..0e42e13
--- /dev/null
+++ b/Anisha_PositiveOrNegative.java
@@ -0,0 +1,16 @@
+import java.util.Scanner;
+
+public class Anisha_PositiveOrNegative {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int num = sc.nextInt();
+        sc.close();
+
+        if (num > 0)
+            System.out.println("Positive");
+        else if (num < 0)
+            System.out.println("Negative");
+        else
+            System.out.println("Zero");
+    }
+}
diff --git a/Anisha_PowerOfNumber.java b/Anisha_PowerOfNumber.java
new file mode 100644
index 0000000..a438f7b
--- /dev/null
+++ b/Anisha_PowerOfNumber.java
@@ -0,0 +1,32 @@
+import java.util.Scanner;
+
+public class Anisha_PowerOfNumber {
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter number: ");
+        int num = sc.nextInt();
+
+        System.out.print("Enter power: ");
+        int power = sc.nextInt();
+        sc.close();
+
+        int ans = 1;
+
+        if (num == 0 && power == 0) {
+            System.out.println("0 to the power 0 is indeterminate");
+        }
+        else if (power == 0) {
+            System.out.println("The power of number " + num + " to the power " + power + " is 1");
+        }
+        else if (power == 1) {
+            System.out.println("The power of number " + num + " to the power " + power + " is " + num);
+        }
+        else {
+            for (int i = 1; i <= power; i++) {
+                ans *= num;
+            }
+            System.out.println("The power of number " + num + " to the power " + power + " is " + ans);
+        }
+    }
+}
diff --git a/Anisha_PowerofNumberRecursion.java b/Anisha_PowerofNumberRecursion.java
new file mode 100644
index 0000000..cd0db60
--- /dev/null
+++ b/Anisha_PowerofNumberRecursion.java
@@ -0,0 +1,19 @@
+import java.util.Scanner;
+public class Anisha_PowerofNumberRecursion {
+        static int power(int base, int exp) {
+        if (exp == 0)
+            return 1; 
+        
+        return base * power(base, exp - 1);  
+    }
+
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+
+        int base = sc.nextInt();
+        int exp = sc.nextInt();
+
+        System.out.println(power(base, exp));
+        sc.close();
+    }
+}
diff --git a/Anisha_PrimeNumber.java b/Anisha_PrimeNumber.java
new file mode 100644
index 0000000..7aa9c64
--- /dev/null
+++ b/Anisha_PrimeNumber.java
@@ -0,0 +1,32 @@
+import java.util.Scanner;
+
+public class Anisha_PrimeNumber {
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter a number: ");
+        int n = sc.nextInt();
+        sc.close();
+
+        boolean isPrime = true;
+
+        if (n <= 1) {
+            isPrime = false;
+        } else {
+            for (int i = 2; i <= n / 2; i++) {
+                if (n % i == 0) {
+                    isPrime = false;
+                    break;
+                }
+            }
+        }
+
+        if (isPrime) {
+            System.out.println(n + " is a Prime Number");
+        } else {
+            System.out.println(n + " is NOT a Prime Number");
+        }
+    }
+}
+
diff --git a/Anisha_PrimeNumberRecursion.java b/Anisha_PrimeNumberRecursion.java
new file mode 100644
index 0000000..2367779
--- /dev/null
+++ b/Anisha_PrimeNumberRecursion.java
@@ -0,0 +1,23 @@
+import java.util.Scanner;
+public class Anisha_PrimeNumberRecursion {
+    static boolean isPrime(int n, int i) {
+        if (n <= 1)
+            return false;
+        if (i > n / 2)
+            return true;
+        if (n % i == 0)
+            return false;
+        return isPrime(n, i + 1);
+    }
+        public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+
+        int n = sc.nextInt();
+
+        if (isPrime(n, 2))
+            System.out.println("Yes");
+        else
+            System.out.println("No");
+        sc.close();
+    }
+}
diff --git a/Anisha_PrimeNumbersBetween1To100.java b/Anisha_PrimeNumbersBetween1To100.java
new file mode 100644
index 0000000..175857a
--- /dev/null
+++ b/Anisha_PrimeNumbersBetween1To100.java
@@ -0,0 +1,22 @@
+public class Anisha_PrimeNumbersBetween1To100 {
+
+    public static void main(String[] args) {
+
+        System.out.println("Prime numbers between 1 to 100 are:");
+
+        for (int num = 2; num <= 100; num++) {
+
+            int count = 0;
+
+            for (int i = 1; i <= num; i++) {
+                if (num % i == 0) {
+                    count++;
+                }
+            }
+
+            if (count == 2) {
+                System.out.print(num + " ");
+            }
+        }
+    }
+}
diff --git a/Anisha_PrimeNumbersInInterval.java b/Anisha_PrimeNumbersInInterval.java
new file mode 100644
index 0000000..6a43000
--- /dev/null
+++ b/Anisha_PrimeNumbersInInterval.java
@@ -0,0 +1,36 @@
+import java.util.Scanner;
+
+public class Anisha_PrimeNumbersInInterval {
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter starting number: ");
+        int start = sc.nextInt();
+
+        System.out.print("Enter ending number: ");
+        int end = sc.nextInt();
+
+        System.out.print("Prime numbers between " + start + " and " + end + " are: ");
+        sc.close();
+
+        for (int num = start; num <= end; num++) {
+
+            if (num <= 1)
+                continue;
+
+            boolean isPrime = true;
+
+            for (int i = 2; i <= num / 2; i++) {
+                if (num % i == 0) {
+                    isPrime = false;
+                    break;
+                }
+            }
+
+            if (isPrime) {
+                System.out.print(num + " ");
+            }
+        }
+    }
+}
diff --git a/Anisha_Quadrant.java b/Anisha_Quadrant.java
new file mode 100644
index 0000000..11ea060
--- /dev/null
+++ b/Anisha_Quadrant.java
@@ -0,0 +1,36 @@
+import java.util.Scanner;
+public class Anisha_Quadrant {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter value of x: ");
+        int x = sc.nextInt();
+
+        System.out.print("Enter value of y: ");
+        int y = sc.nextInt();
+
+        if (x > 0 && y > 0) {
+            System.out.println("Point lies in First Quadrant");
+        } 
+        else if (x < 0 && y > 0) {
+            System.out.println("Point lies in Second Quadrant");
+        } 
+        else if (x < 0 && y < 0) {
+            System.out.println("Point lies in Third Quadrant");
+        } 
+        else if (x > 0 && y < 0) {
+            System.out.println("Point lies in Fourth Quadrant");
+        } 
+        else if (x == 0 && y == 0) {
+            System.out.println("Point is at the Origin");
+        } 
+        else if (x == 0 && y != 0) {
+            System.out.println("Point lies on Y-axis");
+        } 
+        else if (x != 0 && y == 0) {
+            System.out.println("Point lies on X-axis");
+        }
+
+        sc.close();
+    }
+}
diff --git a/Anisha_Replace1to0.java b/Anisha_Replace1to0.java
new file mode 100644
index 0000000..7f4e24a
--- /dev/null
+++ b/Anisha_Replace1to0.java
@@ -0,0 +1,26 @@
+import java.util.*;
+public class Anisha_Replace1to0 {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter a positive number: ");
+        int num = sc.nextInt();
+        sc.close();
+
+        int result = 0;
+        int place = 1;
+
+        while (num > 0) {
+            int digit = num % 10;   // get last digit
+
+            if (digit == 0) {
+                digit = 1;          // replace 0 with 1
+            }
+
+            result = result + digit * place;
+            place = place * 10;
+            num = num / 10;    
+        }  
+        System.out.println("Number after replacing 0 with 1: " + result);
+    }   
+}
diff --git a/Anisha_ReverseNumber.java b/Anisha_ReverseNumber.java
new file mode 100644
index 0000000..2b7d3b0
--- /dev/null
+++ b/Anisha_ReverseNumber.java
@@ -0,0 +1,17 @@
+import java.util.Scanner;
+public class Anisha_ReverseNumber {
+    public static void main(String[] args) {
+    Scanner sc = new Scanner(System.in);
+    System.out.println("Enter a number: ");
+    int num = sc.nextInt();
+    sc.close();
+    int rev = 0;
+    while(num>0){
+        int ld = num%10;
+        rev  = rev*10 + ld;
+        num/=10;
+    };
+    System.out.println("Reverse number: " + rev);
+
+    }
+}
diff --git a/Anisha_ReverseNumberRecursion.java b/Anisha_ReverseNumberRecursion.java
new file mode 100644
index 0000000..e7ef588
--- /dev/null
+++ b/Anisha_ReverseNumberRecursion.java
@@ -0,0 +1,25 @@
+import java.util.Scanner;
+public class Anisha_ReverseNumberRecursion {
+    static int reverseNum(int n, int rev) {
+        if (n == 0)
+            return rev;
+
+        int lastDigit = n % 10;
+        rev = rev * 10 + lastDigit;
+
+        return reverseNum(n / 10, rev); 
+    }
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter a number: ");
+        int n = sc.nextInt();
+
+        int reverse = reverseNum(n, 0);
+
+        System.out.println("Reversed number is: " + reverse);
+        sc.close();
+    }
+}
diff --git a/Anisha_RootsOfQuadraticEquation.java b/Anisha_RootsOfQuadraticEquation.java
new file mode 100644
index 0000000..810dd11
--- /dev/null
+++ b/Anisha_RootsOfQuadraticEquation.java
@@ -0,0 +1,60 @@
+
+import java.util.Scanner;
+
+public class Anisha_RootsOfQuadraticEquation {
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter a: ");
+        double a = sc.nextDouble();
+
+        System.out.print("Enter b: ");
+        double b = sc.nextDouble();
+
+        System.out.print("Enter c: ");
+        double c = sc.nextDouble();
+
+        // If a = 0, then it is not a quadratic equation
+        if (a == 0) {
+            System.out.println("Not a Quadratic Equation (because a = 0).");
+            sc.close();
+            return;
+        }
+
+        double D = (b * b) - (4 * a * c);
+
+        System.out.println("\nDiscriminant (D) = " + D);
+
+        if (D > 0) {
+            // Two real roots
+            double root1 = (-b + Math.sqrt(D)) / (2 * a);
+            double root2 = (-b - Math.sqrt(D)) / (2 * a);
+
+            System.out.println("Two Real Roots:");
+            System.out.println("Root 1 = " + root1);
+            System.out.println("Root 2 = " + root2);
+        }
+
+        else if (D == 0) {
+            // One real root
+            double root = (-b) / (2 * a);
+
+            System.out.println("One Real Root:");
+            System.out.println("Root = " + root);
+        }
+
+        else {
+            // No real roots (complex)
+            double realPart = (-b) / (2 * a);
+            double imaginaryPart = Math.sqrt(-D) / (2 * a);
+
+            System.out.println("No Real Roots (Complex Roots):");
+            System.out.println("Root 1 = " + realPart + " + " + imaginaryPart + "i");
+            System.out.println("Root 2 = " + realPart + " - " + imaginaryPart + "i");
+        }
+
+        sc.close();
+    }
+}
diff --git a/Anisha_SmallestNumberRecusion.java b/Anisha_SmallestNumberRecusion.java
new file mode 100644
index 0000000..46dcbea
--- /dev/null
+++ b/Anisha_SmallestNumberRecusion.java
@@ -0,0 +1,28 @@
+import java.util.Scanner;
+public class Anisha_SmallestNumberRecusion {
+    static int findMin(int[] arr, int n) {
+        if (n == 1)
+            return arr[0];
+        int minOfRest = findMin(arr, n - 1);
+        return Math.min(arr[n - 1], minOfRest);
+    }
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter size of array: ");
+        int n = sc.nextInt();
+
+        int[] arr = new int[n];
+
+        System.out.println("Enter array elements:");
+        for (int i = 0; i < n; i++) {
+            arr[i] = sc.nextInt();
+        }
+
+        int min = findMin(arr, n);
+
+        System.out.println("Smallest Element is " + min);
+        sc.close();
+    }
+}
diff --git a/Anisha_StrongNumber.java b/Anisha_StrongNumber.java
new file mode 100644
index 0000000..20fa469
--- /dev/null
+++ b/Anisha_StrongNumber.java
@@ -0,0 +1,36 @@
+import java.util.Scanner;
+
+public class Anisha_StrongNumber {
+
+    static int factorial(int n) {
+        int fact = 1;
+        for (int i = 1; i <= n; i++) {
+            fact *= i;
+        }
+        return fact;
+    }
+
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter a number: ");
+        int num = sc.nextInt();
+        sc.close();
+
+        int temp = num;
+        int sum = 0;
+
+        while (temp > 0) {
+            int digit = temp % 10;
+            sum += factorial(digit);
+            temp /= 10;
+        }
+
+        if (sum == num) {
+            System.out.println("Yes, it's a strong number");
+        } else {
+            System.out.println("No, it's not a strong number");
+        }
+    }
+}
+
diff --git a/Anisha_SumInRange.java b/Anisha_SumInRange.java
new file mode 100644
index 0000000..72f1917
--- /dev/null
+++ b/Anisha_SumInRange.java
@@ -0,0 +1,17 @@
+import java.util.Scanner;
+
+public class Anisha_SumInRange {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int start = sc.nextInt();
+        int end = sc.nextInt();
+        sc.close();
+        int sum = 0;
+
+        for (int i = start; i <= end; i++) {
+            sum += i;
+        }
+        System.out.println(sum);
+    }
+}
+
diff --git a/Anisha_SumOfAllSUbstes.java b/Anisha_SumOfAllSUbstes.java
new file mode 100644
index 0000000..fbea062
--- /dev/null
+++ b/Anisha_SumOfAllSUbstes.java
@@ -0,0 +1,37 @@
+import java.util.Scanner;
+public class Anisha_SumOfAllSUbstes {
+
+    static void subsetSums(int[] arr, int index, int sum) {
+
+        // Base case: reached end of array
+        if (index == arr.length) {
+            System.out.print(sum + " ");
+            return;
+        }
+
+        // 1) Include current element
+        subsetSums(arr, index + 1, sum + arr[index]);
+
+        // 2) Exclude current element
+        subsetSums(arr, index + 1, sum);
+    }
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter size of set: ");
+        int n = sc.nextInt();
+
+        int[] arr = new int[n];
+
+        System.out.println("Enter elements:");
+        for (int i = 0; i < n; i++) {
+            arr[i] = sc.nextInt();
+        }
+
+        System.out.println("Sums of all subsets are:");
+        subsetSums(arr, 0, 0);
+        sc.close();
+    }
+}
diff --git a/Anisha_SumOfFirstNNaturalNumbers.java b/Anisha_SumOfFirstNNaturalNumbers.java
new file mode 100644
index 0000000..490c36f
--- /dev/null
+++ b/Anisha_SumOfFirstNNaturalNumbers.java
@@ -0,0 +1,12 @@
+import java.util.Scanner;
+
+public class Anisha_SumOfFirstNNaturalNumbers {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        sc.close();
+        int sum = n * (n + 1) / 2;
+
+        System.out.println(sum);
+    }
+}
diff --git a/Anisha_SumOfNNumbers.java b/Anisha_SumOfNNumbers.java
new file mode 100644
index 0000000..16ff612
--- /dev/null
+++ b/Anisha_SumOfNNumbers.java
@@ -0,0 +1,16 @@
+
+import java.util.Scanner;
+
+public class Anisha_SumOfNNumbers {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        sc.close();
+        int sum = 0;
+
+        for (int i = 1; i <= n; i++) {
+            sum += i;
+        }
+        System.out.println(sum);
+    }
+}
diff --git a/Anisha_gcd.java b/Anisha_gcd.java
new file mode 100644
index 0000000..117898e
--- /dev/null
+++ b/Anisha_gcd.java
@@ -0,0 +1,29 @@
+import java.util.Scanner;
+
+public class Anisha_gcd {
+    static int gcd(int a, int b) {
+        if (b == 0)
+            return a;
+        return gcd(b, a % b);
+    }
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter first number: ");
+        int num1 = sc.nextInt();
+
+        System.out.print("Enter second number: ");
+        int num2 = sc.nextInt();
+
+        sc.close();
+
+        num1 = Math.abs(num1);
+        num2 = Math.abs(num2);
+
+        int result = gcd(num1, num2);
+
+        System.out.println("GCD = " + result);
+    }
+}
diff --git a/SumOfTwoPrimeNumbers.java b/SumOfTwoPrimeNumbers.java
new file mode 100644
index 0000000..6299098
--- /dev/null
+++ b/SumOfTwoPrimeNumbers.java
@@ -0,0 +1,36 @@
+import java.util.Scanner;
+
+public class SumOfTwoPrimeNumbers {
+    public static boolean isPrime(int n) {
+        if (n <= 1)
+            return false;
+
+        for (int i = 2; i <= n / 2; i++) {
+            if (n % i == 0)
+                return false;
+        }
+        return true;
+    }
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter a number: ");
+        int number = sc.nextInt();
+        sc.close();
+
+        boolean found = false;
+
+        for (int i = 2; i <= number / 2; i++) {
+            if (isPrime(i) && isPrime(number - i)) {
+                System.out.println(number + " = " + i + " + " + (number - i));
+                found = true;
+            }
+        }
+
+        if (!found) {
+            System.out.println(number + " cannot be expressed as a sum of two prime numbers");
+        }
+    }
+}