JobsJob TrackerJob alerts

ThoughtSpot ยท 18 questions

All 18Coding 13System Design 3Low-Level Design 1
  • Design a rule engineLow-Level Design
  • Generic workflow management system (like AWS Step Functions)System Design
  • Topological sort variationCoding
  • Sorted Linked List to Balanced BSTCoding
  • Minimum Throws for Ludo BoardCoding
  • Longest Balanced ParenthesesCoding
  • Operations on Very Long IntegersCoding
  • Minimum Moves in Parking LotCoding
  • Coin Change with Powers of TwoCoding
  • Design Efficient Versioning SystemSystem Design
  • Infinite ScrollingCoding
  • Word SearchCoding
  • Design a chat serviceSystem Design
  • Technical discussion
  • Minimum degree of a connected trio in a graphCoding
  • Snake and Ladder problemCoding
  • Subarrays with K different integersCoding
  • Minimum sum partitionCoding
โ† ThoughtSpot questions
  1. Interview questions
  2. ThoughtSpot
  3. Coin Change with Powers of Two
Coding

Coin Change with Powers of Two

Filed under ThoughtSpot

The question

Find the number of distinct ways to form a given total k using only numbers that are powers of 2, where order does not matter.

No write-up yet. Related questions below have one.

Related ThoughtSpot questions

  • Topological sort variation
  • Minimum Throws for Ludo Board
  • Operations on Very Long Integers
  • Minimum Moves in Parking Lot
  • Infinite Scrolling
โ† Minimum Moves in Parking LotDesign Efficient Versioning System โ†’

Collected from public candidate posts and coding forums. Updated Nov 2026.