NeetCode 150

NeetCode 150 is the list most people mean when they say "the LeetCode list". It extends Blind 75 with the coverage Blind 75 is thin on -- greedy, advanced graphs, and a proper split between one- and two-dimensional DP -- and every problem has a video solution, which is why it has largely displaced the original.

Use it if you already know what a hash map and a binary tree are, and you want interview coverage rather than a CS course. Do not use it as your first exposure to data structures; Striver's A2Z is the better start there.

The categories map almost one-to-one onto this course's phases, so you can work the sheet and read the matching pattern page side by side.

Track it here

Your progress is shared with every other list on this site -- tick a problem off here and it is ticked off on its pattern page and in every other sheet that includes it. That is the point of tracking them in one place.

Self-check

quizCheck yourself

1. How does NeetCode 150 relate to Blind 75?

   AIt removes DPBIt is unrelatedCIt extends it with greedy, advanced graphs and a proper 1-D/2-D DP splitDIt is a subset
   Show answer

   C — It extends it with greedy, advanced graphs and a proper 1-D/2-D DP split — That extra coverage plus video solutions is why it largely displaced the original.

2. Should NeetCode 150 be your first exposure to data structures?

   AYes, if you know PythonBOnly for treesCYesDNo, Striver's A2Z is the better start there
   Show answer

   D — No, Striver's A2Z is the better start there — NeetCode assumes you know what a hash map and a binary tree are.