🎧 "Hope is a gift you don’t have to surrender, a power you don’t have to throw away." - Rebecca Solnit

Hey friends!

I hope you had a lovely week! Mine was busy, but in a good way. Let’s learn!

Was this forwarded to you? You can subscribe here!

Web links of the week

Experimenting A New Syntax To Write SVG
Signal boosting
Vue for React Developers
Demystifying Web Accessibility

Something that interested me this week

This past week was kind of a catch-up week for me. As I was transitioning roles a few weeks ago, some articles and talks and my poor inbox were pretty neglected, so I finally caught up on (almost) all of that.

It’s kind of hard for me to do catch-up work, I admit! I think the procrastinating side of my brain whispers, “you put it off for this long, why not continue, and play a video game?” Which is not ideal. I’ve found setting “deadlines” for myself does help, but only sometimes. If y’all have strategies you use for this kind of stuff, I’d love to hear them!

Sponsor

What Conference? THAT Conference!

What is THAT Conference you ask? It’s a full-stack, tech-obsessed conference full of fun, code-loving humans who share and learn together.

THAT Conference is unlike any other technical conference. It’s a “summer camp” full of workshops, sessions, open spaces, family activities, networking opportunities, and even a BBQ nestled in the gorgeous Kalahari Resort and Waterpark. Yes, a waterpark. This family-friendly event includes both professional and family tracks, so there is something to learn and experience for all ages.

Join us this January 16th - 18th in Round Rock, Texas. Use code cassidoo to receive 5% off your camper ticket. Tickets go on sale on October 15th on thatconference.com!

Interview question of the week

Last week, I had you generate ordinal suffixes! Great job Gabor, Will, Dan, Ten, Lily, Mike, Miguel, Jon, Saad, Muhammad, Kobe, Ten, Cedric, Ryan, Aodhan, Will, Lucien, Brian, Danny, Max, Andrew, Jonathan, and Daniel!

This week’s question:
Given two integers, generate a “fibonacci-like” sequence of n digits (where the next number in the pattern is the sum of the previous two numbers). Extra credit: Given a sequence, determine if the sequence is “fibonacci-like”.

Example:

let n = 5

> fibLike(10, 20, n)
> [10, 20, 30, 50, 80]

> fibLike(3, 7, n)
> [3, 7, 10, 17, 27]

Cool things from around the internet

atxkb moontower v2
A Way Forward with Wolves
Novelty fallacy: why new isn’t always better
Why Are Plants Green? To Reduce the Noise in Photosynthesis.

Joke

What do you say when you see a vegetable that’s awesome, but not too awesome?
That’s rad-ish!

That’s all for now, folks! Have a great week. Be safe, make good choices, and learn how to say “thank you” in another language!

Special thanks to Gabor, Stephen, IceSloth, Alaska, Josh, Conor, Ezell, Karthic, Ximena, Paige, Zev, Sebastián, Ben, Sema, Kinetic Labs, Vadim, and Bailey for supporting my Patreon and this newsletter!

cassidoo

website | twitter | patreon | github | twitch | codepen | polywork