DSA Patterns Sheet
This document organizes the DSA problem list by pattern and uses one video link for each topic.
The links for Kadane, Merge Intervals, Hashing, and Subarray / Partition have been replaced
with alternative non-Striver videos, and the Prefix Sum link remains replaced with a working
tutorial [web:3][web:13][web:17][web:23].
1. Sliding Window
Video: [Link]
Questions
Longest Substring Without Repeating Characters
Minimum Window Substring 🔥
Sliding Window Maximum 🔥
Subarrays with K Different Integers 🔥
Longest Repeating Character Replacement
Max Consecutive Ones III
Fruit Into Baskets
Binary Subarrays With Sum
Count Number of Nice Subarrays
Get Equal Substrings Within Budget
Minimum Size Subarray Sum
Subarray Product Less Than K
Longest Substring with At Most K Distinct
Number of Substrings Containing All 3 Characters
Max Points from Cards
Longest Subarray After Deleting One Element
Distinct Subarrays with Constraints
Minimum Window Subsequence 🔥
Sliding Window Median 🔥
Maximum Sum Subarray of Size K
2. Two Pointers
Video: [Link]
Questions
3Sum 🔥
4Sum 🔥
Container With Most Water 🔥
Trapping Rain Water 🔥
Two Sum II
Sort Colors 🔥
Move Zeroes
Valid Palindrome II
Squares of Sorted Array
Partition Labels
Boats to Save People
Merge Sorted Array
Reverse Vowels
Backspace String Compare
Intersection of Arrays II
Longest Mountain
Shortest Unsorted Subarray
Remove Duplicates II
Pair with Given Difference
Minimum Window Substring (2 ptr alt)
3. Prefix Sum
Video: [Link]
This replacement video covers prefix sums, range sum ideas, and problem-solving in both C++
and Python [web:3].
Questions
Subarray Sum Equals K 🔥
Subarray Divisible by K 🔥
Count of Range Sum 🔥
Continuous Subarray Sum
Maximum Size Subarray Sum K
Binary Subarrays With Sum
Longest Well Performing Interval 🔥
Make Sum Divisible by P
Range Sum Query
Range Sum 2D 🔥
Product of Array Except Self 🔥
Corporate Flight Bookings
Car Pooling
Pivot Index
Count Equal 0 and 1
Maximum Average Subarray II
K Radius Averages
Prefix XOR problems
Split Array Largest Sum 🔥
Minimum Operations to Reduce X 🔥
4. Kadane
Video: [Link]
This version explains maximum subarray sum from basics and then covers Kadane’s Algorithm
step by step in a longer teaching format [web:23].
Questions
Maximum Subarray 🔥
Maximum Product Subarray 🔥
Maximum Circular Subarray 🔥
Max Subarray with One Deletion 🔥
Max Sum of 2 Non-overlapping 🔥
Max Absolute Sum
Max Alternating Subsequence
Max Turbulent Subarray
Max Subarray K Concatenation
Max Increasing Subsequence Sum
Stock Buy Sell I
Stock II
Stock III 🔥
Stock IV 🔥
Cooldown Stock 🔥
Max Rectangle (2D Kadane 🔥)
Max Difference Increasing
Max Subarray Min Product 🔥
Bounded Max Subarrays
Largest Sum of Averages
5. Binary Search + BS on Answer
Video: [Link]
Questions
Search Rotated Sorted Array 🔥
Find Minimum Rotated
Find Peak Element
Search 2D Matrix
Koko Eating Bananas 🔥
Ship Packages 🔥
Split Array Largest Sum 🔥
Aggressive Cows 🔥
Allocate Books 🔥
Painter Partition 🔥
Min Days Bouquets 🔥
Magnetic Force 🔥
Median of Two Sorted Arrays 🔥
Kth Smallest Pair Distance 🔥
Gas Station Distance 🔥
First and Last Position
Peak Index Mountain
Smallest Divisor 🔥
Capacity Scheduling
Minimize Max Value
6. Monotonic Stack
Video: [Link]
Questions
Next Greater Element
Daily Temperatures 🔥
Stock Span 🔥
Largest Rectangle Histogram 🔥
Maximal Rectangle 🔥
Sum of Subarray Minimums 🔥
Remove K Digits
Next Smaller Element
Trapping Rain Water 🔥
Max Width Ramp 🔥
Car Fleet
Asteroid Collision
Score Parentheses
Decode String
Longest Valid Parentheses 🔥
Remove Duplicate Letters 🔥
Valid Parentheses
Min Remove Parentheses
Online Stock Span
Expression Evaluation
7. Merge Intervals
Video: [Link]
This replacement video focuses specifically on the merge intervals pattern and explains how
overlapping intervals are combined in an interview-style format [web:17].
Questions
Merge Intervals
Insert Interval
Non Overlapping Intervals
Meeting Rooms
Meeting Rooms II 🔥
Interval Intersection
Employee Free Time 🔥
Car Pooling
My Calendar I
My Calendar II 🔥
Range Module 🔥
Remove Covered Intervals
Summary Ranges
Data Stream Intervals 🔥
Max Events
Divide Intervals 🔥
Min Interval Query 🔥
Count Days Without Meetings
Job Scheduling 🔥
Skyline Problem 🔥
8. Hashing
Video: [Link]
This replacement is a full hashing-focused video that covers concepts, Sets and Maps, and
advanced problem practice in one place [web:13].
Questions
Longest Consecutive Sequence 🔥
Top K Frequent 🔥
Group Anagrams 🔥
Contains Duplicate III 🔥
Largest Subarray 0 Sum 🔥
Distinct in Window 🔥
Max Equal Frequency 🔥
Boomerangs
Nice Pairs
Pair Divisible by K
Doubled Array 🔥
Arithmetic Subsequence 🔥
XOR Triplets 🔥
Frequency Sort
Intersection Arrays
Subarray Sum K
Count Distinct Elements
Map Frequency Problems
Two Sum Variants
Randomized Set
9. Greedy
Video: [Link]
Questions
Jump Game 🔥
Jump Game II 🔥
Gas Station 🔥
Candy 🔥
Job Scheduling 🔥
Partition Labels
Queue Reconstruction 🔥
Course Schedule III 🔥
Max Pair Chain 🔥
Bag of Tokens 🔥
Min Platforms 🔥
N Meetings
Assign Cookies
Lemonade Change
Can Place Flowers
Max Units Truck
Min Cost Chips
Monster Elimination 🔥
Sequence Swaps 🔥
Greedy Scheduling
10. Cyclic Sort
Video: [Link]
Questions
Missing Number
Find Duplicate 🔥
First Missing Positive 🔥
Set Mismatch 🔥
Find Disappeared Numbers
K Missing Positive 🔥
Corrupt Pair
Duplicate Zeros
Missing AP
Place Numbers Correct
Missing Ranges 🔥
Kth Missing 🔥
Missing Sorted Array
Alternate Rearrangement
Index Placement
Cyclic Sort Base
Find All Missing
Duplicate Variants
Smallest Missing Positive 🔥
Rearrangement Problems
11. Subarray / Partition
Video: [Link]
This replacement video is an alternate non-Striver explanation centered on partition-style
array reasoning and is useful for the subarray / partition bucket [web:18].
Questions
Split Array Largest Sum 🔥
Partition Equal Subset 🔥
Count Subarrays XOR 🔥
Max Product Subarray 🔥
Subarrays with K Distinct 🔥
Min Size Subarray
Bounded Max Subarrays
Fixed Bounds Subarrays 🔥
Submatrix Sum Target 🔥
Max Rectangle 🔥
Count Range Sum 🔥
Longest Sum K 🔥
Shortest Subarray ≥ K 🔥
Min Product Subarray 🔥
Split Subsequences 🔥
Partition Labels
Reduce X to Zero 🔥
Split into 3 Subarrays 🔥
Subarray Enumeration
Prefix + Partition mix