Python Dictionary | Check if binary representations of two numbers are anagram

Given two numbers you are required to check whether they are anagrams of each other or not in binary representation.

Examples:

Input : a = 8, b = 4 
Output : Yes
Binary representations of both
numbers have same 0s and 1s.

Input : a = 4, b = 5
Output : No

Check if binary representations of two numbers

We have existing solution for this problem please refer Check if binary representations of two numbers are anagram link. We can solve this problem quickly in python using Counter(iterable) method and Dictionary Comparison. Approach is simple,

1. Convert both number into it’s binary using bin() function.
2. Since binary representation of both numbers could differ in length so we will append zeros in start of shorter string to make both string of equal length. ie.; append zeros = abs(len(bin1)-len(bin2)).
3. Convert both output string containing 0 and 1 returned by bin function into dictionary using Counter() function, having 0 and 1 keys and their count as value. Compare both dictionaries, if value of 0’s and 1’s in both dictionaries are equal then binary representations of two numbers are anagram otherwise not.

Output:

Yes

Check if binary representations of two numbers are Using zfill

This approach checks if the binary representations of two given numbers are anagrams or not. It first converts the numbers to their binary form and pads zeros to make it of length 32. It then counts the occurrences of 0s and 1s in each binary representation using two separate counters. Finally, it compares the counts of 0s and 1s for both numbers and returns “Yes” if they are equal, otherwise “No”.

Algorithm

1.  Convert both input integers into their binary representation using bin() function.
2. Fill each binary string with zeros to the left, so that they all have length of 32 bits, using zfill() method.
3. For each binary string, count the frequency of 0s and 1s and store them in count_a and count_b lists.
4. Check if the two lists are equal.
5. If the two lists are equal, return “Yes”, else return “No”.

Yes

Time complexity of this code is O(1) since the length of the binary representation is constant. 

Auxiliary Space is also O(1) since the count lists are of constant size.