May 13

Author: siddydutta

2025-05-May-LeetCoding-Challenge/README.md

@@ -16,7 +16,7 @@
 | May 10 | [2918. Minimum Equal Sum of Two Arrays After Replacing Zeros](https://leetcode.com/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros/) | Medium | Solved |
 | May 11 | [1550. Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds/) | Easy | Solved |
 | May 12 | [2094. Finding 3-Digit Even Numbers](https://leetcode.com/problems/finding-3-digit-even-numbers/) | Easy | Solved |
-| May 13 | []() |  |  |
+| May 13 | [3335. Total Characters in String After Transformations I](https://leetcode.com/problems/total-characters-in-string-after-transformations-i/) | Medium | Solved |
 | May 14 | []() |  |  |
 | May 15 | []() |  |  |
 | May 16 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 4 | 4 | 0 |
-| Medium | 6 | 6 | 0 |
+| Medium | 7 | 7 | 0 |
 | Hard   | 2 | 1 | 1 |

2025-05-May-LeetCoding-Challenge/Total Characters in String After Transformations I.py

@@ -0,0 +1,31 @@
+class Solution:
+    MOD = 10**9 + 7
+
+    def lengthAfterTransformations(self, s: str, t: int) -> int:
+        counts = [0] * 27
+        for ch in s:
+            counts[ord(ch) - ord('a')] += 1
+        for _ in range(t):
+            for i in range(25, -1, -1):
+                counts[i + 1] = counts[i]
+            counts[0] = 0  # reset a
+            if counts[26]:
+                # split z into a and b
+                counts[0] += counts[26] % self.MOD
+                counts[1] += counts[26] % self.MOD
+                counts[26] = 0
+        return sum(counts) % self.MOD
+
+
+def main():
+    s = 'abcyy'
+    t = 2
+    assert Solution().lengthAfterTransformations(s, t) == 7
+
+    s = 'azbk'
+    t = 1
+    assert Solution().lengthAfterTransformations(s, t) == 5
+
+
+if __name__ == '__main__':
+    main()