Amazon Interview Report
- 0of 0 votes
AnswerFind the final states of a n-nary tree
- ajay.raj March 02, 2018 in United States
each node has three states, 0,1,2.
Require that if all child nodes are 2,
The parent node is also 2.
All child nodes are 0, the parent node is 0, and the rest are all 1s.| Report Duplicate | Flag | PURGE
Amazon Backend Developer - 0of 0 votes
AnswersGiven two functions, start (id, start_time), stop (id, time),
- ajay.raj March 02, 2018 in United States
Respectively, to the id assignment start and end time, gave a bunch of such operations (to ensure that the operation start small id first appeared,
And each id last have start_time and stop_time), press the start order to print the corresponding id, start_time, stop_time,
Requirements of space complexity as small as possible,
e.g., start (1, 1), start (2, 2), stop (2, 3), start (3, 4), stop
The print order is (1,1,6), (2,3,2), (3,4,5) # (id, start_time, end_time).| Report Duplicate | Flag | PURGE
Amazon Backend Developer
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.