These tricks are cool on their own, but they're really neat when you tie them together to solve larger (but still toy) puzzles. Two fun ones I can remember: ht

These tricks are cool on their own, but they're really neat when you tie them together to solve larger (but still toy) puzzles. Two fun ones I can remember: https://www.reddit.com/r/programming/comments/4vctor/.../d5xl6vl/ https://www.reddit.com/r/programming/comments/4vctor/.../d5x... https://cs.stackexchange.com/a/74888/16408 https://cs.stackexchange.com/a/74888/16408 The first asked > Extra-extra credit can be earned for finding an algorithm that takes no more than O(log N) space and no more than O(log N) time, where N is the number you are seeking for. and the bit magic made it O(1) space and time. The second was on similar lines. Unfortunately the bit fiddling at my day job tends to be a bit tamer ;).