Search Over In-Memory Data

MediumPython

Problem

Implement an efficient search algorithm to filter through a large, in-memory dataset based on dynamic user queries.

Implement search_records(records, query). Each record is a dictionary with unique id, status, category, and integer price fields. A query may contain status, category, min_price, and max_price; omitted fields impose no restriction. Return matching record IDs in their original dataset order, with price bounds inclusive.

Constraints

1 <= len(records) <= 5000
Each record contains a unique integer id, status, category, and price
status and category are strings
price is an integer
The query contains only status, category, min_price, and max_price
min_price and max_price are inclusive when present

Function Signature

def search_records(records, query):

CodePython 3

Run your code to see test output here.