Add leetcode contest 2024-07-20 - 2/4

Author: rigwild

README.md

@@ -37,6 +37,8 @@ zx _genReadme.mjs
 | [`100289-minimum-substring-partition-of-equal-character-frequency`](./challenges/leetcode-100289-minimum-substring-partition-of-equal-character-frequency) | leetcode |
 | [`100299-check-if-grid-satisfies-conditions`](./challenges/leetcode-100299-check-if-grid-satisfies-conditions) | leetcode |
 | [`100302-maximum-points-inside-the-square`](./challenges/leetcode-100302-maximum-points-inside-the-square) | leetcode |
+| [`100330-minimum-length-of-string-after-operations`](./challenges/leetcode-100330-minimum-length-of-string-after-operations) | leetcode |
+| [`100375-find-the-winning-player-in-coin-game`](./challenges/leetcode-100375-find-the-winning-player-in-coin-game) | leetcode |
 | [`1d-spreadsheet`](./challenges/codingame-1d-spreadsheet) | codingame |
 | [`2481-minimum-cuts-to-divide-a-circle`](./challenges/leetcode-2481-minimum-cuts-to-divide-a-circle) | leetcode |
 | [`2482-difference-between-ones-and-zeros-in-row-and-column`](./challenges/leetcode-2482-difference-between-ones-and-zeros-in-row-and-column) | leetcode |
@@ -149,6 +151,8 @@ ___
 | [`100289-minimum-substring-partition-of-equal-character-frequency`](./challenges/leetcode-100289-minimum-substring-partition-of-equal-character-frequency) | Classic |
 | [`100299-check-if-grid-satisfies-conditions`](./challenges/leetcode-100299-check-if-grid-satisfies-conditions) | Classic |
 | [`100302-maximum-points-inside-the-square`](./challenges/leetcode-100302-maximum-points-inside-the-square) | Classic |
+| [`100330-minimum-length-of-string-after-operations`](./challenges/leetcode-100330-minimum-length-of-string-after-operations) | Classic |
+| [`100375-find-the-winning-player-in-coin-game`](./challenges/leetcode-100375-find-the-winning-player-in-coin-game) | Classic |
 | [`2481-minimum-cuts-to-divide-a-circle`](./challenges/leetcode-2481-minimum-cuts-to-divide-a-circle) | Classic |
 | [`2482-difference-between-ones-and-zeros-in-row-and-column`](./challenges/leetcode-2482-difference-between-ones-and-zeros-in-row-and-column) | Classic |
 | [`2483-minimum-penalty-for-a-shop`](./challenges/leetcode-2483-minimum-penalty-for-a-shop) | Classic |
@@ -186,6 +190,8 @@ ___
 | [`100289-minimum-substring-partition-of-equal-character-frequency`](./challenges/leetcode-100289-minimum-substring-partition-of-equal-character-frequency) | leetcode | Classic |
 | [`100299-check-if-grid-satisfies-conditions`](./challenges/leetcode-100299-check-if-grid-satisfies-conditions) | leetcode | Classic |
 | [`100302-maximum-points-inside-the-square`](./challenges/leetcode-100302-maximum-points-inside-the-square) | leetcode | Classic |
+| [`100330-minimum-length-of-string-after-operations`](./challenges/leetcode-100330-minimum-length-of-string-after-operations) | leetcode | Classic |
+| [`100375-find-the-winning-player-in-coin-game`](./challenges/leetcode-100375-find-the-winning-player-in-coin-game) | leetcode | Classic |
 | [`1d-spreadsheet`](./challenges/codingame-1d-spreadsheet) | codingame | Classic |
 | [`2481-minimum-cuts-to-divide-a-circle`](./challenges/leetcode-2481-minimum-cuts-to-divide-a-circle) | leetcode | Classic |
 | [`2482-difference-between-ones-and-zeros-in-row-and-column`](./challenges/leetcode-2482-difference-between-ones-and-zeros-in-row-and-column) | leetcode | Classic |

challenges/leetcode-100330-minimum-length-of-string-after-operations/README.md

