Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 20
What's a common structure for 'autocomplete with typo tolerance'?
A
A hash map only
B
A binary heap
C
A BK-tree or a trie combined with Levenshtein automata to search within edit distance k
D
A skip list