Data-Structres Job Sequencing using Dynamic Programming Given a 'n' no of jobs with their -> start time --> end time(deadline) --> profit assosciated find the max profit that one can make and also find the sequence of jobs. Approach - Dynamic Programming.