Striver's 75 Pattern Sheet

Revise core DSA patterns with a focused set of problems for coding interviews and placements.

75
Topics
30.3
Hrs

Your progress

0%0 / 75 problems solved

About this sheet

Striver's 75 Sheet provides a focused set of DSA problems for learners preparing for coding interviews and placements. It brings selected problems from several topics into one revision path, helping you revisit the approaches you need to recognize, explain, and implement independently.

The sheet contains 75 problems across 12 modules. It includes problems that require combining ideas, handling edge cases, and reasoning carefully about efficiency, making it useful after you have built a foundation in DSA.

What You Will Practise

Work through arrays and hashing, binary search, sliding windows, linked lists, stacks, queues, heaps, greedy algorithms, and intervals. Continue with trees, binary search trees, recursion, backtracking, tries, graphs, and dynamic programming.

The selection includes search-on-answer problems, LRU and LFU caches, shortest paths, disjoint sets, knapsack and sequence problems, along with selected string-matching and number-theory questions.

Turn Revision into Independent Problem Solving

A useful revision attempt starts before you look at a solution. Identify what the problem is asking, consider a straightforward approach, and work out which constraints require you to improve it.

For each problem, aim to explain the central idea and the conditions that make it work. If you remember the code but cannot reconstruct the reasoning, revisit that part before moving on. This helps you prepare for variations of a problem during an interview.

Build a Focused Revision Routine

  • Attempt each problem before reviewing the solution.
  • Check edge cases and explain time and space complexity.
  • Record the idea you missed or the mistake you made.
  • Reattempt difficult problems after a gap without relying on earlier code.
  • Use mixed and timed practice to check whether you can choose an approach independently.

Who Is This Sheet For?

This sheet is suitable for students preparing for campus placements and developers who want a compact revision set for software engineering interviews. You should already understand core data structures, recursion, and complexity analysis, and be comfortable implementing solutions in one programming language.

Prepare for DSA Interviews and Placements

By the end, you should have a clearer view of the patterns you understand and the topics that need more work. Use this sheet for coding interview preparation by practising clear explanations, independent implementation, and responses to follow-up questions. The goal is to carry the reasoning from these problems into new questions you encounter.

Choose your learning experience

Choose your learning experience
Feature
FreeStart
TUF+Start
Complete Curriculumincluded: Full curriculum accessincluded: Full curriculum access
Planlynot available: Not availableincluded: Build and follow a structured preparation plan
Practice Platformlimited: Access to free questionsincluded: Access to free and premium questions with dedicated servers
Video Solutionslimited: Some problems have YouTube videos with ads and distractionsincluded: Dedicated video solution for every problem

Syllabus

12 Modules75 Topics30.3 Hrs
Kadane's Algorithm
3 Sum
Longest Consecutive Sequence in an Array
Count subarrays with given sum
Majority Element-II
Next Permutation
Maximum Product Subarray in an Array
Count subarrays with given xor K
Count Inversions

Frequently Asked Questions