Mastering

String
Question
PRINT EACH WORD IN A GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class printEachWordstInSentence
{
public static void main(String[] args)
{
String sen="",wd="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen+" ";
sen=sen.toLowerCase();
len=sen.length();
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' ')
{
System.out.print(wd+" ");
wd="";
}
else
{
wd=wd+ch;
}
}

}
}
Question
PROGRAM TO PRINT CHARACTERS IN GIVEN WORD
Answer

import java.util.Scanner;
public class characterInWord
{
public static void main(String[] args)
{
String wd="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a word");
wd = sc.next();

System.out.println("given word:"+wd);
System.out.println("characters in word:");
len=wd.length();
for(i=0;i< len;i++)
{
ch=wd.charAt(i);
System.out.println(ch);

}
}
}
Question
PRINT CHARACTERS IN EVEN POSITION IN THE GIVEN WORD.

ENTER A WORD
MONKEY
CHARACTERS IN EVEN POSITION IN GIVEN WORD:
OKY
Answer

import java.util.Scanner;
public class PrintEvenPositionCharacters
{
public static void main(String[] args)
{
String wd="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a word");
wd = sc.next();

len=wd.length();
System.out.println("CHARACTERS IN EVEN POSITION IN GIVEN WORD:");
for(i=0;i< len;i++)
{
ch=wd.charAt(i);
if((i+1)%2==0)
{

System.out.print(ch+" ");

}
Question
PRINT CHARACTERS IN AN ODD POSITION IN THE GIVEN WORD.
ENTER A WORD
MONKEY
CHARACTERS IN ODD POSITION IN GIVEN WORD:
MNE
Answer

import java.util.Scanner;
public class PrintOddPositionCharacters
{
public static void main(String[] args)
{
String wd="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a word");
wd = sc.next();

len=wd.length();
System.out.println("CHARACTERS IN Odd POSITION IN GIVEN WORD:");
for(i=0;i< len;i++)
{
ch=wd.charAt(i);
if((i+1)%2!=0)
{

System.out.print(ch+" ");

}
Question
PRINT CHARACTERS IN AN ODD POSITION IN THE GIVEN WORD.
ENTER A WORD
MONKEY
CHARACTERS IN ODD POSITION IN GIVEN WORD:
MNE
Answer

import java.util.Scanner;
public class PrintOddPositionCharacters
{
public static void main(String[] args)
{
String wd="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a word");
wd = sc.next();

len=wd.length();
System.out.println("CHARACTERS IN Odd POSITION IN GIVEN WORD:");
for(i=0;i< len;i++)
{
ch=wd.charAt(i);
if((i+1)%2!=0)
{

System.out.print(ch+" ");

}
Question
PRINT FREQUENCY OF CONSONANTS OR NON-VOWELS IN THE GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class printFrequencyOfConsonantsInSentence
{
public static void main(String[] args)
{
String sen="";
char ch=' ';
int i=0,len=0,count=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();

sen=sen.toLowerCase();
len=sen.length();
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch!='a'&&ch!='e'&&ch!='i'&&ch!='o'&&ch!='u'&&ch!=' ')
{
count++;
}
}
System.out.println("Frequency of Consonants in sentence is:"+count);
}
}
Question
PRINT FREQUENCY OF VOWELS IN THE GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class printFrequencyOfVowelsInSentence
{
public static void main(String[] args)
{
String sen="";
char ch=' ';
int i=0,len=0,count=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();

sen=sen.toLowerCase();
len=sen.length();
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')
{
count++;
}
}
System.out.println("Frequency of vowels in sentence is:"+count);
}
}
Question
INPUT A SENTENCE FROM THE USER AND PRINT PALINDROME WORDS IN A GIVEN SENTENCE.

PALINDROME WORDS ARE WORDS THAT ARE THE SAME BACKWARD AND FORWARD.

EXAMPLE:

POP READS SAME, BACKWARD OR FORWARD

MOM READS SAME, BACKWARD OR FORWARD.

ENTER A SENTENCE
MOM AND DAD ARE NOT AT HOME
PALINDROME WORDS IN SENTENCE:
MOM
DAD
Answer

import java.util.Scanner;
public class palindromeWordsInSentence
{
public static void main(String[] args)
{
String sen="",wd="",wd1="";
char ch=' ',lastCharacter=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen+" ";
len=sen.length();
System.out.println("Palindrome words in sentence:");
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' ')
{
if(wd.equalsIgnoreCase(wd1)==true)
{
System.out.println(wd);
}
wd1="";
wd="";

}
else
{
wd=wd+ch;
wd1=ch+wd1;
}
}
}
}
Question
PRINT NON-PALINDROME WORDS IN A GIVEN SENTENCE.

A NON-PALINDROME WORDS ARE WORDS THAT ARE NOT SAME BACKWARD AND FORWARD

EXAMPLE:

POP READS SAME, BACKWARD OR FORWARD SO IT A PALINDROME WORD

MOM READS SAME, BACKWARD OR FORWARD SO IT A PALINDROME WORD

CAT DOES NOT SPELL SAME BACKWARD AND FORWARD SO CAT IS AN NON-PALINDROME WORD

ENTER A SENTENCE:MOM AND DAD ARE NOT AT HOME

NON-PALINDROME WORDS IN GIVEN SENTENCE:
AND
ARE
NOT
AT
HOME
Answer

import java.util.Scanner;
public class nonPalindromeWordsInSentence
{
public static void main(String[] args)
{
String sen="",wd="",wd1="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence:");
sen = sc.nextLine();
sen=sen+" ";
len=sen.length();
System.out.println("Non-Palindrome words in given sentence:");
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' ')
{
if(wd.equalsIgnoreCase(wd1)==false)
{
System.out.println(wd);
}
wd1="";
wd="";
}
else
{
wd=wd+ch;
wd1=ch+wd1;
}
}

}
}
Question
PRINT LARGEST PALINDROME WORDS IN GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class largestPalindromeWordsInSentence
{
public static void main(String[] args)
{
String sen="",wd="",wd1="",largestPalindrome="";
char ch=' ',ch1=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);
System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen+" ";
sen=sen.toLowerCase();
len=sen.length();
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' ')
{

if(wd.equals(wd1)==true)
{
if(wd.length()>largestPalindrome.length())
{
largestPalindrome=wd;
}
}
wd1="";
wd="";
}
else
{
wd=wd+ch;
wd1=ch+wd1;
}
}
System.out.println("Largest Palindrome words in sentence:"+largestPalindrome);
 }
}
Question
PRINT PALINDROME WORDS IN A GIVEN SENTENCE AND FREQUENCY OF PALINDROME WORDS.

