Exclusive Execution Time of Functions
Try to solve the Exclusive Execution Time of Functions problem.
We'll cover the following
Statement
We are given an integer number, n
, representing the number of functions running in a single-threaded CPU, and an execution log, which is essentially a list of strings. Each string has the format {function id}:{"start" | "end"}:{timestamp}
, indicating that the function with function id
either started or stopped execution at the time identified by the timestamp
value. Each function has a unique ID between and . Compute the exclusive time of the functions in the program.
Note: The exclusive time is the sum of the execution times for all the calls to a specific function.
Constraints:
-
n
-
logs.length
-
function id
n
-
timestamp
- No two start events and two end events will happen at the same
timestamp
. - Each function has an
end
log entry for eachstart
log entry.
Examples
Each function is identified in the logs by a function id
. Each log entry is formatted in the following way:
{function id}:{"start" | "end"}:{timestamp}
Create a free account to view this lesson.
Continue your learning journey with a 14-day free trial.
By signing up, you agree to Educative's Terms of Service and Privacy Policy