Amazon Interview Report
- 0of 0 votes
AnswersRound2: Q2
- Ray July 20, 2011
Given a array find the sub array with maximum sum.| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Arrays - 0of 0 votes
AnswersRound2: Q1
- Ray July 20, 2011
There is a matrix where the cost of moving horizontally is 1, vertically is 1 and diagonally is 1.1. Now given two points, what is the number of shortest paths between these two points.
Hint: This will boil down to permutation with duplicates. Then he asked to code for this.| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Algorithm Brain Teasers - 0of 0 votes
AnswersRound1: Q1
- Ray July 20, 2011
Find the vertical sum in a binary tree.
Input:
(Plz construct the tree using the pre-order and in-order traversals)
Pre-order: 1 2 4 5 3 6 7
In-order: 4 2 5 1 6 3 7
Output:
Arr-Index Sum
0 4
1 2
3 12
4 3
5 7| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Trees and Graphs
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.