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.
Articles
Algorithms, page 3 of 3
Algorithms are the repeatable problem‑solving patterns we use when brute force is no longer good enough. In web development they show up far beyond interview preparation, wherever the order or cost of work matters. A lot of the articles here overlap with LeetCode, but the category is broader than that; it is about recognising the techniques that make difficult problems easier to reason about in JavaScript and TypeScript.
Longest Substring Without Repeating Characters in JavaScript. 
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.
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.
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.