Tarea · cadenas de texto medio Python ·
Most frequent words
A word is a maximal run of ASCII letters (a–z, A–Z); everything else separates words. Words are compared case-insensitively and returned in lowercase. Return the k most frequent words, ordered by count (highest first) and then alphabetically. If there are fewer than k distinct words, return all of them.
Firma
def top_words(text: str, k: int) -> list[str]:Ejemplos
top_words('the cat and the hat. The end!', 2) # -> ['the', 'and']
top_words('', 3) # -> []
top_words("Don't stop", 5) # -> ['don', 'stop', 't']Más 6 pruebas ocultas y 1 prueba de carga bajo un límite de tiempo; sus entradas no se muestran. Las tareas se presentan a los modelos en inglés.
#1Google Gemini 3.8 Flashresuelto · 10 de 10 pruebasrespuesta en 1.7 s · ejecución 194 ms · $0.0006 ✓ top_words('the cat and the hat. The end!', 2)esperado ['the', 'and'] <1 ms ✓ top_words('', 3)esperado [] <1 ms ✓ top_words("Don't stop", 5)esperado ['don', 'stop', 't'] <1 ms ✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms⏱ 188 msCódigo
import re from collections import Counter def top_words(text: str, k: int) -> list[str]: if k <= 0: return [] words = re.findall(r"[a-zA-Z]+", text.lower()) counts = Counter(words) # Sort by (-count, word) and take the top k return sorted(counts.keys(), key=lambda w: (-counts[w], w))[:k]#1OpenAI GPT-6 Lunaresuelto · 10 de 10 pruebasrespuesta en 1.5 s · ejecución 203 ms · $0.0001 ✓ top_words('the cat and the hat. The end!', 2)esperado ['the', 'and'] 1 ms ✓ top_words('', 3)esperado [] <1 ms ✓ top_words("Don't stop", 5)esperado ['don', 'stop', 't'] <1 ms ✓ <1 ms✓ <1 ms✓ <1 ms✓ 1 ms✓ <1 ms✓ 7 ms⏱ 190 msCódigo
import re from collections import Counter def top_words(text: str, k: int) -> list[str]: if k <= 0: return [] counts = Counter(re.findall(r"[A-Za-z]+", text.lower())) return sorted(counts, key=lambda word: (-counts[word], word))[:k]#1Z.ai GLM 5.3resuelto · 10 de 10 pruebasrespuesta en 683 ms · ejecución 203 ms · $0.0002 ✓ top_words('the cat and the hat. The end!', 2)esperado ['the', 'and'] <1 ms ✓ top_words('', 3)esperado [] <1 ms ✓ top_words("Don't stop", 5)esperado ['don', 'stop', 't'] 1 ms ✓ 1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms⏱ 196 msCódigo
import re from collections import Counter def top_words(text: str, k: int) -> list[str]: if k <= 0: return [] words = re.findall(r'[A-Za-z]+', text.lower()) c = Counter(words) return [w for w, _ in sorted(c.items(), key=lambda x: (-x[1], x[0]))[:k]]#1Anthropic Claude Haiku 5.5resuelto · 10 de 10 pruebasrespuesta en 1.0 s · ejecución 247 ms · $0.0001 ✓ top_words('the cat and the hat. The end!', 2)esperado ['the', 'and'] <1 ms ✓ top_words('', 3)esperado [] 1 ms ✓ top_words("Don't stop", 5)esperado ['don', 'stop', 't'] <1 ms ✓ 4 ms✓ <1 ms✓ 2 ms✓ <1 ms✓ 3 ms✓ <1 ms⏱ 234 msCódigo
import re from collections import Counter def top_words(text: str, k: int) -> list[str]: if k <= 0: return [] words = re.findall(r'[A-Za-z]+', text) counts = Counter(w.lower() for w in words) items = sorted(counts.items(), key=lambda kv: (-kv[1], kv[0])) return [w for w, _ in items[:k]]
Coste en tokens: $0.0010 · Cómo se ejecutan y puntúan las rondas →