Home/ Questions/Q 4549030
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-21T16:18:09+00:00

I have a single direction linked list without knowing its size. I want to

  • 0

I have a single direction linked list without knowing its size.

I want to get a random element in this list, and I just have one time chance to traverse the list. (I am not allowed to traverse twice or more)

What’s the algorithm for this problem? Thanks!

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    This is just reservoir sampling with a reservoir of size 1.

    Essentially it is really simple

    1. Pick the first element regardless (for a list of length 1, the first element is always the sample).
    2. For every other element with probability 1/n where n is the number of elements observed so far, you replace the already picked element with the current element you are on.

    This is uniformly sampled, since the probability of picking any element at the end of the day is 1/n (exercise to the reader).

    • 0