Category Archives: Experienced

Amazon Interview Experience | Set 262 (For SDE1)

I am 1.5 year experienced guy, currently working in one good Product Based company in Whitefield,Bangalore. I have spent 1.2 years in my present company and previously, I spent 6 months in TCS Pune. Recently, I got a chance to be interviewed by Amazon at Bangalore, through a referral (made friend from Facebook :p). I… Read More »

Adobe Interview Experience | Set 37 (3.5 Years Experienced)

Online Written Test 20 MCQ + 5 Coding Questions F2F 1 1. There are two sorted arrays . Find the median of array obtained by Merging these two arrays. 2. Find Transpose of a Matrix. 3. Tell me about Garbage Collection . I told him about GC process and different types of GCs available.… Read More »

Amazon Interview Experience | 262

1. Given infinite sequence of number, how you will store it in a system. Find whether the given sequence is palindrome or not. Ans: He suggested to store all the number in a linked list and then find Palindrome or not 2. A) Find the path with given sum in a Binary tree from the… Read More »

Amazon Interview Experience | Set 261 (For SDE1)

I had around 1 year and 9 months of experience. Telephonic Interview : It started with a brief introduction of mine and my work. Then he asked me a coding question 1) Given a linked list eg : 1->2->3->4->5->6, make the following changes 1->6->2->5->3->4 Easy but it was lengthy. Had to write production level code.… Read More »

Amazon Interview Experience | Set 260 (For SDE2)

Online Coding Round: 1. 2. 1st Round: 1. I gave recursion solution code. Then asked for optimized one. 2nd Round: 1. Detail overview of current project. roles and responsibilities. 2. Implementation of Queue but with certain kind of constraints. Basically looking for knowledge of design patterns. 3rd Round: 1. Again went through… Read More »

Amazon Interview Experience | Set 259 (1 Yr Experienced for SDE1)

Round 1: It was a written round with three question. Q1) Find a peak element. Q2) Top View of binary tree. Q3) Maximum difference between node and its ancestor in Binary Tree. Round 2 (F2F): Q1) Given an array of distinct integers, find if there are two pairs (a, b) and (c,… Read More »