Practice Program for String Manupulation

 package JavaPractice;

import java.util.Arrays;
import java.util.Scanner;

public class StringManupulation {

    public static void main() {

        StringManupulation sm= new StringManupulation();
        /*boolean flag= sm.anagramsTest("triangle","iNtegral");
        if (flag==false)
        {
            System.out.println("Strings are not anagram");
        }
        else
        {
            System.out.println("Strings are anagram");
        }*/


        // 1) Reverse String
        //String name= "aeiouuzzz";
        //String reverse="";
        // Scanner sc = new Scanner(System.in);
        //System.out.println("Enter your full name");
        //String name= sc.nextLine();
        //Count Number of Letters
        //System.out.println(name.length());
        /*for(int i=name.length()-1;i>=0;i--)
        {
            reverse= reverse + name.charAt(i);
        }
        System.out.println(reverse);*/
        // sc.close();

        //2) Count Number of characters

        /*int counter=0;
       char[] letters  = name.toCharArray();
       for(int i=0; i<=letters.length-1; i++)
       {
           if(letters[i]=='a')
           {
               counter = counter +1;
           }

       }
        System.out.println("Count of occurance of a is: " +counter +" :)");*/

        //3) Palendrome

        /*StringBuilder sb = new StringBuilder(name);
        StringBuilder revString =sb.reverse();
        String convString =revString.toString();
        if(name.equals(convString))
        {
            System.out.println("It is palendrome");
        }
        else
        {
            System.out.println("It is not a palendrome");
        }*/

        // 4) Count number of vovels and consonents
        /*int vovel =0;
        int consonent =0;
        char[] letters =name.toCharArray();
        for(int i=0; i<=letters.length-1; i++)
        {
            if(letters[i]=='a'|| letters[i]=='e' || letters[i]=='i' || letters[i]=='o'|| letters[i]=='u')
            {
                vovel = vovel +1;
            }
            else
            {
                consonent = consonent +1;
            }
        }
        System.out.println("Number of vovels are " + vovel + " Number of consonents are " +consonent);
        */

        // 5) Remove duplicate characters
        /*String name= "aeiouuzzz";
        String result="";

        for(int i=0; i<name.length(); i++) //aeiouzz
        {
            boolean isDuplicate = false;
            for(int j=0; j<result.length();j++) //ae
            {
                if(name.charAt(i)== result.charAt(j))
                {
                    isDuplicate = true;
                    break;
                }

            }
            if(isDuplicate==false) {
                result = result + name.charAt(i);
            }
        }
        System.out.println(result);*/

        //7 Display Triangle
        /*int n=5;
        for(int r=1;r<n;r++) //Number of Rows
        {
            for(int s=1; s<n-r; s++) // Number of spaces
            {
                System.out.print(" ");
            }

            for(int c=1; c<2*r;c++) //Number of columns
            {

                System.out.print("*");
            }
            System.out.println();
        }*/
        //8 Replace a with b with c
        /*int a=10;
        int b=20;
        int c=a;
        a=b;
        b=c;
        System.out.println(a);
        System.out.println(b);*/

        //9 Replace a with b without c
        /*int a=10;
        int b=20;
        a=a+b; //10+20=30
        b=a-b; //30-20=10
        a=a-b; //30-10=20
        System.out.println(a);
        System.out.println(b);*/



    }

    //6 Find anagrams
    public boolean anagramsTest(String string1, String string2) {
        //String string1 = "Triangle";
        //String string2 = "Integral";
        String string3= string1.toLowerCase();
        String string4=string2.toLowerCase();

        if (string1.length() != string2.length()) {
            System.out.println("Length is not matching, it is not Anagram");
            return false;
        }

        int[] count = new int[256];

        for (int i = 0; i < string1.length(); i++) {
            count[string3.charAt(i)]++;
            count[string4.charAt(i)]--;

        }

        for (int c : count) {
            if (c != 0) {
                return false;
            }
        }
        return true;
    }
}