Chocolate Distribution Problem || 15/02/2026 || GFG-POTD || скачать в хорошем качестве

Chocolate Distribution Problem || 15/02/2026 || GFG-POTD ||

🔥 GFG Problem of the Day Solution in Python Problem: Chocolate Distribution Problem Platform: GeeksforGeeks POTD Language: Python 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 packets :[3, 2, 4]. Input: arr = [3, 4, 1, 9, 56], m = 5 Output: 55 Explanation: With 5 packets for 5 students, each student will receive one packet, so the difference is 56 - 1 = 55 In this video: ✔ Problem Explanation ✔ Step-by-step Approach ✔ Python Code Solution ✔ Interview Tips Subscribe for Daily Coding Solutions. #coding #gfg #gfgpotd #python #dsa #codinginterview #datastructures #algorithms #learncoding #placementpreparation #gfg #gfgpotd #coding #python #dsa #programming #codinginterview #datastructures #algorithms #placementpreparation #learncoding #100daysofcode #gfgpotd #python #dsa #stack #codinginterview #codedaily #datastructuresdatastructures #competitiveprogramming #codingshorts #algorithms #leetcode #codingsolutions #techstudents