will u pls provide the answer for 2nd question....finding the closest pair of points...
On Sun, Sep 11, 2011 at 4:48 AM, KK <[email protected]> wrote: > MS visited out col with 2 profiles... > written test: > 3 different papers: > 1 one all objectives > 2nd 2 subjective problems... 1 ws to find the closest pair of > points... and other was to find the bugs and provide the test cases > for the already provided string copying code... > > then it was followed by 4 coding PI..... > I dont remember all the Qs but few of them are... > > LCA > generating mnemonics of a phone keypad > a DFS or BFS ques > removing all the repeated character of string in O(1) space given all > would be [A-Z a-z] > given an ip address store it const space... i stored it in integer and > he was satisfied... > Inorder Successor > > the above Qs were for intern... although they followed the same > process for final year people... > Finally I made it through :)) > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- **Please do not print this e-mail until urgent requirement. Go Green!! Save Papers <=> Save Trees *BharatKumar Bagana* **http://www.google.com/profiles/bagana.bharatkumar<http://www.google.com/profiles/bagana.bharatkumar> * Mobile +91 8056127652* <[email protected]> -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
