#softwareengineering

1d ago · 5 min read · TL;DR: When I'm building high-traffic chat systems, a standard list lookup for profanity is too slow because search time grows with the size of the dictionary. I use a Trie (prefix tree) to move to O(

Join discussion

DSDoogal Simpsondoogal.dev

0

Why Your Linked List Wants to Be a Bloody Tree

1d ago · 5 min read · Quick Answer: A linked list hits a wall when searching because it’s stuck in linear O(n) time. By giving every node two pointers instead of one, you create a Binary Search Tree (BST). This wacky struc

Join discussion

ALAgentic Leadssocial-agents.hashnode.dev

0

How AI Is Reshaping the Role of Technical Architects in 2026

2d ago · 2 min read · The Evolving Landscape of Technical Architecture Artificial intelligence is no longer a buzzword reserved for data scientists. In 2026, AI has become a foundational layer in how modern systems are designed, scaled, and maintained. For Technical Archi...

Join discussion

DSDoogal Simpsondoogal.dev

0

32-Element Branching: How Scala Vectors Solve Immutable Memory Pressure

3d ago · 5 min read · TL;DR: Traditional immutable arrays are slow because updating an element requires a full O(n) copy. Scala’s Vector solves this by using a 32-way branching trie. This enables structural sharing, allowi

Join discussion

DSDoogal Simpsondoogal.dev

0

Your Undo Button is Just a Stack of Pancakes

5d ago · 5 min read · TL;DR: I implement undo functionality using a Stack data structure because it follows the Last-In-First-Out (LIFO) principle. Each state change is pushed onto the stack. When I trigger an undo, I pop

Join discussion

DSDoogal Simpsondoogal.dev

0

Why Dynamic Arrays Aren't Actually Dynamic

Mar 7 · 5 min read · TL;DR: Standard arrays are fixed-size by design to ensure O(1) access. Dynamic arrays manage this constraint by over-allocating memory and periodically resizing. By growing the backing array geometric

Join discussion

DSDoogal Simpsondoogal.dev

0

The Pointer Arithmetic of Constant Time: Why Arrays Scale O(1)

Mar 5 · 5 min read · TL;DR: Array indexing is O(1) because it relies on a single pointer calculation: base_address + (index * element_size). Since arrays use contiguous memory allocation, the CPU uses the base register an

Join discussion

DSDoogal Simpsondoogal.dev

0

Why Doing Nothing is Mathematically Your Fastest Debugging Tool

Mar 3 · 5 min read · Sometimes the solution to the hardest problem you're working on is found by just going and having a shower. It's mathematically the fastest way to debug because it shifts your brain from focus mode in

Join discussion

DSDoogal Simpsondoogal.dev

0

Why Your Backup Strategy Might Be a $100 Million Gamble

Mar 2 · 5 min read · I look at the Pixar disaster as a warning for every lead dev. If you aren't testing restoration weekly and leveraging decentralized version control, you're one 'rm -rf' away from a business-ending cat

Join discussion

DSDoogal Simpsondoogal.dev

0

Your First Management Role Is a Career Reset, Not a Promotion

Feb 28 · 5 min read · Transitioning from an individual contributor to a manager isn't a simple level-up; it's a total career pivot. You are starting from zero in a new discipline that requires active study of a 'human tech

Join discussion

Tag feed

#softwareengineering

Tag feed

#softwareengineering

Scaling Profanity Filters: Why I Use Tries for Real-Time Chat

Why Your Linked List Wants to Be a Bloody Tree

How AI Is Reshaping the Role of Technical Architects in 2026

32-Element Branching: How Scala Vectors Solve Immutable Memory Pressure

Your Undo Button is Just a Stack of Pancakes

Why Dynamic Arrays Aren't Actually Dynamic

The Pointer Arithmetic of Constant Time: Why Arrays Scale O(1)

Why Doing Nothing is Mathematically Your Fastest Debugging Tool

Why Your Backup Strategy Might Be a $100 Million Gamble

Your First Management Role Is a Career Reset, Not a Promotion

#softwareengineering

Search Hashnode

#softwareengineering

Scaling Profanity Filters: Why I Use Tries for Real-Time Chat

Why Your Linked List Wants to Be a Bloody Tree

How AI Is Reshaping the Role of Technical Architects in 2026

32-Element Branching: How Scala Vectors Solve Immutable Memory Pressure

Your Undo Button is Just a Stack of Pancakes

Why Dynamic Arrays Aren't Actually Dynamic

The Pointer Arithmetic of Constant Time: Why Arrays Scale O(1)

Why Doing Nothing is Mathematically Your Fastest Debugging Tool

Why Your Backup Strategy Might Be a $100 Million Gamble

Your First Management Role Is a Career Reset, Not a Promotion