Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 20
What data structure backs an efficient 'k most frequent words' query on a static list?
A
A hash map for counts, then a size-k min-heap (O(n log k)) or bucket sort by frequency (O(n))
B
A trie only
C
A stack
D
A queue