Use Helper Functions

Les œufs d'Eliud
Les œufs d'Eliud dans le parcours Python 
def egg_count(display_value):
    return count_ones(convert_to_binary(display_value))


def convert_to_binary(decimal_value):
    binary_value = ""

    while decimal_value > 0:
        binary_value += str(decimal_value % 2)
        decimal_value //= 2

    return binary_value[::-1] if binary_value else "0"


def count_ones(binary_value):
    count = 0

    for digit in binary_value:
        count += int(digit)

    return count

This approach breaks the problem down into multiple helper functions that are called from egg_count(). First, convert_to_binary() is used to convert display_value to a binary string. Then, count_ones() is called to count the number of ones in that string.

In this specific version of the approach, convert_to_binary() is implemented similarly to the modify the argument in a loop approach. The main differences are that the bits are converted to strings and concatenated (rather than being added together), and that a conditional expression (also called a ternary operator) is used to handle the edge case of a 0.

Note

Here, the or operator could be used instead of a conditional expression:

return binary_value[::-1] or "0"

Which one to use is mostly a matter of preference and readability.

The count_ones() helper function is implemented very similarly to the convert to a binary string approach. The only difference is that it takes the binary string as an argument rather than calculating it.

Though breaking a problem up into helper functions may facilitate code reuse, here it adds unnecessary overhead to the solution. This approach is also complicated by additional edge cases, such as making convert_to_binary() return "0" instead of an empty string when given the number 0. Additionally, the edge case of negative numbers is not handled, and doing so would complicate the solution even further:

def convert_to_binary(decimal_value):
    if decimal_value < 0:
        return "-" + convert_to_binary(-decimal_value)

    binary_value = ""

    while decimal_value > 0:
        binary_value += str(decimal_value % 2)
        decimal_value //= 2

    return binary_value[::-1] or "0"

Due to these scenarios, one may decide to forego handling all the edge cases. However, when your future self (or someone else) tries to reuse the function, edge cases could produce errors or unexpected results.

23 septembre 2026 · Tu l'as trouvée utile ?

Autres approches pour l'exercice Les œufs d'Eliud dans le parcours Python

D'autres façons dont notre communauté a résolu cet exercice
def egg_count(display_value):
    eggs = 0
    while display_value:
        eggs += display_value % 2
        display_value //= 2
    return eggs
Modify the Argument in a Loop

Modify the argument in a while-loop to determine the number of eggs. 

from math import ceil, log2

def egg_count(display_value):
    eggs = 0
    for bit_position in range(ceil(log2(display_value + 1))):
        eggs += (display_value >> bit_position) & 1
    return eggs
Loop Without Modifying the Argument

Loop over the bits without modifying the argument to calculate the number of eggs. 

def egg_count(display_value):
    binary_value = bin(display_value)[2:]
    eggs = 0
    for digit in binary_value:
        eggs += int(digit)
    return eggs
Convert to a Binary String

Convert the argument to a binary string and count its ones to determine the number of eggs. 

def egg_count(display_value):
    return display_value.bit_count()
Use the Built-In Bit-Count Functionality

Use Python's built-in bit-count functionality to calculate the number of eggs.