LeetCode: Finding the Diameter of a Binary Tree
The diameter of a binary tree is the longest path between any two nodes. I'll explain clearly how we can solve this problem using recursion in JavaScript.
Articles, page 2 of 22
Practical notes and articles on React, Next.js and web platform work.
LeetCode: Finding the Diameter of a Binary Tree. 
Topological Sort: Solving the 'Course Schedule' Problem. Topological Sort: Solving the 'Course Schedule' Problem
How to solve Course Schedule with topological sort in TypeScript, comparing Kahn's algorithm with DFS cycle detection and why in‑degrees read clearly.
What GEO is, and Why It is Not Just SEO for AI. What GEO is, and Why It is Not Just SEO for AI
What GEO is, where the term helps, where it misleads, and how generative engine optimisation relates to search, retrieval, trust, and clearer web content.
Understanding the Module Pattern in JavaScript. Understanding the Module Pattern in JavaScript
The JavaScript module pattern explained through closures and private state, plus the architectural lessons it still teaches modern developers today.
Multi‑Source BFS: Solving the 'Rotting Oranges' Problem. Multi‑Source BFS: Solving the 'Rotting Oranges' Problem
Solve Rotting Oranges with multi‑source BFS in TypeScript, treating each queue level as one minute and tracking fresh cells until spread completes.
Caching Strategies in React. Caching Strategies in React
React performance work is often about avoiding repeated effort. This guide looks at memoisation, browser caching, and smarter data‑fetching choices.
Quickselect in TypeScript: Solving 'Kth Largest Element in an Array'. Quickselect in TypeScript: Solving 'Kth Largest Element in an Array'
Solve Kth Largest Element in an Array with Quickselect in TypeScript, comparing sorting, heaps, partitioning, random pivots, and trade‑offs under pressure.
Practical Use Cases for JavaScript Set and Map. Practical Use Cases for JavaScript
SetandMapJavaScript's `Set` and `Map` simplify common tasks like managing unique values or key‑value pairs. Here, I'll share practical examples for everyday development.
Find Peak Element: Binary Search Without a Fully Sorted Array. Find Peak Element: Binary Search Without a Fully Sorted Array
How to solve LeetCode Find Peak Element with binary search, and why local comparisons are enough even when the array is not sorted in the usual way.
Graph Traversal: Solving the 'Course Schedule' Problem. Graph Traversal: Solving the 'Course Schedule' Problem
The 'Course Schedule' problem tests our ability to detect cycles using graph traversal. I'll explain a clear solution using depth‑first search with TypeScript.
Dev Match Ltd., James McConnell, and the Refund That Never Came. Dev Match Ltd., James McConnell, and the Refund That Never Came
I paid Dev Match Ltd. for an iPad a year ago. It never arrived. Months of excuses from James McConnell, then a CCJ. This is my detailed record of what happened.
Testing Vue Components with Vue Test Utils. Testing Vue Components with Vue Test Utils
How to test Vue components with Vue Test Utils using realistic interactions, focused assertions, better test boundaries, and less brittle design.
Modified Binary Search: Solving 'Search in Rotated Sorted Array'. Modified Binary Search: Solving 'Search in Rotated Sorted Array'
How to solve Search in Rotated Sorted Array with modified binary search, identifying the sorted half each step and narrowing safely in TypeScript.
LeetCode: Solving the 'Merge Two Sorted Lists' Problem. LeetCode: Solving the 'Merge Two Sorted Lists' Problem
The 'Merge Two Sorted Lists' problem on LeetCode involves combining two sorted linked lists into one. Here, I explore a clear solution with TypeScript examples.
Binary Search on the Answer: Solving 'Koko Eating Bananas'. Binary Search on the Answer: Solving 'Koko Eating Bananas'
Solve Koko Eating Bananas with binary search on the answer, using feasibility checks, speed bounds, ceiling division, TypeScript examples, and edge cases.
Understanding Tail call Optimisation in JavaScript. Understanding Tail call Optimisation in JavaScript
Tail call optimisation in JavaScript, why it matters conceptually, and why patchy engine support still makes it unreliable for production recursion.
Understanding WeakMap and WeakSet in JavaScript. Understanding
WeakMapandWeakSetin JavaScriptUnderstand WeakMap and WeakSet in JavaScript, including weak references, metadata storage, private data patterns, memory behaviour, and Map or Set differences.
JavaScript Symbols: When and Why to Use Them. JavaScript Symbols: When and Why to Use Them
JavaScript Symbols explained in plain English, including unique keys, well‑known symbols, hidden metadata, and the cases where they are genuinely useful.
React's Virtual DOM vs. the Real DOM. React's Virtual DOM vs. the Real DOM
React's virtual DOM optimises performance by reducing updates to the real DOM. Here, I explain how it works, how it compares, and why it improves efficiency.
Best Practices for Vue Router in Large Applications. Best Practices for Vue Router in Large Applications
Managing routes in large Vue applications can become challenging. Here, I share practical best practices for structuring Vue Router to keep apps organised.
How JavaScript Handles Memory Management and Garbage Collection. How JavaScript Handles Memory Management and Garbage Collection
Garbage collection in JavaScript frees up unused memory automatically. Here, I explain how it works and how to prevent memory leaks in your applications.