GL
GrindLens
PatternsSheetsPricingQuestions
  1. Home
  2. /Sheets
  3. /Blind 75
←All Sheets
Curriculum RoadmapOfficial Source↗

Blind 75

The original curated list of 75 high-frequency questions covering the most critical coding interview patterns.

Total Problems: 75
Difficulty: 19 Easy·49 Medium·7 Hard
Distinct Patterns: 47

Algorithmic Pattern Breakdown

Explore sheet-specific problems by pattern
Dynamic ProgrammingFull guide

Linear 1D DP

7 problems→
IntervalsFull guide

Merge / Insert Intervals

5 problems→
Sliding WindowFull guide

Sliding Window (Variable Size)

4 problems→
Bit ManipulationFull guide

Bit Manipulation - Counting/Shifting

3 problems→
TreesFull guide

BST Ordering Property

3 problems→
Linked ListFull guide

Fast/Slow Pointers (Cycle & Midpoint)

3 problems→
HashingFull guide

Hashmap Existence / Complement Lookup

3 problems→
HashingFull guide

Hashmap Frequency / State Counting

3 problems→
HeapFull guide

Heap for Top-K / Kth Element

3 problems→
MatrixFull guide

Matrix Traversal Simulation

3 problems→
Dynamic ProgrammingFull guide

String Alignment / Subsequence DP

3 problems→
TriesFull guide

Trie / Prefix Tree

3 problems→
Backtracking

Backtracking - Grid Path Search

2 problems→
Binary Search

Binary Search on a Rotated Array

2 problems→
Bit Manipulation

Bit Manipulation - XOR Tricks

2 problems→
Dynamic Programming

Expand Around Center

2 problems→
Graphs

Grid DFS Traversal

2 problems→
Linked List

Linked List In-Place Reversal

2 problems→
Linked List

Linked List Merge (K-Way)

2 problems→
Dynamic Programming

Take/Skip Adjacent-Constraint DP

2 problems→
Graphs

Topological Sort

2 problems→
Trees

Tree Structural Comparison

2 problems→
Two Pointers

Two Pointers (Opposite Ends)

2 problems→
Dynamic Programming

Unbounded Knapsack

2 problems→
Graphs

Union-Find / Disjoint Set

2 problems→
Dynamic Programming

Circular Array DP

1 problem→
Divide & Conquer

Divide and Conquer

1 problem→
Graphs

Flood Fill

1 problem→
Trees

Generic Recursive Tree DFS

1 problem→
Graphs

Graph DFS Traversal

1 problem→
Greedy

Greedy Farthest-Reach Tracking

1 problem→
Greedy

Greedy Interval Scheduling

1 problem→
Dynamic Programming

Grid / 2D Path DP

1 problem→
Hashing

Hashmap Grouping by Canonical Key

1 problem→
Arrays

Kadane's Algorithm

1 problem→
Dynamic Programming

Longest Increasing Subsequence DP

1 problem→
Trees

Lowest Common Ancestor

1 problem→
Graphs

Multi-Source BFS

1 problem→
Arrays

Prefix Sum

1 problem→
Two Pointers

Sort Then Two Pointers

1 problem→
Stack

Stack-Based Matching / Evaluation

1 problem→
Trees

Tree BFS / Level-Order Traversal

1 problem→
Trees

Tree Height / Balance Check

1 problem→
Trees

Tree Path Value Accumulation

1 problem→
Trees

Tree Reconstruction from Traversals

1 problem→
Trees

Tree Serialization / Deserialization

1 problem→
Heap

Two Heaps (Median Maintenance)

1 problem→

Full Curriculum Problem List

1.Array

10 problems
1Two SumEasy
Solve↗
2Best Time to Buy and Sell StockEasy
Solve↗
3Contains DuplicateEasy
Solve↗
4Product of Array Except SelfMedium
Solve↗
5Maximum SubarrayMedium
Solve↗
6Maximum Product SubarrayMedium
Solve↗
7Find Minimum in Rotated Sorted ArrayMedium
Solve↗
8Search in Rotated Sorted ArrayMedium
Solve↗
93SumMedium
Solve↗
10Container With Most WaterMedium
Solve↗

2.Bit Manipulation

5 problems
1Sum of Two IntegersMedium
Solve↗
2Number of 1 BitsEasy
Solve↗
3Counting BitsEasy
Solve↗
4Missing NumberEasy
Solve↗
5Reverse BitsEasy
Solve↗

3.Dynamic Programming

11 problems
1Climbing StairsEasy
Solve↗
2Coin ChangeMedium
Solve↗
3Longest Increasing SubsequenceMedium
Solve↗
4Longest Common SubsequenceMedium
Solve↗
5Word BreakMedium
Solve↗
6Combination Sum IVMedium
Solve↗
7House RobberMedium
Solve↗
8House Robber IIMedium
Solve↗
9Decode WaysMedium
Solve↗
10Unique PathsMedium
Solve↗
11Jump GameMedium
Solve↗

4.Graph

8 problems
1Clone GraphMedium
Solve↗
2Course ScheduleMedium
Solve↗
3Pacific Atlantic Water FlowMedium
Solve↗
4Number of IslandsMedium
Solve↗
5Longest Consecutive SequenceMedium
Solve↗
6Alien DictionaryHard
Solve↗
7Graph Valid TreeMedium
Solve↗
8Number of Connected Components in an Undirected GraphMedium
Solve↗

5.Interval

5 problems
1Insert IntervalMedium
Solve↗
2Merge IntervalsMedium
Solve↗
3Non Overlapping IntervalsMedium
Solve↗
4Meeting RoomsEasy
Solve↗
5Meeting Rooms IIMedium
Solve↗

6.Linked List

6 problems
1Reverse Linked ListEasy
Solve↗
2Linked List CycleEasy
Solve↗
3Merge Two Sorted ListsEasy
Solve↗
4Merge K Sorted ListsHard
Solve↗
5Remove Nth Node From End of ListMedium
Solve↗
6Reorder ListMedium
Solve↗

7.Matrix

4 problems
1Set Matrix ZeroesMedium
Solve↗
2Spiral MatrixMedium
Solve↗
3Rotate ImageMedium
Solve↗
4Word SearchMedium
Solve↗

8.String

10 problems
1Longest Substring Without Repeating CharactersMedium
Solve↗
2Longest Repeating Character ReplacementMedium
Solve↗
3Minimum Window SubstringHard
Solve↗
4Valid AnagramEasy
Solve↗
5Group AnagramsMedium
Solve↗
6Valid ParenthesesEasy
Solve↗
7Valid PalindromeEasy
Solve↗
8Longest Palindromic SubstringMedium
Solve↗
9Palindromic SubstringsMedium
Solve↗
10Encode and Decode StringsMedium
Solve↗

9.Tree

11 problems
1Maximum Depth of Binary TreeEasy
Solve↗
2Same TreeEasy
Solve↗
3Invert Binary TreeEasy
Solve↗
4Binary Tree Maximum Path SumHard
Solve↗
5Binary Tree Level Order TraversalMedium
Solve↗
6Serialize and Deserialize Binary TreeHard
Solve↗
7Subtree of Another TreeEasy
Solve↗
8Construct Binary Tree from Preorder and Inorder TraversalMedium
Solve↗
9Validate Binary Search TreeMedium
Solve↗
10Kth Smallest Element in a BSTMedium
Solve↗
11Lowest Common Ancestor of a BSTMedium
Solve↗

10.Heap

2 problems
1Top K Frequent ElementsMedium
Solve↗
2Find Median from Data StreamHard
Solve↗

11.Trie

3 problems
1Implement Trie Prefix TreeMedium
Solve↗
2Design Add and Search Words Data StructureMedium
Solve↗
3Word Search IIHard
Solve↗
GL
GrindLens

Precision pattern analytics and curated sheet tracking for algorithmic coding interview preparation.

Quick lookup:⌘Kor/

Platform

  • Patterns→
  • Sheets→
  • Pricing→

Community

  • Feedback
  • Report a bug
  • X
  • LinkedIn

© 2026 GrindLens. LeetCode is a trademark of LeetCode. GrindLens is an independent analytics platform and is not affiliated with or endorsed by LeetCode.

Terms of ServicePrivacy Policy