Open In App

Amazon Interview Experience for SDE-1

Improve
Improve
Like Article
Like
Save
Share
Report

Round 1:

  • Find the next greater element in an array:
  • Find the next greater of next smaller  element in an array
  • Longest Palindromic String(Iterative and Recursive)
  • Longest Palindromic Subsequence

Round 2:

Find the maximum element for every window of size k.

Write edge cases,   write code for the mentioned data structure

Round 3:

Managerial Round:

Tell instances where you demonstrated Learn and Be Curious, Customer Obsession

Round 4:

Bar Raiser Round

Add one to a linked list ( Time Complexity: O(n), Space Complexity O(1))

 


Last Updated : 21 Jan, 2020
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads