ME

Count Sequences with Vowels

You are given a string s whose length can be more than 10^9. You are given an array arr and a string p showing the count of the characters (for example, if arr = [1, 2] and p is 'ab', then the string s is 'abb'). Count the number of sequences modulo 10^9 + 7 such that every sequence contains all the vowels atleast once.

Constraints:

1 ≤ n ≤ 10^5
1 ≤ arr[i] ≤ 10^5

solution.cpp

Loading...

Run code to see test results

00:00 / 69:42

Count Sequences with Vowels

HardMed•109 views

You are given a string s whose length can be more than 10^9. You are given an array arr and a string p showing the count of the characters (for example, if arr = [1, 2] and p is 'ab', then the string s is 'abb'). Count the number of sequences modulo 10^9 + 7 such that every sequence contains all the vowels atleast once.