Dsa
Dynamic Programming
Easy
Target Sum Subsets
You are given an array of integers and a target sum. Determine if there exists a subset of the numbers that adds up to the target. The function should return True if such a subset exists, otherwise return False. Input format: A single line containing space-separated integers for the array followed by a target integer. Output format: A boolean value (True/False). Example: Input: '3 34 4 12 5 2'
9
Output: True
Key concepts
dynamic_programmingsubsetstarget_sum
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