My Practice
Ctrlk
  • Introduction
  • Chapter 1 Combination and Permutation
  • Chapter 2 Binary Search & Sorted Array
  • Chapter 3 Binary Tree
  • Chapter 4 DFS & BFS
  • Chapter 5 Linked List
  • Chapter 6 Dynamic Programming
    • Matrix 类型
    • Sequence 类型
    • Two Sequences 类型
    • Backpack
      • Problem: Backpack I
      • Problem: Backpack II
      • Problem: Backpack III
    • Optimal Solution
    • Problem 198: House Robber
    • Problem 361: Bomb Enemy
    • Problem 279: Perfect Squares
    • Problem 418: Sentence Screen Fitting
    • Optimal Solution
  • Chapter 7 Graph & Search
  • Chapter 8 Data Structure
  • Chapter 9 High Frequency
  • Post Chapter 1 String
  • Post Chapter 2 Math
  • Post Chapter 3 Array
  • Facebook
  • Amazon
  • All Chapters Summary
  • Core Java Interview Questions
  • Basics of Sorting
  • Behavior Questions
Powered by GitBook
On this page

Was this helpful?

  1. Chapter 6 Dynamic Programming

Backpack

Problem: Backpack IProblem: Backpack IIProblem: Backpack III
PreviousProblem 72: Edit DistanceNextProblem: Backpack I

Last updated 6 years ago

Was this helpful?