Search Interview Questions | ![]() ![]() Click here and help us by providing the answer. ![]() Click Correct / Improve and please let us know. |
|
| ||||
Interview Questions and Answers - Order By Newest | ||||
![]() ![]() | ||||
| ||||
Ans. public class BuggyBread1 { public static void main(String args[]) { String str = "We are what we repeatedly do excellence, then, is not an Act but a habit"; int count = 0; for(Character c: str.toCharArray()){ if(Character.isLowerCase(c)){ count++; } } System.out.println(count); } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { String str = "we are what we repeatedly do excellence, then, is not an act but a haBit"; String wordWithCaptalChar = ""; for(String word:str.split(" ")){ if(!word.equals(word.toLowerCase())){ wordWithCaptalChar = word; } } System.out.println(wordWithCaptalChar); } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { String str = "we are what we repeatedly Do excellence, then, is not an act but a haBit"; String wordWithFirstCaptalChar = ""; for(String word:str.split(" ")){ if(Character.isUpperCase(word.charAt(0))){ wordWithFirstCaptalChar = word; } } System.out.println(wordWithFirstCaptalChar); } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread1 { public static void main(String args[]) { String str = "we are what we repeatedly Do excellence, then, is not an act but a haBit"; System.out.println(str.split(" ").length); } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { String str = "we are what we repeatedly Do excellence, then, is not an act but a haBit"; Set<String> words = new HashSet(); for(String word:str.split(" ")){ if(words.contains(word)){ System.out.println(word); } else { words.add(word); } } } } | ||||
![]() | ||||
![]() ![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { String str = "we are what we repeatedly Do excellence, then, is not an act but a haBit"; for(String word:str.split(" ")){ if(word.startsWith("w")){ System.out.println(word); } } } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { String str = "we are what we repeatedly Do excellence, then, is not an act but a haBit"; for(String word:str.split(" ")){ if(word.contains("ha")){ System.out.println(word); } } } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { String str = "we are what we repeatedly Do excellence, then, is not an act but a haBit"; for(String word:str.split(" ")){ if(word.length() > 2 && word.charAt(2) == 'p'){ System.out.println(word); } } } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { String str = "we are what we repeatedly Do excellence, then, is not an act but a haBit"; for(String word:str.split(" ")){ if(word.length() > 2 && word.endsWith("it")){ System.out.println(word); } } } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. int arr[]={1,3,5,6,4,8,9,2,10}; Arrays.sort(); System.out.println(arr[arr.length-1]); | ||||
![]() | ||||
![]() ![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { String str1 = "we are what we repeatedly Do excellence, then, is not an act but a haBit"; String str2 = "we are what we repeatedly Do is"; String[] str1Words = str1.split(" "); String[] str2Words = str2.split(" "); Set str1WordsSet = new HashSet(); for(String word:str1Words){ str1WordsSet.add(word); } for(String word:str2Words){ if(str1WordsSet.contains(word)){ System.out.println(word); } } } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { String str1 = "we are what we repeatedly Do excellence, then, is not an act but a haBit"; String str2 = "we are what we repeatedly Do is"; String[] str1Words = str1.split(" "); String[] str2Words = str2.split(" "); Set str1WordsSet = new HashSet(); for(String word:str1Words){ str1WordsSet.add(word); } int commonWordsCount = 0; for(String word:str2Words){ if(str1WordsSet.contains(word)){ commonWordsCount++; } } System.out.println(commonWordsCount); } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { String str = "we are what we repeatedly Do excellence, then, is not an act but a haBit"; Set<String> wordSet = new LinkedHashSet(); // Using Linked Hash Set as we would like to retrieve words in the insertion order for(String word: str.split(" ")){ wordSet.add(word); } for(String word: wordSet){ System.out.print(word); System.out.print(" "); } } } | ||||
![]() | ||||
![]() ![]() ![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { String str = "we are what we repeatedly do excellence then is not an act but a haBit"; Set<String> wordSet = new TreeSet(); // Using Linked Hash Set as we would like to retrieve words in the insertion order for(String word: str.split(" ")){ wordSet.add(word); } for(String word: wordSet){ System.out.print(word); System.out.print(" "); } } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. Save is used to save the entity to the session whereas flush is to save the session content to DB. | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. It specifies an association fetching strategy. It could be DEFAULT, JOIN or SELECT as following @Fetch(FetchMode.SELECT) | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { System.out.println(sum(2,10)); } private static int sum(int start,int end){ if(start > end){ return 0; } else { return start + sum(start+1,end); } } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { System.out.println(multiply(2,5)); } private static int multiply(int start,int end){ if(start > end){ return 1; } else { return start * multiply(start+1,end); } } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { displayNumbersBetween(2,10); } private static void displayNumbersBetween(int start,int end){ if(start > end){ return ; } else { System.out.println(start); displayNumbersBetween(start+1,end); } } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { displayNumbersBetween(5,7); } private static void displayNumbersBetween(int start,int end){ if(start > end){ return ; } else { for(int x=1;x<=start;x++){ System.out.print("*"); } System.out.println(""); displayNumbersBetween(start+1,end); } } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { for(int x=1;x<=10;x++){ for(int y=1;y<=x;y++){ System.out.print("*"); } System.out.println(""); } } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { for(int x=1;x<=5;x++){ for(int y=1;y<=x;y++){ System.out.print("*"); } System.out.print("_"); } for(int x=5;x>=1;x--){ for(int y=1;y<=x;y++){ System.out.print("*"); } System.out.print(""); } } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { for(int x=1;x<=5;x++){ for(int y=1;y<=x;y++){ System.out.print(y); } System.out.println(" "); } } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class BuggyBread { public static void main(String args[]) { for(int x=1;x<=5;x++){ for(int y=1;y<=x;y++){ System.out.print(x); } System.out.println(" "); } } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. HashTable locks the complete collection to provide synchronization whereas ConcurrentHashMap only locks segments to achieve synchronization and hence better efficient and faster. | ||||
![]() | ||||
![]() ![]() ![]() ![]() | ||||
| ||||
Ans. Yes, they both aim at providing synchronized access to the Map collection. The only difference is in their implementation. ConcurrentHashMap came after HashTable and hence technically more efficient as it doesn't lock the complete map while accessing it. | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. OuterClass.class AND OuterClass$InnerClass.class | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. public class Class{ public static void main(String[] args){ String str = "xyz@123.com"; if(!str.contains("@") && !str.contains(".") && (str.indexOf('.') < str.indexOf('@'))){ System.out.println("Not a Valid Email Address"); } } } | ||||
![]() | ||||
![]() ![]() ![]() ![]() | ||||
| ||||
Ans. public class Class{ public static void main(String[] args){ String str = "xyz123.co@m"; if(str.indexOf('.') < str.indexOf('@')){ System.out.println("Not a Valid Email Address"); } } } | ||||
![]() | ||||
![]() ![]() ![]() | ||||
| ||||
Ans. Both are creational design patterns but singleton facilitates in creation and reuse of single object whereas Factory deals with creation of multiple objects. | ||||
![]() | ||||
![]() ![]() ![]() ![]() | ||||
![]() ![]() | ||||