Armstrong Number (3 digit)
import [Link].*;
public class Main
{
public static void main(String[] args) {
Scanner sc=new Scanner([Link]);
[Link]("Enter the Number for Armstrong:");
int no=[Link](),sum=0,k=no;
while(no!=0){
int rem=no%10;
sum=sum+rem*rem*rem;
no=no/10;
}
if(k==sum){
[Link]("Armstrong No:"+sum);
}else{
[Link]("Not Armstrong No:"+sum);
}}}
Pattern Printing
public class Pattern {
public static void main(String[] args) {
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
[Link](j);
}
[Link]();
}
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; j <= i; j++) {
[Link](j);
}
[Link]();
}}}
Find missing number
import [Link].*;
public class MissingNumbers {
public static void main(String[] args) {
int[] arr = {1, 2, 4, 5, 7, 8, 9, 11, 12};
List<Integer> missing = new ArrayList<>();
int start = arr[0];
int end = arr[[Link] - 1];
for (int i = start; i <= end; i++) {
boolean found = false;
for (int num : arr) {
if (num == i) {
found = true;
break;
}}
if (!found) {
[Link](i);
}}
[Link]("Missing numbers: ");
for (int num : missing) {
[Link](num + " ");
}}}
Remove duplicates from an array
import [Link].*;
public class MissingNumbers {
public static void main(String[] args) {
int[] arr = {1, 2, 4, 5, 7, 8, 9, 11, 12};
List<Integer> missing = new ArrayList<>();
int start = arr[0];
int end = arr[[Link] - 1];
for(int i=start;i<=end;i++){
boolean isfound=false;
for(int nums:arr){
if(nums==i){
isfound=true; }}
if(!isfound){
[Link](i);
}}
[Link]("Missing numbers: ");
for (int num : missing) {
[Link](num + " ");
}}}
Check frequency of each element in an array.
public class Main {
public static void main(String[] args) {
int[] arr = {1, 3, 4, 4, 5};
for (int i = 0; i < [Link]; i++) {
for (int j = i + 1; j < [Link]; j++) {
if (arr[i] == arr[j]) {
[Link]("Duplicate: " + arr[i]);
}}}}
public class Main {
public static void main(String[] args) {
int[] arr = {1, 3, 4, 4, 5};
int[] freq = new int[[Link]];
int vi = -1;
for (int i = 0; i < [Link]; i++) {
int count = 1;
if (freq[i] == vi)
continue;
for (int j = i + 1; j < [Link]; j++) {
if (arr[i] == arr[j]) {
count++;
freq[j] = vi;
}}
freq[i] = count;
}
for (int i = 0; i < [Link]; i++) {
if (freq[i] != vi)
[Link](arr[i] + " - " + freq[i]);
}}}
Write a java program for Binary Search algorithm.
public class Main {
public static void main(String[] args) {
int[] arr = {2, 4, 6, 8, 10, 12, 14};
int key = 10;
int low = 0, high = [Link] - 1;
boolean found = false;
while(low<=high){
int mid=(low+high)/2;
if (arr[mid] == key) {
[Link]("Element found at index: " + mid);
found = true;
break;
} else if (arr[mid] < key) {
low = mid + 1;
} else {
high = mid - 1;
}
}
if (!found) {
[Link]("Element not found");
}
}
}
Write a java program for Binary Search algorithm.
public class Main {
static int max, min;
public static void findMinMax(int[] arr, int low, int high) {
int mid;
int localMax, localMin;
if (low == high) {
if (arr[low] > max) max = arr[low];
if (arr[low] < min) min = arr[low];
return;
} if (high == low + 1) {
if (arr[low] > arr[high]) {
if (arr[low] > max) max = arr[low];
if (arr[high] < min) min = arr[high];
} else {
if (arr[high] > max) max = arr[high];
if (arr[low] < min) min = arr[low];
}
return;
}
// If more than two elements
mid = (low + high) / 2;
findMinMax(arr, low, mid);
findMinMax(arr, mid + 1, high);
}
public static void main(String[] args) {
int[] arr = {7, 3, 9, 2, 5, 8, 1};
max = arr[0];
min = arr[0];
findMinMax(arr, 0, [Link] - 1);
[Link]("Maximum: " + max);
[Link]("Minimum: " + min);
}
}
