Riverbed Technology interview question
running time for binary search using linked list
Interview Answer
Anonymous
30 Oct 2012
Can't do it in O(n) or O(log n) as you need to seek to the end at least once. You will need a skip list.
running time for binary search using linked list
Anonymous
Can't do it in O(n) or O(log n) as you need to seek to the end at least once. You will need a skip list.
Check out your Company Bowl for anonymous work chats.