Build a Take-Home App Challenge | Dataford Interview Questions

Build an app take-home "challenge".

Implement autocomplete(words, queries, k). words is a list of [word, frequency] pairs, and each query returns up to k matching words. Rank matches by descending frequency, then lexicographic order; if the query exactly matches a submitted word, return only that word.

Signature: def autocomplete(words, queries, k):. Return a list of result lists in query order.

Constraints

1 <= len(words) <= 5000
1 <= len(queries) <= 5000
1 <= len(word) <= 100
0 <= len(query) <= 100
1 <= k <= 100
Words and queries contain lowercase English letters only
Word strings are unique
Frequencies are non-negative integers

Function Signature

def autocomplete(words, queries, k):

Your question is Build a Take-Home App Challenge. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Build an app take-home "challenge".

Signature: def autocomplete(words, queries, k):. Return a list of result lists in query order.

Constraints

1 <= len(words) <= 5000
1 <= len(queries) <= 5000
1 <= len(word) <= 100
0 <= len(query) <= 100
1 <= k <= 100
Words and queries contain lowercase English letters only
Word strings are unique
Frequencies are non-negative integers

Function Signature

def autocomplete(words, queries, k):

Your question is Build a Take-Home App Challenge. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.