Tag Archives: Amazon

Amazon Interview Experience | Set 320 (Off-Campus)

Recently i attended interview at amazon hyderabad for SDE-1. Written round Two questions Find the unique character from two strings http://stackoverflow.com/questions/29794233/how-to-print-unique-alphabet-from-two-strings-using-java Parenthesis match problem http://www.geeksforgeeks.org/check-for-balanced-parentheses-in-an-expression/ Face to Face Two colors are given(yellow, blue), we have to color such that no consecutive blue color is painted Given the arrival and departure time of various trains in a station.… Read More »

Amazon Interview Experience | Set 318 (For SDE Intern)

The First Round of test was taken online by Amazon on Hackerearth. First Round: 20 MCQs 2 Coding Questions: Find zeroes to be flipped so that number of consecutive 1’s is maximized GFG Link: http://www.geeksforgeeks.org/find-zeroes-to-be-flipped-so-that-number-of-consecutive-1s-is-maximized Find the first circular tour that visits all petrol pump (Similar to this) GFG Link: http://www.geeksforgeeks.org/find-a-tour-that-visits-all-stations 2 Technical Rounds: They… Read More »

Amazon Interview Experience | Set 317 (SDE-1 Off – Campus)

Round 1:  Tell me about yourself.  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/ Print left view of a binary tree. http://www.geeksforgeeks.org/print-left-view-binary-tree/ Discussion : I gave two approaches one with DFS and… Read More »

Amazon Interview Experience | Set 315

Interviewed for Mumbai location. Round 1 (Written round – 45 min) 1. Count the number of occurrences in a sorted array : http://www.geeksforgeeks.org/count-number-of-occurrences-in-a-sorted-array/ 2. In given range, print all numbers having unique digits. e.g. In range 1 to 20 should print all numbers except 11. 3. Given a node, you can even find the next… Read More »

Amazon Interview Experience | Set 313 (For SDE II)

1st Round(Written) – 60 mins It was a test on HackerEarth with two programming questions The Maximum Subarray problem: Given an array A of N elements, find maximum possible sum of a. Contiguous Subarray b. Non Contiguous Subarray Connected Cell in grid problem. Find the number of cells in largest region. 2nd Round (DS and Algo)… Read More »