GamifiedGamified challengesPracticeRaceLeaderboardPricing

Learn data structures by watching them move, then doing it yourself. Press M anytime to toggle sound.

A product of Amypo Technologies, Coimbatore.

Learn

  • All topics
  • Learning path
  • How it works
  • About dotprep

Practice

  • Practice arena
  • Daily challenge
  • Gamified challenges
  • Race mode
  • Leaderboard

Interview prep

  • Java interview
  • Coding questions
  • Company questions
  • System design
  • Jobs & careers

You

  • Dashboard
  • Settings
  • Pricing
  • Create account

© 2026 dotprep

Content last updated 20 November 2026

GamifiedGamified challengesPracticeRaceLeaderboardPricing
Log inStart free
Gamified challengesKnapsack Loot

Gamified challenge · 2-D dynamic programming

Knapsack Loot

Item i weighs weights[i] kg and is worth values[i]. Your bag holds at most cap kg. Each item is taken whole or not at all, and there is only one of each.

Write bestValue(weights, values, cap) (Python: best_value) that returns the largest total value you can carry. For weights [1, 3, 4, 5], values [1, 4, 5, 7] and cap = 7 the answer is 9 (the 3 kg and 4 kg items).

There are at most 12 items, weights and values are positive, cap is at most 20, and an empty list or a bag with no room gives 0.

Sign in to play Knapsack Loot

This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.

Sign in with Google

or log in with email · create an account