The technical interview process consisted of three rounds.

The last round was a "super day."

I was shocked because this final round did not include dynamic programming. Instead, it focused on tree traversal, arrays, and linked lists.

Previous rounds before that were almost entirely dynamic programming problems.

Keep in mind that you want to finish these problems as fast as possible because you have behavioral interviews at the end.

Binary Tree Traversal

DP problem where you can only move left and down (starting at top left and ending at top right).

This is a similar problem to one found on LeetCode and discussed on NeetCode.