Java Best Programs

14) String array will be given.if a string is Prefix of an any other string in that array means count.

package Set3;

public class ClassSeT14 {

public static void main(String[] args) {

      String[] a={"pinky","preethi","puppy","preeth","puppypreethi"};

      System.out.println(namesWithPreFixes(a));

}

public static int namesWithPreFixes(String[] a) {

      int n=0;

      for(int i=0;i<a.length;i++)

            for(int j=i+1;j<a.length;j++){

            String s1=a[i];

            String s2=a[j];

            if(s2.startsWith(s1)||s1.startsWith(s2))

                  n++;  }

      return n;

}

}

Java Best Programs

13) Collect no’s frm list1 which is not present in list2

    & Collect no’s frm list2 which is not present in list1

    and store it in output1[].

    ex: input1={1,2,3,4}; input2={1,2,3,5}; output1={4,5};

package Set3;

import java.util.*;

public class ClassSeT13 {

public static void main(String[] args) {

      List<Integer> l1=new ArrayList<Integer>();

      l1.add(1);

      l1.add(2);

      l1.add(3);

      l1.add(4);

      List<Integer> l2=new ArrayList<Integer>();

      l2.add(1);

      l2.add(2);

      l2.add(3);

      l2.add(5);

      int o[]=commonSet(l1,l2);

      for(int i:o)

      System.out.println(i);

}

public static int[] commonSet(List<Integer> l1, List<Integer> l2) {

      List<Integer> l3=new ArrayList<Integer>();

      List<Integer> l4=new ArrayList<Integer>();

     

      l3.addAll(l1);l4.addAll(l2);

      l1.removeAll(l2);l4.removeAll(l3);

      l1.addAll(l4);

     

      int o[]=new int[l1.size()];

      for(int j=0;j<o.length;j++)

            o[j]=l1.get(j);

      return o;

}

}

Java Best Programs

12) Input1=”Hello World”;  output-------à  “dello WorlH”.

package Set3;

public class ClassSeT12 {

public static void main(String[] args) {

      String s="Hello World";

      System.out.println(reArrangingWord(s));

}

public static String reArrangingWord(String s) {

      StringBuffer sb=new StringBuffer();

      sb.append(s.substring(s.length()-1));

      sb.append(s.substring(1, s.length()-1));

      sb.append(s.substring(0, 1));

      return sb.toString();

}

}

Java Best Programs

11) input="hello"

    output="hlo"; Alternative positions...

package Set3;

public class ClassSeT11 {

public static void main(String[] args) {

      String s="Hello";

      System.out.println(alternatingChar(s));

}

public static String alternatingChar(String s){

      StringBuffer sb=new StringBuffer();

      for(int i=0;i<s.length();i++)

            if(i%2==0)

                  sb.append(s.charAt(i));

      return sb.toString();

}

}

Java Best Programs

10) input1=1 ,input2=2 ,input3=3 --- output=6;

    input1=1 ,input2=13,input3=3 --- output=1;

    input1=13,input2=2 ,input3=8 --- output=8;

    if value equal to 13,escape the value '13', as well as the next value to 13.

    sum the remaining values

package Set3;

import java.util.*;

public class ClassSeT10 {

public static void main(String[] args) {

      int ip1=13,ip2=2,ip3=8;

      System.out.println(thirteenLapse(ip1,ip2,ip3));

}

public static int thirteenLapse(int ip1, int ip2, int ip3) {

      List<Integer> l=new ArrayList<Integer>();

      l.add(ip1);

      l.add(ip2);

      l.add(ip3);

      int s=0;

      for(int i=0;i<l.size();i++){

            if(l.get(i)!=13)

                  s+=l.get(i);

            if(l.get(i)==13)

                  i=i+1;}

      return s;

}

}

Java Best Programs

9) String[] input={"100","111","10100","10","1111"} input2="10"

   output=2;count strings having prefix"10" but "10" not included in count

   operation-- for how many strings input2 matches the prefix of each string in input1

   String[] input={"01","01010","1000","10","011"}

   output=3; count the strings having prefix"10","01" but "10","01" not included

