Sliding Window Fundamentals: Solving 'Longest Substring Without Repeating Characters'
How to solve Longest Substring Without Repeating Characters with sliding window basics, comparing Set and last‑seen‑index approaches in TypeScript.
Articles
TypeScript, page 2 of 3
TypeScript is a typed superset of JavaScript designed to make larger codebases easier to reason about and safer to change. In practice it gives us stronger editor feedback, clearer APIs, better refactors, and a more explicit way to model the data flowing through components, utilities, and back‑end boundaries. Most of the articles here focus on the pragmatic side of TypeScript rather than type trickery for its own sake.
Below you will find a subset of articles from my blog specifically about TypeScript. This is an area that I have worked with for many years, and have managed to write about quite a few times. There are forty collected together for you below.
Sliding Window Fundamentals: Solving 'Longest Substring Without Repeating Characters'. 
Horizontal & Vertical Scanning: The Longest Common Prefix Problem. Horizontal & Vertical Scanning: The Longest Common Prefix Problem
Unravel the art of finding the Longest Common Prefix in strings using TypeScript. Dive deep into Horizontal & Vertical Scanning methods with code insights.
Intervals in Practice: Solving the 'Merge Intervals' Problem. Intervals in Practice: Solving the 'Merge Intervals' Problem
Solve Merge Intervals in TypeScript by sorting ranges, merging overlaps, handling touching intervals, preserving inputs, and avoiding common mistakes.
Prefix and Suffix Products: Solving 'Product of Array Except Self'. Prefix and Suffix Products: Solving 'Product of Array Except Self'
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.
LeetCode: Removing the nth Node from the End of a List. LeetCode: Removing the
nthNode from the End of a ListHow to remove the Nth node from the end of a linked list in TypeScript. Here we break down and explore a simple double‑pass and an efficient single‑pass method.
Finding the Median of Two Sorted Arrays with JavaScript. Finding the Median of Two Sorted Arrays with JavaScript
Exploring the 'Find Median of Two Sorted Arrays' problem: Understand its significance in interviews, dive into a TypeScript solution, and test with Cypress.
Understanding the Composition API in Vue 3. Understanding the Composition API in Vue 3
The Vue 3 Composition API explained with practical TypeScript examples, refs, composables, reactivity, and when the pattern genuinely helps larger components.
Validating Parentheses Input Using TypeScript. Validating Parentheses Input Using TypeScript
Validate parentheses input in TypeScript with a stack, checking bracket order, matching pairs, real parser‑style use cases, and alternative approaches.
Solving the 'Letter Combinations of a Phone Number' Problem with TypeScript. Solving the 'Letter Combinations of a Phone Number' Problem with TypeScript
An exploration of solutions to the 'Letter Combinations of Phone Number' problem using front‑end and TypeScript: recursion, backtracking, and iteration.
Understanding and Solving Regular Expression Matching. Understanding and Solving Regular Expression Matching
Explore the intricacies of the Regular Expression Matching problem. Dive deep into a recursive TypeScript solution and understand the power of regex.
LeetCode Container with Most Water: The Two‑Pointer Solution. LeetCode Container with Most Water: The Two‑Pointer Solution
Dive into the 'Container with Most Water' problem, exploring the efficient two‑pointer technique with a step‑by‑step TypeScript example and analysis.
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 while 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
Explore LeetCode's 'Add Two Numbers' problem: adding numbers represented as linked lists. Dive into the challenge, TypeScript solution, and its significance.
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.
Differences Between Falsy and Nullish Values in JavaScript. Differences Between Falsy and Nullish Values in JavaScript
Falsy and nullish values are not the same in JavaScript. This guide clears up the difference and shows why 0 and empty strings often trip people up.
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.