I went to the tech equality summit, so the process was a little bit different. It was an hour where the first 15 minutes were behavioral.

It was pretty straightforward (no curveballs). The rest of the interview was technical, where I was asked two technical questions.

The first question was easy; you just needed to return the first instance of a specific output from an array. The helper function provided an arbitrary output, so the first question was literally just scanning through an array.

The second question was to sum up all the nodes of the rightmost leaves in a binary search tree (a variant of the "left nodes" problem from the NeetCode tree section, I believe).

I explained it above. One LeetCode easy and one LeetCode tree medium (variant of left nodes of a binary tree), something along those lines.

Hint: Use BFS.