diff --git a/problems/FLIPCoin/chocolatedistributionproblem.cpp b/problems/FLIPCoin/chocolatedistributionproblem.cpp
new file mode 100644
index 0000000..5717c88
--- /dev/null
+++ b/problems/FLIPCoin/chocolatedistributionproblem.cpp
@@ -0,0 +1,51 @@
+//seema kumari patel 03-oct-21
+
+// Chocolate distribution problem
+#include <bits/stdc++.h>
+using namespace std;
+
+// arr[0..n-1] represents sizes of packets
+// m is number of students.
+// Returns minimum difference between maximum
+// and minimum values of distribution.
+int findMinDiff(int arr[], int n, int m)
+{
+	// if there are no chocolates or number
+	// of students is 0
+	if (m == 0 || n == 0)
+		return 0;
+
+	// Sort the given packets
+	sort(arr, arr + n);
+
+	// Number of students cannot be more than
+	// number of packets
+	if (n < m)
+		return -1;
+
+	// Largest number of chocolates
+	int min_diff = INT_MAX;
+
+	// Find the subarray of size m such that
+	// difference between last (maximum in case
+	// of sorted) and first (minimum in case of
+	// sorted) elements of subarray is minimum.
+
+	for (int i = 0; i + m - 1 < n; i++) {
+		int diff = arr[i + m - 1] - arr[i];
+		if (diff < min_diff)
+			min_diff = diff;
+	}
+	return min_diff;
+}
+
+int main()
+{
+	int arr[] = { 12, 4, 7, 9, 2, 23, 25, 41, 30,
+				40, 28, 42, 30, 44, 48, 43, 50 };
+	int m = 7; // Number of students
+	int n = sizeof(arr) / sizeof(arr[0]);
+	cout << "Minimum difference is "
+		<< findMinDiff(arr, n, m);
+	return 0;
+}
diff --git a/problems/FLIPCoin/chocolatedistributionproblem.exe b/problems/FLIPCoin/chocolatedistributionproblem.exe
new file mode 100644
index 0000000..735ff7d
Binary files /dev/null and b/problems/FLIPCoin/chocolatedistributionproblem.exe differ