Not Frequent

0/9

# Dynamic Programming on Bitmasks

Author: Michael Cao

### Prerequisites

- Bit Operations
- Gold - Introduction to DP

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 | |||
---|---|---|---|

CPH | Elevator Rides, SOS, Hamiltonian | ||

PAPS | example - similar to Hamiltonian | ||

CF | Hamiltonian walks | ||

HE |

## Solution

### This section is not complete.

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

## Problems

Status | Source | Problem Name | Difficulty | Tags | Solution |
---|---|---|---|---|---|

AC | Easy | ## Show TagsBitmasks | Check AC | ||

CF | Easy | ## Show TagsBitmasks, MinCostFlow | Check CF | ||

Old Gold | Easy | ## Show TagsBitmasks | External Sol | ||

Old Gold | Easy | ## Show TagsBitmasks | External Sol | ||

CSES | Normal | ## Show TagsBitmasks | CPH 10.5 | ||

IZhO | Normal | ## Show TagsBitmasks | View Solution | ||

YS | Normal | ## Show TagsBitmasks, Meet in Middle | View Solution | ||

Kattis | Normal | ## Show TagsBitmasks, Geometry, Binary Search | View Solution |