Indeed Machine Learning Engineer Interview Experience — Indexing and Insertion in an Unrolled List

The author describes a tricky coding exercise from an Indeed virtual onsite involving a linked structure whose nodes each hold an array, an occupancy count, and a next-node reference. The first task was to retrieve an element using its position across the entire structure. The report discusses locating the relevant node and relates lookup cost to the number of nodes traversed.

The second task added insertion at a global position. The account distinguishes between making room inside a node with spare capacity and splitting data into another node when storage is full. It concentrates on these implementation mechanics and does not describe other interview rounds, interviewer feedback, or a hiring decision.