1.

Write a Java Program to print the sum of the first N natural number
Input : 5
Output: 15

import java.util.*;
public class Abc
{
public static void main(String[] args)
{
int n;
int sum=0;
System.out.println("enter n value");
Scanner sc1= new Scanner(System.in);
n=sc1.nextInt();
for(int i = 1; i <= n; i++)
{
sum += i;
}
System.out.print(sum);
}
}

2. Find smallest of three numbers using ternary operator

import java.util.*;
public class Abc
{
public static voidmain(String[] args)
{
int a, b, c, smallest;
Scanner sc = new Scanner(System.in);
System.out.println("Enter numbers ");
a = sc.nextInt();
b = sc.nextInt();
c = sc.nextInt();
smallest = c < (a < b ? a : b) ? c : ((a < b)
? a : b);
System.out.println("The smallest number is:
"+smallest);
}}

+91 9000045750 packetprep.com

3. Write a java program to check whether the number is prime number or
not
Input:32
Output: Not a Prime Number

import java.util.Scanner;
public class Abc
{
public static void main(String []args)
{
Scanner sc=new Scanner(System.in);
System.out.println("enter a number");
int num= sc.nextInt();
boolean flag = false;
for (int i = 2; i <= num / 2; ++i)
{
if (num % i == 0)
{
flag = true;
break;
}
}
if (!flag)
System.out.println("Prime Number");
else
System.out.println("Not a Prime Number");
}
}

4. Write a Java program to print first N prime numbers.

Input: 30
Output: 2 3 5 7 11 13 17 19 23 29

import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("enter n value ");

+91 9000045750 packetprep.com

 int x=sc.nextInt();
solution(x);
}
public static void solution(int n)
{
int flag=0;
for(int i=2;i<=n;i++)
{
if(i== 2 || i == 3)
System.out.print(i+" ");
else
flag=0;
for(int j=2;j<=i/2;j++)
{
if(i%j==0)
{
flag=1;
break;
}
}
if(flag == 0)
System.out.print(i+" ");
}
}
}

5. Java Program to Swap Two Numbers Using Bitwise Operator

package hello;
import java.util.*;
public class Abc
{
public static void main(String[] args)
{
int a, b;
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the first number: ");
a = scanner.nextInt();
System.out.print("Enter the second number: ");
b = scanner.nextInt();
System.out.println("Before swapping:");
System.out.println("a = " +a +", b = " +b);

+91 9000045750 packetprep.com

 a = a ^ b;
b = a ^ b;
a = a ^ b;
System.out.println("After swapping:");
System.out.print("a = " +a +", b = " +b);
}
}

6. Write a program to check for even or odd

Input: 56
Output: even number
Input: 33
Output: odd number

import java.util.Scanner;
public class Abc
{
public static void main(String [] args)
{
Scanner sc=new Scanner(System.in);
System.out.print("enter number");
int n=sc.nextInt();
if(n%2==0)
System.out.println("even number");
else
System.out.println("odd number");
}
}

+91 9000045750 packetprep.com

7. Write a Java program to check a number is palindrome or not.
Input: 454
Output: palindrome number
Input: 723
Output: not palindrome

import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("enter the number");
int num= sc.nextInt();
solution(num);
}
public static void solution(int n)
{
int r,sum=0,temp;
temp=n;
while(n>0)
{
r=n%10;
sum=(sum*10)+r;
n=n/10;
}
if(temp==sum)
System.out.println("palindrome number");
else
System.out.println("not palindrome");
}
}

+91 9000045750 packetprep.com

8. Write a Java program to check if a number is Armstrong number or not.
Input: 153
Output: Armstrong Number
Input: 77
Output: Not Armstrong Number
import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("enter number");
int num= sc.nextInt();
int temp, digits=0, last=0, sum=0;
temp=num;
while(temp>0)
{
temp = temp/10;
digits++;
}
temp = num;
while(temp>0)
{
last = temp % 10;
sum += (Math.pow(last, digits));
temp = temp/10;
}
if(num==sum)
System.out.println("Armstrong Number");
else
System.out.println("Not Armstrong Number");
}
}

+91 9000045750 packetprep.com

9. Write a Java program to print the Armstrong numbers within a range
Input: 1 200
Output: 1 2 3 4 5 6 7 8 9 153
import java.util.Scanner;
public class Armstrong_Range
{
public static void main(String[] args)
{
int count=0,i,temp=0,rem;
double sum=0;
Scanner sc=new Scanner(System.in);
int start=sc.nextInt();
int end=sc.nextInt();
for(i=start;i<=end;i++)
{
temp=i;
sum=0;count=0;
while(i!=0)
{
i=i/10;
count++;
}
i=temp;
while(i!=0)
{
rem=i%10;
i=i/10;
sum=sum+Math.pow(rem, count);
}
i=temp;
if(temp==sum)
System.out.println(i);
}
}
}

+91 9000045750 packetprep.com

10. Write a Java program to print a number in reverse order.
Input: 2134
Output: 4312

import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("enter n value");
int n=sc.nextInt();
solution(n);
}
public static void solution(int number)
{
int reverse = 0,remainder=0;
while(number != 0)
{
remainder = number % 10;
reverse = reverse * 10 + remainder;
number = number/10;
}
System.out.println(reverse);
}
}

+91 9000045750 packetprep.com

11. Write a java program to print first n Fibonacci series
Fibonacci series is a series of elements where the two previous numbers are
added to get the next number.
Input: 15
Output: 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377

import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("enter number");
int n =sc.nextInt();
int num1 = 0, num2 = 1;
int counter = 0;
while (counter < n)
{
System.out.print(num1 + " ");
int num3 = num2 + num1;
num1 = num2;
num2 = num3;
counter = counter + 1;
}
}
}

+91 9000045750 packetprep.com

12. Write a Java program to check if a number is Happy number or not.
Example:
19 is Happy Number,
1^2 + 9^2 = 82
8^2+2^2=68
6^2+8^2=100
1^2+0^2+0^2=1
import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("enter number");
int num=sc.nextInt();
if (solution(num))
System.out.println("Happy number");
else
System.out.println("Not Happy number");
}
public static boolean solution(int n)
{
if (n == 1 || n == 7)
return true;
int sum = n, x = n;
while(sum > 9)
{
sum = 0;
while (x > 0)
{
int d = x%10;
sum += d*d;
x/=10;
}
if (sum == 1)
return true;
x = sum;
}
if(sum == 7)
return true;
return false;
}}

+91 9000045750 packetprep.com

13. Write a Java program to print the digits of a number in different line.
Input: 32145
Output:
3
2
1
4
5

import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("enter number");
int n=sc.nextInt();
int i, temp, count=0;
temp=n;
while (temp>0)
{
count++;
temp = temp/10;
}
double num = Math.pow(10, count-1);
i = (int)num;
for (;i>0;i/=10)
System.out.println(n/i%10);
}
}

14. Write a java program to check if a number is Strong number or not.

Suppose we have a number 145 then,
Factorial of all digits –
Factorial of 1 = 1 ;
Factorial of 4 = 24 ;

+91 9000045750 packetprep.com

Factorial of 5 = 120 ;
sum of Factorial of all digits –
1 + 24 + 120 = 145 ;
Here the calculated result is equal to the given number
So, 145 is a Strong Number.

import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("enter the number");
int n=sc.nextInt();
int fac,temp,sum = 0;
temp=n;
while(n != 0)
{
fac = 1;
int r = n % 10;
for(int i = r ; i >= 1 ; i--)
fac = fac * i;
sum = sum + fac;
n=n/10;
}
if(sum == temp)
System.out.println("Strong Number");
else
System.out.println("Not a Strong Number");
}
}

+91 9000045750 packetprep.com

15. Write a Java program to calculate the GCD and LCM of two numbers. (No
need to print the values, only return the values to the main method)
Example:
Input: 20 30
Output: 10 60

import java.util.Scanner;
public class Abc
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
System.out.println("enter numbers");
int a =sc.nextInt();
int b = sc.nextInt();
int gcdValue;
gcdValue = gcd(a, b);
System.out.print(gcdValue + " ");
System.out.println(lcm(a, b));
}
static int gcd(int a, int b)
{
if (b == 0)
return a;
else
return gcd(b, a % b);
}
static int lcm(int a, int b)
{
int max, lcm=0, step;
if(a > b)
{
max = step = a;
}
else
{
max = step = b;
}
while(a!= 0)
{
if(max % a == 0 && max % b == 0)

+91 9000045750 packetprep.com

 {
lcm = max;
break;
}
max += step;
}
return lcm;
}
}

16. Write a Java program to check a number is Palindrome-Prime or not.

Example: 313 is a PalPrime number because after reversing that
number,the number retains its original value, and the number is also
divisible by only one or itself.
Input : 313
Output: PalPrime number
Input: 252
Output: not a Palprime number

import java.util.Scanner;
public class Abc
{
public static void main(String []args)
{
Scanner sc=new Scanner(System.in);
System.out.println("enter a number");
int num= sc.nextInt();
int temp, rem, i;
int count = 0;
int sum = 0;
temp = num;
for(i = 1; i <= temp; i++)
if(temp%i == 0)
count++;
while(num > 0)
{
rem = num%10;
sum = sum*10+rem;
num = num/10;

+91 9000045750 packetprep.com

 }
if(temp == sum && count == 2)
System.out.println("PalPrime number");
else
System.out.println("not a PalPrime number");
}
}

17. Write a java program to find the sum of the digits in a number
Input:48
Output:12
Explanation:
Input: 48 add each digit individually
4+8=12
so the output is 12
import java.util.Scanner;
public class Abc
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
System.out.println("enter number");
int n =sc.nextInt();
int sum = 0;
while (n != 0)
{
sum = sum + n % 10;
n = n/10;
}
System.out.println(sum);
}
}

+91 9000045750 packetprep.com

 Array Programs
18. Write a Java program count the number of odd and even elements in
given array.
Input:[1,3,4,7,5,2,6]
Output: 4 3

import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("enter n value");
int n=sc.nextInt();
int [] arr= new int[n];
System.out.print("enter array elements");
for(int i=0;i<arr.length;i++)
{
arr[i]=sc.nextInt();
}
int size=n;
int odd_count=0,even_count=0;
for(int i = 0; i < size; i++)
{
if(arr[i]%2!=0)
odd_count++;
else
even_count++;
}
System.out.print(odd_count+" "+even_count);
}
}

+91 9000045750 packetprep.com

19. Write a java program to count the number of occurrences in an array
Input: 4 5 2 1 4
Output:
4-2
5-1
2-1
1-1
import java.util.Scanner;
public class Abc
{
public static void main(String []args)
{
Scanner sc=new Scanner(System.in);
System.out.println("enter size of array");
int n= sc.nextInt();
int []arr=new int[n];
System.out.println("enter array elements");
for(int i=0;i<n;i++)
{
arr[i]=sc.nextInt();
}
boolean visited[] = new boolean[n];
for (int i = 0; i < n; i++)
{
if (visited[i] == true)
continue;
int count = 1;
for (int j = i + 1; j < n; j++)
{
if (arr[i] == arr[j])
{
visited[j] = true;
count++;
}
}
System.out.println(arr[i] + "-" + count);
}
}
}

+91 9000045750 packetprep.com

20. Write a Java Program to add two matrices
import java.util.*;
public class Abc
{
public static voidmain(String[] args)
{
int a[][]={{1,3,4},{2,4,3},{3,4,5}};
int b[][]={{1,3,4},{2,4,3},{1,2,4}};
int c[][]=new int[3][3];
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
c[i][j]=a[i][j]+b[i][j];
System.out.print(c[i][j]+" ");
}
System.out.println();
}
}
}

