Given N bags with coins and K turns, where each turn takes half the coins (rounded down) from a selected bag, return the maximum number of coins taken out using a Max Heap.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.