The phone screen felt surprisingly brief, focused mostly on my past experiences with a few technical questions sprinkled in. Later, the technical rounds included a DSA question on binary tree traversal and system design for a news feed, which I found engaging. Funny enough, I had recently gone through a similar architecture breakdown on PracHub while prepping. Finally, I tackled a problem about merging sorted linked lists, which wrapped up the interview process. They extended an offer, and I happily accepted. Overall, it was a positive experience with just the right mix of questions.

Given a binary tree, return its vertical order traversal.

Design a news feed system for a social network.

Merge $k$ sorted linked lists into one sorted list.