2145. Count the Hidden Sequences: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1620,3 +1620,4 @@ mod s2139_minimum_moves_to_reach_target_score;
 mod s2140_solving_questions_with_brainpower;
 mod s2141_maximum_running_time_of_n_computers;
 mod s2144_minimum_cost_of_buying_candies_with_discount;
+mod s2145_count_the_hidden_sequences;

src/solution/s2145_count_the_hidden_sequences.rs

@@ -0,0 +1,115 @@
+/**
+ * [2145] Count the Hidden Sequences
+ *
+ * You are given a 0-indexed array of n integers differences, which describes the differences between each pair of consecutive integers of a hidden sequence of length (n + 1). More formally, call the hidden sequence hidden, then we have that differences[i] = hidden[i + 1] - hidden[i].
+ * You are further given two integers lower and upper that describe the inclusive range of values [lower, upper] that the hidden sequence can contain.
+ *
+ * 	For example, given differences = [1, -3, 4], lower = 1, upper = 6, the hidden sequence is a sequence of length 4 whose elements are in between 1 and 6 (inclusive).
+ *
+ * 		[3, 4, 1, 5] and [4, 5, 2, 6] are possible hidden sequences.
+ * 		[5, 6, 3, 7] is not possible since it contains an element greater than 6.
+ * 		[1, 2, 3, 4] is not possible since the differences are not correct.
+ *
+ *
+ *
+ * Return the number of possible hidden sequences there are. If there are no possible sequences, return 0.
+ *  
+ * Example 1:
+ *
+ * Input: differences = [1,-3,4], lower = 1, upper = 6
+ * Output: 2
+ * Explanation: The possible hidden sequences are:
+ * - [3, 4, 1, 5]
+ * - [4, 5, 2, 6]
+ * Thus, we return 2.
+ *
+ * Example 2:
+ *
+ * Input: differences = [3,-4,5,1,-2], lower = -4, upper = 5
+ * Output: 4
+ * Explanation: The possible hidden sequences are:
+ * - [-3, 0, -4, 1, 2, 0]
+ * - [-2, 1, -3, 2, 3, 1]
+ * - [-1, 2, -2, 3, 4, 2]
+ * - [0, 3, -1, 4, 5, 3]
+ * Thus, we return 4.
+ *
+ * Example 3:
+ *
+ * Input: differences = [4,-7,2], lower = 3, upper = 6
+ * Output: 0
+ * Explanation: There are no possible hidden sequences. Thus, we return 0.
+ *
+ *  
+ * Constraints:
+ *
+ * 	n == differences.length
+ * 	1 <= n <= 10^5
+ * 	-10^5 <= differences[i] <= 10^5
+ * 	-10^5 <= lower <= upper <= 10^5
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/count-the-hidden-sequences/
+// discuss: https://leetcode.com/problems/count-the-hidden-sequences/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn number_of_arrays(differences: Vec<i32>, lower: i32, upper: i32) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2145_example_1() {
+        let differences = vec![1, -3, 4];
+        let lower = 1;
+        let upper = 6;
+
+        let result = 2;
+
+        assert_eq!(
+            Solution::number_of_arrays(differences, lower, upper),
+            result
+        );
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2145_example_2() {
+        let differences = vec![3, -4, 5, 1, -2];
+        let lower = -4;
+        let upper = 5;
+
+        let result = 4;
+
+        assert_eq!(
+            Solution::number_of_arrays(differences, lower, upper),
+            result
+        );
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2145_example_3() {
+        let differences = vec![4, -7, 2];
+        let lower = 3;
+        let upper = 6;
+
+        let result = 0;
+
+        assert_eq!(
+            Solution::number_of_arrays(differences, lower, upper),
+            result
+        );
+    }
+}