← Microsoft questions

Subset Sum Problem

Filed under Microsoft · Also reported at Grofers, Morgan Stanley, Oracle, PayPal, Power2SME, Royal Bank of Scotland (RBS), Samsung, Toppr

Given an array of non-negative integers nums and a target integer target, determine if there exists a non-empty subset of nums whose elements sum up exactly to target.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

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