HackerRank ‘Make it Anagram’ Solution

Short Problem Definition:

Alice recently started learning about cryptography and found that anagrams are very useful. Two strings are anagrams of each other if they have same character set. For example strings"bacdc" and "dcbac" are anagrams, while strings "bacdc" and "dcbad" are not.

Alice decides on an encryption scheme involving 2 large strings where encryption is dependent on the minimum number of character deletions required to make the two strings anagrams. She need your help in finding out this number.

Given two strings (they can be of same or different length) help her in finding out the minimum number of character deletions required to make two strings anagrams. Any characters can be deleted from any of the strings.

Link

Make it Anagram

Complexity:

time complexity is O(N)

space complexity is O(N)

Execution:

Compare the frequency counts of the two parts.

The buildMap function can be replaced by:  from collections import Counter

Solution:
#!/usr/bin/py
def buildMap(s):
    the_map = {}
    for char in s:
        if char not in the_map:
            the_map[char] = 1
        else:
            the_map[char] +=1

    return the_map       

def anagram(s1, s2):
    map1 = buildMap(s1)
    map2 = buildMap(s2)

    diff_cnt = 0
    for key in map2.keys():
        if key not in map1:
            diff_cnt += map2[key]
        else:
            diff_cnt += max(0, map2[key]-map1[key])

    for key in map1.keys():
        if key not in map2:
            diff_cnt += map1[key]
        else:
            diff_cnt += max(0, map1[key]-map2[key])

    return diff_cnt

if __name__ == '__main__':
    s1 = raw_input()
    s2 = raw_input()
    print anagram(s1, s2)

If you enjoyed this post, then make sure you subscribe to my Newsletter and/or Feed.

Facebooktwittergoogle_plusredditpinterestlinkedin
  • plz try to explain what u did in each line

    • First I create a map of characters (line 14,15) . A = ‘abcda’ becomes {a = 2, b = 1, c =1, d =1} and B = ‘cdeff’ {c = 1, d = 1, e = 1, f = 2}. Then I go through all keys (abcd) in the A string and compare the map to the other map. (a is not in B so I count 2, b is not in B so I count 1, c is equal in both, d is equal in both -> the difference is 3). I do the same for the second map (giving me 1 e and 2 f). In total there are 6 differences.

      I do not use abs. I only count differences that are bigger than 0. That is because I want both compares to be symmetric. I could count an absolute difference in the first compare and skip it in the second.