Given a string word, determine whether it is a valid word.

A string word is considered valid if all of the following conditions are true:

1. The length of word is at least $3$.

2. word contains at least one vowel character.

3. word contains at least one consonant character.

4. Every character in word is an English letter (uppercase or lowercase) or a digit.

Return true if word is valid, otherwise return false.

Note: Vowels are a, e, i, o, u (case insensitive). Consonants are English letters that are not vowels.

Constraints:

• $1 \leq$ word.length $\leq 20$

• word consists of English uppercase and lowercase letters, digits, '@', '#', and '$'.

Input: word = "a1b"-str
Output: true-bool
Explanation: The length is 3, it contains a vowel (a) and a consonant (b), and all characters are letters or digits.

Input: word = "ab"-str
Output: false-bool
Explanation: The length is less than 3, so it cannot be valid.

Input: word = "123"-str
Output: false-bool
Explanation: All characters are digits, so it has no vowel and no consonant.

Input: word = "AEI"-str
Output: false-bool
Explanation: It contains vowels, but no consonant characters.

Input: word = "bcd9"-str
Output: false-bool
Explanation: It contains consonants and digits, but no vowel.

Input: word = "a#b"-str
Output: false-bool
Explanation: # is not a letter or digit, so the word fails the allowed-character condition.

Input: word = "U2f"-str
Output: true-bool
Explanation: The length is 3, it contains a vowel (U), a consonant (f), and a digit (2), and all are allowed characters.

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.