Two Sum — LeetCode #1 (Easy)TL;DR Single-pass hash map lookup: store each number's index as you go, check for the complement before storing. O(n) time, O(n) space. The Problem Given an array of integers nums and an integer targeMay 17 · 3 min readblog.logixy.dev
The Evolution of DevOps: From Scripts to Platform EngineeringThe Evolution of DevOps Ten years ago, "DevOps" meant a developer who knew how to restart Apache on a Linux server. Today, it has evolved into a sophisticated discipline centered around Platform Engineering. The goal is no longer just "automating scr...Jan 24 · 2 min readdesigndoc.hashnode.dev
Arrays: The OG Data Structure (and Why They Still Matter)This DSA series is my learning-in-public journey.I’m not pretending to be a 10x engineer — I’m learning concepts properly and writing them down so future-me (and you) don’t suffer again. What Is an Array? (No Fancy Words Yet) An array is just a col...Jan 24 · 4 min readdesigndoc.hashnode.dev
How to Choose a DatabaseHow to Choose a Database Choosing the right database is one of the most critical decisions in system design. It dictates your data models, scalability, consistency guarantees, and mostly, the complexity of your application code. The Core Decision Fra...Jan 24 · 5 min readdesigndoc.hashnode.dev
The Ultimate Guide to Engineering Design DocsThe Ultimate Guide to Engineering Design Docs The most expensive mistake in software engineering is writing weeks of code for the wrong solution. The strict discipline of writing a Design Document (also known as an RFC - "Request for Comments") is th...Jan 24 · 3 min readdesigndoc.hashnode.dev
