| 193 |
Intersection Of Two Arrays |
binary search |
easy |
| 194 |
Check If N And Its Double Exist |
binary search |
easy |
| 195 |
Intersection Of Two Arrays Ii |
binary search |
easy |
| 196 |
Number Of Flowers In Full Bloom |
binary search |
hard |
| 197 |
Count The Number Of Consistent Strings |
bit manipulation |
easy |
| 198 |
Divide Array Into Equal Pairs |
bit manipulation |
easy |
| 199 |
Set Mismatch |
bit manipulation |
easy |
| 200 |
Missing Number |
bit manipulation |
easy |
| 201 |
Count Triplets That Can Form Two Arrays Of Equal Xor |
bit manipulation |
medium |
| 202 |
Number Of Good Pairs |
counting |
easy |
| 203 |
How Many Numbers Are Smaller Than The Current Number |
counting |
easy |
| 204 |
Count Number Of Pairs With Absolute Difference K |
counting |
easy |
| 205 |
Increasing Decreasing String |
counting |
easy |
| 206 |
Check If All Characters Have Equal Number Of Occurrences |
counting |
easy |
| 207 |
Top K Frequent Elements |
divide and conquer |
medium |
| 208 |
Construct Binary Tree From Preorder And Inorder Traversal |
divide and conquer |
medium |
| 209 |
Count Substrings That Differ By One Character |
dp based |
medium |
| 210 |
Longest String Chain |
dp based |
medium |
| 211 |
Total Appeal Of A String |
dp based |
hard |
| 212 |
Flip Columns For Maximum Number Of Equal Rows |
matrix |
medium |
| 213 |
Check If Every Row And Column Contains All Numbers |
matrix |
easy |
| 214 |
Number Of Submatrices That Sum To Target |
matrix |
hard |
| 215 |
Jewels And Stones |
simple hashing |
easy |
| 216 |
Rings And Rods |
simple hashing |
easy |
| 217 |
Check If The Sentence Is Pangram |
simple hashing |
easy |
| 218 |
Unique Morse Code Words |
simple hashing |
easy |
| 219 |
Destination City |
simple hashing |
easy |
| 220 |
Substrings Of Size Three With Distinct Characters |
sliding window |
easy |
| 221 |
Contains Duplicate Ii |
sliding window |
easy |
| 222 |
Number Of Substrings Containing All Three Characters |
sliding window |
medium |
| 223 |
Sliding Window Median |
sliding window |
hard |
| 224 |
Minimum Window Substring |
sliding window |
hard |
| 225 |
How Many Numbers Are Smaller Than The Current Number |
sorting |
easy |
| 226 |
Keep Multiplying Found Values By Two |
sorting |
easy |
| 227 |
Make Two Arrays Equal By Reversing Subarrays |
sorting |
easy |
| 228 |
Intersection Of Two Arrays |
sorting |
easy |
| 229 |
Sort Array By Increasing Frequency |
sorting |
easy |
| 230 |
Find Elements In A Contaminated Binary Tree |
tree based |
medium |
| 231 |
Create Binary Tree From Descriptions |
tree based |
medium |
| 232 |
Lowest Common Ancestor Of Deepest Leaves |
tree based |
medium |
| 233 |
Smallest Subtree With All The Deepest Nodes |
tree based |
medium |
| 234 |
Throne Inheritance |
tree based |
medium |
| 235 |
Intersection Of Two Arrays |
two pointer |
easy |
| 236 |
Check If N And Its Double Exist |
two pointer |
easy |
| 237 |
Intersection Of Two Linked Lists |
two pointer |
easy |
| 238 |
Happy Number |
two pointer |
easy |
| 239 |
Intersection Of Two Arrays Ii |
two pointer |
easy |