Notes on software engineering, shipping products, and building fast, maintainable web experiences.
Backtracking problems are controlled brute force. This guide shows a practical choose-explore-unchoose template, plus pruning techniques that cut search space without breaking correctness.
Union-Find (Disjoint Set Union) solves dynamic connectivity in near constant time. This guide covers path compression, union by size, cycle detection, and minimum spanning tree basics.
Many interview graph problems reduce to traversal fundamentals. This guide covers BFS, DFS, topological sorting, and cycle detection with implementation patterns and interview decision rules.
Monotonic data structures convert nested loops into linear scans. Learn monotonic stack and queue patterns for next greater element, largest rectangle, and sliding window maximum.
Heaps solve interview problems where you repeatedly need the smallest or largest element under updates. This article covers min-heap and max-heap patterns, top-k workflows, and streaming use cases.
Greedy interview problems reward clear reasoning, not guesswork. Learn how to detect greedy structure, justify local choices, and implement common patterns like interval scheduling and jump game.