|
|
|
|
|
by iKevinShah
1667 days ago
|
|
I was recently appearing for an interview and a fintech org did this. Wow that interview was so pleasant. I did not have to worry about forgetting where algorithm X is O(N^2) or O(2^N). and since they asked all about my experiences and what was written, I was able to articulate more than I would in usual tech rounds. Although we couldn't agree on location for personal reasons, that is an org which I would recommend specially as they really wanted to know the candidate's behavior and not whether he could remember some implementations which they're mostly never going to use. |
|
I find it absolutely shocking that you would consider it trivial knowledge whether an algorithm is low-degree polynomial or exponential. The pendulum is swinging way too far to the other end. If you can't remember/figure out whether the code you're writing is O(N^2) or O(2^N) you should not be writing code professionally.