🦠 "Courage is knowing it might hurt, and doing it anyway. Stupidity is the same. That's why life is hard." - Jeremy Goldberg

Helllllloooo friends!

It's been a while! Apologies for the long break from these emails. Or maybe you liked the long break. Oh well. Anyway! I went on vacation and started doing my first workshops at React Training, and am finally getting back into the swing of things. Onward!
 

---

Web links of the week

Understanding specificity in CSS
All you need to know about JavaScript Iterators and Generators
Geometric.js - A JavaScript library for doing geometry
Machine Learning For Front-End Developers With Tensorflow.js​
Robot: Finite State Machines
 

---

Something that interested me this week

Phew, I have had a busy couple of weeks! After my vacation, I got back to real life and got to work making sure I knew the curriculum for my first workshops with React Training. As of about 2 hours ago, I just finished my second one!

Teaching is so interesting. You think you know a topic, but you really learn it that much deeper when you tell others about it and try to get them to understand it as you do. Students so far in both workshops have come up with questions that I wouldn't have expected, and answering those questions is a great learning experience for everyone!

Anyway, I've really been enjoying teaching so far, and I'm excited for more. That being said, if you're interested in joining in one of my workshops, I'm going on tour in November with the company, or you can ask your boss to bring us in and teach ya, or you could just... look for my memes.
 

---

Interview question of the week

Last time, I had you write a square root function! Sophie, Dimitris, Stuart, Jehiel, Kyle, and rhalyjon did a great job answering!

This week's question:
Given an integer n, write a function to count all possible sequences of length n such that all the elements of the sequence are in the range [1 to n] and the sum of the elements of the sequence is even.

Example:
countEvenSequences(3)
> 13
// All possible sequences of length 3 will be (1, 1, 2), (1, 3, 2),
// (3, 1, 2), (3, 3, 2), (1, 2, 1), (1, 2, 3), (3, 2, 1), (3, 2, 3),
// (2, 1, 1), (2, 1, 3), (2, 3, 1), (2, 3, 3) and (2, 2, 2).

The answer can get large, so be efficient with this one!
 

---

Cool things from around the internet

NucleAnts tabletop game: ‘an imaginary future where giant mutated ants fight for atomic waste’
A love letter to my website
A Good Place: The fake town where everybody knows your name
 

---

Joke

Why don't people in Athens wake up early?
Because dawn is tough on Greece!
 

---

That's all for now, folks! Have a great week. Be safe, make good choices, and try to reduce your screen time to protect yourself from eye strain.

Special thanks to Gabor and Stephen for supporting my Patreon and this newsletter!

cassidoo

website | twitter | patreon | github | codepen