Get the latest tech news
What Every Programmer Should Know About Enumerative Combinatorics
A Programmer's Introduction to Exact Counting and Enumeration of Integer Partitions and Compositions.
Quick introLeetArxiv 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. This article showcases how programmers without formal math backgrounds can use observation and pattern recognition to approach problems in enumerative combinatorics. The key observation in this section is that : starting from the leftmost column, the set can be efficiently enumerated using only binomial coefficients and binary search.
Or read this on Hacker News