21. Write a Java program to print the unique elements of an array.

Input: [1,23,10,22,11,44,1,11,43]
Output: UNIQUE ELEMENTS ARE:23 10 22 44 43
public class Abc
{
public static void main(String[] args)
{
int[] a=new int[] {1,23,10,22,11,44,1,11,43};
int i,j;
System.out.println("UNIQUE ELEMENTS ARE:");
for(i=0;i<a.length;i++)
{
int temp=0;
for(j=0;j<a.length;j++)
if((a[i]==a[j])&&(i!=j))
{
temp++;break;

+91 9000045750 packetprep.com

 }
if(temp==0)
{
System.out.println(a[i]);
}
}
}
}

22. Write a Java program to print the duplicate elements of an array.

Input: [1,3,6,12,4,6,3,4]
Output: 3 6 4

import java.util.*;
public class Abc
{
public static void main(String args[])
{
int n;
Scanner sc=new Scanner(System.in);
System.out.print("enter size of array");
n = sc.nextInt();
int [] arr= new int[n];
System.out.print("enterarray elements");
for(int i=0;i<n;i++)
{
arr[i]=sc.nextInt();
}
for(int i = 0; i < n; i++)
{
for(int j = i + 1; j < n; j++)
{
if(arr[i] == arr[j])
System.out.print(arr[j]+" ");
}
}
}}

+91 9000045750 packetprep.com

23. Write a Java program to print the median of array elements.
Input: [10.2 38.7 92.7 65.6]
Output: 65.7

import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("enter size of array");
int n=sc.nextInt();
int [] arr= new int[n];
System.out.println("enter array elements");
for(int i=0;i<arr.length;i++)
{
arr[i]= sc.nextInt();
}
double m=0;
int x=arr.length;
if(n%2==1)
m=arr[n/2];
else
m=(arr[n/2-1]+arr[n/2])/2;
System.out.println(m);
}
}

24. Write a Java Program to rotate the elements of an array

import java.util.*;
public class Abc
{
public static void main(String[] args)
{
int[] a=new int[] {10,20,30,40,50,60,70};
int temp,i;
System.out.println("BEFORE ROTATION");
for(int y: a)
{
System.out.print(y+" ");

+91 9000045750 packetprep.com

 }
temp=a[0];
for(i=0;i<a.length-1;i++)
{
a[i]=a[i+1];
}
a[i]=temp;
System.out.println("\n AFTER ROTATION");
for(i=0;i<a.length;i++)
System.out.print(a[i]+ " ");
}
}

25. Write a Java program to check if two arrays are equal or not.( No need to
print "Yes" or "No", only return true to the main method if the arrays are
same else return false)
Input : arr1[] = {1, 2, 5, 4, 0};
arr2[] = {2, 4, 5, 0, 1};
Output : Yes
Input : arr1[] = {1, 2, 5, 4, 0, 2, 1};
arr2[] = {2, 4, 5, 0, 1, 1, 2};
Output : Yes
Input : arr1[] = {1, 7, 1};
arr2[] = {7, 7, 1};
Output : No
import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("enter array size");
int n=sc.nextInt();
int [] arr1= new int[n];
int [] arr2= new int[n];
System.out.println("enter array1");
for(int i=0 ;i<n;i++)

+91 9000045750 packetprep.com

 {
arr1[i]=sc.nextInt();
}
System.out.println("enter array 2");
for( int i=0;i<n;i++)
{
arr2[i]=sc.nextInt();
}
boolean res=solution(arr1, arr2);
if(res==true)
System.out.print("Yes");
else
System.out.print("No");
}
public static boolean solution(int [] arr1,int [] arr2)
{
int n = arr1.length;
int m = arr2.length;
if (n != m)
return false;
Arrays.sort(arr1);
Arrays.sort(arr2);
for (int i = 0; i < n; i++)
if (arr1[i] != arr2[i])
return false;
return true;
}
}

