Java Interview Specific Codes.

md 2024-05-28

Java Important Programs

1. Find a number is positive or negative ?
import [Link];
class Main
{
public static void main (String[]args)
{
Scanner sc = new Scanner([Link]);
int num = [Link]();

if (num > 0)
[Link] ("The number is positive");
else if (num < 0)
[Link] ("The number is negative");
else
[Link] ("Zero");
}
}
// 0 is a positive number because if we represent 0 in terms of binary :
0000 0000
// in the above representation the Most Significant Bit (MSD - First bit)
is 0 which
// indicate a positive number

2. Find a number is Even or Odd?

// Using Modulus Operator
public class Main
{
public static void main(String[] args) {
int number = 29;

//checking whether the number is even or odd

if (number % 2 == 0)
[Link](number + " is Even");
else
[Link](number + " is odd");
}
}

// Using Bitwise Operator

public class Main
{

1 / 57
Java Interview Specific [Link] 2024-05-28

public static void main (String[]args)

{
int number = 29;

if (isEven (number))
[Link] ("Even");
else
[Link] ("Odd");
}

// Returns true if n is even, else odd

static bool isEven (int number)
{

// n & 1 is 1, then odd, else even

return (!(number & 1));
}
}

3. Find the Sum of First N Natural Numbers in Java

//using loops
public class Main
{
public static void main (String[]args)
{

int n = 10;
int sum = 0;

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

sum += i;//sum=sum+i;
}
[Link] (sum);
}
}

//using formula
public class Main
{
public static void main (String[]args)
{
int n = 10;
[Link] (n*(n+1)/2);
}
}

2 / 57
Java Interview Specific [Link] 2024-05-28

4. Find the Sum of the Numbers in a Given Interval in Java

//Using Brute Force

public class Main
{
public static void main (String[]args)
{
int a = 5;
int b = 10;

int sum = 0;

for (int i = a; i <= b; i++)

sum = sum + i;
[Link] ("The sum is " + sum);
}
}

//using formula
public class Main
{
public static void main(String[] args) {
int num1 = 2;
int num2 = 5;
int sum = num2*(num2+1)/2 - num1*(num1+1)/2 + num1;
[Link]("The Sum is "+ sum);
}
}

5. Find the Greatest of the Three Numbers in Java

//using conditional statements
public class Main
{
public static void main (String[]args)
{
int num1 = 10, num2 = 20, num3 = 30;
//checking if num1 is greatest
if (num1 >= num2 && num1 >= num3)
[Link] (num1 + " is the greatest");
//checking if num2 is greatest
else if (num2 >= num1 && num2 >= num3)
[Link] (num2 + " is the greatest");
//checking if num2 is greatest
else if (num3 >= num1 && num3 >= num2)
[Link] (num3 + " is the greatest");
3 / 57
Java Interview Specific [Link] 2024-05-28

}
}

public class Main

{
public static void main (String[]args)
{
int num1 = 10, num2 = 20, num3 = 30;
int temp, result;
// find the largest b/w num1 and num2 & store in temp
temp = num1>num2 ? num1:num2;
// find the largest b/w temp and num3 & finally printing it
result = temp>num3 ? temp:num3;
[Link] (result + " is the greatest");
}
}

6. Check Whether or Not the Year is a Leap Year in Java

import [Link];

public class LeapYear {

public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the year :");
int n = [Link]();//
boolean result = leapYear(n);
[Link](result);
}
public static boolean leapYear(int n) {
if(n%4 == 0)
{
if(n%100 == 0)
{
if(n%400 == 0)
{
return true;
}
else {
return false;
}
}
else {
return false;
}
}
else {
return false;

4 / 57
Java Interview Specific [Link] 2024-05-28

}
}
}

7. Check if the given number is prime or not in Java

import [Link];
public class PrimeNumber {
public static boolean isPrime(int num){
boolean flag = true;
for(int i=2;i< num;i++){
if(num%i == 0){//
flag = false;
break;
}
}
return flag;
}
public static void main(String[] args) {
//To collect input
Scanner sc = new Scanner([Link]);
[Link]("Enter the number to be checked :");
//the number to be checked is stored inside num
int num = [Link]();
//calling isPrime(num) by passing num as the parameter
boolean result = isPrime(num);
if(result == true)
{
[Link]("Given Number is a Prime number");
}
else
{
[Link]("Given Number is not a Prime Number");
}
}
}

8. Find all the Prime Numbers in a Given Interval in Java

public class Main{
public static void main (String[]args){
int lower = 1, upper = 20;
for (int i = lower; i <= upper; i++)
if (isPrime (i))
[Link] (i);
}
static boolean isPrime (int n){
int count = 0;
// 0, 1 negative numbers are not prime
5 / 57
Java Interview Specific [Link] 2024-05-28

if (n < 2)
return false;
// checking the number of divisors b/w 1 and the number n-1
for (int i = 2; i < n; i++){
if (n % i == 0)
return false;
}
// if reached here then must be true
return true;
}
}

9. Find the Sum of the Digits of a Number in Java Language

public class Main
{
public static void main (String[]args)
{
int num = 12345, sum = 0;
[Link] ("Sum of digits : " + getSum (num, sum));
}
static int getSum (int num, int sum)
{
if (num == 0)
return sum;
sum += num % 10;
/*
12345%10=5 --> sum=5 ---> 12345/10
1234%10 =4 --> sum=9 ---> 1234/10
123%10 =3 --> sum=12---> 123/10
12%10 =2 --> sum=14---> 12/10
1%10 =1 --> sum=15---> 1/10
0

1%10 =1 sum=1 --> 1/10

0
*/
return getSum (num / 10, sum);
}
}

10. Find the Reverse of a Number in Java Language

public class Main
{
public static void main (String[]args)
{
//variables initialization
int num = 1234, reverse = 0, rem;
6 / 57
Java Interview Specific [Link] 2024-05-28

//loop to find reverse number

while (num != 0)
{
rem = num % 10;//
reverse = reverse * 10 + rem;
num /= 10;
};
/*
1234%10=4 rev=4 1234/10
123%10 =3 rev=43 123/10
12%10 =2 rev=432 12/10
1%10 =1 rev=4321
*/
//output
[Link] ("Reversed Number: " + reverse);
}
}

11. Check Whether or Not the Number is a Palindrome in Java Language

public class Main{
public static void main (String[]args){
//variables initialization
int num = 12021, reverse = 0, rem, temp;
temp = num;
//loop to find reverse number
while (temp != 0){
rem = temp % 10;
reverse = reverse * 10 + rem;
temp /= 10;
};
// palindrome if num and reverse are equal
if (num == reverse)
[Link] (num + " is Palindrome");
else
[Link] (num + " is not Palindrome");
}
}

12. Check Whether or Not the Number is an Armstrong Number

