2414. Length of the Longest Alphabetical Continuous Substring: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1830,3 +1830,4 @@ mod s2410_maximum_matching_of_players_with_trainers;
 mod s2411_smallest_subarrays_with_maximum_bitwise_or;
 mod s2412_minimum_money_required_before_transactions;
 mod s2413_smallest_even_multiple;
+mod s2414_length_of_the_longest_alphabetical_continuous_substring;

src/solution/s2414_length_of_the_longest_alphabetical_continuous_substring.rs

@@ -0,0 +1,68 @@
+/**
+ * [2414] Length of the Longest Alphabetical Continuous Substring
+ *
+ * An alphabetical continuous string is a string consisting of consecutive letters in the alphabet. In other words, it is any substring of the string "abcdefghijklmnopqrstuvwxyz".
+ *
+ * 	For example, "abc" is an alphabetical continuous string, while "acb" and "za" are not.
+ *
+ * Given a string s consisting of lowercase letters only, return the length of the longest alphabetical continuous substring.
+ *  
+ * Example 1:
+ *
+ * Input: s = "abacaba"
+ * Output: 2
+ * Explanation: There are 4 distinct continuous substrings: "a", "b", "c" and "ab".
+ * "ab" is the longest continuous substring.
+ *
+ * Example 2:
+ *
+ * Input: s = "abcde"
+ * Output: 5
+ * Explanation: "abcde" is the longest continuous substring.
+ *
+ *  
+ * Constraints:
+ *
+ * 	1 <= s.length <= 10^5
+ * 	s consists of only English lowercase letters.
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/length-of-the-longest-alphabetical-continuous-substring/
+// discuss: https://leetcode.com/problems/length-of-the-longest-alphabetical-continuous-substring/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn longest_continuous_substring(s: String) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2414_example_1() {
+        let s = "abacaba".to_string();
+
+        let result = 2;
+
+        assert_eq!(Solution::longest_continuous_substring(s), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2414_example_2() {
+        let s = "abcde".to_string();
+
+        let result = 5;
+
+        assert_eq!(Solution::longest_continuous_substring(s), result);
+    }
+}