
Path with Minimum Effort in TypeScript: Minimise the Worst Step
Solve Path With Minimum Effort in TypeScript using a min heap, a minimax relaxation rule, stale‑entry checks, and an independent threshold‑search reference.
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.

Solve Path With Minimum Effort in TypeScript using a min heap, a minimax relaxation rule, stale‑entry checks, and an independent threshold‑search reference.

How to solve Product of Array Except Self without division, using prefix and suffix products to keep the logic linear and interview‑safe in TypeScript.

nth Node from the End of a ListRemove the nth node from a linked list in TypeScript. Compare the two‑pass and pointer‑gap approaches, their edge cases, types and linear‑time complexity.

Distinguishing two approaches to detect palindrome numbers: the intuitive string method vs. the optimised mathematical technique, highlighting their merits.

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.

Solve Word Break in TypeScript with prefix dynamic programming and memoisation, including greedy failures, reusable words, and honest string‑operation costs.

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.

How to solve LeetCode Coin Change with dynamic programming, and why the obvious greedy approach fails on exactly the cases worth understanding in interviews.

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.