1. Deserialize & Serialize Binary Tree 2. Find the bst with maximum sum inside a binary tree 3. Find the largest rectangle with all 1s in a binary matrix. 4. Find the kth largest number in the stream. 5. Find the number that occurs once when all the other numbers repeat 3 times.
1. Snake and ladder problem (Dynamic Programming) 2. greatest element to the right (Stack) and some behavioral questions.
1.why do you wanna do amazon?
DFS question from leetcode
find whether a tree is subtree or not
LC 587, Remove boxes, no follow up
One question was based on Binary Search Trees and Other was on Dynamic Programming
1. Implement Stack/Queue from Scratch retaining min values at all times 2. Some array algorithm question 3. Some algorithm questions based on hashing
A lot of reasonings and variations(like, why BFS, can we do with DFS, if no then why?, its time and space complexity, can we do by using only O(1) memory to keep track of distance, etc ).
Minimum time for a tree to burn starting fire from the leaf node.
Viewing 3051 - 3060 interview questions