PrevNext
Not Frequent
 0/9

Dynamic Programming on Bitmasks

Author: Michael Cao

Prerequisites

DP problems that require iterating over subsets.

Pro Tip

You can often use this to solve subtasks.

Focus Problem – read through this problem before continuing!

Tutorial

Resources
CPHElevator Rides, SOS, Hamiltonian
PAPSexample - similar to Hamiltonian
CFHamiltonian walks
HE

Solution

This section is not complete.

Feel free to file a request to complete this using the "Contact Us" button.

Problems

StatusSourceProblem NameDifficultyTagsSolution
ACEasy
Show Tags

Bitmasks

Check AC
CFEasy
Show Tags

Bitmasks, MinCostFlow

Check CF
Old GoldEasy
Show Tags

Bitmasks

External Sol
Old GoldEasy
Show Tags

Bitmasks

External Sol
CSESNormal
Show Tags

Bitmasks

CPH 10.5
IZhONormal
Show Tags

Bitmasks

View Solution
YSNormal
Show Tags

Bitmasks, Meet in Middle

View Solution
KattisNormal
Show Tags

Bitmasks, Geometry, Binary Search

View Solution

Module Progress:

Give Us Feedback on Dynamic Programming on Bitmasks!

PrevNext