Life's journey

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)                                                            ...

Wallmart Labs:  Through the innovative fusion of retail, social and mobile, @WalmartLabs is redefining Commerce for the largest retailer worldwide. We are a group comprised of the brightest technologists and businesspeople in the industry, excited about the limitless opportunities that this next generation of Commerce will bring to billions of people around the globe, all in an effort to help them save money and live better. Date: 01 Sept, 2012 Best experience ever, they have asked so many questions. 1. write a program for finding duplicates from a array in O(n) complexity. 2. write a program for find nearest perfect square of given number. Ex. number is given 13, then nearest perfect squares are 9 and 16. Then answer should be 16 because 16 is nearest to 13. 3. write a program for add two numbers without using mathematical operations. Hint: you can use bit-wise operators, like : XOR, AND and OR. 4. How many types of contract do you use for web services. 5. If i want to a...

UrbanTouch.com serves an essential human need – to look beautiful. We offer only the best and biggest brands so you can remain assured of the quality of every item we sell. We aim to provide you an incredible shopping experience, a wide range of brands and excellent customer service. Interview went good: The only one question they have asked, Q1. write the implementation of String trim function. trim removes the spaces from start and end of string. Program should run in O(n) and it should be optimum.

Ask laila is Indian local search engine. Which is providing solutions for small vendors. 1. Define multiple inheritance in JAVA and how will you achieve. 2. List can contain duplicate values. 3. Write a program which demonstrate multi threading. 4. If i have a inner interface then how will implement the methods of this. 5. Create a abstract class and questions relating to this.

Azul systems is a innovative company, they have developed a optimize JVM called Zing. Which redefined many basic functionalities of JVM, like garbage collection, Heap size, pausing etc. This interview was a formal interview not much questions were asked relating to programming and concepts. Only two questions were asked which are as follows. How garbage collection works in Java. 1. Implement a MyLogger program which will have only once instance at a time but able to use by many threads and it should be thread safe. So that one user’s program can write at time. 2. Declare a singleton class in Java.

Aristocrat is a gaming company based in Australia, this interview was a telephonic interview..I am writing here my experience. 1. How do you use function pointer in C and what's the real world scenario for this. 2. If you have a BST with 1000 nodes then how much iteration you required to have for finding a value in worst case. 3. What would be the height of BST of 1000 nodes. 4. How do you create 2D matrix dynamically in C. 5. What are the differences in Java and C++. 6. How java is platform independent language. 7. What's the use of port in Network Programming.

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...