2 ms·
No, it's not. You do not need to learn how to analyze algorithmic complexity from a theoretical point of view, which would be very math-heavy. But a college/u
by caspper69 7y ago
No, it's not.
You do not need to learn how to analyze algorithmic complexity from a theoretical point of view, which would be very math-heavy.
But a college/university-level mathematics / comp-sci course in algorithms & data structures, usually only a 3 credit, 200-level course, isn't really asking too much.
Then you'd know why your O(n^2) algorithm sucks on any dataset larger than a toy without having to be scolded.
There's 10,000 shades of gray between not knowing shit other than sort() and having a PhD. Use some common sense.
- abj 7y agoThen it would be fine if all these interviews asked was, "Why does this code with a O(n^2) algorithm suck?" People seem to have more of an issue when the interviews seem to blow right past that into leetcode hards.
- caspper69 7y agoI don't disagree with your statement at all. But I do disagree with the statement I was replying to.