Count Redundant Substrings Where Length Equals a*Vowels + b*Consonants: coding question

Available question text

Given a string and two integers a and b, a substring is considered redundant if its length equals a * V + b * C, where V and C are the number of vowels and consonants in the substring respectively. Find the total count of redundant substrings within the given string.

Continue with questions that share topics or the same question type.

Count of Substrings Containing Every Vowel and K Consonants I
Coding
Count of Substrings Containing Every Vowel and K Consonants II
Coding
Count Beautiful Substrings I
Coding
Count Beautiful Substrings II
Coding

Sources · 1 reference

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

Amazon
Count Redundant Substrings Where Length Equals a*Vowels + b*Consonants
Reported Jul 20, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source

Count Redundant Substrings Where Length Equals aVowels + bConsonants

Available question text

Count Redundant Substrings Where Length Equals aVowels + bConsonants

Available question text

Count Redundant Substrings Where Length Equals a*Vowels + b*Consonants

Available question text

Related questions

Count Redundant Substrings Where Length Equals a*Vowels + b*Consonants

Available question text

Related questions

Count Redundant Substrings Where Length Equals aVowels + bConsonants

Count Redundant Substrings Where Length Equals aVowels + bConsonants