Top | MCQs on Dynamic Programming with Answers | Question 17
Last Updated :
Discuss
Comments
In dynamic programming, the time complexity of solving a problem with overlapping subproblems using memoization is:
O(1)
O(log n)
O(n)
O(n^2)
This question is part of this quiz :
Top MCQs on Dynamic Programming with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy