Aptitude
Reasoning
Verbal
Technical
AI
Exams
Search
Technical
/
Algorithms
/
Exercises
/
Exercise 6
Algorithms
medium
0/15 answered
Q1
What is the time complexity of Subset Sum using DP?
A
O(n)
B
O(n x target)
C
O(2^n)
D
O(n^2)
← Prev
1 / 15
Next →
← Exercise 5
Exercise 6 of 7
Exercise 7 →