@Don: You did, of course, see the OP's revision in https://groups.google.com/d/msg/algogeeks/Be3WBebCDCk/_Mb0HUQ93WoJ, did you not? Dave
On Thursday, January 3, 2013 3:08:40 PM UTC-6, Don wrote: > The spec says that the list is infinite, so I don't think that is > possible in finite time. > Don > > On Jan 2, 7:53 pm, Dave <dave_and_da...@juno.com> wrote: > > @Don: HaHa. That's cute, but don't you really think the problem is to > > return any node in the list with equal probability? > > > > Dave > > > > > > > > > > > > > > > > On Wednesday, January 2, 2013 4:48:15 PM UTC-6, Don wrote: > > > Why not just return the first node? That is as random as any other > > > node. > > > Don > > > > > On Dec 27 2012, 5:01 am, naveen shukla > > > <naveenshuklasweetdrea...@gmail.com> wrote: > > > > Given a linked list of infinite length. Write a function to return a > > > random > > > > node. > > > > > > Constraints: > > > > > > 1 You can traverse a singly linked list only once. > > > > 2 You can not use any extra space. > > > > > > Thanks in advance. > --
