_3396.java

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;
 }
 }
}