CodingReported in a candidate post, Sep 2020
Maximum subset sum with no shared digits
Filed under Standard Chartered
The question
Find the maximum subset sum from a set of numbers such that no two chosen elements contain the same digit. The statement was long (about 150 words) and DP based.
No write-up yet. Related questions below have one.
Related Standard Chartered questions
Collected from public candidate posts and coding forums. Updated Nov 2026.