Dev|Journal
Technical blog covering software architecture, backend development, AI, and engineering best practices.
Latest Posts
Page 2 of 4Mastering VS Code for Microservices: Dev Containers, Multi-Project Workflows, and Productivity Hacks
A battle-tested guide to configuring VS Code for microservices development with dev containers, visual workspace differentiation, and multi-language setups. No fluff, just working configs.
Pragmatic Clean Code: The Full Guide to Ownership & Entropy
Stop making excuses and start fighting software entropy. A senior engineer's guide to the Broken Window Theory, negotiating technical debt, and treating your knowledge like an investment portfolio.
Clean Code: The Cult of Dogma and Why Your Abstractions Are Probably Wrong
Robert C. Martin's Clean Code shaped a generation of developers, but its dogmatic rules about tiny functions, obsessive DRY, and terrible example code have caused more harm than good. Here's what the book got right, what it got catastrophically wrong, and what to read instead.
Why We're Migrating from Redis to Valkey (and You Probably Should Too)
Redis killed itself with a license change. Valkey is the open-source fork that's faster, cheaper, and backed by AWS and Google. Here's what actually changed under the hood and how to migrate without downtime.
Product of Array Except Self: Division-Free Array Manipulation
Learn how to compute products of all elements except the current one without using division. Master the prefix-suffix pattern that appears in countless array problems and understand why O(n) with O(1) space is achievable.
Maximum Subarray: Kadane's Algorithm and the Art of Local vs Global Optimization
Discover how Kadane's algorithm finds the maximum sum subarray in O(n) time. Learn why tracking local maximums leads to global solutions, and how this pattern applies far beyond array problems.
Longest Substring Without Repeating Characters: The Sliding Window Technique
Master the sliding window pattern through one of its most elegant applications. Learn how to find the longest substring without repeating characters in O(n) time using a hash set and two pointers.
Best Time to Buy and Sell Stock: Finding Profit in a Single Pass
Learn how to find the maximum profit from a single stock transaction with an elegant O(n) solution. Discover why tracking the minimum price is the key insight that transforms this problem from complex to simple.