โ† Standard Chartered questions
CodingTrickyReported in a candidate post, Aug 2020

Knockout matches count and Max subset-sum with distinct digits

Filed under Standard Chartered

The question

Solve two coding problems: first, find the total number of matches played in a knockout tournament for a given number of teams; second, find the maximum subset-sum such that no two elements share the same digits using Dynamic Programming and Bitmasking.

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

Related Standard Chartered questions

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