Study Plan

DSA Tracker - Data Structures and Algorithms Progress Tracker

Track your progress through 177 curated Data Structures and Algorithms problems across 16 topics. Filter by difficulty, save your progress locally, and prepare systematically for coding interviews. This DSA tracker combines the best problems from Blind 75, NeetCode 150, and Grind 75 into one comprehensive checklist.

177

Problems

73h 55m

Total time

0%

0 done

15m
15m
25m
20m
25m
35m
25m
25m
25m
20m
25m
25m
25m
25m
30m
40m
45m
20m
25m
25m
15m
10m
20m
30m
30m
10m
15m
15m
10m
15m

Data Structures and Algorithms Topics Covered

data_arrayArrays & Hashing
18
compare_arrowsTwo Pointers
8
swap_horizSliding Window
8
stacked_bar_chartStack
10
searchBinary Search
10
linkLinked List
12
account_treeTrees
18
spellcheckTries
4
filter_listHeap
8
undoBacktracking
10
hubGraphs
18
grid_onDynamic Programming
24
boltGreedy
8
timelineIntervals
6
calculateMath & Geometry
8
memoryBit Manipulation
7

What is a Data Structures and Algorithms Tracker?

A Data Structures and Algorithms (DSA) tracker is a structured tool for organizing your coding interview preparation. Instead of solving random LeetCode problems and hoping for the best, a DSA tracker gives you a curated list organized by topic so you can build skills systematically and see your progress at a glance. This tracker covers 177 problems across 16 core topics, from fundamental data structures like arrays and linked lists to advanced algorithms like dynamic programming and graph traversal.

Why use this DSA tracker?

Interview preparation without structure leads to wasted time. You solve random problems, forget patterns you practiced last week, and have no idea how much ground you have actually covered. A DSA tracker solves this by giving you a curated list organized by topic, so you can build skills systematically and measure your progress.

This tracker includes 35 Easy, 121 Medium, and 21 Hard problems totaling approximately 74 hours of practice. The problems overlap with the most popular study plans ( Blind 75, NeetCode 150, and Striver’s A2Z sheet) but goes deeper in each topic. For a comparison of the smaller lists, see our Blind 75 vs NeetCode 150 analysis.

How this Data Structures and Algorithms tracker is organized

The 177 problems are grouped into 16 topics, ordered from foundational to advanced. Arrays and hashing come first because they introduce the core operations you will use everywhere. Trees and graphs come later because they require comfort with recursion. Dynamic programming is near the end because it builds on every other technique. Each topic has enough problems to build real pattern fluency, not just surface-level exposure.

Recommended study approach

Start with Easy problems in each topic to learn the pattern, then move to Medium problems to apply it under constraints. Most coding interviews focus on Medium difficulty, so prioritize those if you are short on time.

For each problem: spend 20 minutes attempting it before looking at hints. If you cannot solve it after 30 minutes, study the solution, understand the pattern, and revisit it in 3-5 days. For more detailed timelines, see our guide on how long structured study plans take.

When you have completed enough problems to feel confident, test yourself under real conditions with a free AI mock interview. For company-specific preparation, check which topics your target employer emphasizes on our company interview questions page. Our analysis of whether study plans are enough for FAANG shows that company-specific targeting is critical.

Related study plans

Frequently Asked Questions

What is a DSA tracker?add

A DSA tracker (Data Structures and Algorithms tracker) is a tool that helps you organize and track your progress through coding practice problems. This tracker covers 177 curated Data Structures and Algorithms problems across 16 core topics, from arrays and hash maps to dynamic programming and graph algorithms.

How were these 177 problems selected?add

The problems are curated from the most commonly asked coding interview questions across top tech companies. The selection overlaps with Blind 75, NeetCode 150, and Striver's A2Z sheet, combining the best problems from each into one comprehensive Data Structures and Algorithms checklist.

Is my progress saved?add

Yes. Your progress is saved automatically to your browser's local storage. It persists across sessions and page refreshes. No account required.

What order should I solve the problems in?add

Start with Arrays & Hashing and Two Pointers. Then move to Sliding Window, Stack, and Binary Search. After that, tackle Linked Lists, Trees, and Graphs. Save Dynamic Programming and Backtracking for last. This order builds each skill on top of the previous one.

How long does it take to complete all 177 problems?add

The full set takes approximately 74 hours of solving time, or about 8-12 weeks at 1-2 hours per day. Solving 2-3 problems per day is more effective than marathon sessions. See our guide on how long NeetCode 150 takes for more detailed timelines.

How is this different from Blind 75 or NeetCode 150?add

This Data Structures and Algorithms tracker is a comprehensive 177-problem set that covers more topics in greater depth than both Blind 75 (75 problems) and NeetCode 150 (150 problems). It includes additional problems in Tries, Bit Manipulation, Intervals, and advanced Graph algorithms that are underrepresented in smaller lists. See our Blind 75 vs NeetCode 150 comparison for more details.

Is this DSA tracker free?add

Yes, completely free. The full 177-problem list, progress tracking, difficulty filters, and all features are free with no account required. Your progress saves locally in your browser.

Tracking problems is step one

Solving them under pressure is step two. Practice with an AI interviewer that asks follow-ups, gives hints, and scores your solution.

Try a free mock interviewarrow_forward

Related reading