Scribd
Upload
3 views5 pages

Java Interview Programs

The document contains various Java code snippets demonstrating algorithms for common programming tasks such as checking for palindromes, generating Fibonacci series, calculating factorials, identifying Armstrong numbers, checking for prime numbers, reversing numbers and strings, checking for anagrams, counting vowels and consonants, removing duplicates from strings, finding the largest and smallest elements in an array, sorting an array, and finding the second largest element. Each code snippet includes the logic and expected output. These examples serve as practical implementations of fundamental programming concepts.

Uploaded by

virat.kohli.vk0000000018
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views5 pages

Java Interview Programs

The document contains various Java code snippets demonstrating algorithms for common programming tasks such as checking for palindromes, generating Fibonacci series, calculating factorials, identifying Armstrong numbers, checking for prime numbers, reversing numbers and strings, checking for anagrams, counting vowels and consonants, removing duplicates from strings, finding the largest and smallest elements in an array, sorting an array, and finding the second largest element. Each code snippet includes the logic and expected output. These examples serve as practical implementations of fundamental programming concepts.

Uploaded by

virat.kohli.vk0000000018
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Palindrome Number

int num = 121, rev = 0, temp = num;

while (temp != 0) {

int digit = temp % 10;

rev = rev * 10 + digit;

temp /= 10;

System.out.println(num == rev ? "Palindrome" : "Not Palindrome");

Output: Palindrome

Fibonacci Series

int n = 10, a = 0, b = 1;

System.out.print(a + " " + b);

for (int i = 2; i < n; i++) {

int c = a + b;

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

a = b;

b = c;

Output: 0 1 1 2 3 5 8 13 21 34

Factorial

int num = 5, fact = 1;

for (int i = 1; i <= num; i++) {

fact *= i;

System.out.println("Factorial: " + fact);

Output: Factorial: 120

Armstrong Number

int num = 153, sum = 0, temp = num;

while (temp != 0) {

int digit = temp % 10;

sum += digit * digit * digit;


temp /= 10;

System.out.println(num == sum ? "Armstrong" : "Not Armstrong");

Output: Armstrong

Prime Number Check

int num = 29, count = 0;

for (int i = 2; i <= num / 2; i++) {

if (num % i == 0) {

count++;

break;

System.out.println((count == 0) ? "Prime" : "Not Prime");

Output: Prime

Reverse a Number

int num = 1234, rev = 0;

while (num != 0) {

rev = rev * 10 + num % 10;

num /= 10;

System.out.println("Reversed: " + rev);

Output: Reversed: 4321

Reverse a String

String str = "hello", rev = "";

for (int i = str.length() - 1; i >= 0; i--)

rev += str.charAt(i);

System.out.println("Reversed: " + rev);

Output: Reversed: olleh

Check Anagram

String str1 = "listen", str2 = "silent";


char[] a = str1.toCharArray();

char[] b = str2.toCharArray();

Arrays.sort(a);

Arrays.sort(b);

System.out.println(Arrays.equals(a, b) ? "Anagram" : "Not Anagram");

Output: Anagram

Count Vowels and Consonants

String str = "Hello World";

int vowels = 0, consonants = 0;

str = str.toLowerCase();

for (char c : str.toCharArray()) {

if (c >= 'a' && c <= 'z') {

if ("aeiou".indexOf(c) != -1)

vowels++;

else

consonants++;

System.out.println("Vowels: " + vowels + ", Consonants: " + consonants);

Output: Vowels: 3, Consonants: 7

Remove Duplicates from String

String str = "programming";

String result = "";

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

if (!result.contains(String.valueOf(str.charAt(i))))

result += str.charAt(i);

System.out.println("After removing duplicates: " + result);

Output: After removing duplicates: progamin

Find Largest and Smallest Element

int[] arr = {4, 2, 8, 1, 9};


int min = arr[0], max = arr[0];

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

if (arr[i] < min) min = arr[i];

if (arr[i] > max) max = arr[i];

System.out.println("Min: " + min + ", Max: " + max);

Output: Min: 1, Max: 9

Sort an Array

int[] arr = {5, 1, 4, 2, 8};

for (int i = 0; i < arr.length - 1; i++) {

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

if (arr[i] > arr[j]) {

int temp = arr[i];

arr[i] = arr[j];

arr[j] = temp;

System.out.print("Sorted: ");

for (int i : arr) System.out.print(i + " ");

Output: Sorted: 1 2 4 5 8

Second Largest Element

int[] arr = {5, 1, 9, 6, 2};

int first = Integer.MIN_VALUE, second = Integer.MIN_VALUE;

for (int num : arr) {

if (num > first) {

second = first;

first = num;

} else if (num > second && num != first) {

second = num;

}
System.out.println("Second Largest: " + second);

Output: Second Largest: 6

You might also like