The final round was much more straightforward than I expected, especially after an online assessment that had two problems. Once I cleared the OA, I moved directly to a final stage made up of three interview loops. The process was centered heavily on data structures and algorithms, but it also tested system design, object-oriented thinking, and behavioral fit rather than relying on coding alone.
One loop combined a relatively simple coding question with more behavioral questions. Another was a standard graph-style problem involving breadth-first search on a chessboard, so the main challenge was recognizing the graph traversal pattern and implementing it cleanly. The remaining loop focused on system design. Other technical topics that came up around this process included tree operations, such as finding the minimum node in a binary tree, and array partitioning problems where chunks are sorted independently before being concatenated into a fully sorted array. The questions felt recognizable if you had prepared common data-structure patterns, rather than being unusually obscure or tied to a particular technology stack.
The interviewers were respectful and willing to help, which made the loops feel manageable even when working through technical details. Behavioral questions were woven into the final round, so it was important to be ready to explain both how I approached problems and how I worked with others. I ultimately received and accepted the offer. My biggest takeaway would be to prepare breadth-first search and core tree or array problems, but not to neglect system design and object-oriented design, since the process evaluated all of those areas.
