6-liner: elegant partition clear solution for Greedy Number by przemyslaw.daniel - python coding challenges

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

6-liner: elegant partition solution in Clear category for Greedy Number by przemyslaw.daniel

def greedy_number(line: str, length: int) -> str:
    if not length:
        return ''
    best = max(line[:-length + 1 or None])
    _, digit, line = line.partition(best)
    return digit + greedy_number(line, length - 1)

Nov. 6, 2021

Comments:

vvm70 on Jan. 28, 2022, 11:55 a.m.
<p>Good use of str.partition. What happens if you pass None in slicing?</p>

przemyslaw.daniel on Jan. 28, 2022, 12:44 p.m.
<p>if you think of line #4 then it could not be None passed to the str.partition but entire line. "best = max(line[:None])" is the same as "best = max(line)"</p>

Rock

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.