Problem Brief

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.

1Example 1

Input

s = "abc"

Output

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

Limits and guarantees your solution can rely on.

🙋‍♀️

Draft autosaves locally

public int numberOfSubstringsWithoutVowels(String s) {
  // write your code here
}

Input

"abc"

Output