Hey friends!
I'm so excited to be in your inbox today! It is this newsletter's SEVENTH year anniversary!! I'm so grateful for all of you here. Let's keep it going (also there are free things and coupons below, keep scrolling)!
Was this forwarded to you? You can subscribe here!
Glitch Jams Live Ep. 16: Eleventy'ing with Zach Leatherman
A proposal to add signals to JavaScript
An Interactive Guide to CSS Container Queries
How we’re approaching theming with modern CSS
I can't believe it's been a whole dang 7 years since starting this newsletter. Thank you so much for being here and reading along with me each week!! I'm so grateful for you!
For those who've been here before, you may know that I love doing raffle giveaways and coupons every year! We have some delightful folks offering free things for ya!
freakingnerds
!CASSIDY
!CASSIDOO
!If you'd like to enter in the raffle for all the great prizes here (huge thanks to all the folks who are offering them!), please fill out this form by Thursday at noon, Central Time to get an entry!
And just once again: Thank you so much for reading this. It makes my day to see replies and messages and tweets and toots and carrier pigeons from people that enjoy reading this, and seeing you share it with others!
Volv is an app for high performing individuals. It curates the best content from 400+ sources and platforms and digest it for you in 9-second reads. Say goodbye to endless scrolling on social media – it keeps you effortlessly updated. From breaking news to insightful newsletters, trending topics to viral debates, all accessible with just a few swipes.
With 40 million stories swiped so far, Volv is revolutionizing how you stay informed.
Last week, I had you add unique values together! There were a TON of cool responses to this one. Great work Arban, Saad, Leo, Sebastián, Ricardo, Stephen, Noe, Joel, Kyle, Altamish, Muhammad, Chase, Angelo, Austin, Daryl, Jen, Amine, Varenya, Pedro, Raph, Youssef, Lucien, Dawood, Nathael, Farzad, Avanika, Ten, standin_perseus, Noah, Mitchell, and Sean!
This week's question:
Imagine you have n
dice, and each die has m
faces on it (so the numbers are from 1 to m
). Write a function where, given an integer target
, it returns the number of possible ways to roll the dice to get the sum of target
face up. You can safely assume m
will never be larger than 20 (so you don't have to deal with mega huge numbers).
Example:
let n = 1;
let m = 6;
$ diceSum(n,m,3)
$ 1 // there is only one die, and one way to get 3
$ diceSum(2,m,7)
$ 6 // 6 ways to get a sum of 7: 1+6, 2+5, 3+4, 4+3, 5+2, 6+1
(you can submit your answers by replying to this email with a link to your solution, or share on LinkedIn, Twitter, Mastodon, or Bluesky)
We need more calm companies
Tofu 65 2.0 w/ PBTfans WOB
AI cannot and should not replace search
Daisuke Samejima oil paintings
What do you call a freeloading cow?
A moocher!
That's all for now, folks! Have a great week. Be safe, make good choices, and thank you for being here!
Special thanks to IceSloth, Ezell, Sebastián, Ben, and Kinetic Labs for supporting my Patreon and this newsletter!
cassidoo
website | blog | github | twitter | patreon | twitch | codepen | mastodon | bluesky