📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

    Question

    For which problem is dynamic programming NOT generally

    an applicable technique because it lacks overlapping subproblems?
    A Fibonacci numbers naive recursion Correct Answer Incorrect Answer
    B Matrix chain multiplication Correct Answer Incorrect Answer
    C QuickSort Correct Answer Incorrect Answer
    D Longest common subsequence Correct Answer Incorrect Answer
    E Knapsack (0/1) Correct Answer Incorrect Answer

    Solution

    QuickSort is divide-and-conquer with independent subproblems; it doesn't exploit overlapping subproblems for DP (except in pathological reuse cases).

    Practice Next
    More Algorithms Questions
    ask-question