Life's journey

Interview With Amazon Chennai Interview 1: Coding Problem: Q1. Write down a program which will sort the values at the level in a Binary Tree. 4 5 7 4 3 2 8 output would be 2 3 4 4 5 7 8 Interview 2: Data Structure & Algorithms: Q1: Create a class which will perform following operations in O(1) time. Insert Delete Search Get Random Q2. Write a function which will full fill the following problem. There is a party in that n number of people has been invited now, these people has 1 gifts with them, which they have to give to other guys (Among each other), now then you have to write a program which will give the gifts to another one. Ex. N people A B C D E A -> B B -> C C -> E D -> A E -> D Interview 3: Design Problem: Q1. Create Architecture and Choose data structure for following problem of statement. Problem: ...

Interview with Amazon, Hyderabad First Round Online Test on Interview Street  1. Write a program for finding lexicographic sequence in a given list. 2. Write a program for converting a Binary search tree into a Doubly Link list. 3. Write a program for finding Nth Largest in a BST. 4. Write a program for transforming its row and column into 90 degree. Second Round: 1. Write a program for finding overlapping pattern of two digits and change them to the 1 8. Example: Input: 1 2 3 4 1 2 6 6 7 8  Output: 1 8 3 4 1 8 1 8 7 8

No need to explain about Amazon………. They have asked three questions and I have failed that time to answer them correctly. Q1.  Write a program for finding maximum sum path from a Tree from leaf to Root from Binary Tree (Not a BST). Ex.                                                                   (10)                                                            ...

Interview with Amazon It was awesome experience on 11th August, I never expected to reach till last but i could make it. But i have missed the job :-( Lets see my next attempt will give me this opportunity. Here i am sharing my written Test Exam: Q1. Here two lists are given. list1 = 2 > 4 > 5 > 6 > NULL: list2 = 5 > 6 > 7 > NULL; list3 =     3 > 0 > 2 > 3 > NULL; This is called summation of link lists. Constraint: Link list data node can contain only one digit. Write: Input and Output data by dry running your program. Q2. You have to find out maximum number by rearranging the digits of number. Example: 2789 Output: 9872 Complexity: O(n) Q3. Write a program for finding depth of BST (Binary Search Tree). Write by Iterative and Recursion. Q4. (a) Find output of program int mingle(int a, int b) {     int c;     c  = b /2; if (b<=2) cout< return a*2(b/2) + mingle(a,c); } int mai...