It depends what you're describing as algorithm heavy. Do you have any examples? I've seen people arguing you shouldn't have to know how a linked list, hash tab

It depends what you're describing as algorithm heavy. Do you have any examples? I've seen people arguing you shouldn't have to know how a linked list, hash table or binary tree work. I think every programmer should know these ones. I think having to describe how quicksort works is getting too much, but knowing e.g. some search tree and graph algorithms might be appropriate depending on your domain.