2266. Count Number of Texts: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1715,3 +1715,4 @@ mod s2261_k_divisible_elements_subarrays;
 mod s2262_total_appeal_of_a_string;
 mod s2264_largest_3_same_digit_number_in_string;
 mod s2265_count_nodes_equal_to_average_of_subtree;
+mod s2266_count_number_of_texts;

src/solution/s2266_count_number_of_texts.rs

@@ -0,0 +1,80 @@
+/**
+ * [2266] Count Number of Texts
+ *
+ * Alice is texting Bob using her phone. The mapping of digits to letters is shown in the figure below.
+ * <img alt="" src="https://assets.leetcode.com/uploads/2022/03/15/1200px-telephone-keypad2svg.png" style="width: 200px; height: 162px;" />
+ * In order to add a letter, Alice has to press the key of the corresponding digit i times, where i is the position of the letter in the key.
+ *
+ * 	For example, to add the letter 's', Alice has to press '7' four times. Similarly, to add the letter 'k', Alice has to press '5' twice.
+ * 	Note that the digits '0' and '1' do not map to any letters, so Alice does not use them.
+ *
+ * However, due to an error in transmission, Bob did not receive Alice's text message but received a string of pressed keys instead.
+ *
+ * 	For example, when Alice sent the message "bob", Bob received the string "2266622".
+ *
+ * Given a string pressedKeys representing the string received by Bob, return the total number of possible text messages Alice could have sent.
+ * Since the answer may be very large, return it modulo 10^9 + 7.
+ *  
+ * Example 1:
+ *
+ * Input: pressedKeys = "22233"
+ * Output: 8
+ * Explanation:
+ * The possible text messages Alice could have sent are:
+ * "aaadd", "abdd", "badd", "cdd", "aaae", "abe", "bae", and "ce".
+ * Since there are 8 possible messages, we return 8.
+ *
+ * Example 2:
+ *
+ * Input: pressedKeys = "222222222222222222222222222222222222"
+ * Output: 82876089
+ * Explanation:
+ * There are 2082876103 possible text messages Alice could have sent.
+ * Since we need to return the answer modulo 10^9 + 7, we return 2082876103 % (10^9 + 7) = 82876089.
+ *
+ *  
+ * Constraints:
+ *
+ * 	1 <= pressedKeys.length <= 10^5
+ * 	pressedKeys only consists of digits from '2' - '9'.
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/count-number-of-texts/
+// discuss: https://leetcode.com/problems/count-number-of-texts/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn count_texts(pressed_keys: String) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2266_example_1() {
+        let pressed_keys = "22233".to_string();
+
+        let result = 8;
+
+        assert_eq!(Solution::count_texts(pressed_keys), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2266_example_2() {
+        let pressed_keys = "222222222222222222222222222222222222".to_string();
+
+        let result = 82876089;
+
+        assert_eq!(Solution::count_texts(pressed_keys), result);
+    }
+}