PALINDROME WORDS ARE WORDS THAT ARE THE SAME BACKWARD AND FORWARD.

EXAMPLE:

POP READS SAME, BACKWARD OR FORWARD

MOM READS SAME, BACKWARD OR FORWARD.

ENTER A SENTENCE
MOM AND DAD ARE NOT AT HOME
PALINDROME WORDS IN SENTENCE:
MOM
DAD
NUMBER OF PALINDROME WORDS IN GIVEN SENTENCE:2
Answer

import java.util.Scanner;
public class palindromeWordsAndFrequencyInSentence
{
public static void main(String[] args)
{
String sen="",wd="",wd1="";
char ch=' ',lastCharacter=' ';
int i=0,len=0,palindromeWordFrequency=0;
Scanner sc = new Scanner(System.in);
System.out.println("Enter a sentence");
sen = sc.nextLine();
len=sen.length();
lastCharacter=sen.charAt(len-1);
if(lastCharacter!='.')
{
sen=sen+".";
len++;
}
System.out.println("Palindrome words in sentence:");

for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' '||ch=='.')
{
if(wd.equalsIgnoreCase(wd1)==true)
{
System.out.println(wd);
palindromeWordFrequency++;
}
wd1="";
wd="";
}
else
{
wd=wd+ch;
wd1=ch+wd1;
 }
}
System.out.println("Number of palindrome words in given sentence:"+palindromeWordFrequency);
}
}
Question
PRINT CHARACTER WITH MAXIMUM FREQUENCY AND FREQUENCY OF ALL CHARACTERS IN
GIVEN SENTENCE.

ENTER A SENTENCE:
THE QUICK BROWN FOX JUMPED OVER THE LAZY DOG.
A:1
B:1
C:1
D:2
E:4
F:1
G:1
H:2
I:1
J:1
K:1
L:1
M:1
N:1
O:4
P:1
Q:1
R:2
S:0
T:2
U:2
V:1
W:1
X:1
Y:1
Z:1
CHARACTER WITH MAXIMUM FREQUENCY IN GIVEN SENTENCE:E
Answer

import java.util.Scanner;
public class FrequencyOfCharacters
{
public static void main(String[] args)
{
String sen="";
char ch=' ',ch1=' ',maximumFrequencyCharacter=' ';
int i=0,len=0,count=0,maxFrequency=0;
Scanner sc = new Scanner(System.in);
System.out.println("Enter a sentence:");
sen = sc.nextLine();
sen=sen.toUpperCase();
len=sen.length();
for(ch='A';ch<='Z';ch++)
{
count=0;
for(i=0;i< len;i++)
{
ch1=sen.charAt(i);

if(ch1==ch)
{
count++;
}
}
if(count>maxFrequency)
{
maxFrequency=count;
maximumFrequencyCharacter=ch;
}
System.out.println(ch+":"+count);
}
System.out.println("Character with maximum frequency in given
sentence:"+maximumFrequencyCharacter);
}
}
Question
PRINT NUMBER OF WORDS IN THE GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class printNumberOfWordsInSentence
{
public static void main(String[] args)
{
String sen="";
char ch=' ';
int i=0,len=0,count=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen+" ";
len=sen.length();
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' ')
{
count++;
}
}
System.out.println("Frequency of words in sentence is:"+count);
}
}
Question
PROGRAM TO PRINT MAXIMUM OCCURRING CHARACTERS IN A GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class maximumOccurringCharacterInSentence
{
public static void main(String[] args)
{
String sen="";
char ch=' ',ch1=' ',maxOccuring=' ';
int i=0,len=0,count=0,max=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen.toLowerCase();

len=sen.length();
for(ch='a';ch<='z';ch++)
{
count=0;
for(i=0;i< len;i++)
{
ch1=sen.charAt(i);

if(ch1==ch)
{
count++;
}

}
if(count> max)
{
max=count;
maxOccuring=ch;
}
}
System.out.println("maximum occurring character in given sentence:"+maxOccuring);
}
}
Question
PROGRAM TO PRINT THE LEAST OCCURRING CHARACTER IN A GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class leastOccurringCharacterInSentence
{
public static void main(String[] args)
{
String sen="";
char ch=' ',ch1=' ',leastOccuring=' ';
int i=0,len=0,count=0,min=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen.toLowerCase();

len=sen.length();
min=len;
for(ch='a';ch<='z';ch++)
{
count=0;
for(i=0;i< len;i++)
{
ch1=sen.charAt(i);

if(ch1==ch)
{
count++;
}
}
if(count< min&& count>0)
{
min=count;
leastOccuring=ch;
}
}
System.out.println("least occurring character in given sentence:"+leastOccuring);
}
}
Question
FREQUENCY OF NON-PALINDROME WORDS IN A GIVEN SENTENCE.

A NON-PALINDROME WORDS ARE WORDS THAT ARE NOT SAME BACKWARD AND FORWARD

EXAMPLE:

POP READS SAME, BACKWARD OR FORWARD SO IT A PALINDROME WORD

MOM READS SAME, BACKWARD OR FORWARD SO IT A PALINDROME WORD

CAT DOES NOT SPELL SAME BACKWARD AND FORWARD SO CAT IS AN NON-PALINDROME WORD

ENTER A SENTENCE:MOM AND DAD ARE NOT AT HOME

THERE ARE 5 NON-PALINDROME WORD(S) IN GIVEN SENTENCE
Answer

