congrats :) :) On Fri, Dec 2, 2011 at 8:39 PM, VIHARRI <viharri....@gmail.com> wrote:
> Hi, > I got selected in Microsoft yesterday. Thanks to all the geeks and > the group, especially to managers!!! My concept regarding the logic > for Algorithms and how the tackle a new problem have been improved > after seeing many post and solutions from different people, so that > credit goes to this group. > > Thank You. > P L V VIHARRI. > > > > Most of the Question asked were the same as that of previous years. > > 1. Adding two linked List of numbers. > 2. Finding 2nd maximum of a binary tree. > 3. Finding median of two sorted arrays. > 4. Printing last K lines of a large file. > 5. Given an array of numbers positive and negative, find all subsets > whose sum is equal to given number. > 6. Aeroplane puzzle, where we have 100 persons and have to find the > probability of second person sitting in his seat. > 7. We have an object with the characteristic of color in an array. Now > we need to sort them based on the color ( we have blue and red ). > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
