Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
sorted + key solution in Creative category for Bigger Price by CDG.Axel
def bigger_price(limit: int, data: list) -> list:
"""
TOP most expensive goods
"""
return sorted(data, key=lambda x: -x['price'])[0:limit]
"""
Timing for 1 mil iterations (for example list)
return sorted(data, key=lambda x: x['price'], reverse=True)[0:limit] --> 0.84 sec
data.sort(key=lambda x: x['price'], reverse=True) --> 0.78 sec
return data[0:limit]
"""
if __name__ == '__main__':
from pprint import pprint
print('Example:')
pprint(bigger_price(2, [
{"name": "bread", "price": 100},
{"name": "wine", "price": 138},
{"name": "meat", "price": 15},
{"name": "water", "price": 1}
]))
# These "asserts" using for self-checking and not for auto-testing
assert bigger_price(2, [
{"name": "bread", "price": 100},
{"name": "wine", "price": 138},
{"name": "meat", "price": 15},
{"name": "water", "price": 1}
]) == [
{"name": "wine", "price": 138},
{"name": "bread", "price": 100}
], "First"
assert bigger_price(1, [
{"name": "pen", "price": 5},
{"name": "whiteboard", "price": 170}
]) == [{"name": "whiteboard", "price": 170}], "Second"
print('Done! Looks like it is fine. Go and check it')
Oct. 16, 2021
Comments:
