First Attempt clear solution for Binary Count by mAzrunnr - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

First Attempt solution in Clear category for Binary Count by mAzrunnr

import math
def checkio(num: int) -> int:
    z = []
    while num >= 1:
        x = math.floor(math.log2(num))
        z.append(x)
        num = num - pow(2,x)
    return len(z)


# These "asserts" using only for self-checking and not necessary for auto-testing
if __name__ == "__main__":
    assert checkio(4) == 1
    assert checkio(15) == 4
    assert checkio(1) == 1
    assert checkio(1022) == 9
    print("Coding complete? Click 'Check' to review your tests and earn cool rewards!")

Nov. 14, 2021

Comments:

Orthomonalus on July 7, 2025, 6:03 p.m.
<p>While functional, this approach is more computationally intensive compared to using Python's built-in bin() function and str.count(), which provides a much more concise and efficient way to solve this particular problem.</p>

GitHub

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.