Nishant Chahar (ex-SDE, Microsoft)
Curated by Microsoft ex-SDE Nishant Chahar, this sheet filters 151 must-do questions from a pool of 450+ to help you revise and strengthen concepts across Arrays, Two Pointers, Binary Search, DP, Graphs, and more — all in just 45 days(3 questions/day). Perfect for internship & placement prep.
0%
0/151
Overall progress
0 / 151
0/49
Easy
0/65
Medium
0/37
Hard
There is no PDF here, and you do not need one. All 151 problems are listed in full on this page, free and without an account — and unlike a PDF the list remembers what you have ticked off, so you are not re-reading a static file to work out where you stopped. Use your browser's print view if you want it on paper.
Tick a problem on this page and it stays ticked. Progress saves in your browser straight away with no account, and the counts update per section so you can see which parts of Nishant’s 151 DSA Sheet you have actually covered. Signing in with Google syncs it across devices.
151, grouped into 13 topics. Every one is listed on this page and tickable as you solve it.
At roughly 25 minutes a problem — reading it, solving it and writing the approach down — 151 problems is about 63 hours, or 6 weeks at ten hours a week. Treat that as a planning figure rather than a promise; the first pass through an unfamiliar topic is always slower.
Yes, completely, and no account is needed. There is no paid tier and nothing is held back — the sheet itself is by Nishant Chahar (ex-SDE, Microsoft), and this is a free tracker for it.
Finish one. Sheets overlap heavily, so working several in parallel mostly means re-solving the same problems while never completing a full topic sweep. If you are not sure this is the right one for the time you have, the sheet comparison page puts the options side by side with hour estimates.