Domanda di colloquio di Amazon
2.Prove that tree is BST. 3. Ransom note problem - prepare a note(array) from a given magazine(array). 4. Keep track of history of users of Amazon site in pairs of 3 pages that they have consecutively visited.
2.Prove that tree is BST. 3. Ransom note problem - prepare a note(array) from a given magazine(array). 4. Keep track of history of users of Amazon site in pairs of 3 pages that they have consecutively visited.