@@ -0,0 +1,33 @@
+# leetcode-100330-minimum-length-of-string-after-operations
+
+https://leetcode.com/problems/minimum-length-of-string-after-operations
+
+**Type:** Classic
+
+## Run Code Result
+
+### Your input
+
+<!-- prettier-ignore -->
+```js
+"abaacbcbb"
+```
+
+### Your stdout
+
+<!-- prettier-ignore -->
+```js
+charIndexes={a=[0, 2, 3], b=[1, 5, 7, 8], c=[4, 6]}
+    charIndexes={a=[2], b=[1, 5, 7, 8], c=[4, 6]}
+    charIndexes={a=[2], b=[5, 7], c=[4, 6]}
+
+charIndexes={a=[0, 1]}
+```
+
+### Your answer
+
+<!-- prettier-ignore -->
+```js
+5
+2
+```

challenges/leetcode-100330-minimum-length-of-string-after-operations/java.java

@@ -0,0 +1,67 @@
+class Solution {
+  public int minimumLength(String s) {
+      final Map<Character, List<Integer>> charIndexes = new HashMap<>();
+      for (int i = 0; i < s.length(); i++) {
+          final char c = s.charAt(i);
+          final List<Integer> listOfSameChar = charIndexes.getOrDefault(c, new ArrayList<>());
+          listOfSameChar.add(i);
+          charIndexes.put(c, listOfSameChar);
+      }
+
+      // System.out.println(String.format("charIndexes=%s", charIndexes));
+
+      int length = s.length();
+
+      for (List<Integer> listOfSameChar : charIndexes.values()) {
+          while (listOfSameChar.size() >= 3) {
+              listOfSameChar.remove(listOfSameChar.size() - 1);
+              listOfSameChar.remove(0);
+              length -= 2;
+              // System.out.println(String.format("    charIndexes=%s", charIndexes));
+          }
+      }
+
+      return length;
+
+  //
+  // Time Limit Exceeded!
+  //
+  
+  //     for (int i = 1; i < s.length(); i++) {
+  //         //System.out.println(s);
+
+  //         char target = s.charAt(i);
+  //         int leftIdx = -1;
+  //         int rightIdx = -1;
+
+  //         for (int j = 0; j < i; j++) {
+  //             char current = s.charAt(j);
+  //             //System.out.println(String.format("    LEFT i=%s, target=%s, current=%s", i, target, current));
+  //             if (current == target) {
+  //                 leftIdx = j;
+  //                 break;
+  //             }
+  //         }
+  //         if (leftIdx == -1) continue;
+          
+  //         for (int j = i + 1; j < s.length(); j++) {
+  //             char current = s.charAt(j);
+  //             //System.out.println(String.format("    RIGHT i=%s, target=%s, current=%s", i, target, current));
+  //             if (current == target) {
+  //                 rightIdx = j;
+  //                 break;
+  //             }
+  //         }
+
+  //         if (leftIdx != -1 && rightIdx != -1) {
+  //             //System.out.println(String.format("  RESULT i=%s, leftIdx=%s, rightIdx=%s", i, leftIdx, rightIdx));
+  //             s = s.substring(0, rightIdx) + s.substring(rightIdx + 1);
+  //             s = s.substring(0, leftIdx) + s.substring(leftIdx + 1);
+  //             i = 1;
+  //         }
+  //     }
+
+  //     System.out.println(s);
+  //     return s.length();
+  }
+}

challenges/leetcode-100375-find-the-winning-player-in-coin-game/README.md

@@ -0,0 +1,31 @@
+# leetcode-100330-minimum-length-of-string-after-operations
+
+https://leetcode.com/problems/minimum-length-of-string-after-operations
+
+**Type:** Classic
+
+## Run Code Result
+
+### Your input
+
+<!-- prettier-ignore -->
+```js
+2
+7
+4
+11
+```
+
+### Your stdout
+
+<!-- prettier-ignore -->
+```js
+```
+
+### Your answer
+
+<!-- prettier-ignore -->
+```js
+"Alice"
+"Bob"
+```

challenges/leetcode-100375-find-the-winning-player-in-coin-game/java.java

@@ -0,0 +1,16 @@
+class Solution {
+  public String losingPlayer(int x, int y) {
+      String player = "Bob";
+
+      for (; x > 0 || y > 0;) {
+          if (x >= 1 && y >= 4) {
+              x -= 1;
+              y -= 4;
+              player = player.equals("Alice") ? "Bob" : "Alice";
+          } else {
+              return player;
+          }
+      }
+      return player;
+  }
+}