---
title: 'Dynamic Programming'
description: 'Collections of DP Problems in different categories'
hide_table_of_contents: true
sidebar_position: 100
keywords:
  - leetcode
  - study plan
  - roadmap
  - dynamic programming
---

export const DPBitManipulationProblems = [
  {
    "problemName": "0464 - Can I Win",
    "difficulty": "Medium",
    "leetCodeLink": "https://leetcode.com/problems/can-i-win/",
    "solutionLink": "../solutions/0400-0499/can-i-win-medium"
  },
  {
    "problemName": "0691 - Stickers to Spell Word",
    "difficulty": "Hard",
    "leetCodeLink": "https://leetcode.com/problems/stickers-to-spell-word/",
    "solutionLink": ""
  },
  {
    "problemName": "0698 - Partition to K Equal Sum Subsets",
    "difficulty": "Medium",
    "leetCodeLink": "https://leetcode.com/problems/partition-to-k-equal-sum-subsets/",
    "solutionLink": "../solutions/0600-0699/partition-to-k-equal-sum-subsets-medium"
  },
  {
    "problemName": "0847 -  Shortest Path Visiting All Nodes",
    "difficulty": "Medium",
    "leetCodeLink": "https://leetcode.com/problems/shortest-path-visiting-all-nodes/",
    "solutionLink": "../solutions/0800-0899/shortest-path-visiting-all-nodes-hard"
  },
  {
    "problemName": "1125 -  Smallest Sufficient Team",
    "difficulty": "Hard",
    "leetCodeLink": "https://leetcode.com/problems/smallest-sufficient-team/",
    "solutionLink": "../solutions/1100-1199/smallest-sufficient-team-hard"
  },
  {
    "problemName": "1349 - Maximum Students Taking Exam",
    "difficulty": "Hard",
    "leetCodeLink": "https://leetcode.com/problems/maximum-students-taking-exam/",
    "solutionLink": "../solutions/1300-1399/maximum-students-taking-exam-hard"
  },
  {
    "problemName": "1434 - Number of Ways to Wear Different Hats to Each Other",
    "difficulty": "Hard",
    "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-wear-different-hats-to-each-other/",
    "solutionLink": ""
  },
  {
    "problemName": "1595 - Minimum Cost to Connect Two Groups of Points",
    "difficulty": "Hard",
    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-to-connect-two-groups-of-points/",
    "solutionLink": ""
  },
  {
    "problemName": "1601 - Maximum Number of Achievable Transfer Requests",
    "difficulty": "Hard",
    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/",
    "solutionLink": ""
  },
  {
    "problemName": "1655 - Distribute Repeating Integers",
    "difficulty": "Hard",
    "leetCodeLink": "https://leetcode.com/problems/distribute-repeating-integers/",
    "solutionLink": ""
  },
  {
    "problemName": "1659 - Maximize Grid Happiness",
    "difficulty": "Hard",
    "leetCodeLink": "https://leetcode.com/problems/maximize-grid-happiness/",
    "solutionLink": ""
  },
  {
    "problemName": "1723 - Find Minimum Time to Finish All Jobs",
    "difficulty": "Hard",
    "leetCodeLink": "https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs/",
    "solutionLink": ""
  },
]

<Table 
  title="Bit Manipulation" 
  data={DPBitManipulationProblems} 
  collectionLink="https://leetcode.com/list/eeo6ays7"  
/>