Prefix with PrefixCount | Dataford Interview Questions

Given a list of words and queries of the form "", answer true if some word has the query letters as prefix followed by exactly more characters (e.g. words [ball, apple], queries [ba2, app3] -> [True, False]).

Asked in the Onsite algorithms stage. Store the words and queries in the provided tables and write a PostgreSQL query to evaluate every query.

Output

One row per query with query_id, query_text, and boolean has_match.
Include malformed or unmatched queries with has_match = false.
Order by query_id ascending.

Schema

words

Column	Type	Description
word_idPK	INT	Unique word identifier
word_text	VARCHAR(100)	Word to test against queries

prefix_queries

Column	Type	Description
query_idPK	INT	Unique query identifier
query_text	VARCHAR(100)	Prefix and length expression

Your question is Prefix with PrefixCount. Start with the requirements and the two tables 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