G'day friends!
You survived the first week of the new year! Hope your resolutions are staying string. :)
Web links of the week
Stimulus: A modest JavaScript framework for the HTML you already have
Robust Client-Side JavaScript: A Developer's Guide
How JavaScript Works
Async + Await in 15 minutes
Something that interested me this week
This week was a busy one for me. I started watching
Planet Earth II in the background while I typed away at emails. It's pretty awesome. I've decided that I'm going to make it my goal to keep my inbox at less than 40 emails consistently day-to-day. It's been working so far, but who knows how long this'll last. Emails take forever. I just realized that this is another one in your inbox.
I'm a part of the problem.
...wow, this section was boring this time around. Heh. I'll get better. I hope you're staying warm this winter. :)
Interview question of the week
I got a TON of responses for last week's question!
Instead of writing my own solution,
here are links to a few great ones. :)
This week's question:
Given an array of integers, find whether it’s possible to construct an integer using all the digits of the numbers in the array such that it would be divisible by n (where n is 1 <= n <= 9). If it's possible, return true, else return false.
Examples:
divisibleIntegers(n = 3, arr= [40, 50, 90])
> true // 945000 is divisible by 3
