Happy Easter, Passover, and Ramadan to those who celebrate them, and for those who don’t, happy start of a new week!
Was this forwarded to you? You can subscribe here!
This week was a busy one of recording podcasts (the Stack Overflow episodes are fun and publish regularly) and talks, making memes, and prepping for the Devs For Ukraine conference (please join us and donate)!
Side note: I emailed the winners of the anniversary issue raffle this week, check your spam just in case!
The ReadME Project is part of GitHub’s ongoing effort to amplify the voices of the developer community. Sign up for a monthly newsletter to receive developer features, podcasts episodes, and articles on emerging tech and cultural trends right in your inbox. Whether you’re interested in a new framework or want to hear from the maintainer of your favorite OSS project, you’re sure to learn something new!
Check-out the The ReadME Project.
This week’s question is brought to you by Stytch!
Given an unsorted array of integers and a number n, find the subarray of length n that has the largest sum.
$ largestSubarraySum([3,1,4,1,5,9,2,6], 3) $ [9, 2, 6]
Stytch is building your all-in-one platform for passwordless auth. We make it easy for you to embed passwordless solutions into your websites and apps for better security, better conversion rates, and a better end user experience.
I was fired from the mechanical keyboard factory because I didn’t put in enough shifts.
That’s all for now, folks! Have a great week. Be safe, make good choices, and call the people you care about!
Special thanks to Gabor, Stephen, IceSloth, Alaska, Josh, Conor, Ezell, Pedro, Karthic, Ximena, Paige, Zev, Sebastián, Ben, and Sema for supporting my Patreon and this newsletter!
website | twitter | patreon | github | twitch | codepen | polywork