package Set3;

import java.util.*;

public class ClassSeT09 {

public static void main(String[] args) {

      String[] ip={"100","111","10100","10","1111"};

      gteCount(ip);

}

public static void gteCount(String[] ip) {

      int op=0;

      ArrayList<String> l1=new ArrayList<String>();

      for(String s:ip)

            if(s.startsWith("10") || s.startsWith("01") &&(s.length()>2))

                  l1.add(s);

      op=l1.size();

      System.out.println(op);

}

} 

Java Best Programs

8) INPUT1= helloworld

   INPUT2= 2. delete the char,if rpted twice.

   if occurs more than twice,leave the first occurence and delete the duplicate

   O/P= helwrd;

package Set3;

public class Hashmap {

public static void main(String[] args) {

      String input1="HelloWorld";

      int input2=2;

    deletingtheCharOccuringTwice(input1,input2);

}

public static void deletingtheCharOccuringTwice(String input1, int input2) {

      StringBuffer sb=new StringBuffer(input1);

      int c=1;

      for(int i=0;i<sb.length();i++){

            c=1;

            for(int j=i+1;j<sb.length();j++)

                  if(sb.charAt(i)==sb.charAt(j))

                        c++;

            if(c>=input2){   

                  for(int j=i+1;j<sb.length();j++)

                        if(sb.charAt(i)==sb.charAt(j))

                              sb.deleteCharAt(j);

                  sb.deleteCharAt(i);

                  i--;   }    }

      System.out.println(sb.toString());

     

}

}

Java Best Programs

7) Input1={“ABX”,”ac”,”acd”};

   Input2=3;

   Output1=X$d

package Set3;

import java.util.*;

public class Has111{

public static void main(String[] args) {

      String[] s1={"abc","da","ram","cat"};

      int ip=3;

      getStr(s1,ip);

}

public  static void getStr(String[] s1, int ip) {

     

      ArrayList<String> l1=new ArrayList<String>();

      for(String s:s1)

            if(s.length()==ip)

            l1.add(s); 

      StringBuffer buff=new StringBuffer();

      for(String l:l1){

         String s2=l.substring(l.length()-1);

     

          buff.append(s2).append("$");

           }

      buff.deleteCharAt(buff.length()-1).toString();

      System.out.println(buff);

               }

                  }

Java Best Programs

6) I/P hashmap<String String>{"ram:hari","cisco:barfi","honeywell:cs","cts:hari"};

   i/p 2="hari";

   o/p string[]={"ram","cts"};

package Set3;

import java.util.*;

import java.util.Map.Entry;

public class ClassSeT06 {

public static void main(String[] args) {

      HashMap<String,String> m1=new HashMap<String,String>();

      m1.put("ram","hari");

      m1.put("cisco","barfi");

      m1.put("honeywell","cs");

      m1.put("cts","hari");

      String s2="hari";

      getvalues(m1,s2);

}

public static void getvalues(HashMap<String, String> m1, String s2) {

      ArrayList<String>l1=new ArrayList<String>();

      for(Entry<String, String> m:m1.entrySet()){

            m.getKey();

            m.getValue();

            if(m.getValue().equals(s2))  

                  l1.add(m.getKey());           }

      String[] op= new String[l1.size()];

      for(int i=0;i<l1.size();i++){

            op[i]=l1.get(i)   ;

            System.out.println(op[i]);    }

}

}

Java Best Programs

5) Square root calculation of

   ((x1+x2)*(x1+x2))+((y1+y2)*(y1+y2))

   o/p should be rounded of to int;

package Set3;

public class ClassSeT05 {

public static void main(String[] args) {

      int x1=4,x2=8;

      int y1=3,y2=5;

      sqrt(x1,x2,y1,y2);

}

public      static void sqrt(int x1, int x2, int y1, int y2) {

      int op;

      op=(int) (Math.sqrt((x1+x2)*(x1+x2))+((y1+y2)*(y1+y2)));

      System.out.println(op);

}

}