import java.util.Scanner;
public class nonPalindromeWordsInSentence
{
public static void main(String[] args)
{
String sen="",wd="",wd1="";
char ch=' ';
int i=0,len=0,count=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence:");
sen = sc.nextLine();
sen=sen+" ";
len=sen.length();

for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' ')
{
if(wd.equalsIgnoreCase(wd1)==false)
{
count=count+1;
}
wd1="";
wd="";

}
else
{
wd=wd+ch;
wd1=ch+wd1;
}
}
System.out.println("Frequency of Non-Palindrome words in given sentence:"+count);
}
}
Question
PROGRAM TO COUNT FREQUENCY OF CHARACTERS IN GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class frequencyOfCharactersInSentence
{
public static void main(String[] args)
{
String sen="";
char ch=' ',ch1=' ';
int i=0,len=0,count=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen.toUpperCase();
len=sen.length();
for(ch='A';ch<='Z';ch++)
{
count=0;
for(i=0;i< len;i++)
{
ch1=sen.charAt(i);

if(ch1==ch)
{
count++;
}

}
System.out.println(ch+":"+count);
}
}
}
Question
FIND THE DUPLICATE CHARACTERS OF GIVEN WORD
Answer

import java.util.Scanner;
public class duplicateCharactersInWord
{
public static void main(String[] args)
{
int i=0,j=0,count=0;
String wd="";
Scanner sc = new Scanner(System.in);

System.out.println("Enter a word");

wd =sc.next();

/*Converts given word into character array*/

char characters[] = wd.toCharArray();

System.out.println("Duplicate characters in "+wd+":");

for(i = 0; i < characters.length; i++)
{
count = 0;
for(j = i+1; j < characters.length; j++)
{
if(characters[i] == characters[j])
{
count++;
/*Set characters[j] to ~ to avoid printing visited character*/
characters[j] = '~';
}
}
/*A character is considered as duplicate if count is greater than 1 */
if(count > 0 && characters[i] != '~')
{
System.out.println(characters[i]);
}
}
}
}
Question
FIND THE DUPLICATE CHARACTERS OF A SENTENCE

ENTER THE SENTENCE:

THE QUICK BROWN FOX JUMPED OVER THE LAZY DOG
D
E
H
O
R
T
U
Answer

import java.util.Scanner;
public class program
{
public static void main(String[] args)
{
String sen="";
char ch=' ',ch1=' ';
int i=0,count=0,len=0,asciiValueOfA=0,asciiValueOfZ=0;
Scanner sc = new Scanner(System.in);
System.out.println("Enter the sentence:");
sen = sc.nextLine();
sen=sen.toUpperCase();
asciiValueOfA=(int)'A';
asciiValueOfZ=(int)'Z';
len=sen.length();
System.out.println("Duplicate characters in given sentence:);
for(ch='A';ch<='Z';ch++)
{
count=0;
for(i=0;i< len;i++)
{
ch1=sen.charAt(i);
if(ch==ch1)
{
count++;
}
}
if(count>1)
{
System.out.println(ch);
}
}
}
}
Question
CHECK WHETHER TWO WORDS OR TWO SENTENCES ARE ANAGRAMS OR NOT
Answer

import java.util.Scanner;
public class AnagramOrNot
{
public static char[] sort(char[] characters)
{
int i=0,k=0;
char ch=' ';
char[] sorted=new char[characters.length];

for(ch='a';ch<='z';ch++)
{
for(i=0;i< characters.length;i++)
{
if(characters[i]==ch)
{
sorted[k]=characters[i];
k++;
}

}
}
return sorted;
}

public static void isAnagram(char[] str1,char[] str2)

{
int i=0;
boolean flag=true;
for(i=0;i< str1.length;i++)
{
if(str1[i]!=str2[i])
{
flag=false;
break;
}
}
 if(flag==true)
{
System.out.println("Both the words or sentences are anagram ");
}
else
{
System.out.println("Both the words or sentences are not anagram words");
}

public static void main (String [] args)

{
String wd="",wd1="";
Scanner sc = new Scanner(System.in);

System.out.println("first word or sentence");

wd = sc.nextLine();
System.out.println("second word or sentence");
wd1 = sc.nextLine();

System.out.println("first word or sentence:"+wd);

System.out.println("Second word or sentence:"+wd1);
/*Converting both the string to lower case and removing all spaces in them if any*/

wd = wd.toLowerCase();
wd1 = wd1.toLowerCase();
wd=wd.replaceAll(" ", "");
wd1=wd1.replaceAll(" ", "");

/*Checking for the length of strings*/

if (wd.length() != wd1.length())
{
System.out.println("Both the words or sentences are not anagram words");
}
 else
{
/*Converting both the arrays to character array */
char[] str1 = wd.toCharArray();
char[] str2 = wd1.toCharArray();

/*Sorting the arrays using sort() method defined above*/

str1=sort(str1);
str2=sort(str2);

isAnagram(str1,str2);
}
}
}
Question
CHECK WHETHER A WORD IS PALINDROME OR NOT

A PALINDROME WORD IS A WORD THAT READS THE SAME BACKWARD AS FORWARD, SUCH AS
MADAM OR RACECAR.

ENTER A WORD:MOM
MOM IS A PALINDROME WORD

ENTER A WORD:WEATHER
WEATHER IS NOT A PALINDROME WORD
Answer

import java.util.Scanner;
public class checkPalindromeWord
{
public static void main(String[] args)
{
String wd="",wd1="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a word");
wd = sc.next();

System.out.println("given word:"+wd);

len=wd.length();
for(i=0;i< len;i++)
{
ch=wd.charAt(i);

wd1=ch+wd1;

}
if(wd1.equals(wd)==true)
{
System.out.println(wd+" is a palindrome word");
}
else
{
System.out.println(wd+" is not a palindrome word");

}
}
}
Question
PROGRAM TO PRINT CONSONANTS OR NON-VOWELS IN GIVEN WORD
Answer

import java.util.Scanner;
public class consonantsInWord
{
public static void main(String[] args)
{
String wd="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a word");
wd = sc.next();
wd=wd.toLowerCase();
System.out.println("given word:"+wd);
System.out.println("Consonants of word:");
len=wd.length();
for(i=0;i< len;i++)
{
ch=wd.charAt(i);
if(ch!='a'&&ch!='e'&&ch!='i'&&ch!='o'&&ch!='u')
{
System.out.println(ch);

}
}
}
Question
CREATE A NEW WORD USING FIRST LETTER OF EACH WORD IN GIVEN SENTENCE AND ARRANGE
CHARACTERS OF NEW WORD IN ALPHABETICAL ORDER

ENTER A SENTENCE
THE CAPITAL OF INDIA IS NEW DELHI.
NEW WORD:TCOIIND
WORD ARRANGED IN ALPHABETICAL ORDER:CDIINOT
Answer

import java.util.Scanner;
public class CreateNewWordAndArrangeAlphabetically
{
public static void main()
{
String sen="",wd="",newWd="";
int len=0,i=0,j=0;
char ch=' ',temp=' ';
char characters[];
Scanner sc=new Scanner(System.in);
System.out.println("Enter a sentence");
sen=sc.nextLine();
sen=sen.toUpperCase();
len=sen.length();
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(i==0)
{
wd=wd+sen.charAt(i);
}
else if(ch==' ')
{
wd=wd+sen.charAt(i+1);
}
}

characters=new char[wd.length()];
for(i=0;i< wd.length();i++)
{
characters[i]=wd.charAt(i);

}
 for(i=0;i< wd.length();i++)
{
for(j=0;j< wd.length();j++)
{
if(characters[i]< characters[j])
{
temp=characters[i];
characters[i]=characters[j];
characters[j]=temp;
}
}
}

for(i=0;i< characters.length;i++)
{
newWd=newWd+characters[i];
}
System.out.println("New Word:"+wd);
System.out.println("Word Arranged in Alphabetical order:"+newWd);
}

}
Question
DETERMINE WHETHER A GIVEN STRING IS ROTATION TO ANOTHER STRING.
TO FIND ROTATION OF STRING , WE CONCATENATE STRING 1 WITH STRING 1. THEN, TRY TO
FIND THE STRING 2 IN CONCATENATED STRING USING INDEXOF() METHOD. IF STRING 2 IS
PRESENT IN CONCATENATED STRING THEN, STRING 2 IS ROTATION OF STRING 1.
Answer

