⚡ Build the skills to land top-paying quant jobs. Offer ends in --d --h --m --s-- days -- hours -- minutes -- seconds.
⚡ Build the skills to land top-paying quant jobs. Offer ends in 19d 08h 35m 35s19 days 8 hours 35 minutes 35 seconds.
There are 5 keys and 5 locks. Each key opens exactly one lock, and each lock is opened by exactly one key. A try consists of testing one key in one lock. Using an optimal strategy, what is the smallest number of tries that guarantees, even in the worst case, that you can identify which key unlocks each lock?