Hi All,

I was recently interviewed at Amazon. Below is the process.

Round 1 - OA

• This round consisted of 2 coding questions and a Work Style Assessment.
• I was able to solve 1.5 questions and received a Hiring Interest Form after approximately 2 weeks.

Round 2 - DSA

• I received the invite for this round more than a month after the OA

• The round included 2 coding questions and 2 Leadership Principles (LP).

  Question 1 -
  Given the encoded string, str = "1226#24#(2)" = "abzxx"
  here a is denoted as 1, b as 2 .... and i as 9
  j is denoted as 10#, k as 11# and so on
  If the character occurs more than 1 times the freq is added next to encoded character in the paranthesis.
  Find the frequency of all the characters found in the string.
  o/p -> [1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 1]

  Question 2 -
  Given the list of number find the kth largest number from index [k, n]
  sample input - [4, 2, 1, 3] and k = 2
  o/p -> [2, 2, 3]

Round 3 - DSA

• This round also included 2 coding questions and 2 LP-based discussions.

  Question 1 -
  You are given an n × n grid. Some of the cells may contain traps, denoted by '-1', and the rest are free cells, denoted by '0'. You start from the top-left corner (0, 0) and want to reach the bottom-right corner (n - 1, n - 1). You can only move right or down at any step, and you cannot move into cells with traps.
  Write a function to determine the number of distinct paths from the top-left to the bottom-right of the grid.

  Follow up question -
  Now, each cell in the n × n grid either contains:
  A trap, denoted by -1 — you cannot step into these cells.
  A non-negative reward, denoted by any >= 0 integer — this is the reward collected when you step on the cell.
  You still start from the top-left cell (0, 0) and aim to reach the bottom-right cell (n - 1, n - 1) by only moving right or down, and never stepping into trap cells (-1).
  Write a function to compute the maximum total reward you can collect along a valid path from (0, 0) to (n - 1, n - 1).
  If there is no valid path, return 0.

  Question 2 -
  You are given a positive integer n. In one operation, you are allowed to subtract any one digit (from the decimal representation of n) from n itself.
  Your goal is to reduce the number to 0 using the minimum number of operations.

  Example -
  I/o -> 27
  o/p -> 5

Received a call from Aamazon recruiting team that I have successfully cleared Round 3 and the next round will be barraiser round which is scheduled in upcoming week.