Move History

Rooted by: Anagram
Fork Selected
  • Code 
    def is_anagram(s1, s2):
    n1 = map(ord, s1)
    n2 = map(ord, s2)
    return sum(n1) == sum(n2) and sorted(n1) == sorted(n2) and len(s1) == len(s2)
    Test Cases 
    import codewars_test as test
from solution import is_anagram

@test.describe("Example")
def test_group():
    @test.it("test case 1: is Anagram True")
    def test_case():        
        true_samples = (
            
            (('listen', 'silent'), True),
            (('race', 'care'), True),
            (('night', 'thing'), True),)
        for s, e in true_samples:
            test.assert_equals(is_anagram(s[0], s[1]), e)
    
    @test.it("test case 2: is Anagram False")
    def test_case():  
        false_samples = (
            (('abcd', 'abc'), False),
            (('anagram', 'nag a ram'), False),
            (('night', 'things'), False),)
        
        for s, e in false_samples:
            test.assert_equals(is_anagram(s[0], s[1]), e)
    View Run Output
  • Code
    • def is_anagram(s1, s2):
    • n1 = [ord(i) for i in s1]
    • n2 = [ord(i) for i in s2]
    • n1 = map(ord, s1)
    • n2 = map(ord, s2)
    • return sum(n1) == sum(n2) and sorted(n1) == sorted(n2) and len(s1) == len(s2)