JAVA Programming

Arrays:
1.public void evenNumber() {
int[] numbers = {1, 2, 3, 4, 5, 6, 7, 8, 9}; // Example array
int sum = 0;
for (int num : numbers) {
if (num % 2 == 0) { // Check if the number is even
System.out.print("Even numbers: "+num + " ");
sum = sum+num; // Add the even number to sum } }
System.out.println("\nSum of even numbers: " + sum); } output: 20

2.public void oddNumber() {

int[] numbers = {1, 2, 3, 4, 5, 6, 7, 8, 9}; // Example array
int odd = 0;
for (int num : numbers) {
if (num % 2 != 0) { // Check if the number is even
System.out.print("Old numbers: "+num + " ");
odd =odd+num; // Add the even number to sum } }
System.out.println("\nSum of Old numbers: " + odd);} output: 25

3.public void maxNumber() {

int a[]= {10,12,6,12,8,5};
int max=a[0];
int min=a[0];
for(int i=0;i<a.length;i++) {
if(max<a[i]) {
max=a[i];
}else if(a[i]!=max){
min=a[i]; } }
System.out.println(max +" "+min); } output: 12 , 5
4.public void segragate() {
int a[]= {10,3,4,6,9,2};
 for(int i=0;i<a.length;i++) {
for(int j=0;j<a.length;j++) {
if(a[i]>a[j]) {
int temp=a[i];
a[i]=a[j];
a[j]=temp;
}}}
for(int i=0;i<a.length;i++) {
System.out.print(a[i]+" ");
} } output: 10 9 6 4 3 2

5.public void sumOfTwoNumber() {

int a[]= {10,3,4,6,9,2};
for (int i = 0; i < a.length; i++) {
for (int j = i + 1; j < a.length; j++) { // Start j from i + 1 to avoid duplicate pairs and self-
pairing
if ((a[i] + a[j]) % 2 != 0) { // Check if the sum is odd
System.out.print(a[i] + " ," + a[j]+" ");
} } } } output: 10 ,3 10 ,9 3 ,4 3 ,6 3 ,2 4 ,9 6 ,9 9, 2
6. findMissingNumber:
int a[]={1,2,3,5,6};
int n=6;
int findMissingNumber(int[] arr, int n) {
int totalSum = n * (n + 1) / 2;
int arraySum = 0;
for (int num : arr) {
arraySum += num;
}
return totalSum - arraySum;}
7. public void findMissingNumber() {
// 1. Find the Missing Number
int n = 10;
int[] arr1 = {1, 2, 3, 4, 5, 6, 7, 8, 10}; // Missing number is 9
 int totalSum = n * (n + 1) / 2;
int arraySum = 0;
for (int num : arr1) {
arraySum += num;
}
System.out.println("Missing number is: " + (totalSum - arraySum));
} output: 9

8. public void maximumSubarraySum() {

int[] subArray = {-2, 1, -3, 4, -1, 2, 1, -5, 4}; // Max sum is 6
int maxSum = subArray[0];
int currentSum = subArray[0];
for (int i = 1; i < subArray.length; i++) {
currentSum = Math.max(subArray[i], currentSum + subArray[i]);
maxSum = Math.max(maxSum, currentSum);
}
System.out.println("Maximum Subarray Sum: " + maxSum);
} Output : 6
9. public void duplicateInArray() {
int[] numsDup = {4, 3, 2, 7, 8, 2, 3, 1}; // Duplicates are 2 and 3
List<Integer> duplicates = new ArrayList<>();
for (int i = 0; i < numsDup.length; i++) {
int index = Math.abs(numsDup[i]) - 1;
if (numsDup[index] < 0) {
duplicates.add(index + 1);
} else { numsDup[index] = -numsDup[index]; }
}
System.out.println("Duplicates: " + duplicates); } Output : Duplicates: [2, 3]
Prime Number: Output: True Prime Number: Output: 2 3 5 7 11 13 17 19 23 29
31 37 41 43 47
int number = 29;
int n = 50;
boolean isPrime = true;
for (int number = 2; number <= n; number++) {
if (number <= 1) {
boolean isPrime = true;
isPrime = false; }
for (int i = 2; i <= number / 2; i++) {
else {
if (number % i == 0) {
for (int i = 2; i <= number / 2; i++) {
isPrime = false;
if (number % i == 0) {
break;
isPrime = false;
}}
break;
if (isPrime) { System.out.print(number + " ");
}}}
}}}
if (isPrime) {
System.out.println(number + " is a prime
number."); }
else {
System.out.println(number + " is not a prime
number."); }

10.First Max number from arraylist

ArrayList<Integer> numbers = new ArrayList<>();
numbers.add(10);
numbers.add(25);
numbers.add(5);
numbers.add(50);
numbers.add(15); // Find the maximum number

int max = numbers.get(0); // Start with the first element

for (int i = 1; i < numbers.size(); i++) {

if (numbers.get(i) > max) {

max = numbers.get(i);
}}
System.out.println("The maximum number is: " + max); } }
10.Second Max number from arraylist
ArrayList<Integer> numbers = new ArrayList<>();
numbers.add(10);
numbers.add(25);
numbers.add(5); // Check if the list has less than two elements
if (numbers.size() < 2) { System.out.println("There must be at least two numbers in the list."); return; }
int max = numbers.get(0);
int secondMax = numbers.get(1); // Ensure max is always the larger of the two
if (max < secondMax) {
max = numbers.get(1);
secondMax = numbers.get(0); } // Loop through the list starting from the third element
for (int i = 2; i < numbers.size(); i++) {
int num = numbers.get(i);
if (num > max) {
secondMax = max; // Update secondMax to the previous max
max = num; // Update max to the current number }
else if (num > secondMax && num != max) {
secondMax = num; // Update secondMax if it's less than max but greater than the current secondMax
} } // Print the second maximum number
System.out.println("The second maximum number is: " + secondMax); } }