Amazon Interview Experience for FTE | On-Campus 2020(Virtual)
Online Coding Round: 2 Coding questions based on tree and graph.
Round – 1 (60 Minutes):
- In a range of m and n print all the numbers having consecutive difference 1 between digits. (3 Approach)
- Arrival and Departure of the train is given, you have to calculate the minimum number of Stations(2 Approach)
Round – 2 (60 Minutes):
-
Given an array of candidates of a marathon, such that for every a[i], a[i] comes before i+1.(2 Approach)
If a[i]= -1, that means a[i] is the winner.
Output the array with the ranking of candidates
-
Minimum number of Steps Knight will require reaching x,y position in infinite size Chess Board(2 Approach)
Round 3 – (1 hr 45 Minutes):
-
Tell me About Yourself
-
Given a String having 0 and 1. Have to convert that string such that all 0 comes first and all 1 comes after 0 in a minimum number of flips
Ex.
00001000110111 output->2
-
Symmetric Tree(2 Approach)
-
kth largest element in running stream.(2 Approach)
-
Sorting(merge, Heap)
-
Heap sort Implementation
-
Thrashing
-
Deadlock
-
Polymorphism
-
Run-Time Polymorphism vs Compile Time Polymorphism (Example)
-
Inheritance vs Composition (Example)
-
TCP vs UDP
-
SQL vs NO SQL
-
Reason for Deadlock to occur
-
What happens when you type www.facebook.com
They took only 1 student and I can’t make it.
Last Updated :
27 Nov, 2020
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...