[Adobe]Job scheduling problem
You are given N jobs with their start and end time mentioned.These jobs may have their timings overlapped.You have to suggest an algorithm such that maximum number of jobs can be performed in that given time interval.
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
Arrange the activities in increasing order of their finish times. Select the first activity. If any activity's starting time is greater than the finish time of last selected activity, select that activity...otherwise discard it and so on..
ReplyDelete@Anonymous yes your approach is correct.can you please post a code for others..:)
ReplyDelete