Status: 2021 Grad, Tier3/4
Current work: Applications Engineer, Oracle
Position: SDE1 at Amazon
Location: Dublin
Date: Feb 24, 2022

OA -> given in September 2021(don't loose hope. I got interview 5 months after OA)
2 LC medium -> behavioral questions -> SDE simulation

3-> 1 hour interviews(on the same day. 2 interviews without break and 30 mins break before the 3rd interview)
Each interview followed the same pattern:
30 mins -> behavioral/LP questions
30 mins -> code

Interview 1
30 mins -> behavioral/LP questions(about teamwork, how you helped a friend)
30 mins ->

1. given: int[] timestamps and double[] values. For each timestamp we have values given and we want to aggregate(sum) those values to a resolution of 1 minute. Timestamps are given at a resolution of second.(hashmap)
2. in the above question he wanted to give the resolution as a parameter and not hardcode it to 1 minute and also instead of just aggregating he wanted me to calculate its average.(hashmap<Integer, double[]> where double[] holds sum on 1st index and freq on 2nd and at the end we would do double[0]/double[1] to get avg.)
3. can't remember but was a LC easy

Interview 2
30 mins -> behavioral/LP questions(about customer satisfaction, tell me a time where you went out of your way to..., time when you did something without asking your manager)
30 mins -> 1 system design. Question was we would be given some conditions and based on those conditions we had to filter out the files on a file system.
(me being the stupid me and no knowledge of system design i told that you can have statements in a particular format and we can take arg as String[] instructions and then filter files but he said that was unexpected solution(by that he meant unexpectedly stupid). At the end he told me to make an interface for each filter we wanted to apply).

Interview 3
30 mins -> behavioral/LP questions(about diving deep)
30 mins ->

1. isSameTree(Node a, Node b) -> self explanatory I guess
2. find missing number.(arr from 1...N)
3. find a complete 3-node binary tree inside a larger tree
   Discussed on space and time complexity for all.

Will update once here get rejected/accepted.
W̶h̶a̶t̶ ̶I̶ ̶t̶h̶i̶n̶k̶:̶ ̶r̶e̶j̶e̶c̶t̶.̶

Hope it helps!
Do lemme know in the comments if anything needs more clarification.

UPDATE: Offer