⛈️ "You pray for rain, you gotta deal with the mud too." - Denzel Washington

Hey friends!

Happy August! I hope your week went smoothly. It's been a loud one here in Chicago with the Lollapalooza music festival going on, but it's been nice otherwise!

Was this forwarded to you? You can subscribe here!

Web links of the week

learn git worktrees in under 5 minutes (video)
What is popover=hint?
The modern web sucks. My band's website doesn't. (video)
How to Make a Font that Says Nothing

Something that interested me this week

Our second baby turned 100 days old today!! We had a "Baek-il" party with family and friends and it was so fun. In case you didn't know, in Korean culture, the 100th day is a big deal. Back in "the olden days" when infant survival rates were low and childhood diseases were high, babies were celebrated and prayed over when they made it to their 100th day. Now, with modern medicine and all that, it's more traditional than anything, and we had a great time having him dressed up in a traditional hanbok and surrounding him with rice cakes!

Sponsor

Unlock Your Career Potential with Keenesse

Feeling stuck, or ready for your next big move?

Keenesse offers personalized career coaching to help you gain crystal-clear career goals, pinpoint exciting advancement opportunities, and master crucial skills like resume optimization, interview mastery, and confident negotiation – all to land your dream role in a competitive market.

Our expert team of seasoned tech industry coaches provides tailored support at every career stage, from ambitious students to accomplished executives.

Ready? Schedule your free, no-obligation consultation today at keenesse.com.

Interview question of the week

Last week, I had you make a hexagon checker function! Great work Nico, Winnie, Muhammad, Marco, Sam, Lucien, Ross, David, Ten, Kriszti, Colin, and Amine!

This week's question:
Given an array arr representing the positions of monsters along a straight line, and an integer d representing the minimum safe distance required between any two monsters, write a function to determine if all monsters are at least d units apart. If not, return the smallest distance found between any two monsters. If all monsters are safely spaced, return -1.

Examples:

let monsters = [3, 8, 10, 15];
let d = 6;
minMonsterDistance(monsters, d)
> 2

minMonsterDistance([5, 9, 14, 18], 4)
> -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

Why Leather is Unbeatable (video)
How to Pronounce GIF (the right way)
The Analog Life: 50 Ways to Unplug and Feel Human Again
Building the ScottoKatana (PCB Edition) Mechanical Keyboard (video)

Joke

I won an argument with a weather forecaster once.
Their logic was too cloudy!

That's all for now, folks! Have a great week. Be safe, make good choices, and share good news when you can!

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

cassidoo

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