Amazon Interview Experience | Set 187 (For SDE1)
Last Updated :
23 Jul, 2025
Hi, Recently i was interviewed for Amazon SDE-1 Position in Hyderabad.There a telephonic round followed by 4 F2F rounds.
Telephonic Round:
1.
Given a array find all the triplets which satisfy the triangle property(sum of 2 sides should be greater than third side)
2.
Given a array find whether it is majority array or not.
Complexity: O(n) Space complexity O(1)
F2F Round 1:
1. Given a dependency where for java packages p1,p2,p3
p1:{p2,p3}
p2:{p3}
p3:{}
This means p1 can be compiled when compilation of p2 and p3 done
p2 can compile when p3 is compiled
p3 can start as it does not have any dependence.
Figure out strategy to find the order of compilation of processes.
Ans:Topological sorting
2. Discussion on project
Asked all concept related to my final year project.
3. Current project in company
Challenges faced at company
2F Round 2:
1. Given a binary tree print its side view from left from bottom to top and right side view as up to downward .
Eg. For image 1 output will be 3, 1, 2, 5, 6, 7, 8

and for Example 2( image 2) output should be C, B, A, D, F, I, L

2.
Given a string find largest palindrome sub string in it.
3. What is virtual memory?
4. What is paging in OS?
2F Round 3:
1. Why are you looking for change in 6 months of experience .
2. Discussion on how to send notification to friends when a user post on social network like facebook
The discussion was on when to load friend list of user and he was expecting we should load friend list when user login.
2F Round 4:
1. Discussion on current project challenges faced
Situation when you have to take decision in absence of your team lead/Manager
2. Why are you looking for change in 6 months of experience
3.
Given a special binary tree structure given in image 3 A node have 3 node pointers left,right and nextTwo adjacent node share there left and right as shown in treeGive tree whose node are set with next pointer as null.
you have to set the next pointer as shown in the figure .
If any node is null then the next of its prev node should be next of that eg. a -> b -> c (a's next is b ,b's next is c) if b is null then a's next should be c.

4. What is virtual memory?
5. What is segmentation fault?
Note :- They expect fully working code in all round.
Tips:
1. Think loud they always support you
2. Ask for hint if not getting.
Related Practice Problems
Similar Reads
Amazon Interview Experience | Set 186 (For SDE1) Hi, Recently I was interviewed for the SDE-I for Amazon, Chennai. Round 1(Online Round): 1. Given two linked lists. Add them. e.g 1-->2-->3 3-->4 Output: 1-->5-->7 2. Find if the binary tree has the given sum. I cleared the online coding round and I was asked to come down for the face to face discus
2 min read
Amazon Interview Experience | Set 247 (For SDE 1) Round 1: Coding Round on paper 1 Add two numbers represented by linked lists 2 Spirally traversing a matrix Round 2: 1 Tell me about yourself?? 2 Row with max 1s Round 3: Hiring Manager Have you use what's app, there are some hints come when we start type. How these hints are coming.He asked me 1 to
1 min read
Amazon Interview Experience | Set 308 (For SDE) I was recently interviewed for the position of SDE-1 at Amazon. It was a 3 round process: Round 1: On paper coding: Given a binary tree print it in vertical order. The problem is stated here: Print a Binary Tree in Vertical Order Given a linked list convert it into given format: 1->2->3->4-
1 min read
Amazon Interview Experience | Set 373 (For SDE 2) Round 1 Trapping rain water Total number of possible binary search trees with n keys , Just the formula and its derivation was discussed Round 2 Majority Element Boundary traversal of a binary tree Round 3 Discussion on my project, its design, challenges faced, what important decisions I took that w
1 min read
Amazon Interview Experience | Set 426 (For SDE-1) Round 1:Written Round had 3 questions:- 1- Sum of two linked lists Don't remember the other 2. Round 2: DS algo 1-Find pair with given sum in bst 2-Transpose of the matrix Round 3: problem solving 1-Find top view of binary tree (Iterative approach) 2nd question was on matrix don't remember exactly
1 min read
Amazon Interview Experience | Set 345 (For SDE-1) Round 1: Onsite, Design Design an online file repository system What are the use cases Features Security HLD LLD Round 2: Onsite, Algo Detailed discussion on projects. My contributions to project. nth Fibonacci number in O(n). Data Structure with O(1) time for: get(key) :value set(key, value) delete
1 min read