Max and min by hand
max() is built in — but how does it work? Keep a "best so far" and replace it whenever you find something bigger.
Challenge A:Find the biggest in nums = [3, 7, 2, 5] without max(): best = nums[0], replace it whenever n > best. Then crash(best).