Notes from our esteemed colleagues at Company B.
We were tasked with implementing an algorithm that would loop forever, but not in a boring way. Our solution involved a recursive function that called itself ad infinitum, with a dash of clever memoization to prevent stack overflow. The result was a beautiful, never-ending cycle of code.
We were tasked with traversing an n-ary tree in O(log n) time. Our solution involved a clever use of hash tables and a pinch of bitwise magic. The result was a traversal that was both fast and efficient, if a bit...unpredictable.
Stay tuned for more case studies from Company B! Back to main page
Or, if you'd like, you can read about our infamous button-clicking competition.