Facebook Interview Question for Java Developers

Country: United States

Comment hidden because of low score. Click to expand.
of 2 vote

the 2 data structures are a list (for O(n) insertion) & a hash-map that keys the list elements.
insert requires a list traversal bcz hashmap doesnt maintain ordering, so we cannot search an adjacent item.
once we insert the item into the list, we update the hash-map so a lookup will yield the pointer to that object.
delete requires lookup using hash-map (O(1), followed by the removal of entry from hash-map (O(1) & then unlink of object from list (O(1)

- eitanbenamos March 31, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
of 2 vote

Sorted Linked List

- zw118 February 23, 2018 | Flag Reply

Add a Comment

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.


is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More


CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More