Helllllooooo!

I hope you had a good week! I'm in San Francisco for Microsoft Build, and it's been a whirlwind getting everything ready for the event. Let's boogie.

Was this forwarded to you? You can subscribe here!

Web links of the week

Learning Solid 2.0
JS Crossword
The Fundamentals and Dev Experience of CSS @function
Algorithmic Theming Engines: Building Self-Correcting Color Systems With contrast-color()

Something that interested me this week

Like I said before, I'm in San Francisco for Microsoft Build! This week has been absolutely chock full of demo and talk prep, and I truly haven't done anything else (except I did start reading Dungeon Crawler Carl, which is a very entertaining book so far).

I admit I'm pretty stressed about the event going well, but it's been really nice working hard with my teammates to try and make it a quality event for developers on and offline. I will be sleeping HARD after this one!

Oh, and my talk from Codemotion Madrid last month is now online!

Sponsor

Microsoft Build 2026 is happening June 2-3 at Fort Mason in San Francisco, and online!

The event is focused on real code, real systems, and real workflows, especially around teams building and scaling AI. GitHub will be participating across session types, expert meet-up spaces, and event activations, so expect plenty of practical demos and chances to talk to the folks building the tools many developers use every day.

See you there!

Interview question of the week

Last week, I had you move customers in a line. Line up for high fives, awesome work Miguel, Sergio, David, Nico, Paul, Muritala, Thulasi, Christian, AJ, Amine, Donato, Toni, and the lovely people in the Ruby Users Forum!

This week's question:
Given an array of object weights and an array of suitcase capacities, determine the minimum number of suitcases needed to pack all objects, where each object must go into exactly one suitcase and each suitcase can hold any number of objects up to its capacity. Return -1 if it is impossible to pack all objects.

Examples:

packSuitcases([4, 8, 1, 4, 2], [10, 6, 8]);
> 3

packSuitcases([9, 7, 6], [10, 6]);
> -1

(you can submit your answers by replying to this email with a link to your solution, or share on Bluesky, Twitter, LinkedIn, or Mastodon)

Cool things from around the internet

Daertwing keyboard
Is that song AI-generated? UChicago scientists create tool to check
La Carte Blanche: A Project Definition Framework to Avoid Chaos
The Math of Why You Can't Focus at Work

Joke

What kind of music do planets listen to?
Nep-tunes!

That's all for now, folks! Have a great week. Be safe, make good choices, and try something new with your outfits!

Special thanks to Ben, Kinetic Labs, and Marta for supporting my Patreon and this newsletter!

cassidoo

website | blog | github | bluesky | youtube | twitch | twitter | patreon | codepen | mastodon