Striver's 180 Sheet Guide: Modules, Patterns and How It Compares

Striver's 180 is takeUforward's pattern-based DSA sheet from Raj Vikramaditya, and it now gets a lot of traffic for a simple reason: the address of the classic Striver SDE sheet redirects to it, which we confirmed on November 12, 2026. Despite the name, it has 179 problems, organized first by topic and then by pattern inside each topic. This page covers its size, the 17 modules and 33 patterns, what the Basic, Core and Pro labels mean in practice, how it compares with the classic SDE sheet and Striver's 75, and a revision schedule.

How big the sheet is

We read the sheet's page data on takeUforward on November 12, 2026. Counts can change as the sheet is edited.

• 179 problems in 17 modules and 33 pattern groups.
• Labels: Basic 3, Core 107 and Pro 69. With only three Basic problems, the sheet assumes you already know the data structures.
• 148 problems link to a LeetCode problem and 161 have a video.
• 33 problems are flagged as premium on takeUforward, so their on-site practice or write-up may need a paid takeUforward plan; 18 of those still link to a LeetCode version you can solve for free.
• Each problem shows a time, mostly between 15 and 25 minutes; together they add up to about 64 hours, a floor for planning, since solving and review take longer.

The 17 modules and their patterns

Graphs get the largest module, with shortest paths alone getting nine problems: Dijkstra's algorithm, Bellman-Ford, Floyd-Warshall, Cheapest Flights Within K Stops and both Word Ladder problems among them. Mathematics gets one problem, printing all primes up to N, and Strings gets four, all of them string-matching algorithms such as KMP, the Z function and Rabin-Karp.

How it compares with Striver's other sheets

Figures for the other sheets are from our counts of takeUforward's pages in November 2026; 65 of Striver's 75 problems also appear in Striver's 180. If you are still learning the topics, start with the Striver A2Z sheet instead.

Overlap with LeetCode's own lists

Matching the sheet's LeetCode links by problem, our count on November 12, 2026 found:

• 50 problems also in LeetCode's Top Interview 150.
• 37 in Grind 75 at default settings, and 67 in Grind's full pool of 169.
• 17 in LeetCode 75, which focuses on newer, easier problems.

So Striver's 180 is not a reshuffled LeetCode list. It adds problems that are staples of Indian DSA courses and sheets, such as Aggressive Cows, Book Allocation, Minimum Time to Burn a Binary Tree, the Celebrity Problem and Job Sequencing, plus implementation problems such as building a heap and Kosaraju's algorithm.

Thin spots and problems worth repeating

• Thin spots: one mathematics problem, four bit manipulation problems and five hashing problems. Add basic counting and prefix-sum practice from another list if your online assessments lean on them.
• Monotonic stack: Sum of Subarray Minimums and Sum of Subarray Ranges teach counting each element's contribution, which reappears in many hard problems.
• Search on the answer: Koko Eating Bananas, Aggressive Cows and Book Allocation are the same idea in three disguises.
• Counting windows: Binary Subarrays With Sum and Count Number of Nice Subarrays teach the 'at most k minus at most k minus one' trick.
• Graphs: Path With Minimum Effort, Cheapest Flights Within K Stops and Making a Large Island cover modified Dijkstra, bounded Bellman-Ford and union-find with sizes.
• Dynamic programming: Wildcard Matching, Matrix Chain Multiplication and Palindrome Partitioning II are the patterns most candidates find hardest.

A revision schedule

That is about 22 problems a week. With four weeks left, do Pro problems first in each module, since Core problems are the ones you are most likely to know already. For a longer Indian sheet to work through earlier, see the Love Babbar 450 sheet.

Turning a list into interview skill

Any list only helps if the practice transfers to problems you have not seen. These habits make the difference:

1. Time-box every attempt: about 25 minutes for a medium before you read a solution.
2. Keep a log with one line per problem: the pattern, the key idea and the complexity.
3. Redo failed problems after three days, a week and three weeks, without looking at your old code.
4. Explain your approach out loud before and while you code, as you would to an interviewer.
5. In the last two weeks, switch to unseen problems without topic labels.

The patterns most lists are built on are explained in array and string patterns and tree, graph and recursion patterns.

Where CoPilot Interview fits

Finishing a list is not the same as passing an interview: interviewers score how you explain your approach, your trade-offs and your complexity out loud. CoPilot Interview is an AI interview assistant; its free AI mock interview asks coding questions, listens to your spoken explanation and scores it out of ten with a model answer, which is the part a problem list cannot train. The free plan gives 15 minutes a day of live help in sessions of up to 15 minutes, with AI mock interviews included. Online assessments and live coding rounds usually forbid outside help, so practice now and follow your employer's rules on the day.

Disclosure: CoPilot Interview is our product, so weigh what we say about it accordingly.

Frequently asked questions

How many problems are in Striver's 180?

179, in 17 modules and 33 pattern groups, labelled Basic 3, Core 107 and Pro 69, according to the sheet's page data on November 12, 2026.

What happened to Striver's SDE sheet?

Its old address now redirects to Striver's 180. The classic SDE sheet still exists on takeUforward, with 156 problems by our November 2026 count.

Is Striver's 180 good for beginners?

Not as a first sheet. It has only three Basic problems. Learn the topics with the A2Z sheet or a longer list, then revise with Striver's 180.

Is Striver's 180 free?

Most of it. 33 problems are flagged as premium on takeUforward, and 18 of those link to a LeetCode version you can practise for free.