Amazon SDE 2 | Hyderabad | India | March 2020
Anonymous User
3023

Amazon SDE 2 | Hyderabad

Profile
B.E. (Electronics) Tier 1 college (IITs/NITs/NSIT/DTU) Delhi
Experience - 2 years 8 months

Round -1

  1. Given a continuous stream of integers. Print the median.
    https://leetcode.com/problems/find-median-from-data-stream/
  2. Dutch national flag problem (Only 5 mins were left after discussing and coding above problem to code this problem), I missed 2 edge cases in this.
    https://leetcode.com/problems/sort-colors/

Round-2 (Behavioural Round on Leadership Principles)

  1. Describe a situation in which you performed beyond expectations or set goals.
  2. Describe situation when you disagree with manager and how you dealt with it and your reaction.
  3. Describe situation when you got task and thought you couldn't do it or it is beyond your capability.
    I found this article very useful for leadership principles round
    https://medium.com/@scarletinked/are-you-the-leader-were-looking-for-interviewing-at-amazon-8301d787815d

Round-3
It was with TPM, discussed all of my projects and their architecture.
What can be improved in the architecture and why any particular technology is used etc (compare Rabbitmq, kafka, sqs, sns)?
Some behavioural questions.

Round-4

  1. Describe projects and some behavioural questions.
  2. Design OOPs model for a problem scenario given. Had to use interface, abstract class, inheritance, function overloading in child class and explain why I used them and how the flow will work.

Round -5

  1. Return true if any substring matches the regex given. Function had 2 input arguments string and regex. Had to write code only to handle . and *
    a.b means there can be only 1 character between a-b. like acb, aab, ayb
    a*b means there can be any number of characters between a-b. like aaab, accccssdb, acb etc
    eg. a*b, ahdgdhdhhb- true
    a.b, acbbbx- true
    a.b, abdc- false
    https://leetcode.com/problems/regular-expression-matching/

  2. Given an array of numbers whose adjacent elements differ by at max +1 or -1. Find a number in array.
    https://www.***.org/search-an-element-in-an-array-where-difference-between-adjacent-elements-is-1/

Got shortlist call on next Thursday.

Comments (4)