Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
milkey_mouse
on Jan 3, 2022
|
parent
|
context
|
favorite
| on:
An Algorithm for Passing Programming Interviews (2...
You could use a lookup table to turn the nth letter of the alphabet into the nth prime number, then multiply those primes together. This "hash" would be unique up to reordering of the primes/letters.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: