Safer Integer Input in C with `fgets()` and `strtol()`
Build a reliable line-based integer parser that rejects partial conversions, overflow, and input left behind in the stream.
CInput validation
FIELD NOTES
Blog
Notes on things I’m exploring, building, and learning. Writing helps me work through ideas and share what I discover.
All posts 17
C Pointers and Dynamic Arrays Through a Ferry Booking System
Use the ferry project's RouteList to see how C pointers, realloc, ownership, and structure swaps form a growable array.
CMemory management
Using Pub-Sub to Separate Game Logic from the UI
Trace a real Battleship event through a Map-backed pub-sub bus from attack logic to board rendering.
JavaScriptArchitecture
Implementing FIFO Inventory Costing with C and SQLite
Follow one stock issue as a C program consumes SQLite inventory batches in insertion order and records the cost allocation.
CSQLiteAlgorithms
SQLite Is a Library, Not a Database Server
Follow a C inventory program from compiling SQLite into the executable to opening, querying, and safely closing its local database file.
CSQLite
BST Predecessor vs Successor: Two Valid Ways to Replace a Deleted Node
Compare inorder predecessor and successor replacement strategies while following the Binary-Search-Tree repository's successor-based deletion.
JavaScriptData Structures
Deleting a Node from a Binary Search Tree: The Three Cases
A repository-backed walkthrough of leaf, one-child, and two-child BST deletion with recursive subtree-root updates.
JavaScriptData Structures
Detecting an Unbalanced Binary Tree with a Height Sentinel
Explain the Binary-Search-Tree repository’s one-pass balance check and its -1 sentinel for failed subtrees.
JavaScriptData Structures
Building a Balanced Binary Search Tree from a Sorted Array
Follow the Binary-Search-Tree repository’s midpoint construction from sorted unique values to a balanced initial tree.
JavaScriptData Structures
Binary Trees and Binary Search Trees: The Invariant That Makes Search Work
A repository-backed introduction to binary-tree shape, the BST ordering invariant, search paths, and traversal orders.
JavaScriptData Structures
The Node.js Event Loop: Call Stack, Queues, and Microtasks
Predict Node.js execution order by separating synchronous stack work, next ticks, microtasks, timers, polling, and immediates.
JavaScriptNode.js
Understanding Merge Sort by Following the Recursion
Follow merge sort from its recursive splits to the comparisons that rebuild one sorted array.
JavaScriptAlgorithms
How a Hash Map Turns Keys into Buckets—and What Happens When Keys Collide
A repository-backed explanation of hashing, separate chaining, resizing, and the limits of constant-time map operations.
JavaScriptData Structures
Building a Linked List in JavaScript to Understand References
A repository-backed walkthrough of nodes, traversal, head and tail invariants, insertion, removal, and reference updates.
JavaScriptData Structures
Regular Functions, Arrow Functions, and the Meaning of this
A call-site mental model for understanding how regular and arrow functions receive their value of this.
JavaScript
JavaScript Prototypes: How Property Lookup Actually Works
A practical mental model for prototype links, inherited properties, constructor prototypes, and JavaScript classes.
JavaScript
Big O Without the Hand-Waving: Reasoning About Growing Inputs
A practical guide to describing how algorithm costs grow without confusing asymptotic bounds with measured runtime.
AlgorithmsData Structures