+91 9000045750 packetprep.com

26. Write a program to implement linear search
Input : 1 2 5 4 6 2
Output:Element Found
Input: 4 5 1 2 6 7 3
Output:Element not Found

import java.util.Scanner;
public class Abc
{
public static void search(int arr[], int x)
{
int n=arr.length;
int flag=0;
for(int i = 0; i < n; i++)
{
if(arr[i] == x)
flag =1;
}
if(flag == 1)
System.out.print("Element Found");
else
System.out.print("Element not Found");
}
public static void main(String [] args)
{
Scanner sc=new Scanner(System.in);
System.out.print("enter size of array");
int n=sc.nextInt();
int [] arr= new int[n];
System.out.print("enter array elements ");
for(int i=0;i<n;i++)
{
arr[i]=sc.nextInt();
}
System.out.println("enter search element");
int item =sc.nextInt();
search(arr, item);
}
}

+91 9000045750 packetprep.com

27. Write a java program to implement Bubble sort
Input: 4 5 8 6 7 2
Output: 2 4 5 6 7 8
import java.util.Scanner;
public class Abc
{
public static void bubbleSort(int arr[])
{
int n = arr.length;
for (int i = 0; i < n-1; i++)
for (int j = 0; j < n-i-1; j++)
if (arr[j] > arr[j+1])
{
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
public static void printArray(int arr[])
{
int n = arr.length;
for (int i=0; i<n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
}
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("enter size of array");
int n=sc.nextInt();
int []a=new int[n];
System.out.println("enter array elements");
for (int i=0; i<a.length; ++i)
a[i]=sc.nextInt();
bubbleSort(a);
printArray(a);
}
}

+91 9000045750 packetprep.com

28. Write a Java Program To Reverse An Array without using another array.
Input: [1 2 3 4]
Output: [4 3 2 1]

import java.util.Scanner;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("enter size of array");
int n=sc.nextInt();
int [] arr= new int[n];
System.out.print("enter array elements ");
for(int i=0;i<arr.length;i++)
{
arr[i]=sc.nextInt();
}
int temp=0;
for( int i=0;i<n ; i++,n--)
{
temp=arr[i];
arr[i]=arr[n-1];
arr[n-1]=temp;
}
for( int i=0; i < arr.length; i++)
{
System.out.print(arr[i]+" ");
}
}
}

+91 9000045750 packetprep.com

29. Write a Java program to find all pairs of elements in Java array whose sum
is equal to a given number
Input: 15 12 4 16 9 8 24 0 24
Output:
15,9
16,8
24,0
import java.util.Scanner;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("enter size of array");
int n=sc.nextInt();
int [] arr= new int[n];
System.out.print("enter array elements ");
for(int i=0;i<n;i++)
{
arr[i]=sc.nextInt();
}
for(int i=0; i<arr.length; i++)
{
for (int j=i; j<arr.length; j++)
{
if((arr[i]+arr[j])== n && i!=j)
{
System.out.println(arr[i]+","+arr[j]);
}
}
}
}
}

+91 9000045750 packetprep.com

30. Write a Java program to Rearrange positive and negative numbers in an
array.
Input: [1-2 -5 8 9 -3]
Output: -2 -5 -3 1 8 9

import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("enter size of array");
int n=sc.nextInt();
int [] arr= new int[n];
System.out.print("enter array elements ");
for(int i=0;i<n;i++)
{
arr[i]=sc.nextInt();
}
int i,j;
j = 0;
for(i = 0; i < n; i++)
{
if(arr[i] < 0)
{
if(i != j)
{
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
j++;
}
}
for(i = 0; i < n; i++)
{
System.out.print(arr[i]+" ");
}
}
}

+91 9000045750 packetprep.com

31. Write a program to print the sum of elements of an array
Input: 65 67 74 75
Output: 281

