Mar 11 · 2 min read · Recently, I started contributing to open source projects. During this process, I encountered a few small but important learning moments that might help other beginners who are starting their open-sour
Join discussionFeb 17 · 6 min read · How I learned to organize Go applications for clarity, scalability, and long-term maintainability. Project structure in Go is intentionally minimalistic. The language does not enforce a framework or architectural pattern. This flexibility is powerfu...
Join discussionFeb 1 · 4 min read · First question: what if data was sent without any rules? 🤔 Imagine you’re sending a long message to your friend using many small chits of paper. But: some chits get lost some arrive late some arrive in wrong order some arrive twice Your friend...
Join discussion
Jan 31 · 3 min read · What HTML is and why we use it Before learning HTML, let’s understand what a webpage actually is. When you open any website, what you see on the screen (text, buttons, headings, images) needs some basic structure.That structure is made using HTML. HT...
Join discussion
Jan 29 · 5 min read · What if you could rewind any game and see exactly why you won or lost? What if you could measure a player's effort with perfect accuracy? This isn't science fiction—it's what happens when teams use professional sports data tagging services. This arti...
Join discussion
Jan 28 · 5 min read · We have seen what happens when we search for a domain in the browser, the whole DNS Resolution stuff and how we go from DNS catching to Authorative Sever in the networking series of this blog. Now, lets understand what happens after the browser has s...
Join discussion
Jan 6 · 3 min read · The Pivot No One Saw Coming For the last three years, the narrative has been simple: ChatGPT vs. Google. Search is dead. Long live the chatbot. But while everyone was watching Google panic, Sam Altman was looking at a different target. In a recent in...
Join discussion
Jan 2 · 3 min read · LeetCode 961: N-Repeated Element in Size 2N Array is usually solved with a simple Hash Set (O(N) space) or randomized checks. But recently, I challenged myself to solve it deterministically using O(1) space. The result? A modified version of Moore’s ...
Join discussion
