3 ms·
There was never a pattern but it was usually something that you would learn in an upper division algorithms course that doesn't come up often in practical appli
by jedberg 7y ago
There was never a pattern but it was usually something that you would learn in an upper division algorithms course that doesn't come up often in practical applications, like Big O notation or Bloom Filters or Depth First Search.
Oftentimes they would know the topic intrinsically (like a search algorithm) but not know it's name or the typical use cases.
But like I said, usually by the next day they would be an expert.
- tenaciousDaniel 7y ago^ as a self-taught dev, this is accurate. I still don't really know Big-O notation or Bloom Filters. But it's never come up as an issue.
- jedberg 7y agoI've found that Big-O comes up any time you're wracking your brain trying to figure out why something is taking so long, and then you realize you've created something n squared with some nested loops. And bloom filters are super cool, you should read up on them. You'll find an interesting set of problems that can be solved with them. The key to remember is that if you ask a bloom filter if something is in the set, and it says no, you are guaranteed that the answer is correct, and if it says yes, it may be there, but it's super fast at giving a no answer. So if you expect that the answer will be no most of the time, a bloom filter may be a good data structure. Here is one place it comes up: on reddit (or HN) when you load a page it shows you all the stuff you've already voted on. There are usually many things you could have voted on, and chances are you haven't voted on a lot of them. So when you ask "did user X vote on item Y", the answer is usually no. Storing the votes in Cassandra, which uses a bloom filter, makes answering that query super fast.
- realtalk_sp 7y agoYou think not knowing about Bloom Filters is a 'humorous gap in knowledge'? Are you saying you worked some place that expected people to know about them and also hired self-taught engineers? I've worked at some companies people here think of as 'elite' and I can't even begin to imagine how this might occur. In fact, it smells to me a lot like the mentality of certain people at said companies who liked hazing interviewees by testing esoteric knowledge (e.g. twisted DP problems, reservoir sampling) instead of talent and potential. A part of me would have loved to see those companies implement a policy of using those interview questions on other employees, like a kind of 'random drug testing'. I imagine many would have been humbled rather quickly by such a process.
- jedberg 7y agoThe bloom filter one wasn't really one of the humorous ones. More like not knowing the name "Big O notation" despite understanding the concept. It was humorous that in all that time they never heard the term "Big O" even when using the concepts.
- deleted 7y ago[deleted]