Use lru_cache(), Luke! clear solution for Halloween Monsters by obone - python coding challenges

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

Use lru_cache(), Luke! solution in Clear category for Halloween Monsters by obone

MONSTERS = '''
skeleton
ghost
jack
vampire
witch
mummy
zombie
werewolf
frankenstein
'''


def halloween_monsters(spell: str) -> int:
    from functools import lru_cache

    combine = lambda w1, w2: ''.join(sorted(w1 + w2))
    contain = lambda w1, w2: min(w1.count(c) // w2.count(c) for c in w2)

    @lru_cache()
    def maximum(u = ''): return \
        max((1 + maximum(combine(u, w)) for w in MONSTERS.split()
            if contain(spell, combine(u, w))), default = 0)

    return maximum()

Oct. 19, 2019

Comments:

Ulukai85 on Aug. 6, 2022, 6:39 a.m.
<p>Wow, thanks for making me aware of LRU cache, cool solution. That seems to fit nicely here. One question though: You seem to rely heavily on strings. Wouldn't it be faster to use sets (or dicts) for this?</p>

obone on Aug. 12, 2022, 2:04 p.m.
<p>Hi! Unfortunately, I don't remember why I've chosen the string. :) Maybe I've tested set or dict. Or maybe I've forgotten data collections. I'm not the really Python programmer. :)</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.