Find Unreachable Objects in a Heap Graph
Company: Anduril
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
Overview: Find unreachable objects in a heap graph starting from stack-root addresses. Traverse outgoing references while handling cycles, self-links, missing addresses, and large graphs, then return unreachable primitive addresses in original heap order with linear expected work.