4 ms·
you don't need to know algorithms with somone's name on it for an interview but there are few exceptions, 1. Dijkstra's 2. Kadane's 3. Bellman ford - negativ
by dominotw 6y ago
you don't need to know algorithms with somone's name on it for an interview but there are few exceptions,
1. Dijkstra's
2. Kadane's
3. Bellman ford - negative edges
- ivanhoe 6y agoIMHO all you need to know is to recognize a certain category of problems and remember that there is an appropriate algorithm for it - and if can you recall the name even better, will save you some time googling, but it's not that important. After consulting the documentation and if you previously learned it in a school/course, you'll be able to implement it in pretty much the same time as someone who knows how to draw it on a whiteboard from the top of their head.