# Tag Archives: Amazon

## Amazon Interview Experience | Set 363 (On-Campus for Internship)July 23, 2017

Round 1:online Test(90 min) 20 MCQs -15 Technical(DS,OS,NETWORK,PCD) -5 Aptitude 2 Coding Questions -Finding duplicates in the given array,change that to 1,move all the 1’s… Read More »

## Amazon Interview Experience | Set 362July 18, 2017

1st round( written) They asked to write 3 code in 1 hour. 1. write code to find the diameter of tree.http://www.geeksforgeeks.org/diameter-of-a-binary-tree/ 2.Search an element in… Read More »

## Print middle level of perfect binary tree without finding heightJuly 17, 2017

Given a perfect binary tree, print nodes of middle level without computing its height. A perfect binary tree is a binary tree in which all… Read More »

## Amazon Interview Experience | Set 361July 16, 2017

Round 1 : 1. Given 2 array of size m , n , find the pair from diff array with minimum difference 2. given the… Read More »

## Find the index of first 1 in a sorted array of 0’s and 1’sJuly 13, 2017

Given a sorted array consisting 0’s and 1’s. The problem is to find the index of first ‘1’ in the sorted array. It could be… Read More »

## Count words that appear exactly two times in an array of words

Given an array of n words. Some words are repeated twice, we need count such words. Examples: Input : s[] = {“hate”, “love”, “peace”, “love”,… Read More »

## Queries for counts of array elements with values in given rangeJuly 12, 2017

Given an unsorted array of size n, find no of elements between two elements i and j (both inclusive). Examples: Input : arr = [1… Read More »

## Create a customized data structure which evaluates functions in O(1)

Create a customized data structure such that it has functions :- GetLastElement(); RemoveLastElement(); AddElement() GetMin() All the functions should be of O(1) Question Source :… Read More »

## Amazon Interview Experience | Set 360 (On-Campus)July 11, 2017

Round 1: (Online Test) Time: 1hr 30 mins on HackerEarth Platform 20 MCQ (Gen Apti, OS, TOC, Networks and DS) Coding: 1. Maximum non adjacent… Read More »

## 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 »

## Amazon Interview Experience | Set 358 (Off-Campus)July 8, 2017

Amazon conducted interview in their Bangalore office. There were many candidates lined up for interview. Round 1 1. Create a class which is collection of… Read More »

## Amazon Interview Experience | Set 357 (For 2.5 Years Experienced)

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 »

## Puzzle | Two robot with parachute in a lineJuly 4, 2017

Problem Two robots land with their parachutes on an infinite one-dimensional number line. They both release their parachutes as soon as they land and start… Read More »

## Second most repeated word in a sequenceJune 30, 2017

Given a sequence of strings, the task is to find out the second most repeated (or frequent) string in the given sequence.(Considering no two words… Read More »

## Number of Groups of Sizes Two Or Three Divisible By 3June 29, 2017

You are given N distinct numbers. You are tasked with finding the number of groups of 2 or 3 that can be formed whose sum… Read More »