The cleanest one-liner walks the object's own enumerable entries and keeps only the pairs whose key is in the whitelist. Object.fromEntries then rebuilds an object from the surviving [key, value] tuples. This runs in O(n + m) where n is the entry count and m is the keys list, and it never touches inherited properties because Object.entries only sees own enumerable keys. Use this when you trust the whitelist source and don't care that absent keys silently disappear from the result.

Switching from keys.includes to a Set lookup turns each key check from O(m) into O(1), which matters once the whitelist gets long. Iterating the keys list (instead of the object) also lets the result key order match the caller's intent rather than the object's insertion order. The key in obj check skips keys that aren't on the source so the output stays clean of undefined values. Reach for this version when the whitelist comes from config and may grow over time.

A predicate-driven pickBy generalises the helper from a fixed whitelist to any value or key rule, which covers "drop empty fields before PATCH", "keep only truthy values", or "keep keys matching a prefix". The predicate receives both value and key so caller code stays declarative. This still runs in O(n) and never mutates the source, so it's safe to chain into JSON.stringify or another transform. Use the simpler pick for whitelisting and pickBy for value-shaped filters.