Solving Anagram check problem using python and Linear Algebra and the complexity is O(n), which is 2nd lovely after constant :D

check_anagram.py

import math

def stringNorm(s):
    norm = 0
    for c in s:
        if not c==" ":
            norm+=math.pow(ord(c),2)
    return math.sqrt(norm)

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.")

Can you explain the idea behind it? 😃

First it is broken, not very good solution but the point is to calculate the norm for string using the values of each character

Check this https://gist.github.com/aessam/aede5480b7bf8d36a714 :D