In a nutshell
The 0/1 knapsack problem packs a weight-limited bag from a set of items — each taken whole or left behind — to maximize total value. It fills a table answering 'best value from the first i items within capacity w', building every larger answer from smaller ones so each case is solved exactly once.