FilesExpand file tree

master

/

problem0011.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

12 lines (9 loc) · 519 Bytes

master

/

problem0011.py

Copy path

Top

File metadata and controls

• Code
• Blame

12 lines (9 loc) · 519 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

# Implement an autocomplete system. That is, given a query string s and a set of all possible query strings, return all strings in the set that have s as a prefix.

# For example, given the query string de and the set of strings [dog, deer, deal], return [deer, deal].

# Hint: Try preprocessing the dictionary into a more efficient data structure to speed up queries.

def autocomplete(string, stringSet):

allOptions = []

for x in stringSet:

if string == x[:len(string)]:

allOptions.append(x)

return allOptions