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.

Read More »We recommend to read following post as a prerequisite of this post. K’th Smallest/Largest Element in Unsorted Array | Set 1

Read More »Online Round 1. Convert Binary tree to linked list. 2. Rotate a matrix by 90 degree.

Read More »Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the given array.

Read More »## Time complexity of insertion sort when there are O(n) inversions?

Leave a comment | Filed under ArraysWhat is an inversion? Given an array arr[], a pair arr[i] and arr[j] forms an inversion if arr[i] < arr[j] and i > j.

Read More »## Amazon Interview Experience | Set 150 (SDE1 for 1 Year Experienced)

Leave a comment | Filed under Interview ExperiencesTelephonic: 1. http://www.geeksforgeeks.org/write-c-code-to-determine-if-two-trees-are-identical/ 2. http://www.geeksforgeeks.org/convert-a-given-tree-to-sum-tree/

Read More »Given two sets represented by two arrays, how to check if the given two sets are disjoint or not? It may be assumed that the given arrays have no duplicates.

Read More »## Amazon Interview Experience | Set 149 (On-Campus for Internship)

Leave a comment | Filed under Interview ExperiencesRound 1 (Online): It had 20 MCQs and 2 coding questions for 90 minutes. Questions were from Operating Systems, Data structures, Aptitude etc. Most of them were exactly same as on www.geeksquiz.com.

Read More »Round 1: 1. Incoming stream of characters () defines an onion of depth 1, (()) of 2. Find all onions with their in an incoming stream of characters. Discuss complexity.

Read More »Written round: 1- Given a sorted array.Make a balanced binary tree from this array.

Read More »## Jabong Interview Experience for Software Development Engineer

Leave a comment | Filed under Interview ExperiencesJabong recently visited our campus. About 70 students gave the written test. Here’s my interview experience.

Read More »I recently got selected in Make my trip . Here is my interview experience.

Read More »Given an array of jobs where every job has a deadline and associated profit if the job is finished before the deadline.

Read More »Given two strings X and Y, find the Longest Common Substring of X and Y. Naive [O(N*M2)] and Dynamic Programming [O(N*M)] approaches are already discussed here. In this article, we will discuss a linear time approach to find LCS using suffix tree (The 5th Suffix Tree Application). Here we will build generalized suffix tree for […]

Read More »