A man starts with N cakes and visits K places. At each place, he can buy, sell, or do nothing, but he must sell exactly L cakes total across the journey. Find the maximum cakes he can have at any…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.