Java Best Programs

4) Email Validation

   String input1="test@gmail.com"

                1)@ & . should be present;

                2)@ & . should not be repeated;

                3)there should be five charcters between @ and .;

                4)there should be atleast 3 characters before @ ;

                5)the end of mail id should be .com;

package Set3;

import java.util.*;

public class ClassSeT04 {

public static void main(String[] args) {

      String ip="test@gmail.com";

        emailIdValidation(ip);

}

public static void emailIdValidation(String ip) {

     

      boolean b=false;

      StringTokenizer t=new StringTokenizer(ip,"@");

            String s1=t.nextToken();

            String s2=t.nextToken();

      StringTokenizer t1=new StringTokenizer(s2,".");

            String s3=t1.nextToken();

            String s4=t1.nextToken();

      if(ip.contains("@") && ip.contains("."))

            if(s3.length()==5)

                  if(s1.length()>=3)

                        if(s4.equals("com"))

                              b=true;

      if(b==true)

            System.out.println("valid mail Id");

      else

            System.out.println("not a valid Id");

     

}

}

Java Best Programs

3) String[] input1=["Vikas","Lokesh",Ashok]

   expected output String: "Vikas,Lokesh,Ashok"

package Set3;

public class ClassSeT03 {

public static void main(String[] args) {

      String[] ip={"Vikas","Lokesh","Ashok"};

      getTheNamesinGivenFormat(ip);

}

public static void getTheNamesinGivenFormat(String[] ip) {

      StringBuffer sb=new StringBuffer();

sb.append('"');

      for(int i=0;i<ip.length;i++)

            sb.append(ip[i]).append(',');

      sb.deleteCharAt(sb.length()-1);

sb.append('"');

System.out.println(sb);

}

}

Java Best Programs

2) Create a program to get the hashmap from the given input string array where the key for the hashmap

   is first three letters of array element in uppercase and the value of hashmap is the element itself

   Input:{“goa”,”kerala”,”gujarat”}                 [string array]

   Output:{{GOA,goa},{KER,kerala},{GUJ,Gujarat}}    [hashmap]

package Set3;

import java.util.*;

public class ClassSeT02 {

public static void main(String[] args) {

      String[] s1={"goa","kerala","gujarat"};

      putvalues(s1);

}

public static void putvalues(String[] s1) {

      ArrayList<String> l1=new ArrayList<String>();

      HashMap<String,String> m1=new HashMap<String,String>();

      ArrayList<String> l2=new ArrayList<String>();

      for(String s:s1)

            l1.add(s.toUpperCase().substring(0, 3));

      for(String s:s1)

            l2.add(s); 

      for(int i=0;i<l1.size();i++)

            m1.put(l1.get(i),l2.get(i)); 

      System.out.println(m1);

}

}

Java Best Programs

1) Find the sum of the numbers in the given input string array

   Input{“2AA”,”12”,”ABC”,”c1a”)

   Output:6 (2+1+2+1)

   Note in the above array 12 must not considered as such

   i.e,it must be considered as 1,2

package Set3;

public class ClassSeT01 {

public static void main(String[] args) {

      String[] s1={"2AA","12","A2C","C5a"};

      getSum(s1); }

public static void getSum(String[] s1) {

      int sum=0;

      for(int i=0;i<s1.length;i++)

            for(int j=0;j<s1[i].length();j++)

                       {

                  char c=s1[i].charAt(j);

                  if(Character.isDigit(c))

                            {

                        String t=String.valueOf(c);

                        int n=Integer.parseInt(t);

                        sum=sum+n;

                                 }

                                   }

                                  System.out.println(sum);

                                      }

                                        } 

Learn Java In a Easy Way

22)no of days in a month in specific year

package Set2;

import java.util.*;

