1356. Sort Integers by The Number of 1 Bits - LeetCode Solution


Sort Bit Manipulation

Python Code:

class Solution:
    def sortByBits(self, arr: List[int]) -> List[int]:

        d = []

        for i in range(len(arr)):
            s = bin(arr[i])[2:]
            a = []
            
            count = s.count("1")

            a.append(count)
            a.append(arr[i])

            d.append(a)



        d.sort()

        q = []

        for i in range(len(d)):
            q.append(d[i][1])

        return q
        


Comments

Submit
0 Comments
More Questions

1025D - Recovering BST
439A - Devu the Singer and Churu the Joker
1323A - Even Subset Sum Problem
1095A - Repeating Cipher
630F - Selection of Personnel
630K - Indivisibility
20B - Equation
600B - Queries about less or equal elements
1015A - Points in Segments
1593B - Make it Divisible by 25
680C - Bear and Prime 100
1300A - Non-zero
1475E - Advertising Agency
1345B - Card Constructions
1077B - Disturbed People
653A - Bear and Three Balls
794A - Bank Robbery
157A - Game Outcome
3B - Lorry
1392A - Omkar and Password
489A - SwapSort
932A - Palindromic Supersequence
433A - Kitahara Haruki's Gift
672A - Summer Camp
1277A - Happy Birthday Polycarp
577A - Multiplication Table
817C - Really Big Numbers
1355A - Sequence with Digits
977B - Two-gram
993A - Two Squares