0
Modular Chain Compression
code-challenge optimization
A common trope in some compression challenges is to use repeated application of the modulo operator in order to compress large integers or string hashes into some range. For example, we can squash the numbers \$13,4,16\$ into \$0,1,2\$ by taki...