The interview was 30 minutes and conducted by one person. They asked about past projects and experience and some just small talk. They asked you to write a method that moved all the zeros of an array to the front and keep the rest of the array in order.
applied online. got back to me with interest for on-campus interview. I went in , wrote up code to check if a string is a palindrome, moved onto Seattle.
Interview questions [1]
Question 1
Given a Binary Tree (not Search Tree) , find the lowest common ancestor.