import java.util.*;
public class Abc
{
public static void main(String[] args)
{
int n;
System.out.println("enter size of array");
Scanner sc=new Scanner(System.in);
n=sc.nextInt();
int [] arr = new int [n];
System.out.println("enter array elements");
for(int i=0;i<arr.length;i++)
{
arr[i]= sc.nextInt();
}
solution(arr);
}
public static void solution(int []a)
{
int count = 0;
for (int i = 0; i <a.length; i++)
{
count += a[i];
}
System.out.println(count);
}}

+91 9000045750 packetprep.com

32. Write a Java program for Selection Sorting
Input: [4 3 5 2 7 1]
Output: 1 2 3 4 5 7
import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("enter n value");
int n=sc.nextInt();
int [] arr= new int[n];
System.out.print("enter array elements");
for(int i=0;i<n;i++)
{
arr[i]=sc.nextInt();
}
for (int i = 0; i < n-1; i++)
{
int min_idx = i;
for (int j = i+1; j < n; j++)
if (arr[j] < arr[min_idx])
min_idx = j;
int temp = arr[min_idx];
arr[min_idx] = arr[i];
arr[i] = temp;
}
for(int i=0;i<arr.length;i++)
System.out.print(arr[i]+" ");
}
}

33. Binary Search in Java. (No need to print only return the position of the
search element in the array if found, else return -1 to the driver function if
search element not found in the array)
Binary Search in Java is a search algorithm that finds the position of a
target value within a sorted array.
Input: [19 28 15 17 83], 28

+91 9000045750 packetprep.com

Output: Element found at index 4
Input: [19 28 15 17 83], 27
Output: Element not found

import java.util.*;
public class Abc
{
public static void main(String args[])
{
int n;
Scanner sc=new Scanner(System.in);
System.out.print("enter search element");
int searchElement=sc.nextInt();
System.out.print("enter array size");
n=sc.nextInt();
int [] arr= new int[n-1];
System.out.print("enter array elements");
for(int i=0;i<arr.length-1;i++)
arr[i]=sc.nextInt();
int result=solution(arr,searchElement);
if (result == -1)
System.out.println("Element not found");
else
System.out.println("Element found at "
+ "index " + result);
}
public static int solution(int [] arr,int x)
{
Arrays.sort(arr);
int l = 0, r = arr.length - 1;
while (l <= r)
{
int m = l + (r - l) / 2;
if (arr[m] == x)
return m;
if (arr[m] < x)
l = m + 1;
else
r = m - 1;
}
return -1;
}}

+91 9000045750 packetprep.com

34. Write a java program to print the second largest number in an array.
Input: [19,73,82,64,53,02]
Output: 73
import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("enter n value");
int n=sc.nextInt();
int [] arr= new int[n];
System.out.print("enter array");
for(int i=0;i<arr.length;i++)
{
arr[i]=sc.nextInt();
}
solution(arr);
}
public static void solution(int [] arr)
{
Arrays.sort(arr);
System.out.print(arr[arr.length-2]);
}
}

+91 9000045750 packetprep.com

 Pattern
35. Write a java program to print the below pattern.
*****
****
***
**
*
package hello;
public class Abc
{
public static void main(String[] args)
{
int i,j,k,input=7,factor=0;
for(i=2;i<=input;i++)
{
for(j=input;j>=i;j--)
System.out.print("*");
System.out.println(" ");
}
}
}

36. Write a java program to print the below pattern

******
* *
* *
* *
******
public class Abc
{
public static void main(String[] args)
{
int i,j;
for(i=1;i<=6;i++)
{
for(j=1;j<=6;j++)

+91 9000045750 packetprep.com

 if(i==1||j==1||i==6||j==6)
System.out.print("*");
else
System.out.print(" ");
System.out.println(" ");
}
}
}

37. Write a java program to print the below pattern

