Given a n-by-n matrix, each cell has a value of either 0 or 1. A cell indicates a wall if its value is 1. give the length of the shortest path from M[0][0] to M[n-1][n-1]. You can move either up, down, left or right.
I applied through a recruiter. I interviewed at X (Boston, MA)
Interview
The take home question was to write a yaml parser.
Design gmail was the architecture question. We talked a lot about scaling and reliability.
Walk through resume line by line.
Talk with manager about why Twitter.
I applied through an employee referral. The process took 1 week. I interviewed at X in Oct 2014
Interview
I got an internal referral by my friend. The recruiter contacted me through in 2 days, ask me to go through an online pre-screen where I have to solve two easy coding tests like binary tree traverse. 2 days after I passed that an phone interview was scheduled. The phone interview interviewer was nice and respectful. Two knowledge based question was aksed, then I was asked to solve a problem in an online code editor.