Sr. No.

Pattern Problem Name

1 - Contains Duplicate (easy)
2 - Pangram (easy)
3 - Reverse Vowels (easy)
4 - Valid Palindrome (easy)
5 - Valid Anagram (easy)
6 - Shortest Word Distance (easy)
7 - Number of Good Pairs (easy)
8 - Sqrt (medium)
9 Two Pointers Pair with Target Sum (easy)
10 Two Pointers Find Non-Duplicate Number Instances (easy)
11 Two Pointers Squaring a Sorted Array (easy)
12 Two Pointers Triplet Sum to Zero (medium)
13 Two Pointers Triplet Sum Close to Target (medium)
14 Two Pointers Triplets with Smaller Sum (medium)
Subarrays with Product Less than a Target
15 Two Pointers
(medium)
16 Two Pointers Dutch National Flag Problem (medium)
17 Two Pointers Quadruple Sum to Target (medium)
Comparing Strings containing Backspaces
18 Two Pointers
(medium)
19 Two Pointers Minimum Window Sort (medium)
20 Fast & Slow Pointers LinkedList Cycle (easy)
21 Fast & Slow Pointers Middle of the LinkedList (easy)
22 Fast & Slow Pointers Start of LinkedList Cycle (medium)
23 Fast & Slow Pointers Happy Number (medium)
24 Fast & Slow Pointers Palindrome LinkedList (medium)
25 Fast & Slow Pointers Rearrange a LinkedList (medium)
26 Fast & Slow Pointers Cycle in a Circular Array (hard)
27 Sliding Window Maximum Sum Subarray of Size K (easy)
28 Sliding Window Smallest Subarray With a Greater Sum (easy)
Longest Substring with K Distinct Characters
29 Sliding Window
(medium)
30 Sliding Window Fruits into Baskets (medium)
Longest Substring with Same Letters after
31 Sliding Window
Replacement (hard)
Longest Subarray with Ones after Replacement
32 Sliding Window
(hard)
33 Sliding Window Permutation in a String (hard)
34 Sliding Window String Anagrams (hard)

35 Sliding Window Smallest Window containing Substring (hard)

36 Sliding Window Words Concatenation (hard)

37 Merge Intervals Merge Intervals (medium)

38 Merge Intervals Insert Interval (medium)
39 Merge Intervals Intervals Intersection (medium)
40 Merge Intervals Conflicting Appointments (medium)
41 Merge Intervals Minimum Meeting Rooms (hard)
42 Merge Intervals Maximum CPU Load (hard)
43 Merge Intervals Employee Free Time (hard)
44 Cyclic Sort Cyclic Sort (easy)
45 Cyclic Sort Find the Missing Number (easy)
46 Cyclic Sort Find all Missing Numbers (easy)
47 Cyclic Sort Find the Duplicate Number (easy)
48 Cyclic Sort Find all Duplicate Numbers (easy)
49 Cyclic Sort Find the Corrupt Pair (easy)
Find the Smallest Missing Positive Number
50 Cyclic Sort
(medium)

51 Cyclic Sort Find the First K Missing Positive Numbers (hard)

In-place Reversal of a Linked

