You are given a string s.

Let v be the number of vowels in s, where vowels are the characters 'a', 'e', 'i', 'o', and 'u'.

Let c be the number of consonants in s, where consonants are all other lowercase English letters.

Characters that are digits or spaces are neither vowels nor consonants.

The score of s is calculated as follows:

• If $c > 0$, the score is $\lfloor v / c \rfloor$.

• If $c = 0$, the score is $0$.

Return the score of s.

Constraints:

• $1 \leq$ s.length $\leq 100$

• s consists of lowercase English letters, spaces, and digits.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.