Advanced Error Handling in JavaScript with try, catch, and finally
Go beyond basic try/catch in JavaScript with finally, custom errors, async error handling, testing, user‑facing failures, and defensive‑code traps.
Articles
JavaScript
JavaScript is the working language behind most of my front‑end writing, from small browser behaviours to application state and asynchronous code. These articles favour the mechanism behind a feature over a clever trick, whether the subject is callbacks, async code, or a language edge that only becomes obvious in production.
Advanced Error Handling in JavaScript with try, catch, and finally. Advanced Error Handling in JavaScript with
A Deep Dive into JavaScript's Proxy and Reflect API. A Deep Dive into JavaScript's
ProxyandReflectAPIA look into how JavaScript's Proxy and Reflect APIs work together to intercept and redefine object behaviour, including practical use cases and common patterns.
Union‑Find Explained: Solving the 'Number of Provinces' Problem. Union‑Find Explained: Solving the 'Number of Provinces' Problem
Solve Number of Provinces with union‑find in TypeScript, comparing DFS, connected components, path compression, union by rank, and matrix scanning.
State Management in Angular: NgRx vs. SignalStore. State Management in Angular: NgRx vs. SignalStore
NgRx Store vs. SignalStore explained with real Angular trade‑offs, including scope, TypeScript ergonomics, devtools, effects, and when neither is necessary.
What is a Timing Attack? Side Channels, Examples, and Safer Comparisons. What is a Timing Attack? Side Channels, Examples, and Safer Comparisons
Timing attacks explained for web developers, including side channels, string comparisons, real examples, and practical defences in JavaScript.
State Management in Vue: Vuex vs. Pinia. State Management in Vue: Vuex vs. Pinia
Vuex vs. Pinia explained with real trade‑offs, including API design, TypeScript ergonomics, migration paths, and when each choice still makes sense.
Solving the LeetCode N‑Queens Problem. Solving the LeetCode N‑Queens Problem
Solve the N‑Queens problem with TypeScript backtracking, including the decision tree, constraints, complexity, and test cases.
Using Angular Signals for Performance Optimisation. Using Angular Signals for Performance Optimisation
Use Angular signals for performance optimisation with derived state, computed values, OnPush, effects, RxJS interop, and measuring whether work improved.
LeetCode: The 'Kth Smallest Element in a BST' Problem. LeetCode: The 'Kth Smallest Element in a BST' Problem
Solve Kth Smallest Element in a BST with in‑order traversal, showing why the tree's ordering removes the need for a separate sorting step in interviews.
Using RxJS for State Management in Angular. Using RxJS for State Management in Angular
RxJS offers a powerful, reactive approach to managing state in Angular apps. Here, I clearly explain practical patterns and show how to use them effectively.
React Developer vs. Next.js Developer: What Actually Changes in Production. React Developer vs. Next.js Developer: What Actually Changes in Production
React developer vs. Next.js developer explained through production concerns: rendering, routing, caching, SEO, deployment, CMS data, and debugging.
Backtracking Decision Trees: Solving 'Combination Sum'. Backtracking Decision Trees: Solving 'Combination Sum'
Solve Combination Sum with backtracking in TypeScript, using a growing path, remaining total, sorted pruning, reuse rules, and common mistakes too.
Solving the 'Jump Game' Problem with Greedy Algorithms. Solving the 'Jump Game' Problem with Greedy Algorithms
A clear walkthrough of LeetCode Jump Game using a greedy algorithm, including why the farthest‑reach approach works and where slower ideas get stuck.
Memoization in JavaScript: Optimising Function Calls. Memoization in JavaScript: Optimising Function Calls
Memoization helps JavaScript functions run faster by caching previous results. Here's a clear guide on how and when to use memoization effectively.
Dynamic Programming in LeetCode: Solving 'Coin Change'. Dynamic Programming in LeetCode: Solving 'Coin Change'
How to solve LeetCode Coin Change with dynamic programming, and why the obvious greedy approach fails on exactly the cases worth understanding in interviews.
LeetCode: Finding the Diameter of a Binary Tree. 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.
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.
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.