Recursion-joy, a set of recursion problems in JavaScript

recursion-joy – :hourglass: A set of recursion problems to be solved…


JavaScript – Search and Don’t Replace

Earlier today a friend of mine, Marc Grabanski, pinged me with a question: What’s the optimal way, in JavaScript, to convert a query string like “foo=1&foo=2&foo=3&blah=a&blah=b” into one that looks like this: “foo=1,2,3&blah=a,b”. He ... (more…)

Read more »