import java.util.Scanner;
public class rotationString
{
public static void main(String[] args)
{
String str="",str1="";
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter 1st string");

str = sc.next();
System.out.println("Enter 2nd string");
str1 = sc.next();

if(str.length() != str1.length())
{
System.out.println(str1+" is not a rotation of "+str);
}
else
{
/*Concatenate str with str and store it in str*/
str = str+str;

/*Check whether str1 is present in str*/

if(str.indexOf(str1) != -1)
System.out.println(str1+" is a rotation of "+str);
else
System.out.println(str1+" is not a rotation of "+str);
}
}
}
Question
WRITE A PROGRAM IN JAVA TO ACCEPT A NAME AND DISPLAY THE INITIALS OF FIRST AND
MIDDLE NAME AND FULL LAST NAME.

EXAMPLE 1:
INPUT: LAXMI NARAYAN SHARMA
OUTPUT:L N SHARMA
EXAMPLE2:
INPUT:AKASH SHARMA
OUTPUT:A SHARMA
Answer

import java.util.Scanner;
public class program
{
public static void main(String[] args)
{
String name="",wd="",newname="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter full name:");

name = sc.nextLine();
name=name+" ";
len=name.length();
for(i=0;i< len;i++)
{
ch=name.charAt(i);
if(ch==' ')
{
/* if 'i' is equal to (len-1) then we are at the end of string and variable wd contains last name
*/
if(i==(len-1))
{
newname=newname+wd;
}
else
{
newname=newname+wd.charAt(0)+" ";
}
wd="";
}
else
{
wd=wd+ch;
}
}
 System.out.println("Name with first and middle name with initials and full last name:"+
newname);
}
}
Question
DIVIDE A SENTENCE INTO 'X' EQUAL PARTS IN THE GIVEN SENTENCE. IF NOT DIVISIBLE IN
EQUAL PARTS, SHOW AN ERROR.
Answer

import java.util.Scanner;
public class divideSentenceInXEqualParts
{
public static void main(String[] args)
{
String sen="",part="";
char chars=' ';
int i=0,len=0,temp=0,x=0;

Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
System.out.println("Enter 'x':");
x = sc.nextInt();
sen=sen.replaceAll(" ","");
len=sen.length();
if(len % x != 0)
{
System.out.println("Sentence cannot be divided into "+ x +" equal parts.");
}
else
{
System.out.println(x+" Equal parts of given sentence");

for(i = 0; i < len; i = i+(len/x))

{
/*Dividing string in x equal part */
part = sen.substring(i, i+len/x);
System.out.println(part);

}
}
Question
PRINT PIG LATIN FORM OF A GIVEN SENTENCE.
TO TRANSLATE A WORD INTO A PIGLATIN WORD, CONVERT THE WORD INTO UPPERCASE AND
THEN PLACE THE FIRST VOWEL OF THE ORIGINAL WORD AS THE START OF THE NEW WORD
ALONG WITH THE REMAINING ALPHABETS. THE ALPHABETS PRESENT BEFORE THE VOWEL BEING
SHIFTED TOWARDS THE END FOLLOWED BY “AY”.
EXAMPLE:
LONDON BECOMES ONDONLAY
CAT BECOMES ATCAY

ENTER THE SENTENCE:

QUICK BROWN FOX JUMPED OVER THE LAZY DOG
ORIGINAL SENTENCE:QUICK BROWN FOX JUMPED OVER THE LAZY DOG.
NEW SENTENCE:UICKQAY OWNBRAY OXFAY UMPEDJAY OVERAY ETHAY AZYLAY OGDAY.

ENTER THE SENTENCE:

THE CAPITAL OF INDIA IS NEW DELHI.
ORIGINAL SENTENCE:THE CAPITAL OF INDIA IS NEW DELHI.
NEW SENTENCE:ETHAY APITALCAY OFAY INDIAAY ISAY EWNAY ELHIDAY.
Answer

import java.util.Scanner;
public class Piglatin
{
public static void main()
{
int i,len=0,j=0;
String sen="",newSen="",wd="",piglatinWd="";
char ch= ' ',ch1=' ';
boolean vowelFound=false;
Scanner sc=new Scanner(System.in);
System.out.println("Enter the Sentence:");
sen=sc.nextLine();
len=sen.length();
if(sen.charAt(len-1)!='.')
{
sen=sen+".";
len=len+1;
}
len=sen.length();
sen=sen.toUpperCase();
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' '||ch=='.')
{
for(j=0;j< wd.length();j++)
{
ch1=wd.charAt(j);
if(ch1=='A'||ch1=='E'||ch1=='I'||ch1=='O'||ch1=='U')
{
vowelFound=true;
break;
}
}
 if(vowelFound==true)
{
piglatinWd=wd.substring(j);
piglatinWd=piglatinWd+wd.substring(0,j)+"AY";

}
else
{
piglatinWd=wd+"AY";
}
newSen=newSen+piglatinWd+ch;
piglatinWd="";
wd="";
vowelFound=false;
}
else
{
wd=wd+ch;
}
}
System.out.println("Original Sentence:"+sen);
System.out.println("New Sentence:"+newSen);
}
}
Question
PROGRAM TO PRINT REVERSE OF WORD
Answer

