Thursday, October 2, 2025
HomeData Modelling & AIAmazon Interview Experience | Set 187 (For SDE1)

Amazon Interview Experience | Set 187 (For SDE1)

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
1

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

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.
tree1
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.

If you like neveropen and would like to contribute, you can also write an article and mail your article to review-team@geeksforgeeks.org. See your article appearing on the neveropen main page and help other Geeks.

Related Practice Problems

Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!

RELATED ARTICLES

Most Popular

Dominic
32331 POSTS0 COMMENTS
Milvus
85 POSTS0 COMMENTS
Nango Kala
6703 POSTS0 COMMENTS
Nicole Veronica
11867 POSTS0 COMMENTS
Nokonwaba Nkukhwana
11926 POSTS0 COMMENTS
Shaida Kate Naidoo
6818 POSTS0 COMMENTS
Ted Musemwa
7079 POSTS0 COMMENTS
Thapelo Manthata
6775 POSTS0 COMMENTS
Umr Jansen
6776 POSTS0 COMMENTS