52 Reverse a LinkedList (easy)
List
In-place Reversal of a Linked
53 Reverse a Sub-list (medium)
List
In-place Reversal of a Linked
54 Reverse every K-element Sub-list (medium)
List
In-place Reversal of a Linked
55 Reverse alternating K-element Sub-list (medium)
List
In-place Reversal of a Linked
56 Rotate a LinkedList (medium)
List
57 Stack Balanced Parentheses
58 Stack Reverse a String
59 Stack Decimal to Binary Conversion
60 Stack Next Greater Element
61 Stack Sorting a Stack
62 Stack Simplify Path
63 Monotonic Stack Remove Nodes From Linked List (easy)
64 Monotonic Stack Remove All Adjacent Duplicates In String (easy)
65 Monotonic Stack Next Greater Element (easy)
66 Monotonic Stack Daily Temperatures (easy)
Remove All Adjacent Duplicates in String II
67 Monotonic Stack
(medium)
68 Monotonic Stack Remove K Digits (hard)
69 Hashing First Non-repeating Character (easy)
70 Hashing Largest Unique Number (easy)
71 Hashing Maximum Number of Balloons (easy)
72 Hashing Longest Palindrome(easy)
73 Hashing Ransom Note (easy)
74 Tree Breadth First Search Binary Tree Level Order Traversal (easy)
75 Tree Breadth First Search Reverse Level Order Traversal (easy)
76 Tree Breadth First Search Zigzag Traversal (medium)
77 Tree Breadth First Search Level Averages in a Binary Tree (easy)
78 Tree Breadth First Search Minimum Depth of a Binary Tree (easy)
79 Tree Breadth First Search Level Order Successor (easy)
80 Tree Breadth First Search Connect Level Order Siblings (medium)
81 Tree Breadth First Search Connect All Level Order Siblings (medium)
82 Tree Breadth First Search Right View of a Binary Tree (easy)
83 Tree Depth First Search Binary Tree Path Sum (easy)
84 Tree Depth First Search All Paths for a Sum (medium)
85 Tree Depth First Search Sum of Path Numbers (medium)
86 Tree Depth First Search Path With Given Sequence (medium)
87 Tree Depth First Search Count Paths for a Sum (medium)
88 Tree Depth First Search Tree Diameter (medium)
89 Tree Depth First Search Path with Maximum Sum (hard)
90 Graph Find if Path Exists in Graph(easy)
91 Graph Number of Provinces (medium)
Minimum Number of Vertices to Reach All
92 Graph
Nodes(medium)
93 Island Number of Islands (easy)
94 Island Biggest Island (easy)
95 Island Flood Fill (easy)
96 Island Number of Closed Islands (easy)
97 Island -
98 Island -
99 Island -

100 Two Heaps Find the Median of a Number Stream (medium)

101 Two Heaps Sliding Window Median (hard)

102 Two Heaps Maximize Capital (hard)
103 Two Heaps Next Interval (hard)
104 Subsets Subsets (easy)
105 Subsets Subsets With Duplicates (easy)
106 Subsets Permutations (medium)

107 Subsets String Permutations by changing case (medium)

109 Subsets Unique Generalized Abbrevi

110 Subsets Unique Generalized Abbreviations (hard)

111 Subsets Evaluate Expression (hard)
112 Subsets Structurally Unique Binary Search Trees (hard)
Count of Structurally Unique Binary Search Trees
113 Subsets
(hard)
114 Modified Binary Search Order-agnostic Binary Search (easy)
115 Modified Binary Search Ceiling of a Number (medium)
116 Modified Binary Search Next Letter (medium)
117 Modified Binary Search Number Range (medium)
118 Modified Binary Search Search in a Sorted Infinite Array (medium)
119 Modified Binary Search Minimum Difference Element (medium)
120 Modified Binary Search Bitonic Array Maximum (easy)
121 Modified Binary Search Search Bitonic Array (medium)
122 Modified Binary Search Search in Rotated Array (medium)
123 Modified Binary Search Rotation Count (medium)
124 Bitwise XOR Single Number (easy)
125 Bitwise XOR Two Single Numbers (medium)
126 Bitwise XOR Complement of Base 10 Number (medium)
127 Bitwise XOR Flip and Invert an Image (easy)
128 Top 'K' Elements Top 'K' Numbers (easy)
129 Top 'K' Elements Kth Smallest Number (easy)
130 Top 'K' Elements 'K' Closest Points to the Origin (easy)
131 Top 'K' Elements Connect Ropes (easy)
132 Top 'K' Elements Top 'K' Frequent Numbers (medium)
133 Top 'K' Elements Frequency Sort (medium)
134 Top 'K' Elements Kth Largest Number in a Stream (medium)
135 Top 'K' Elements 'K' Closest Numbers (medium)
136 Top 'K' Elements Maximum Distinct Elements (medium)
137 Top 'K' Elements Sum of Elements (medium)
138 Top 'K' Elements Rearrange String (hard)
139 Top 'K' Elements Rearrange String K Distance Apart (hard)
140 Top 'K' Elements Scheduling Tasks (hard)
141 Top 'K' Elements Frequency Stack (hard)
142 K-way Merge Merge K Sorted Lists (medium)