import java.util.Scanner;
public class reverseOfWord
{
public static void main(String[] args)
{
String wd="",wd1="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a word");
wd = sc.next();

System.out.println("given word:"+wd);
len=wd.length();
for(i=0;i< len;i++)
{
ch=wd.charAt(i);

wd1=ch+wd1;

}
System.out.println("Reverse of word:"+wd1);
}
}
Question
PROGRAM TO PRINT REVERSE OF EACH WORDS IN GIVEN SENTENCE.

ENTER A SENTENCE
QUICK BROWN FOX JUMPED OVER THE LAZY DOG
GIVEN SENTENCE:QUICK BROWN FOX JUMPED OVER THE LAZY DOG
REVERSE OF EACH WORDS:
KCIUQ
NWORB
XOF
DEPMUJ
REVO
EHT
YZAL
GOD
Answer

import java.util.Scanner;
public class reverseOfEachWordsInSentence
{
public static void main(String[] args)
{
String sen="",wd="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen+" ";
System.out.println("given sentence:"+sen);
System.out.println("Reverse of each words:");
len=sen.length();
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' ')
{
System.out.println(wd+" ");
wd="";
}
else
{
wd=ch+wd;

}
}

}
}
Question
PROGRAM TO PRINT REVERSE OF THE SENTENCE WHILE PRESERVING THE POSITION OF WORDS.

ENTER A SENTENCE
QUICK BROWN FOX JUMPED OVER THE LAZY DOG.
GIVEN SENTENCE:QUICK BROWN FOX JUMPED OVER THE LAZY DOG.
REVERSE OF SENTENCE:KCIUQ NWORB XOF DEPMUJ REVO EHT YZAL GOD.
Answer

import java.util.Scanner;
public class reverseOfEachWordsInSentence
{
public static void main(String[] args)
{
String sen="",wd="",newSen="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
len=sen.length();
if(sen.charAt(len-1)!='.')
{
sen=sen+".";
len=len+1;
}
System.out.println("given sentence:"+sen);

for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' '||ch=='.')
{
newSen=newSen+wd+ch;
wd="";
}
else
{
wd=ch+wd;

}
}
System.out.println("Reverse of Sentence:"+newSen);
}
}
Question
PROGRAM TO PRINT THE REVERSE OF THE GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class reverseOfGivenSentence
{
public static void main(String[] args)
{
String sen="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();

len=sen.length();
for(i=(len-1);i>=0;i--)
{
ch=sen.charAt(i);

System.out.print(ch);

}
}
Question
PRINT LARGEST AND SMALLEST PALINDROME WORDS IN A GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class largestAndSmallestPalindromeWordsInSentence
{
public static void main(String[] args)
{
String sen="",wd="",wd1="",largestPalindrome="",smallestPalindrome="";
char ch=' ',ch1=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen+" ";
sen=sen.toLowerCase();
len=sen.length();
smallestPalindrome=sen;
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' ')
{

if(wd.equals(wd1)==true)
{
if(wd.length()>largestPalindrome.length())
{
largestPalindrome=wd;
}
if(wd.length()< smallestPalindrome.length())
{
smallestPalindrome=wd;
}
}
wd1="";
wd="";
 }
else
{
wd=wd+ch;
wd1=ch+wd1;
}
}
System.out.println("Largest Palindrome words in sentence:"+largestPalindrome);
System.out.println("Smallest Palindrome words in sentence:"+smallestPalindrome);

}
}
Question
PRINT SMALLEST PALINDROME WORDS IN A GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class smallestPalindromeWordsInSentence
{
public static void main(String[] args)
{
String sen="",wd="",wd1="",smallestPalindrome="";
char ch=' ',ch1=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);
System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen+" ";
sen=sen.toLowerCase();
len=sen.length();
smallestPalindrome=sen;
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' ')
{
if(wd.equals(wd1)==true)
{
if(wd.length()< smallestPalindrome.length())
{
smallestPalindrome=wd;
}
}
wd1="";
wd="";
}
else
{
wd=wd+ch;
wd1=ch+wd1;
}
}
System.out.println("Smallest Palindrome words in sentence:"+smallestPalindrome);
 }
}
Question
PRINT FREQUENCY OF PUNCTUATION IN THE GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class printFrequencyOfPunctuationInSentence
{
public static void main(String[] args)
{
String sen="";
char ch=' ';
int i=0,len=0,count=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();

len=sen.length();
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch == '!' ||ch == ','||ch == ';'||ch== '.'||ch==
'?'||ch==':'||ch=='('||ch==')'||ch=='"'||ch=='['||ch==']'||ch=='-'||ch=='_'||ch=='*'||ch=='/')
{
count++;
}
}
System.out.println("Frequency of punctuation in sentence is:"+count);
}
}
Question
PROGRAM TO PRINT VOWELS IN GIVEN WORD
Answer

import java.util.Scanner;
public class vowelInWord
{
public static void main(String[] args)
{
String wd="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a word");
wd = sc.next();
wd=wd.toLowerCase();
System.out.println("given word:"+wd);
System.out.println("vowels of word:");
len=wd.length();
for(i=0;i< len;i++)
{
ch=wd.charAt(i);
if(ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')
{
System.out.println(ch);

}
}
}
}
Question
PRINT WORDS IN AN EVEN POSITION IN THE GIVEN SENTENCE.

ENTER A SENTENCE
QUICK BROWN FOX JUMPED OVER THE LAZY DOG
WORDS IN EVEN POSITION IN GIVEN SENTENCE
BROWN
JUMPED
THE
DOG
LAZY
Answer

