I hope you had an awesome week! Mine was great and I'm excited to be in your inbox today. Let's gooo!
Was this forwarded to you? You can subscribe here!
I was sailing with my family with this week! It was a really cool and fun experience, but after being on a boat for a week, I am still swaying now that I'm back on land!
This next week is the last chance you can pre-order DSA Scrabble! It'll be shipping in Q1, and we've got desk mats and artisans and fun kits for you in addition to the keycaps themselves. This set has truly been a labor of love, and the Clackeys team and I worked super hard to make it as affordable as possible!
📣 Atlassian is unleashing an all-new (free) event in Berlin and a developer hackathon with kick@ss prizes like $35K USD for the grand prize winner! You in?
And don't forget to register for the Devs Unleashed hackathon! Submissions open December 12, 2022.
This week's question:
Given a 2D array
n of integers, and an array
m of four (4) coordinates that represent corners of a rectangle in
n, return the sum of all of the numbers in the rectangle.
n = [6, 9, -7, 3, 8, -1, -6, -4, 2, -7, 7, -7, -1, 4, 7, 9] m = [-1, 8, -7, 2] > rectangleSum(n, m) > 2 > rectangleSum(n, [6, 3, 2, -7]) > 3
As 2022 is coming to a close, let me sum it up for you all in one word.
That's all for now, folks! Have a great week. Be safe, make good choices, and get enough sleep!
Special thanks to Gabor, Stephen, IceSloth, Alaska, Josh, Conor, Ezell, Karthic, Ximena, Paige, Zev, Sebastián, Ben, Sema, Kinetic Labs, Vadim, Bailey, and Carmina for supporting my Patreon and this newsletter!
website | twitter | patreon | github | twitch | codepen | polywork