I went through some interview rounds for SDE-2 in amazon. Below is the format.
Round1: It was a test on HackerEarth with two programming questions
Round 2:
- Boundary Traversal of binary tree
neveropen Link - Find four elements a, b, c and d in an array such that a+b = c+d
neveropen Link
Write production ready code. Consider scenario for duplicates too.
Round 3:
-
Trapping Rain Water
neveropen Link - Next smallest palindrome
neveropen Link
If you like neveropen and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the neveropen main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
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!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
