1st 1. reverse the linklist in pair manner Q: 1->2->3->4->5 A: 2->1->4->3->5 2. third highest value in tree Full code required. 2nd put the given random pointers in linklist to point to next greater node such that if u transverse list in using random pointer, list become sorted. duplicates are allowed. Full code required 3rd… Read More »
Amazon Off Campus Interview Experience(SDE-1, Experienced) Round 1: 1) Tell me about yourself. 2) Trapping Rain Water : Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. http://www.geeksforgeeks.org/trapping-rain-water/ 3) Print left view of a binary tree. http://www.geeksforgeeks.org/print-left-view-binary-tree/… Read More »
I was recently interviewed for the position of SDE-1 at Amazon. It was a 3 round process: Round 1: On paper coding: Given a binary tree print it in vertical order. The problem is stated here: http://www.geeksforgeeks.org/print-binary-tree-vertical-order/ Given a linked list convert it into given format: 1->2->3->4->5->6 to 1->6->2->5->3->4 Round 2: It was an in-person… Read More »
Online round (1 hour 30 min) 20 MCQs + 2 coding questions- 1) You have given two stings.You have to write function to check weather any anagram of second string is substring of first string or not. 2) You have given one mathematical expression containing +,-,*,/ in form of string which is space separated (”… Read More »
Each of the rounds were of more than 1 hour and they mainly focused on logical thinking and approach. DS and algorithms were the topics asked.
Amazon written round – Time 1 hour. 1. Given an array of 0s and 1s, find the position of 0 to be replaced with 1 to get longest continuous sequence of 1s.
It was a usual interview process by Amazon: 1 written test, 1 telephonic interview and 4 f2f interviews.
Hi my name is Anandhakumar. P. I am a 2012 pass out from college of engineering guindy. I recently underwent offcampus interview with Amazon, Chennai, India for the post of SDE. I love geeksforgeeks and