Amazon | SDE2 | Bangalore | Offer
Anonymous User
968

Status: 5 YoE

Total rounds - 5 (1 screening + 4 onsite)

Screening Round: Hackerrank test (two medium graph based questions)

Round: 1 (coding)
1> Given an sorted array, find first and last position of an element
2> Top view of binary tree --> Vertical view
3> LP questions

Round: 2 (coding)
1> Implement a stack data structure with following operations
void push(int ), int pop(), int getMiddle(), void removeMiddle()
2> Given a list of words such as aa, ab, bc, cd, xy, zf, de,..... Find the max length of the word formed
by concatenating these words. The condition for concatenation is such that the last char of first word should be
same as the first char of the second word. For e.g ab can be concatenated with bd but not with db
3> LP questions

Round: 3 (HLD)
1> Implement Metric health monitoring and Notification system
2> LP questions

Round: 4 (LLD)
1> Design a text-editor
2> LP questions

#amazon #bangalore

Comments (2)