Skip to main content

Posts

Showing posts with the label Chocolate Distribution Problem Solution

Discover what life after college is really like in India, from work and money to friendships, freedom, responsibility, and adjusting to your first job.

Life After College: What Actually Changes? Graduation can feel surprisingly strange. After years of classes, assignments, exams, college events, attendance, friends sitting nearby, and a routine you mostly understand, one day you simply stop being a student. And then comes the question nobody really answers: what happens after college? You may expect some dramatic transformation. In reality, life after college usually changes in much smaller ways. Your mornings become more structured. Your salary arrives, but so do rent and bills. Your friends become busier. You get more freedom, but you also become responsible for more decisions. Most importantly, graduating does not suddenly make you feel like you have everything figured out. For many Indian students, the transition from college to work life is a mixture of excitement, confusion, independence, pressure, and a little nostalgia. Some changes happen immediately. Others take months or even years to notice. Here is what life ...

Chocolate Distribution Problem

Chocolate Distribution Problem Given an array  arr[]  of positive integers, where each value represents the number of chocolates in a packet. Each packet can have a variable number of chocolates. There are  m  students, the task is to distribute chocolate packets among  m  students such that -       i. Each student gets  exactly  one packet.      ii. The difference between maximum number of chocolates given to a student and minimum number of chocolates given to a student is minimum and return that minimum possible difference. Examples: Input: arr = [3, 4, 1, 9, 56, 7, 9, 12], m = 5 Output: 6 Explanation: The minimum difference between maximum chocolates and minimum chocolates is 9 - 3 = 6 by choosing following m packets :[3, 4, 9, 7, 9]. Input: arr = [7, 3, 2, 4, 9, 12, 56], m = 3 Output: 2 Explanation: The minimum difference between maximum chocolates and minimum chocolates is 4 - 2 = 2 by choosing following m packe...