Package g2301_2400.s2350_shortest_impossible_sequence_of_rolls

Class Solution

java.lang.Object

g2301_2400.s2350_shortest_impossible_sequence_of_rolls.Solution

public class Solution
extends Object

2350 - Shortest Impossible Sequence of Rolls.<p>Hard</p> <p>You are given an integer array <code>rolls</code> of length <code>n</code> and an integer <code>k</code>. You roll a <code>k</code> sided dice numbered from <code>1</code> to <code>k</code>, <code>n</code> times, where the result of the <code>i^th</code> roll is <code>rolls[i]</code>.</p> <p>Return <em>the length of the <strong>shortest</strong> sequence of rolls that <strong>cannot</strong> be taken from</em> <code>rolls</code>.</p> <p>A <strong>sequence of rolls</strong> of length <code>len</code> is the result of rolling a <code>k</code> sided dice <code>len</code> times.</p> <p><strong>Note</strong> that the sequence taken does not have to be consecutive as long as it is in order.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> rolls = [4,2,1,2,3,3,2,4,1], k = 4</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong> Every sequence of rolls of length 1, [1], [2], [3], [4], can be taken from rolls.</p> <p>Every sequence of rolls of length 2, [1, 1], [1, 2], &hellip;, [4, 4], can be taken from rolls.</p> <p>The sequence [1, 4, 2] cannot be taken from rolls, so we return 3.</p> <p>Note that there are other sequences that cannot be taken from rolls.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> rolls = [1,1,2,2], k = 2</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> Every sequence of rolls of length 1, [1], [2], can be taken from rolls.</p> <p>The sequence [2, 1] cannot be taken from rolls, so we return 2.</p> <p>Note that there are other sequences that cannot be taken from rolls but [2, 1] is the shortest.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> rolls = [1,1,3,2,2,2,3,3], k = 4</p> <p><strong>Output:</strong> 1</p> <p><strong>Explanation:</strong> The sequence [4] cannot be taken from rolls, so we return 1. Note that there are other sequences that cannot be taken from rolls but [4] is the shortest.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == rolls.length</code></li> <li><code>1 <= n <= 10⁵</code></li> <li><code>1 <= rolls[i] <= k <= 10⁵</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	shortestSequence(int[] rolls, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

shortestSequence

public int shortestSequence(int[] rolls,
 int k)