
Time Based Key‑Value Store in TypeScript: Find the Latest Eligible Version
Build a Time Based Key‑Value Store in TypeScript with append‑only histories and upper‑bound search, covering missing keys, time gaps, and ordering assumptions.
Articles
LeetCode is a useful prompt for practising algorithmic judgement, but a finished answer is not much use without the route to it. My walkthroughs concentrate on recognising the pattern, rejecting the tempting brute‑force approach, and explaining the solution in JavaScript or TypeScript.

Build a Time Based Key‑Value Store in TypeScript with append‑only histories and upper‑bound search, covering missing keys, time gaps, and ordering assumptions.

Find the median of two sorted arrays in TypeScript, comparing a sorting baseline with binary partition, worked cuts, edge cases, and logarithmic complexity.

Decode nested strings in TypeScript using explicit stack frames, multi‑digit repeat counts, worked examples, and careful accounting for expanded output costs.

Solve Simplify Path in TypeScript with a component stack, careful handling of dots and root, and the distinction between path text and filesystem resolution.

Implement Insert Delete GetRandom in TypeScript using a dense array and index map, with swap removal, equal sampling chances, and deterministic tests.

Validate mixed parentheses and brackets in TypeScript with a stack, check nesting order, and see why separate counters and two pointers are not enough.

Sort an array in TypeScript with stable merge sort, then compare an in‑place heapsort implementation, including space costs, duplicate values, and useful tests.

An exploration of solutions to the 'Letter Combinations of Phone Number' problem using front‑end and TypeScript: recursion, backtracking, and iteration.

Convert Roman numerals to integers in JavaScript, covering subtractive notation, invalid input caveats, and a clear TypeScript implementation.

Convert integers to Roman numerals in JavaScript, covering symbol rules, greedy matching, edge cases, and a clear TypeScript implementation.

Solve regular expression matching with recursive and dynamic‑programming context, covering dot and star behaviour, edge cases and TypeScript.

Build a TypeScript HashMap with separate chaining, deliberate collision tests, and an honest comparison with direct addressing and JavaScript's built‑in Map.

Solve Container With Most Water in TypeScript using the two‑pointer pattern, with pointer movement, complexity, edge cases, and testable logic explained.

Explore the 'Longest Palindromic Substring' problem: its relevance in web development and four JavaScript (ES6 & TypeScript) solutions for efficiency.

Solve Combination Sum IV in TypeScript by counting final choices, with exact arithmetic, loop‑order counterexamples, and the limits of negative inputs.

Master the 4Sum problem in JavaScript: Explore the two‑pointer technique, solve with ES6/TypeScript, and test using Cypress. Elevate your coding skills.

Solve 3Sum Closest in JavaScript with sorting and two pointers, reducing brute‑force work whilst finding the nearest total efficiently in TypeScript.

Solve LeetCode Add Two Numbers in TypeScript with linked‑list traversal, carry handling, edge cases, and a clear implementation you can test and extend.