Data Structure
Java
Python
HTML
Interview Preparation
- Interview Prep
- Tutorials
- Tracks
Top | MCQs on Dynamic Programming with Answers | Question 23
Last Updated :
Discuss
Comments
The time complexity of solving the 0-1 Knapsack Problem using dynamic programming with a bottom-up approach (tabulation) is:
O(n)
O(n log n)
O(n * capacity)
O(n * capacity^2)
This question is part of this quiz :
Dynamic Programming QuizTags:
Share your thoughts in the comments
GeeksforGeeks