import java.util.Scanner;
public class PrintEvenPositionWords
{
public static void main(String[] args)
{
String sen="",wd="";
char ch=' ';
int i=0,len=0,count=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen+" ";
len=sen.length();
System.out.println("WORDS IN EVEN POSITION IN GIVEN SENTENCE");
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' ')
{
count++;
if(count%2==0)
{
System.out.println(wd);

}
wd="";
}
else
{
wd=wd+ch;
}
}

}
}
Question
PRINT EACH WORD IN A GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class printEachWordstInSentence
{
public static void main(String[] args)
{
String sen="",wd="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen+" ";
sen=sen.toLowerCase();
len=sen.length();
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' ')
{
System.out.print(wd+" ");
wd="";
}
else
{
wd=wd+ch;
}
}

}
}
Question
PRINT WORDS IN AN ODD POSITION IN THE GIVEN SENTENCE.

ENTER A SENTENCE
QUICK BROWN FOX JUMPED OVER THE LAZY DOG
WORDS IN ODD POSITION IN GIVEN SENTENCE
QUICK
FOX
OVER
LAZY
Answer

import java.util.Scanner;
public class PrintOddPositionWords
{
public static void main(String[] args)
{
String sen="",wd="";
char ch=' ';
int i=0,len=0,count=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen+" ";
len=sen.length();
System.out.println("WORDS IN ODD POSITION IN GIVEN SENTENCE");
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' ')
{
count++;
if(count%2!=0)
{
System.out.println(wd);

}
wd="";
}
else
{
wd=wd+ch;
}
}

}
}
Question
PROGRAM TO PRINT WORDS WHOSE FIRST CHARACTER OF THE WORD IS UPPERCASE AND LAST
CHARACTER OF THE WORD IS LOWERCASE.

ENTER THE SENTENCE:

QUICK BROWN FOX JUMPED OVER THE LAZY DOG
WORDS WHOSE FIRST LETTER IS UPPERCASE AND LAST LETTER IS LOWERCASE:
QUICK JUMPED LAZY

ENTER THE SENTENCE:

THE CAPITAL OF INDIA IS NEW DELHI.
WORDS WHOSE FIRST LETTER IS UPPERCASE AND LAST LETTER IS LOWERCASE:
THE INDIA NEW DELHI
Answer

import java.util.Scanner;
public class WordWithFirstLetterUppercaseAndLastLetterLowercase
{
public static void main()
{
int i=0,len=0,lengthOfWord=0;
String sen="",newSen="",wd="";
char ch=' ',lastCharacter=' ';
Scanner sc=new Scanner(System.in);
System.out.println("Enter the Sentence that ends with a full stop:");
sen=sc.nextLine();
len=sen.length();
lastCharacter=sen.charAt(len-1);
//This 'if' condition will put full stop if user has not done it
if(lastCharacter!='.')
{
sen=sen+".";
len++;
}
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' '||ch=='.')
{
lengthOfWord=wd.length();
lastCharacter=wd.charAt(lengthOfWord-1);
// This 'if' condition case check if the first character is uppercase and last character is
lowercase.
if(Character.isUpperCase(wd.charAt(0))&&Character.isLowerCase(lastCharacter)==true)
{
newSen=newSen+wd;
newSen=newSen+" ";
}
wd="";
}
 else
{
wd=wd+ch;
}
}
System.out.println("Words whose first letter is uppercase and last letter is lowerCase:");
System.out.println(newSen);
}
}
Question
FIND ALL THE PERMUTATION OF A WORD.
Answer

import java.util.Scanner;
public class permuteWord
{
/*Function for swapping the characters at position I with character at position j */
public static String swapcharacter(String a, int i, int j)
{
char[] b =a.toCharArray();
char ch;
ch = b[i];
b[i] = b[j];
b[j] = ch;
return String.valueOf(b);
}

public static void main(String[] args)

{
String wd="";
Scanner sc = new Scanner(System.in);

System.out.println("Enter a word");

wd =sc.next();
int len = wd.length();
System.out.println("All the permutations of the string are: ");
makePermutation(wd, 0, len);
}

/*Function for making different permutations of the string */

public static void makePermutation(String str, int s, int e)
{
/*print string*/
if (s == e-1)
System.out.println(str);
else
{
 for (int i = s; i < e; i++)
{
/*Swapping the string by fixing a character */
str = swapcharacter(str,s,i);
/*Recursively calling function makePermutation() for rest of the characters*/
makePermutation(str,s+1,e);
/*Backtracking and swapping the characters again. */
str = swapcharacter(str,s,i);
}
}
}
}
Question
PROGRAM TO PRINT THE LARGEST AND SMALLEST WORDS IN A GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class largestAndSmallestWordInSentence
{
public static void main(String[] args)
{
String sen="",wd="",large="",small="";
char ch=' ';
int i=0,len=0,count=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen+" ";
large=Character.toString(sen.charAt(0));
small=sen;
len=sen.length();
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' ')
{
if(wd.length()>large.length())
{
large=wd;
}
if(wd.length()< small.length())
{
small=wd;
}

wd="";
}
else
{
count++;
wd=wd+ch;
 }
}
System.out.println("largest word:"+large);
System.out.println("smallest word:"+small);

}
}
Question
PROGRAM TO REMOVE WHITE SPACES FROM A SENTENCE.
Answer

import java.util.Scanner;
public class printWhiteSpacesFromSentence
{
public static void main(String[] args)
{
String sen="",sen1="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen;
System.out.println("Sentences with white space:"+sen);

len=sen.length();
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch!=' ')
{
sen1=sen1+ch;
}
}
System.out.println("Sentences without white space:"+sen1);
}
}
Question
INPUT A SENTENCE FROM A USER THAT ENDS WITH A FULL STOP AND REMOVE ALL THE EXTRA
SPACES FROM THE SENTENCE.

ENTER THE SENTENCE:

THE QUICK BROWN FOX JUMPED OVER THE LAZY DOG.
SENTENCE AFTER REMOVING EXTRA SPACES:
THE QUICK BROWN FOX JUMPED OVER THE LAZY DOG.
Answer

