1.
Reverse a String
import java.util.Scanner;
public class ReverseString {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
String reversed = new StringBuilder(str).reverse().toString();
System.out.println("Reversed String: " + reversed);
}
}
Output:
Enter a string: hello
Reversed String: olleh
---
2. Check Palindrome
import java.util.Scanner;
public class PalindromeString {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
String reversed = new StringBuilder(str).reverse().toString();
if (str.equals(reversed)) {
System.out.println(str + " is a palindrome.");
} else {
System.out.println(str + " is not a palindrome.");
}
}
}
Output:
Enter a string: racecar
racecar is a palindrome.
---
3. Count Vowels in a String
import java.util.Scanner;
public class VowelCount {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
int count = 0;
for (int i = 0; i < str.length(); i++) {
char c = str.charAt(i);
if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' ||
c == 'A' || c == 'E' || c == 'I' || c == 'O' || c == 'U') {
count++;
}
}
System.out.println("Number of vowels: " + count);
}
}
Output:
Enter a string: Hello World
Number of vowels: 3
---
4. Convert String to Uppercase
import java.util.Scanner;
public class UppercaseString {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
System.out.println("Uppercase String: " + str.toUpperCase());
}
}
Output:
Enter a string: hello
Uppercase String: HELLO
---
5. Convert String to Lowercase
import java.util.Scanner;
public class LowercaseString {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
System.out.println("Lowercase String: " + str.toLowerCase());
}
}
Output:
Enter a string: HELLO
Lowercase String: hello
---
6. Find Length of a String
import java.util.Scanner;
public class StringLength {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
System.out.println("Length of the string: " + str.length());
}
}
Output:
Enter a string: hello
Length of the string: 5
---
7. Remove Whitespace from a String
import java.util.Scanner;
public class RemoveWhitespace {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
String result = str.replaceAll("\\s+", "");
System.out.println("String without whitespace: " + result);
}
}
Output:
Enter a string: hello world
String without whitespace: helloworld
---
8. Count Words in a String
import java.util.Scanner;
public class WordCount {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
String[] words = str.split("\\s+");
System.out.println("Number of words: " + words.length);
}
}
Output:
Enter a string: hello world java
Number of words: 3
---
9. Check for Even or Odd
import java.util.Scanner;
public class EvenOdd {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
if (num % 2 == 0) {
System.out.println(num + " is even.");
} else {
System.out.println(num + " is odd.");
}
}
}
Output:
Enter a number: 10
10 is even.
---
10. Reverse an Integer
import java.util.Scanner;
public class ReverseInteger {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
int reversed = 0;
while (num != 0) {
int digit = num % 10;
reversed = reversed * 10 + digit;
num /= 10;
}
System.out.println("Reversed Number: " + reversed);
}
}
Output:
Enter a number: 1234
Reversed Number: 4321
11. Sum of First N Natural Numbers
import java.util.Scanner;
public class SumOfNaturalNumbers {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int n = scanner.nextInt();
int sum = (n * (n + 1)) / 2;
System.out.println("Sum of first " + n + " natural numbers is: " + sum);
}
}
Output:
Enter a number: 5
Sum of first 5 natural numbers is: 15
---
12. Fibonacci Series
import java.util.Scanner;
public class FibonacciSeries {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of terms: ");
int terms = scanner.nextInt();
int a = 0, b = 1;
System.out.print("Fibonacci Series: ");
for (int i = 1; i <= terms; i++) {
System.out.print(a + " ");
int nextTerm = a + b;
a = b;
b = nextTerm;
}
}
}
Output:
Enter the number of terms: 6
Fibonacci Series: 0 1 1 2 3 5
---
13. Factorial of a Number
import java.util.Scanner;
public class Factorial {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
int fact = 1;
for (int i = 1; i <= num; i++) {
fact *= i;
}
System.out.println("Factorial of " + num + " is: " + fact);
}
}
Output:
Enter a number: 5
Factorial of 5 is: 120
---
14. Prime Number Check
import java.util.Scanner;
public class PrimeNumber {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
boolean isPrime = true;
for (int i = 2; i <= num / 2; i++) {
if (num % i == 0) {
isPrime = false;
break;
}
}
if (isPrime && num > 1) {
System.out.println(num + " is a prime number.");
} else {
System.out.println(num + " is not a prime number.");
}
}
}
Output:
Enter a number: 7
7 is a prime number.
---
15. Sum of Digits of a Number
import java.util.Scanner;
public class SumOfDigits {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
int sum = 0;
while (num != 0) {
sum += num % 10;
num /= 10;
}
System.out.println("Sum of digits: " + sum);
}
}
Output:
Enter a number: 1234
Sum of digits: 10
---
16. Multiplication Table of a Number
import java.util.Scanner;
public class MultiplicationTable {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
System.out.println("Multiplication table of " + num + ":");
for (int i = 1; i <= 10; i++) {
System.out.println(num + " x " + i + " = " + (num * i));
}
}
}
Output:
Enter a number: 5
Multiplication table of 5:
5x1=5
5 x 2 = 10
5 x 3 = 15
5 x 4 = 20
5 x 5 = 25
5 x 6 = 30
5 x 7 = 35
5 x 8 = 40
5 x 9 = 45
5 x 10 = 50
---
17. Armstrong Number
import java.util.Scanner;
public class ArmstrongNumber {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
int originalNum = num;
int result = 0;
int n = String.valueOf(num).length();
while (num != 0) {
int digit = num % 10;
result += Math.pow(digit, n);
num /= 10;
}
if (result == originalNum) {
System.out.println(originalNum + " is an Armstrong number.");
} else {
System.out.println(originalNum + " is not an Armstrong number.");
}
}
}
Output:
Enter a number: 153
153 is an Armstrong number.
---
18. Sum of Even Numbers in a Range
import java.util.Scanner;
public class SumOfEvenNumbers {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a range (start and end): ");
int start = scanner.nextInt();
int end = scanner.nextInt();
int sum = 0;
for (int i = start; i <= end; i++) {
if (i % 2 == 0) {
sum += i;
}
}
System.out.println("Sum of even numbers between " + start + " and " + end + " is: " + sum);
}
}
Output:
Enter a range (start and end): 1 10
Sum of even numbers between 1 and 10 is: 30
---
19. Sum of Odd Numbers in a Range
import java.util.Scanner;
public class SumOfOddNumbers {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a range (start and end): ");
int start = scanner.nextInt();
int end = scanner.nextInt();
int sum = 0;
for (int i = start; i <= end; i++) {
if (i % 2 != 0) {
sum += i;
}
}
System.out.println("Sum of odd numbers between " + start + " and " + end + " is: " + sum);
}
}
Output:
Enter a range (start and end): 1 10
Sum of odd numbers between 1 and 10 is: 25
---
20. Prime Numbers in a Range
import java.util.Scanner;
public class PrimeNumbersInRange {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a range (start and end): ");
int start = scanner.nextInt();
int end = scanner.nextInt();
System.out.println("Prime numbers between " + start + " and " + end + " are:");
for (int num = start; num <= end; num++) {
boolean isPrime = true;
for (int i = 2; i <= num / 2; i++) {
if (num % i == 0) {
isPrime = false;
break;
}
}
if (isPrime && num > 1) {
System.out.print(num + " ");
}
}
}
}
Output:
Enter a range (start and end): 1 20
Prime numbers between 1 and 20 are:
2 3 5 7 11 13 17 19
—
Great! Let's continue with more programs to complete the list of 50.
---
16. Loops and Number Patterns
16. Pyramid Pattern
import java.util.Scanner;
public class PyramidPattern {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of rows: ");
int rows = scanner.nextInt();
for (int i = 1; i <= rows; i++) {
for (int j = i; j < rows; j++) {
System.out.print(" ");
}
for (int k = 1; k <= (2 * i - 1); k++) {
System.out.print("*");
}
System.out.println();
}
}
}
Output:
Enter the number of rows: 5
*
***
*****
*******
*********
17. Number Triangle
import java.util.Scanner;
public class NumberTriangle {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of rows: ");
int rows = scanner.nextInt();
for (int i = 1; i <= rows; i++) {
for (int j = 1; j <= i; j++) {
System.out.print(j + " ");
}
System.out.println();
}
}
}
Output:
Enter the number of rows: 4
1
12
123
1234
18. Inverted Triangle
import java.util.Scanner;
public class InvertedTriangle {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of rows: ");
int rows = scanner.nextInt();
for (int i = rows; i >= 1; i--) {
for (int j = 1; j <= i; j++) {
System.out.print("* ");
}
System.out.println();
}
}
}
Output:
Enter the number of rows: 5
*****
****
***
**
*
19. Diamond Pattern
import java.util.Scanner;
public class DiamondPattern {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of rows: ");
int rows = scanner.nextInt();
int n = rows / 2;
for (int i = 1; i <= rows; i++) {
for (int j = 1; j <= Math.abs(n); j++) {
System.out.print(" ");
}
for (int k = 1; k <= (2 * n - 1); k++) {
System.out.print("*");
}
n++;
System.out.println();
}
}
}
Output:
Enter the number of rows: 5
*
***
*****
***
*
---
20. Sum of Even Numbers
import java.util.Scanner;
public class SumEvenNumbers {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the limit: ");
int limit = scanner.nextInt();
int sum = 0;
for (int i = 2; i <= limit; i += 2) {
sum += i;
}
System.out.println("Sum of even numbers up to " + limit + " is: " + sum);
}
}
Output:
Enter the limit: 10
Sum of even numbers up to 10 is: 30
21. Sum of Odd Numbers
import java.util.Scanner;
public class SumOddNumbers {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the limit: ");
int limit = scanner.nextInt();
int sum = 0;
for (int i = 1; i <= limit; i += 2) {
sum += i;
}
System.out.println("Sum of odd numbers up to " + limit + " is: " + sum);
}
}
Output:
Enter the limit: 10
Sum of odd numbers up to 10 is: 25
22. Average of Numbers
import java.util.Scanner;
public class AverageNumbers {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of terms: ");
int terms = scanner.nextInt();
int sum = 0;
System.out.println("Enter the numbers: ");
for (int i = 1; i <= terms; i++) {
sum += scanner.nextInt();
}
double average = sum / (double) terms;
System.out.println("Average of the entered numbers is: " + average);
}
}
Output:
Enter the number of terms: 4
Enter the numbers:
1234
Average of the entered numbers is: 2.5
---
23. Check for Perfect Square
import java.util.Scanner;
public class PerfectSquare {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
double sqrt = Math.sqrt(num);
if (sqrt == (int) sqrt) {
System.out.println(num + " is a perfect square.");
} else {
System.out.println(num + " is not a perfect square.");
}
}
}
Output:
Enter a number: 16
16 is a perfect square.
24. Armstrong Number for n Digits
import java.util.Scanner;
public class ArmstrongNDigits {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
int temp = num, sum = 0, digits = 0;
while (temp != 0) {
temp /= 10;
digits++;
}
temp = num;
while (temp != 0) {
int digit = temp % 10;
sum += Math.pow(digit, digits);
temp /= 10;
}
if (sum == num) {
System.out.println(num + " is an Armstrong number.");
} else {
System.out.println(num + " is not an Armstrong number.");
}
}
}
Output:
Enter a number: 153
153 is an Armstrong number.
—
25. Sum of Digits
import java.util.Scanner;
public class SumOfDigits {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
int sum = 0;
while (num != 0) {
sum += num % 10;
num /= 10;
}
System.out.println("Sum of digits: " + sum);
}
}
Output:
Enter a number: 123
Sum of digits: 6
---
26. Swap Two Numbers
import java.util.Scanner;
public class SwapNumbers {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter first number: ");
int num1 = scanner.nextInt();
System.out.print("Enter second number: ");
int num2 = scanner.nextInt();
int temp = num1;
num1 = num2;
num2 = temp;
System.out.println("After swapping: First number = " + num1 + ", Second number = " +
num2);
}
}
Output:
Enter first number: 5
Enter second number: 10
After swapping: First number = 10, Second number = 5
---
27. Check Leap Year
import java.util.Scanner;
public class LeapYear {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a year: ");
int year = scanner.nextInt();
if ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0)) {
System.out.println(year + " is a leap year.");
} else {
System.out.println(year + " is not a leap year.");
}
}
}
Output:
Enter a year: 2020
2020 is a leap year.
---
28. Find Maximum of Three Numbers
import java.util.Scanner;
public class MaxOfThree {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter first number: ");
int num1 = scanner.nextInt();
System.out.print("Enter second number: ");
int num2 = scanner.nextInt();
System.out.print("Enter third number: ");
int num3 = scanner.nextInt();
int max = num1;
if (num2 > max) max = num2;
if (num3 > max) max = num3;
System.out.println("Maximum number is: " + max);
}
}
Output:
Enter first number: 4
Enter second number: 9
Enter third number: 2
Maximum number is: 9
---
29. Print Fibonacci Series
import java.util.Scanner;
public class FibonacciSeries {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of terms: ");
int terms = scanner.nextInt();
int a = 0, b = 1;
System.out.print("Fibonacci Series: ");
for (int i = 1; i <= terms; i++) {
System.out.print(a + " ");
int next = a + b;
a = b;
b = next;
}
}
}
Output:
Enter the number of terms: 6
Fibonacci Series: 0 1 1 2 3 5
---
30. Check Prime Number
import java.util.Scanner;
public class PrimeNumber {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
boolean isPrime = true;
for (int i = 2; i <= num / 2; i++) {
if (num % i == 0) {
isPrime = false;
break;
}
}
if (isPrime && num > 1) {
System.out.println(num + " is a prime number.");
} else {
System.out.println(num + " is not a prime number.");
}
}
}
Output:
Enter a number: 7
7 is a prime number.
---
31. Sum of First N Natural Numbers
import java.util.Scanner;
public class SumOfNaturalNumbers {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
int sum = num * (num + 1) / 2;
System.out.println("Sum of first " + num + " natural numbers is: " + sum);
}
}
Output:
Enter a number: 5
Sum of first 5 natural numbers is: 15
---
32. Find Factorial of a Number
import java.util.Scanner;
public class Factorial {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
int fact = 1;
for (int i = 1; i <= num; i++) {
fact *= i;
}
System.out.println("Factorial of " + num + " is: " + fact);
}
}
Output:
Enter a number: 5
Factorial of 5 is: 120
---
33. Reverse an Array
import java.util.Scanner;
public class ReverseArray {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of elements: ");
int n = scanner.nextInt();
int[] arr = new int[n];
System.out.println("Enter the elements:");
for (int i = 0; i < n; i++) {
arr[i] = scanner.nextInt();
}
System.out.print("Reversed Array: ");
for (int i = n - 1; i >= 0; i--) {
System.out.print(arr[i] + " ");
}
}
}
Output:
Enter the number of elements: 5
Enter the elements:
12345
Reversed Array: 5 4 3 2 1
---
34. Print Multiplication Table
import java.util.Scanner;
public class MultiplicationTable {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
System.out.println("Multiplication Table of " + num + ":");
for (int i = 1; i <= 10; i++) {
System.out.println(num + " x " + i + " = " + (num * i));
}
}
}
Output:
Enter a number: 5
Multiplication Table of 5:
5x1=5
5 x 2 = 10
5 x 3 = 15
5 x 4 = 20
5 x 5 = 25
5 x 6 = 30
5 x 7 = 35
5 x 8 = 40
5 x 9 = 45
5 x 10 = 50
---
35. Reverse a String
import java.util.Scanner;
public class ReverseString {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
String reversed = new StringBuilder(str).reverse().toString();
System.out.println("Reversed String: " + reversed);
}
}
Output:
Enter a string: Hello
Reversed String: olleH
---
36. Check Palindrome
import java.util.Scanner;
public class PalindromeString {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
String reversed = new StringBuilder(str).reverse().toString();
if (str.equals(reversed)) {
System.out.println(str + " is a palindrome.");
} else {
System.out.println(str + " is not a palindrome.");
}
}
}
Output:
Enter a string: madam
madam is a palindrome.
---
37. Count Vowels in a String
import java.util.Scanner;
public class VowelCount {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
int count = 0;
for (int i = 0; i < str.length(); i++) {
char c = str.charAt(i);
if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' ||
c == 'A' || c == 'E' || c == 'I' || c == 'O' || c == 'U') {
count++;
}
}
System.out.println("Number of vowels: " + count);
}
}
Output:
Enter a string: hello
Number of vowels: 2
---
38. Convert String to Uppercase
import java.util.Scanner;
public class UppercaseString {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
System.out.println("Uppercase String: " + str.toUpperCase());
}
}
Output:
Enter a string: hello
Uppercase String: HELLO
---
39. Convert String to Lowercase
import java.util.Scanner;
public class LowercaseString {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
System.out.println("Lowercase String: " + str.toLowerCase());
}
}
Output:
Enter a string: HELLO
Lowercase String: hello
---
40. Find Length of a String
import java.util.Scanner;
public class StringLength {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
System.out.println("Length of the string: " + str.length());
}
}
Output:
Enter a string: hello
Length of the string: 5
---
41. Remove Whitespace from a String
import java.util.Scanner;
public class RemoveWhitespace {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
String result = str.replaceAll("\\s+", "");
System.out.println("String without whitespace: " + result);
}
}
Output:
Enter a string: Hello World
String without whitespace: HelloWorld
---
42. Count Words in a String
import java.util.Scanner;
public class WordCount {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = scanner.nextLine();
String[] words = str.split("\\s+");
System.out.println("Number of words: " + words.length);
}
}
Output:
Enter a string: Hello World
Number of words: 2
---
43. Check for Even or Odd
import java.util.Scanner;
public class EvenOdd {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
if (num % 2 == 0) {
System.out.println(num + " is even.");
} else {
System.out.println(num + " is odd.");
}
}
}
Output:
Enter a number: 7
7 is odd.
---
44. Reverse an Integer
import java.util.Scanner;
public class ReverseInteger {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int num = scanner.nextInt();
int reversed = 0;
while (num != 0) {
int digit = num % 10;
reversed = reversed * 10 + digit;
num /= 10;
}
System.out.println("Reversed Number: " + reversed);
}
}
Output:
Enter a number: 1234
Reversed Number: 4321
---
45. Sum of Even Numbers in Array
import java.util.Scanner;
public class SumEvenArray {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the size of the array: ");
int size = scanner.nextInt();
int[] arr = new int[size];
System.out.println("Enter array elements:");
for (int i = 0; i < size; i++) {
arr[i] = scanner.nextInt();
}
int sum = 0;
for (int i = 0; i < size; i++) {
if (arr[i] % 2 == 0) {
sum += arr[i];
}
}
System.out.println("Sum of even numbers: " + sum);
}
}
Output:
Enter the size of the array: 5
Enter array elements:
12345
Sum of even numbers: 6
---
46. Print Array Elements
import java.util.Scanner;
public class PrintArray {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the size of the array: ");
int size = scanner.nextInt();
int[] arr = new int[size];
System.out.println("Enter array elements:");
for (int i = 0; i < size; i++) {
arr[i] = scanner.nextInt();
}
System.out.print("Array elements: ");
for (int i = 0; i < size; i++) {
System.out.print(arr[i] + " ");
}
}
}
Output:
Enter the size of the array: 3
Enter array elements:
123
Array elements: 1 2 3
---
47. Find Minimum Number in Array
import java.util.Scanner;
public class MinArray {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the size of the array: ");
int size = scanner.nextInt();
int[] arr = new int[size];
System.out.println("Enter array elements:");
for (int i = 0; i < size; i++) {
arr[i] = scanner.nextInt();
}
int min = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] < min) {
min = arr[i];
}
}
System.out.println("Minimum element in the array: " + min);
}
}
Output:
Enter the size of the array: 4
Enter array elements:
10 2 34 5
Minimum element in the array: 2
48. Find Maximum Number in Array
import java.util.Scanner;
public class MaxArray {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the size of the array: ");
int size = scanner.nextInt();
int[] arr = new int[size];
System.out.println("Enter array elements:");
for (int i = 0; i < size; i++) {
arr[i] = scanner.nextInt();
}
int max = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
System.out.println("Maximum element in the array: " + max);
}
}
Output Example:
Enter the size of the array: 4
Enter array elements:
10 2 34 5
Maximum element in the array: 34
---
49. Sum of Odd Numbers in Array
import java.util.Scanner;
public class SumOddArray {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the size of the array: ");
int size = scanner.nextInt();
int[] arr = new int[size];
System.out.println("Enter array elements:");
for (int i = 0; i < size; i++) {
arr[i] = scanner.nextInt();
}
int sum = 0;
for (int i = 0; i < size; i++) {
if (arr[i] % 2 != 0) {
sum += arr[i];
}
}
System.out.println("Sum of odd numbers: " + sum);
}
}
Output:
Enter the size of the array: 5
Enter array elements:
12345
Sum of odd numbers: 9
---
50. Find Second Largest Element in Array
import java.util.Scanner;
import java.util.Arrays;
public class SecondLargestArray {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the size of the array: ");
int size = scanner.nextInt();
int[] arr = new int[size];
System.out.println("Enter array elements:");
for (int i = 0; i < size; i++) {
arr[i] = scanner.nextInt();
}
Arrays.sort(arr);
System.out.println("Second largest element: " + arr[size - 2]);
}
}
Output:
Enter the size of the array: 5
Enter array elements:
12 45 23 78 56
Second largest element: 56
