Multi-Level Boolean Query Depth | Dataford Interview Questions

Given a multi-level boolean query find the level of a given term. E.g. query = A AND (B OR C), term = B -> 1; term = A -> 0; term = D -> -1; query = B AND ((A AND B)), term = B -> 1 (consider deepest level); query = ((A)), term = A -> 0. Operators are AND/OR; operands can be strings with spaces.

Asked in the DSA round stage. Write a SQL query using the provided tables.

Output

One row per requested query and term.
Return query_id, term, and term_level.
Use the deepest matching level, or -1 when the term is absent. Order by query_id.

Schema

boolean_queries

Column	Type	Description
query_idPK	INT	Identifier for the boolean query
expression	TEXT	Boolean expression containing operands, AND, OR, and parentheses

query_terms

Column	Type	Description
request_idPK	INT	Identifier for the requested term row
query_id	INT	Boolean query being searched
term	TEXT	Operand whose deepest level must be returned

Your question is Multi-Level Boolean Query Depth. 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