Which of the following should be the base case for the recursive solution of subset sum problem?
A.
if(sum==0)
return true;B.
if(sum==0)
return true;
if (n ==0 && sum!= 0)
return false; C.
if (n ==0 && sum!= 0)
return false; D.
if(sum<0)
return true;
if (n ==0 && sum!= 0)
return false; Answer: Option B
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
Related Questions on Miscellaneous on Data Structures
Which data structure is used to implement a binary heap efficiently?
A. Array
B. Linked List
C. Stack
D. Queue
In which scenario would you use a Bloom Filter?
A. For implementing a stack-based algorithm
B. To maintain a balanced binary tree
C. For efficient sorting of elements
D. To test membership in a large dataset
A. Queue
B. Stack
C. Heap
D. Array
Join The Discussion