Coding Questions Asked in Amazon

Write a program to convert Binary tree to its Mirror Tree.
OR
convert Binary tree to Symmetric Tree (i.e Mirror Image of itself).

Input : NA

Output : NA

View Answer |  Basics |  Practice Program | To Reading List | Asked In Amazon |  Experience

Write a Program to print a binary tree in Zig Zag way.
OR
Print the Binary Tree in Zig Zag Level-Order.
Input:
.................(25)
......... (4)...........(10)
.....(2)......(8)...(12)......(7)

OutPut: 25,10, 4, 2, 8, 12, 7

Input : NA

Output : NA

View Answer |  Basics |  Practice Program | To Reading List | Asked In Amazon |  Experience

Write A program to find the sum of two numbers equel to 'n' or not in given vector.

Input : NA

Output : NA

View Answer |  Basics |  Practice Program | To Reading List | Asked In Amazon |  Experience

Car parking problem. An array given represents the actual order of cars need to be parked. Like for example order is 4,6,5,1,7,3,2,empty. If cars are parked in some order like empty,1,2,3,7,6,4,2. Some person needs to get them into the correct order, list out all instructions to the person to get in the correct order with least number of swaps.

Input : NA

Output : NA

View Answer |  Sorting |  Practice Program | To Reading List | Asked In AmazonHackerRank |  Experience, Fresher

There are many cars parked in the parking lot. The parking is a straight very long line and a parking slot for every single meter. There are cars parked currently and you want to cover them from the rain by building a roof. The requirement is that at least k cars are covered by the roof. What's the minimum length of the roof that would cover k cars?

The function has the following parameters:
cars: integer array of length denoting the parking slots where cars are parked
k: integer denoting the number of cars that have to be covered by the roof

Example:
Input:
cars: [2, 10, 8, 17]
k: 3
output: 9
Explanation: you can build a roof of length 9 covering all parking slots from the 2nd one to the 10th one, so covering 3 cars at slots 2, 10, 8, there are no shorter roof that can cover 3 cars, so the answer is 9

Note:
1 <= n <= 10^5
1 <= k <= n
1 <= cars[i] <= 10^14
All slots token by cars are unique

Input : cars: [2, 10, 8, 17]
k: 3

Output :

View Answer |  Sorting |  Practice Program | To Reading List | Asked In AmazonHackerRank |  Experience, Fresher