14-06-2024

Author: Hasheditz

LeetCode/945. Minimum Increment to Make Array Unique.cpp

@@ -0,0 +1,23 @@
+class Solution {
+public:
+    int minIncrementForUnique(vector<int>& nums) {
+        
+        int n = nums.size();
+
+        sort(nums.begin() , nums.end());
+
+        int cnt = 0;
+
+        for(int i = 1 ; i < n ; i++)
+        {
+            if(nums[i] <= nums[i-1])
+            {
+                int temp = nums[i];
+                nums[i] = nums[i-1]+1;
+                cnt += nums[i] - temp;
+            }
+        }
+
+        return cnt;
+    }
+};

readme.md

@@ -1,65 +1,67 @@
-# **Date**: June 13, 2024
+# **Date**: June 14, 2024
 
-# 2037. Minimum Number of Moves to Seat Everyone
+# 945. Minimum Increment to Make Array Unique
 
-**Difficulty**: ![Easy](https://img.shields.io/badge/Easy-brightgreen)  
-**Related Topics**: ![Greedy](https://img.shields.io/badge/Greedy-blue) ![Sorting](https://img.shields.io/badge/Sorting-blue)
+**Difficulty**: ![Medium](https://img.shields.io/badge/Medium-yellow)  
+**Related Topics**: ![Greedy](https://img.shields.io/badge/Greedy-blue) ![Array](https://img.shields.io/badge/Array-blue)
 
 <p>
-  <a href="https://github.com/Hasheditz/Leetcode-CSES-GFG-Codeforces-Coding-Solutions?tab=readme-ov-file#minimum-number-of-moves-to-seat-everyone" style="margin-right: 5px;">
+  <a href="https://github.com/Hasheditz/Leetcode-CSES-GFG-Codeforces-Coding-Solutions?tab=readme-ov-file#minimum-increment-to-make-array-unique" style="margin-right: 5px;">
     <img src="https://img.shields.io/badge/All%20Problem%20Solutions-green" alt="All Problem Solutions">
   </a>
-  <a href="https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/">
+  <a href="https://leetcode.com/problems/minimum-increment-to-make-array-unique/">
     <img src="https://img.shields.io/badge/Link%20To%20The%20Question-blue" alt="Link To The Question">
   </a>
 </p>
 
 ## Editorial
 
-This problem requires us to determine the minimum number of moves required to seat each student in an available seat such that the sum of the absolute differences between the positions of the students and the seats they occupy is minimized.
+To solve the problem of making all elements in an array unique with the minimum increment, it helps to have experience with a similar problem: [Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/). Understanding how to increment elements to maintain a specific property of the array will aid in tackling this problem.
 
 ### Solution Explanation
 
-To solve this problem efficiently, we can break down the solution into the following steps:
+The goal is to make every element in the array unique by incrementing some of the elements with the minimum number of operations. Here's how to achieve this:
 
 #### Key Steps:
-1. **Sort the Arrays**: Sort both the `seat` and `student` arrays.
-2. **Calculate Minimum Moves**: Iterate through the sorted arrays and sum the absolute differences between the corresponding elements of the `seat` and `student` arrays.
+1. **Sort the Array**: Start by sorting the array. This allows us to easily detect duplicates.
+2. **Increment to Make Unique**: Iterate through the sorted array, and for each duplicate, increment it until it becomes unique. Keep track of the total increments made.
 
 ### Code
 
 ```cpp
 class Solution {
 public:
-    int minMovesToSeat(vector<int>& seat, vector<int>& student) {
-        // Step 1: Sort the seat and student arrays
-        sort(seat.begin(), seat.end());
-        sort(student.begin(), student.end());
-
-        // Step 2: Initialize the answer variable
-        int ans = 0;
-
-        // Step 3: Calculate the total minimum moves
-        for(int i = 0; i < seat.size(); i++) {
-            ans += abs(seat[i] - student[i]);
+    int minIncrementForUnique(vector<int>& nums) {
+        int n = nums.size();
+        
+        // Step 1: Sort the array
+        sort(nums.begin(), nums.end());
+        
+        int cnt = 0;
+        
+        // Step 2: Increment duplicates to make them unique
+        for (int i = 1; i < n; i++) {
+            if (nums[i] <= nums[i - 1]) {
+                int temp = nums[i];
+                nums[i] = nums[i - 1] + 1;
+                cnt += nums[i] - temp;
+            }
         }
-
-        return ans;
+        
+        return cnt;
     }
 };
 ```
 ## Explanation of Code
 
 ### Initialization:
-We initialize the answer variable `ans` to 0 to keep track of the total minimum moves.
-
-### Sort the Arrays:
-We sort both the `seat` and `student` arrays to ensure that the closest seats and students are paired.
+We sort the array `nums` to facilitate detecting and handling duplicates easily.
 
-### Calculate Minimum Moves:
-We iterate through the sorted arrays and calculate the absolute difference between each pair of seat and student. These differences are accumulated in the `ans` variable to get the total minimum moves required.
+### Increment to Make Unique:
+We iterate through the sorted array. For each element that is not greater than the previous element, we increment it to be one more than the previous element. This ensures all elements are unique.
+We keep a count of all the increments made to achieve this.
 
-This approach ensures an efficient and optimal pairing of seats and students to minimize the total moves.
+This approach ensures that all elements in the array are unique with the minimum number of increments.
 
 ## Like and Upvote