Earlier quoted context omitted.
The problem is that the candidate has been assured that they will be asked 'leet' code questions where solving the problem isn't enough, they will also be asked about O notation and how the code can be optimized and whether to use memoization or recursion. This is what the books will tell you, this is what YouTube will tell you, this is what 'helpful' recruiters will tell you. And IME this is what most interviewers h…
I will ask all of those questions. But I don't expect perfect answers. You should at least know what big O is. I would really like it if you can tell an O(n^2) algorithm from a linear one. (That is often really important in real-world code). I would like you to consider different ways you can optimize the code. I don't expect you to quickly crank out a novel optimal algorithm. But I like to see that you can think abo…
> which is to make sure the candidate can actually write code, like at all
It's also still a terrible approach and only gets leet code crammers.