Package g3201_3300.s3298_count_substrings_that_can_be_rearranged_to_contain_a_string_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3298 - Count Substrings That Can Be Rearranged to Contain a String II.

    Hard

    You are given two strings word1 and word2.

    A string x is called valid if x can be rearranged to have word2 as a prefix.

    Return the total number of valid substrings of word1.

    Note that the memory limits in this problem are smaller than usual, so you must implement a solution with a linear runtime complexity.

    Example 1:

    Input: word1 = "bcca", word2 = "abc"

    Output: 1

    Explanation:

    The only valid substring is "bcca" which can be rearranged to "abcc" having "abc" as a prefix.

    Example 2:

    Input: word1 = "abcabc", word2 = "abc"

    Output: 10

    Explanation:

    All the substrings except substrings of size 1 and size 2 are valid.

    Example 3:

    Input: word1 = "abcabc", word2 = "aaabc"

    Output: 0

    Constraints:

    • <code>1 <= word1.length <= 10<sup>6</sup></code>

    • <code>1 <= word2.length <= 10<sup>4</sup></code>

    • word1 and word2 consist only of lowercase English letters.

    • 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 Long validSubstringCount(String word1, String word2)

      • Methods inherited from class java.lang.Object

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