Polynomial hash for sharding
Review this Java polynomial string hash used to shard keys across `n` backends.
What a strong answer looks like
Separate real bugs from style. Rank issues by severity, point at the root cause rather than the symptom, and suggest a concrete fix, specific and kind.
0:00 of about 20 min
Mark a line and say what kind of problem it is.0 findings
1int shard(String key, int n) {
2 int h = 0;
3 for (int i = 0; i < key.length(); i++) {
4 h = h * 31 + key.charAt(i);
5 }
6 return h % n;
7}
Which questions mattered is sealed until you submit. Telling you now would just be handing over the edge cases.
Run or narrate your approach, then ask the coach.