From ddf83fc2dbf7b76671360df9c5c9fb6703a48440 Mon Sep 17 00:00:00 2001
From: Richa <richakumari1508@gmail.com>
Date: Sat, 3 Oct 2020 16:47:36 +0530
Subject: [PATCH] Java Anagrams program updated

---
 .../languages/java/strings/JavaAnagrams.java  | 25 ++++++++-----------
 1 file changed, 11 insertions(+), 14 deletions(-)

diff --git a/HackerRankDashboard/Languages/Java/src/main/java/com/javaaid/hackerrank/solutions/languages/java/strings/JavaAnagrams.java b/HackerRankDashboard/Languages/Java/src/main/java/com/javaaid/hackerrank/solutions/languages/java/strings/JavaAnagrams.java
index aebe269..1b2d4dd 100644
--- a/HackerRankDashboard/Languages/Java/src/main/java/com/javaaid/hackerrank/solutions/languages/java/strings/JavaAnagrams.java
+++ b/HackerRankDashboard/Languages/Java/src/main/java/com/javaaid/hackerrank/solutions/languages/java/strings/JavaAnagrams.java
@@ -12,20 +12,17 @@
 public class JavaAnagrams {
 
 	static boolean isAnagram(String a, String b) {
-		if (a.length() != b.length()) {
-			return false;
-		} else {
-			for (int i = 0; i < a.length(); i++) {
-				char ch = a.toLowerCase().charAt(i);
-				b = b.toLowerCase();
-				if (b.indexOf(ch) != -1) {
-					b = b.replaceFirst(ch + "", "");
-				} else {
-					return false;
-				}
-			}
-			return b.length() == 0;
-		}
+		 if(a.length()!=b.length())
+	            return false;
+	        int count[]=new int[26];
+	        for(int i=0;i<a.length();i++){
+	        count[a.charAt(i)-'a']++;
+	             count[b.charAt(i)-'a']--;
+	    }
+	        for(int c:count)
+	        if(c!=0)
+	            return false;
+	        return true;
 	}
 
 	public static void main(String[] args) {