DP world Software Engineer interview experience

After that first segment, I was asked another DS&A coding question that followed the same theme, with the overall focus staying on careful pointer-like reasoning through a non-trivial transformation.

The main problem I worked on was converting a binary tree into a linked list. I was given left, right, and next-style fields, and the interviewer wanted the tree flattened so that the linked list structure followed the expected “next” links. I talked through the approach step by step, covering how to traverse the tree and how to wire up the resulting list. I ended up discussing the reasoning