Sponsored
Use these hints if you're stuck. Try solving on your own first.
Represent the counts (odd or even) of vowels with a bitmask.
Precompute the prefix xor for the bitmask of vowels and then get the longest valid substring.
Solve with full IDE support and test cases
