Refactored the code to reduce time complexity

algorithms/strings/anagram_check.py

@@ -1,14 +1,17 @@
-# function to check if two strings are 
-# anagram or not  
-def check(s1, s2): 
-
-    # the sorted strings are checked  
-    if(sorted(s1)== sorted(s2)): 
-        print("The strings are anagrams.")  
-    else: 
-        print("The strings aren't anagrams.")          
-
-# driver code   
-s1 ="listen" #String 1
-s2 ="silent" #String 2
-check(s1, s2)
+from collections import Counter
+
+# function to check if two strings are
+# anagram or not
+def check(s1, s2):
+
+    # implementing counter function
+    if(Counter(s1) == Counter(s2)):
+        print("The strings are anagrams.")
+    else:
+        print("The strings aren't anagrams.")
+
+
+# driver code
+s1 = "listen"
+s2 = "silent"
+check(s1, s2)