Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Forcing key, even when not solution in Clear category for Min and Max by dig
import types
import math
def min(*args, **kwargs):
key = kwargs.get("key", lambda x: x) #if there is no key our key will be itself in order to consider always a key
args = args[0] if len(args) == 1 else args
minimum = None
for element in args:
if minimum is None:
minimum=element
if key(element) < key(minimum):
minimum = element
return minimum
def max(*args, **kwargs):
key = kwargs.get("key", lambda x: x)
args = args[0] if len(args) == 1 else args
maximus = None
for element in args:
if maximus is None:
maximus=element
if key(element) > key(maximus):
maximus = element
return maximus
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert max(3, 2) == 3, "Simple case max"
assert min(3, 2) == 2, "Simple case min"
assert max([1, 2, 0, 3, 4]) == 4, "From a list"
assert min("hello") == "e", "From string"
assert max(2.2, 5.6, 5.9, key=int) == 5.6, "Two maximal items"
assert min([[1, 2], [3, 4], [9, 0]], key=lambda x: x[1]) == [9, 0], "lambda key"
print("Coding complete? Click 'Check' to review your tests and earn cool rewards!")
March 7, 2023
