Discrete Math for Algorithms

Every post in the "Discrete Math for Algorithms" series, in reading order. · 2 posts

1. Part 1

   Counting Gets Interesting When Things Start Repeating

   Why counting "at least one" is harder than it looks, how overcounting sneaks in, and what anagrams reveal about arranging things that aren't all unique

2. Part 2

   Combinations Are Just Permutations That Forgot Their Order

   How dropping the order requirement connects permutations to subsets, and why binary strings, grid paths, and choosing teams are all the same problem