Dynamic programming masterclass / Sweet Codey, Rohit Jain Suresh Gandhi.

Format:

Video

Contributor:

Codey, Sweet, instructor.

Gandhi, Rohit Jain Suresh, instructor.

Packt Publishing, publisher.

Language:

English

Subjects (All):

Dynamic programming.

Physical Description:

1 online resource (1 video file (07 hr., 58 min.)) : sound, color.

Edition:

[First edition].

Place of Publication:

[Birmingham, United Kingdom] : Packt Publishing, 2025.

Summary:

In this 8-hour course, you will master dynamic programming (DP) techniques to solve computational problems efficiently. From basic concepts like recursion and memoization to advanced problems like the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS), this course provides hands-on experience in solving real-world challenges. What I will be able to do after this course Understand the core principles of dynamic programming and its real-world applications Solve problems like the Staircase and Rod Cutting problems using DP techniques Master advanced DP patterns such as Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) Apply DP to matrix-based problems like Unique Paths and Min Falling Path Sum Implement dynamic programming in tree-based problems, such as the House Robber in Binary Tree Course Instructor(s) Sweet Codey is a team of passionate educators focused on simplifying complex concepts. Rohit Jain, an experienced SDE-2 at Amazon, specializes in system design, algorithms, and data structures. Suresh Gandhi, with expertise at Microsoft and Amazon, excels in coding, system design, and cloud architecture. Who is it for? This course is ideal for developers, students, and anyone looking to master dynamic programming techniques for solving computational problems efficiently. Basic programming knowledge is required, but no prior experience with DP is necessary.

Notes:

OCLC-licensed vendor bibliographic record.

ISBN:

1-80742-019-1

OCLC:

1565466439