Well, that’s day 0, then.
Here’s an interesting puzzle I encountered. I’m working with a dataset with two features of interest: naive datetimes (naive meaning without any timezone in...
I faced some challenges on a recent project, which I solved by implementing the Observer design pattern. Or a version of it, anyway. Here’s how I did it.
Just finished a prototype of this friendly bit manipulator to help others develop better intuition for bits, bytes, and bitwise operations.
Binary search is a simple and efficient (and surprisingly intuitive!) way of searching a sorted array for a certain item that runs in O(log n) time.