Available question text
Recursively traverse a nested object/array structure and apply a predicate to decide which values or entries to keep, returning a new object with keys removed when their values (or all descendant values) fail the predicate. Handle arbitrary depth, arrays and objects, and avoid mutating the original while pruning empty containers.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2823. Deep Object Filter
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source