Amazon Interview Report
- 1of 1 vote
AnswersImplement DFS
- Mumbaiya_Chori January 19, 2015 in India for Machine learning
After I implemented this, I was told to implement it without recursion. He told me to write pseudo code. I wrote it using stacks.| Report Duplicate | Flag | PURGE
Amazon SDE1 - 1of 1 vote
AnswersGiven a matrix (0,0 is to the botto9m left like co-ordinate system)of 0s and 1s and two co-ordinates find if there is a path between them, Also you can only travel via 1s and you can only go up or right.
- Mumbaiya_Chori January 19, 2015 in India for Machine learning
Answer: Backtracking algorithm| Report Duplicate | Flag | PURGE
Amazon SDE1 - 0of 0 votes
Answersgiven K sorted arrays merge them
- Mumbaiya_Chori January 19, 2015 in India for Machine learning
Answer: Told him how to do using merge of merge sort. He wanted me to do another approach I googled later you can use min heap for it.| Report Duplicate | Flag | PURGE
Amazon SDE1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.