Scribd Logo
Upload

Welcome to Scribd!

  • 39 views

    DP-2, Problemset: Questions

    Uploaded by

    Kartik Anand
    This document provides a dynamic programming problemset and recommendations for learning dynamic programming. It lists 8 problems of varying difficulties from sources like LeetCode and SPOJ and encourages readers to work through them to strengthen their dynamic programming skills. Additional advice includes reading a TopCoder tutorial on dynamic programming and focusing first on easier path problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    DP-2, Problemset: Questions

    Uploaded by

    Kartik Anand
    39 views2 pages
    This document provides a dynamic programming problemset and recommendations for learning dynamic programming. It lists 8 problems of varying difficulties from sources like LeetCode and SPOJ and encourages readers to work through them to strengthen their dynamic programming skills. Additional advice includes reading a TopCoder tutorial on dynamic programming and focusing first on easier path problems.

    Original Description:

    dynamic programming tutorial

    Original Title

    Lessonplan-2

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides a dynamic programming problemset and recommendations for learning dynamic programming. It lists 8 problems of varying difficulties from sources like LeetCode and SPOJ and encourages readers to work through them to strengthen their dynamic programming skills. Additional advice includes reading a TopCoder tutorial on dynamic programming and focusing first on easier path problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    39 views2 pages

    DP-2, Problemset: Questions

    Uploaded by

    Kartik Anand
    This document provides a dynamic programming problemset and recommendations for learning dynamic programming. It lists 8 problems of varying difficulties from sources like LeetCode and SPOJ and encourages readers to work through them to strengthen their dynamic programming skills. Additional advice includes reading a TopCoder tutorial on dynamic programming and focusing first on easier path problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    DP-2, Problemset

    Please solve the DP-1 Problemset before attempting this one


    CS101

    QUESTIONS
    I also strongly advise you guys to read up on DP from the topcoder tutorial, its a bit
    lengthy but pretty helpful https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-pro
    gramming-from-novice-to-advanced/

    1. https://leetcode.com/tag/dynamic-programming/
    - A set of easy DP questions,
    wont take much time and will help clearing the basics. Solve the Easy and
    Medium questions, in interviews questions like this are asked.
    2. TRIKA -
    http://www.spoj.com/problems/TRIKA/

    I gave this problem in the last problemset too, after explaining the path based
    problems I guess you shouldnt have much of a problem doing this question.

    3. AMR11A -
    http://www.spoj.com/problems/AMR11A/
    Harder path problem.

    4. MARTIAN -
    http://www.spoj.com/problems/MARTIAN/
    Pretty difficult. Another 2D DP question.

    5. ACPC10D -
    http://www.spoj.com/problems/ACPC10D/
    Easy path problem.

    6. TRT -
    http://www.spoj.com/problems/TRT/

    Dont get fooled by the comments, this is a hard question.

    7. TWENDS -
    http://www.spoj.com/problems/TWENDS/
    Decent question that requires strong basics.

    8. MAIN74 -
    http://www.spoj.com/problems/MAIN72/

    A similar question when compared to the Knapsack problem.

    You might also like