143 K-way Merge Kth Smallest Number in M Sorted Lists (medium)

144 K-way Merge Kth Smallest Number in a Sorted Matrix (hard)

145 K-way Merge Smallest Number Range (hard)
146 K-way Merge K Pairs with Largest Sums (hard)
147 Greedy Algorithm Valid Palindrome II (easy)
148 Greedy Algorithm Maximum Length of Pair Chain (medium)
Minimum Add to Make Parentheses Valid
149 Greedy Algorithm
(medium)
150 Greedy Algorithm Remove Duplicate Letters (medium)
151 Greedy Algorithm Largest Palindromic Number (Medium)
Removing Minimum and Maximum From Array
152 Greedy Algorithm
(medium)
153 0/1 Knapsack 0/1 Knapsack (medium)
154 0/1 Knapsack Equal Subset Sum Partition (medium)
155 0/1 Knapsack Subset Sum (medium)
156 0/1 Knapsack Minimum Subset Sum Difference (hard)
157 0/1 Knapsack Count of Subset Sum (hard)
158 0/1 Knapsack Target Sum (hard)
159 Backtracking Combination Sum (medium)
160 Backtracking Word Search (medium)
161 Backtracking Sudoku Solver (hard)
162 Backtracking Factor Combinations (medium)
Split a String Into the Max Number of Unique
163 Backtracking
Substrings (medium)
164 Trie Implement Trie (Prefix Tree) (medium)
165 Trie Index Pairs of a String (easy)
Design Add and Search Words Data Structure
166 Trie
(medium)
167 Trie Extra Characters in a String (medium)
168 Trie Search Suggestions System (medium)
169 Topological Sort Topological Sort (medium)
170 Topological Sort Tasks Scheduling (medium)
171 Topological Sort Tasks Scheduling Order (medium)
172 Topological Sort All Tasks Scheduling Orders (hard)
173 Topological Sort Alien Dictionary (hard)
174 Topological Sort Reconstructing a Sequence (hard)
175 Topological Sort Minimum Height Trees (hard)
176 Union Find Redundant Connection (medium)
177 Union Find Number of Provinces (medium)
178 Union Find Is Graph Bipartite? (medium)
179 Union Find Path With Minimum Effort (medium)
180 Ordered Set Merge Similar Items (easy)
181 Ordered Set 132 Pattern (medium)
182 Ordered Set My Calendar I (medium)
183 Ordered Set Longest Continuous Subarray (medium)
184 Prefix Sum Find the Middle Index in Array (easy)
185 Prefix Sum Left and Right Sum Differences (easy)

186 Prefix Sum Maximum Size Subarray Sum Equals k (medium)

187 Prefix Sum Binary Subarrays With Sum (medium)

188 Prefix Sum Subarray Sums Divisible by K (medium)
Sum of Absolute Differences in a Sorted Array
189 Prefix Sum
(medium)
190 Prefix Sum Subarray Sum Equals K (medium)
191 Multi-threaded Same Tree (medium)
192 Multi-threaded Invert Binary Tree (medium)
193 Multi-threaded Binary Search Tree Iterator (medium)
194 Multi-threaded Kth Smallest Number (hard)
195 Coding Patterns Two Sum (easy)
196 Coding Patterns Valid Perfect Square (easy)
197 Coding Patterns Best Time to Buy and Sell (easy)
198 Coding Patterns Valid Parentheses (easy)
199 Coding Patterns Subtree of Another Tree (easy)
200 Coding Patterns Daily Temperatures (medium)
201 Coding Patterns Group Anagrams (medium)
202 Coding Patterns Decode String (medium)
203 Coding Patterns Valid Sudoku (medium)
204 Coding Patterns Product of Array Except Self (medium)
205 Coding Patterns Maximum Product Subarray (medium)

