Applied through Amazon jobs portal.
Number of rounds – 5
Overall time taken – 2.5 months.
YOE - 1.2 yr

• Round 1 – Online Assessment (First week of Aug, 2021)

  • Q1: Prime Orders
    Given a List of Orders , where each Order is a string . For example : [aax 12 23 ] [ ff kindle ebook] are two orders. Each order has an ID which is first part of the order ( ID of order 1 = aax , ID2 = ff ). The remaining part of the order is referred to as MetaData. There are two types of orders, Prime orders ( which contain non numeric Meta Data) and Non-Prime Orders (which contain Only-Numeric Meta Data). Sort the List of Orders as given below :
    a. Prime Orders before NonPrime Orders
    b. Prime Order with lexicographically smaller MetaData comes first.
    c. In Case of tie in (b) , the one with lexicographically smaller ID comes first.
    d. The relative order of NonPrime Orders remains the same.

  • Q2: Demolition Robot
    Given a matrix with values 0 (trenches) , 1 (flat) , and 9 (obstacle) you have to find minimum distance to reach 9 (obstacle). If not possible then return -1.
    The demolition robot must start at the top left corner of the matrix, which is always flat, and can move on block up, down, right, left.
    The demolition robot cannot enter 0 trenches and cannot leave the matrix.
    Sample Input :
    [[1, 0, 0],
    [1, 0, 0],
    [1, 9, 1]]
    Sample Output :
    3

  • Passed all test cases for both the problems.

• Round 2 – 1st Technical Round (First week of Oct, 2021)

  • Indroduction

  • Find LCA of the deepest nodes of Graph.
    Hard level problem

  • Min number of flips to make binary string alternate.
    Easy level problem

  • LP – Tell me about a time you faced an obstacle and how you overcame it.

• Round 3 – 2nd Technical Round (First week of Oct, 2021)

  • Indroduction

  • Find the Missing Number in a sorted array.
    Medium level problem
    First solve with Brute force approach. Then optimize it with Binary Search.

  • Check if two n-ary trees are the mirror of each other or not.
    Medium level problem

  • LP –Tell me about a time when you innovated and exceeded the expectation

• Round 4 –Hiring Manager Round (Second week of Oct, 2021)

  • Indroduction

  • Given two sorted arrays, such that they have some common elements. Find the maximum sum path to reach from the beginning of any array to end of any of the two arrays. We can switch from one array to another array only at common elements.
    Input: ar1[] = {2, 3, 7, 10, 12} ar2[] = {1, 5, 7, 8}
    Output: 35
    Medium level problem

  • LP:
    1. Tell me about one of your projects.
    2. Some Technical question related to project.
    3. Tell me about a time when you learned new technologies.
    4. Tell me about a time when you had conflicting ideas with your teammates and how did you resolve them?

• Round 5 –Bar Raiser Round (Second week of Oct, 2021)

  • Indroduction

  • LP:
    1. Tell me about a project you're proud of.
    2. Tell me about a time when you faced a setback initially but still achieved the goal.
    3. Tell me about a time when you thought of an unpopular idea.
    4. Time when you went above and beyond your job responsibilities.
    5. Questions on Machine Learning (Related to my projects).

    6. In-depth questions on a project currently working on.

Verdict – Selected.

Compensation - https://leetcode.com/discuss/compensation/1721988/Amazon-or-SDE-1-or-Hyderabad