Amazon.com
3.4 of 5 2,817 reviews
www.amazon.com Seattle, WA 5000+ Employees

Amazon.com Summer Software Development Engineer Intern Interview Question

"Binary Tree level order traversal. In-order traversal a BST tree that each node points to its parent and all leaves link to each other(SLL). Find the last k fibonacci numbers that are smaller than n."
Add Tags [?]
Answer Flag Question

Part of a Summer Software Development Engineer Intern Interview Review - one of 4,156 Amazon.com Interview Reviews

To comment on this question, Sign In with Facebook or Sign Up


Amazon.com – Why Work for Us?

Not ready to apply yet? Click here to join our Talent communities, where you can learn more about us and stay up-to-date with Amazonian opportunities! Full Overview

Provided by employer [?]

Tags are like keywords, helping to categorise interview questions that have something in common.

Glassdoor is your free inside look at Amazon.com interview questions and advice. All interview reviews are posted anonymously by Amazon.com employees and interview candidates.