Opening your DSA sheet
Progress is saved as you study.
The Blind 75 list, plus what thita adds:
NeetCode is a trademark of its owner; thita is not affiliated with or endorsed by NeetCode.
Opening your learning path
Progress is saved as you study.
DSA practice list
The Blind 75 list, practised on thita. Every problem is grouped under the 99 DSA patterns it teaches, with NeetCode's topic kept as a tag, so you can see which technique each problem is drilling instead of only which data structure it uses.
Each problem opens in an editor in the browser, where you run your code against the problem's test cases. Every problem on this list that is live on thita runs in all 6 of Python, C++, Java, JavaScript, Go and C#. When a pattern feels solid, take it into an AI mock interview: you solve a problem out loud, the interviewer runs your code and asks the follow-up questions a real one would.
All 75 problems are on thita.
Last updated
Families and patterns follow the DSA patterns sheet. The tag on each problem is its NeetCode topic.
Six blocks in NeetCode's topic order. Solve each problem, then write down the pattern in one line. On the last day of each week, re-solve two problems from memory before starting the next block.
Week 1: Arrays, two pointers, sliding window and stacks (16 problems)
Hash maps for lookups, the two pointer moves, when a window grows and shrinks, and the monotonic stack.
Week 2: Binary search and linked lists (8 problems)
Searching on the answer, not just the array, and pointer surgery on lists without losing a node.
Week 2: Trees, tries and heaps (15 problems)
Recursive DFS that returns something useful, level-order BFS, prefix trees, and top-k with a heap.
Week 3: Backtracking and graphs (9 problems)
Choose, explore, un-choose; grid BFS and DFS; union-find; topological sort; Dijkstra and minimum spanning trees.
Week 3: Dynamic programming (12 problems)
State, transition and base case, written out loud before any code; then the 2-D grid and string tables.
Week 4: Greedy, intervals, math and bits (15 problems)
Proving a greedy choice, sorting intervals by start, matrix walks, and XOR tricks.
NeetCode's version swaps this problem out; it is not counted in the 75.
NeetCode is a trademark of its owner; thita is not affiliated with or endorsed by NeetCode.
Two 90-day roadmaps
The roadmaps turn these 99 patterns into a 90-day plan: what to learn and solve each day, with theory, practice and mock interviews built in. College adds OS, DBMS and Computer Networks; Professional adds LLD and HLD.
Opening your learning path
Progress is saved as you study.
