[Better and some how shouldn't be broken] Solving Anagram check problem using python and Linear Algebra and the complexity is O(n), which is 2nd lovely after constant :D

a1_check_anagram.py

import math
 
def stringNorm(s):
    odd = 0
    even = 0
    for c in s:
        if not c==" ":
            if ord(c)%2==0:
                even+=math.pow(ord(c),2)
            else:
                odd+=math.pow(ord(c),2)
    return math.pow(odd,2)+math.pow(even,2)
 
def anagram_detection(s1,s2):
    return stringNorm(s1)==stringNorm(s2)

 
s1 = input("Please enter first string:  ").lower()
s2 = input("Please enter second string: ").lower()
 
 
print ("Anagram.") if anagram_detection(s1,s2) else print ("Not Anagram.")