Round 1: Online Coding Test. 2 Coding Questions were asked.
Some Array question was asked easy difficulty.
Find the Maximum Depth of Binary Tree. Maximum Depth is the count of nodes of the longest path from theroot node to the leaf node. (Link)
Round 2: (Technical Interview)
Given the root of a binary tree, display the node values at each level. Node values for all levels should be displayed on separate lines. Let’s take a look at the below binary tree. (Level order traverlsal of binary tree)
Some questions on Priority queue (Insertion/Heapify)
Round 4: (Technical Interview+ Managerial)
What is the difference between multitasking and multiprocessing OS.
There is an integer array nums sorted in ascending order (with distinct values). Given the array nums after the possible rotation and an integer target, return the indexoftargetifit is in nums, or-1 if it is not in nums. We need to search a given element in a rotated sorted array. (Link)
Why Amazon?
Verdict: Selected
Message to Aspiring Students:
The Interview was very smooth as they will help you whenever you are stuck. For practicing DSA I will suggest focusing on Strivers SDE Sheet that will be more than enough, and reading cs fundamentals.