Amazon | Phone Screen | Find if Path Exists in Matrix
Anonymous User
3905

Location: Santa Monica
Date: Oct 2019
Result: Rejection

Has a phone call that lasted one hour.

The interviewer asked:

Two behavioral questions

  1. Can you talk about an experience in which you had a deadline that you couldn't meet and how did you handle it?
  2. Another question related to deadlines and what you learned (Don't exactly remember)

One Coding Question

  1. Skier going down a mountain.
    • Write a program where you have a 2D array of MxN, starting at (0,0) and needs to return true if they can reach the bottom right-most index (M, N). Return false if they can not.
    • Skier can only traverse through portions of the array marked 0. If there is a 1 then the skier can not traverse that index.
    • The skier can only go down or right.
  2. Follow-up
    • What if the skier can go left as well.
Comments (6)