\n
This will print the outputString which will be the reverse of the given inputString.<\/p>\n
Question 2:\u00a0 Write a Java Program to swap two given Strings<\/h3>\n
Solution 2.<\/strong> As asked in the above question, for swapping of two strings we need to use the substring method of the String class in Java.
Substring method returns part of the string. <\/p>\nWe have the start index and end index in the substring method where
start index is inclusive and end index is exclusive.<\/p>\n
Below is the Java Program to swap two Strings.<\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
package JavaInterviewQuestions;<\/p>\n
public class StringSwapExample {<\/p>\n
public static void main(String[] args) {<\/p>\n
\/\/ Take two string s1 and s2 which we need to swap.
String s1 = “Rahul”;
String s2 = “Shetty”;<\/p>\n
\/\/ Combine both the strings s1 and s2 using the concatenation(+) operator
s1 = s1 + s2;<\/p>\n
\/\/ Use the substring method to get the subset of the combined string
s2 = s1.substring(0, s1.length() – s2.length());
s1 = s1.substring(s2.length());<\/p>\n
System.out.println(“s1 =” + s1);
System.out.println(“s2 =” + s2);<\/p>\n
}<\/p>\n
}<\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
The above program will swap the two Strings s1 and s2.<\/p>\n
Question 3: Write a Java Program to print the Fibonacci Series.<\/h3>\n
Solution 3.<\/strong> As we know Fibonacci series is a series of numbers in which each number is the sum of the two preceding numbers.<\/p>\nFor writing a Java Program, first we declare an array and assign the values 0 and 1 to the indexes 0 and 1 of the defined array.
Then we write the logic to get the values of all the indexes of the total Fibonacci series length.<\/p>\n
Below the java program to print the Fibonacci series.<\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
package JavaInterviewQuestions;<\/p>\n
import java.util.Scanner;<\/p>\n
public class FibonacciSeriesExample {<\/p>\n
public static void main(String[] args) {<\/p>\n
int fiblength;<\/p>\n
\/\/ Use scanner class to get the user input.
Scanner sc = new Scanner(System.in);
System.out.println(“Enter the number : “);
fiblength = sc.nextInt();<\/p>\n
int[] num = new int[fiblength];
\/\/ Assign values 0 and 1 to the 0 and 1 indices of the defined array
num[0] = 0;
num[1] = 1;<\/p>\n
\/\/ Logic for getting the values of all the indices of the array using for loop
for (int i = 2; i < fiblength; i++) {
num[i] = num[i – 1] + num[i – 2];
}<\/p>\n
System.out.print(“fibonacci series: “);
\/\/ Printing the fibonacci series
for (int i = 0; i < fiblength; i++) {
System.out.print(num[i] + ” “);
}<\/p>\n
}<\/p>\n
}<\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
The above program will print the Fibonacci series upto the total length i.e. fiblength entered by the user.<\/p>\n
Question 4: Write a Java Program to check if a number is Armstrong number or not.<\/h3>\n
Solution 4:<\/strong> An Armstrong Number is a number in which the sum of the cubes of each digit is equal to the number itself. For ex:<\/p>\n\u00a0371 = 3*3*3 + 7*7*7 + 1*1*1<\/strong><\/em><\/p>\nThe sum of the cubes is 3,7,1 is equal to 371.Another example is 153 which is an Armstrong number. You can explore other numbers too!!!<\/p>\n
Below is the Java Program to check the number is Armstrong or not.<\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
package JavaInterviewQuestions;<\/p>\n
public class CheckArmstrongNumberExample {<\/p>\n
public static void main(String[] args) {<\/p>\n
int num = 371;
int actualnum = num;
double result = 0;<\/p>\n
while (actualnum != 0) {
int n = actualnum % 10;
result = result + Math.pow(n, 3);
actualnum = actualnum \/ 10;
}<\/p>\n
if (result == num) {
System.out.println(num + ” is an Armstrong number”);
} else {
System.out.println(num + ” is not an Armstrong number”);
}<\/p>\n
}<\/p>\n
}<\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
The above program would give the output whether a number is Armstrong number.<\/p>\n
Question 5: Write a Java Program to print the sum of digits of a given integer.<\/h3>\n
Solution 5:<\/strong> We can solve the question using a while loop. Using the % operator we get the remainder and keep adding to the sum variable until the number becomes 0. The total sum will be the total of all the digits of the given integer.<\/p>\nBelow is the java program :<\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
package JavaInterviewQuestions;<\/p>\n
public class SumDigitsExample {<\/p>\n
public static int getSumOfAllDigits(int num) {<\/p>\n
\/\/ Declare variable sum which will store the sum of all digits.
int sum = 0;<\/p>\n
\/\/ Run a while loop until the num becomes 0.
while (num != 0) {
int rem = num % 10;
sum = sum + rem;
num = num \/ 10;
}
return sum;<\/p>\n
}<\/p>\n
public static void main(String[] args) {<\/p>\n
\/\/ We can pass any integer value of whose sum of the digits is required.
System.out.println(getSumOfAllDigits(549));
}<\/p>\n
}<\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
The above program will print the sum of all digits in the console. In the above case, as the input value is 549
the output returned will be 18.<\/p>\n
Question 6: Write a Java Program to check if a number is Prime or not.<\/h3>\n
Solution 6. <\/strong>A prime number is a number which is divisible by 1 and itself. This problem can be solved by a simple for loop and we check the condition that the given number returns a remainder value.<\/p>\nIf the remainder is 0, then the number is not prime. Else its a prime number.<\/p>\n
Below is the Java Program:<\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
package JavaInterviewQuestions;<\/p>\n
public class PrimeNumberExample {<\/p>\n
public static boolean isPrime(int num) {
\/\/ Validate that the number is neither less than 1 nor equal to 1.
\/\/ It should return false as it cannot be a prime number
if (num <= 1)
return false;<\/p>\n
\/\/ Logic to check if a number is prime or not. If its Prime, returns true else
\/\/ return false
for (int i = 2; i < num; i++) {
if (num % i == 0) {
return false;
}
}<\/p>\n
return true;<\/p>\n
}<\/p>\n
public static void main(String[] args) {
\/\/ Pass the integer value to check whether it is prime or not.
System.out.println(isPrime(8));<\/p>\n
}<\/p>\n
}<\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
The above program will return false as 8 is not a prime number.<\/p>\n
Question 7:\u00a0 Write a Java Program to count the number of characters in a given String.<\/h3>\n
Solution 7: <\/strong>We can use hashmap for counting the number of each character in the given string.
We create hashmap object to store each character as key and the total count of characters as its value.<\/p>\nThen we print the hashmap object.<\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
package JavaInterviewQuestions;<\/p>\n
import java.util.HashMap;<\/p>\n
public class CountNumOfCharsInStringExample {<\/p>\n
static void characterCount(String inputString) {<\/p>\n
\/\/ Creating a hashmap object.
HashMap<Character, Integer> hash_map = new HashMap<>();
char[] strArray = inputString.toCharArray();<\/p>\n
for (char c : strArray) {
if (hash_map.containsKey(c)) {
hash_map.put(c, hash_map.get(c) + 1);
}<\/p>\n
else {
hash_map.put(c, 1);
}<\/p>\n
}
\/\/ Print the hashmap object which gives the number of each character in String.
System.out.println(hash_map);<\/p>\n
}<\/p>\n
public static void main(String[] args) {
\/\/ Input value which needs to be passed in the below method.
characterCount(“rahulshettyacademy”);<\/p>\n
}<\/p>\n
}<\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
In the above program as we are printing the hashmap object, it will print each character with the total number of count in the console.<\/p>\n
Question 8: Write a Java Program to find the duplicates of a given String.<\/h3>\n
Solution 8: <\/strong>HashMap is used to store elements in the form of key value pairs. We create a hashmap object and store each character as key
and the total count of each character as value.<\/p>\nThen we check the keys whose values are more than 1 using the keySet() method. Thus we get the duplicates in the given String.<\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
package JavaInterviewQuestions;<\/p>\n
import java.util.HashMap;
import java.util.Set;<\/p>\n
public class DuplicateCharsInStringExample {<\/p>\n
static void duplicateChars(String inputString) {<\/p>\n
\/\/ Creating a hashmap object.
HashMap<Character, Integer> hash_map = new HashMap<>();
char[] strArray = inputString.toCharArray();<\/p>\n
for (char c : strArray) {
if (hash_map.containsKey(c)) {
hash_map.put(c, hash_map.get(c) + 1);
}<\/p>\n
else {
hash_map.put(c, 1);
}<\/p>\n
}
\/\/ Store the key values in a set and then get the number of each duplicate character.
Set<Character> keys = hash_map.keySet();
for (char c : keys) {
if (hash_map.get(c) > 1) {
System.out.println(c + “–>” + hash_map.get(c));
}
}<\/p>\n
}<\/p>\n
public static void main(String[] args) {
\/\/ Input value which needs to be passed in the below method.
duplicateChars(“rahulshettyacademy”);<\/p>\n
}<\/p>\n
}<\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
The above program will print all the duplicates in the given String in the console.
\u00a0The output would be :<\/strong>\u00a0<\/p>\na–>3
t–>2
e–>2
h–>2
y–>2<\/p>\n
Question 9: Write a Java Program for swapping of 2 numbers.<\/h3>\n
Solution 9:<\/strong> In this problem , we would be given two numbers as input. We need to swap those 2 numbers which can be done a simple logic. <\/p>\nBelow is the java program.<\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
package JavaInterviewQuestions;<\/p>\n
public class SwapNumbersExample {<\/p>\n
public static void main(String[] args) {<\/p>\n
int num1 = 10;
int num2 = 20;<\/p>\n
\/\/ Logic to swap 2 numbers.
num1 = num1 + num2;
num2 = num1 – num2;
num1 = num1 – num2;<\/p>\n
System.out.println(“num1 = ” + num1);
System.out.println(“num2 = ” + num2);
}<\/p>\n
}<\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
The above program would swap the two integer values num1 and num2.<\/p>\n
Question 10: Write a Java Program to reverse an array?<\/h3>\n
Solution 10:<\/strong> In this problem, we are given an array of characters as input. This problem can be solved by writing a while loop.<\/p>\nBy using a third variable, we reverse the array as below.<\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
package JavaInterviewQuestions;<\/p>\n
public class ReverseAnArray {<\/p>\n
public static void main(String[] args) {<\/p>\n
char[] s = { ‘a’, ‘b’, ‘c’, ‘d’, ‘e’ };<\/p>\n
int right = s.length – 1;
int left = 0;<\/p>\n
while (left < right) {
char c = s[left];
s[left] = s[right];
s[right] = c;<\/p>\n
\/\/ Increment the left by 1 and Decrement the right by 1
left += 1;
right -= 1;
}<\/p>\n
for (int i = 0; i < s.length; i++) {
System.out.print(s[i] + ” “);
}<\/p>\n
}<\/p>\n
}<\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
The above program gives the output: e d c b a. Thus reverse the array.<\/p>\n
Question 11: Write a Java Program to get the count of Capitalized words in a String.<\/h3>\n
Solution 11: <\/strong>\u00a0Capitalized words in a given String which are those words which starts with a Capital Letter.
We need the total count of these words. This problem can be solved by using a for loop and iterate through each character in the String.\u00a0<\/p>\nWe also take a counter variable and increment it when any Capital character is encountered.<\/p>\n<\/div>\n
\n
<\/div>\n
\n
\n
package JavaInterviewQuestions;<\/p>\n
public class CountCapitalizedWordsInString {<\/p>\n
public static int getCapsWordsInString(String inputString) {<\/p>\n
int counter = 0;
for(int i = 0; i < inputString.length(); i++) {
if(inputString.charAt(i) >= ‘A’ && inputString.charAt(i) <= ‘Z’) {
counter++;
}
}
return counter;
}<\/p>\n
public static void main(String[] args) {
System.out.println(getCapsWordsInString(“RahulShettyAcademy”));
}<\/p>\n
}<\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
The above program will return the total count of Capitalized String i.e. 3.<\/p>\n
Question 12: Write a Java Program to find the longest consecutive occurrence of integers in a given array.<\/h3>\n
Solution 12: <\/strong>In this problem, we need to find the length of the longest consecutive occurrence.
As given in the array below, we have an array of integers. As you can see the longest consecutive occurrence of integers are 6,7,8,9. There is a consecutive increment of 1 . So the output will be 4.<\/p>\n<\/div>\n\n
<\/div>\n
\n
\n
package JavaInterviewQuestions;<\/p>\n
public class LongestConsecutiveOccurenceExample {<\/p>\n
public static void main(String[] args) {<\/p>\n
int[] arr = { 4, 3, 25, 6, 7, 8, 9, 2, 3, 10 };<\/p>\n
int count = 0;
int max =0;<\/p>\n
for(int i = 0; i < arr.length-1; i++) {
if(arr[i] +1== arr[i+1]) {
count++;
}else {
count = 0;
}<\/p>\n
max = Math.max(max, count+1);
}
System.out.println(max);
}<\/p>\n
}<\/p>\n<\/div>\n<\/div>\n<\/div>\n
\n
The above program will give the output as 4. We use the Math.max() to obtain the maximum value between the max and the counter variable.<\/p>\n<\/div>\n<\/div>\n<\/div>\n
<\/div>\n<\/section>\n
<\/body><\/html><\/p>\n","protected":false},"excerpt":{"rendered":"
Table of Contents Question 1: Write a Java Program to reverse a String. Question 2:\u00a0 Write a Java Program to swap two given Strings Question 3: Write a Java Program to print the Fibonacci Series. Question 4: Write a Java Program to check if a number is Armstrong number or not. Question 5: Write a […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4,5],"tags":[],"class_list":["post-994","post","type-post","status-publish","format-standard","hentry","category-interview-questions","category-java","post-wrapper","thrv_wrapper"],"_links":{"self":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/posts\/994","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/comments?post=994"}],"version-history":[{"count":0,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/posts\/994\/revisions"}],"wp:attachment":[{"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/media?parent=994"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/categories?post=994"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/rahulshettyacademy.com\/blog\/index.php\/wp-json\/wp\/v2\/tags?post=994"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}