Hey friends!
I hope you had a nice, drama-free week! Do those exist anymore? Eh. Anyway. Let's boogie.
Was this forwarded to you? You can subscribe here!
The Most Hearted Pens of 2024
FFmpeg By Example
GitHub’s updated Commits page and the interactive list component
Technologies and frameworks we use in our design studio
Learn Yjs and Building Realtime Collaborative Apps in JavaScript
Y'all this week was a LOT. I traveled to Seattle to do a team offsite for work, which was awesome! I hadn't been in one room with my whole team before, and it was so nice to get to know each other better, and plan out the next few months together.
But then... I got norovirus. My word, it was horrible. Luckily though it was relatively short, about 24 hours of... you know what, you can look up what the symptoms are, I'll spare you the details. But anyway, I'm thankfully better now, home in Chicago, and having some fun reading Yumi and the Nightmare Painter for the U.S. holiday weekend.
Webinar: Achieving application portability with Kubernetes—build once, deploy anywhere
Watch this on-demand webinar on building serverless applications that dynamically adapt to runtime conditions, ensuring optimal performance regardless of location or scale. Presented in collaboration with DevOps Institute, it features best practices and tips for leveraging Amazon Web Services (AWS) solutions to streamline cloud application architectures.
You will learn how to:
Last week, I had you make a translation function for the NATO phonetic alphabet! It was fun seeing how similar (and different) your answers were. Great job Ross, Will, Ashish, Ten, Muhammad, Trevor, Kyle, Óscar, Tim, Neha, Shreya, Alison, Vincent, Kriszti, Ricardo, Bruna, Mazen, Kracekumar, Belkin, Hugo, Winnie, and Amine!
This week's question:
Given a list of integers, write a function that finds the longest subsequence where the difference between consecutive elements is either 1 or -1. Return the length of this subsequence.
Examples:
> longestSubsequence([1,2,3,4,5])
5
> longestSubsequence([4,2,3,1,5])
2
> longestSubsequence([10,11,7,8,9,12])
3
(you can submit your answers by replying to this email with a link to your solution, or share on Bluesky, Twitter, LinkedIn, or Mastodon)
Fluid Simulation Pendant
I Ditched the Algorithm for RSS—and You Should Too
NovelKeys Classic TKL Proto Yellow with PBT Twist R2 Keycaps
Engineer Eats Efficiently (for $2.50 a Day)
The best thing about stationary stores is that they're always in the same place!
That's all for now, folks! Have a great week. Be safe, make good choices, and oh my word, please, wash your hands!
Special thanks to IceSloth, Ezell, Sebastián, Ben, Kinetic Labs, Faisal, and Marta for supporting my Patreon and this newsletter!
cassidoo
website | blog | github | bluesky | twitter | patreon | twitch | codepen | mastodon