Featured
ExperimentsJun 16, 202611 min
Visual Pathfinding with BFS, Dijkstra, and A*
Compare how BFS, Dijkstra, and A* explore a grid, calculate costs, and rebuild paths using queues, priority queues, and heuristics.
Read articleArticles
Library of articles, guides, and technical notes
ExperimentsJun 16, 202611 minSorting Algorithm Visualizer in Canvas 2D
Design a visual lab to compare Bubble, Merge, Quick, and other sorting algorithms with events, metrics, and efficient Canvas rendering.
FundamentalsJun 16, 20269 minBig O Explained Visually: What Scales, What Breaks, and How to Decide
Understand O(1), O(log n), O(n), O(n log n), O(n²), and O(2ⁿ) as growth patterns for better engineering decisions.
GuidesJun 16, 202610 minMemoization Explained Visually: When Remembering Changes the Curve
Understand how memoization removes repeated states, how to design a stable key, and where memoization ends and general caching begins.
FundamentalsJun 16, 202610 minEssential Data Structures for Understanding Algorithms
Learn to choose arrays, Map, Set, queues, heaps, trees, and graphs by their operations, invariants, and real costs.
FundamentalsJun 16, 202610 minHexagonal Architecture in Modern Web Apps: Domain, Ports, and Adapters
Separate business rules from Next.js, databases, and external services with focused use cases, minimal ports, replaceable adapters, and cheaper tests.
GuidesJun 03, 20268 minSearch, Graph, and Sorting Methods: A Practical Algorithm Guide
A decision hub for choosing between direct lookup, graph traversal, pathfinding, indexing, and sorting according to data shape and query frequency.
GuidesJun 03, 202611 minSearch Algorithms: Collections, Graphs, and Pathfinding with BFS, Dijkstra, and A*
A practical guide for separating collection search from graph search, and choosing between Linear, Binary, Hash Map, BFS, DFS, Dijkstra, and A*.
GuidesJun 03, 202611 minSorting Algorithms: How to Choose Between Bubble, Merge, Quick, Heap, and Radix
A practical guide for comparing sorting methods by stability, memory, complexity, data shape, and real-world tradeoffs before choosing one.
FundamentalsMay 26, 20269 minModular Monolith, Microservices, and Events: How to Combine Them Without Overengineering
Compare deployment boundaries, operational costs, and communication models to evolve from a modular core toward selective services and events.
ExperimentsMay 23, 202610 minReact Three Fiber Without Jank: Measuring and Optimizing WebGL Scenes
A practical guide to measuring the frame budget and optimizing draw calls, React work, DPR, textures, shadows, shaders, and memory in WebGL scenes.