Package g3301_3400.s3333_find_the_original_typed_string_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3333 - Find the Original Typed String II.

    Hard

    Alice is attempting to type a specific string on her computer. However, she tends to be clumsy and may press a key for too long, resulting in a character being typed multiple times.

    You are given a string word, which represents the final output displayed on Alice's screen. You are also given a positive integer k.

    Return the total number of possible original strings that Alice might have intended to type, if she was trying to type a string of size at least k.

    Since the answer may be very large, return it modulo <code>10<sup>9</sup> + 7</code>.

    Example 1:

    Input: word = "aabbccdd", k = 7

    Output: 5

    Explanation:

    The possible strings are: "aabbccdd", "aabbccd", "aabbcdd", "aabccdd", and "abbccdd".

    Example 2:

    Input: word = "aabbccdd", k = 8

    Output: 1

    Explanation:

    The only possible string is "aabbccdd".

    Example 3:

    Input: word = "aaabbb", k = 3

    Output: 8

    Constraints:

    • <code>1 <= word.length <= 5 * 10<sup>5</sup></code>

    • word consists only of lowercase English letters.

    • 1 &lt;= k &lt;= 2000

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer possibleStringCount(String word, Integer k)

      • Methods inherited from class java.lang.Object

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