Updated tags

Author: javadev

src/main/java/g3301_3400/s3386_button_with_longest_push_time/Solution.java

@@ -1,6 +1,6 @@
 package g3301_3400.s3386_button_with_longest_push_time;
 
-// #Easy #2024_12_15_Time_0_ms_(100.00%)_Space_44.6_MB_(100.00%)
+// #Easy #Array #2024_12_18_Time_0_ms_(100.00%)_Space_45_MB_(38.39%)
 
 public class Solution {
     public int buttonWithLongestTime(int[][] events) {

src/main/java/g3301_3400/s3387_maximize_amount_after_two_days_of_conversions/Solution.java

@@ -1,6 +1,7 @@
 package g3301_3400.s3387_maximize_amount_after_two_days_of_conversions;
 
-// #Medium #2024_12_15_Time_7_ms_(100.00%)_Space_46.6_MB_(100.00%)
+// #Medium #Array #String #Graph #Depth_First_Search #Breadth_First_Search
+// #2024_12_18_Time_7_ms_(87.88%)_Space_47.5_MB_(43.35%)
 
 import java.util.ArrayList;
 import java.util.HashMap;

src/main/java/g3301_3400/s3388_count_beautiful_splits_in_an_array/Solution.java

@@ -1,6 +1,6 @@
 package g3301_3400.s3388_count_beautiful_splits_in_an_array;
 
-// #Medium #2024_12_15_Time_165_ms_(100.00%)_Space_266.1_MB_(100.00%)
+// #Medium #Array #Dynamic_Programming #2024_12_18_Time_167_ms_(70.49%)_Space_269.1_MB_(5.74%)
 
 public class Solution {
     public int beautifulSplits(int[] nums) {

src/main/java/g3301_3400/s3389_minimum_operations_to_make_character_frequencies_equal/Solution.java

@@ -1,42 +1,51 @@
 package g3301_3400.s3389_minimum_operations_to_make_character_frequencies_equal;
 
-// #Hard #2024_12_15_Time_56_ms_(100.00%)_Space_44.8_MB_(100.00%)
-
-import java.util.Arrays;
+// #Hard #String #Hash_Table #Dynamic_Programming #Counting #Enumeration
+// #2024_12_18_Time_4_ms_(100.00%)_Space_44.8_MB_(67.80%)
 
 public class Solution {
     public int makeStringGood(String s) {
-        int n = s.length();
-        int[] a = new int[110];
-        for (char ch : s.toCharArray()) {
-            a[ch - 'a' + 1]++;
+        int[] freqarr = new int[26];
+        for (int i = 0; i < s.length(); i++) {
+            freqarr[s.charAt(i) - 'a'] += 1;
         }
-        int[][] f = new int[30][3];
-        int inf = Integer.MAX_VALUE / 2;
-        int ans = inf;
-        for (int avg = 1; avg <= n; avg++) {
-            for (int[] row : f) {
-                Arrays.fill(row, inf);
-            }
-            f[0][0] = 0;
-            for (int i = 1; i <= 26; i++) {
-                f[i][0] = Math.min(Math.min(f[i - 1][0], f[i - 1][1]), f[i - 1][2]) + a[i];
-                if (a[i] <= avg) {
-                    f[i][1] =
-                            Math.min(
-                                    Math.min(
-                                            f[i - 1][0] + Math.max(avg - a[i - 1] - a[i], 0),
-                                            f[i - 1][1] + (avg - a[i])),
-                                    f[i - 1][2] + Math.max(avg - (a[i - 1] - avg) - a[i], 0));
+        int ctr = 0;
+        int max = 0;
+        for (int i = 0; i < 26; i++) {
+            ctr = freqarr[i] != 0 ? ctr + 1 : ctr;
+            max = freqarr[i] != 0 ? Math.max(max, freqarr[i]) : max;
+        }
+        if (ctr == 0) {
+            return 0;
+        }
+        int minops = 2 * 10000;
+        for (int j = 0; j <= max; j++) {
+            int ops = 0;
+            int ifdel = 0;
+            int ifadd = 0;
+            int free = 0;
+            for (int i = 0; i < 26; i++) {
+                if (freqarr[i] == 0) {
+                    free = 0;
+                    continue;
                 }
-                if (a[i] >= avg) {
-                    f[i][2] =
-                            Math.min(Math.min(f[i - 1][0], f[i - 1][1]), f[i - 1][2])
-                                    + (a[i] - avg);
+                if (freqarr[i] >= j) {
+                    ifdel = Math.min(ifdel, ifadd) + freqarr[i] - j;
+                    free = freqarr[i] - j;
+                    ifadd = 2 * 10000;
+                } else {
+                    int currifdel = Math.min(ifdel, ifadd) + freqarr[i];
+                    int currifadd =
+                            Math.min(
+                                    ifadd + j - freqarr[i],
+                                    ifdel + Math.max(0, j - freqarr[i] - free));
+                    ifadd = currifadd;
+                    ifdel = currifdel;
+                    free = freqarr[i];
                 }
             }
-            ans = Math.min(ans, Math.min(f[26][0], Math.min(f[26][1], f[26][2])));
+            minops = Math.min(minops, Math.min(ifdel, ifadd));
         }
-        return ans == inf ? -1 : ans;
+        return minops;
     }
 }