- reading an algos book (if you haven’t) might be helpful: Aho et al., CLRS, Sedgwick
- on LC, start with easy algorithm problems and sort by Acceptance in descending order. As you work the problem, talk aloud about your thought process and what you’re doing and where you’re headed. This is good practice for narrating your work during an interview
- maybe set a timer so if you’re truly stuck then you can pull up the solution and study it. Next time you see a similar problem or class of problem, you’ll be ready
- if you have a particular particular field or area you would like to work in, determine what kinds of algos or data structures might be particularly pertinent. For example, if you might work with storing and looking up strings, dig into trie structures. Or maybe it would be more suitable to dig into branch and bound strategies. Try to tailor what you’re learning to what you would find useful