*
* *
* * *
* * * *
* * * * *
public class Abc
{
public static void main(String[] args)
{
int rows = 5;
for (int i = 1; i <= rows; ++i)
{
for (int j = 1; j <= i; ++j)
{
System.out.print("* ");
}
System.out.println();
}
}
}

+91 9000045750 packetprep.com

38. Write a java program to print the below pattern
*
* * *
* * * * *
* * * * * * *
* * * * * * * * *
public class Abc
{
public static voidmain(String[] args)
{
int rows = 5, k = 0;
for (int i = 1; i <= rows; ++i, k = 0)
{
for (int space = 1; space <= rows - i; ++space)
{
System.out.print(" ");
}
while (k!=2*i-1)
{
System.out.print("* ");
++k;
}

System.out.println();
}
}
}

+91 9000045750 packetprep.com

39. Write a java program to print the below pattern
* * * * * * * * *
* * * * * * *
* * * * *
* * *
*

public class Abc

{
public static void main(String[] args)
{
int rows = 5;
for(int i = rows; i >= 1; --i)
{
for(int space = 1; space <= rows - i;
++space)
{
System.out.print(" ");
}
for(int j=i; j <= 2 * i - 1; ++j)
{
System.out.print("* ");
}
for(int j = 0; j < i - 1; ++j)
{
System.out.print("* ");
}
System.out.println();
}
}
}

+91 9000045750 packetprep.com

 Strings
40. Write a Java program to check whether two strings are anagram or not?
Input: race, care
Output: race and care are anagram
import java.util.*;
public class Abc
{
public static void main(String[] args)
{
String str1 = "Race";
String str2 = "Care";
str1 = str1.toLowerCase();
str2 = str2.toLowerCase();
if(str1.length() == str2.length())
{
char[] charArray1 = str1.toCharArray();
char[] charArray2 = str2.toCharArray();
Arrays.sort(charArray1);
Arrays.sort(charArray2);
boolean result =
Arrays.equals(charArray1, charArray2);
if(result)
System.out.println(str1 + " and " + str2
+ " are anagram.");
else
System.out.println(str1 + " and " + str2
+ " are not anagram.");
}
else
System.out.println(str1 + " and " + str2
+ " are not anagram.");
}
}

+91 9000045750 packetprep.com

41. Write a Java Program to print number of words in a String
Input: You are doing java coding questions
Output: 6

import java.util.*;
public class Abc
{
public static void main(String[] args)
{
System.out.println("enter a statement");
Scanner sc=new Scanner(System.in);
String s = sc.nextLine();
solution(s);
}
public static void solution(String str)
{
int count = 1;
for (int i = 0; i < str.length() - 1; i++)
{
if ((str.charAt(i) == ' ') && (str.charAt(i + 1) != ' '))
{
count++;
}
}
System.out.println(count);
}
}

42. Write a Java Program to reverse a String.

Input: You are doing java coding questions
Output: snoitseuq gnidoc avaj gniod era uoY

import java.util.*;
public class Abc
{
public static void main(String[] args)
{
int i =0;

+91 9000045750 packetprep.com

 String s = new String();
Scanner sc=new Scanner(System.in);
System.out.println("enter string");
s=sc.nextLine();
solution(s);
}
public static void solution(String str)
{
int length=str.length();
String rev="";
for(int i=length-1;i>=0;i--)
rev=rev+str.charAt(i);
System.out.println(rev);
}
}

43. Write a java program to count vowels in a String.

Example:
Input: Apple
Output: 2

import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("enter string");
String s=sc.nextLine();
int count = 0;
s= s.toLowerCase();
for (int i = 0; i < s.length(); i++)
{
if (s.charAt(i) == 'a' || s.charAt(i) == 'e'
|| s.charAt(i) == 'i'
|| s.charAt(i) == 'o'
|| s.charAt(i) == 'u')
{
count++;
}

+91 9000045750 packetprep.com

 }
System.out.println(count);
}
}

44. Given a string, we have to find the longest word in the input string and
then calculate the number of characters in this word. (In Java)
Input: Java Coding Questions
Output: 9

import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("enter a string");
String s= sc.nextLine();
solution(s);
}
public static void solution(String str)
{
int n = str.length();
int res = 0, curr_len = 0;
for (int i = 0; i < n; i++)
{
if (str.charAt(i) != ' ')
curr_len++;
else
{
res = Math.max(res, curr_len);
curr_len = 0;
}
}
System.out.print(Math.max(res, curr_len));
}
}

+91 9000045750 packetprep.com

45. Java Program to Remove a Given Word From a String.
Input : This is the place
word="the"
Output : This is place
Input : Hello world Hello
word = Hello
Output : world
Explanation: The given string contains the word two times
Input : Hello world
word = not
Output : Hello world
Explanation: word doesn't exists in the string
import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.print("enter search word");
String word= sc.nextLine();
System.out.print("enter string");
String s= sc.nextLine();
solution(s,word);
}
public static void solution(String str, String word)
{
String msg[] = str.split(" ");
String new_str = "";
for (String words : msg)
{
if (!words.equals(word))
new_str += words + " ";
}
System.out.print(new_str);
}
}

+91 9000045750 packetprep.com

46. Write a program to count the number of characters in a string
Input: Hello World
output:10
import java.util.Scanner;
public class Abc
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
System.out.println("enter string");
String str=sc.nextLine();
solution(str);
}
public static void solution(String s)
{
int count = 0;
for (int j = 0; j<s.length();j++)
{
if (s.charAt(j) !=32)
{
count++;
}
}
System.out.println(count+" ");
}
}

47. Write a java program to remove all vowels from String and print the string
Input: hello
Output: hll

import java.util.Scanner;
public class Abc
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
System.out.println("enter string");
String str=sc.nextLine();

+91 9000045750 packetprep.com

 String result= str.replaceAll("[aeiouAEIOU]", "");
System.out.println(result);
}
}

48. Write a Java program to check a String is palindrome or not.

Example:
Input: Mom
Output: palindrome
Input: Hello
Output: not palindrome

import java.util.Scanner;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int i =0;
System.out.println("enter string");
String s =sc.nextLine() ;
s=s.toLowerCase();
solution(s);
}
public static void solution(String str)
{
String rev="";
int length = str.length();
for ( int i = length - 1; i >= 0; i-- )
rev = rev + str.charAt(i);
if (str.equals(rev))
System.out.println("palindrome");
else
System.out.println("not palindrome");
}
}

+91 9000045750 packetprep.com

49. Write a Java Program to change the case of alphabets in a String.
Input: PacketPrep
Output: pACKETpREP
import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("enter string");
String s= sc.nextLine();
solution(s);
}
public static void solution(String str)
{
char c = 'a';
int len = str.length();
StringBuffer strBuffer = new StringBuffer(len);
for (int i = 0; i < len; i++)
{
c = str.charAt(i);
if (Character.isUpperCase(c))
{
c = Character.toLowerCase(c);
}
else if (Character.isLowerCase(c))
{
c = Character.toUpperCase(c);
}
strBuffer.append(c);
}
System.out.println(strBuffer);
}
}

+91 9000045750 packetprep.com

50. Write a Java program to remove duplicate word from a String with a given
word (remove).
Input: Hello World Hello
Output: hello world remove
input: Hello World
Output: hello world
import java.util.*;
public class Abc
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("enter string");
String s= sc.nextLine();
solution(s);
}
public static void solution(String str)
{
String sentence, result = "";
String allWords[];
sentence = str.toLowerCase();
allWords = sentence.split(" ");
for(int i=0; i<allWords.length; i++)
{
for(int j=i+1; j<allWords.length; j++)
{
if(allWords[i].equals(allWords[j]))
{
allWords[j] = "remove";
}
}
}
for(String word: allWords)
{
result = result + word + " ";
}
System.out.print(result);
}
}

+91 9000045750 packetprep.com