The final 4 hour long technical interview questions were average difficulty. The hour long interview question was harder, but unfortunately, since it was months ago, I don't remember. For the final interview though, the first was a tree related scenario with two parts. The first was finding the height, and the second was finding siblings of a node (I think). I finished earlier than the allotted 45 minutes and the interviewer asked me a follow up question on my code. The second technical interview was sorting an array of 0s, 1s, and 2s in one iteration (or at least linear time, but one pass is the preferred solution). This is a leetcode question.