[LEET-3396] add 3396

Author: fishercoder1534

paginated_contents/algorithms/4th_thousand/README.md

@@ -1,5 +1,6 @@
 | # | Title | Solutions | Video | Difficulty | Tag 
 |------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|------------|----------------------------------------------------------------------
+| 3396 |[Minimum Number of Operations to Make Elements in Array Distinct](https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3396.java)|| Easy |
 | 3370 |[Smallest Number With All Set Bits](https://leetcode.com/problems/smallest-number-with-all-set-bits/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3370.java)|| Easy |
 | 3364 |[Minimum Positive Sum Subarray](https://leetcode.com/problems/minimum-positive-sum-subarray/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3364.java)|| Easy |
 | 3360 |[Stone Removal Game](https://leetcode.com/problems/stone-removal-game/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3360.java)|| Easy |

src/main/java/com/fishercoder/solutions/fourththousand/_3396.java

@@ -0,0 +1,34 @@
+packagecom.fishercoder.solutions.fourththousand;
+
+importjava.util.HashMap;
+importjava.util.Map;
+
+publicclass_3396 {
+publicstaticclassSolution1 {
+publicintminimumOperations(int[] nums) {
+intops = 0;
+Map<Integer, Integer> map = newHashMap<>();
+for (intnum : nums) {
+map.put(num, map.getOrDefault(num, 0) + 1);
+ }
+inti = 0;
+while (!allDistinct(map)) {
+ops++;
+inttarget = i + 3;
+for (; i < target && i < nums.length; i++) {
+map.put(nums[i], map.get(nums[i]) - 1);
+ }
+ }
+returnops;
+ }
+
+privatebooleanallDistinct(Map<Integer, Integer> map) {
+for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
+if (entry.getValue() > 1) {
+returnfalse;
+ }
+ }
+returntrue;
+ }
+ }
+}