Competitive programming often reduces algorithmic efficiency to Big O notation. While theoretically sound, Big O ignores the constants, interpreter overhead, and memory allocation patterns inherent in actual execution. A solution might be O(N) on paper but fail runtime constraints due to Python’s specific implementation details. I developed Occam to bridge the gap between theoretical complexity and hardware reality. The goal was to build a local profiling tool capable of analyzing solution behavior under stress before submission to platforms like LeetCode. ...
Building a Simple & Secure Blog
The objective for c2thulhu.sh was to establish a publishing platform with a minimal attack surface. Traditional Content Management Systems (CMS) often introduce unnecessary complexity, maintenance overhead, and a broad landscape of potential vulnerabilities. To mitigate these risks, I implemented a “Secure-by-Design” architecture that prioritizes static content delivery, strict transport security, and minimized server-side dependencies. This post details the transition from a local Emacs workflow to a hardened, Go-based production environment. ...