From 32a41321b9a00ee11f497c65f7729a156daea1f1 Mon Sep 17 00:00:00 2001 From: "Shagun.rathore" Date: Thu, 6 Oct 2022 02:25:00 +0530 Subject: [PATCH] Fixed anagram hashing and added sorting --- .../Data_structure/AnagramTechniques.java | 12 +++++++++++- 1 file changed, 11 insertions(+), 1 deletion(-) diff --git a/Program's_Contributed_By_Contributors/Java_Programs/Data_structure/AnagramTechniques.java b/Program's_Contributed_By_Contributors/Java_Programs/Data_structure/AnagramTechniques.java index 377cf9149f..afb40e8f59 100644 --- a/Program's_Contributed_By_Contributors/Java_Programs/Data_structure/AnagramTechniques.java +++ b/Program's_Contributed_By_Contributors/Java_Programs/Data_structure/AnagramTechniques.java @@ -12,7 +12,17 @@ public static boolean isAnnagramUsingFrequencyCounter(String s, String t) { // You can use py counters -- return Counter(s) == Counter(t) } - + public static boolean isAnagramUsingSorting(String s, String t) { + if (s.length() != t.length()) return false; + // You can use py counters -- return Counter(s) == Counter(t) + // You can also use sroting -- sorted(s) == sorted(t) -- PY || O(nlogn) /O(1) + char[] str1 = s.toCharArray(); + char[] str2 = t.toCharArray(); + Arrays.sort(str1); + Arrays.sort(str2); + return Arrays.equals(str1, str2); + } + public static boolean isAnagramIUsingHash(String s, String t) { if (s.length() != t.length()) return false;