Improved task 1032

Author: javadev

README.md

@@ -1750,7 +1750,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.12'
 | #    |      Title     | Difficulty  | Tag         | Time, ms | Time, %
 |------|----------------|-------------|-------------|----------|---------
 | 1143 |[Longest Common Subsequence](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Algorithm_II_Day_17_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming | 307 | 38.36
-| 1032 |[Maximum Sum of Two Non-Overlapping Subarrays](src/main/kotlin/g1001_1100/s1032_stream_of_characters/StreamChecker.kt)| Hard | Array, String, Design, Trie, Data_Stream | 733 | 100.00
+| 1032 |[Stream of Characters](src/main/kotlin/g1001_1100/s1032_stream_of_characters/StreamChecker.kt)| Hard | Array, String, Design, Trie, Data_Stream | 733 | 100.00
 | 1031 |[Maximum Sum of Two Non-Overlapping Subarrays](src/main/kotlin/g1001_1100/s1031_maximum_sum_of_two_non_overlapping_subarrays/Solution.kt)| Medium | Array, Dynamic_Programming, Sliding_Window | 172 | 100.00
 | 1030 |[Matrix Cells in Distance Order](src/main/kotlin/g1001_1100/s1030_matrix_cells_in_distance_order/Solution.kt)| Easy | Array, Math, Sorting, Matrix, Geometry | 426 | 100.00
 | 1029 |[Two City Scheduling](src/main/kotlin/g1001_1100/s1029_two_city_scheduling/Solution.kt)| Medium | Array, Sorting, Greedy | 148 | 100.00

src/main/kotlin/g1001_1100/s1032_stream_of_characters/readme.md

@@ -1,40 +1,42 @@
-1031\. Maximum Sum of Two Non-Overlapping Subarrays
+1032\. Stream of Characters
 
-Medium
+Hard
 
-Given an integer array `nums` and two integers `firstLen` and `secondLen`, return _the maximum sum of elements in two non-overlapping **subarrays** with lengths_ `firstLen` _and_ `secondLen`.
+Design an algorithm that accepts a stream of characters and checks if a suffix of these characters is a string of a given array of strings `words`.
 
-The array with length `firstLen` could occur before or after the array with length `secondLen`, but they have to be non-overlapping.
+For example, if `words = ["abc", "xyz"]` and the stream added the four characters (one by one) `'a'`, `'x'`, `'y'`, and `'z'`, your algorithm should detect that the suffix `"xyz"` of the characters `"axyz"` matches `"xyz"` from `words`.
 
-A **subarray** is a **contiguous** part of an array.
+Implement the `StreamChecker` class:
 
-**Example 1:**
-
-**Input:** nums = [0,6,5,2,2,5,1,9,4], firstLen = 1, secondLen = 2
-
-**Output:** 20
-
-**Explanation:** One choice of subarrays is [9] with length 1, and [6,5] with length 2.
+*   `StreamChecker(String[] words)` Initializes the object with the strings array `words`.
+*   `boolean query(char letter)` Accepts a new character from the stream and returns `true` if any non-empty suffix from the stream forms a word that is in `words`.
 
-**Example 2:**
-
-**Input:** nums = [3,8,1,3,2,1,8,9,0], firstLen = 3, secondLen = 2
-
-**Output:** 29
-
-**Explanation:** One choice of subarrays is [3,8,1] with length 3, and [8,9] with length 2.
+**Example 1:**
 
-**Example 3:**
+**Input** ["StreamChecker", "query", "query", "query", "query", "query", "query", "query", "query", "query", "query", "query", "query"] [[["cd", "f", "kl"]], ["a"], ["b"], ["c"], ["d"], ["e"], ["f"], ["g"], ["h"], ["i"], ["j"], ["k"], ["l"]]
 
-**Input:** nums = [2,1,5,6,0,9,5,0,3,8], firstLen = 4, secondLen = 3
+**Output:** [null, false, false, false, true, false, true, false, false, false, false, false, true]
 
-**Output:** 31
+**Explanation:** 
 
-**Explanation:** One choice of subarrays is [5,6,0,9] with length 4, and [0,3,8] with length 3.
+    StreamChecker streamChecker = new StreamChecker(["cd", "f", "kl"]); 
+    streamChecker.query("a"); // return False 
+    streamChecker.query("b"); // return False 
+    streamChecker.query("c"); // return False 
+    streamChecker.query("d"); // return True, because 'cd' is in the wordlist 
+    streamChecker.query("e"); // return False 
+    streamChecker.query("f"); // return True, because 'f' is in the wordlist 
+    streamChecker.query("g"); // return False 
+    streamChecker.query("h"); // return False 
+    streamChecker.query("i"); // return False 
+    streamChecker.query("j"); // return False 
+    streamChecker.query("k"); // return False 
+    streamChecker.query("l"); // return True, because 'kl' is in the wordlist
 
 **Constraints:**
 
-*   `1 <= firstLen, secondLen <= 1000`
-*   `2 <= firstLen + secondLen <= 1000`
-*   `firstLen + secondLen <= nums.length <= 1000`
-*   `0 <= nums[i] <= 1000`
+*   `1 <= words.length <= 2000`
+*   `1 <= words[i].length <= 2000`
+*   `words[i]` consists of lowercase English letters.
+*   `letter` is a lowercase English letter.
+*   At most <code>4 * 10<sup>4</sup></code> calls will be made to query.