## Check if a given array can represent Preorder Traversal of Binary Search Tree

Given an array of numbers, return true if given array can represent preorder traversal of a Binary Search Tree, else return false. Expected time complexity… Read More »

- Amazon Interview Experience SDE ll
- Amazon Interview Experience SDE1
- Amazon Interview Experience SDE (On Campus 2019)
- Amazon Interview Experience SDE 1 (2.5 Years Experienced)
- Amazon Interview Experience SDE Off Campus
- Amazon Interview Experience SDE-1
- Amazon Interview Experience SDE 1
- Amazon Interview Experience (On-Campus for SDE-1) 2019
- Amazon SDE-2 Experience (6.5 Years Exp)
- Amazon internship interview experience (on campus)
- Reach the numbers by making jumps of two given lengths
- Amazon Interview Experience (On campus 2018)
- Amazon interview experience for Experienced
- Amazon Interview Experience (Pool campus-2019)
- Print the last k nodes of the linked list in reverse order | Recursive approach
- Amazon Pune Pool Campus Interview
- Minimum steps to reach any of the boundary edges of a matrix | Set 1
- Amazon SDE 2 Experience (3 Years Experience)
- Amazon Interview Experience (For Internship On-campus)
- Amazon Interview Experience | Software Development Engineer II
- Amazon Interview experience (Off-Campus 2019)
- Minimum steps to reach any of the boundary edges of a matrix | Set-2
- Amazon Interview Experience SDE1
- Amazon Interview experience | Hyderabad (8 months experienced)
- Amazon Interview Experience for SDE2
- Amazon SDE 1 Interview Experience
- Amazon Interview Experience (Pool campus- March 2019) - Pune
- Longest subsequence such that adjacent elements have at least one common digit
- Amazon Interview Experience for SDE2 (3 years exp)
- Amazon Interview Experience (On Campus for SDE-1)

Given an array of numbers, return true if given array can represent preorder traversal of a Binary Search Tree, else return false. Expected time complexity… Read More »

I recently had interviews with Amazon.com, Bangalore. Here’s my interview experienceCoding round (1 hour): 1. Find minimum number of coins that make a given value… Read More »

Given an array, find an element before which all elements are smaller than it, and after which all are greater than it. Return index of… Read More »

Given a matrix where every cell has some number of coins. Count number of ways to reach bottom right from top left with exactly k… Read More »

Given a positive integer n, find if it can be expressed as xy where y > 1 and x > 0. x and y both… Read More »

Given an array that represents a tree in such a way that array indexes are values in tree nodes and array values give the parent… Read More »

A number is called as a Jumping Number if all adjacent digits in it differ by 1. The difference between ‘9’ and ‘0’ is not… Read More »

Interview 1: Before the interview began we were asked to solve 6 questions Write a function to swap a number in place without temporary variables.… Read More »

Given an array of distinct integers, find if there are two pairs (a, b) and (c, d) such that a+b = c+d, and a, b,… Read More »

Given an integer x, find square root of it. If x is not a perfect square, then return floor(√x). Examples : Input: x = 4… Read More »

Given a n*n matrix where all numbers are distinct, find the maximum length path (starting from any cell) such that all cells along the path… Read More »

Given a stack, sort it using recursion. Use of any loop constructs like while, for..etc is not allowed. We can only use the following ADT… Read More »

Given a distance ‘dist, count total number of ways to cover the distance with 1, 2 and 3 steps. Examples : Input: n = 3… Read More »

Given a singly linked list L0 -> L1 -> … -> Ln-1 -> Ln. Rearrange the nodes in the list so that the new formed… Read More »

We had Amazon campus interview in our college offering an internship (performance based job conversion). First round(online coding round) : 20 MCQs. 2 coding questions.… Read More »