# Count Vowel Strings in Ranges (Practice 5059): Drill
Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.
## Approach
Prefix sums over a boolean array answer each range query in O(1).
```python
def vowel_strings(words,queries):
v=set('aeiou');p=[0]
for w in words: p.append(p[-1]+(w[0] in v and w[-1] in v))
return [p[r+1]-p[l] for l,r in queries]
```
## Complexity
Linear in the dominant input size for the scan; heap/tree variants add a log factor.
## Interview pitfalls
State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode.
## Practicing out loud
Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see try it free.
Published with deed.pageReport abuse