This talk surveys problems from graph theory and additive combinatorics where randomness gives an essentially optimal bound. In some instances, pseudorandomness characterizes the optimizers.