Question

What is the time complexity of a dynamic programming

solution for a problem with "n" subproblems and each subproblem taking "O(1)" time to solve?

A O(1)

B O(log n)

C O(n)

D O(n^2)

Practice Next

More IT Networking Questions

Solution