Member-only story
LeetCode Hard : Minimum Difficulty of a Job Schedule in C# and Typescript
This article explores the application of Dynamic Programming paradigm to solve one of the most frequently asked questions in technical interviews called ‘Minimum Difficulty of a Job Schedule’.
It is a LeetCode Hard problem and for more info on problem description please follow the below link
I will be approaching this problem in step by step fashion without directly jumping into the dynamic programming solution. Throughout this process we will see how to approach any DP problem in an intuitive way, construct a recursive solution for it and then eventually optimise it using Memoization to arrive at the final solution.
Step 1: How to identify if a problem is a DP problem?
Identifying whether a problem can be solved using dynamic programming (DP) can sometimes be challenging, but here are a few key characteristics to look for that indicate a problem might be suitable for a dynamic programming approach:
