Given an array of integers representing the number of chocolates in each packet, choose m packets such that the difference between the maximum and minimum chocolates in given packets is minimized.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.