## Amazon Interview Experience | Set 359 (On-Campus)

20 MCQs mixed with simple Quants, logical, other Technical CS concepts (TOC, DS, DBMS, NETWORKS) 2 Programming questions (I solved both) Maximum Non-Adjacent Subsequence Use… Read More »

- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Kth smallest element in a subarray
- Introduction to Data Structures | 10 most commonly used Data Structures
- Iterative Postorder traversal | Set 3
- Total number of possible Binary Search Trees using Catalan Number
- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- Adobe Interview Experience ( 3 Years Exp )
- Find the node with maximum value in a Binary Search Tree using recursion
- Burn the binary tree starting from the target node
- K-th ancestor of a node in Binary Tree | Set 3
- Calculate height of Binary Tree using Inorder and Level Order Traversal
- Pair with a given sum in BST | Set 2
- Check which player visits more number of Nodes
- Find the node with minimum value in a Binary Search Tree using recursion
- Construct BST from its given level order traversal | Set-2
- Minimum steps to color the tree with given colors
- Number of pairs with a given sum in a Binary Search Tree
- Print Bottom-Right View of a Binary Tree
- Sum of the distances from every node to all other nodes is maximum
- Queries for number of distinct elements in a subarray | Set 2
- Print Binary Search Tree in Min Max Fashion
- Find the largest Complete Subtree in a given Binary Tree
- Count all k-sum paths in a Binary Tree
- Reverse tree path using Queue
- Cartesian tree from inorder traversal | Segment Tree
- Find maximum and minimum element in binary tree without using recursion or stack or queue
- Insertion in n-ary tree in given order and Level order traversal
- Generic Trees(N-array Trees)
- Longest subsequence with first and last element greater than all other elements
- Queries to update a given index and find gcd in range

20 MCQs mixed with simple Quants, logical, other Technical CS concepts (TOC, DS, DBMS, NETWORKS) 2 Programming questions (I solved both) Maximum Non-Adjacent Subsequence Use… Read More »

Given a rooted tree with N vertices and N-1 edges. We will be given many pairs of vertices u and v, we need to tell… Read More »

Consider a binary tree in which each node has two children except the leaf nodes. If a node is labeled as ‘v’ then its right… Read More »

Some time back I went through an interview for Amazon.com for SDE-1 role, and here is my experience to help other aspirants : Written –… Read More »

Given a binary tree containing n nodes. The problem is to replace each node in the binary tree with the sum of its inorder predecessor… Read More »

Round 1: Hackerearth online coding round. Round 2: (1 hrs 15 minutes) Left View of a binary tree Explain Binary search and it’s complexity. How… Read More »

Round 1(Telephonic) Dynamic memory allocation for 2d array How polymorphism works in C++(Vptr and Vtable implementation) Rope burning puzzle (Measure 45 mins) Round 2(Skype) Find… Read More »

We have a binary search tree and a number N. Our task is to find the greatest number in the binary search tree that is… Read More »

Given a binary tree and two nodes, the task is to Print all the nodes that are common for 2 given nodes in a binary… Read More »

Round I 1.Implement expiry cache system : every page in cache have id and expiry time (TTL of few seconds). After page expires it behaves… Read More »

Given an array of N element. The task is to check if it is Inorder traversal of any Binary Search Tree or not. Print “Yes”… Read More »

Given two binary trees. We need to merge them into a new binary tree. The merge rule is that if two nodes overlap, then sum… Read More »

Given a binary tree with distinct nodes(no two nodes have the same have data values). The problem is to print the path common to the… Read More »

Given a Binary tree, the problem is to find the mirror of a given node. The mirror of a node is a node which exists… Read More »

Given a binary tree with distinct nodes(no two nodes have the same have data values). The problem is to print the path from root to… Read More »