import java.util.Scanner;
public class RemoveExtraSpaces
{
public static void main()
{
int i=0,len=0;
String sen="",newSen="",wd="";
char ch=' ',lastCharacter=' ';
Scanner sc=new Scanner(System.in);
System.out.println("Enter the Sentence:");
sen=sc.nextLine();
len=sen.length();
lastCharacter=sen.charAt(len-1);
if(lastCharacter!='.')
{
sen=sen+".";
len++;
}
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' '||ch=='.')
{
if(wd.equals("")==false)
{
newSen=newSen+wd;
newSen=newSen+ch;
}
wd="";
}
else
{
wd=wd+ch;
}
}
System.out.println("Sentence after removing extra Spaces:");
System.out.println(newSen);
 }
}
Question
REMOVE ALL PUNCTUATION MARKS OR SPECIAL CHARACTERS AND THEN REVERSE THE
SENTENCE(WORD-WISE) IN A GIVEN SENTENCE.

ENTER THE SENTENCE WITH PUNCTUATION MARKS:

QUICK> BROWN? FOX< JUMPED\ OVER? THE: "LAZY/ DOG.
DOG LAZY THE OVER JUMPED FOX BROWN QUICK

ENTER THE SENTENCE WITH PUNCTUATION MARKS:

I WENT TO/*-+'][;\/., MEET.-*/ "SANDY"
SANDY MEET TO WENT I
Answer

import java.util.Scanner;
public class reverseWordsinsentence
{
public static void main()
{
int i=0,len=0;
String sen="",newSen="",wd="";
char ch=' ',lastCharacter=' ';
Scanner sc=new Scanner(System.in);
System.out.println("Enter the sentence with punctuation marks:");
sen=sc.nextLine();
len=sen.length();
lastCharacter=sen.charAt(len-1);
if(Character.isLetter(lastCharacter)==true||Character.isDigit(lastCharacter)==true)
{
sen=sen+".";
len++;
}
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' '||i==len-1)
{
if(i==len-1)
{
newSen=wd+newSen;
}
else
{
newSen=wd+newSen;
newSen=" "+newSen;
}

wd="";

}
 else
{
if(Character.isLetter(ch)==true||Character.isDigit(ch)==true)
{
wd=wd+ch;
}
}

}
System.out.println(newSen);
}
}
Question
PROGRAM TO REPLACE LOWER CASE CHARACTER TO UPPER CASE AND VICE VERSA IN A GIVEN
SENTENCE.
Answer

import java.util.Scanner;
public class replaceLowerCaseToUpperCaseAndViceVersaInSentence
{
public static void main(String[] args)
{
String sen="",wd="";
char ch=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
sen=sen+" ";
len=sen.length();
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' ')
{
System.out.print(wd+" ");
wd="";
}
else
{
if(Character.isLowerCase(ch)==true)
{
wd=wd+Character.toUpperCase(ch);
}
else
{
wd=wd+Character.toLowerCase(ch);
}

}
}
}
}
Question
REPLACE VOWELS WITH NEXT VOWEL(A WITH E,E WITH I,...U WITH A) IN GIVEN SENTENCE

ENTER THE SENTENCE:

QUICK BROWN FOX JUMPED OVER THE LAZY DOG.
ORIGINAL SENTENCE:QUICK BROWN FOX JUMPED OVER THE LAZY DOG.
NEW SENTENCE:QAOCK BRUWN FUX JAMPID UVIR THI LEZY DUG.
Answer

import java.util.Scanner;
public class replaceVowelsWithAdjacentVowels
{
public static void main()
{
int i,len=0;
String sen="",newSen="";
char ch= ' ';

Scanner sc=new Scanner(System.in);

System.out.println("Enter the Sentence:");
sen=sc.nextLine();
len=sen.length();
if(sen.charAt(len-1)!='.')
{
sen=sen+".";
len=len+1;
}
len=sen.length();
sen=sen.toUpperCase();

for(i=0;i< len;i++)
{
ch=sen.charAt(i);

if(ch=='A')
{
newSen=newSen+'E';
}
else if(ch=='E')
{
newSen=newSen+'I';
}
else if(ch=='I')
{
newSen=newSen+'O';
}
 else if(ch=='O')
{
newSen=newSen+'U';
}
else if(ch=='U')
{
newSen=newSen+'A';
}
else
{
newSen=newSen+ch;
}
}

System.out.println("Original Sentence:"+sen);
System.out.println("New Sentence:"+newSen);

}
}
Question
REPLACE VOWELS WITH STARS IN A GIVEN SENTENCE.

ENTER THE SENTENCE:

QUICK BROWN FOX JUMPED OVER THE LAZY DOG.
ORIGINAL SENTENCE:QUICK BROWN FOX JUMPED OVER THE LAZY DOG.
NEW SENTENCE:Q**CK BR*WN F*X J*MP*D *V*R TH* L*ZY D*G.
Answer

import java.util.Scanner;
public class vowelToStar
{
public static void main()
{
int i,len=0;
String sen="",newSen="";
char ch= ' ';
Scanner sc=new Scanner(System.in);
System.out.println("Enter the sentence:");
sen=sc.nextLine();
len=sen.length();
if(sen.charAt(len-1)!='.')
{
sen=sen+".";
len=len+1;
}
for(i=0;i< len;i++)
{
ch=sen.charAt(i);

if(ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u'||ch=='A'||ch=='E'||ch=='I'||ch=='O'||ch=='U')
{
newSen=newSen+"*";
}
else
{
newSen=newSen+ch;
}
}
System.out.println("Original Sentence:"+sen);
System.out.println("new Sentence:"+newSen);
}
}
Question
PROGRAM TO REPLACE WHITE SPACES WITH A SPECIFIC CHARACTER IN A GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class replaceWhiteSpacesToSpecificCharacterInSentence
{
public static void main(String[] args)
{
String sen="",wd="";
char ch=' ',ch1=' ';
int i=0,len=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
System.out.println("Enter the character that replaces white spaces");
ch1 = sc.next().charAt(0);

len=sen.length();
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' '||i==(len-1))
{
wd=wd+ch1;
System.out.print(wd);
wd="";
}
else
{
wd=wd+ch;
}
}
}
}
Question
CHECK WHETHER THE SEARCHED WORD IS PRESENT IN THE GIVEN SENTENCE.
Answer

import java.util.Scanner;
public class SearchWordInSentence
{
public static void main(String[] args)
{
String sen="",wd="",wd1="";
char ch=' ';
int i=0,len=0,flag=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a sentence");
sen = sc.nextLine();
System.out.println("Enter the word to be searched");
wd = sc.next();
wd=wd.toLowerCase();
sen=sen+" ";
sen=sen.toLowerCase();
len=sen.length();

for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' ')
{
if(wd1.equals(wd)==true)
{
flag=1;

break;
}
wd1="";
}
else
{
wd1=wd1+ch;
}
}
 if(flag==0)
{
System.out.println(wd+" is not present in the given sentence");
}

}
}
Question
SORT LETTERS IN WORD IN ASCENDING ORDER AND PRINT MISSING LETTERS IN THE WORD

ENTER THE WORD:

DELHI
ORIGINAL WORD:DELHI
SORTED WORD:DEHIL
MISSING LETTER:FGJK
Answer

import java.util.Scanner;
public class SortAndPrintMissingLetters
{
public static void main()
{
int i,len=0,j=0;
String wd="",newWd="",missingLetters="";
char ch= ' ',ch1=' ',temp=' ';
char characters[];
char startPosition=' ',endPosition=' ';
boolean characterFound=false;
Scanner sc=new Scanner(System.in);
System.out.println("Enter the word:");
wd=sc.next();
len=wd.length();
wd=wd.toUpperCase();
characters=new char[len];
for(i=0;i< len;i++)
{
characters[i]=wd.charAt(i);

}
for(i=0;i< len;i++)
{
for(j=0;j< len;j++)
{
if(characters[i]< characters[j])
{
temp=characters[i];
characters[i]=characters[j];
characters[j]=temp;
}
}
}
for(i=0;i< len;i++)
{
newWd=newWd+characters[i];
 }
System.out.println("Original Word:"+wd);
System.out.println("Sorted Word:"+newWd);
startPosition=newWd.charAt(0);
endPosition=newWd.charAt(len-1);

for(ch=startPosition;ch<=endPosition;ch++)
{
characterFound=false;
for(i=0;i< len;i++)
{
ch1=newWd.charAt(i);
if(ch==ch1)
{
characterFound=true;
break;
}
}
if(characterFound==false)
{
missingLetters=missingLetters+ch;
}
}
System.out.println("Missing Letter:"+missingLetters);
}
}
Question
SORT WORDS IN DESCENDING ORDER OF THEIR LENGTH AND WORDS WITH THE SAME LENGTH
SHOULD BE SORTED ALPHABETICALLY.

ENTER THE SENTENCE:

TO HANDLE YOURSELF USE YOUR HEAD AND TO HANDLE OTHER USE YOUR HEART.
YOURSELF HANDLE HANDLE HEART OTHER HEAD YOUR YOUR AND USE USE TO TO.
ENTER THE SENTENCE:
THIS IS HUMAN RESOURCE DEPARTMENT.
DEPARTMENT RESOURCE HUMAN THIS IS.
Answer

import java.util.Scanner;

public class SortWord

{
public static void main()
{
int i,len=0,j=0,noOfWords=0;
char ch= ' ';
String sen="",wd="",temp="";
String arr[];
Scanner sc=new Scanner(System.in);
System.out.println("Enter the Sentence:");
sen=sc.nextLine();
len=sen.length();
if(sen.charAt(len-1)!='.')
{
sen=sen+".";
len=len+1;
}
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' '||ch=='.')
{
noOfWords++;
}
}
arr=new String[noOfWords];
for(i=0;i< len;i++)
{
ch=sen.charAt(i);
if(ch==' '||ch=='.')
{

arr[j]=wd;
wd="";
j++;
 }
else
{
if(i==0||sen.charAt(i-1)==' ')
{
ch=Character.toUpperCase(ch);
}
wd=wd+ch;
}
}
for(i=0;i< noOfWords;i++)
{
for(j=0;j< noOfWords;j++)
{

if(arr[i].length()>arr[j].length())
{
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}

else if(arr[i].length()==arr[j].length())
{
//CompareTo compare two strings
//Here if arr[i] is before arr[j] in dictionary then it returns value less than 0
//else it will return value greater than 1
// example arr[i]=cat and arr[j]=bat,we can see cat is put after bat in dictionary
therefore
//it will return value greater than 0
if(arr[i].compareTo(arr[j])< 0)
{
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
 }
}

for(i=0;i< noOfWords;i++)
{
if(i!=noOfWords-1)
{
System.out.print(arr[i]+" ");
}
else
{
System.out.print(arr[i]);
}

}
System.out.print(".");
}
}
Question
FIND ALL THE SUBSETS OF A WORD
Answer

import java.util.Scanner;
public class SubsetWord
{

public static void main(String[] args)

{
String wd="";
String arr[];
int temp=0,len=0,i=0,j=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter a word");

wd =sc.next();
len = wd.length();
temp = 0;
/*Total possible subsets for string of size len is len*(len+1)/2 */
arr = new String[len*(len+1)/2];

for(i = 0; i < len; i++)

{
/*loop adds the next character every iteration for the subset to form and add it to
the array */
for(j = i; j < len; j++)
{
arr[temp] = str.substring(i, j+1);
temp++;
}
}

/*prints all the subsets from the variable 'arr'*/

System.out.println("subsets for "+wd+ " are: ");
for(int i = 0; i < arr.length; i++) {
System.out.println(arr[i]);
}
}
}
Question
FIND THE LENGTH OF THE LONGEST REPEATING SEQUENCE IN THE GIVEN STRING.
Answer

import java.util.Scanner;

public class LengthOfLongestRepeatingSequence

{
/* Function to find the length of longest repeating sequence */
public static int findLRSeq(String str)
{
int i=0,j=0,n=0;
int[][] dp;

n = str.length();

dp = new int[n+1][n+1];

for (i=1; i<=n; i++)

{
for (j=1; j<=n; j++)
{
/* If characters match and indexes are not same*/
if (str.charAt(i-1) == str.charAt(j-1) && i!=j)
dp[i][j] = 1 + dp[i-1][j-1];

/* If characters do not match */

else
dp[i][j] = Math.max(dp[i][j-1], dp[i-1][j]);
}
}
return dp[n][n];
}

public static void main (String[] args)

{
String sen="";
Scanner sc = new Scanner(System.in);
 System.out.println("Enter a string");
sen = sc.next();
System.out.println("The length of the longest sequence that repeats itself:"+findLRSeq(sen));
}
}