Amazon Interview Question for SDE1s


Country: United States
Interview Type: In-Person




Comment hidden because of low score. Click to expand.
1
of 1 vote

first of all don't use the greedy approach,if u try to solve with greedy,it will lead to u minimum intermediate path till some point in between. Here comes Dynamic programing in action.for going every location from given position try to find best possible path and use that best path to proceed ahead.

- go4gold April 05, 2014 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

Yeah make the recursive call to get the solution

- Vaibhavs April 07, 2014 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

Graph problem.

(u,v) \in E iff the cell u is adjacent to v in the matrix, and the entry of v (or of u-- not clear from your phrasing) is 1.
run SPA or BFS

- Anonymous April 26, 2014 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More