Java Anagram-HackerRank Solution

Two strings, a and b , are called anagrams if they contain all the same characters in the same frequencies. For this challenge, the test is not case-sensitive. For example, the anagrams of CAT are CAT, ACT, tac, TCA, aTC, and CtA.

Function Description

Complete the isAnagram function in the editor.
isAnagram has the following parameters:

•     string a: the first string
•     string b: the second string

Returns

•     boolean: If a and b are case-insensitive anagrams, return true.       Otherwise, return false.

Input Format

• The first line contains a string
• The second line contains a string .

Constraints

• 1<=length(a),length(b)<=50
• String a and b consist of English alphabetic characters.
• The comparsion should NOT be case sensitive.

sample input 0

anagram
margana

Sample Output 0

Anagrams


Explanation 0

 

 

The two strings contain all the same letters in the same frequencies, so we print "Anagrams".

Sample Input 1

anagramm
marganaa

Sample Output 1

Not Anagrams

Explanation 1

 

The two strings don't contain the same number of a's and m's, so we print "Not Anagrams".

Sample Input 2

Hello
hello

Sample Output 2

Anagrams

Explanation 2

The two strings contain all the same letters in the same frequencies, so we print "Anagrams".

Solution

 import java.util.Scanner;

 public class Solution {

 static boolean isAnagram(String a, String b) {
 a=a.toUpperCase();
 b=b.toUpperCase();
 boolean ret = false;
 StringBuilder c= new StringBuilder(b);

 if(a.length()==b.length()){
 for(int i=0; i<a.length();i++){
 for(int j=0; j<c.length();j++){
 if(a.charAt(i)==c.charAt(j)){
 c.deleteCharAt(j);
 if(i==a.length()-1 && c.length()==0){
 ret=true;
 break;
 }
 break;
 }
 }
 }
 }return ret;
 }
 public static void main(String[] args) {

 Scanner scan = new Scanner(System.in);
 String a = scan.next();
 String b = scan.next();
 scan.close();
 boolean ret = isAnagram(a, b); 
 System.out.println( (ret) ? "Anagrams" : "Not Anagrams" );
 }
}