0% found this document useful (0 votes)
16 views3 pages

PR 2

java practical 2 for mit adt unevercity inloni kalbhor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views3 pages

PR 2

java practical 2 for mit adt unevercity inloni kalbhor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Experiment No.

NAME: RAVIRAJ SATISH KHARADE ROLL NO- 74


A. Write a Java program that checks whether an input string is a palindrome.

import java.util.Scanner;
public class PalindromeCheck {
public static void main(String[] args) {
Scanner myObj = new Scanner(System.in)
System.out.print("Enter a string: ");
String input = myObj.nextLine();

String cleanedInput = input.replaceAll("\\s+", "").toLowerCase();

boolean isPalindrome = true;


int length = cleanedInput.length();

for (int i = 0; i < length / 2; i++) {


if (cleanedInput.charAt(i) != cleanedInput.charAt(length - i - 1)) {
isPalindrome = false;
break;
}
}
if (isPalindrome) {
System.out.println("\"" + input + "\" is a palindrome.");
} else {
System.out.println("\"" + input + "\" is not a palindrome.");
}
myObj.close();
}
}
B. Write a Java program that checks whether two input strings are anagrams
of each other.
import java.util.Arrays;
import java.util.Scanner;

public class AnagramCheck {


public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);

System.out.print("Enter the first string: ");


String firstString = scanner.nextLine();

System.out.print("Enter the second string: ");


String secondString = scanner.nextLine();

boolean areAnagrams = areAnagrams(firstString, secondString);


if (areAnagrams) {
System.out.println("\"" + firstString + "\" and \"" + secondString + "\" are
anagrams.");
} else {
System.out.println("\"" + firstString + "\" and \"" + secondString + "\" are not
anagrams.");
}
scanner.close();
}

private static boolean areAnagrams(String str1, String str2) {


str1 = str1.replaceAll("\\s+", "").toLowerCase();
str2 = str2.replaceAll("\\s+", "").toLowerCase();

if (str1.length() != str2.length()) {
return false;
}

char[] array1 = str1.toCharArray();


char[] array2 = str2.toCharArray();

Arrays.sort(array1);
Arrays.sort(array2);
return Arrays.equals(array1, array2);
}
}
OUTPUT:

You might also like