LeetArxiv

LeetArxiv

Share this post

LeetArxiv
LeetArxiv
What Every Programmer Should Know About Enumerative Combinatorics
Copy link
Facebook
Email
Notes
More

What Every Programmer Should Know About Enumerative Combinatorics

A Programmer's Introduction to Exact Counting and Enumeration of Integer Partitions and Compositions.

Murage Kibicho's avatar
Murage Kibicho
May 15, 2025
∙ Paid
11

Share this post

LeetArxiv
LeetArxiv
What Every Programmer Should Know About Enumerative Combinatorics
Copy link
Facebook
Email
Notes
More
4
Share
Quick intro
LeetArxiv is Leetcode for implementing Arxiv and other research papers.
This is Chapter 1 in our upcoming book, What Every Programmer Needs to Know about Enumerative Combinatorics.
Past Chapters (Early access for paying subscribers)
  • Chapter 1 (we are here) : Introduction to Integer Partitions and Integer Compositions.

  • Chapter 2 : The Factorial Nu…

Keep reading with a 7-day free trial

Subscribe to LeetArxiv to keep reading this post and get 7 days of free access to the full post archives.

Already a paid subscriber? Sign in
© 2025 Murage Kibicho
Privacy ∙ Terms ∙ Collection notice
Start writingGet the app
Substack is the home for great culture

Share

Copy link
Facebook
Email
Notes
More