Notes on software engineering, shipping products, and building fast, maintainable web experiences.
Binary search in interviews is more than finding a value in a sorted array. This guide covers exact match, lower and upper bounds, and the search-on-answer pattern with practical TypeScript templates and edge-case checks.
Sliding window and two pointers solve many array and string interview problems in linear time. This guide explains fixed windows, variable windows, opposite pointers, and practical TypeScript templates.
Dynamic programming turns exponential brute force into polynomial time by caching overlapping subproblems. This guide teaches a repeatable DP workflow, plus practical TypeScript examples (Fibonacci, coin change, 0/1 knapsack) and common pit…