public class ClassSET22 {

public static void main(String[] args){

      Calendar ca=new GregorianCalendar(2013,Calendar.FEBRUARY,03);

      System.out.println(noOfDaysInaMonth(ca));

}

public static int noOfDaysInaMonth(Calendar ca){

      int n=ca.getActualMaximum(Calendar.DAY_OF_MONTH);

      return n;

}

}

Learn Java In a Easy Way

21) Given an array int a[]. Add the sum at even indexes.do the same with odd indexes.

      if both the sum is equal return 1 or return -1.

package Set2;

public class ClassSET21 {

public static void main(String[] args) {

      int a[]={9,8,5,3,2,6,4,7,5,1};     

      System.out.println(oddEvenIndicesCount(a));

}

public static int oddEvenIndicesCount(int[] a) {

      int n1=0,n2=0,n3=0;

      for(int i=0;i<a.length;i++)

            if(i%2==0)

                  n1+=a[i];

            else

                  n2+=a[i];

      if(n1==n2)

            n3=1;

      else

            n3=-1;

      return n3;

}

}

Learn Java In a Easy Way

20) for the given string display the middle 2 value, case satisfies only if string is of even length

ip - java

op - av

package Set2;

public class ClassSET20 {

public static void main(String[] args) {

      String s1="sumithra";

      System.out.println(printingSubstringOfMiddleChars(s1));

}

public static String printingSubstringOfMiddleChars(String s1) {

      String s2=s1.substring((s1.length()/2)-1, (s1.length()/2)+1);

      return s2;

}

}

Learn Java In a Easy Way

19)Take the word with a max length in the given sentance

 in that check for vowels if so count the no.of occurances !

  Input 1="Bhavane is a good girl"

  Output =3

  Input 1="Bhavanee is a good girl"

  Output =4

package Set2;

import java.util.StringTokenizer;

public class ClassSET19 {

public static void main(String[] args) {

      String s1="Bhavane is a good girl";

      System.out.println(countVowelsInMaxLengthString(s1));

}

public static int countVowelsInMaxLengthString(String s1) {

      int n1=0, max=0;

      String s4="AEIOUaeiou";

      String s3=new String();

      StringTokenizer t=new StringTokenizer(s1," ");

      while(t.hasMoreTokens()){

      String s2=t.nextToken();

      int n2=s2.length();

      if(n2>max){

            max=n2;

            s3=s2;}     }

      for(int i=0;i<s3.length();i++)

            for(int j=0;j<s4.length();j++)

                  if(s3.charAt(i)==s4.charAt(j))

                        n1++;

      return n1;

}

}

Learn Java In a Easy Way

18)String a="a very fine day"

output:A Very Fine Day

package Set2;

import java.util.StringTokenizer;

public class ClassSET18 {

public static void main(String[] args){

      String s1="its a very fine day";   

      System.out.println(capsStart(s1));

}

public static String capsStart(String s1){

      StringBuffer s5=new StringBuffer();

      StringTokenizer t=new StringTokenizer(s1," ");

      while(t.hasMoreTokens()){

            String s2=t.nextToken();

            String s3=s2.substring(0,1);

            String s4=s2.substring(1, s2.length());

            s5.append(s3.toUpperCase()).append(s4).append(" ");   }

      return s5.toString();

}

}

Learn Java In a Easy Way

17)input array={red,green,blue,ivory}

sort the given array

reverse the given array

if user input is 1 it should give oth element of an reversed array.

package Set2;

import java.util.*;

public class ClassSET17 {

public static void main(String[] args) {

      String[] s={"red","green","blue","ivory","yellow"};

      int n=1;

      System.out.println(retrievingRequiredColor(s,n));

}

public static String retrievingRequiredColor(String[] s, int n) {

      String s1=new String();

      List<String> l=new ArrayList<String>();

      for(int i=0;i<s.length;i++)

            l.add(s[i]);

      Collections.sort(l,Collections.reverseOrder());

      for(int i=0;i<l.size();i++)

            if(i==(n-1))

                  s1=l.get(i);

      return s1;

}

}