AnagramString

package interview;
import java.util.*;

public class AnagramString {

public static void main(String[] args)
{
  String s1 ="mang o";
  String s2 ="Nam go";
  System.out.println(s1+" & "+s2);
  checkAnagram(s1,s2);
 
}

private static void checkAnagram(String s1, String s2)
{
/*
  * remove white space
  * remove case
  * check for count
*/
String a = s1.replace(" ", "").toLowerCase();
String b = s2.replace(" ", "").toLowerCase();

char[] ch1 = a.toCharArray();
char[] ch2 = b.toCharArray();
Arrays.sort(ch1);
Arrays.sort(ch2);
if(Arrays.equals(ch1,ch2))
{
System.out.println("Yes It is Anagram");
}
else
System.out.println("Not Anagram");

}

}

AnagramString2

package interview;

public class AnagramString2 {

public static void main(String[] args)
{
String s1 ="java";
String s2 ="avaj";
StringBuffer sb = new StringBuffer(s2);
char[] ch = s1.toCharArray();
for (char c : ch)
{
//int index = sb.indexOf(String.valueOf(c)); --or
int index = sb.indexOf(Character.toString(c));
sb.deleteCharAt(index);
}
System.out.println(sb.length()==0?"Anagram":"Not Anagram");

}

}

Check_If_String_Contains_only_Digit

package interview;

public class Check_If_String_Contains_only_Digit {

public static void main(String[] args)
{
  String str = "Error 404 detected in server 589.90 ";
  char[] ch = str.toCharArray();
  System.out.println(ch);
  String str2 = str.replaceAll("[^0-9]","");
  System.out.println(str2);
}

}

Count_Character_WithoutLoop

package interview;
//Write a program to find the number of occurrences of a given character in a string without using loop
public class Count_Character_WithoutLoop {

public static void main(String[] args)
{
  String str = "This is an apple";
      System.out.println("Length Of String:" + str.length());
      System.out.println("Length Of String Without a :" + str.replace("a", "").length());
      //System.out.println(">>>"+str.replace("a", ""));
      int charcount = str.length() - str.replaceAll("a", "").length();
      System.out.println("Occurrence Of A Char In String: " + charcount);

}

}




     

Count Words

package interview;

public class CountWords {

public static void main(String[] args)
{
   String s1 = "All izz well";
   String[] str = s1.split(" ");
   System.out.println(str.length);
 
 
   /*String str2 = "This is what is this world in world 45 67 45";
   int l = str2.split(" ").length;
   System.out.println("len: "+l);*/
 
   /*String s1 = "All~izz~well";
   int l = s1.split("~").length;
   System.out.println(">>"+l);*/
   String[] str2 = {"abc","def","ghi"};
   for (String string : str)
   {
System.out.print(string+" ");
   }

}

}

Duplicate Char

package interview;
//count no. of duplicate character occurance
import java.util.*;
//steps:
//string --->char array---->(convert to lowercase)---->hashmap
public class DuplicateChar {

public static void main(String[] args)
{
  String str  ="programming world445";
  char[] ch = str.toCharArray();
  char[] upper_ch = convertLower(ch);
  System.out.println(upper_ch);
 
  Map<Character, Integer> map = new HashMap<>();
  for(char c : upper_ch)
  {
  if(map.containsKey(c))
  {
  map.put(c, map.get(c)+1);
  }
  else
  {
  map.put(c, 1);
  }
  }
 
  //****************
  for(Map.Entry<Character,Integer>entry : map.entrySet())
  {
  if(entry.getValue()>1)
  {
  System.out.println(entry.getKey()+"-->"+entry.getValue());
  }
  }
 
 
}
//***********************************
private static char[] convertLower(char[] ch)
{
  for(int i=0;i<ch.length;i++)
  {
  if(Character.isLetter(ch[i])&& (Character.isLowerCase(ch[i])))
    {
  ch[i]= Character.toUpperCase(ch[i]); 
}
  }
return ch;
}


}

Duplic_Char

package interview;

public class Duplic_Char {

public static void main(String[] args)
{
String str = "abcd defg abd ghi";
  //int cnt = 0;
  char[] inp = str.toCharArray();
  System.out.println("Duplicate Characters are:");
  for (int i = 0; i < str.length(); i++)
  {
  for (int j = i + 1; j < str.length(); j++)
  {
  if (inp[i] == inp[j])
  {
  System.out.println(inp[j]);
  //cnt++;
               break;
             }
       }
   }

}}