LeetCode: Converting Integers to Roman Numerals
Convert integers to Roman numerals in JavaScript, covering symbol rules, greedy matching, edge cases, and a clear TypeScript implementation.
Articles
LeetCode, page 3 of 3
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.
LeetCode: Converting Integers to Roman Numerals. 
Understanding and Solving Regular Expression Matching. Understanding and Solving Regular Expression Matching
Solve regular expression matching with recursive and dynamic‑programming context, covering dot and star behaviour, edge cases and TypeScript.
LeetCode Container with Most Water: The Two‑Pointer Solution. LeetCode Container with Most Water: The Two‑Pointer Solution
Solve Container With Most Water in TypeScript using the two‑pointer pattern, with pointer movement, complexity, edge cases, and testable logic explained.
The Longest Palindromic Substring in JavaScript. The Longest Palindromic Substring in JavaScript
Explore the 'Longest Palindromic Substring' problem: its relevance in web development and four JavaScript (ES6 & TypeScript) solutions for efficiency.
Using JavaScript and the Two‑Pointer Technique to Solve 4Sum. Using JavaScript and the Two‑Pointer Technique to Solve 4Sum
Master the 4Sum problem in JavaScript: Explore the two‑pointer technique, solve with ES6/TypeScript, and test using Cypress. Elevate your coding skills.
3Sum Closest in JavaScript: Sorting and Two Pointers. 3Sum Closest in JavaScript: Sorting and Two Pointers
Solve 3Sum Closest in JavaScript with sorting and two pointers, reducing brute‑force work whilst finding the nearest total efficiently in TypeScript.
Add Two Numbers in TypeScript: A LeetCode Linked List Solution. Add Two Numbers in TypeScript: A LeetCode Linked List Solution
Solve LeetCode Add Two Numbers in TypeScript with linked‑list traversal, carry handling, edge cases, and a clear implementation you can test and extend.
3Sum in JavaScript: Two Pointers After Sorting. 3Sum in JavaScript: Two Pointers After Sorting
Solve the 3Sum problem in JavaScript with sorting, two pointers, duplicate skipping, Jest coverage, edge cases, and a clear TypeScript implementation.
Longest Substring Without Repeating Characters in JavaScript. Longest Substring Without Repeating Characters in JavaScript
Solve Longest Substring Without Repeating Characters in JavaScript with a sliding window, unique‑character tracking, and substring return variants.
Valid Palindrome in JavaScript: Two Pointers and Normalisation. Valid Palindrome in JavaScript: Two Pointers and Normalisation
A simple solution to solve the Valid Palindrome problem in JavaScript using the two‑pointer approach in ES6 and TypeScript, checking alphanumeric characters.
String to Integer (atoi): Decoding Strings in JavaScript. String to Integer (
atoi): Decoding Strings in JavaScriptConvert strings to integers in JavaScript, covering trimming, signs, invalid input, overflow‑style constraints, and a TypeScript implementation.
The LeetCode Zigzag Conversion Problem in TypeScript. The LeetCode Zigzag Conversion Problem in TypeScript
An exploration of the Zigzag Conversion problem: solve using string manipulation in web development, from iterative approaches to direct mathematical solutions.
Return the Length of Arguments Passed in JavaScript. Return the Length of Arguments Passed in JavaScript
An article describing how to count function arguments in JavaScript. Use 'rest' parameters in ES6 or the 'arguments' object for older JavaScript environments.
LeetCode: Reversing Integers with JavaScript. LeetCode: Reversing Integers with JavaScript
Reverse integers in JavaScript with sign handling, overflow checks, TypeScript examples, and the trade‑offs between string and maths approaches.
Solving the LeetCode Two Sum Problem Using JavaScript. Solving the LeetCode Two Sum Problem Using JavaScript
Solve the Two Sum problem efficiently in JavaScript with Hash Map or Two Pointers. Learn how to find pairs of numbers that sum up to a given target.