Description
Solutions
Number of Substrings Without Vowels

Given a string (length 1 to 1000), return the number of substrings which don't have any vowels. Circular substrings are valid.

Example 1: 

Input:  s = "abc"
Output: 3 
Explanation:

All possible substrings are:

a, b, c, ab, bc, ca, abc, bca, cab

substrings that do not have vowels are:

b, c, bc

so we return 3
Constraints:
    🙋‍♀️
Thumbnail 0
Testcase
Result
Case 1

input:

output: