Merge pull request #2555 from itshagunrathore/validanagramsorting

Fixed anagram hashing and added sorting

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;