JobsJob TrackerJob alerts

INDmoney ยท 9 questions

All 9Coding 4System Design 1Low-Level Design 1
  • Producer-Consumer Problem
  • E-commerce order system architectureSystem Design
  • Minimize debt settlement transactionsCoding
  • Indexing and Normalization
  • Sum of distances in a binary treeCoding
  • Debt MinimizationCoding
  • E-Commerce Order Placement Architecture and ER ModelLow-Level Design
  • Binary Tree Distance SumCoding
  • DBMS Indexing, Normalization, and API Optimization
โ† INDmoney questions
  1. Interview questions
  2. INDmoney
  3. Debt Minimization
Coding

Debt Minimization

Filed under INDmoney

The question

Given n people and m transactions representing debts, minimize the number of transactions required to settle all debts.

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

Related INDmoney questions

  • Minimize debt settlement transactions
  • Sum of distances in a binary tree
  • Binary Tree Distance Sum
โ† Sum of distances in a binary treeE-Commerce Order Placement Architecture and ER Model โ†’

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