Maximum Profit in Job Scheduling -(Classic DP): Explanation ➕ Live Coding

Channel:

codestorywithMIK

Subscribers:

92,300

Published on November 26, 2022 5:57:33 AM ● Video Link: https://www.youtube.com/watch?v=LL0tVxlAeV4

Duration: 27:50

1,852 views

60

This is the 5th Video on our Dynamic Programming (DP) Playlist.
In this video we will try to solve a very good and interesting Problem "Maximum Profit in Job Scheduling".

We will see how we come up to Recursion+Memoization approach
We will do a separate video on "Bottom Up DP" for this Problem later.

We will do live coding after explanation and see if we are able to pass all the test cases.

Problem Name : Maximum Profit in Job Scheduling
Company Tags : NA
My solutions on Github : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Maximum%20Profit%20in%20Job%20Scheduling.cpp
Leetcode Link : https://leetcode.com/problems/maximum-profit-in-job-scheduling/


My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/channel/UCaw58edcO3ZqMw76Bvs0kGQ



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

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish