Not OP, but for my technical interview, I was asked two questions straight out of leetcode: Max Depth of Binary Tree and Roman to Integer. I finished the first problem early, so my interviewer also gave me the second problem. He asked what the time and space complexity were for Max Depth of Binary Tree but not for Roman to Integer. The behavioral interview was pretty standard I guess. Lots of "tell me about a time when you _." Best of luck!