Asynchronous Search Filter Updates | Dataford Interview Questions

Given a list of strings items and a sequence of search queries queries, implement a function that simulates an asynchronous search bar. Each query starts a filter task after a debounce delay. If a newer query arrives before the previous task finishes, the older task must be ignored. Return only the UI updates that should actually be rendered, skipping consecutive duplicate result sets.

Constraints

1 <= len(items) <= 10^4
1 <= len(queries) <= 10^4
0 <= queries[i][0] <= 10^9
Query timestamps are non-decreasing
0 <= debounce_ms, work_ms <= 10^6
Each item and query is a string of length at most 100
Matching is case-sensitive substring matching

Function Signature

def simulate_search_updates(items, queries, debounce_ms, work_ms):

Your question is Asynchronous Search Filter Updates. 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

Constraints

1 <= len(items) <= 10^4
1 <= len(queries) <= 10^4
0 <= queries[i][0] <= 10^9
Query timestamps are non-decreasing
0 <= debounce_ms, work_ms <= 10^6
Each item and query is a string of length at most 100
Matching is case-sensitive substring matching

Function Signature

def simulate_search_updates(items, queries, debounce_ms, work_ms):

Your question is Asynchronous Search Filter Updates. 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.