> How much time do you invest in reviewing algorithms that you haven't used in a while? None. I don't want to work at companies that only hire people who memo

> How much time do you invest in reviewing algorithms that you haven't used in a while? None. I don't want to work at companies that only hire people who memorized Red-Black trees. If you don't remember, just say so. Try to reason about it, stating what you do know and can calculate on the back of an envelope. (I know quicksort is faster than N^2). You don't even need a google search to look up the details on an algorithm. Knowing when to use what algorithm is far more important. In other words, it's just like they said in school: Show your work. Tell us how you arrived at your answer. Tell us how confident you are in the answer. If you do want to practice, open a (non-highlighting) text editor and code something trivial. See if you can get it to compile on the first time. Repeat with other small problems. (This is how we did it in the old days.) > What are the best prep resources? Your stories. Passion projects you've completed. Interesting debugging techniques. What you did when the answer was not in the documentation.