Andrew Healey • 5/19/2019

Solving Puzzles With High-Performance JavaScript

This technical article demonstrates how to solve programming puzzles like LeetCode's 'Jewels and Stones' with high-performance JavaScript. It starts with a naive O(N^2) solution, improves to an O(N) approach using a Set, and then explores micro-optimizations using typed arrays (Int8Array) and ASCII lookups to achieve 'faster than 100%' results, focusing on runtime complexity and practical speed tips.

0 comments

#JavaScript #performance #time complexity