Dsa
Recursion
Hard
Subset Sum Problem
Given a list of integers and a target sum, determine if there is a subset of the list that adds up to the target sum. Print 'YES' if such a subset exists, otherwise print 'NO'.
Example Input:
[1, 2, 3, 4]
5
Example Output:
YES
Key concepts
recursiondynamic programmingcombinatorial
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now