Re: [algogeeks] Re: Google Interview Question-Snake and Ladder Design

2010-09-17 Thread Anil Kumar S. R.
@bittu, we are here to discuss the way to solve it. Posting a code here will not do anything good. Anil Kumar S. R. http://sranil.googlepages.com/ "The best way to succeed in this world is to act on the advice you give to others." On 14 September 2010 13:33, bittu wrote: > #include > #include

Re: [algogeeks] Re: Google Interview Question-Snake and Ladder Design

2010-09-14 Thread siddharth srivastava
Hi On 14 September 2010 13:33, bittu wrote: > #include > #include > #include > #include > ///O(N^2) solution Does solution exits > in O(n) or (nlogn)..? reply me sum1 git dis.. > //i will post analysis of dsi program later > int turn, square; > long game, totalg