Easy
Modulo sharding vs. consistent hashing when a node is added
A cache tier of 10 nodes places each key on node hash(key) mod N, with hash outputs uniformly distributed. Operators add an 11th node, so N goes from 10 to 11. The alternative design is a consistent-hashing ring: every node is hashed to many points (virtual nodes) on a circular hash space, and a key belongs to the first node point clockwise from hash(key). Roughly what fraction of all keys change owner when the 11th node joins under each scheme?
31 of 46 in Data Structures & Algorithms