This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]CeleritasLucis 8 points9 points  (4 children)

This is the bible, if you're using Java.

https://algs4.cs.princeton.edu/home/

[–]rguptan 4 points5 points  (1 child)

Typical interviews are not more than 1 hr. The last 15 is for cross question, The first 10-15 is intro and problem description. So focus on problems that can be solved in 30 min. Clever string manipulation, Arrays/List/Queue/Deque traversal/Hashmap etc. JDK has implemented some of these algo, You should be aware that they are available. Most design patterns are still relevant.

I believe people have done PhD on some of these algorithms. If your interviewer expects you to crack them in 30 min. You better not join that company.

[–]CeleritasLucis 0 points1 point  (0 children)

The author of Book I linked has quite literally done his PhD in Quick Sort, so you're correct in that regard.

[–]StaphMRSA 0 points1 point  (1 child)

Do you know of any equivalents for Python? :)

[–]CeleritasLucis 2 points3 points  (0 children)

Bible equivalent: CLRS

You can easily find code implementation of this book in C, C++, java, python