How to actually use this
Order of operations, July → December. Work the topics top to bottom — they're already sequenced by dependency, not by difficulty. Arrays → Hashing → Two Pointers & Sliding Window → Binary Search → Strings → Stacks → Linked Lists → Recursion → Greedy → Trees → BST → AVL → Heaps → Graphs → DP → Tries → Design.
The starred core set is the contract. If December arrives and you've done nothing else on this page, the starred set alone gives you a real shot at Amazon's OA and a good shot at SAP and Oracle. Everything unstarred is depth, and depth is what wins the interview after the OA has already let you in.
Solve, don't read. A problem is only "AC" if you wrote it, ran it, and it passed without looking at the editorial. If you peeked, mark it Revisit and come back in a week. The Revisit column is the most useful thing on this page — spaced repetition is what separates 300 problems solved from 300 problems retained.
Timed mocks from September. Two 90-minute sets a week: 2 mediums, clock running, no editorial. Solving a medium in 25 minutes and solving it in 70 are different skills, and only one of them is being tested.
Say the complexity out loud, every single time. Amazon's reported pattern is interrogating every line — why this structure, what's the complexity, can you do it without that structure. If you practise silently for six months you will be bad at the only version of this that counts.
Links point to LeetCode where the problem exists there, and GeeksforGeeks otherwise. GfG has reshuffled some URLs over the years; if one 404s, search the problem name — the problem is real, the path may have moved.