Slacker News Slacker News logo featuring a lazy sloth with a folded newspaper hat
  • top
  • new
  • show
  • ask
  • jobs
Library

Comment by yesbabyyes

8 days ago

I guess calculating the Levenshtein distance between the sets would work somehow?

Edit: scratch that, just intersect the set of available pieces with each set. If there are fewer than n--or m%--missing pieces, suggest those.

0 comments

yesbabyyes

Reply

No comments yet

Contribute on Hacker News ↗

Slacker News

Product

  • API Reference
  • Hacker News RSS
  • Source on GitHub

Community

  • Support Ukraine
  • Equal Justice Initiative
  • GiveWell Charities