Add solution #3335

JoshCrozier · JoshCrozier · commit 81be90b55e61 · 2025-05-12T19:11:01.000-05:00
diff --git a/README.md b/README.md
@@ -1,4 +1,4 @@
-# 1,750 LeetCode solutions in JavaScript
+# 1,751 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1741,6 +1741,7 @@
 3223|[Minimum Length of String After Operations](./solutions/3223-minimum-length-of-string-after-operations.js)|Medium|
 3272|[Find the Count of Good Integers](./solutions/3272-find-the-count-of-good-integers.js)|Hard|
 3306|[Count of Substrings Containing Every Vowel and K Consonants II](./solutions/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.js)|Medium|
+3335|[Total Characters in String After Transformations I](./solutions/3335-total-characters-in-string-after-transformations-i.js)|Medium|
 3341|[Find Minimum Time to Reach Last Room I](./solutions/3341-find-minimum-time-to-reach-last-room-i.js)|Medium|
 3342|[Find Minimum Time to Reach Last Room II](./solutions/3342-find-minimum-time-to-reach-last-room-ii.js)|Medium|
 3343|[Count Number of Balanced Permutations](./solutions/3343-count-number-of-balanced-permutations.js)|Hard|
diff --git a/solutions/3335-total-characters-in-string-after-transformations-i.js b/solutions/3335-total-characters-in-string-after-transformations-i.js
@@ -0,0 +1,47 @@
+/**
+ * 3335. Total Characters in String After Transformations I
+ * https://leetcode.com/problems/total-characters-in-string-after-transformations-i/
+ * Difficulty: Medium
+ *
+ * You are given a string s and an integer t, representing the number of transformations to
+ * perform. In one transformation, every character in s is replaced according to the following
+ * rules:
+ * - If the character is 'z', replace it with the string "ab".
+ * - Otherwise, replace it with the next character in the alphabet. For example, 'a' is replaced
+ *   with 'b', 'b' is replaced with 'c', and so on.
+ *
+ * Return the length of the resulting string after exactly t transformations.
+ *
+ * Since the answer may be very large, return it modulo 109 + 7.
+ */
+
+/**
+ * @param {string} s
+ * @param {number} t
+ * @return {number}
+ */
+var lengthAfterTransformations = function(s, t) {
+  const MOD = 1e9 + 7;
+  const freq = new Array(26).fill(0);
+
+  for (const char of s) {
+    freq[char.charCodeAt(0) - 97]++;
+  }
+
+  for (let i = 0; i < t; i++) {
+    const newFreq = new Array(26).fill(0);
+    for (let j = 0; j < 25; j++) {
+      newFreq[j + 1] = freq[j];
+    }
+    newFreq[0] = (newFreq[0] + freq[25]) % MOD;
+    newFreq[1] = (newFreq[1] + freq[25]) % MOD;
+    freq.splice(0, 26, ...newFreq);
+  }
+
+  let result = 0;
+  for (const count of freq) {
+    result = (result + count) % MOD;
+  }
+
+  return result;
+};
