πŸ“–
LeetCode
search
⌘Ctrlk
πŸ“–
LeetCode
  • Introduction
  • Array
  • Basic Knowledge
  • Binary Search
  • Binary Tree
  • Bit
  • Data Structure
  • Divide Conquer
  • Dynamic Programming
    • 1.position
    • 2.sequence
    • Backpack Problem
      • 1155.Number-of-Dice-Rolls-With-Target-Sum
      • 322.Coin-Change
      • 416.Partition-Equal-Subset-Sum
      • Backpack Ii
      • Backpack Iii
      • Backpack
    • εŒΊι—΄εž‹
    • ηŸ©ι˜΅εζ ‡
    • 1049.Last-Stone-Weight-II
    • 1140.Stone-Game-II
    • 1235.Maximum-Profit-in-Job-Scheduling
    • 1320.Minimum-Distance-to-Type-a-Word-Using-Two-Fingers
    • 1406.Stone-Game-III
    • 774.Minimize-Max-Distance-to-Gas-Station
    • Longest Arithmetic Sequence
  • Graph Search
  • Linked List
  • Matrix
  • Mergesort
  • Numbers
  • Other
  • Permutation And Combination
  • Queue
  • Sort Algorithm
  • Stack
  • String
  • Toposort
  • Trie Tree
  • Two Pointers
  • Union Find
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Dynamic Programming

Backpack Problem

1155.Number-of-Dice-Rolls-With-Target-Sumchevron-right322.Coin-Changechevron-right416.Partition-Equal-Subset-Sumchevron-rightBackpack Iichevron-rightBackpack Iiichevron-rightBackpackchevron-right
PreviousMinimum Adjustment Costchevron-leftNext1155.Number-of-Dice-Rolls-With-Target-Sumchevron-right

Last updated 4 years ago