Category Archives: Experienced

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. http://www.geeksforgeeks.org/check-for-balanced-parentheses-in-an-expression/ 2. http://www.geeksforgeeks.org/largest-rectangle-under-histogram/ 1st Round: 1. http://www.geeksforgeeks.org/sum-of-two-linked-lists/. 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. http://www.geeksforgeeks.org/find-a-peak-in-a-given-array/ Q2) Top View of binary tree. http://www.geeksforgeeks.org/print-nodes-top-view-binary-tree/ Q3) Maximum difference between node and its ancestor in Binary Tree. http://www.geeksforgeeks.org/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 »