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) Correct Answer Incorrect Answer
    B O(log n) Correct Answer Incorrect Answer
    C O(n) Correct Answer Incorrect Answer
    D O(n^2) Correct Answer Incorrect Answer

    Solution

    O(n)

    Practice Next

    Relevant for Exams: