← All problemsSign in

To load or not to load

Problem description. Due to rapid expansion, Grofers wants to build a large distributed storage system on the web. Millions of users will store terabytes of data on its servers. One way to design such a large system would be to hash each user’s login id, partition the hash ranges into equal sized buckets, and store the data for each bucket of users on a single server For this scheme, mapping a

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start