Hola amigos!

Happy May! I hope you've had a great week. I've been in Barcelona with my family on a much-needed vacation, and squeezing in some web surfin time in the wee hours of the night. Let's see what happened this week!

Was this forwarded to you? You can subscribe here!

Web links of the week

font-family Doesn’t Fall Back the Way You Think
The end of responsive images
Anchor-name + transitions
DO_NOT_TRACK

Something that interested me this week

On this vacation, I've been on Airplane Mode the entire time, and only looking at my phone when 1. we have WiFi and 2. everyone's doing their own thing. It's been wonderful. Not scrolling, or checking notifications, or thinking about anything, just being in the moment (as much as possible) has been great.

Now, don't get me wrong... my inbox is a trash fire and I try to tame it in the evenings before bed. But it's been a good mental reset.

That being said, I did mention last week that I have a hankering for side projects, and I shipped!! I cut a new release of my app todometer, which implements a bunch of new features that I've been wanting to include for a long time. I blogged about it in detail here.

Some of the new features under the hood enables me/other users to add extensions and helpers to their todometer instances, which I've wanted for a while. For example, I just open sourced a little web clipper for it! I need to figure out how to organize/share these, but for now, I'm pleased.

Sponsor

Warp is now open-source.

Read that again. It's a big deal!

Contribute today using an agent-first workflow managed by Oz → github.com/warpdotdev/warp

Interview question of the week

Last week, I had you fix broken "tiles" in a 2D array! This was a fun one, great work Paul, Micah, Ten, Toni, and the folks in the Ruby Users Forum!

This week's question:
Given an array of positive integers, find the length of the longest subsequence where every adjacent pair of elements in the subsequence is coprime (where the greatest common divisor, or GCD, is 1).

Example:

longestCoprimeSubsequence([6, 12, 4, 8])
> 1 // none are coprime

longestCoprimeSubsequence([4, 3, 6, 9, 7, 2])
> 4 // [4, 3, 7, 2], where gcd(4,3)=1, gcd(3,7)=1, gcd(7,2)=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

Make Your Own Micro Forest
Magnified sand
NIUNIU HX-40 in classic beige
"Nothing" is the secret to structuring your work

Joke

What do cows do after they get married?
They go on a honey-moo!

That's all for now, folks! Have a great week. Be safe, make good choices, and uninstall something!

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