206 Coding Patterns Container With Most Water (medium)

207 Coding Patterns Palindromic Substrings (medium)

208 Coding Patterns Remove Nth Node From End of List (medium)

209 Coding Patterns Find Minimum in Rotated Sorted Array (medium)

210 Coding Patterns Pacific Atlantic Water Flow (medium)

211 Coding Patterns Validate Binary Search Tree (medium)

 Construct Binary Tree from Preorder and Inorder
212 Coding Patterns
Traversal (medium)
213 Coding Patterns Clone Graph (medium)
214 Coding Patterns House Robber II (medium)
215 Coding Patterns Decode Ways (medium)
216 Coding Patterns Unique Paths (medium)
217 Coding Patterns Word Break (medium)
Lowest Common Ancestor of a Binary Search Tree
218 Coding Patterns
(
 LeetCode Link
217
-
345
125
242
243
1512
https://leetcode.com/problems/sqrtx/
-
-
977
(https://leetcode.com/problems/3sum/)
(https://leetcode.com/problems/3sum-closest/)
259
713

-
-

-
141
876
142
202
-
-
-
-
209
340
904
424

1004
567
438
(https://leetcode.com/problems/minimum-window-
substring/)
(https://leetcode.com/problems/substring-with-concatenation-
of-all-words/)
(https://leetcode.com/problems/merge-intervals/)
(https://leetcode.com/problems/insert-interval/)
986
-
 253
-
759
442
268
448
287
442
-
(https://leetcode.com/problems/first-missing-positive/)

448

206

(https://leetcode.com/problems/reverse-linked-list-ii/)

(https://leetcode.com/problems/reverse-nodes-in-k-group/)

(https://leetcode.com/problems/rotate-list/)
(https://leetcode.com/problems/valid-parentheses/)
344
-
496
-
(https://leetcode.com/problems/simplify-path/)
1171
1047
496
739
1209
402
387
1133
1189
409
383
102
107
103
637
111
-
116
-
 199
112
113
129
-
437
1245
124
1971
547
1557
200
-
733
1254
-
-
-
295
480
502
-
(https://leetcode.com/problems/subsets/)
(https://leetcode.com/problems/subsets-ii/)
(https://leetcode.com/problems/permutations/)

-
-
-

-
-
-
-
-
-
-
-
-
-
136
260
 1009
832
-
378
973
-
347
451
703
-
-
-
-
-
621
895
(https://leetcode.com/problems/merge-k-sorted-lists/)
-

378
632
373
680
646
921
316
-

2091
-
416
416
-
494
494
(https://leetcode.com/problems/combination-sum/)
(https://leetcode.com/problems/word-search/)
(https://leetcode.com/problems/sudoku-solver/)
-

1593
208
1065
211
-
1268
-
 -
-
-
269
-
310
684
547
785
1631
2363
456
729
-
1991
2574
325
930
974
1648
560
100
226
173
230
1
367
121
(https://leetcode.com/problems/valid-parentheses/)
572
739
(https://leetcode.com/problems/group-anagrams/)
394
(https://leetcode.com/problems/valid-sudoku/)
238
152

(https://leetcode.com/problems/container-with-most-water/)

647
(https://leetcode.com/problems/remove-nth-node-from-end-
of-list/)
153
417

(https://leetcode.com/problems/validate-binary-search-tree/)
 105
133
213
(https://leetcode.com/problems/decode-ways/)
(https://leetcode.com/problems/unique-paths/)
139