Striver's SDE Pattern Sheet

Recognize DSA patterns and apply them to unfamiliar problems in coding interviews.

179
Topics
64.1
Hrs

Your progress

0%0 / 179 problems solved

About this sheet

Striver's SDE Pattern Sheet organizes DSA practice around the methods used to solve problems. It helps you recognize when a problem calls for a sliding window, binary search, a graph traversal, dynamic programming, or another approach, and apply that reasoning to unfamiliar interview questions.

The sheet contains 179 problems across 17 modules. Within each topic, problems are grouped into patterns so you can compare related approaches and build a more deliberate coding-interview revision routine.

What You Will Practise

Work through arrays, hashing, binary search, sliding windows, recursion, backtracking, linked lists, stacks, queues, greedy algorithms, and heaps. Continue with binary trees, binary search trees, graphs, dynamic programming, tries, string matching, bit manipulation, and number theory.

Pattern groups include prefix sums, search on answer, fast and slow pointers, monotonic stacks, interval scheduling, shortest paths, disjoint sets, and several forms of dynamic programming. This organization helps you understand how a method carries across different problems.

Recognize the Method Behind the Problem

Solving related problems gives you a chance to compare what stays the same and what changes. Look at the information you maintain, the conditions that guide each step, and the assumptions that make the approach correct.

Use that comparison to explain why a technique fits, when it stops being suitable, and how a change in constraints affects your solution. These are useful habits when an interviewer asks you to extend or improve an approach.

Practise, Compare, and Revise

  • Attempt a problem independently and identify a straightforward starting approach.
  • Explain the improvement that leads to a more efficient solution.
  • Compare neighbouring problems to understand the shared pattern.
  • Revisit difficult problems and record the assumption or step you missed.
  • Mix topics during revision so you practise choosing the method yourself.

Who Is This Sheet For?

This sheet is suitable for learners who have studied DSA basics and want structured interview practice, college students preparing for placements, and developers revising for software engineering roles. You should be comfortable coding in one language and understand basic data structures, recursion, and time and space complexity.

Prepare for Coding Interviews

By the end, you should be better prepared to recognize patterns, choose an approach, explain correctness and complexity, and implement a solution independently. Use this sheet for DSA interview preparation by combining topic practice with mixed revision, timed attempts, and explanations of how your solution would change under different requirements.

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

17 Modules179 Topics64.1 Hrs
Majority Element-I
Kadane's Algorithm
Majority Element-II
Maximum Product Subarray in an Array

Frequently Asked Questions