Add new daily problem code

Author: SartHak-0-Sach

185-3rd_July-Min_diff_bw_values/approach-explanation.txt

@@ -0,0 +1,15 @@
+Intuition
+The key insights behind this intution is:
+
+If the array has less than 5 elements, the minimum difference will be 0, as we can't form two groups of 4 elements.
+Sorting the array in ascending order allows us to easily identify the 4 smallest and 4 largest elements.
+By calculating the difference between the sum of the 4 largest elements and the sum of the 4 smallest elements, we can find the minimum difference.
+Approach
+The approach used in the provided code is to find the minimum difference between the sum of the largest 4 elements and the sum of the smallest 4 elements in the given array A.
+The intuition behind this approach is that the minimum difference will be achieved by either:
+
+Removing the 4 smallest elements and keeping the 4 largest elements.
+Removing the 4 largest elements and keeping the 4 smallest elements.
+Complexity
+Time complexity:O(n log n)
+Space complexity:O(1)

185-3rd_July-Min_diff_bw_values/code.cpp

@@ -0,0 +1,17 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+class Solution
+{
+public:
+    int minDifference(vector<int> &A)
+    {
+        int n = A.size();
+        if (n < 5)
+            return 0;
+        sort(A.begin(), A.end());
+        return min({A[n - 1] - A[3], A[n - 2] - A[2], A[n - 3] - A[1], A[n - 4] - A[0]});
+    }
+};