1960. Maximum Product of the Length of Two Palindromic Substrings: RETRY

Author: tan-wei

Diff for: src/solution/mod.rs

@@ -1477,3 +1477,4 @@ mod s1955_count_number_of_special_subsequences;
 mod s1957_delete_characters_to_make_fancy_string;
 mod s1958_check_if_move_is_legal;
 mod s1959_minimum_total_space_wasted_with_k_resizing_operations;
+mod s1960_maximum_product_of_the_length_of_two_palindromic_substrings;

Diff for: src/solution/s1960_maximum_product_of_the_length_of_two_palindromic_substrings.rs

@@ -0,0 +1,66 @@
+/**
+ * [1960] Maximum Product of the Length of Two Palindromic Substrings
+ *
+ * You are given a 0-indexed string s and are tasked with finding two non-intersecting palindromic substrings of odd length such that the product of their lengths is maximized.
+ * More formally, you want to choose four integers i, j, k, l such that 0 <= i <= j < k <= l < s.length and both the substrings s[i...j] and s[k...l] are palindromes and have odd lengths. s[i...j] denotes a substring from index i to index j inclusive.
+ * Return the maximum possible product of the lengths of the two non-intersecting palindromic substrings.
+ * A palindrome is a string that is the same forward and backward. A substring is a contiguous sequence of characters in a string.
+ *  
+ * Example 1:
+ *
+ * Input: s = "ababbb"
+ * Output: 9
+ * Explanation: Substrings "aba" and "bbb" are palindromes with odd length. product = 3 * 3 = 9.
+ *
+ * Example 2:
+ *
+ * Input: s = "zaaaxbbby"
+ * Output: 9
+ * Explanation: Substrings "aaa" and "bbb" are palindromes with odd length. product = 3 * 3 = 9.
+ *
+ *  
+ * Constraints:
+ *
+ * 	2 <= s.length <= 10^5
+ * 	s consists of lowercase English letters.
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-substrings/
+// discuss: https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-substrings/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn max_product(s: String) -> i64 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_1960_example_1() {
+        let s = "ababbb".to_string();
+
+        let result = 9;
+
+        assert_eq!(Solution::max_product(s), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_1960_example_2() {
+        let s = "zaaaxbbby".to_string();
+
+        let result = 9;
+
+        assert_eq!(Solution::max_product(s), result);
+    }
+}