imtiaz.rahi's Pythonified clear solution for City's Happiness by veky - python coding challenges

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

imtiaz.rahi's Pythonified solution in Clear category for City's Happiness by veky

from collections import Counter

def most_crucial(net, users):
    top = dict(user=users, net=Counter(sum(net, [])))
    for name, bunch in top.items():
        max_value = max(bunch.values())
        keys = {key for key, value in bunch.items() if value == max_value}
        if len(keys) == 1: return list(keys)
        top[name] = keys
    return sorted(top['user'] & top['net'])

Aug. 31, 2019

Comments:

imtiaz.rahi on Sept. 1, 2019, 10:23 a.m.
Original solution <a href="https://py.checkio.org/mission/node-crucial/publications/imtiaz.rahi/python-3/pretty-tricky/">here</a>.

bsquare on Sept. 7, 2019, 11:56 p.m.
Nice solution!

tom-tom_f993b3abc4814d4cb5476e on Aug. 27, 2020, 5:10 p.m.
Doesn't work for 2-3-4. You've made a nice Pythonic implementation of the completely broken algorithm :)

veky on Aug. 27, 2020, 6:28 p.m.
As I said, I've just Pythonified someone else's solution. I haven't really thought about it. :-D

kdim on Jan. 9, 2021, 7:34 p.m.
abstruse, but very compact :-)

veky on Jan. 9, 2021, 9:27 p.m.
As I said, it's someone else's solution, I've just rewritten it in True Python. :-)

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.