Thinking the string as a Set with O(1) for look up operations: solution is O(n), where n = len(str)
def count_vowels(str): vowels = "aeiouAEIOU" count = 0 for c in str: if c in vowels: count += 1 return count;
JS lambda way
conat vowels = new Set("aeiouAEIOU"); const counVowels = input => [...input].reduce((total, current) => (total += vowels.has(current)), 0);
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Thinking the string as a Set with O(1) for look up operations: solution is O(n), where n = len(str)
JS lambda way