import [Link].*;
import [Link].*;
//1634 = 1^4+6^4+3^4+4^4 = 1+1296+81+256 = 1634
class Main {
public static void main(String[] args){
//variables initialization
int num = 1634, reverse = 0;
int len = order(num);
7 / 57
Java Interview Specific [Link] 2024-05-28

if (num == getArmstrongSum(num, len))

[Link](num + " is an Armstrong Number");
else
[Link](num + " is not an Armstrong Number");
}
private static int getArmstrongSum(int num, int order) {
if(num == 0)
return 0;
int digit = num % 10;
return (int) [Link](digit, order) + getArmstrongSum(num/10,
order);
}
private static int order(int num) {
int len = 0;
while (num!=0){
len++;
num = num/10;
}
return len;
}

### 13. Find the Armstrong Numbers in a given Range using Java

```java
import [Link];

public class LearnCoding2

{
public static void main(String[] args)
{
Scanner sc = new Scanner([Link]);
[Link]("Enter lower and upper ranges : ");
int low = [Link]();
int high = [Link]();

[Link]("Armstrong numbers between "+ low + " and " +

high + " are : ");
// loop for finding and printing all armstrong numbers between
given range
for(int num = low ; num <= high ; num++)
{
int len = getOrder(num);
if(num == getArmstrongSum(num, len))
[Link](num + " ");
}
}

private static int getOrder(int num) {

int len = 0;
while (num!=0)
8 / 57
Java Interview Specific [Link] 2024-05-28

{
len++;
num = num/10;
}
return len;
}
private static int getArmstrongSum(int num, int order) {
if(num == 0)
return 0;

int digit = num % 10;

return (int) [Link](digit, order) + getArmstrongSum(num/10,

order);
}
}

14. Find the Fibonacci Series up to Nth Term in Java Language

public class Main{
public static void main (String[]args){
int num = 15;
int a = 0, b = 1;
// Here we are printing 0th and 1st terms
[Link] (a + " , " + b + " , ");
int nextTerm;
// printing the rest of the terms here
for (int i = 2; i < num; i++){
nextTerm = a + b;
a = b;
b = nextTerm;
[Link] (nextTerm + " , ");
}
}
}

15. Factorial of a Number in Java

class Main{
// Method to find factorial of the given number
static int factorial(int n){
int res = 1, i;
for (i = 2; i <= n; i++)
res *= i;
return res;
}
// Driver method
public static void main(String[] args){
int num = 6;
9 / 57
Java Interview Specific [Link] 2024-05-28

[Link]("Factorial of " + num + " is " +

factorial(num));
}
}

16. Program to check if the given 2 strings are anagrams.

. Convert the string to a character array
. sort the array
. check the equality of the 2 arrays.

import [Link];
public class Anagram {
public static boolean isAnagram(String str1, String str2) {
// Remove all whitespace and convert to lowercase
str1 = [Link]();
str2 = [Link]();
// Check if the two strings have the same length
if ([Link]() != [Link]()) {
return false;
}
// Convert both strings to char arrays and sort them
char[] charArray1 = [Link]();
char[] charArray2 = [Link]();
[Link](charArray1);
[Link](charArray2);

// Compare the sorted char arrays

return [Link](charArray1, charArray2);
}

public static void main(String[] args) {

String str1 = "restful";
String str2 = "fluster";
if (isAnagram(str1, str2)) {
[Link](str1 + " and " + str2 + " are anagrams.");
} else {
[Link](str1 + " and " + str2 + " are not
anagrams.");
}
}
}

17. Write a program to count the number of words in the given string
. check for spaces in the given string
. count the spaces inside a third party variable
. Add 1 to the total space count to find the total number of words.

10 / 57
Java Interview Specific [Link] 2024-05-28

public class WordCounter {

public static int countWords(String str) {
int wordCount = 0;

for(int i=0;i<[Link]();i++){
if([Link](i)==' ' || i==[Link]()-1){
wordCount++;
}
}
return wordCount;
}

public static void main(String[] args) {

String str = "This is a test string.";
int wordCount = countWords(str);
[Link]("The number of words in the string is: " +
wordCount);
}
}

18. Write a program to find the count of all the uppercase letters in the given string
. Identify the ASCII value for A and Z (A=65 and Z=90)
. use a conditional statement to check if the character being checked falls under the given ranges
. if yes increment count

public class UppercaseCounter {

public static int countUppercase(String str) {
int uppercaseCount = 0;
// Approach-1: Iterate through each character in the string
for (int i = 0; i < [Link](); i++) {
char c = [Link](i);
if ([Link](c)) {
uppercaseCount++;
}
}
//Approach-1: using ascii table
for(int i=0;i<[Link]();i++){
if([Link](i)>=65 && [Link](i)<=95){
uppercaseCount++;
}
}
return uppercaseCount;
}
public static void main(String[] args) {
String str = "This is a Test String.";
int uppercaseCount = countUppercase(str);
[Link]("The number of uppercase letters in the string
is: " + uppercaseCount);
}

11 / 57
Java Interview Specific [Link] 2024-05-28

19. Write a program to print the smallest and biggest numbers in an array.
import [Link];

public class MinMaxFinder {

public static void main(String[] args) {
int[] arr = {10, 5, 7, 25, 30, 2};

// Sort the array in ascending order

[Link](arr);

// Print the smallest and largest elements of the array

[Link]("Smallest element: " + arr[0]);
[Link]("Largest element: " + arr[[Link] - 1]);
}
}

20. Find the Factorial of the given Number in Java

. Call function getFactorial(num)
. Set base case when num == 0 return 1
. Other cases return num * getFactorial(num-1);

import [Link];

public class FactorialFinder {

public static void main(String[] args) {
Scanner scanner = new Scanner([Link]);
[Link]("Enter a number: ");
int n = [Link]();

int factorial = 1;

// Calculate the factorial of n

for (int i = 1; i <= n; i++) {
factorial *= i;
}

[Link]("Factorial of " + n + " is " + factorial);

}
}

12 / 57
Java Interview Specific [Link] 2024-05-28

21. Check Whether or Not the given Number is an Armstrong Number

370 = 3^3 + 7^3 + 0^3 = 27 + 343 + 0 = 370

import [Link];

public class ArmstrongChecker {

public static void main(String[] args) {
Scanner scanner = new Scanner([Link]);
[Link]("Enter a number: ");
int n = [Link]();

int num = n;
int sum = 0;
int digits = [Link](n).length();

// Calculate the sum of the cubes of the digits

while (num > 0) {
int digit = num % 10;
sum += [Link](digit, digits);
num /= 10;
}

// Check if the number is an Armstrong number

if (sum == n) {
[Link](n + " is an Armstrong number.");
} else {
[Link](n + " is not an Armstrong number.");
}
}
}

22. Check if the given number is a Perfect Square using Java

import [Link];

public class PerfectSquareChecker {

public static void main(String[] args) {
Scanner scanner = new Scanner([Link]);
[Link]("Enter a number: ");
int n = [Link]();

boolean isPerfectSquare = false;

// Check if the number is a perfect square

for (int i = 1; i <= n; i++) {
if (i * i == n) {
isPerfectSquare = true;
break;

13 / 57
Java Interview Specific [Link] 2024-05-28

}
}

if (isPerfectSquare) {
[Link](n + " is a perfect square.");
} else {
[Link](n + " is not a perfect square.");
}
}
}

23. Program for Finding out the Prime Factors of a number in Java
import [Link];

import [Link];

public class PrimeFactors {

public static void main(String[] args) {
Scanner scanner = new Scanner([Link]);
[Link]("Enter a number: ");
int n = [Link]();

[Link]("Prime factors of " + n + " are: ");

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

while (n % i == 0) {
[Link](i + " ");
n /= i;
}
}
}
}

24. Program to find the power of a number using Java

import [Link];

public class PrimeFactorFinder {

public static void main(String[] args) {
Scanner scanner = new Scanner([Link]);
[Link]("Enter a number: ");
int n = [Link]();
[Link]("Prime factors of " + n + ": ");
// Find the prime factors of n
for (int i = 2; i <= n; i++) {
while (n % i == 0) {
14 / 57
Java Interview Specific [Link] 2024-05-28

[Link](i + " ");

n /= i;
}
}
[Link]();
}
}

25. Program to find factors of a number using Java

import [Link];

public class FactorFinder {

public static void main(String[] args) {
Scanner input = new Scanner([Link]);
[Link]("Enter a positive integer: ");
int num = [Link]();

[Link]("Factors of " + num + " are: ");

for (int i = 1; i <= num; i++) {
if (num % i == 0) {
[Link](i + " ");
}
}
}
}

26. Check Whether or Not the Given Number is a Strong Number in Java Language
import [Link];

public class StrongNumberChecker {

public static void main(String[] args) {
Scanner input = new Scanner([Link]);
[Link]("Enter a positive integer: ");
int num = [Link]();

int originalNum = num;

int sum = 0;
while (num > 0) {
int digit = num % 10;
int factorial = 1;
for (int i = digit; i > 0; i--) {
factorial *= i;
}
sum += factorial;
num /= 10;
15 / 57
Java Interview Specific [Link] 2024-05-28

if (sum == originalNum) {
[Link](originalNum + " is a strong number.");
} else {
[Link](originalNum + " is not a strong number.");
}
}
}

27. Program to check if the given number is an Automorphic number or not using Java
import [Link];

public class AutomorphicNumberChecker {

public static void main(String[] args) {
Scanner input = new Scanner([Link]);
[Link]("Enter a positive integer: ");
int num = [Link]();
int square = num * num;
int count = 0;
int originalNum = num;
while (num > 0) {
count++;
num /= 10;
}
int lastDigits = (int) (square % ([Link](10, count)));

if (lastDigits == originalNum) {
[Link](originalNum + " is an Automorphic
number.");
} else {
[Link](originalNum + " is not an Automorphic
number.");
}
}
}

28. Binary to decimal conversion using Java

import [Link];
public class Main
{
public static void main(String args[])
{
Scanner sc = new Scanner([Link]);
16 / 57
Java Interview Specific [Link] 2024-05-28

[Link]("Enter a binary number : ");

int binary = [Link]();
//Declaring variable to store decimal number
int decimal = 0;
//Declaring variable to use in power
int n = 0;
//writing logic for the conversion
while(binary > 0)
{
int temp = binary%10;
decimal += temp*[Link](2, n);
binary = binary/10;
n++;
}
[Link]("Decimal number : "+decimal);
//closing scanner class(not compulsory, but good practice)
[Link]();
}
}

29. Octal to decimal conversion in Java

import [Link];
public class Main
{
public static void main(String args[])
{
//scanner class object creation
Scanner sc = new Scanner([Link]);
//input from user
[Link]("Enter a octal number : ");
int octal = [Link]();
//Declare variable to store decimal number
int decimal = 0;
//Declare variable to use in power
int n = 0;
//writing logic for the conversion
while(octal > 0)
{
int temp = octal % 10;
decimal += temp * [Link](8, n);
octal = octal/10;
n++;
}
//printing result
[Link]("Decimal number : "+decimal);
//closing scanner class(not compulsory, but good practice)
[Link]();
}
}

17 / 57
Java Interview Specific [Link] 2024-05-28

30. Calculate Age

import [Link];
import [Link];
import [Link];

public class AgeCalculator {

public static void main(String[] args) {
[Link]("Enter the data in YYYY-MM-DD format :");
Scanner sc = new Scanner([Link]);
String dob = [Link]();
ageCalculator(dob);
}

private static void ageCalculator(String dob) {

LocalDate dob_act = [Link](dob);
LocalDate today = [Link]();
[Link](today);
[Link]([Link](dob_act, today).getYears());
}
}

31. Convert Hour to Second

import [Link];

public class HourToSecond {

public static void main(String[] args) {
[Link]("Enter hours :");
Scanner sc = new Scanner([Link]);
int hours = [Link]();
int mins = hours * 60;
int secs = hours * 60 * 60;

[Link]("Mins : "+mins);
[Link]("Seconds : "+secs);
}
}

32. Even Number List

import [Link];

public class EvenNumberList {

public static void main(String[] args) {
Scanner sc = new Scanner([Link]);

18 / 57
Java Interview Specific [Link] 2024-05-28

[Link]("Enter the count of even numbers to printed

:");
int n = [Link]();
//findEven(n);
findEvenXOR(n);
}
public static void findEven(int n) {
int arr[] = new int[n];
int count = 0;
for(int i=0;i<(2*n);i++)
{
if((i%2)==0)
{
arr[count]=i;
count++; // for the array index
}
}
//for each
for (int i : arr) {
[Link](i+", ");
}
}
public static void findEvenXOR(int n) {
int arr[] = new int[n];
int count = 0;
for(int i=0;i<(2*n);i++)
{
if((i ^ 1)==(i+1))
{
arr[count]=i;
count++; // for the array index
}
}
//for each
for (int i : arr) {
[Link](i+", ");
}
}
}

//0 : 0 0 0 0 0 0 0 0

/*
* input-1 0 0 1 1
* input-2 0 1 0 1
* output 0 1 1 0
*
*
* if n is the number ---> 42
* then n is said to be even if n^1 == n+1 : 42 ^ 1 == 43
* then n is said to be odd if n^1 == n-1 : 43 ^ 1 == 42
*
* 42 in binary
* 2^0 2^1 2^2 2^3 2^4 2^5 2^6
19 / 57
Java Interview Specific [Link] 2024-05-28

* 1 2 4 8 16 32 64
* 0 1 0 1 0 1
*
* --> 101010
* 1
* ----------
* 101011
*
* 43 in binary
* 2^0 2^1 2^2 2^3 2^4 2^5 2^6
* 1 2 4 8 16 32 64
* 1 1 0 1 0 1
* 101011
* 1
* ------
* 101010
*/

33. Leap Year

return true;
}
else {
return false;
}
}
else {
return true;
}
}
else {
return false;
}
}
}

//2000, 2004, 2008, 2012, ....

34. Armstrong Number

import [Link];
public class Armstrong {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the number :");
int n = [Link]();//153
boolean result = armstrongCheck(n);
if(result==true) {
20 / 57
Java Interview Specific [Link] 2024-05-28

[Link]("Armstrong");
}
else {
[Link]("Not Armstrong");
}
}
public static boolean armstrongCheck(int n) {
int temp=n, power=0, last=0;
double sum=0;
while(temp>0) {
temp = temp/10;//153/10 --> 15/10-->1/10-->0
power++;//1,2,3
}
temp = n;
while(temp>0) {
last = temp % 10;//153%10-->3, 15%10-->5, 1%10-->1
sum = sum + ([Link](last,
power));//0+27=27,27+125=152,152+1=153
temp = temp/10;//153/10-->15, 15/10-->1
}
if(sum==n)
{
return true;
}
else {
return false;
}
}
}

35. OOPs Pillars Program

/*
Encapsulation:
--> It refers to the process providing security to the most important
component of an object
--> Encapsulation can be achieved by making use of :
1. Private Members
2. Setters
3. Getters

Inheritance:
--> It refers to the hierarchy of classes
--> It represents Parent - Child relationship
--> Inheritance can be achieved by making used of extends key word
--> Advantages of Inheritance:
1. re-usability of code
2. coding time reduces
3. profit is increased
--> We cannot include private members for inheritance
--> We cannot inherit constructors

21 / 57
Java Interview Specific [Link] 2024-05-28

class A{
A(){}
}
class B extends A{
A(){};//error
}
--> We cannot have multiple inheritance
class Parent1{
}
class Parent2{
}
class Child extends Parent1,Parent2{ //error
}
--> We can have multi-level inheritance in Java
class Shankar{
}
class Gopal extends Shankar{
}
class Vignesh extends Gopal{
}
--> We cannot have cyclic inheritance in java
class Shankar extends Gopal{
}
class Gopal extends Shankar{
}
class Vignesh extends Gopal{
}
--> We have 3 types of methods in inheritance
1. Inherited Method
2. Overridden method
3. Specialized method

Polymorphism:
--> Refers to 1:M relation
--> 2 categories
1. Complie time polymorphism
(Method overloading)
2. Run time polymorphism
(Method Overriding)

Abstraction:
--> Refers to the process of hiding the implementation
--> if a method does not have a implementation then we call such
methods as abstract method
--> An abstract method is indicated using "abstract" keyword
--> A class can be called as abstract class if it contains atleast one
abstract method
--> Can we create the object of an abstract class??
YES */
abstract class Shape {
double area;
abstract void input();//collecting input
abstract void calculate();//to calculate area
void display()
22 / 57
Java Interview Specific [Link] 2024-05-28

{
[Link](area);
}
}
class Circle extends Shape {
private double radius;
void input(){
Scanner sc = new Scanner([Link]);
[Link]("Enter the radius : ");
radius = [Link]();
}
void calculate() {
area = 3.147 * radius * radius;
}
}
class Square extends Shape {
private double side;
void input(){
Scanner sc = new Scanner([Link]);
[Link]("Enter the side : ");
side = [Link]();
}
void calculate() {
area = side * side;
}
}
//
//class Rectangle extends Shape {
// // your code goes here
//}

//to showcase and implement polymorphism

class Geometry {
void allow(Shape s)
{
[Link]();
[Link]();
[Link]();
}
}

public class LaunchShapes {

public static void main(String[] args) {
Circle c = new Circle();
Square s = new Square();
Geometry g = new Geometry();
[Link](c);
[Link](s);
}
}

36. Vowel and Consonant Count

23 / 57
Java Interview Specific [Link] 2024-05-28

public class VowelConsonant {

public static void main(String[] args) {
String s1 = "Hi Good MornIng to Everyone";

int vow = 0;
int con = 0;

for(int i=0;i<[Link]();i++)
{
if([Link](i)=='A' || [Link](i)=='E' || [Link](i)=='I'
||
[Link](i)=='O' || [Link](i)=='U') {
vow++;
}
else if([Link](i)=='a' || [Link](i)=='e' ||
[Link](i)=='i' ||
[Link](i)=='o' || [Link](i)=='u') {
vow++;
}
else if([Link](i)!=' '){
con++;
}
}
[Link]("Vowel : "+vow);
[Link]("Consonant : "+con);
}
}

37. Word Count

public class WordCount {
public static void main(String[] args) {
String s1 = " Welcome to skill-lync ";
int count=0;
[Link]("String before trim : "+s1);
s1 = [Link]();
[Link]("String after trim : "+s1);
for(int i=0;i<=[Link]()-1;i++)
{
if([Link](i)==' ' && [Link](i+1)!=' ')
count++;
}
[Link]("Word Count is "+(count+1));
}
}

38. Find max and min value in array with using built in class Arrays
24 / 57
Java Interview Specific [Link] 2024-05-28

public class MaxMin {

public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the size of the array : ");
int n = [Link]();
int arr[] = new int[n];
//for(int i=0;i<[Link];i++)
for(int i=0;i<=[Link]-1;i++) {
[Link]("Enter the element in the position "+(i));
arr[i] = [Link]();
}
for(int i=0;i<=[Link]-1;i++) {
[Link](arr[i]+" ");
}
[Link]();
findMax(arr);
findMin(arr);
}

private static void findMin(int[] arr) {

int min = arr[0];
for(int i=0;i<=[Link]-1;i++) {
if((i+1)<([Link])) {
if(min>arr[i+1])
{
min = arr[i+1];
}
}
}
[Link]("min = "+min);
}

private static void findMax(int[] arr) {

int max = arr[0];
for(int i=0;i<=[Link]-1;i++) {
if((i+1)<([Link])) {
if(max<arr[i+1])
{
max = arr[i+1];
}
}
}
[Link]("max = "+max);
}
}

39. Convert to uppercase without using built-in methods

public class UpperCaseCount {
public static void main(String[] args) {

25 / 57
Java Interview Specific [Link] 2024-05-28

String s1 = "JaVa Is thE BeSt LANguaGe";

int count=0;
for(int i=0;i<[Link]();i++)
{
if([Link](i)>=65 && [Link](i)<=90) {
count++;
}
}
[Link](count);
}
}

40. Anagram
import [Link];

public class Anagram {

public static void main(String[] args) {
String s1 = "AB CD";
String s1_mod = "";
String s2 = "C ABD";
String s2_mod = "";

if ([Link]() == [Link]()) {
for (int i = 0; i <= [Link]() - 1; i++) {
if ([Link](i) == ' ') {
} else {
s1_mod = s1_mod + [Link](i);
}
}
for (int i = 0; i <= [Link]() - 1; i++) {
if ([Link](i) == ' ') {
} else {
s2_mod = s2_mod + [Link](i);
}
}

s1_mod = s1_mod.toUpperCase();
s2_mod = s2_mod.toUpperCase();

[Link](s1_mod);
[Link](s2_mod);

char[] s1_arr = s1_mod.toCharArray();

char[] s2_arr = s2_mod.toCharArray();

[Link](s1_arr);
[Link](s2_arr);

if ([Link](s1_arr, s2_arr) == true) {

[Link]("Strings are anagrams");

26 / 57
Java Interview Specific [Link] 2024-05-28

} else {
[Link]("Strings are not anagrams");
}
} else {
[Link]("Strings are not anagrams");
}
}
}

41. Leading and Tailing spaces

import [Link];

public class LeadingAndTailingSpace {

public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the String :");
String s1 = [Link]();
String s2 = "";
String s3 = "";
// " Hi good evening "

for (int i = 0; i < [Link](); i++) {

if ((i + 1) != [Link]()) {
if ([Link](i) == ' ' && [Link](i + 1) == ' ') {

} else {
s2 = s2 + [Link](i);
}
}
}

if ([Link](0) == ' ' || [Link]([Link]() - 1) == ' ') {

for (int i = 1; i <= [Link]() - 1; i++) {
s3 = s3 + [Link](i);
}
}

[Link](s3);
[Link]([Link]([Link]() - 1));
}
}

42. Password validation

import [Link];

public class PasswordValidation {

public static void validation(String s)
27 / 57
Java Interview Specific [Link] 2024-05-28

{
int cond1=0,cond2=0,cond3=0,cond4=0;
if([Link]()>=8 && [Link]()<=15)
{
for(int i=0;i<=[Link]()-1;i++) {
if([Link](" ")) {
[Link]("Not a valid Password");
}
else {
if([Link](i)>=48 && [Link](i)<=57)
{
cond1++;
}
if([Link](i)>=97 && [Link](i)<=122)
{
cond2++;
}
if([Link](i)>=65 && [Link](i)<=90)
{
cond3++;
}
if([Link](i)>=35 && [Link](i)<=38)
{
cond4++;
}
}
}
}
else {
[Link]("Invalid Password");
}

if(cond1>0 && cond2>0 && cond3>0 && cond4>0) {

[Link]("Valid password");
}
else {
[Link]("Invalid password");
}

}
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the String :");
String s1 = [Link]();
validation(s1);
}
}

43. Reverse String Word wise

28 / 57
Java Interview Specific [Link] 2024-05-28

public class ReverseWordByWord21 {

public static void main(String[] args) {
String s1 = "Hi Good Evening";
int count = 0;
String s2 = "";
int arr_pos = 0;
//word count in the string
for(int i=0;i<[Link]();i++)
{
if([Link](i)==' ')
{
count++;
}
}
//Used for storing the reversed words
String arr[] = new String[count+1];
//traversing the string in reverse order
for(int i=[Link]()-1;i>=0;i--)
{
if([Link](i)!=' ')//' ' != ' '
{
s2 = s2 + [Link](i);//iH
}
else {
arr[arr_pos] = s2;//gninevE,doog
//arr[0] = "gninevE";
//arr[1] = "doog";
arr_pos++;
s2 = "";
}
}
arr[arr_pos] = s2;//iH

//arr[0] = "gninevE";
//arr[1] = "doog";
//arr[2] = "iH";

for(int i=[Link]-1;i>=0;i--) {
[Link](arr[i]+" ");
}

}
}

44. Odd Occurrence element

import [Link];

public class CountOddOcc {

29 / 57
Java Interview Specific [Link] 2024-05-28

public static void main(String[] args) {

int arr[] = {1,2,3,1,1,2,2,3,3,4,4,5,5,5,5,5,6,6,7};
int count=0;
TreeSet ts = new TreeSet();
for(int i=0;i<[Link];i++) {

for(int j=0;j<[Link];j++) {
if(arr[i]==arr[j]) {
count++;
}
}
if(count%2 != 0) {
[Link](arr[i]);
}
count=0;

}
[Link](ts);
}
}

45. Data types ranges

import [Link];

class DataTypes{
public static void main(String []argh)
{
Scanner sc = new Scanner([Link]);
//int t=[Link]();

// for(int i=1;i<=t;i++)
// {
// try
// {
long x=[Link]();
[Link](x+" can be fitted in: ");
if(x>=-128 && x<=127) {[Link]("* byte");}
if(x>=Short.MIN_VALUE && x<=Short.MAX_VALUE)
{[Link]("* short");}
if(x>=Integer.MIN_VALUE && x<=Integer.MAX_VALUE)
{[Link]("* int");}
if(x>=Long.MIN_VALUE && x<=Long.MAX_VALUE)
{[Link]("* long");}
// }
// catch(Exception e)
// {
// [Link]([Link]()+" can't be fitted
anywhere.");
// }
//

30 / 57
Java Interview Specific [Link] 2024-05-28

// }
}
}

46. 3D Jagged Array

import [Link];
//3D Jagged Array
public class LaunchSchool {
public static void main(String[] args) {
String arr[][][] = new String[2][][];
Scanner sc = new Scanner([Link]);
for(int i=0;i<[Link];i++) {

[Link]("Emter the class count :");

int n = [Link]();
[Link]("Emter the student count :");
int m = [Link]();
arr[i] = new String[n][m];
}

[Link]("---------");

for(int i=0;i<[Link];i++)//school
{
[Link]("inside school no: "+(i+1));
for(int j=0;j<arr[i].length;j++) {
[Link]("inside class no: "+(j+1));
for(int k=0;k<arr[i][j].length;k++) {
[Link]("Student "+(k+1)+" Please Enter
the feedback:");
arr[i][j][k] = [Link]();
}
}
}

for(int i=0;i<[Link];i++)//school
{
[Link]("inside school no: "+(i+1));
for(int j=0;j<arr[i].length;j++) {
[Link]("inside class no: "+(j+1));
for(int k=0;k<arr[i][j].length;k++) {
[Link]("Feedback from Student-"+(k+1+" is
: "+arr[i][j][k]));
}
}
}
}
}

31 / 57
Java Interview Specific [Link] 2024-05-28

47. 2D Jagged Array

import [Link];

public class LaunchSchool2 {

public static void main(String[] args) {
String arr[][] = new String[3][];
Scanner sc = new Scanner([Link]);

for (int i = 0; i < [Link]; i++) {

[Link]("Emter the student count :");
int m = [Link]();
arr[i] = new String[m];
}

for(int i=0;i<[Link];i++) {
[Link]("inside class no: "+(i+1));
for(int j=0;j<arr[i].length;j++) {
[Link]("Student "+(j+1)+" Please Enter the
name:");
arr[i][j] = [Link]();
}
}

for(int i=0;i<[Link];i++) {
[Link]("inside class no: "+(i+1));
for(int j=0;j<arr[i].length;j++) {
[Link]("Student "+(j+1)+" name is : "+arr[i]
[j]);
}
}
}
}

48. Functional Interface

@FunctionalInterface //annotation
interface Calculator
{
// void div();
void add();//by default it is abstract
default void sub()
{
[Link]("inside sub");
}
static void mul()
{
[Link]("inside mul");
}
}

32 / 57
Java Interview Specific [Link] 2024-05-28

class Launch2 implements Calculator{

public void add() {

[Link]("inside add");
}
// default void sub()
// {
//
// }
static void mul()
{
[Link]("inside mul of launch-2");
}

public class Launch1

{
public static void main(String[] args) {
[Link]();
[Link]();
Launch2 l2 = new Launch2();
[Link]();
[Link]();
[Link]();
}
}

49. Lambda Expression

//any method inside an interface by default is abstract
@FunctionalInterface
interface Calcy1
{
public abstract void add(int a, int b);//abstract
}
@FunctionalInterface
interface Calcy2
{
public abstract void add();//abstract
}
public class Launch4 {
public static void main(String[] args) {
int a=10;
int b=20;
Calcy1 c1 = (a1,b1)->{
// int a = 10;
// int b = 20;
int res = a1+b1;
[Link](res);
};

33 / 57
Java Interview Specific [Link] 2024-05-28

[Link](a,b);
[Link](c1);

Calcy2 c2 = ()->{
// int a = 10;
// int b = 20;
int res = a+b;
[Link](res);
};
[Link]();

}
}

50. JDBC - Create database

import [Link];
import [Link];
import [Link];
import [Link];

public class Challenge1 {

private static String url="jdbc:mysql://localhost:3306/DB_name";
private static String user="root";
private static String pwd="root";
private static Connection con;
private static Statement stmt;

public static void main(String[] args) throws Exception {

Scanner sc = new Scanner([Link]);
[Link]("[Link]");
con = [Link](url, user, pwd);

[Link]("Enter the Database name:");

String db_name = [Link]();

String sql = "Create database "+db_name;

stmt = [Link]();
[Link](sql);

[Link]("Database Created");

[Link]();
[Link]();

}
}

51. JDBC - Create Table

34 / 57
Java Interview Specific [Link] 2024-05-28

import [Link];
import [Link];
import [Link];
import [Link];
import [Link];

public class Challenge2 {

private static String url="jdbc:mysql://localhost:3306/JDBC_Session";
private static String user="root";
private static String pwd="root";
private static Connection con;
private static Statement stmt;
private static PreparedStatement pstmt;

public static void main(String[] args) throws Exception {

Scanner sc = new Scanner([Link]);
[Link]("[Link]");
con = [Link](url, user, pwd);

[Link]("Enter the table name:");

String tb_name = [Link]();

String sql = "Create table "+tb_name+" "

+ "(Product_id int,Product_name varchar(60),Product_cost
int,Product_available_quantity int,Product_rating int,Product_owner
varchar(60))";

stmt = [Link]();
// pstmt = [Link](sql);
[Link](sql);
// [Link]();
[Link]("Table Created");

[Link]();
[Link]();

}
}

52. JDBC - Insert data

import [Link];
import [Link];
import [Link];
import [Link];

public class Challenge3 {

private static String url="jdbc:mysql://localhost:3306/JDBC_Session";
private static String user="root";
private static String pwd="root";

35 / 57
Java Interview Specific [Link] 2024-05-28

private static Connection con;

private static PreparedStatement pstmt;

public static void main(String[] args) throws Exception {

Scanner sc = new Scanner([Link]);
[Link]("[Link]");
con = [Link](url, user, pwd);

String sql = "insert into ecommerce values(?,?,?,?,?,?)";

pstmt = [Link](sql);
[Link](1, 1);
[Link](2, "mobile");
[Link](3, 20000);
[Link](4, 40);
[Link](5, 5);
[Link](6, "Samsung");
[Link]();

[Link]("Table data added");

[Link]();
[Link]();
}

53. JDBC - Select All

import [Link];
import [Link];
import [Link];
import [Link];
import [Link];
import [Link];

public class Challenge4 {

private static String url="jdbc:mysql://localhost:3306/JDBC_Session";
private static String user="root";
private static String pwd="root";
private static Connection con;
private static Statement stmt;
private static PreparedStatement pstmt;
private static ResultSet res;

public static void main(String[] args) throws Exception {

Scanner sc = new Scanner([Link]);
[Link]("[Link]");
con = [Link](url, user, pwd);

String sql = "Select * from Ecommerce";

36 / 57
Java Interview Specific [Link] 2024-05-28

stmt = [Link]();
res = [Link](sql);
while([Link]()) {
[Link]([Link](1));
[Link]([Link](2));
[Link]([Link](3));
[Link]([Link](4));
[Link]([Link](5));
[Link]([Link](6));
}
[Link]();
[Link]();
[Link]();
}

54. JDBC - Select specific

import [Link];
import [Link];
import [Link];
import [Link];
import [Link];

public class Challenge5 {

private static String url="jdbc:mysql://localhost:3306/JDBC_Session";
private static String user="root";
private static String pwd="root";
private static Connection con;
private static PreparedStatement pstmt;
private static ResultSet res;

public static void main(String[] args) throws Exception {

Scanner sc = new Scanner([Link]);
[Link]("[Link]");
con = [Link](url, user, pwd);

String sql = "select * from ecommerce where product_price > ?";

pstmt = [Link](sql);
[Link](1, 2000);
res = [Link](sql);
while([Link]()) {
[Link]([Link](1));
[Link]([Link](2));
[Link]([Link](3));
[Link]([Link](4));
[Link]([Link](5));
[Link]([Link](6));
}
[Link]();

37 / 57
Java Interview Specific [Link] 2024-05-28

[Link]();
}

55. JDBC - Update

import [Link];
import [Link];
import [Link];
import [Link];
import [Link];

public class Challenge5 {

private static String url="jdbc:mysql://localhost:3306/JDBC_Session";
private static String user="root";
private static String pwd="root";
private static Connection con;
private static PreparedStatement pstmt;
private static ResultSet res;

public static void main(String[] args) throws Exception {

Scanner sc = new Scanner([Link]);
[Link]("[Link]");
con = [Link](url, user, pwd);

String sql = "select * from ecommerce where product_price > ?";

pstmt = [Link](sql);
[Link](1, 2000);
res = [Link](sql);
while([Link]()) {
[Link]([Link](1));
[Link]([Link](2));
[Link]([Link](3));
[Link]([Link](4));
[Link]([Link](5));
[Link]([Link](6));
}
[Link]();
[Link]();
}

56. 1D Array
import [Link];

public class ArrayCode1 {

38 / 57
Java Interview Specific [Link] 2024-05-28

public static void main(String[] args) {

Scanner sc = new Scanner([Link]);
[Link]("Enter the count of students");
int n = [Link]();
int arr[] = new int[n];//one dimensional array
//storing the data
for(int i=0;i<[Link];i++) {
[Link]("Enter the marks of student no: "+(i+1));
arr[i] = [Link]();
}
[Link]("###### ----- Marks added ----- ######");
//fetching the data
for(int i=0;i<[Link];i++) {
[Link]("The marks of student no: "+(i+1)+" is =
"+arr[i]);
}
}
}

57. 2D Array
import [Link];

/* (i) (j)
* class students
* 0 5
* 1 5
* 2 5
*/
public class ArrayCode2 {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the count of classes: ");
int cls = [Link]();
[Link]("Enter the count of students: ");
int stu = [Link]();
int arr[][] = new int[cls][stu];//two dimensional array
//storing the marks
for(int i=0;i<[Link];i++) {
[Link]("Inside class :"+(i+1));
for(int j=0;j<arr[i].length;j++) {
[Link]("Enter marks of student no: "+(j+1));
arr[i][j] = [Link]();
}
}
//fetching the marks
for(int i=0;i<[Link];i++) {
[Link]("Inside class :"+(i+1));
for(int j=0;j<arr[i].length;j++) {
[Link]("The marks of student no: "+(j+1)+" is:
"+arr[i][j] );

39 / 57
Java Interview Specific [Link] 2024-05-28

}
}
}
}

58. Method Overloading

class Calculator{
int add(int a, int b) {
return a+b;
}
float add(float a, float b) {
return a+b;
}
double add(double a,double b) {
return a+b;
}
int add(int a, int b, int c) {
return a+b+c;
}
float add(int a, float b) {
return a+b;
}
float add(float a, int b) {
return a+b;
}
}

public class MethodOverloadingExmp {

public static void main(String[] args) {
Calculator c = new Calculator();
[Link]([Link](10, 20));
[Link]([Link](20.4f, 30.5f));
[Link]([Link](10, 20, 30));
}
}

59. WAP to replace all the vowels with a special character specified
/*
* a --> @
* e --> #
* i --> $
* o --> %
* u --> &
*
* Sample i/p : aeiou
* Sample o/p : @#$%&
*/
40 / 57
Java Interview Specific [Link] 2024-05-28

import [Link];
public class StringCode12 {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the string: ");
String str = [Link]();
str = [Link]();
int vowels_cnt=0;
int cons_cnt=0;
String str2="";
for(int i=0;i<[Link]();i++) {
if([Link](i)=='a') {
str2=str2+"@";
}
else if([Link](i)=='e') {
str2=str2+"#";
}
else if([Link](i)=='i') {
str2=str2+"$";
}
else if([Link](i)=='o') {
str2=str2+"%";
}
else if([Link](i)=='u') {
str2=str2+"&";
}
else {
str2=str2+[Link](i);
}
}
[Link](str2);
}
}

60. Remove the unnecessary spaces in between the strings

import [Link];
public class StringCode13 {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the string: ");
String str = [Link]();
str = [Link]();

String str2="";
for(int i=0;i<[Link]();i++) {
if([Link](i)==' ' && [Link](i+1)==' ') {

}
else {
str2=str2+[Link](i);

41 / 57
Java Interview Specific [Link] 2024-05-28

}
}
[Link](str2);
}
}

61. Few Built-in methods of Strings Class

public class StringCode6 {
public static void main(String[] args) {
String s1 = "MaHaBharatHA";
[Link]([Link]());//MAHABHARATHA
[Link]([Link]());//mahabharatha
[Link]([Link](5));//h

//[Link]([Link](50));//ArrayIndexOutOfBoundException
[Link]([Link]('B'));
[Link]([Link]('z'));
[Link]([Link]("MaHa"));//true
[Link]([Link]("Vaha"));//false
[Link]([Link]("ratHA"));//true
[Link]([Link]("Vaha"));//false
[Link]([Link]("Bharat"));//true
[Link]([Link]("Vharat"));//false
[Link]([Link]());
[Link]([Link]());
[Link]([Link]());
[Link]([Link]('a'));
}
}

62. find the longest common prefix string amongst an array of strings
import [Link];

public class LongestCommonPrefix {

public static String findPrefix(String[] strs) {
[Link](strs);
String s1 = strs[0];
String s2 = strs[[Link]-1];
int i = 0;
while(i < [Link]() && i < [Link]()){
if([Link](i) == [Link](i)){
i++;
} else {
break;
}
}
return [Link](0, i);
42 / 57
Java Interview Specific [Link] 2024-05-28

}
public static void main(String[] args) {
String str[] = {"flower","flow","blight"};
String prefix = findPrefix(str);
[Link](prefix);
}
}

63. Pascal's triangle

import [Link];
import [Link];
/*
* 1
* 1 1
* 1 2 1
* 1 3 3 1
* 1 4 6 4 1
*/
public class PascalTriangle {
public static List<List<Integer>> pascalTriangle(int numRows) {
List<List<Integer>> list = new ArrayList<>();
List<Integer> row, pre = null;
for (int i = 0; i < numRows; i++) {
row = new ArrayList<>();
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i)
[Link](1);
else
[Link]([Link](j - 1) + [Link](j));
}
pre = row;
[Link](row);
}
return list;
}

public static void main(String[] args) {

[Link](pascalTriangle(5));
}
}

64. Roman Conversion

public class RomanConversion {
public static int convert(String s) {
int ans = 0, num = 0;
for (int i = [Link]() - 1; i >= 0; i--) {
switch ([Link](i)) {
43 / 57
Java Interview Specific [Link] 2024-05-28

case 'I':
num = 1;
break;
case 'V':
num = 5;
break;
case 'X':
num = 10;
break;
case 'L':
num = 50;
break;
case 'C':
num = 100;
break;
case 'D':
num = 500;
break;
case 'M':
num = 1000;
break;
}
if (4 * num < ans)
ans = ans - num;
else
ans = ans + num;
}
return ans;//14
}

public static void main(String[] args) {

[Link](convert("IVX"));
}
}

65. Universal Pattern

import [Link];

public class UniversalPat {

public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value of n: ");
int n = [Link]();

for(int i=0;i<n;i++) {
for(int j=0;j<n;j++) {
if(i==0 || i==(n-1) // first and last rows
|| j==0 || j==(n-1)// first and last column
|| i==(n/2) || j==(n/2)// middle row and column
|| i==j // first big diagonal (left to right)

44 / 57
Java Interview Specific [Link] 2024-05-28

|| i+j == (n-1) // second big diagonal (right to left)

|| i+j == (n/2) // first small diagonal (top left to
right)
|| j-i == (n/2) // second small diagonal (top right to
left)
|| i-j == (n/2) // third small diagonal (bottom right to
left))
|| i+j == (n-1)+n/2 //fourth small diagonal (bottom left
to right)
)
{
[Link]("* ");
}
else {
[Link](" ");
}
}
[Link]();
}
}
}

66. Pattern-1
/*
* 1 1 1 1 1
* 2 2 2 2 2
* 3 3 3 3 3
* 4 4 4 4 4
* 5 5 5 5 5
*/
public class Program{
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();

for(int i=1;i<=n;i++) {
for(int j=1;j<=n;j++) {
[Link](i+" ");
}
[Link]();
}

}
}

66. Pattern-2

45 / 57
Java Interview Specific [Link] 2024-05-28

/*
* 1 2 3 4 5
* 1 2 3 4 5
* 1 2 3 4 5
* 1 2 3 4 5
* 1 2 3 4 5
*/
public class Program{
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();

for(int i=1;i<=n;i++) {
for(int j=1;j<=n;j++) {
[Link](j+" ");
}
[Link]();
}

}
}

67. Pattern-3
/*
* 1 2 3 4 5
* 6 7 8 9 10
* 11 12 13 14 15
* 16 17 18 19 20
* 21 22 23 24 25
*/
public class Program{
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();
int count = 1;
for(int i=1;i<=n;i++) {
for(int j=1;j<=n;j++) {
[Link](count+" ");
count++;
}
[Link]();
}

}
}

46 / 57
Java Interview Specific [Link] 2024-05-28

68. Pattern-4
/*
* 25 24 23 22 21
* 20 19 18 17 16
* 15 14 13 12 11
* 10 9 8 7 6
* 5 4 3 2 1
*/
public class Program{
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();
int count = n*n;
for(int i=1;i<=n;i++) {
for(int j=1;j<=n;j++) {
[Link](count+" ");
count--;
}
[Link]();
}

}
}

69. Pattern-5
/*
* 1 6 11 16 21
* 2 7 12 17 22
* 3 8 13 18 23
* 4 9 14 19 24
* 5 10 15 20 25
*/
public class Program{
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();
int count = 1;
for(int i=1;i<=n;i++) {
count=i;
for(int j=1;j<=n;j++) {
[Link](count+" ");
count = count+n;
}
[Link]();
}

47 / 57
Java Interview Specific [Link] 2024-05-28

}
}

70. Pattern-6
/*
* @
* @ @
* @ @ @
* @ @ @ @
* @ @ @ @ @
*/
public class Program{
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();
for(int i=1;i<=n;i++) {
for(int j=1;j<=i;j++) {
[Link]("@ ");
}
[Link]();
}

}
}

71. Patter-7
/*
* * * * * *
* * * * *
* * * *
* * *
* *
*/
public class Program{
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();
for(int i=1;i<=n;i++) {
for(int j=n;j>=i;j--) { //*
[Link]("* ");
}
[Link]();
}

48 / 57
Java Interview Specific [Link] 2024-05-28

}
}

72. Pattern-8
/*
* 1
* 2 2
* 3 3 3
* 4 4 4 4
* 5 5 5 5 5
*/
public class Program{
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();
for(int i=1;i<=n;i++) {
for(int j=1;j<=i;j++) {
[Link](i+" ");
}
[Link]();
}

}
}

73. Pattern-9
/*
* 1
* 1 2
* 1 2 3
* 1 2 3 4
* 1 2 3 4 5
*/

public class Program{

public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();
for(int i=1;i<=n;i++) {
for(int j=1;j<=i;j++) {
[Link](j+" ");
}
[Link]();
}

49 / 57
Java Interview Specific [Link] 2024-05-28

}
}

74. Pattern-10
/* 1
* 2 3
* 4 5 6
* 7 8 9 10
* 11 12 13 14 15
*/
public class Program{
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int count=1;
int n = [Link]();
for(int i=1;i<=n;i++) {
for(int j=1;j<=i;j++) {
[Link](count+" ");
count++;
}
[Link]();
}

}
}

75. Conditional Statement

/*
* Conditional Statements: These are the statements that are used to
specify a conditional check before the
* execution of a particular statement.
* The conditional statements in programming are:
* 1. if condition
* 2. else if condition
* 3. else condition
*
* if(condition)
* {
* this block of code will execute if the condition inside if is
satisfied
* }
* ----- in-case condition inside if fails then the else if condition will
be checked ----
*
*
* else if(condition)
50 / 57
Java Interview Specific [Link] 2024-05-28

* {
* this block of code will execute if the condition inside else if is
satisfied
* }
*
* ----- in-case condition inside else if also fails then the else
condition will be executed directly ----
*
* else
* {
* this block of code is directly executed if both if and else if
fails.
* }
*
*/

public class Program{

public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the age: ");
int age = [Link]();

if(age < 18)

{
[Link]("You are still a minor. Please grow up and
then think of marriage");
}
else if(age > 65)
{
[Link]("You are a senior citizen. Stop expecting
too much");
}
else
{
[Link]("You are the most eligible groom/bride");
}
}
}

76. Pattern - 11
/*
* # # # # #
* # - - - #
* # - - - #
* # - - - #
* # # # # #
*/

public class Program{

public static void main(String[] args) {

51 / 57
Java Interview Specific [Link] 2024-05-28

Scanner sc = new Scanner([Link]);

[Link]("Enter the value:");
int n = [Link]();
for(int i=1;i<=n;i++) {
for(int j=1;j<=n;j++) {
if(i==1 || i==n || j==1 || j==n) {
[Link]("# ");
}
else {
[Link]("- ");
}
}
[Link]();
}

}
}

77. Pattern-12
/*
* #
* # #
* # - #
* # - - #
* # # # # #
*/

public class Program{

public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();
for(int i=0;i<=n-1;i++) {
for(int j=0;j<=i;j++) {
if(j==0 || i==j || i==n-1) {
[Link]("# ");
}
else {
[Link]("- ");
}
}
[Link]();
}

}
}

78. Alphabet-A
52 / 57
Java Interview Specific [Link] 2024-05-28

public class Program{

public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();
for(int i=0;i<=n-1;i++) {
for(int j=0;j<=n-1;j++) {
if(j==0 || j==n/2 ||
(i==n/2 && j<=n/2) ||
(i==0 && j<=n/2)) {
[Link]("# ");
}
else {
[Link](" ");
}
}
[Link]();
}

}
}

79. Alphabet-B
public class Program{
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();
for(int i=0;i<=n-1;i++) {
for(int j=0;j<=n-1;j++) {
if(j==0 || (j==n/2 && i!=0 && i!=n/2 && i!=(n-1))||
(i==n/2 && j<n/2) ||
(i==0 && j<n/2) ||
(i==(n-1) && j<n/2)) {
[Link]("# ");
}
else {
[Link](" ");
}
}
[Link]();
}

}
}

80. Alphabet-C
53 / 57
Java Interview Specific [Link] 2024-05-28

public class Program{

public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();
for(int i=0;i<=n-1;i++) {
for(int j=0;j<=n-1;j++) {
if((j==0 && i!=0 && i!=(n-1)) ||
i==0 && j!=0 && j<n/2||
i==(n-1) && j!=0 && j<n/2) {
[Link]("# ");
}
else {
[Link](" ");
}
}
[Link]();
}

}
}

81. Alphabet-D
public class Program{
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();
for(int i=0;i<=n-1;i++) {
for(int j=0;j<=n-1;j++) {
if(j==0 || (i==0 && j<n/2) || (i==n-1 && j<n/2)
|| (j==n/2 && i!=0 && i!=n-1)) {
[Link]("# ");
}
else {
[Link](" ");
}
}
[Link]();
}

}
}

82. Alphabet-E

54 / 57
Java Interview Specific [Link] 2024-05-28

public class Program{

public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();
for(int i=0;i<=n-1;i++) {
for(int j=0;j<=n-1;j++) {
if(j==0 || (i==0 && j<n/2) || (i==n-1 && j<n/2)
|| (i==n/2 && j<n/2)) {
[Link]("# ");
}
else {
[Link](" ");
}
}
[Link]();
}

}
}

83. Alphabet-F
public class Program{
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter the value:");
int n = [Link]();
for(int i=0;i<=n-1;i++) {
for(int j=0;j<=n-1;j++) {
if(j==0 || (i==0 && j<n/2)
|| (i==n/2 && j<n/2)) {
[Link]("# ");
}
else {
[Link](" ");
}
}
[Link]();
}

}
}

84. Alphabet-G
public class Program{
public static void main(String[] args) {

55 / 57
Java Interview Specific [Link] 2024-05-28

Scanner sc = new Scanner([Link]);

[Link]("Enter the value:");
int n = [Link]();
for(int i=0;i<=n-1;i++) {
for(int j=0;j<=n-1;j++) {
if((j==0 && i!=0 && i!=(n-1)) ||
(i==0 && j!=0 && j<=n/2) ||
(i==n/2 && j>n/4 && j<n/2) ||
(i==(n-1) && j>0 && j<=n/4)||
(j==(n/4) && i>n/2) ||
(j==(n/2) && i>n/2)) {
[Link]("# ");
}
else {
[Link](" ");
}

}
[Link]();
}

}
}

85. Custom Exception

package [Link];

import [Link];

class OverAgeExpcetion extends Exception{

public String getMessage()
{
return "Invalid Age. Your age is above 60";
}
}
class UnderAgeExpcetion extends Exception{
public String getMessage()
{
return "Invalid Age. Your age is below 18";
}
}
class Customer
{
private int age;

void getData()
{
Scanner sc = new Scanner([Link]);
[Link]("Enter the age : ");
age = [Link]();

56 / 57
Java Interview Specific [Link] 2024-05-28

}
void verify()
{
if(age<18)
{
UnderAgeExpcetion uae = new UnderAgeExpcetion();
[Link]([Link]());
}
else if(age>60) {
OverAgeExpcetion oae = new OverAgeExpcetion();
[Link]([Link]());
}
else {
[Link]("Accepted");
}
}
}
public class CustomException {
public static void main(String[] args) {
Customer c = new Customer();
[Link]();
[Link]();
}
}

57 / 57