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 challengesTreasure Bag Subsets

Gamified challenge · Backtracking

Treasure Bag Subsets

items holds the treasures, each a different number. A bag is any selection of them, each treasure taken at most once, and the empty bag counts too.

Write subsets(items) that returns every possible bag exactly once. The bags, and the treasures inside each, may come in any order, so [3, 1] and [1, 3] are the same bag.

Example: items = [1, 2, 3] gives the 8 bags [[], [1], [1, 2], [1, 2, 3], [1, 3], [2], [2, 3], [3]].

Sign in to play Treasure Bag Subsets

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