Search
⌘K

Leetcode 2823. Deep Object Filter

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.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.