ajrules2105
BAN USER
Questions (2)
Reputation 70
- 1of 1 vote
Answerswrite a merge sort algorithm to sort a file which can't be loaded into the memory. Assume you can only load 10 items in the memory at a time and there are 100 items to sort.
- ajrules2105 in United States for big data| Report Duplicate | Flag | PURGE
Intel Software Developer Algorithm - 4of 4 votes
Answersin a tree any root can have any number of children. Every node has an integer value. Find the maximum length on consecutive number sequence anywhere in the tree. For example if root is 2 and one child is 3, its child is 4 its child is 6 then max length will be 3. I was able to write the code the find of one sequence but when one sequence ends and other starts I was not able to handle that case. I think its hard to do by recursion. Is there any other trick or algorithm for this??
- ajrules2105 in United States| Report Duplicate | Flag | PURGE
Amazon SDE1 Trees and Graphs
Page:
1
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.