Bitmask Dynamic Programming Interactive Visualizer
Bitmask DP encodes subsets of small sets (n <= 20) as integer bitmasks so exponential subset problems like Traveling Salesman and optimal assignment run in O(2^n * poly(n)) instead of O(n!).
Study Bitmask Dynamic Programming Explanation · View Multi-Language Code · All Algorithms