Improved task 2350.

Author: javadev

README.md

@@ -1848,7 +1848,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
 
 | #    |      Title     | Difficulty  | Tag         | Time, ms | Time, %
 |------|----------------|-------------|-------------|----------|---------
-| 2350 |[Shortest Impossible Sequence of Rolls](src/main/java/g2301_2400/s2350_shortest_impossible_sequence_of_rolls/Solution.java)| Hard | Array, Hash_Table, Greedy | 54 | 47.18
+| 2350 |[Shortest Impossible Sequence of Rolls](src/main/java/g2301_2400/s2350_shortest_impossible_sequence_of_rolls/Solution.java)| Hard | Array, Hash_Table, Greedy | 12 | 87.73
 | 2349 |[Design a Number Container System](src/main/java/g2301_2400/s2349_design_a_number_container_system/NumberContainers.java)| Medium | Hash_Table, Design, Heap_Priority_Queue, Ordered_Set | 208 | 54.57
 | 2348 |[Number of Zero-Filled Subarrays](src/main/java/g2301_2400/s2348_number_of_zero_filled_subarrays/Solution.java)| Medium | Array, Math | 3 | 99.90
 | 2347 |[Best Poker Hand](src/main/java/g2301_2400/s2347_best_poker_hand/Solution.java)| Easy | Array, Hash_Table, Counting | 1 | 76.92

src/main/java/g2301_2400/s2350_shortest_impossible_sequence_of_rolls/Solution.java

@@ -1,19 +1,23 @@
 package g2301_2400.s2350_shortest_impossible_sequence_of_rolls;
 
-// #Hard #Array #Hash_Table #Greedy #2022_07_30_Time_54_ms_(47.18%)_Space_105.9_MB_(51.39%)
+// #Hard #Array #Hash_Table #Greedy #2022_07_30_Time_12_ms_(87.73%)_Space_84.9_MB_(79.95%)
 
-import java.util.HashSet;
-import java.util.Set;
+import java.util.BitSet;
 
 public class Solution {
     public int shortestSequence(int[] rolls, int k) {
+        BitSet bitSet = new BitSet(k + 1);
+        int cnt = 0;
         int res = 1;
-        Set<Integer> set = new HashSet<>();
         for (int roll : rolls) {
-            set.add(roll);
-            if (set.size() == k) {
+            if (!bitSet.get(roll)) {
+                bitSet.set(roll);
+                cnt++;
+            }
+            if (cnt == k) {
                 res++;
-                set.clear();
+                cnt = 0;
+                bitSet.clear();
             }
         }
         return res;