BASIC STRING PROGRAMS IN JAVA

 BASIC STRING PROGRAMS IN JAVA

1. Find Length of a String

public class StringLength {
    public static void main(String[] args) {
        String str = "Hello, Java!";
        System.out.println("Length of the string: " + str.length());
    }
}

---

2. Compare Two Strings

public class StringCompare {
    public static void main(String[] args) {
        String s1 = "Hello";
        String s2 = "hello";

        System.out.println("Using equals(): " + s1.equals(s2));
        System.out.println("Using equalsIgnoreCase(): " + s1.equalsIgnoreCase(s2));
    }
}

---

3. Concatenate Two Strings

j
public class StringConcat {
    public static void main(String[] args) {
        String s1 = "Hello";
        String s2 = "World";

        String result = s1 + " " + s2;
        System.out.println("Concatenated String: " + result);
    }
}

---

4. Reverse a String

public class StringReverse {
    public static void main(String[] args) {
        String str = "Java";
        String reversed = "";

        for (int i = str.length() - 1; i >= 0; i--) {
            reversed += str.charAt(i);
        }

        System.out.println("Reversed String: " + reversed);
    }
}

---

5. Check if String is Palindrome

j
public class PalindromeCheck {
    public static void main(String[] args) {
        String str = "madam";
        String reversed = new StringBuilder(str).reverse().toString();

        if (str.equals(reversed)) {
            System.out.println(str + " is a palindrome.");
        } else {
            System.out.println(str + " is not a palindrome.");
        }
    }
}

---

6. Count Vowels in a String

j
public class VowelCount {
    public static void main(String[] args) {
        String str = "Programming";
        int count = 0;

        for (char ch : str.toLowerCase().toCharArray()) {
            if ("aeiou".indexOf(ch) != -1) {
                count++;
            }
        }

        System.out.println("Number of vowels: " + count);
    }
}

---

7. Convert String to Upper and Lower Case

public class CaseConversion {
    public static void main(String[] args) {
        String str = "Java Programming";

        System.out.println("Uppercase: " + str.toUpperCase());
        System.out.println("Lowercase: " + str.toLowerCase());
    }
}

8. Check whether two given strings are anagram of each other or not.

import java.util.Arrays;

class Demo {

    static boolean areAnagrams(String s1, String s2) {

        

        if (s1.length() != s2.length()) return false;

        

        // Sort both strings

        char[] s1Array = s1.toCharArray();

        char[] s2Array = s2.toCharArray();

        Arrays.sort(s1Array);

        Arrays.sort(s2Array);

        // Compare sorted strings

        return Arrays.equals(s1Array, s2Array);

    }

    public static void main(String[] args) {

        

        String s1 = "geeks";

        String s2 = "kseeg";

        

        if(areAnagrams(s1, s2) == true){

            System.out.println("true");

        }

        else{

            System.out.println("false");

        }

        

    }

}