Basic math required for interviews?
I've had different interviewers going too deep into Mathy parts of CS.
Design your own hash table, was able to breeze thru most parts. Then got stuck at generating a good hash function, avoiding collisions and taking into account the position of each character input. I didn't remember the specific Mathy part of this.
Given a tree that is always complete, I represented the tree as an array and jump to any node on the tree by knowing the number of nodes for each level. I forgot the algebra equation to count these nodes from n to m via levels. It was a strange tree structure.
If a candidate was able to get that far and just didn't remember an implementation detail. Is it acceptable and could just wave your hand to these small things or do you ding them for it? The interviewer wasn't impressed and expected me to know all these Mathy portions. Even when I have the best space and runtime.
I usually wave my hand pass these little things because they don't show how good of a programmer you are. These are Google-able items. What you think?