Hola hola!
We made it to mid-April, where does the time go?? I hope you had a good week. Let’s get learnin’!
Was this forwarded to you? You can subscribe here!
Web links of the week
Tauri vs. Electron: performance, bundle size, and the real trade-offs
Mastering default values in JavaScript with the nullish coalescing (??) operator
CSS Bursts with Conic Gradients
Better typography with text-wrap pretty
A steam locomotive from 1993 broke my yarn test
Something that interested me this week
I pumped out a bunch of content this past week!
For work, I morphed a post about MCP that I wrote for my own blog last week into something a bit more business-y, and shipped the latest episode of The Download!
I also blogged a bunch of other stuff:
- Things I learned while upgrading my iPad: a lot of this one is probably common knowledge, but I wanted to write it for the person out there who is like me and not fully aware of all of the Apple-isms in the world
- Make your images in markdown on GitHub adjust for Dark Mode and Light Mode: A little trick I’ve been using on some of my repos
- Keybindings I use in VS Code: I’ve been getting a bunch of questions about this so I figured I’d put it all in one place!
Anyway, for the 8th (!) newsletter anniversary raffle last week, winners will be pinged this week! Thanks for entering, y’all!
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 generate Leyland numbers. Ya did great David, Muhammad, Elke, Ten, Austin, Jeremias, Patrycja, Nick, Levi, and Neha!
This week’s question:
Given a 2D grid of integers, find the largest sum of any connected path of cells. A path consists of horizontally or vertically adjacent cells (no diagonals) and cannot reuse cells. Return the largest sum.
Examples:
const grid1 = [
[1, 2, 3],
[4, 5, 6],
[7, 8, 9]
];
const grid2 = [
[5, 3],
[2, 8]
];
largestPathSum(grid1)
> 45 // (1 → 2 → 3 → 6 → 9 → 8 → 7 → 4 → 5)
largestPathSum(grid2)
> 18 // (5 → 3 → 8 → 2)
(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
Custom Gochu60 keyboard
What is manga lettering?
Avoid these 5 tape measure mistakes (video)
Leaf Color and Shape Enhance Cooling Effect
Joke
What kind of tree fits in your hand?
A palm tree!
That’s all for now, folks! Have a great week. Be safe, make good choices, and get the rest you need!
Special thanks to IceSloth, Ezell, Sebastián, Ben, Kinetic Labs, and Marta for supporting my Patreon and this newsletter!
cassidoo
website | blog | github | bluesky | twitter | patreon | twitch | codepen | mastodon
