428
zacg
7y

What’s the most efficient algorithm to find duplicates in a set?

An SO moderator

Comments
  • 17
    Bitch, the door...(πŸ˜‚πŸ˜‚πŸ˜‚πŸ˜‚)
  • 15
    Lol πŸ˜‚ this is the best joke so far πŸ˜‚πŸ˜‚
  • 15
    Took a while, but once I got it the giggles were real πŸ˜‚πŸ˜‚
  • 4
    Ahahahaha
  • 3
    πŸ‘πŸ‘
  • 52
    I once saw the same moderator comment that Question A was a duplicate of B, and Question B was a duplicate of A!
  • 3
    πŸ˜‚πŸ˜‚πŸ˜‚πŸ˜‚πŸ˜‚πŸ˜‚πŸ˜‚πŸ˜‚
    True story
  • 8
    What if I wrote a program that will take data from an array and generate stackoverflow questions and post them and check if any have been marked as duplicates.
  • 2
    This perfectly explains why SO is shit
  • 7
    Elements of a set are by definition distinct. Therefore there cannot be duplicates.
  • 4
    @3141 I’m sure they’d still find some
  • 3
    @3141 tell that to an SO moderator
  • 2
    I'd say it's the fastest bit not most efficient way.

    Way too much false positives ;)
  • 0
    @devaalok that makes sense. informing participants in both questions that the question has been duplicated, and advising them to all use a single thread.
  • 0
    A stackoverflow moderator.
Add Comment