🚁 "Happiness can exist only in acceptance." - George Orwell

Hey friends!

I hope your week was a good one. Mine was alright. I lost my voice for a lot of it, which made my attempts at singing at my desk pretty rough. Anyway, onwards!

Was this forwarded to you? You can subscribe here!

Web links of the week

Simplify your full-stack applications with XState
Dev Chats - Jammin’ with the Jamstack
Masonry? In CSS?!
24 Hour PowerPoint Game Dev Challenge

Something that interested me this week

This week I cut a new version of Better Security Questions (which you might remember I started a couple weeks ago), and I forgot to mention last week that I gave a little webinar about the Jamstack if you’d like to check it out! Also, we launched some more episodes of the Stack Overflow Podcast, which you can listen to anywhere.

Sponsor

Teleport is the easiest, most secure way to access all your infrastructure. The open-source Teleport Access Plane consolidates the four essential infrastructure access capabilities every security-conscious organization needs: connectivity, authentication, authorization, and audit.

By consolidating all aspects of infrastructure access into a single platform for software engineers and the applications they write, Teleport reduces attack surface area, cuts operational overhead, easily enforces compliance, and improves productivity. The Teleport Access Plane replaces VPNs, shared credentials, and legacy privileged access management technologies, improving security and engineering productivity. Learn more at goteleport.com!

Interview question of the week

Last week, I had you make a part of the game Rummikub! This was a toughie, great job Amine, Ryan, Andy, Leyan, Stefan, Joep, Becker, Sal, Daniele, Les, and Ten!

This week’s question:
Given a linked list, such that each node contains an additional random pointer which could point to any node in the list, or null, make a deep copy of the list and return the head node of the new copy. If you need to look up details about a deep copy, check here and here!

Node definition:

class Node {
    int val;
    Node next;
    Node random;

    public Node(int val) {
        this.val = val;
        this.next = null;
        this.random = null;
    }
}

Cool things from around the internet

Grid 650 board with GMK Pixel keycaps
A Visual Guide to the Aztec Pantheon
I should have loved biology
Pokémon, Pallet Town Cover - Sam Griffin

Joke

I signed up for Binary 101, but then I failed it miserably.
I had no idea it was a Level 5 course!

That’s all for now, folks! Have a great week. Be safe, make good choices, and sing a song!

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

cassidoo

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