Note from 25 April 2022
With JavaScript, how would you compute all sorted permutations of 1 to n elements from a given array?
For example, with this source [1, 2, 3]
and n=2
How would you get this?
[[1], [2], [3], [1, 2], [1, 3], [2, 3]];
With JavaScript, how would you compute all sorted permutations of 1 to n elements from a given array?
For example, with this source [1, 2, 3]
and n=2
How would you get this?
[[1], [2], [3], [1, 2], [1, 3], [2, 3]];
An expert developer can stand up on a conference stage and show off the amazing scores for their site (perfect performance! perfect accessibility!…
So what is the current state of ES5 on the web today? And what are the best practices for web developers when building code for production? TL;DR:…
Bobae Kang
[HTMX] can get you 80% there with radically less complexity. No extra dependencies, no build step, no advanced tooling (now re-written in Rust!),…
Lydia Hallie
JavaScript Visualized - Promise Execution
The cool thing about Promises is that this can trigger an asynchronous action if a handler is attached by either then
or catch
. Since the handlers…
67 Weird Debugging Tricks Your Browser Doesn't Want You to Know
A list of useful, not-obvious hacks to get the most out of your browser’s1 debugger. Assumes an intermediate-level-or-higher understanding of the…