I think that "name-dropping" of something that you don't really know is pretty dangerous strategy in interview.<p>From other point of view, why not to excercise an idea? :)<p>KD-trees and other spatial data structures
"True time" when talking about consistency
Fenwick tree for right problem
Python and C++ standard libraries should include the prefix trie, suffix array, Bloom filter, T/Q Digest, and Count-min sketch. Also generic dense/sparse matrix-matrix multiply, and lazy/streaming algorithm interfaces to operate on network supplied data.
I have just one thing to say - never ever "name-drop" a data structure in a coding interview unless you are going to use it in your solution. It doesn't add anything to your interview but has the potential to get you in trouble.<p>The title is extremely ill-chosen for an otherwise acceptable blog post. The post itself really has nothing to do with tech interviews.
There is what seems to be a repeated typo in footnote 1: "You take the length N. N % M (pronounced N modulo M) gives you a value Q such that 0 ≤ Q < N." I assume the author meant taking M % N here, and later on.
Who still uses prefix tries? I thought most uses have long been replaced by ternary search trees. No one wants to waste memory storing 26 pointers at each node.
Once I encountered this curious recursion:'<p>Here sounds infinite loop maybe, but it should finishing calling each other (a calling b that calls a that calls b again...infinite...)<p>But when there is a Top maximum Parent that is the top of the parent child pyramid (like a html Body "div", I mean, the one that contains all others") It should stop...well<p>def a<p>self.insert //something to make it child of the parent, like a html structure maybe<p>b //call the second method, the b method below<p>end<p>def b<p>self.insert //same here, same logic//<p>a //call the first method, the a method above<p>end<p>thisHtmlDiv.a //crazy example<p>So the subject on which you call the method will be added in all the hierarchy chain of the parent child pyramid.