Count a Few Words

Given a tuple of strings, how many of them have exactly three times the letter ’o’? Write a function $count3o(t)$ that receives a tuple t, made up of arbitrary strings, and returns the quantity of strings in the tuple that have exactly three occurrences of the lowercase vowel ’o’.

Observation

Solutions employing the method str.count() may be accepted but will not receive the maximum grade.

Problem information

Author: José Luis Balcázar

Generation: 2026-01-25T17:19:03.792Z