Deduplicate and Sort Visible Items | Dataford Interview Questions

How would you refactor this component to improve its readability and performance?

Assume the component receives items, a list of dictionaries containing id, visible, and value. Implement refactor_component(items) to return visible items with duplicate IDs removed, keeping the first occurrence, and ordered by ascending id. The result must not mutate the input.

Input and output values are plain lists and dictionaries.

Constraints

0 <= len(items) <= 10^5
Each item contains integer id, boolean visible, and any value
IDs may repeat
The input list and its dictionaries must not be mutated

Function Signature

def refactor_component(items):

Your question is Deduplicate and Sort Visible Items. 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

How would you refactor this component to improve its readability and performance?

Input and output values are plain lists and dictionaries.

Constraints

0 <= len(items) <= 10^5
Each item contains integer id, boolean visible, and any value
IDs may repeat
The input list and its dictionaries must not be mutated

Function Signature

def refactor_component(items):

Your question is Deduplicate and Sort Visible Items. 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.