Career Tracks
Exams
MCQ
Companies
Opportunities
Pricing
MCQ Practice
Data Structures
Dynamic Programming
Question
Medium
What is the 0/1 Knapsack problem's time complexity using DP?
A
O(n)
B
O(nW) where W is capacity
C
O(2^n)
D
O(n log n)
Show Answer
← Back to Dynamic Programming questions
