Minimum Difficulty of a Job Schedule | Bottom Up | Amazon | Leetcode 1335

Channel:
India codestorywithMIK
Subscribers:
92,300
Published on ● Video Link: https://www.youtube.com/watch?v=TjyYTng3f5A


Duration: 28:27
3,207 views
127

Whatsapp Community Link : https://whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 79th Video of our Playlist "Dynamic Programming : Popular Interview Problems".
In this video we will try to solve a very good DP problem - Minimum Difficulty of a Job Schedule (Leetcode 1335).
We had already solved it using Recursion + Memoization in the 1st video of this playlist.
In this video, we will solve it using Bottom Up simply derived from Recursive Code.

I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY.
We will do live coding after explanation and see if we are able to pass all the test cases.
Also, please note that my Github solution link below contains both C++ as well as JAVA code.

Problem Name : Minimum Difficulty of a Job Schedule
Company Tags : AMAZON, TIKTOK, UBER
My solutions on Github(C++ & JAVA) : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Minimum%20Difficulty%20of%20a%20Job%20Schedule.cpp
Leetcode Link : https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule/

My DP Concepts Playlist : https://youtu.be/7eLMOE1jnls
My Graph Concepts Playlist : https://youtu.be/5JGiZnr6B5w
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK


Approach Summary : The code initializes a 2D array t to store intermediate results and iteratively fills it in a bottom-up manner. The base case is when there is only one day, and the difficulty is set to the maximum difficulty among the remaining jobs. The dynamic programming table is then built by considering all possibilities for each day and minimizing the overall difficulty.

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

✨ Timelines✨
00:00 - Introduction

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge#leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa



Other Videos By codestorywithMIK


2024-01-05Count possible ways to construct buildings | Recursion | Memoization | Bottom UP | GFG POTD
2024-01-05Longest Increasing Subsequence | Patience Sorting | DP Concepts & Qns-17 | Leetcode 300
2024-01-03Minimum Number of Operations to Make Array Empty | Explained with Reasons | Greedy | Leetcode 2870
2024-01-03How I spent my Birthday 😇❤️🎂
2024-01-02Number of Laser Beams in a Bank | Clear Explanation | Dry Run | Amazon | Leetcode 2125
2024-01-01Convert an Array Into a 2D Array With Conditions | With Dry Run | Leetcode 2610
2024-01-01Array Pair Sum Divisibility Problem | Brute Force | Optimal | GfG POTD
2023-12-31Consistency is the Key. #codestorywithMIK
2023-12-30Largest Substring Between Two Equal Characters | 3 Ways | C++ | JAVA | Leetcode 1624
2023-12-29Redistribute Characters to Make All Strings Equal | 3 Ways | C++ | JAVA | Leetcode 1897
2023-12-29Minimum Difficulty of a Job Schedule | Bottom Up | Amazon | Leetcode 1335
2023-12-28String Compression II | Recursion | 2-D Memoization | Leetcode 1531
2023-12-28String Compression II | Recursion | Memo | Leetcode 1531
2023-12-27Thank you for the Trust. 14000 Subscribers. #codestorywithMIK #subscribe #coding #dsa #family
2023-12-26Anti Diagonal Traversal of Matrix | Simplest Approach | GfG POTD
2023-12-26Number of Dice Rolls With Target Sum | Recursion | Memo | Bottom Up | Leetcode 1155
2023-12-25Minimum Cost to Convert String I | Weekly Contest 377 | 2 Approaches | Leetcode 2976
2023-12-24Decode Ways | Recursion | Memo | Bottom Up | Leetcode 91
2023-12-23Minimum Changes To Make Alternating Binary String | 2 Approaches | MICROSOFT | Leetcode 1758
2023-12-22Path Crossing | Leetcode 1496
2023-12-21Maximum Score After Splitting a String | 3 Approaches | Leetcode 1422