2. Number Validation Write Write a program to read a string of 10 digit number , check whether the string contains a 10 digit number in the format XXX-XXX-XXXX where 'X' is a digit.
Include a class UserMainCode with a static method validateNumber which accepts a string as input . The return return tpe of the output should be 1 if the string meets meets the abo!e speci"ed format . In case the number does not meet the speci"ed format then return -1 as output. #reate a class Main which would get the input as a $tring of numbers and call the static methodvalidateNumber present in the %ser&ain#ode. Input and Output Format: Input consists of a string. utput is a string specifing the gi!en string is !alid or not . (efer (efer sample output for formatting speci"cations. Sample Input 1: 1)*-+-/ Sample Output 1: alid number format Sample Input 2: -1)*-1)*++*)) Sample Output 2: In!alid number format java.util.Scanner; importjava.util.Scanner; import
UserMainCode { publicclass publicc lassUserMainCode validateNumber(String s1) staticintvalidateNumber(String staticint { "!#${%&${1&!#${%&${1&!#${'&")) )) if(s1.matches("!#${%&${1&!#${%&${1&!#${'&" if(s1.matches( { 1; return 1; return & else 1; return 1; return & main(String$ args) { main(String$ publicstaticvoid publicstaticvoi d TODO utogenerated method stub TODO utogenerated Scanner in*new in*newScanner(S+stem. Scanner(S+stem.in);
String n1*in.ne,t-ine(); (n1); int c*UserMainCode.validateNumber (n1); int c*UserMainCode. (c**1) if(c**1) if S+stem.out.rintln("/-0" .rintln("/-0"); ); else S+stem.out.rintln("0N/-0" .rintln("0N/-0"); );
& &
4.
Fetcin! Middle Caracters "rom Strin!
Write Write a program to read a string of e!en length and to fetch two middle most characters from the input string and return it as string output. Include a class UserMainCode with a static method !etMiddleCars which accepts a string of e!en length as input . The return tpe is a string which should be the middle characters of the string. #reate a class Main which would get the input as a string and call the static method !etMiddleCars present in the %ser&ain#ode. Input and Output Format: Input consists of a string of e!en length. utput is a string . (efer (efer sample output for formatting speci"cations. Sample Input 1: this Sample Output 1: hi Sample Input 1: 2ell Sample Output 1: el java.util.Scanner; importjava.util.Scanner; import
UserMainCode { publicclass publicc lassUserMainCode 22 2 @param args args 2 getMiddleChars(String s1) getMiddleChars(String staticvoid { 3*s1.length(); int 3*s1.length(); int mid*34; int mid*34; int String5u66ersb1* new String5u66er(); newString5u66er();
String n1*in.ne,t-ine(); (n1); int c*UserMainCode.validateNumber (n1); int c*UserMainCode. (c**1) if(c**1) if S+stem.out.rintln("/-0" .rintln("/-0"); ); else S+stem.out.rintln("0N/-0" .rintln("0N/-0"); );
& &
4.
Fetcin! Middle Caracters "rom Strin!
Write Write a program to read a string of e!en length and to fetch two middle most characters from the input string and return it as string output. Include a class UserMainCode with a static method !etMiddleCars which accepts a string of e!en length as input . The return tpe is a string which should be the middle characters of the string. #reate a class Main which would get the input as a string and call the static method !etMiddleCars present in the %ser&ain#ode. Input and Output Format: Input consists of a string of e!en length. utput is a string . (efer (efer sample output for formatting speci"cations. Sample Input 1: this Sample Output 1: hi Sample Input 1: 2ell Sample Output 1: el java.util.Scanner; importjava.util.Scanner; import
UserMainCode { publicclass publicc lassUserMainCode 22 2 @param args args 2 getMiddleChars(String s1) getMiddleChars(String staticvoid { 3*s1.length(); int 3*s1.length(); int mid*34; int mid*34; int String5u66ersb1* new String5u66er(); newString5u66er();
(374**!) if(374**!) if { sb1.aend(s1.chart(mid1)); sb1.aend(s1.chart(mid)); & S+stem.out.rintln(sb1); & main(String$ args) { main(String$ publicstaticvoi publicst aticvoid d TODO utogenerated method stub TODO utogenerated Scanner in*new in*newScanner(S+stem. Scanner(S+stem.in); String n1*in.ne,t-ine(); UserMainCode.getMiddleChars(n1); & &
#. Cec$ Caracters in a Strin! Write Write a program to read read a string and to test whether "rst and last last character are same. The string is said to be be !alid if the 1st and last character are the same. 3lse the string is said to be in!alid.
Include a class UserMainCode with a static method cec$Caracters which accepts a string as input . The return return tpe of this method is an int. utput should be 1 if the "rst character and last character are same . If the are di4erent di4erent then return -1 as output. #reate a class Main which would get the input as a string and call the static method cec$Caracterspresent in the %ser&ain#ode. Input and Output Format: Input consists of a string. utput is a string saing characters are same or not . (efer (efer sample output for formatting speci"cations. Sample Input 1: the picture was great Sample Output 1: alid Sample Input 1: this Sample Output 1: In!alid java.util.Scanner; importjava.util.Scanner; import
UserMainCode { publicclass publicc lassUserMainCode
22 2 @param args 2 chec3Characters(String s1) staticvoid { int 3*s1.length(); char c*s1.chart(!); char d*s1.chart(31); if(c**d) { S+stem.out.rintln("/-0"); & else S+stem.out.rintln("0N/-0"); & main(String$ args) { publicstaticvoid TODO utogenerated method stub Scanner in*newScanner(S+stem.in); String n1*in.ne,t-ine(); UserMainCode.checkCharacters(n1); & &
%. Formin! Ne& 'ord "rom a Strin! Write a program to read a string and a positi!e integer n as input and construct a string with "rst n and last n characters in the gi!en string.
Include a class UserMainCode with a static method "ormNe&'ord which accepts a string and positi!e integer . The return tpe of the output should be a string 5!alue6 of "rst n character and last n character. #reate a class Main which would get the input as a string and integer n and call the static method"ormNe&'ord present in the %ser&ain#ode. Input and Output Format: Input consists of a string of e!en length. utput is a string . 7ote8 The gi!en string length must be 9:)n. (efer sample output for formatting speci"cations. Sample Input 1: #alifornia * Sample Output 1: #alnia
Sample Input 2: this 1 Sample Output 2: Ts importjava.util.Scanner;
publicclassUserMainCode { 22 2 @param args 2 chec3Characters(String s18int a) staticvoid { int 3*s1.length(); String5u66er sb1* newString5u66er(); if((42a)9*3) { sb1.aend(s1.substring(!8a)); sb1.aend(s1.substring(3a)); & S+stem.out.rintln(sb1); & main(String$ args) { publicstaticvoid TODO utogenerated method stub Scanner in*newScanner(S+stem.in); String n1*in.ne,t-ine(); intnum*in.ne,t0nt(); UserMainCode.checkCharacters(n18num); & &
11. Strin! (ncr)ption ;i!en an input as string and write code to encrpt the gi!en string using following rules and return the encrpted string8
1. (eplace the characters at odd positions b ne
' replace it b 'a'. - ?ssume the "rst character in the string is at position 1. Include a class UserMainCode with a static method encr)pt which accepts a string. The return tpe of the output is the encrpted string.
#reate a Main class which gets string as an input and call the static method encr)pt present in theUserMainCode. Input and Output Format: Input is a string . utput is a string. Sample Input 1: curiosit Sample Output 1: dusips@t> Sample Input 2: >>>> Sample Output 2: ?>a> importjava.util.Scanner;
publicclassUserMainCode { chec3Characters(String s1) staticvoid { int 3*s1.length(); String5u66er sb1* newString5u66er(); for(inti*!;i93;i::) { chard*s1.chart(i); if((i:1)74*!) { if(d**<=<) { sb1.aend(<) { sb1.aend(<<); &
else { int c*(int)d; ::c; sb1.aend((char)c); & & else { sb1.aend(d);
&
& S+stem.out.rintln(sb1); & main(String$ args) { Publicstaticvoid TODO utogenerated method stub Scanner in*newScanner(S+stem.in); String n1*in.ne,t-ine(); UserMainCode.checkCharacters(n1); & &
12. *ass&ord Validation ;i!en a method with a password in string format as input. Write code to !alidate the password using following rules8
- &ust contain at least one digit - &ust contain at least one of the following special characters A, B, C B =ength should be between to )0 characters. Include a class UserMainCode with a static method validate*ass&ord which accepts a password string as input. If the password is as per the gi!en rules return 1 else return -1.If the return !alue is 1 then print !alid password else print as in!alid password. #reate a Main class which gets string as an input and call the static method validate*ass&ord present in the UserMainCode. Input and Output Format: Input is a string . utput is a string .
Sample Input 1: DEhoomD Sample Output 1: In!alid password Sample Input 2: BAEon Sample Output 2: alid password importjava.util.Scanner; publicclassUserMainCode {
chec3Characters(String s1) staticvoid { int 3*s1.length(); if((3?*@ AA 39*4!) AA s1.matches(".2!#${1&.2") AAs1.matches(".2BD${1&.2")) { S+stem.out.rintln("/-0"); & else S+stem.out.rintln("0N/-0"); & main(String$ args) { publicstaticvoid TODO utogenerated method stub Scanner in*new scanner(S+stem.in); String n1*in.ne,t-ine(); UserMainCode.checkCharacters(n1); & &
1+. ,emovin! vo&els "rom Strin! ;i!en a method with string input. Write code to remo!e !owels from e!en position in the string.
Include a class UserMainCode with a static method remove(venVo&els which accepts a string as input. The return tpe of the output is string after remo!ing all the !owels. #reate a Main class which gets string as an input and call the static method remove(venVo&els present in the UserMainCode. Input and Output Format: Input is a string . utput is a string . ?ssume the "rst character is at position 1 in the gi!en string. Sample Input 1: commitment Sample Output 1: cmmitmnt Sample Input 2: capacit Sample Output 2: #pct import @a!a.util.$cannerF
publicclass%ser&ain#ode G publicstatic $tring remo!e3!en3lements5$tring s16 G $tringHu4er sb1:ne&$tringHu4er56F "or5inti:0Fis1.length56FiJJ6 G car k:s1.char?t5i6F i" 55iJ16D)K:06 G sb1.append5k6F L else G i" 5kK:'a'MM kK:'e'MM kK:'i'MM kK:'o'MM kK:'u'MM kK:'?'MM kK:'3'MM kK:'I'MM kK:''MM kK :'%'6 G sb1.append5k6F L L L return sb1.to$tring56F L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
1-.Calculate (lectricit) ill
;i!en a method calculate3lectricitHill56 with three inputs. Write code to calculate the current bill. Include a class UserMainCode with a static method calculate(lectricit)ill which accepts * inputs .The return tpe of the output should be an integer . #reate a class Main which would get the inputs and call the static method calculate(lectricit)ill present in the %ser&ain#ode. Input and Output Format: Input consist of * integers. Pirst input is pre!ious reading, second input is current reading and last input is per unit charge. (eading Pormat - XXXXX????? where XXXXX is consumer number and ????? is meter reading. utput is a single integer corresponding to the current bill. (efer sample output for formatting speci"cations.
Sample Input 1: ?H#)01)*+ ?H#)01)0 + Sample Output 1: 12%/ Sample Input 2: ?H#E311111 ?H#E311))) * Sample Output 2: *** import @a!a.util.$cannerF publicclass%ser&ain#ode G staticintcalculate3lectricitHill5$tring str1,$tring str), int unit6 G int e1:Integer. parseInt 5str1.substring566F int e):Integer. parseInt 5str).substring566F int total:5e)-e16QunitF return totalF
L publicstaticvoid main5$tring argsNO6
G $tring s1,s)F int nF $canner in:ne&$canner5$stem.in6F s1:in.ne
10.Sum o" i!its in a Strin!
Write code to get the sum of all the digits present in the gi!en string. Include a class UserMainCode with a static method sumO"i!its which accepts string input. (eturn the sum as output. If there is no digit in the gi!en string return -1 as output.
#reate a class Main which would get the input and call the static method sumO"i!its present in the %ser&ain#ode. Input and Output Format: Input consists of a string. utput is a single integer which is the sum of digits in a gi!en string. (efer sample output for formatting speci"cations. Sample Input 1: good)*bad+ Sample Output 1: Sample Input 2: good Sample Output 2: -1 import @a!a.util.$cannerF publicclass%ser&aincode G staticintsumfEigits5$tring str6 G int k:str.length56F int sum:0,iF "or5i:0FikFiJJ6 G i" 5str.char?t5i69:'0'MMstr.char?t5i6:''6 G RQ$tringHu4er s: ne&$tringHu4er56F s.append5str.char?t5i66FQR sum:sumJInteger. parseInt 5str.char?t5i6JSS6F L L i" 5sum9:06 return sumF else return -1F
L publicstaticvoid main5$tring argsNO6
G $tring s1F $canner in:ne&$canner5$stem.in6F s1:in.ne
2/.Strin! Concatenation Write Write code to get two strings as input and If strings are of same length simpl append them together and return the "nal string. If gi!en strings are of di4erent length, remo!e starting characters from from the longer string so that both strings are of same length then append them together and return the "nal string.
Include a class UserMainCode with a static method concatstrin! which accepts two string input. The return return tpe of the output is a string which is the concatenated concatenated string. #reate a class Main which would get the input and call the static method concatstrin! present in the %ser&ain#ode. Input and Output Format: Input consists of two strings. utput is a string. (efer (efer sample output for formatting speci"cations. Sample Input 1: 2ello hi Sample Output 1: lohi
Sample Input 2: 2ello Eelhi Sample Output 2: 2elloEelhi java.util.Scanner; importjava.util.Scanner; import
public class UserMainCode { 22 2 @param args args 2 String concatstring(String s18String s4) static String static { 3*s1.length(); int3*s1.length(); int a*s4.length(); int a*s4.length(); int String s%*"!" s%*"!"; ; if(3**a) if(3**a) {
s%*s1.concat(s4); & (3?a) if(3?a) if { s%*(s1.substring(3a).concat(s4)); & (39a) if(39a) if { s%*((s1.concat(s4.substring(a3)))); & s%; return s%; return & main(String$ args) { main(String$ public static static void void TODO utogenerated method stub TODO utogenerated Scanner in*new in*new Scanner(S+stem.in); String n1*in.ne,t-ine(); String n4*in.ne,t-ine(); String n%*UserMainCode.concatstring (n18n4); (n18n4); S+stem.out.rintln(n%); & &
21. Color Code
Write Write a program to read a string and !alidate whether the gi!en string is a !alid color code based on the following rules8 - &ust start with B smbol - &ust contain si< characters after B - It ma contain alphabets from ?-P or digits from 0- Include a class UserMainCode with a static method validateColorCode which accepts a string. The return tpe 5integer6 should return return 1 if the color is as per the rules else return -1. #reate a #lass &ain which would be used to accept a $tring and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string. utput consists of a string 5alid 5alid or In!alid6. (efer (efer sample output for formatting speci"cations. Sample Input 1: BPP)) Sample Output 1: alid Sample Input 2: BPP5))
Sample Output 2: In!alid import @a!a.util.$cannerF publicclass%ser&ain#ode G !alidate#olor#ode5$tring tring s16 publicstaticint!alidate#olor#ode5$ G
5s1.matches5NBOG1LN?-PU0-OGL66 66 i" 5s1.matches5NBOG1LN?-PU0-OGL return 1F else return -1F L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
22.ree i!its Write Write a program to read a string and check if the gi!en string is in the format #T$-XXX where XXX is a three digit number. Include a class UserMainCode with a static method validatestrin!s which accepts a string. The return tpe 5integer6 should return 1 if the string format is correct else return -1. #reate a #lass &ain which would be used to accept a $tring and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string. utput consists of a string 5alid 5alid or In!alid6. (efer (efer sample output for formatting speci"cations. Sample Input 1: #T$-)1 Sample Output 1: alid Sample Input 2: #T$-)= Sample Output 2: In!alid import @a!a.util.$cannerF publicclass%ser&ain#ode G !alidatestrings5$tring g s16 publicstaticint!alidatestrings5$trin G
i" 5s1.matches55#T$6N-OG1LN0-OG*L66 return 1F else return -1F L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
23.Validatin! Input *ass&ord 10).Write a code get a password as string input and !alidate using the rules speci"ed below. ?ppl following !alidations8
1. &inimum length should be / characters ). &ust contain an one of these three special characters A or V or B *. &a contain numbers or alphabets. +. $hould not start with special character or number . $hould not end with special character Include a class UserMainCode with a static method validate*ass&ord which accepts password string as input and returns an integer. The method returns 1 if the password is !alid. 3lse it returns -1. #reate a class Main which would get the input and call the static method validate*ass&ord present in the %ser&ain#ode. Input and Output Format: Input consists of a string. utput is a string alid or In!alid. (efer sample output for formatting speci"cations. Sample Input 1: ashokV)* Sample Output 1: alid Sample Input 2: 1/0V)00 Sample Output 2:
In!alid import @a!a.util.$cannerF publicclass%ser&ain#ode G publicstaticint!alidateassword5$tring s16 G int k:s1.length56F i" 5k9:/ MM s1.matches5.QNAVBOG1L.Q6 MM s1.matches5NAVB0-O.Q6 MM s1.matches5.QNAVBOC66 G return 1F
L else return -1F
L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
2-.i Validation Write a program to get two string inputs and !alidate the IE as per the speci"ed format.
Include a class UserMainCode with a static method validateIocations which accepts two strings as input. The return tpe of the output is a string alid Id or In!alid Id. #reate a class Main which would get the input and call the static method validateIocations present in the %ser&ain#ode. Input and Output Format: Input consists of two strings. Pirst string is IE and second string is location. IE is in the format #T$-===XXXX where === is the "rst three letters of gi!en location and XXXX is a four digit number.
utput is a string alid id or In!alid id. (efer sample output for formatting speci"cations. Sample Input 1: #T$-hd-1)*+ hderabad Sample Output 1: alid id Sample Input 2: #T$-hd-1)* hderabad Sample Output 2: In!alid id import @a!a.util.$cannerF publicclass%ser&ain#ode G publicstatic $tring !alidateIE=ocations5$tring s1,$tring s)6 G
i" 5s1.matches55#T$6N-OG1LNa->?-YOG*LN-OG1LN0-OG+L66 G i" 5s1.char?t5+6::s).char?t506 MM s1.char?t56::s).char?t516 MM s1.char?t56::s).char?t5)66 return!alidF L returnin!alidF
L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
20.,emove (lements Write a program to remo!e all the elements of the gi!en length and return the si>e of the "nal arra as output. If there is no element of the gi!en length, return the si>e of the same arra as output.
Include a class UserMainCode with a static method remove(lements which accepts a string arra, the number of elements in the arra and an integer. The return tpe 5integer6 should return the si>e of the "nal arra as output. #reate a #lass &ain which would be used to accept Input $tring arra and a number and call the static method present in %ser&ain#ode. ?ssume ma
L return aF
L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F int l:Integer. parseInt 5in.ne
L L
+2.I* Validator Write a program to read a string and !alidate the I address. rint ZalidS if the I address is !alid, else print ZIn!alidS.
Include a class UserMainCode with a static method ipValidator which accepts a string. The return tpe 5integer6 should return 1 if it is a !alid I address else return ). #reate a #lass &ain which would be used to accept Input $tring and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string that corresponds to an I. utput consists of a string5ZalidS or ZIn!alidS6. (efer sample output for formatting speci"cations. Note8 ?n I address has the format a.b.c.d where a,b,c,d are numbers between 0-). Sample Input 1: 1*).1+.1/+.)10 Sample Output 1: alid Sample Input 2: 1*).1+.1/+.)0 Sample Output 2: In!alid importjava.util.Scanner; importjava.util.StringEo3eni=er; publicclassUserMainCode { publicstaticStringi/alidator(String s1) { StringEo3eni=erst*newStringEo3eni=er(s18"."); inti*!; while(st.hasMoreEo3ens()) { int 3*0nteger. parseInt(st.ne,tEo3en()); if(3?*! AA 39*4FF) ::i; & if(i**') return"/-0"; return"0nvalid"; & main(String$ args) { publicstaticvoid Scanner in*newScanner(S+stem.in);
String s1*in.ne,t-ine(); S+stem.out.rintln(UserMainCode.ipValidator (s1)); in.close(); & &
+4.File (5tension Write a program to read a "le name as a string and "nd out the "le e
Include a class UserMainCode with a static method 6leIdenti6er which accepts a string. The return tpe 5string6 should return the e
+#.Find common caracters and uni7ue caracters in strin! ;i!en a method with two strings as input. Write code to count the common and uni[ue letters in the two strings.
7ote8 - $pace should not be counted as a letter.
- #onsider letters to be case sensiti!e. ie, a is not e[ual to ?. Include a class UserMainCode with a static method commonCars which accepts two strings as input. The return tpe of the output is the count of all common and uni[ue characters in the two strings. #reate a class Main which would get the inputs and call the static method commonCars present in the %ser&ain#ode. Input and Output Format: Input consists of two strings. utput is an integer. (efer sample output for formatting speci"cations. Sample Input 1: a black cow battle ship Sample Output 1: )
N(5planation 8 b, l and a are the common letters between the ) input strings. Hut 'a' appears more than once in the 1st string. $o 'a' should not be considered while computing the count !alue.O Sample Input 2: australia sri lanka Sample Output 2: + import @a!a.util.$cannerF publicclass%ser&ain#ode G staticintuni[ue#ounter5$tring s1,$tring s)6 G inti,l:0,@F $tring temp,temp1F s1:s1.replace?ll5\\s,6F s):s).replace?ll5\\s,6F "or5i:0Fis1.length56FiJJ6 G i" 5iK:06 temp:s1.substring50,i6.concat5s1.substring5iJ166F else temp:s1.substring5iJ16F $tring c:s1.char?t5i6JF
i" 55Ktemp.contains5c66 MM s).contains5c66 G int k:s).inde<f5c6F i" 5kK:06 temp1:s1.substring50,k6.concat5s1.substring5kJ166F else temp1:s1.substring5kJ16F $tring d:s1.char?t5k6JF i" 5Ktemp.contains5c66 G JJlF L L
L
return lF
L publicstaticvoid main5$tring argsNO6 G $canner in:ne&$canner5$stem.in6F $tring str:in.ne
+%.Initial Format Write a program to input a person's name in the format Pirst7ame =ast7ame and return the person name in the following format - =ast7ame, InitialfPirst7ame.
Include a class UserMainCode with a static method nameFormatter which accepts a string. The return tpe 5string6 should return the eerF publicclass%ser&ain#ode G
publicstatic $tring namePormatter5$tring s16 G $tringHu4ersb:ne&$tringHu4er56F $tringTokeni>erst:ne&$tringTokeni>er5s16F $tring s):st.ne
L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
+3.Caracter cleanin! Write a program to input a $tring and a character, and remo!e that character from the gi!en $tring. rint the "nal string. Include a class UserMainCode with a static method removeCaracter which accepts a string and a character. The return tpe 5string6 should return the character cleaned string. #reate a #lass &ain which would be used to accept Input $tring and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string and a character. utput consists of a string5the character cleaned string6. (efer sample output for formatting speci"cations. Sample Input : elephant e Sample Output: =phant importjava.util.Scanner;
publicclassUserMainCode { 22 2 @param args 2 staticStringremoveCharacter(String s18char s4) {
int 3*s1.length(); String5u66er sb1* newString5u66er(); for(inti*!;i93;i::) { char c*s1.chart(i); if(c*s4) sb1.aend(c); & return sb1.toString(); & main(String$ args) { publicstaticvoid TODO utogenerated method stub Scanner in*newScanner(S+stem.in); String n1*in.ne,t-ine(); char n4*in.ne,t().chart(!); String n%*UserMainCode.removeCharacter (n18n4); S+stem.out.rintln(n%); & &
+-.Vo&el Cec$ Write a program to read a $tring and check if that $tring contains all the !owels. rint ZesS if the string contains all !owels else print ZnoS. Include a class UserMainCode with a static method !etVo&els which accepts a string. The return tpe 5integer6 should return 1 if the $tring contains all !owels else return -1. #reate a #lass &ain which would be used to accept Input $tring and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string. utput consists of a string5ZesS or ZnoS6. (efer sample output for formatting speci"cations. Sample Input 1: abceiduosp Sample Output 1: es Sample Input 2: bceiduosp Sample Output 2: 7o import @a!a.util.$cannerF publicclass%ser&ain#ode G publicstatic$tringgetowels5$tring s16 G $tring s:SesSF i" 5s1.contains5ZaS6 MM s1.contains5ZeS6 MMs1.contains5ZiS6 MMs1.contains5ZoS6 MM s1.contains5ZuS66 s:esF
else
s:SnoSF return sF
L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
+0.S&ap Caracters Write a program to input a $tring and swap the e!er ) characters in the string. If si>e is an odd number then keep the last letter as it is. rint the "nal swapped string. Include a class UserMainCode with a static method s&apCaracter which accepts a string. The return tpe 5$tring6 should return the character swapped string. #reate a #lass &ain which would be used to accept Input $tring and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string. utput consists of a string. (efer sample output for formatting speci"cations. Sample Input 1: T(?I73( Sample Output 1: (TI?37( Sample Input 2: T& ?7E]3((^ Sample output 2: T &7?]E(3^( import @a!a.util.$cannerF publicclass%ser&ain#ode G publicstatic $tring swap#haracter5$tring s16 G $tringHu4ersb:ne&$tringHu4er56F "or5inti:0Fis1.length56Fi:iJ)6 G carc,dF i" 5iK:s1.length56-16 G c:s1.char?t5i6F d:s1.char?t5iJ16F sb.append5d6F sb.append5c6F L else
G c:s1.char?t5i6F sb.append5c6F L L returnsb.to$tring56F L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
42.Count Se7uential Caracters 10.;et a string as input and write code to count the number of characters which gets repeated * times consecuti!el and return that count 5ignore case6. If no character gets repeated * times consecuti!el return -1.
Include a class UserMainCode with a static method countSe7uentialCars which accepts a string as input. The return tpe of the output is the repeat count. #reate a class Main which would get the input and call the static method countSe7uentialCars present in the %ser&ain#ode. Input and Output Format: Input consists a string. utput is an integer. (efer sample output for formatting speci"cations. Sample Input 1: abcXXXabc Sample Output 1: 1 Sample Input 2: aaa<<>???< Sample Output 2: ) importjava.util.Scanner; publicclassUserMainCode { staticintcountSeGuentialChars(String str1)
{ int c*!; for(inti*!;i9str1.length()1;i::) { if(str1.chart(i)**str1.chart(i:1)) { if(str1.chart(i:1)**str1.chart(i:4)) { ::c; i*i:4; & & & return c; & main(String args$) publicstaticvoid { String s1; Scanner in*newScanner(S+stem.in); s1*in.ne,t-ine(); intans*UserMainCode.countSequentialChars(s1); S+stem.out.rintln(ans); & &
4+.en!t o" te ar!est Cun$ Write a program to read a string and "nd the length of the largest chunk in the string. If there are no chunk print Z7o chunksS else print the length. 7T38 chunk is the letter which is repeating ) or more than ) times. Include a class UserMainCode with a static method lar!estCun$ which accepts a string. The return tpe 5Integer6 should return the length of the largest chunk if the chunk is present, else return -1. #reate a #lass &ain which would be used to accept Input $tring and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string. (efer sample output for formatting speci"cations. Sample Input 1: ^ou are toooo good Sample Output 1: + 8ecause te lar!est cun$ is letter 9o9 &ic is repeatin! 4 times Sample Input 2: who are u Sample Output 2: 7o chunks importjava.util.Scanner; importjava.util.StringEo3eni=er;
publicclassUserMainCode { staticintlargestChun3(String str1) { intc8ma,*!8i*!8j*!; StringEo3eni=erst*newStringEo3eni=er(str1); while(st.hasMoreEo3ens()) { String s1*st.ne,tEo3en(); for(i*!;i9s1.length()1;i::) { c*1; if(s1.chart(i)**s1.chart(i:1)) { ::c; for(j*i:4;j9s1.length();j::) { if(s1.chart(i)**s1.chart(j)) { ::c; & else break; & & if(c?ma,) { ma,*c; i*j1; & & & return (ma,); & main(String args$) publicstaticvoid { String s1; Scanner in*newScanner(S+stem.in); s1*in.ne,t-ine(); intans*UserMainCode.largestChunk(s1); if(ans?*4) S+stem.out.rintln(ans); else S+stem.out.rintln("No Chun3s"); &
44 .Uni7ue Caracters in a strin! Write a program that takes a string and returns the number of uni[ue characters in the string. If the gi!en string doest not contain an uni[ue characters return -1
Include a class UserMainCode with a static method uni7ueCounter which accepts a string as input.
The return tpe of the output is the count of all uni[ue characters in the strings. #reate a class Main which would get the input and call the static method uni7ueCounter present in the %ser&ain#ode. Input and Output Format: Input consists a string. utput is an integer. (efer sample output for formatting speci"cations. Sample Input 1: 2elloWorld Sample Output 1: Sample Input 2: coco Sample Output 2: -1 import @a!a.util.$cannerF publicclass%ser&ain#ode G staticintuni[ue#ounter5$tring s6 G inti,l:0F $tring tempF "or5i:0Fis.length56FiJJ6 G i" 5iK:06 temp:s.substring50,i6.concat5s.substring5iJ166F else temp:s.substring5iJ16F $tring c:s.char?t5i6JF i" 5Ktemp.contains5c66 G JJlF L L return lF L publicstaticvoid main5$tring argsNO6 G $canner in:ne&$canner5$stem.in6F $tring str:in.ne
L
4#.Name Srin$in! Write a program that accepts a string as input and con!erts the "rst two names into dot-separated initials and printa the output.
Input string format is 'fn mn ln'. utput string format is 'ln Nmn's 1st characterO.Nfn's 1st characterO' Include a class UserMainCode with a static method !etFormatedStrin! which accepts a string. The return tpe 5$tring6 should return the shrinked name. #reate a #lass &ain which would be used to accept Input $tring and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string. utput consists of a $tring. (efer sample output for formatting speci"cations. Sample Input: $achin (amesh Tendulkar Sample Output: Tendulkar (.$ import @a!a.util.$cannerF import @a!a.util.$tringTokeni>erF publicclass%ser&ain#ode G publicstatic $tring getPormated$tring5$tring s16 G $tringHu4ersb:ne&$tringHu4er56F $tringTokeni>erst:ne&$tringTokeni>er5s16F $tring s):st.ne
L L
4%.Odd i!it Sum Write a program to input a $tring arra. The input ma contain digits and alphabets 5Zdeg+;(S6. 3
Por ee of the arra. The return tpe 5Integer6 should return the sum. #reate a #lass &ain which would be used to accept Input $trings and call the static method present in %ser&ain#ode. ?ssume maant1 al**k d)t+2*r Sample Output : 1 81;+;+;+;# import @a!a.util.$cannerF publicclass%ser&ain#ode G publicstaticintoddEigit$um5$tring s1NO, int k6 G intsum:0F "or5inti:0FikFiJJ6 G "or5int @:0F@s1NiO.length56F@JJ6 G car c:s1NiO.char?t5@6F i" 5c9:'0'MM c:''6 G int <:Integer. parseInt 5cJ6F i" 5
L L returnsumF
L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F int l:Integer. parseInt 5in.ne
"or5inti:0FilFiJJ6 s1NiO:in.ne
L L
40.Color Code Validation ;i!e a $tring as colour code as input and write code to !alidate whether the gi!en string is a !alid color code or not.
alidation (ule8 $tring should start with the #haracter 'B'. =ength of $tring is . It should contain #haracters after 'B' $mbol. It should contain #haracters between '?-P' and Eigits '0-'. If $tring acceptable the return true otherwise false. Include a class UserMainCode with a static method validateColourCode which accepts a string as input. The return tpe of the output is a boolean which returns true if its is a !alid color code else it returns false. #reate a class Main which would get the input and call the static method validateColourCode present in the %ser&ain#ode. Input and Output Format: Input consists a string corresponding to the color code. utput is a boolean which returns true or false (efer sample output for formatting speci"cations. Sample Input 1: BPP** Sample Output 1: true Sample Input 2: B####B Sample Output 2: false import @a!a.util.$cannerF publicclass%ser&ain#ode G publicstatic $tring !alidate#olor#ode5$tring s16 G
i" 5s1.matches5NBOG1LN?-PU0-OGL66 returntrueF else returnfalseF L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
in.close56F L L
#/.,epeatin! set o" caracters in a strin! ;et a string and a positi!e integer n as input .The last n characters should repeat the number of times gi!en as second input.Write code to repeat the set of character from the gi!en string.
Include a class UserMainCode with a static method !etStrin! which accepts a string and an integer n as input. The return tpe of the output is a string with repeated n characters. #reate a class Main which would get the input and call the static method !etStrin! present in the %ser&ain#ode. Input and Output Format: Input consists a string and a positi!e integer n. utput is a string with repeated characters. (efer sample output for formatting speci"cations. Sample Input 1: #ogni>ant * Sample Output 1: #ogni>antantantant Sample Input 2: macadem ) Sample Output 2: &academmm import @a!a.util.$cannerF publicclass%ser&ain#ode G
publicstatic$tringget$tring 5$tring s1, int k6 G int <:s1.length56F $tringHu4ersb:ne&$tringHu4er5s16F $tring s):s1.substring5<-k6F "or5inti:1Fi:kFiJJ6 sb.append5s)6F returnsb.to$tring56F L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
in.close56F L L
#4.Flus Caracters Write a program to read a string from the user and remo!e all the alphabets and spaces from the $tring, and onl) store special caracters and di!it in the output $tring. rint the output string.
Include a class UserMainCode with a static method !etSpecialCar which accepts a string. The return tpe 5$tring6 should return the character remo!ed string. #reate a #lass &ain which would be used to accept a string and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a strings. utput consists of an $tring 5character remo!ed string6. (efer sample output for formatting speci"cations. Sample Input : cogni>CB+?nt Sample Output : CB+ import @a!a.util.$cannerF publicclass%ser&ain#ode G publicstatic $tring get$tring 5$tring s16 G int <:s1.length56F $tringHu4ersb:ne&$tringHu4er56F "or5inti:0Fi
returnsb.to$tring56F
L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
in.close56F L L
##.Strin! ,epetition
Write a program to read a string and an integer and return a string based on the below rules. If input) is e[ual or greater than * then repeat the "rst three character of the $tring b gi!en input) times, separated b a space. If input) is ) then repeat the "rst two character of $tring two times separated b a space, If input) is 1 then return the "rst character of the $tring. Include a class %ser&ain#ode with a static method repeatStrin! which takes a string M integer and returns a string based on the abo!e rules. #reate a #lass &ain which would be used to accept Input string and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string and integer. utput consists of a string. (efer sample output for formatting speci"cations. Sample Input 1: #;7IY?7T + Sample Output 1: #; #; #; #;
Sample Input 2: #;7IY?7T ) Sample Output 2: # # import @a!a.util.$cannerF publicclass%ser&ain#ode G publicstatic$tringrepeat$tring5$tring s1,int n6 G $tringHu4ersb:ne&$tringHu4er56F "or5inti:0FinFiJJ6
G i" 5n9:*6 sb.append5s1.substring50,*66.append5 6F elsei" 5n::)6 sb.append5s1.substring50,)66.append5 6F elsei" 5n::16 sb.append5s1.substring50,166F L returnsb.to$tring56F L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
in.close56F L L
#0.Simple Strin! Manipulation
Write a program to read a string and return a modi"ed string based on the following rules. (eturn the $tring without the "rst ) chars ee of 100 characters. utput consists of a string. (efer sample output for formatting speci"cations. Sample Input 1: hello Sample Output 1: llo Sample Input 2: @a!a Sample Output 2: ]!a import @a!a.util.$cannerF publicclass%ser&ain#ode G
publicstatic $tring get$tring5$tring s16 G car c:s1.char?t506F card:s1.char?t516F $tring s:s1.substring5)6F $tringHu4ersb:ne&$tringHu4er56F i" 5cK:'@'MMdK:'b'6 sb.append5s6F elsei" 5cK:'@'MMd::'b'6 sb.append5d6.append5s6F elsei" 5c::'@'MMdK:'b'6 sb.append5c6.append5s6F else sb.append5s16F returnsb.to$tring56F L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
in.close56F L L
%2.Count Vo&els
;i!en a string input, write a program to "nd the total number of !owels in the gi!en string. Include a class UserMainCode with a static method ZcountVo&elsS that accepts a $tring argument and returns an int that corresponds to the total number of !owels in the gi!en string. #reate a class Main which would get the $tring as input and call the static method countVo&els present in the %ser&ain#ode. Input and Output Format: Input consists of a string. utput consists of an integer.. Sample Input: a!inash Sample Output: * import @a!a.util.$cannerF publicclass%ser&ain#ode G
publicstaticintcountowels5$tring s16 G $tring s:s1.to=ower#ase56F int c:0F "or5inti:0Fis.length56FiJJ6 G car k:s.char?t5i6F i" 5k::'a' UU k::'e' UU k::'i' UU k::'o' UU k::'u'6 JJcF L return cF L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
in.close56F L L
%4.,everse SubStrin!
;i!en a string, startInde< and length, write a program to e
publicclass%ser&ain#ode G publicstatic $tring re!erse$ubstring5$tring s1, int n1,int n)6 G $tringHu4ersb:ne&$tringHu4er5s16F $tring s:sb.re!erse56.to$tring56F returns.substring5n1,n1Jn)6F
L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
in.close56F L L
%#.Strin! Finder
;i!en three strings sa $earchstring, $tr1 and $tr) as input, write a program to "nd out if $tr) comes after $tr1 in the $earchstring. Include a class UserMainCode with a static method Zstrin!FinderS that accepts * $tring arguments and returns an integer. The * arguments correspond to $earch$tring, $tr1 and $tr). The function returns 1 if $tr) appears after $tr1 in the $earchtring. 3lse it returns ). #reate a class Main which would get * $trings as input and call the static method strin!Finder present in the %ser&ain#ode. Input and Output Format: Input consists of * strings. The "rst input corresponds to the $earch$tring. The second input corresponds to $tr1. The third input corresponds to $tr). utput consists of a string that is either ZesS or ZnoS
Sample Input 1: genious(a@_umarEe! (a@ Ee!
Sample Output 1: es Sample Input 2: genious(a@_umarEe! Ee! (a@ Sample Output 2: 7o importjava.util.Scanner; publicclassUserMainCode { publicstaticintstringHinder(String s18String s48String s%) { int l*!; if(s1.contains(s4)AA s1.contains(s%)) { if(s1.inde,I6(s4)9s1.lastinde,I6(s%)) { l*1; & else l*4; return l; & main(String$ args) { publicstaticvoid Scanner in*newScanner(S+stem.in); String s1*in.ne,t-ine(); String s4*in.ne,t-ine(); String s%*in.ne,t-ine(); intans*UserMainCode.stringFinder (s18s48s%); if(ans**1) S+stem.out.rintln("+es"); else S+stem.out.rintln("no"); in.close(); & &
%%.*one Number Validator
;i!en a phone number as a string input, write a program to !erif whether the phone number is !alid using the following business rules8 -It should contain onl numbers or dashes 5-6 - dashes ma appear at an position -$hould ha!e e
Include a class UserMainCode with a static method Zvalidate*oneNumberS that accepts a $tring input and returns a integer. The method returns 1 if the phone number is !alid. 3lse it returns ). #reate a class Main which would get a $tring as input and call the static method validate*oneNumber present in the %ser&ain#ode. Input and Output Format: Input consists of a string. utput consists of a string that is either 'alid' or 'In!alid' Sample Input 1: )-)- Sample Output 1: alid Sample Input 2: )-- Sample Output 1: In!alid importjava.util.Scanner; publicclassUserMainCode { publicstaticintvalidateJhoneNumber(String s1) { int l*!; for(inti*!;i9s1.length();i::) { char c*s1.chart(i); if(Character.isDigit(c)) { ::l; & elseif(c*<<) break; & if(l**1!AA i**s1.length()) return 1; else return !; & main(String$ args) { publicstaticvoid Scanner in*newScanner(S+stem.in); String s1*in.ne,t-ine(); intans*UserMainCode.validatePhoneNumber (s1); if(ans**1) S+stem.out.rintln("valid"); else
S+stem.out.rintln("invalid"); in.close(); & &
%-.Ne!ative Strin!
;i!en a string input, write a program to replace e!er appearance of the word is b is not. If the word is is immediatel preceeded or followed b a letter no change should be made to the string . Include a class UserMainCode with a static method Zne!ativeStrin!S that accepts a $tring arguement and returns a $tring. #reate a class Main which would get a $tring as input and call the static method ne!ativeStrin! present in the %ser&ain#ode. Input and Output Format: Input consists of a $tring. utput consists of a $tring. Sample Input 1: This is @ust a misconception Sample Output 1: This is not @ust a misconception Sample Input 2: Toda is mist Sample Output 2: Toda is not mist importjava.util.Scanner; importjava.util.StringEo3eni=er; publicclassUserMainCode { publicstatic String negativeString(String s1) { String5u66ersb*newString5u66er(); StringEo3eni=erst*newStringEo3eni=er(s18" "); while(st.hasMoreEo3ens()) { String s4*st.ne,tEo3en(); if(s4.eGuals("is")) { String s%*s4.relace("is"8 "is not"); sb.aend(s%).aend(" ");
& else { sb.aend(s4).aend(" "); & & returnsb.toString(); & main(String$ args) { publicstaticvoid Scanner in*newScanner(S+stem.in); String s1*in.ne,t-ine(); S+stem.out.rintln(UserMainCode.negativeString (s1)); in.close(); & &
%0.Validate Number
;i!en a negati!e number as string input, write a program to !alidate the number and to print the corresponding positi!e number. Include a class UserMainCode with a static method ZvalidateNumber S that accepts a string argument and returns a string. If the argument string contains a !alid negati!e number, the method returns the corresponding positi!e number as a string. 3lse the method returns -1. #reate a class Main which would get a $tring as input and call the static method validateNumber present in the %ser&ain#ode. Input and Output Format: Input consists of a $tring. utput consists of a $tring. Sample Input 1: -+)* Sample Output 1: +)* Sample Input 2: -t Sample Output 2: -1 import java.util.Scanner; publicclass UserMainCode { publicstatic String validateNumber(String s1) {
if(s1.matches("K!#$2" )) return s1.substring(1); return"invalid";
& main(String$ args) { publicstaticvoid Scanner in*new Scanner(S+stem.in); String s1*in.ne,t-ine(); S+stem.out.rintln(UserMainCode.validateNumber (s1)); in.close(); & &
31.Strin! *rocessin! < III
Write a program to read a string where all the lowercase '<' chars ha!e been mo!ed to the end of the string. Include a class %ser&ain#ode with a static method move= which accepts the string. The return tpe is the modi"ed string. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string. utput consists of a string. (efer sample output for formatting speci"cations. Sample Input 1: <
$tringHu4er sb1:ne& $tringHu4er56F "or5int i:0Fis1.length56FiJJ6 G i" 5s1.char?t5i6::'<'6 sb.append5s1.char?t5i66F else sb1.append5s1.char?t5i66F L return sb1.append5sb6.to$tring56F L publicstaticvoid main5$tring argsNO6 G $canner in:ne& $canner5$stem.in6F $tring str:in.ne
32.Strin! *rocessin! < IV
Write a program to read a string and also a number 7. Porm a new string starting with 1st character and with e!er 7th character of the gi!en string. 3< - if 7 is *, use chars 1, *, , ... and so on to form the new $tring. ?ssume 79:1. Include a class %ser&ain#ode with a static method !etStrin!Usin!NtCaracter which accepts the string and the number n. The return tpe is the string as per the problem statement. #reate a #lass &ain which would be used to accept the string and integer and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string and integer. utput consists of a string. (efer sample output for formatting speci"cations. Sample Input 1: 2elloWorld ) Sample Output 1: 2elWrd import @a!a.util.$cannerF publicclass %ser&ain#ode G static $tring mo!eX5$tring s1, int a6 G
$tringHu4er sb:ne& $tringHu4er56F sb.append5s1.char?t5066F "or5int i:a-1Fis1.length56Fi:iJa6 G sb.append5s1.char?t5i66F L return sb.to$tring56F L publicstaticvoid main5$tring argsNO6 G $canner in:ne& $canner5$stem.in6F $tring str:in.ne
3#.Strin! *rocessin! < Mi5Mania
Write a program to read a string and check if it starts with 'Vi<' where 'V' is an one char5a->, ?-Y, 0-6. If speci"ed pattern is found return true else false. Include a class %ser&ain#ode with a static method cec$*attern which accepts the string. The return tpe is T(%3 R P?=$3. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string. utput consists of T(%3 R P?=$3. (efer sample output for formatting speci"cations. Sample Input 1: &i< &ania Sample Output 1: T(%3 import @a!a.util.$cannerF publicclass %ser&ain#ode G static$tring checkattern5$tring s16 G i" 5s1.matches5Na->?-Y0-OG1L5i<6.Q66 returntrueF
returnfalseF L publicstaticvoid main5$tring argsNO6 G $canner in:ne& $canner5$stem.in6F $tring str:in.ne
L
3%.Strin! *rocessin!
Write a program to read a string and return a new string where the "rst and last chars ha!e been interchanged. Include a class %ser&ain#ode with a static method e5can!eCaracters which accepts the string. The return tpe is the modi"ed string. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string. utput consists of string. (efer sample output for formatting speci"cations. Sample Input 1: 2elloWorld Sample Output 1: delloWorl2 import @a!a.util.$cannerF publicclass %ser&ain#ode G static $tring checkattern5$tring s16 G $tringHu4er sb:ne& $tringHu4er56F int <:s1.length56F sb.append5s1.char?t5<-166F sb.append5s1.substring51,<-166.append5s1.char?t5066F return sb.to$tring56F L publicstaticvoid main5$tring argsNO6 G $canner in:ne& $canner5$stem.in6F
$tring str:in.ne
33.,e!ular (5pression < II
;i!en a string 5s6 appl the following rules. 1. $tring consists of three characters onl. ). The characters should be alphabets onl. If all the conditions are satisifed then print T(%3 else print P?=$3. Include a class %ser&ain#ode with a static method validateStrin! which accepts the string. The return tpe is the boolean formed based on rules. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string. utput consists of T(%3 or P?=$3 . (efer sample output for formatting speci"cations. Sample Input 1: ?cH Sample Output 1: T(%3 Sample Input 2: ?)H Sample Output 2: P?=$3 import @a!a.util.$cannerF publicclass %ser&ain#ode G static $tring !alidate$tring5$tring s16 G i" 5s1.matches5Na->?-YOG*L66 returntrueF else
returnfalseF L publicstaticvoid main5$tring argsNO6 G $canner in:ne& $canner5$stem.in6F $tring str:in.ne
L
3-.Strin!s *rocessin! < ,eplication
Write a program to read a string and also a number 7. (eturn the replica of original string for n gi!en time. Include a class %ser&ain#ode with a static method repeatStrin! which accepts the the string and the number n. The return tpe is the string based on the problem statement. #reate a #lass &ain which would be used to accept the string and integer and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string and integer. utput consists of a string. (efer sample output for formatting speci"cations. Sample Input 1: =il ) Sample Output 1: =il=il import @a!a.util.$cannerF publicclass %ser&ain#ode G static$tring !alidate$tring5$tring s1, int a6 G $tringHu4er sb:ne& $tringHu4er56F "or5int i:0FiaFiJJ6 G sb.append5s16F L return sb.to$tring56F L
publicstaticvoid main5$tring argsNO6 G $canner in:ne& $canner5$stem.in6F $tring str:in.ne
L
-/.Strin! *rocessin! < V
Write a program to read a string arra, concatenate the arra elements one b one separated b comma and return the "nal string as output. Include a class %ser&ain#ode with a static method concatStrin! which accepts the string arra. The return tpe is the string. #reate a #lass &ain which would be used to accept the string arra and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of an integer n which is the number of elements followed b n string !alues. utput consists of the string. (efer sample output for formatting speci"cations. Sample Input 1: * ??? HHH ### Sample Output 1: ???,HHH,### import @a!a.util.$cannerF publicclass %ser&ain#ode G static $tring !alidate$tring5$tring s1NO, int a6 G $tringHu4er sb:ne& $tringHu4er56F "or5int i:0FiaFiJJ6 G sb.append5s1NiO6.append5,6F
L sb.delete#har?t5sb.length56-16F return sb.to$tring56F L publicstaticvoid main5$tring argsNO6 G $canner in:ne& $canner5$stem.in6F
int n:Integer. parseInt 5in.ne
L L
-2.Mat Calculator
Write a program that accepts three inputs, "rst two inputs are operands in int form and third one being one of the following "!e operators8 J, -, Q, R, D. Implement calculator logic and return the result of the gi!en inputs as per the operator pro!ided. In case of di!ision, ?ssume the result would be integer. Include a class %ser&ain#ode with a static method calculator which accepts two integers, one operand and returns the integer. #reate a #lass &ain which would be used to accept three integers and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of two integers and a character. utput consists of a integer. (efer sample output for formatting speci"cations. Sample Input 1: )* ) Q Sample Output 1: + import @a!a.util.$cannerF publicclass %ser&ain#ode G staticintcalculator5int a,int b,car c6 G int ans:0F s&itc5c6 G case'J'8 ans:aJbF brea$ F case'-'8 ans:a-bF brea$ F case'Q'8 ans:aQbF brea$ F
case'R'8 ans:aRbF brea$ F case'D'8 ans:aDbF brea$ F L return ansF L publicstaticvoid main5$tring argsNO6 G $canner in:ne& $canner5$stem.in6F int a:Integer. parseInt 5in.ne
-#.'ord Count
;i!en a string arra 5s6 and non negati!e integer 5n6 and return the number of elements in the arra which ha!e same number of characters as the gi!ent int 7. Include a class %ser&ain#ode with a static method count'ord which accepts the string arra and integer. The return tpe is the string formed based on rules. #reate a #lass &ain which would be used to accept the string and integer and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a an integer indicating the number of elements in the string arra followed the elements and ended b the non-negati!e integer 576. utput consists of a integer . (efer sample output for formatting speci"cations. Sample Input 1: + a bb b ccc 1 Sample Output 1: ) Sample Input 2: dog
cat monke bear fo< * Sample Output 2: * import @a!a.util.$cannerF publicclass %ser&ain#ode G staticint Word#ount5$tring sNO,int <,int 6 G int ans:0F "or5int i:0Fi
-3.'ord Count < II
Write a program to read a string and count the number of words present in it. Include a class %ser&ain#ode with a static method count'ord which accepts the string. The return tpe is the integer gi!ing out the count of words. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string. utput consists of integer. (efer sample output for formatting speci"cations.
Sample Input 1: Toda is $unda Sample Output 1: * import @a!a.util.$cannerF import @a!a.util.$tringTokeni>erF publicclass %ser&ain#ode G staticint Word#ount5$tring s6 G $tringTokeni>er st: ne& $tringTokeni>er5s6F int n:st.countTokens56F return nF L publicstaticvoid main5$tring argsNO6 G $canner in:ne& $canner5$stem.in6F $tring str:in.ne
0/.Strin! *rocessin! < V
Write a program to read a string and also a number 7. Porm a new string made up of n repetitions of the last n characters of the $tring. ^ou ma assume that n is between 1 and the length of the string. Include a class %ser&ain#ode with a static method returnast,epeatedCaracters which accepts the string and the number n. The return tpe is the string as per the problem statement. #reate a #lass &ain which would be used to accept the string and integer and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string and integer. utput consists of a string. (efer sample output for formatting speci"cations. Sample Input 1: 2ello ) Sample Output 1: lolo Sample Input 2: 2ello
* Sample Output 2: llollollo import @a!a.util.$cannerF publicclass %ser&ain#ode G publicstatic $tring get$tring 5$tring s1,int k6 G int <:s1.length56F $tringHu4er sb:ne& $tringHu4er56F $tring s):s1.substring5<-k6F "or5int i:1Fi:kFiJJ6 sb.append5s)6F return sb.to$tring56F L publicstaticvoid main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring s1:in.ne
in.close56F L L
01.,e!ular (5pression < III
;i!en a string 5s6 appl the following rules. 1. $tring should not begin with a number. If the condition is satisifed then print T(%3 else print P?=$3. Include a class %ser&ain#ode with a static method validateStrin! which accepts the string. The return tpe is the boolean formed based on rules. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string. utput consists of T(%3 or P?=$3 . (efer sample output for formatting speci"cations. Sample Input 1: ab) Sample Output 1: T(%3 Sample Input 2: )#?H
Sample Output 2: P?=$3 import @a!a.util.$cannerF publicclass %ser&ain#ode G publicstatic $tring !alidate$tring5$tring s16 G i" 5s1.matches5N0-OG1L.Q66 returntrueF returnfalseF L publicstaticvoid main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring s1:in.ne
02.Strin! *rocessin! < rimCat
Write a program to read a string and return a new string which is made of e!er alternate characters starting with the "rst character. Por e
L publicstaticvoid main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring s1:in.ne
0+.Strin! *rocessin! < Username
Write a program to read a !alid email id and e.com Sample Output 1: admin import @a!a.util.$cannerF import @a!a.util.$tringTokeni>erF publicclass %ser&ain#ode G publicstatic $tring get?lternate#hars5$tring s16 G if5s1.char?t506K:`A`6 G $tringTokeni>er st: ne& $tringTokeni>er5s1,A6F return st.ne
$tring s1:in.ne
04.Strin! *rocessin! < VII
Write a program to read a two strings and one int !alue576. check if 7th character of "rst $tring from start and 7th character of second $tring from end are same or not. If both are same return true else return false. #heck need not be #ase sensiti!e Include a class %ser&ain#ode with a static method is(7ual which accepts the two strings and a integer n. The return tpe is the T(%3 R P?=$3. #reate a #lass &ain which would be used to read the strings and integer and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of two strings and an integer. utput consists of T(%3 R P?=$3 . (efer sample output for formatting speci"cations. Sample Input 1: ???? abab ) Sample Output 1: T(%3 Sample Input 2: &7 ($T * Sample Output 2: P?=$3 import @a!a.util.$cannerF publicclass %ser&ain#ode G publicstatic$tring get?lternate#hars5$tring s1,$tring s), int n6 G $tring c:s1.char?t5n-16JF $tring d:s).char?t5s).length56-n6JF i" 5c.e[ualsIgnore#ase5d66 returntrueF
returnfalseF
L publicstaticvoid main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring s1:in.ne
1.Start Case Write a program to read a sentence in string !ariable and con!ert the "rst letter of each word to capital case. rint the "nal string. 7ote8 - nl the "rst letter in each word should be in capital case in "nal string. Include a class UserMainCode with a static method printCapitali>ed which accepts a string. The return tpe 5$tring6 should return the capitali>ed string. #reate a #lass &ain which would be used to accept a string and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a strings. utput consists of a $tring 5capitali>ed string6. (efer sample output for formatting speci"cations. Sample Input: 7ow is the time to actK Sample Output: 7ow Is The Time To ?ctK publicclass %ser&ain#ode G publicstatic $tring print#apitali>ed5$tring s16 G $tringHu4er s:ne& $tringHu4er56F $tringTokeni>er t:ne& $tringTokeni>er5s1, 6F &ile5t.has&oreTokens566 G $tring s):t.ne
L publicstaticvoid main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring s1:in.ne
L
$stem.out .println5%ser&ain#ode. printCapitali&ed5s166F in.close56F L L
4.*?N Card Write a program to read a string and !alidate ?7 no. against following rules8 1. There must be eight characters. ). Pirst three letters must be alphabets followed b four digit number and ends with alphabet *. ?ll alphabets should be in capital case.
rint ZalidS if the ?7 no. is !alid, else print ZIn!alidS. Include a class UserMainCode with a static method validate*?N which accepts a string. The return tpe 5Integer6 should return 1 if the string is a !alid ?7 no. else return ). #reate a #lass &ain which would be used to accept a string and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string, which corresponds to the ?7 number. utput consists of a string - alid or In!alid (efer sample output for formatting speci"cations. Sample Input 1: ?=E*)+3 Sample Output 1: alid Sample Input 2: =31)+P Sample Output 2: In!alid import @a!a.util.$cannerF publicclass %ser&ain#ode G publicstatic $tring !alidate?75$tring s16 G i" 5s1.matches5N?-YOG*LN0-OG+LN?-YOG1L66 return!alidF else returnin!alidF L publicstaticvoid main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring s1:in.ne
%.est Vo&els
Write a program to read a string and check if gi!en string contains e>e Sample Output 1: ^es Sample Input 2: cbisou>>e Sample Output 2: 7o import @a!a.util.$cannerF public class %ser&ain#ode G public static $tring getowels5$tring s16 G $tring s:SesSF i" 5s1.contains5ZaS6 MM s1.contains5ZeS6 MM s1.contains5ZiS6 MM s1.contains5ZoS6 MM s1.contains5ZuS66 s:esF else s:SnoSF return sF L public cstatic void main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring s1:in.ne
L L
3.as Cec$
Write a program to read two strings and check whether or not the ha!e dashes in the same places. rint Z^esS if the condition satis"es, else print Z7oS. Include a class UserMainCode with a static method compareases which accepts two strings. The return tpe 5Integer6 should return 1 if all dashes are placed correctl, else return ). #reate a #lass &ain which would be used to accept two strings and call the static method present in %ser&ain#ode. Note: The strings must ha!e e> Sample Output 2: 7o import @a!a.util.$cannerF public class Eash#heck G static int compareEashes5$tring s1,$tring s)6 G int i,@,ag:0F "or5i:0,@:0Fis1.length56UU@s).length56FiJJ,@JJ6 G i" 5i::s1.length566 G i" 5s).substring5i-16.contains5-66 ag:1F brea$ F L i" 5@::s).length566 G i" [email protected]-66 ag:1F brea$ F L i" 5s1.char?t5i6::'-'6 i" 5s1.char?t5i6K:s).char?t5@66
G ag:1F brea$ F L L i" 5ag::06 return 1F return )F L public static void main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring s1:in.ne
-.,everse Split Write a program to read a string and a character, and re!erse the string and con!ert it in a format such that each character is separated b the gi!en character. rint the "nal string. Include a class UserMainCode with a static method resape which accepts a string and a character. The return tpe 5$tring6 should return the "nal string. #reate a #lass &ain which would be used to accept a string and a character, and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string and a character. utput consists of a string 5the "nal string6. (efer sample output for formatting speci"cations. Sample Input: (abbit Sample Output: t-i-b-b-a-( publicclass %ser&ain#ode G publicstatic $tring reshape5$tring s1,car c6 G int iF $tringHu4er sb1:ne& $tringHu4er56F "or5i:s1.length56-1Fi9:0Fi--6 G sb1.append5s1.char?t5i66.append5c6F L sb1.delete#har?t5sb1.length56-16F
return sb1.to$tring56F L publicstaticvoid main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring s1:in.ne
1/.ast etters Write a program to read a sentence as a string and store onl the last letter of each word of the sentence in capital letters separated b C. rint the "nal string.
Include a class UserMainCode with a static method !etastetter which accepts a string. The return tpe 5string6 should return the "nal string. #reate a #lass &ain which would be used to read a string, and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string. utput consists of a string 5the "nal string6. (efer sample output for formatting speci"cations. Smaple Input : This is a cat Sample Output : $C$C?CT import @a!a.util.$cannerF
import @a!a.util.$cannerF import @a!a.util.$tringTokeni>erF
publicclass %ser&ain#ode G publicstatic $tring get=ast=etter5$tring s16 G $tringTokeni>er st:ne& $tringTokeni>er5s16F $tringHu4er sb1:ne& $tringHu4er56F &ile5st.has&oreTokens566G $tring str:st.ne
return sb1.to$tring56F
L publicstaticvoid main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring s1:in.ne
12.?ll Numbers
Write a program to read a string arra and return 1 if all the elements of the arra are numbers, else return -1. Include a class %ser&ain#ode with a static method validateNumber which accepts a string ara. The return tpe 5integer6 should be -1 or 1 based on the abo!e rules. #reate a #lass &ain which would be used to accept Input string arra and call the static method present in %ser&ain#ode. The string arra is said to be !alid if all the elements in the arra are numbers. 3lse it is in!alid. Input and Output Format: Input consists of an integer specifing the si>e of string arra followed b n strings. (efer sample output for formatting speci"cations. Sample Input 1: + 1)* )+. )* one Sample Output 1: in!alid Sample Input 2: ) 1)* )+. Sample Output 2: import @a!a.util.$cannerF publicclass %ser&ain#ode G publicstatic $tring !alidate7umber5$tring s1NO, int n6 G int l:0F "or5int i:0FinFiJJ6 G i" 5s1NiO.matches5N0-.OQ66
JJlF L i" 5l::n6 return!alidF returnin!alidF
L publicstaticvoid main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F int n:Integer. parseInt 5in.ne
14.Ma5 Substrin!
Write a program to accept two string inputs. The "rst being a source string and second one a delimiter. The source string contains the delimiter at !arious locations. ^our @ob is to return the substring with mae of the delimiter is 1. Include a class %ser&ain#ode with a static method e5tractMa5 which accepts the string. The return tpe 5string6 should be the ma< substring. #reate a #lass &ain which would be used to accept Input string and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a source string and delimiter. utput consists of a string. (efer sample output for formatting speci"cations. Sample Input 1: delhi-pune-patna Sample Output 1: Eelhi\ import @a!a.util.$cannerF import @a!a.util.$tringTokeni>erF publicclass %ser&ain#ode G publicstatic $tring eer st:ne& $tringTokeni>er5s1,s6F int ma<:0F &ile5 st.has&oreTokens566 G
$tring s*:st.ne
1#.States and Capitals
Write a program that construts a hashmap with ZstateS as ke and ZcapitalS as its !alue. If the nee of the hashmap. The ne
class $ample G static $tring displa52ash&ap$tring,$tring9 hm,$tring s*6 G $tring str:F $tring res:F $tring str1:F "or5&ap.3ntr$tring,$tring9 map8hm.entr$et566 G str1:map.get_e56F i" 5s*.e[uals5str166 G str:map.getalue56F brea$ F L
L res:strJCJstr1F return res.to=ower#ase56F L L public class %ser&ain#ode G public static void main5$tring sNO6 G 2ash&ap$tring,$tring9 l:ne& 2ash&ap$tring,$tring956F $canner sc:ne& $canner5$stem.in6F int n:sc.ne
1%.Simple Strin! Manipulation < II
Write a program to read a string and return an integer based on the following rules. If the "rst word and the last word in the $tring match, then return the number of characters in the word else return sum of the characters in both words. ?ssume the $trings to be case - sensiti!e. Include a class %ser&ain#ode with a static method calculate'ordSum which accepts a string. The return tpe 5integer6 should be based on the abo!e rules. #reate a #lass &ain which would be used to accept Input string and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string with mae of 100 characters. utput consists of a string. (efer sample output for formatting speci"cations. Sample Input 1: #;7IY?7T T3#27=;^ $=%TI7$ #;7IY?7T Sample Output 1: Sample Input 2: 2W ?(3 ^% Sample Output 2: import @a!a.util.$cannerF publicclass %ser&ain#ode G staticint !alidate7umber5$tring s16 G int a:s1.inde<f5 6F int b:s1.lastInde<f5 6F $tring s:s1.substring50,a6F $tring s):s1.substring5bJ16F i" 5s.e[uals5s)66 return s.length56F return 5s.length56Js).length566F L publicstaticvoid main5$tringNO args6 G RR OO ?uto-generated method stub $canner in:ne& $canner5$stem.in6F $tring n1:in.ne
L L
22.Valid ate
;i!en a date string as input, write a program to !alidate if the gi!en date is in an of the following formats8 dd.mm. ddRmmR dd-mm- Include a class UserMainCode with a static method Zvalidateate S that accepts a $tring and returns an integer. This method returns 1 if the date is !alid, else return -1. #reate a class Main which would get a $tring as input and call the static method validateate present in the %ser&ain#ode.
Input and Output Format: Input consists of a $tring. utput consists of a $tring that is either 'alid' or 'In!alid'. Sample Input 1: 1).0*.)01) Sample Output 1: alid Sample Input 2: )B01B1 Sample Output 2: In!alid @a!a.te
$impleEatePormatsdf $impleEatePormatsdf : ne&$impleEatePormat5 dd-&&- dd-&&-6F 6F $impleEatePormat $impleEatePormat sdf1 : ne&$impleEatePormat5ddR&&R $impleEatePormat5ddR&&R6F 6F $impleEatePormat $impleEatePormat sdf) : ne&$impleEatePormat5dd.&&. $impleEatePormat5dd.&&.6F 6F $tring s1F sdf.set=enient5 "alse6F sdf1.set=enient5"alse6F sdf).set=enient5"alse6F tr) G Eate d1:sdf.parse5str6F !alidFF return!alid L catc5arse3
G Eate d*:sdf).parse5str6F !alidFF return!alid L catc5arse3
2+.Convert Format import @a!a.util.$cannerF import @a!a.util.$tringTokeni>erF publicclass %ser&ain#ode G con!ertPormat5$tring s6 publicstatic $tring con!ertPormat5$tring G $tringTokeni>er $tringTokeni>er t:ne& $tringT $tri ngTokeni>er5s, okeni>er5s,- -6F 6F $tring s1:t.ne
$tringHu4er sb:ne& $tringHu4er56F sb.append5s1.substring50, sb.append5s1.substring 50, s1.length56-166.append s1.length56-166.append55 '-' '-'6F 6F sb.append5s1.char?t5s1.length56-166.append5s).char?t5066.append5 '-' '-'6F 6F sb.append5s).substring51, sb.append5s).substring 51, s).length5666.append5 s).length5666.append5s*.char?t5066.append5 s*.char?t5066.append5'-' '-'6F 6F sb.append5s*.substring51, sb.append5s*.substring 51, s*.length5666F return sb.to$tring56F
L publicstaticvoid main5$tringNO args6 G $canner in:ne& $canner5$stem. in6F $tring str:in.ne
20.Strin! Occurances < II
btain two strings $1,$) from user as input. ^our ^our program should count the number of times $) appears in $1. (eturn (eturn the count as output. 7ote - #onsider case. Include a class %ser&ain#ode with a static method !etSubstrin! which accepts two string !ariables. The return tpe is the count. #reate a #lass &ain which would be used to accept two Input strings and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of two strings with mae of 100 characters. utput consists of an integer. (efer (efer sample output for formatting speci"cations. Sample Input 1: catcowcat cat Sample Output 1: )
Sample Input 2: catcowcat #?T #?T Sample Output 2: 0 import @a!a.util.$cannerF publicclass %ser&ain#ode G staticint !alidate7umber5$tring s1,$tring n6 G $tring s:s1.replace5n, s:s1.replace5n,C C6F 6F int l:0F i:0Fis.length56FiJJ6 "or5int i:0Fis.length56FiJJ6 5s.char?t5i6::'C'66 i" 5s.char?t5i6::'C' JJlF return lF L publicstaticvoid main5$tringNO args6 G
RR OO ?uto-generated method stub $canner in:ne& $canner5$stem.in6F $tring n1:in.ne
L L
+2.,epeat Front
;i!en a string 5s6 and non negati!e integer 5n6 appl the following rules. 1. ).
Eispla the "rst three characters as front. If the length of the string is less than *, then consider the entire string as front and repeat it n times.
Include a class %ser&ain#ode with a static method repeatFirstreeCaracters which accepts the string and integer. The return tpe is the string formed based on rules. #reate a #lass &ain which would be used to accept the string and integer and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string and integer. utput consists of a string . (efer sample output for formatting speci"cations. Sample Input 1: #oward ) Sample Output 1: #ow#ow
Sample Input 2: $o *
Sample Output 2: $o$o$o import @a!a.util.$cannerF publicclass %ser&ain#ode G publicstatic $tring con!ertPormat5$tring s,int n6 G
$tringHu4er sb:ne& $tringHu4er56F "or5int i:0FinFiJJ6 G i" 5s.length56*6 sb.append5s6F else sb.append5s.substring50,*66F L return sb.to$tring56F
L publicstaticvoid main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring str:in.ne
++.Sorted ?rra)
Write a program to read a string arra, remo!e duplicate elements and sort the arra. 7ote8 1.
The check for duplicate elements must be case-sensiti!e. 5?? and aa are 7T duplicates6
).
While sorting, words starting with upper case letters takes precedence.
Include a class %ser&ain#ode with a static method order(lements which accepts the string arra. The return tpe is the sorted arra. #reate a #lass &ain which would be used to accept the string arraand integer and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of an integer n which is the number of elements followed b n
string !alues. utput consists of the elements of string arra. (efer sample output for formatting speci"cations. Sample Input 1: ??? HHH ??? ??? ### ### Sample Output 1: ??? HHH ###
Sample Input 2: ??? HHH aaa ??? ?bc ? b Sample Output 2: ? ??? ?bc HHH aaa b import @a!a.util.QF public class %ser&ain#ode G public static $tringNO order3lements5$tringNO arr6 G 2ash$et$tring9 al: ne& 2ash$et$tring956F "or5int i:0Fiarr.lengthFiJJ6
G
L
al.add5arrNiO6F L Iterator$tring9 itr:al.iterator56F arr : ne& $tringNal.si>e56OF int i :0 F &ile5itr.has7e
L public static void main5$tringNO args6 G int nF $canner in : ne& $canner5$stem.in6F n : in.ne
L
+4.*attern Matcer
Write a program to read a string and check if it complies to the pattern '#TXXXXXX' where XXXXXX is a digit number. If the pattern is followed, then print T(%3 else print P?=$3. Include a class %ser&ain#ode with a static method Cec$I which accepts the string. The return tpe is a boolean !alue. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string. utput should print T(%3 or P?=$3 . (efer sample output for formatting speci"cations.
Sample Input 1: #T-*0)0)0 Sample Output 1: T(%3 Sample Input 2: #T1)*+1) Sample Output 2: P?=$3 import @a!a.util.$cannerF publicclass %ser&ain#ode G staticint !alidate7umber5$tring s16 G i" 5s1.matches55#T-6N0-OGL66 G return 1F
L else return -1F L publicstaticvoid main5$tringNO args6 G RR OO ?uto-generated method stub $canner in:ne& $canner5$stem.in6F $tring n1:in.ne
L L
+#.*la)in! &it Strin! < I
;i!en a string arra and non negati!e integer 5n6 appl the following rules. 1. ick nth character from each $tring element in the $tring arra and form a
new $tring. ). If nth character not a!ailable in a particular $tring in the arra consider C as the character. *. (eturn the newl formed string. Include a class %ser&ain#ode with a static method "ormStrin! which accepts the string and integer. The return tpe is the string formed based on rules. #reate a #lass &ain which would be used to accept the string and integer and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a an integer which denotes the si>e of the arra followed b the arra of strings and an integer 5n6. utput consists of a string . (efer sample output for formatting speci"cations. Sample Input 1: + ?H# X^Y 3P; &7 * Sample Output 1: #Y;C import java.util.Scanner; publicclass UserMainCode { publicstatic String stringHinder(String s1$8int n8int a) { String5u66er sb*new String5u66er(); for(int i*!;i9n;i::) { if(s1i$.length()?*a) sb.aend(s1i$.substring(a18a)); else &
sb.aend("");
return sb.toString(); & main(String$ args) { publicstaticvoid
Scanner in*new Scanner(S+stem.in); int n*0nteger. parseInt(in.ne,t-ine()); String s1$*new Stringn$; for(int i*!;i9n;i::) s1i$*in.ne,t-ine(); int a*0nteger. parseInt(in.ne,t-ine()); S+stem.out.rintln(UserMainCode.stringFinder (s18n8a));
in.close(); &
&
+%.,e!ular (5pression < 1
;i!en a string 5s6 appl the following rules. 1. $tring should be onl four characters long. ). Pirst character can be an alphabet or digit. *. $econd character must be uppercase '('. +. Third character must be a number between 0-. If all the conditions are satisifed then print T(%3 else print P?=$3. Include a class %ser&ain#ode with a static method validate which accepts the string. The return tpe is the boolean formed based on rules. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string. utput consists of T(%3 or P?=$3 . (efer sample output for formatting speci"cations. Sample Input 1: !(+u Sample Output 1: T(%3 Sample Input 2: !(au
Sample Output 2: P?=$3 Sample Input +: !rau Sample Output +: P?=$3 import java.util.Scanner; publicclass UserMainCode { static String chec3Jattern(String s1) { if(s1.matches("a=>!#${1&${1&!#${1&.2") AA s1.length()**') return"true"; return"6alse"; & main(String args$) publicstaticvoid { Scanner in*new Scanner(S+stem.in); String str*in.ne,t-ine(); S+stem.out.rintln(UserMainCode.checkPattern(str)); in.close(); & &
+3.,e!ular (5pression @ 2 8?!e Validator
;i!en the age of a person as string, !alidate the age based on the following rules. 1. alue should contain onl numbers. ). alue should be non-negati!e. *. alue should be in the range of )1 to +'. If all the conditions are satisifed then print T(%3 else print P?=$3. Include a class %ser&ain#ode with a static method Validate?!e which accepts the string. The return tpe is the boolean formed based on rules. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string. utput consists of T(%3 or P?=$3 . (efer sample output for formatting speci"cations.
Sample Input 1: )* Sample Output 1: T(%3 Sample Input 2: -*+ Sample Output 2: P?=$3 Sample Input +: *a Sample Output +: P?=$3 ?cHRT(%3 import @a!a.util.$cannerF publicclass %ser&ain#ode G static $tring !alidate7umber5$tring s16 G i" 5s1.matches5N0-OQ66 G int a:Integer. parseInt 5s16F i" 5a9:)1 MM a:)6 return!alidF L returnin!alidF L publicstaticvoid main5$tringNO args6 G RR OO ?uto-generated method stub $canner in:ne& $canner5$stem.in6F $tring n1:in.ne
L L
+-.,e!ular (5pression @ + 8*one Validator
;i!en a phone number as string, !alidate the same based on the following rules. 1. alue should contain onl numbers.
). alue should contain 10 digits. *. alue should not start with 00. If all the conditions are satisifed then print T(%3 else print P?=$3. Include a class %ser&ain#ode with a static method validate*one which accepts the string. The return tpe is the boolean formed based on rules. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string. utput consists of T(%3 or P?=$3 . (efer sample output for formatting speci"cations. Sample Input 1: //+*)1 Sample Output 1: T(%3 Sample Input 2: 001+)*+) Sample Output 2: P?=$3 import @a!a.util.$cannerF publicclass %ser&ain#ode G static $tring !alidate7umber5$tring s16 G i" 5s1.matches5N1-OG)LN0-OG/L66 G return!alidF
L returnin!alidF
L publicstaticvoid main5$tringNO args6 G RR OO ?uto-generated method stub $canner in:ne& $canner5$stem.in6F $tring n1:in.ne
L L
+0.Strin! Splitter
Write a program which would accept a string and a character as a delimiter. ?ppl the below rules 1. %sing the delimiter, split the string and store these elements in arra. ). (e!erse each element of the string and con!ert it into lowercase. Include a class %ser&ain#ode with a static method manipulateiteral which accepts the string and character. The return tpe is the string arra formed. #reate a #lass &ain which would be used to accept the string and characterand call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string and character. utput consists of a string arra. (efer sample output for formatting speci"cations. Sample Input 1: ???RbbaRcccREEE R Sample Output 1: aaa abb ccc ddd publicclass UserMainCode { publicstatic String$ comareashes(String s18char c) { String s*c:" "; StringEo3eni=er a*new StringEo3eni=er(s18s); int 3*!; String ans$*new Stringa.countEo3ens()$; while(a.hasMoreEo3ens()) { String b*a.ne,tEo3en();
String5u66er sb*new String5u66er(b); sb.reverse(); ans3$*sb.toString().to-oerCase(); ::3; & return ans; & main(String$ args) { publicstaticvoid Scanner in*new Scanner(S+stem.in); String s1*in.ne,t-ine(); char c*in.ne,t().chart(!); String o$*UserMainCode.compareDashes(s18c); for(int i*!;i9o.length;i::) S+stem.out.rintln(oi$); in.close(); & &
4/.Vo&el Count
Write a program to read a string and count the number of !owels present in it. Include a class %ser&ain#ode with a static method tellVo&elCount which accepts the string. The return tpe is the integer gi!ing out the count of !owels. 7ote8 The check is case-insensiti!e. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string. utput consists of integer. (efer sample output for formatting speci"cations. Sample Input 1: 7ew^ork Sample Output 1: ) Sample Input 2: 3lephant
Sample Output 2: * import @a!a.util.$cannerF publicclass%ser&ain#ode G publicstaticintcountowels5$tring s16 G $tring s:s1.to=ower#ase56F int c:0F "or5inti:0Fis.length56FiJJ6 G car k:s.char?t5i6F i" 5k::'a' UU k::'e' UU k::'i' UU k::'o' UU k::'u'6 JJcF L return cF L publicstaticvoid main5$tringNO args6 G $canner in:ne&$canner5$stem.in6F $tring s1:in.ne
in.close56F L L
41.*la)in! &it Strin! < II
Write a program to accept a string arra as input, con!ert all the elements into lowercase and sort the string arra. Eispla the sorted arra. Include a class %ser&ain#ode with a static method sort?rra) which accepts the string arra. The return tpe is the string arra formed based on re[uirement. #reate a #lass &ain which would be used to accept the string arra and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a an integer which denotes the si>e of the arra followed b the arra of strings, utput consists of a string arra. (efer sample output for formatting speci"cations. Sample Input 1:
??? HH #### ? ?H#E3 Sample Output 1: a aaa abcde bb cccc import java.util.rra+s; import java.util.Scanner; publicclass UserMainCode {
publicstatic String$ stringHinder(String s1$) { String s4$*new Strings1.length$; for (int i * !; i 9 s1.length; i::) { s4i$*s1i$.to-oerCase(); & rra+s.sort(s4);
return s4; & main(String$ args) { publicstaticvoid Scanner in*new Scanner(S+stem.in); int n*0nteger. parseInt(in.ne,t-ine()); String s1$*new Stringn$; for(int i*!;i9n;i::) s1i$*in.ne,t-ine(); String o$*UserMainCode.stringFinder (s1); for(int i*!;i9o.length;i::) S+stem.out.rintln(oi$); in.close();
& &
44.?steris$ A Caracters
Write a program to read a string and return true or false based on the below rule8 1. (eturn true if for e!er 'Q' in the string, there are same characters both side immediatel before and after the star, else return false.
Include a class %ser&ain#ode with a static method scanStarNei!bors which accepts the string. The return tpe is the boolean T(%3 or P?=$3 based on the rule. 7ote8 The check is case-insensiti!e. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string. utput consists of T(%3 or P?=$3. (efer sample output for formatting speci"cations. Sample Input 1: 2elloQWorld Sample Output 1: P?=$3 Sample Input 2: WelcomeQeli>abeth Sample Output 2: T(%3 importjava.util.rra+s; import java.util.Scanner; publicclass UserMainCode { publicstaticboolean scanStarNeighbors(String s1) { boolean b*false; for(int i*!;i9s1.length();i::) { if(s1.chart(i)**<2<) { int n*i; char c*s1.chart(n1); char d*s1.chart(n:1); if(c**d) b*true; else { b*false; break; & & &
return b; & main(String$ args) { publicstaticvoid Scanner in*new Scanner(S+stem.in); String s1*in.ne,t-ine(); S+stem.out.rintln(UserMainCode.scanStarNeighbors(s1)); in.close();
& &
4#.Occurance Count
Write a program to read a string that contains a sentence and read a word. #heck the number of occurances of that word in the sentence. Include a class %ser&ain#ode with a static method count'ords which accepts the two strings. The return tpe is the integer gi!ing the count. 7ote8 The check is case-sensiti!e. #reate a #lass &ain which would be used to accept the two strings and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of two strings. utput consists of count indicating the number of occurances. (efer sample output for formatting speci"cations. Sample Input 1: 2ello world ]a!a is best programming language in the world world Sample Output 1: ) Sample Input 2: hello world World Sample Output 2: 0 import java.util.Scanner; import java.util.StringEo3eni=er;
UserMainCode { publicclass UserMainCode publicclass comareashes(String s18String s4) publicstaticint publics taticint comareashes(String { ans*!; int ans*!; int StringEo3eni=er t*new t*new StringEo3eni=er(s1); StringEo3eni=er(s1); (t.hasMoreEo3ens()) while(t.hasMoreEo3ens()) while { String s%*t.ne,tEo3en(); (s%.eGuals(s4)) if(s%.eGuals(s4)) if ans::; & ans; return ans; return & main(String$ args) { main(String$ publicstaticvoi publics taticvoid d Scanner in*new in*new Scanner(S+stem. Scanner(S+stem.in); String s1*in.ne,t-ine(); String s4*in.ne,t-ine(); S+stem.out.rintln(UserMainCode.compareDashes(s18s4)); in.close(); & &
4%.,e!ular (5pressions (5pressions < III
Write Write a program to read two strings $1 M $), compute the number of times that $) appears in $1. Include a class %ser&ain#ode with a static method searcStrin! which accepts the two strings. The return tpe is the integer gi!ing the count. 7ote8 The check is case-insensiti!e. #reate a #lass &ain which would be used to accept the two strings and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of two strings. utput consists of count indicating the number of occurances. (efer (efer sample output for formatting speci"cations. Sample Input 1: #atcowcat cat Sample Output 1: )
Sample Input 2: #atcowcat catp Sample Output 2: 0 java.util.Scanner; import java.util.Scanner; import UserMainCode { publicclass UserMainCode publicclass searchString(String s18String n) staticint searchString(String staticint { String s4*s1.to-oerCase(); String s%*n.to-oerCase(); String s*s4.relace(s%8"" s*s4.relace(s%8""); ); l*!; int l*!; int (int i*!;i9s.length();i::) for( for int i*!;i9s.length();i::) (s.chart(i)**<< <<) ) if(s.chart(i)** if ::l; l; return l; return & main(String$ args) { main(String$ publicstaticvoid publicstaticvoi d TODO utogenerated method stub TODO utogenerated Scanner in*new in*new Scanner(S+stem. Scanner(S+stem.in); String n1*in.ne,t-ine(); String n*in.ne,t-ine(); S+stem.out.rintln(UserMainCode.searchString (n18n)); (n18n));
& &
43.Strin!s *rocessin!
Write Write a program to read a string that contains comma separated fruit names and also a number 7. ick the nth fruit and return it. If the total number of elements are less than the number speci"ed in 7, then return return the last element. Include a class %ser&ain#ode with a static method 6ndFruitName which accepts the the string and the number n. The return tpe is the string which has the fruit name. #reate a #lass &ain which would be used to accept the string and integer and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string and integer. integer. utput consists of a string. (efer (efer sample output for formatting speci"cations. Sample Input 1: ?pple,Hanana,range ) Sample Output 1: Hanana Sample Input 2: ?pple,Hanana,range + Sample Output 2: range import java.util.Scanner; import java.util.Scanner; java.util.StringEo3eni=er; import java.util.StringEo3eni=er; import UserMainCode { publicclass publiccl ass UserMainCode String 6indHruitName(String s18int s18int n) n) publicstatic String publicstatic { StringEo3eni=er st*new st*new StringEo3eni=er(s18 StringEo3eni=er(s18"8" "8"); ); String s*"" s*""; ; 3*st.countEo3ens(); int 3*st.countEo3ens(); int (int i*1;i9*3;i::) for( for int i*1;i9*3;i::) { (i**n) if(i**n) if { s*st.ne,tEo3en(); ; break; break & else { s*st.ne,tEo3en(); & & s; return s; return & main(String$ args) { main(String$ publicstaticvoi publicst aticvoid d Scanner in*new in*new Scanner(S+stem. Scanner(S+stem.in); String s1*in.ne,t-ine(); n*in.ne,t0nt(); int n*in.ne,t0nt(); int S+stem.out.rintln(UserMainCode.findFruitName(s18n)); in.close();
&
&
4-.*roper Case
Write a program to read a string and con!ert the intial letter of each word to uppercase. Include a class %ser&ain#ode with a static method can!eCase which accepts the string. The return tpe is the modi"ed string. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string. utput consists of a string. (efer sample output for formatting speci"cations. Sample Input 1: This is cogni>ant academ Sample Output 1: This Is #ogni>ant ?cadem publicclass %ser&ain#ode G publicstatic $tring print#apitali>ed5$tring s16 G $tringHu4er s:ne& $tringHu4er56F $tringTokeni>er t:ne& $tringTokeni>er5s1, 6F &ile5t.has&oreTokens566G $tring s):t.ne
L
L publicstaticvoid main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring s1:in.ne
40.en!t o" same &ord
Write a program to read a string containing multiple words "nd the "rst and last words, if the are same, return the length and if not return the sum of
length of the two words. Include a class %ser&ain#ode with a static method compareast'ords which accepts the string. The return tpe is the length as per problem. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of a string. utput consists of a integer. (efer sample output for formatting speci"cations. Sample Input 1: This is #ogni>ant ?cadem Sample Output 1: 11 Sample Input 2: 2ello World 2ello Sample Output 2: import java.util.Scanner; publicclass UserMainCode { staticint validateNumber(String s1) { int a*s1.inde,I6(" "); int b*s1.last0nde,I6(" "); String s*s1.substring(!8a); String s4*s1.substring(b:1); if(s.eGuals(s4)) return s.length(); return (s.length():s4.length()); & main(String$ args) { publicstaticvoid TODO utogenerated method stub Scanner in*new Scanner(S+stem.in); String n1*in.ne,t-ine(); S+stem.out.rintln(UserMainCode.validateNumber (n1));
& &
#1.Find i!its
Por a gi!en double number with atleast one decimal !alue, Write a program to compute the number of digits before and after the decimal point in the following format nofEigitsHeforeEecimal8nofEigits?fterEecimal. 7ote8 Ignore >eroes at the end of the decimal 53ero is the onl digit after decimal. (efer 3
Input consists of a double. utput consists of string. (efer sample output for formatting speci"cations. Sample Input 1: /+*.)1 Sample Output 1: *8) Sample Input 2: )0.1*0 Sample Output 2: )8) Sample Input +: )0.1*0 Sample Output +: )8) import java.util.Scanner; import java.util.StringEo3eni=er; publicclass UserMainCode { static String validateNumber(double d) { int n1*!8n4; String s*String.valueOf (d); StringEo3eni=er t*new StringEo3eni=er(s8"."); String s1*t.ne,tEo3en();
String s4*t.ne,tEo3en(); n1*s1.length(); n4*s4.length(); int n%*!; for(int i*s4.length()1;i?*!;i) { if(s4.chart(i)**!) ::n%; else break; & if(n4*1) n4*n4n%; else n4*1; String s%*String.valueOf (n1):"O":String.valueOf (n4); return s%; & main(String$ args) { publicstaticvoid TODO utogenerated method stub Scanner in*new Scanner(S+stem.in); double d*in.ne,touble(); S+stem.out.rintln(UserMainCode.validateNumber (d)); & &
%+.ar!est Cun$
Write a program to read a string and return the length of the largest chunk in the string. ? chunk is a repetition of same character ) or more number of times. If the gi!en string doest not contain an repeated chunk of characters return -1. Include a class %ser&ain#ode with a static method !etar!estSpan which accepts the string. The return tpe is the integer. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string. utput consists of integer. (efer sample output for formatting speci"cations. Sample Input 1: This place is soooo good Sample Output 1: + importjava.util.Scanner;
importjava.util.StringEo3eni=er; publicclassUserMainCode { staticintlargestChun3(String str1) { intc8ma,*!8i*!8j*!; StringEo3eni=erst*newStringEo3eni=er(str1); while(st.hasMoreEo3ens()) { String s1*st.ne,tEo3en(); for(i*!;i9s1.length()1;i::) { c*1; if(s1.chart(i)**s1.chart(i:1)) { ::c; for(j*i:4;j9s1.length();j::) { if(s1.chart(i)**s1.chart(j)) { ::c; & else break; & & if(c?ma,) { ma,*c; i*j1; & & & return (ma,); & main(String args$) publicstaticvoid { String s1; Scanner in*newScanner(S+stem.in); s1*in.ne,t-ine(); intans*UserMainCode.largestChunk(s1); if(ans?*4) S+stem.out.rintln(ans); else S+stem.out.rintln("No Chun3s"); & &
%%.,e!ular (5pression < III
;i!en a string 5s6 appl the following rules. I6?t least / characters must be present II6?t least one capital letter must be present III6?t least one small letter must be present
I!6?t least one special smbol must be present 6?t least one numeric !alue must be present If the condition is satisifed then print !alid else print in!alid. Include a class %ser&ain#ode with a static method pass&ordValidation which accepts the string. The return tpe is the string. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string. utput consists of string 5!alid R in!alid6 . (efer sample output for formatting speci"cations. Sample Input 1: TechnologC1)1* Sample Output 1: !alid import java.util.Scanner; publicclassUserMainCode { staticint assord/alidation(String s) { if(s.length()?*PAAs.matches(".2>$.2")AAs.matches(".2a =$.2")AAs.matches(".2!#$.2")AAs.matches(".2K!#>a=$.2")) return 1; return 1; & main(String$ args) publicstaticvoid { Scanner in*new Scanner(S+stem.in); String s*in.ne,t-ine(); int b*UserMainCode. passordValidation(s); if(b**1) S+stem.out.rintln("valid"); else S+stem.out.rintln("invalid"); & &
%-.Strin! processin! @ on! ; Sort ; on!
btain two strings $1,$) from user as input. ^our program should form a string of ZlongJshortJlongS, with the shorter string inside of the longer $tring. Include a class %ser&ain#ode with a static method !etCombo which accepts two string !ariables. The return tpe is the string. #reate a #lass &ain which would be used to accept two Input strings and call the static method present in %ser&ain#ode.
Input and Output Format: Input consists of two strings with mae of 100 characters. utput consists of an string.
(efer sample output for formatting speci"cations. Sample Input 1: 2ello 2i Sample Output 1: 2ello2i2ello import java.util.Scanner; publicclass UserMainCode { staticString assord/alidation(String s18String s4) { if(s1.length()?s4.length()) return s1:s4:s1; return s4:s1:s4; & main(String$ args) publicstaticvoid { Scanner in*new Scanner(S+stem.in); String s1*in.ne,t-ine(); String s4*in.ne,t-ine(); S+stem.out.rintln(UserMainCode. passordValidation(s18s4)); & &
%0.?!e "or Votin!
;i!en a date of birth 5ddR&&R6 of a person in string, compute his age as of 01R01R)01. If his age is greater than 1/, then println eligible else println not-eligible. Include a class %ser&ain#ode with a static method get?ge which accepts the string !alue. The return tpe is the string. #reate a #lass &ain which would be used to accept the two string !alues and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of two string. utput consists of a string. (efer sample output for formatting speci"cations. Sample Input 1:
1R11R11 Sample Output 1: eligible import @a!a.te
L L returnnot eligibleF L public static void main5$tringNO args6 G
$canner in:ne& $canner5$stem.in6F $tring s1:in.ne
$tring s):01R01R)01F $stem.out .println5%ser&ain#ode.getvalues5s1,s)66F L L
2. Strin!s @ Uni7ue A (5istin! Caracters btain two strings from user as input. ^our program should modif the "rst string such that all the characters are replaced b plus sign 5J6 ee of 100 characters. utput consists of a single string. (efer sample output for formatting speci"cations. Sample Input 1: abc<> a
L public static void main5$tring NOargs6G
$canner sc:ne& $canner5$stem.in6F $tring n:sc.ne
+. on!est 'ord Write a rogram which "nds the longest word from a sentence. ^our program should read a sentence as input from user and return the longest word. In case there are two words of mae of 100 characters. utput consists of a single string. (efer sample output for formatting speci"cations. Sample Input 1: Welcome to the world of rogramming Sample Output 1: rogramming Sample Input 2: ?H# E3P Sample Output 2: ?H# import @a!a.util.QF public class %ser&ain#ode G public static $tring lengthiest$tring5$tring s16 G int ma<:0F $tring s):ne& $tring56F $tringTokeni>er t: ne& $tringTokeni>er5s1, 6F &ile5t.has&oreTokens566 G $tring s*:t.ne
$stem.out .println5lengthiesttring5s166F L L
4. Strin! Occurences btain two strings from user as input. ^our program should count the number of occurences of second word of second sentence in the "rst sentence. (eturn the count as output. 7ote - #onsider case. Include a class %ser&ain#ode with a static method countNoO"'ords which accepts two string !ariables. The return tpe is the modi"ed string. #reate a #lass &ain which would be used to accept two Input strings and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of two strings with mae of 100 characters. utput consists of a single string. (efer sample output for formatting speci"cations. Sample Input 1: abc bcd abc bcd abc abc a! abc Sample Output 1: + Sample Input 2: ?H# <> ??? w abc Sample Output 2: 0 import @a!a.util.$cannerF import @a!a.util.$tringTokeni>erF public class %ser&ain#ode G public static void get!alues5$tring s1, $tring s)6 G int count:0F $tringTokeni>er st:ne& $tringTokeni>er5s), 6F $tring s*:st.neer st1:ne& $tringTokeni>er5s1, 6F &ile5st1.has&oreTokens566 G $tring s:st1.ne
%ser&ain#ode.getvalues5s1,s)6F L L
Concatenate Caracters
;i!en an arra of $trings, write a program to take the last character of each string and make a new $tring b concatenating it. Include a class UserMainCode with a static method BconcatCaracter that accepts a $tring arra as input and returns the new $tring. #reate a class Main which would get the $tring arra as input and call the static method concatCaracterpresent in the %ser&ain#ode. Input and Output Format: The "rst line of the input consists of an integer n that corresponds to the number of strings in the input string arra. The ne
12.?na!ram
Write a program to check whether the two gi!en strings are anagrams. 7ote8 (earranging the letters of a word or phrase to produce a new word or phrase, using all the original letters eant technologies Sample Output +: 7ot ?nagrams import @a!a.util.?rrasF import @a!a.util.$cannerF public class %ser&ain#ode G static int get?nagram5$tring str1,$tring str)6 G car NOa1:str1.to=ower#ase56.replace?ll5\\s,6.to#har?rra56F car NOa):str).to=ower#ase56.replace?ll5\\s,6.to#har?rra56F
?rras.sort 5a16F ?rras.sort 5a)6F i" 5?rras.equals 5a1,a)66 return 1F return -1F L public static void main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring str1:in.ne
1+.Calculate Meter ,eadin!
;i!en ) strings corresponding to the pre!ious meter reading and the current meter reading, write a program to calculate electricit bill. The input string is in the format ?????XXXXX. ????? is the meter code and XXXXX is the meter reading. P(&%=?8 5XXXXX-XXXXX6Q+ 2int8 if ????? of input1 and input) are e[ual then separate the XXXXX from string and con!ert to integer. ?ssume that ????? of the ) input strings will alwas be e[ual. Include a class UserMainCode with a static method BcalculateMeter,eadin! that accepts ) $tring arguments and returns an integer that corresponds to the electricit bill. The 1st argument corresponds to the pre!ious meter reading and the )nd arguement corresponds to the current meter reading. #reate a class Main which would get ) $trings as input and call the static method calculateMeter,eadin! present in the %ser&ain#ode. Input and Output Format: Input consists of ) strings. The "rst input corresponds to the pre!ious meter reading and the second input corresponds to the current meter reading.
utput consists of an integer that corresponds to the electricit bill. Sample Input: #$3#31)*0 #$3#31)+00
Sample Output: +0 import @a!a.util.$cannerF public class %ser&ain#ode G static int calculate3lectricitHill5$tring str1,$tring str)6 G int e1:Integer. parseInt 5str1.substring566F int e):Integer. parseInt 5str).substring566F int total:5e)-e16Q+F return totalF
L public static void main5$tring argsNO6
G $tring s1,s)F int nF $canner in:ne& $canner5$stem.in6F s1:in.ne
1%.Vo&els
;i!en a $tring input, write a program to "nd the word which has the the ma
Sample Output : our import @a!a.util.$cannerF import @a!a.util.$tringTokeni>erF public class %ser&ain#ode G public static $tring lengthiest$tring5$tring s16 G int ma<:0F $tring s):ne& $tring56F $tringTokeni>er t:ne& $tringTokeni>er5s1, 6F &ile5t.has&oreTokens566 G $tring s:t.ne
2/.ar!est Span
Write a program to read an arra and "nd the si>e of largest span in the gi!en arra span is the number of elements between two repeated numbers including both numbers. ?n arra with single element has a span of 1. . Include a class %ser&ain#ode with a static method !etMa5Span which accepts a single integer arra. The return tpe 5integer6 should be the si>e of largest span. #reate a #lass &ain which would be used to accept Input arra and call the static method present in %ser&ain#ode. Input and Output Format:
Input consists of nJ1 integers. The "rst integer corresponds to n, the number of elements in the arra. The ne
L public static void main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F int n:in.ne
21.Ma5 Scorer
Write a program that performs the following actions8 1. (ead n strings as input and stores them as an arralist. The string consists of student information like name and obtained marks of three sub@ects. 3g8 name-mark1-mark)-mark* Nsuresh-0-+-1)O The mark would range between 0 100 5inclusi!e6. ). Write a function i!estScorer which accepts these the arralist and returns the name of the student who has scored the ma< marks. ?ssume the result will ha!e onl one student with ma< mark. Include a class %ser&ain#ode with the static method i!estScorer which accepts the arralist and returns the name 5string6 of ma< scorer. #reate a #lass &ain which would be used to read n strings into arralist and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of 1 integer and n strings. The "rst integer denotes the si>e of the arralist, the neerF public class %ser&ain#ode G static $tring highest$corer5$tring arNO6 G $tring name:F int score:0F "or5int i:0Fiar.lengthFiJJ6
G $tringTokeni>er st: ne& $tringTokeni>er5arNiO,-6F $tring tname:st.ne
22.Ma5 Vo&els
Write a rogram which fetches the word with mae of 100 characters. utput consists of a single string. (efer sample output for formatting speci"cations. Sample Input 1: ?ppreciation is the best wa to moti!ate Sample Output 1: ?ppreciation import @a!a.util.$cannerF import @a!a.util.$tringTokeni>erF public class %ser&ain#ode G
public static $tring lengthiest$tring5$tring s16 G int ma<:0F $tring s):ne& $tring56F $tringTokeni>er t:ne& $tringTokeni>er5s1, 6F &ile5t.has&oreTokens566 G $tring s:t.ne
24.?dDacent S&aps
Write a rogram that accepts a string as a parameter and returns the string with each pair of ad@acent letters re!ersed. If the string has an odd number of letters, the last letter is unchanged. Include a class %ser&ain#ode with a static method s&ap*airs which accepts a string. The return tpe is string which is re!ersed pair of letters. #reate a #lass &ain which would be used to accept two Input strings and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string with mae of 100 characters. utput consists of a single string. (efer sample output for formatting speci"cations. Sample Input 1: forget Sample Output 1: ofgrte
Sample Input 2: 7ew ^ork
Sample Output 2: e7 wo^kr import @a!a.util.$cannerF public class %ser&ain#ode G public static $tring swap#haracter5$tring s16 G $tringHu4er sb:ne& $tringHu4er56F "or5int i:0Fis1.length56Fi:iJ)6 G car c,dF i" 5iK:s1.length56-16 G c:s1.char?t5i6F d:s1.char?t5iJ16F sb.append5d6F sb.append5c6F L else G c:s1.char?t5i6F sb.append5c6F L
L return sb.to$tring56F L public static void main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring s1:in.ne
2%.*ass&ord
;i!en a $tring , write a program to "nd whether it is a !alid password or not. alidation (ule8 ?tleast / characters ?tleast 1 number51,),*...6 ?tleast 1 special character5A,B,D...6
?tleast 1 alphabet5a,H...6 Include a class UserMainCode with a static method Zvalidate*ass&ord S that accepts a $tring argument and returns a boolean !alue. The method returns true if the password is acceptable. 3lse the method returns false. #reate a class Main which would get a $tring as input and call the static method validate*ass&ord present in the %ser&ain#ode. Input and Output Format: Input consists of a $tring. utput consists of a $tring that is either ZalidS or ZIn!alidS. Sample Input 1: ctsA1010 Sample Output 1: alid Sample Input 2: punitha* Sample Output 2: In!alid import @a!a.util.$cannerF public class %ser&ain#ode G static int passwordalidation5$tring s6 G i" 5s.length569:/MMs.matches5.QNa->?-YO.Q6MMs.matches5.QN0O.Q6MMs.matches5.QN0-?-Ya->O.Q66 return 1F return -1F L public static void main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring s:in.ne
+/.?na!rams
Write a program to read two strings and checks if one is an anagram of the
other. ?n anagram is a word or a phrase that can be created b rearranging the letters of another gi!en word or phrase. We ignore white spaces and letter case. ?ll letters of 'Eesperation' can be rearranged to the phrase '? (ope 3nds It'. Include a class %ser&ain#ode with a static method cec$?na!ram which accepts the two strings. The return tpe is boolean which is T(%3 R P?=$3. #reate a #lass &ain which would be used to accept the two strings and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of two strings. utput consists of T(%3 R P?=$3. (efer sample output for formatting speci"cations. Sample Input 1: tea eat Sample Output 1: T(%3 Sample Input 2: Eesperation ? (ope 3nds It Sample Output 2: T(%3 import @a!a.util.?rrasF import @a!a.util.$cannerF public class %ser&ain#ode G static int get?nagram5$tring str1,$tring str)6 G car NOa1:str1.to=ower#ase56.replace?ll5\\s,6.to#har?rra56F car NOa):str).to=ower#ase56.replace?ll5\\s,6.to#har?rra56F ?rras.sort 5a16F ?rras.sort 5a)6F i" 5?rras.equals 5a1,a)66 return 1F return -1F L public static void main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring str1:in.ne
L L
+2.'ord Count
;i!en a string arra 5s6 with each element in the arra containing alphabets or digits. Write a program to add all the digits in e!er string and return the sum as an integer. If two digits appear simultaneousl do not consider it as one number. 3<- Por '2derabad )1' consider ) and 1 as two digits instead of )1 as a number. Include a class %ser&ain#ode with a static method sumO"i!its which accepts the string arra. The return tpe is the integer formed based on rules. #reate a #lass &ain which would be used to accept the string and integer and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a an integer indicating the number of elements in the string arra. utput consists of a integer . (efer sample output for formatting speci"cations. Sample Input 1: ???1 H)H +### ? ?H#E3 Sample Output 1: 1) Sample Input 2: * 1) #)* #() Sample Output 2: 1 import @a!a.util.$cannerF public class %ser&ain#ode G static int sumfEigits5$tring strNO6 G int sum:0,iF
"or5int @:0F@str.lengthF@JJ6 G "or5i:0Fi[email protected] G i" [email protected]?t5i69:'0'[email protected]?t5i6:''6 G sum:sumJInteger. parseInt [email protected]?t5i6J6F L L
L i" 5sum9:06 return sumF return -1F
L public static void main5$tring argsNO6
G $canner in:ne& $canner5$stem.in6F int n1:Integer. parseInt 5in.ne
++.*re65 Finder
;i!en a string arra 5s6 with each element in the arra containing 0s and 1s. Write a program to get the number of strings in the arra where one $tring is getting as pre"
Sample Input 1: + 0 1 11 110 Sample Output 1: * import Dava.util.ScannerE public class *re65Finder public static int 6nd*re658Strin! sGH int count/E "or8int i/EiJs.len!tEi;; int c1E "or8int D/EDJs.len!tED;; i"8sGDH.matces8KLK;sGiH;KG1/H1K c;;E i"8ccount countcE return countE public static void main8Strin!GH ar!s Scanner inne& Scanner8S)stem.inE int nInte!er.parseInt8in.ne5tine8E Strin!GH ane& Strin!GnHE "or8int i/EiJnEi;; aGiHin.ne5tine8E S)stem.out.println8*re65Finder.6nd*re658aE
+4.Commons
;i!en two arras of strings,return the count of strings which is common in both arras. Euplicate entries are counted onl once. Include a class %ser&ain#ode with a static method countCommonStrin!s which accepts the string arras. The return tpe is the integer formed based on rules. #reate a #lass &ain which would be used to accept the string arras and integer and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a an integer indicating the number of elements in the string
arra followed b the arra. utput consists of a integer . (efer sample output for formatting speci"cations. Sample Input 1: * a c e * b d e Sample Output 1: 1 Sample Input 2: ba ba black sheep wool ba ba ha!e an wool Sample Output 2: ) import java.util.QashSet; import java.util.Scanner; public class UserMainCode { public static int countCommon(String ss1$8String ss4$) { QashSet9String? h*new QashSet9String?(); for(int i*!;i9ss1.length;i::) h.add(ss1i$); String s1$*new Stringh.si=e()$; h.torra+(s1); QashSet9String? h1*new QashSet9String?(); for(int i*!;i9ss4.length;i::) h1.add(ss4i$); String s4$*new Stringh.si=e()$; h.torra+(s4); int count*!;
for(int i*!;i9s1.length;i::) { for(int j*!;j9s4.length;j::) { if(s1i$.eGuals(s4j$)) count::; & & return count;
& main(String$ args) public static void { Scanner in*new Scanner(S+stem.in); int n*0nteger. parseInt(in.ne,t-ine()); String$ a1*new Stringn$; for(int i*!;i9n;i::) a1i$*in.ne,t-ine(); n*0nteger. parseInt(in.ne,t-ine()); String$ a4*new Stringn$; for(int i*!;i9n;i::) a4i$*in.ne,t-ine(); S+stem.out.rintln(countCommon(a18a4)); &
&
+%.(
Write a program to read a string and !alidate the gi!en email-id as input. alidation (ules8 1. 3nsure that there are atleast characters between 'A' and '.' ). There should be onl one '.' and one 'A' smbol. *. The '.' should be after the 'A' smbol. +. There must be atleast three characters before 'A'. . The string after '.' should onl be 'com' Include a class %ser&ain#ode with a static method Validate(mail which accepts the string. The return tpe is T(%3 R P?=$3 as per problem. #reate a #lass &ain which would be used to accept the string and call the static method present in %ser&ain#ode. Input and Output Format: Input consists of a string. utput consists of T(%3 R P?=$3. (efer sample output for formatting speci"cations. Sample Input 1: testAgmail.com Sample Output 1: T(%3 Sample Input 2:
academA<>.com Sample Output 2: P?=$3 import @a!a.util.$cannerF public class %ser&ain#ode G static boolean !alidate3mail5$tring str6 G return str.matches5Na->?-Y0-OG*LANa->?-YOGL\\.com6F L public static void main5$tringNO args6 G $canner in:ne& $canner5$stem.in6F $tring s:in.ne
4/.ISN Validation
Write a program to read a string and !alidate the gi!en I$H7 as input. alidation (ules8 1. ?n I$H7 5International $tandard Hook 7umber6 is a ten digit code which uni[uel identi"es a book. ). To !erif an I$H7 ou calculate 10 times the "rst digit, plus times the second digit, plus / times the third ..all the wa until ou add 1 times the last digit. If the "nal number lea!es no remainder when di!ided b 11 the code is a !alid I$H7. 3
