| 001 |
Two Sum |
Easy |
Markdown |
To Do |
| 002 |
Add Two Numbers |
Medium |
Markdown |
To Do |
| 003 |
Longest Substring Without Repeating Characters |
Medium |
Markdown |
To Do |
| 004 |
Median of Two Sorted Arrays |
Hard |
To Do |
To Do |
| 005 |
Longest Palindromic Substring |
Medium |
To Do |
To Do |
| 006 |
ZigZag Conversion |
Medium |
To Do |
To Do |
| 007 |
Reverse Integer |
Easy |
To Do |
To Do |
| 008 |
String to Integer (atoi) |
Medium |
To Do |
To Do |
| 009 |
Palindrome Number |
Easy |
To Do |
To Do |
| 010 |
Regular Expression Matching |
Hard |
To Do |
To Do |
| 011 |
Container With Most Water |
Medium |
To Do |
To Do |
| 012 |
Integer to Roman |
Medium |
To Do |
To Do |
| 013 |
Roman to Integer |
Easy |
To Do |
To Do |
| 014 |
Longest Common Prefix |
Easy |
To Do |
To Do |
| 015 |
3Sum |
Medium |
To Do |
To Do |
| 016 |
3Sum Closest |
Medium |
To Do |
To Do |
| 017 |
Letter Combinations of a Phone Number |
Medium |
To Do |
To Do |
| 018 |
4Sum |
Medium |
To Do |
To Do |
| 019 |
Remove Nth Node From End of List |
Medium |
Markdown |
To Do |
| 020 |
Valid Parentheses |
Easy |
Markdown |
To Do |
| 021 |
Merge Two Sorted Lists |
Easy |
Markdown |
To Do |
| 022 |
Generate Parentheses |
Medium |
To Do |
To Do |
| 023 |
Merge k Sorted Lists |
Hard |
To Do |
To Do |
| 024 |
Swap Nodes in Pairs |
Medium |
Markdown |
To Do |
| 025 |
Reverse Nodes in k-Group |
Hard |
To Do |
To Do |
| 026 |
Remove Duplicates from Sorted Array |
Easy |
To Do |
To Do |
| 027 |
Remove Element |
Easy |
To Do |
To Do |
| 028 |
Implement strStr() |
Easy |
To Do |
To Do |
| 029 |
Divide Two Integers |
Medium |
To Do |
To Do |
| 030 |
Substring with Concatenation of All Words |
Hard |
To Do |
To Do |
| 031 |
Next Permutation |
Medium |
To Do |
To Do |
| 032 |
Longest Valid Parentheses |
Hard |
To Do |
To Do |
| 033 |
Search in Rotated Sorted Array |
Medium |
To Do |
To Do |
| 034 |
Find First and Last Position of Element in Sorted Array |
Medium |
Markdown |
To Do |
| 035 |
Search Insert Position |
Easy |
To Do |
To Do |
| 036 |
Valid Sudoku |
Medium |
To Do |
To Do |
| 037 |
Sudoku Solver |
Hard |
To Do |
To Do |
| 038 |
Count and Say |
Easy |
To Do |
To Do |
| 039 |
Combination Sum |
Medium |
To Do |
To Do |
| 040 |
Combination Sum II |
Medium |
To Do |
To Do |
| 041 |
First Missing Positive |
Hard |
To Do |
To Do |
| 042 |
Trapping Rain Water |
Hard |
To Do |
To Do |
| 043 |
Multiply Strings |
Medium |
To Do |
To Do |
| 044 |
Wildcard Matching |
Hard |
To Do |
To Do |
| 045 |
Jump Game II |
Hard |
To Do |
To Do |
| 046 |
Permutations |
Medium |
To Do |
To Do |
| 047 |
Permutations II |
Medium |
To Do |
To Do |
| 048 |
Rotate Image |
Medium |
To Do |
To Do |
| 049 |
Group Anagrams |
Medium |
To Do |
To Do |
| 050 |
Pow(x, n) |
Medium |
To Do |
To Do |
| 051 |
N-Queens |
Hard |
To Do |
To Do |
| 052 |
N-Queens II |
Hard |
To Do |
To Do |
| 053 |
Maximum Subarray |
Easy |
To Do |
To Do |
| 054 |
Spiral Matrix |
Medium |
To Do |
To Do |
| 055 |
Jump Game |
Medium |
To Do |
To Do |
| 056 |
Merge Intervals |
Medium |
Markdown |
To Do |
| 057 |
Insert Interval |
Medium |
Markdown |
To Do |
| 058 |
Length of Last Word |
Easy |
To Do |
To Do |
| 059 |
Spiral Matrix II |
Medium |
To Do |
To Do |
| 060 |
Permutation Sequence |
Hard |
To Do |
To Do |
| 061 |
Rotate List |
Medium |
To Do |
To Do |
| 062 |
Unique Paths |
Medium |
Markdown |
To Do |
| 063 |
Unique Paths II |
Medium |
To Do |
To Do |
| 064 |
Minimum Path Sum |
Medium |
Markdown |
To Do |
| 065 |
Valid Number |
Hard |
To Do |
To Do |
| 066 |
Plus One |
Easy |
To Do |
To Do |
| 067 |
Add Binary |
Easy |
To Do |
To Do |
| 068 |
Text Justification |
Hard |
To Do |
To Do |
| 069 |
Sqrt(x) |
Easy |
Markdown |
To Do |
| 070 |
Climbing Stairs |
Easy |
Markdown |
To Do |
| 071 |
Simplify Path |
Medium |
To Do |
To Do |
| 072 |
Edit Distance |
Hard |
Markdown |
To Do |
| 073 |
Set Matrix Zeroes |
Medium |
To Do |
To Do |
| 074 |
Search a 2D Matrix |
Medium |
To Do |
To Do |
| 075 |
Sort Colors |
Medium |
To Do |
To Do |
| 076 |
Minimum Window Substring |
Hard |
To Do |
To Do |
| 077 |
Combinations |
Medium |
To Do |
To Do |
| 078 |
Subsets |
Medium |
To Do |
To Do |
| 079 |
Word Search |
Medium |
To Do |
To Do |
| 080 |
Remove Duplicates from Sorted Array II |
Medium |
To Do |
To Do |
| 081 |
Search in Rotated Sorted Array II |
Medium |
To Do |
To Do |
| 082 |
Remove Duplicates from Sorted List II |
Medium |
To Do |
To Do |
| 083 |
Remove Duplicates from Sorted List |
Easy |
Markdown |
To Do |
| 084 |
Largest Rectangle in Histogram |
Hard |
To Do |
To Do |
| 085 |
Maximal Rectangle |
Hard |
To Do |
To Do |
| 086 |
Partition List |
Medium |
To Do |
To Do |
| 087 |
Scramble String |
Hard |
To Do |
To Do |
| 088 |
Merge Sorted Array |
Easy |
Markdown |
To Do |
| 089 |
Gray Code |
Medium |
To Do |
To Do |
| 090 |
Subsets II |
Medium |
To Do |
To Do |
| 091 |
Decode Ways |
Medium |
Markdown |
To Do |
| 092 |
Reverse Linked List II |
Medium |
To Do |
To Do |
| 093 |
Restore IP Addresses |
Medium |
To Do |
To Do |
| 094 |
Binary Tree Inorder Traversal |
Medium |
Markdown |
To Do |
| 095 |
Unique Binary Search Trees II |
Medium |
To Do |
To Do |
| 096 |
Unique Binary Search Trees |
Medium |
To Do |
To Do |
| 097 |
Interleaving String |
Hard |
To Do |
To Do |
| 098 |
Validate Binary Search Tree |
Medium |
To Do |
To Do |
| 099 |
Recover Binary Search Tree |
Hard |
To Do |
To Do |
| 100 |
Same Tree |
Easy |
To Do |
To Do |
| 101 |
Symmetric Tree |
Easy |
Markdown |
To Do |
| 102 |
Binary Tree Level Order Traversal |
Medium |
To Do |
To Do |
| 103 |
Binary Tree Zigzag Level Order Traversal |
Medium |
To Do |
To Do |
| 104 |
Maximum Depth of Binary Tree |
Easy |
Markdown |
To Do |
| 105 |
Construct Binary Tree from Preorder and Inorder Traversal |
Medium |
To Do |
To Do |
| 106 |
Construct Binary Tree from Inorder and Postorder Traversal |
Medium |
To Do |
To Do |
| 107 |
Binary Tree Level Order Traversal II |
Easy |
To Do |
To Do |
| 108 |
Convert Sorted Array to Binary Search Tree |
Easy |
Markdown |
To Do |
| 109 |
Convert Sorted List to Binary Search Tree |
Medium |
Markdown |
To Do |
| 110 |
Balanced Binary Tree |
Easy |
Markdown |
To Do |
| 111 |
Minimum Depth of Binary Tree |
Easy |
Markdown |
To Do |
| 112 |
Path Sum |
Easy |
Markdown |
To Do |
| 113 |
Path Sum II |
Medium |
To Do |
To Do |
| 114 |
Flatten Binary Tree to Linked List |
Medium |
Markdown |
To Do |
| 115 |
Distinct Subsequences |
Hard |
To Do |
To Do |
| 116 |
Populating Next Right Pointers in Each Node |
Medium |
To Do |
To Do |
| 117 |
Populating Next Right Pointers in Each Node II |
Medium |
To Do |
To Do |
| 118 |
Pascal's Triangle |
Easy |
To Do |
To Do |
| 119 |
Pascal's Triangle II |
Easy |
To Do |
To Do |
| 120 |
Triangle |
Medium |
To Do |
To Do |
| 121 |
Best Time to Buy and Sell Stock |
Easy |
Markdown |
To Do |
| 122 |
Best Time to Buy and Sell Stock II |
Easy |
Markdown |
To Do |
| 123 |
Best Time to Buy and Sell Stock III |
Hard |
Markdown |
To Do |
| 124 |
Binary Tree Maximum Path Sum |
Hard |
To Do |
To Do |
| 125 |
Valid Palindrome |
Easy |
To Do |
To Do |
| 126 |
Word Ladder II |
Hard |
To Do |
To Do |
| 127 |
Word Ladder |
Medium |
To Do |
To Do |
| 128 |
Longest Consecutive Sequence |
Hard |
To Do |
To Do |
| 129 |
Sum Root to Leaf Numbers |
Medium |
To Do |
To Do |
| 130 |
Surrounded Regions |
Medium |
To Do |
To Do |
| 131 |
Palindrome Partitioning |
Medium |
To Do |
To Do |
| 132 |
Palindrome Partitioning II |
Hard |
To Do |
To Do |
| 133 |
Clone Graph |
Medium |
To Do |
To Do |
| 134 |
Gas Station |
Medium |
To Do |
To Do |
| 135 |
Candy |
Hard |
Markdown |
To Do |
| 136 |
Single Number |
Easy |
To Do |
To Do |
| 137 |
Single Number II |
Medium |
To Do |
To Do |
| 138 |
Copy List with Random Pointer |
Medium |
To Do |
To Do |
| 139 |
Word Break |
Medium |
Markdown |
To Do |
| 140 |
Word Break II |
Hard |
To Do |
To Do |
| 141 |
Linked List Cycle |
Easy |
Markdown |
To Do |
| 142 |
Linked List Cycle II |
Medium |
To Do |
To Do |
| 143 |
Reorder List |
Medium |
To Do |
To Do |
| 144 |
Binary Tree Preorder Traversal |
Medium |
Markdown |
To Do |
| 145 |
Binary Tree Postorder Traversal |
Medium |
Markdown |
To Do |
| 146 |
LRU Cache |
Medium |
To Do |
To Do |
| 147 |
Insertion Sort List |
Medium |
Markdown |
To Do |
| 148 |
Sort List |
Medium |
To Do |
To Do |
| 149 |
Max Points on a Line |
Hard |
To Do |
To Do |
| 150 |
Evaluate Reverse Polish Notation |
Medium |
To Do |
To Do |
| 151 |
Reverse Words in a String |
Medium |
To Do |
To Do |
| 152 |
Maximum Product Subarray |
Medium |
To Do |
To Do |
| 153 |
Find Minimum in Rotated Sorted Array |
Medium |
Markdown |
To Do |
| 154 |
Find Minimum in Rotated Sorted Array II |
Hard |
To Do |
To Do |
| 155 |
Min Stack |
Easy |
Markdown |
To Do |
| 156 |
Binary Tree Upside Down 🔒 |
Medium |
To Do |
To Do |
| 157 |
Read N Characters Given Read4 🔒 |
Easy |
To Do |
To Do |
| 158 |
Read N Characters Given Read4 II - Call multiple times 🔒 |
Hard |
To Do |
To Do |
| 159 |
Longest Substring with At Most Two Distinct Characters 🔒 |
Medium |
To Do |
To Do |
| 160 |
Intersection of Two Linked Lists |
Easy |
Markdown |
To Do |
| 161 |
One Edit Distance 🔒 |
Medium |
To Do |
To Do |
| 162 |
Find Peak Element |
Medium |
To Do |
To Do |
| 163 |
Missing Ranges 🔒 |
Medium |
To Do |
To Do |
| 164 |
Maximum Gap |
Hard |
To Do |
To Do |
| 165 |
Compare Version Numbers |
Medium |
To Do |
To Do |
| 166 |
Fraction to Recurring Decimal |
Medium |
To Do |
To Do |
| 167 |
Two Sum II - Input array is sorted |
Easy |
Markdown |
To Do |
| 168 |
Excel Sheet Column Title |
Easy |
To Do |
To Do |
| 169 |
Majority Element |
Easy |
To Do |
To Do |
| 170 |
Two Sum III - Data structure design 🔒 |
Easy |
To Do |
To Do |
| 171 |
Excel Sheet Column Number |
Easy |
To Do |
To Do |
| 172 |
Factorial Trailing Zeroes |
Easy |
To Do |
To Do |
| 173 |
Binary Search Tree Iterator |
Medium |
To Do |
To Do |
| 174 |
Dungeon Game |
Hard |
To Do |
To Do |
| 179 |
Largest Number |
Medium |
To Do |
To Do |
| 186 |
Reverse Words in a String II 🔒 |
Medium |
To Do |
To Do |
| 187 |
Repeated DNA Sequences |
Medium |
To Do |
To Do |
| 188 |
Best Time to Buy and Sell Stock IV |
Hard |
Markdown |
To Do |
| 189 |
Rotate Array |
Easy |
Markdown |
To Do |
| 190 |
Reverse Bits |
Easy |
To Do |
To Do |
| 191 |
Number of 1 Bits |
Easy |
To Do |
To Do |
| 198 |
House Robber |
Easy |
To Do |
To Do |
| 199 |
Binary Tree Right Side View |
Medium |
To Do |
To Do |
| 200 |
Number of Islands |
Medium |
To Do |
To Do |
| 201 |
Bitwise AND of Numbers Range |
Medium |
To Do |
To Do |
| 202 |
Happy Number |
Easy |
To Do |
To Do |
| 203 |
Remove Linked List Elements |
Easy |
To Do |
To Do |
| 204 |
Count Primes |
Easy |
To Do |
To Do |
| 205 |
Isomorphic Strings |
Easy |
To Do |
To Do |
| 206 |
Reverse Linked List |
Easy |
Markdown |
To Do |
| 207 |
Course Schedule |
Medium |
To Do |
To Do |
| 208 |
Implement Trie (Prefix Tree) |
Medium |
To Do |
To Do |
| 209 |
Minimum Size Subarray Sum |
Medium |
To Do |
To Do |
| 210 |
Course Schedule II |
Medium |
To Do |
To Do |
| 211 |
Design Add and Search Words Data Structure |
Medium |
To Do |
To Do |
| 212 |
Word Search II |
Hard |
To Do |
To Do |
| 213 |
House Robber II |
Medium |
Markdown |
To Do |
| 214 |
Shortest Palindrome |
Hard |
To Do |
To Do |
| 215 |
Kth Largest Element in an Array |
Medium |
To Do |
To Do |
| 216 |
Combination Sum III |
Medium |
To Do |
To Do |
| 217 |
Contains Duplicate |
Easy |
To Do |
To Do |
| 218 |
The Skyline Problem |
Hard |
To Do |
To Do |
| 219 |
Contains Duplicate II |
Easy |
To Do |
To Do |
| 220 |
Contains Duplicate III |
Medium |
To Do |
To Do |
| 221 |
Maximal Square |
Medium |
To Do |
To Do |
| 222 |
Count Complete Tree Nodes |
Medium |
To Do |
To Do |
| 223 |
Rectangle Area |
Medium |
To Do |
To Do |
| 224 |
Basic Calculator |
Hard |
To Do |
To Do |
| 225 |
Implement Stack using Queues |
Easy |
Markdown |
To Do |
| 226 |
Invert Binary Tree |
Easy |
Markdown |
To Do |
| 227 |
Basic Calculator II |
Medium |
To Do |
To Do |
| 228 |
Summary Ranges |
Medium |
To Do |
To Do |
| 229 |
Majority Element II |
Medium |
To Do |
To Do |
| 230 |
Kth Smallest Element in a BST |
Medium |
Markdown |
To Do |
| 231 |
Power of Two |
Easy |
To Do |
To Do |
| 232 |
Implement Queue using Stacks |
Easy |
Markdown |
To Do |
| 233 |
Number of Digit One |
Hard |
To Do |
To Do |
| 234 |
Palindrome Linked List |
Easy |
Markdown |
To Do |
| 235 |
Lowest Common Ancestor of a Binary Search Tree |
Easy |
Markdown |
To Do |
| 236 |
Lowest Common Ancestor of a Binary Tree |
Medium |
Markdown |
To Do |
| 237 |
Delete Node in a Linked List |
Easy |
To Do |
To Do |
| 238 |
Product of Array Except Self |
Medium |
To Do |
To Do |
| 239 |
Sliding Window Maximum |
Hard |
To Do |
To Do |
| 240 |
Search a 2D Matrix II |
Medium |
Markdown |
To Do |
| 241 |
Different Ways to Add Parentheses |
Medium |
To Do |
To Do |
| 242 |
Valid Anagram |
Easy |
To Do |
To Do |
| 243 |
Shortest Word Distance 🔒 |
Easy |
To Do |
To Do |
| 244 |
Shortest Word Distance II 🔒 |
Medium |
To Do |
To Do |
| 245 |
Shortest Word Distance III 🔒 |
Medium |
To Do |
To Do |
| 246 |
Strobogrammatic Number 🔒 |
Easy |
To Do |
To Do |
| 247 |
Strobogrammatic Number II 🔒 |
Medium |
To Do |
To Do |
| 248 |
Strobogrammatic Number III 🔒 |
Hard |
To Do |
To Do |
| 249 |
Group Shifted Strings 🔒 |
Medium |
To Do |
To Do |
| 250 |
Count Univalue Subtrees 🔒 |
Medium |
To Do |
To Do |
| 251 |
Flatten 2D Vector 🔒 |
Medium |
To Do |
To Do |
| 252 |
Meeting Rooms 🔒 |
Easy |
To Do |
To Do |
| 253 |
Meeting Rooms II 🔒 |
Medium |
To Do |
To Do |
| 254 |
Factor Combinations 🔒 |
Medium |
To Do |
To Do |
| 255 |
Verify Preorder Sequence in Binary Search Tree 🔒 |
Medium |
To Do |
To Do |
| 256 |
Paint House 🔒 |
Medium |
To Do |
To Do |
| 257 |
Binary Tree Paths |
Easy |
To Do |
To Do |
| 258 |
Add Digits |
Easy |
To Do |
To Do |
| 259 |
3Sum Smaller 🔒 |
Medium |
To Do |
To Do |
| 260 |
Single Number III |
Medium |
To Do |
To Do |
| 261 |
Graph Valid Tree 🔒 |
Medium |
To Do |
To Do |
| 263 |
Ugly Number |
Easy |
To Do |
To Do |
| 264 |
Ugly Number II |
Medium |
To Do |
To Do |
| 265 |
Paint House II 🔒 |
Hard |
To Do |
To Do |
| 266 |
Palindrome Permutation 🔒 |
Easy |
To Do |
To Do |
| 267 |
Palindrome Permutation II 🔒 |
Medium |
To Do |
To Do |
| 268 |
Missing Number |
Easy |
To Do |
To Do |
| 269 |
Alien Dictionary 🔒 |
Hard |
To Do |
To Do |
| 270 |
Closest Binary Search Tree Value 🔒 |
Easy |
To Do |
To Do |
| 271 |
Encode and Decode Strings 🔒 |
Medium |
To Do |
To Do |
| 272 |
Closest Binary Search Tree Value II 🔒 |
Hard |
To Do |
To Do |
| 273 |
Integer to English Words |
Hard |
To Do |
To Do |
| 274 |
H-Index |
Medium |
To Do |
To Do |
| 275 |
H-Index II |
Medium |
To Do |
To Do |
| 276 |
Paint Fence 🔒 |
Easy |
To Do |
To Do |
| 277 |
Find the Celebrity 🔒 |
Medium |
To Do |
To Do |
| 278 |
First Bad Version |
Easy |
Markdown |
To Do |
| 279 |
Perfect Squares |
Medium |
Markdown |
To Do |
| 280 |
Wiggle Sort 🔒 |
Medium |
To Do |
To Do |
| 281 |
Zigzag Iterator 🔒 |
Medium |
To Do |
To Do |
| 282 |
Expression Add Operators |
Hard |
To Do |
To Do |
| 283 |
Move Zeroes |
Easy |
Markdown |
To Do |
| 284 |
Peeking Iterator |
Medium |
To Do |
To Do |
| 285 |
Inorder Successor in BST 🔒 |
Medium |
To Do |
To Do |
| 286 |
Walls and Gates 🔒 |
Medium |
To Do |
To Do |
| 287 |
Find the Duplicate Number |
Medium |
To Do |
To Do |
| 288 |
Unique Word Abbreviation 🔒 |
Medium |
To Do |
To Do |
| 289 |
Game of Life |
Medium |
To Do |
To Do |
| 290 |
Word Pattern |
Easy |
To Do |
To Do |
| 291 |
Word Pattern II 🔒 |
Hard |
To Do |
To Do |
| 292 |
Nim Game |
Easy |
To Do |
To Do |
| 293 |
Flip Game 🔒 |
Easy |
To Do |
To Do |
| 294 |
Flip Game II 🔒 |
Medium |
To Do |
To Do |
| 295 |
Find Median from Data Stream |
Hard |
To Do |
To Do |
| 296 |
Best Meeting Point 🔒 |
Hard |
To Do |
To Do |
| 297 |
Serialize and Deserialize Binary Tree |
Hard |
To Do |
To Do |
| 298 |
Binary Tree Longest Consecutive Sequence 🔒 |
Medium |
To Do |
To Do |
| 299 |
Bulls and Cows |
Medium |
To Do |
To Do |
| 300 |
Longest Increasing Subsequence |
Medium |
Markdown |
To Do |
| 301 |
Remove Invalid Parentheses |
Hard |
To Do |
To Do |
| 302 |
Smallest Rectangle Enclosing Black Pixels 🔒 |
Hard |
To Do |
To Do |
| 303 |
Range Sum Query - Immutable |
Easy |
Markdown |
To Do |
| 304 |
Range Sum Query 2D - Immutable |
Medium |
To Do |
To Do |
| 305 |
Number of Islands II 🔒 |
Hard |
To Do |
To Do |
| 306 |
Additive Number |
Medium |
To Do |
To Do |
| 307 |
Range Sum Query - Mutable |
Medium |
To Do |
To Do |
| 308 |
Range Sum Query 2D - Mutable 🔒 |
Hard |
To Do |
To Do |
| 309 |
Best Time to Buy and Sell Stock with Cooldown |
Medium |
Markdown |
To Do |
| 310 |
Minimum Height Trees |
Medium |
To Do |
To Do |
| 311 |
Sparse Matrix Multiplication 🔒 |
Medium |
To Do |
To Do |
| 312 |
Burst Balloons |
Hard |
To Do |
To Do |
| 313 |
Super Ugly Number |
Medium |
To Do |
To Do |
| 314 |
Binary Tree Vertical Order Traversal 🔒 |
Medium |
To Do |
To Do |
| 315 |
Count of Smaller Numbers After Self |
Hard |
To Do |
To Do |
| 316 |
Remove Duplicate Letters |
Medium |
To Do |
To Do |
| 317 |
Shortest Distance from All Buildings 🔒 |
Hard |
To Do |
To Do |
| 318 |
Maximum Product of Word Lengths |
Medium |
To Do |
To Do |
| 319 |
Bulb Switcher |
Medium |
To Do |
To Do |
| 320 |
Generalized Abbreviation 🔒 |
Medium |
To Do |
To Do |
| 321 |
Create Maximum Number |
Hard |
To Do |
To Do |
| 322 |
Coin Change |
Medium |
Markdown |
To Do |
| 323 |
Number of Connected Components in an Undirected Graph 🔒 |
Medium |
To Do |
To Do |
| 324 |
Wiggle Sort II |
Medium |
To Do |
To Do |
| 325 |
Maximum Size Subarray Sum Equals k 🔒 |
Medium |
To Do |
To Do |
| 326 |
Power of Three |
Easy |
To Do |
To Do |
| 327 |
Count of Range Sum |
Hard |
To Do |
To Do |
| 328 |
Odd Even Linked List |
Medium |
Markdown |
To Do |
| 329 |
Longest Increasing Path in a Matrix |
Hard |
To Do |
To Do |
| 330 |
Patching Array |
Hard |
To Do |
To Do |
| 331 |
Verify Preorder Serialization of a Binary Tree |
Medium |
To Do |
To Do |
| 332 |
Reconstruct Itinerary |
Medium |
To Do |
To Do |
| 333 |
Largest BST Subtree 🔒 |
Medium |
To Do |
To Do |
| 334 |
Increasing Triplet Subsequence |
Medium |
To Do |
To Do |
| 335 |
Self Crossing |
Hard |
To Do |
To Do |
| 336 |
Palindrome Pairs |
Hard |
To Do |
To Do |
| 337 |
House Robber III |
Medium |
Markdown |
To Do |
| 338 |
Counting Bits |
Medium |
To Do |
To Do |
| 339 |
Nested List Weight Sum 🔒 |
Easy |
To Do |
To Do |
| 340 |
Longest Substring with At Most K Distinct Characters 🔒 |
Hard |
To Do |
To Do |
| 341 |
Flatten Nested List Iterator |
Medium |
To Do |
To Do |
| 342 |
Power of Four |
Easy |
To Do |
To Do |
| 343 |
Integer Break |
Medium |
Markdown |
To Do |
| 344 |
Reverse String |
Easy |
To Do |
To Do |
| 345 |
Reverse Vowels of a String |
Easy |
Markdown |
To Do |
| 346 |
Moving Average from Data Stream 🔒 |
Easy |
To Do |
To Do |
| 347 |
Top K Frequent Elements |
Medium |
To Do |
To Do |
| 348 |
Design Tic-Tac-Toe 🔒 |
Medium |
To Do |
To Do |
| 349 |
Intersection of Two Arrays |
Easy |
To Do |
To Do |
| 350 |
Intersection of Two Arrays II |
Easy |
To Do |
To Do |
| 351 |
Android Unlock Patterns 🔒 |
Medium |
To Do |
To Do |
| 352 |
Data Stream as Disjoint Intervals |
Hard |
To Do |
To Do |
| 353 |
Design Snake Game 🔒 |
Medium |
To Do |
To Do |
| 354 |
Russian Doll Envelopes |
Hard |
To Do |
To Do |
| 355 |
Design Twitter |
Medium |
To Do |
To Do |
| 356 |
Line Reflection 🔒 |
Medium |
To Do |
To Do |
| 357 |
Count Numbers with Unique Digits |
Medium |
To Do |
To Do |
| 358 |
Rearrange String k Distance Apart 🔒 |
Hard |
To Do |
To Do |
| 359 |
Logger Rate Limiter 🔒 |
Easy |
To Do |
To Do |
| 360 |
Sort Transformed Array 🔒 |
Medium |
To Do |
To Do |
| 361 |
Bomb Enemy 🔒 |
Medium |
To Do |
To Do |
| 362 |
Design Hit Counter 🔒 |
Medium |
To Do |
To Do |
| 363 |
Max Sum of Rectangle No Larger Than K |
Hard |
To Do |
To Do |
| 364 |
Nested List Weight Sum II 🔒 |
Medium |
To Do |
To Do |
| 365 |
Water and Jug Problem |
Medium |
To Do |
To Do |
| 366 |
Find Leaves of Binary Tree 🔒 |
Medium |
To Do |
To Do |
| 367 |
Valid Perfect Square |
Easy |
To Do |
To Do |
| 368 |
Largest Divisible Subset |
Medium |
To Do |
To Do |
| 369 |
Plus One Linked List 🔒 |
Medium |
To Do |
To Do |
| 370 |
Range Addition 🔒 |
Medium |
To Do |
To Do |
| 371 |
Sum of Two Integers |
Medium |
To Do |
To Do |
| 372 |
Super Pow |
Medium |
To Do |
To Do |
| 373 |
Find K Pairs with Smallest Sums |
Medium |
To Do |
To Do |
| 374 |
Guess Number Higher or Lower |
Easy |
To Do |
To Do |
| 375 |
Guess Number Higher or Lower II |
Medium |
To Do |
To Do |
| 376 |
Wiggle Subsequence |
Medium |
Markdown |
To Do |
| 377 |
Combination Sum IV |
Medium |
Markdown |
To Do |
| 378 |
Kth Smallest Element in a Sorted Matrix |
Medium |
To Do |
To Do |
| 379 |
Design Phone Directory 🔒 |
Medium |
To Do |
To Do |
| 380 |
Insert Delete GetRandom O(1) |
Medium |
To Do |
To Do |
| 381 |
Insert Delete GetRandom O(1) - Duplicates allowed |
Hard |
To Do |
To Do |
| 382 |
Linked List Random Node |
Medium |
To Do |
To Do |
| 383 |
Ransom Note |
Easy |
To Do |
To Do |
| 384 |
Shuffle an Array |
Medium |
To Do |
To Do |
| 385 |
Mini Parser |
Medium |
To Do |
To Do |
| 386 |
Lexicographical Numbers |
Medium |
To Do |
To Do |
| 387 |
First Unique Character in a String |
Easy |
To Do |
To Do |
| 388 |
Longest Absolute File Path |
Medium |
To Do |
To Do |
| 389 |
Find the Difference |
Easy |
To Do |
To Do |
| 390 |
Elimination Game |
Medium |
To Do |
To Do |
| 391 |
Perfect Rectangle |
Hard |
To Do |
To Do |
| 392 |
Is Subsequence |
Easy |
To Do |
To Do |
| 393 |
UTF-8 Validation |
Medium |
To Do |
To Do |
| 394 |
Decode String |
Medium |
To Do |
To Do |
| 395 |
Longest Substring with At Least K Repeating Characters |
Medium |
To Do |
To Do |
| 396 |
Rotate Function |
Medium |
To Do |
To Do |
| 397 |
Integer Replacement |
Medium |
To Do |
To Do |
| 398 |
Random Pick Index |
Medium |
To Do |
To Do |
| 399 |
Evaluate Division |
Medium |
To Do |
To Do |
| 400 |
Nth Digit |
Medium |
To Do |
To Do |
| 401 |
Binary Watch |
Easy |
To Do |
To Do |
| 402 |
Remove K Digits |
Medium |
To Do |
To Do |
| 403 |
Frog Jump |
Hard |
To Do |
To Do |
| 404 |
Sum of Left Leaves |
Easy |
Markdown |
To Do |
| 405 |
Convert a Number to Hexadecimal |
Easy |
To Do |
To Do |
| 406 |
Queue Reconstruction by Height |
Medium |
To Do |
To Do |
| 407 |
Trapping Rain Water II |
Hard |
To Do |
To Do |
| 408 |
Valid Word Abbreviation 🔒 |
Easy |
To Do |
To Do |
| 409 |
Longest Palindrome |
Easy |
To Do |
To Do |
| 410 |
Split Array Largest Sum |
Hard |
To Do |
To Do |
| 411 |
Minimum Unique Word Abbreviation 🔒 |
Hard |
To Do |
To Do |
| 412 |
Fizz Buzz |
Easy |
To Do |
To Do |
| 413 |
Arithmetic Slices |
Medium |
Markdown |
To Do |
| 414 |
Third Maximum Number |
Easy |
To Do |
To Do |
| 415 |
Add Strings |
Easy |
To Do |
To Do |
| 416 |
Partition Equal Subset Sum |
Medium |
Markdown |
To Do |
| 417 |
Pacific Atlantic Water Flow |
Medium |
To Do |
To Do |
| 418 |
Sentence Screen Fitting 🔒 |
Medium |
To Do |
To Do |
| 419 |
Battleships in a Board |
Medium |
To Do |
To Do |
| 420 |
Strong Password Checker |
Hard |
To Do |
To Do |
| 421 |
Maximum XOR of Two Numbers in an Array |
Medium |
To Do |
To Do |
| 422 |
Valid Word Square 🔒 |
Easy |
To Do |
To Do |
| 423 |
Reconstruct Original Digits from English |
Medium |
To Do |
To Do |
| 424 |
Longest Repeating Character Replacement |
Medium |
To Do |
To Do |
| 425 |
Word Squares 🔒 |
Hard |
To Do |
To Do |
| 432 |
All O`one Data Structure |
Hard |
To Do |
To Do |
| 433 |
Minimum Genetic Mutation |
Medium |
To Do |
To Do |
| 434 |
Number of Segments in a String |
Easy |
To Do |
To Do |
| 435 |
Non-overlapping Intervals |
Medium |
To Do |
To Do |
| 436 |
Find Right Interval |
Medium |
To Do |
To Do |
| 437 |
Path Sum III |
Medium |
Markdown |
To Do |
| 438 |
Find All Anagrams in a String |
Medium |
To Do |
To Do |
| 439 |
Ternary Expression Parser 🔒 |
Medium |
To Do |
To Do |
| 440 |
K-th Smallest in Lexicographical Order |
Hard |
To Do |
To Do |
| 441 |
Arranging Coins |
Easy |
To Do |
To Do |
| 442 |
Find All Duplicates in an Array |
Medium |
To Do |
To Do |
| 443 |
String Compression |
Medium |
To Do |
To Do |
| 444 |
Sequence Reconstruction 🔒 |
Medium |
To Do |
To Do |
| 445 |
Add Two Numbers II |
Medium |
Markdown |
To Do |
| 446 |
Arithmetic Slices II - Subsequence |
Hard |
To Do |
To Do |
| 447 |
Number of Boomerangs |
Easy |
To Do |
To Do |
| 448 |
Find All Numbers Disappeared in an Array |
Easy |
To Do |
To Do |
| 449 |
Serialize and Deserialize BST |
Medium |
To Do |
To Do |
| 450 |
Delete Node in a BST |
Medium |
To Do |
To Do |
| 451 |
Sort Characters By Frequency |
Medium |
To Do |
To Do |
| 452 |
Minimum Number of Arrows to Burst Balloons |
Medium |
To Do |
To Do |
| 453 |
Minimum Moves to Equal Array Elements |
Easy |
To Do |
To Do |
| 454 |
4Sum II |
Medium |
To Do |
To Do |
| 455 |
Assign Cookies |
Easy |
Markdown |
To Do |
| 456 |
132 Pattern |
Medium |
To Do |
To Do |
| 457 |
Circular Array Loop |
Medium |
To Do |
To Do |
| 458 |
Poor Pigs |
Hard |
To Do |
To Do |
| 459 |
Repeated Substring Pattern |
Easy |
To Do |
To Do |
| 460 |
LFU Cache |
Hard |
To Do |
To Do |
| 461 |
Hamming Distance |
Easy |
To Do |
To Do |
| 462 |
Minimum Moves to Equal Array Elements II |
Medium |
To Do |
To Do |
| 463 |
Island Perimeter |
Easy |
To Do |
To Do |
| 464 |
Can I Win |
Medium |
To Do |
To Do |
| 465 |
Optimal Account Balancing 🔒 |
Hard |
To Do |
To Do |
| 466 |
Count The Repetitions |
Hard |
To Do |
To Do |
| 467 |
Unique Substrings in Wraparound String |
Medium |
To Do |
To Do |
| 468 |
Validate IP Address |
Medium |
To Do |
To Do |
| 469 |
Convex Polygon 🔒 |
Medium |
To Do |
To Do |
| 471 |
Encode String with Shortest Length 🔒 |
Hard |
To Do |
To Do |
| 472 |
Concatenated Words |
Hard |
To Do |
To Do |
| 473 |
Matchsticks to Square |
Medium |
To Do |
To Do |
| 474 |
Ones and Zeroes |
Medium |
Markdown |
To Do |
| 475 |
Heaters |
Easy |
To Do |
To Do |
| 476 |
Number Complement |
Easy |
To Do |
To Do |
| 477 |
Total Hamming Distance |
Medium |
To Do |
To Do |
| 479 |
Largest Palindrome Product |
Hard |
To Do |
To Do |
| 480 |
Sliding Window Median |
Hard |
To Do |
To Do |
| 481 |
Magical String |
Medium |
To Do |
To Do |
| 482 |
License Key Formatting |
Easy |
To Do |
To Do |
| 483 |
Smallest Good Base |
Hard |
To Do |
To Do |
| 484 |
Find Permutation 🔒 |
Medium |
To Do |
To Do |
| 485 |
Max Consecutive Ones |
Easy |
Markdown |
To Do |
| 486 |
Predict the Winner |
Medium |
To Do |
To Do |
| 487 |
Max Consecutive Ones II 🔒 |
Medium |
To Do |
To Do |
| 488 |
Zuma Game |
Hard |
To Do |
To Do |
| 490 |
The Maze 🔒 |
Medium |
To Do |
To Do |
| 491 |
Increasing Subsequences |
Medium |
To Do |
To Do |
| 492 |
Construct the Rectangle |
Easy |
To Do |
To Do |
| 493 |
Reverse Pairs |
Hard |
To Do |
To Do |
| 494 |
Target Sum |
Medium |
Markdown |
To Do |
| 495 |
Teemo Attacking |
Medium |
To Do |
To Do |
| 496 |
Next Greater Element I |
Easy |
To Do |
To Do |
| 498 |
Diagonal Traverse |
Medium |
To Do |
To Do |
| 499 |
The Maze III 🔒 |
Hard |
To Do |
To Do |
| 500 |
Keyboard Row |
Easy |
To Do |
To Do |
| 501 |
Find Mode in Binary Search Tree |
Easy |
Markdown |
To Do |
| 502 |
IPO |
Hard |
To Do |
To Do |
| 503 |
Next Greater Element II |
Medium |
Markdown |
To Do |
| 504 |
Base 7 |
Easy |
To Do |
To Do |
| 505 |
The Maze II 🔒 |
Medium |
To Do |
To Do |
| 506 |
Relative Ranks |
Easy |
To Do |
To Do |
| 507 |
Perfect Number |
Easy |
To Do |
To Do |
| 508 |
Most Frequent Subtree Sum |
Medium |
To Do |
To Do |
| 510 |
Inorder Successor in BST II 🔒 |
Medium |
To Do |
To Do |
| 1059 |
All Paths from Source Lead to Destination 🔒 |
Medium |
To Do |
To Do |
| 513 |
Find Bottom Left Tree Value |
Medium |
Markdown |
To Do |
| 514 |
Freedom Trail |
Hard |
To Do |
To Do |
| 515 |
Find Largest Value in Each Tree Row |
Medium |
To Do |
To Do |
| 516 |
Longest Palindromic Subsequence |
Medium |
To Do |
To Do |
| 517 |
Super Washing Machines |
Hard |
To Do |
To Do |
| 518 |
Coin Change 2 |
Medium |
Markdown |
To Do |
| 520 |
Detect Capital |
Easy |
To Do |
To Do |
| 521 |
Longest Uncommon Subsequence I |
Easy |
To Do |
To Do |
| 522 |
Longest Uncommon Subsequence II |
Medium |
To Do |
To Do |
| 523 |
Continuous Subarray Sum |
Medium |
To Do |
To Do |
| 524 |
Longest Word in Dictionary through Deleting |
Medium |
Markdown |
To Do |
| 525 |
Contiguous Array |
Medium |
To Do |
To Do |
| 526 |
Beautiful Arrangement |
Medium |
To Do |
To Do |
| 527 |
Word Abbreviation 🔒 |
Hard |
To Do |
To Do |
| 529 |
Minesweeper |
Medium |
To Do |
To Do |
| 530 |
Minimum Absolute Difference in BST |
Easy |
Markdown |
To Do |
| 531 |
Lonely Pixel I 🔒 |
Medium |
To Do |
To Do |
| 532 |
K-diff Pairs in an Array |
Medium |
To Do |
To Do |
| 533 |
Lonely Pixel II 🔒 |
Medium |
To Do |
To Do |
| 535 |
Encode and Decode TinyURL |
Medium |
To Do |
To Do |
| 536 |
Construct Binary Tree from String 🔒 |
Medium |
To Do |
To Do |
| 537 |
Complex Number Multiplication |
Medium |
To Do |
To Do |
| 538 |
Convert BST to Greater Tree |
Medium |
Markdown |
To Do |
| 539 |
Minimum Time Difference |
Medium |
To Do |
To Do |
| 540 |
Single Element in a Sorted Array |
Medium |
Markdown |
To Do |
| 541 |
Reverse String II |
Easy |
To Do |
To Do |
| 542 |
01 Matrix |
Medium |
To Do |
To Do |
| 543 |
Diameter of Binary Tree |
Easy |
Markdown |
To Do |
| 544 |
Output Contest Matches 🔒 |
Medium |
To Do |
To Do |
| 545 |
Boundary of Binary Tree 🔒 |
Medium |
To Do |
To Do |
| 546 |
Remove Boxes |
Hard |
To Do |
To Do |
| 547 |
Friend Circles |
Medium |
To Do |
To Do |
| 548 |
Split Array with Equal Sum 🔒 |
Medium |
To Do |
To Do |
| 549 |
Binary Tree Longest Consecutive Sequence II 🔒 |
Medium |
To Do |
To Do |
| 551 |
Student Attendance Record I |
Easy |
To Do |
To Do |
| 552 |
Student Attendance Record II |
Hard |
To Do |
To Do |
| 553 |
Optimal Division |
Medium |
To Do |
To Do |
| 554 |
Brick Wall |
Medium |
To Do |
To Do |
| 555 |
Split Concatenated Strings 🔒 |
Medium |
To Do |
To Do |
| 556 |
Next Greater Element III |
Medium |
To Do |
To Do |
| 557 |
Reverse Words in a String III |
Easy |
To Do |
To Do |
| 560 |
Subarray Sum Equals K |
Medium |
To Do |
To Do |
| 561 |
Array Partition I |
Easy |
To Do |
To Do |
| 562 |
Longest Line of Consecutive One in Matrix 🔒 |
Medium |
To Do |
To Do |
| 563 |
Binary Tree Tilt |
Easy |
To Do |
To Do |
| 564 |
Find the Closest Palindrome |
Hard |
To Do |
To Do |
| 565 |
Array Nesting |
Medium |
To Do |
To Do |
| 566 |
Reshape the Matrix |
Easy |
Markdown |
To Do |
| 567 |
Permutation in String |
Medium |
To Do |
To Do |
| 568 |
Maximum Vacation Days 🔒 |
Hard |
To Do |
To Do |
| 572 |
Subtree of Another Tree |
Easy |
Markdown |
To Do |
| 573 |
Squirrel Simulation 🔒 |
Medium |
To Do |
To Do |
| 575 |
Distribute Candies |
Easy |
To Do |
To Do |
| 576 |
Out of Boundary Paths |
Medium |
To Do |
To Do |
| 581 |
Shortest Unsorted Continuous Subarray |
Easy |
To Do |
To Do |
| 582 |
Kill Process 🔒 |
Medium |
To Do |
To Do |
| 583 |
Delete Operation for Two Strings |
Medium |
Markdown |
To Do |
| 587 |
Erect the Fence |
Hard |
To Do |
To Do |
| 588 |
Design In-Memory File System 🔒 |
Hard |
To Do |
To Do |
| 591 |
Tag Validator |
Hard |
To Do |
To Do |
| 592 |
Fraction Addition and Subtraction |
Medium |
To Do |
To Do |
| 593 |
Valid Square |
Medium |
To Do |
To Do |
| 594 |
Longest Harmonious Subsequence |
Easy |
To Do |
To Do |
| 598 |
Range Addition II |
Easy |
To Do |
To Do |
| 599 |
Minimum Index Sum of Two Lists |
Easy |
To Do |
To Do |
| 600 |
Non-negative Integers without Consecutive Ones |
Hard |
To Do |
To Do |
| 604 |
Design Compressed String Iterator 🔒 |
Easy |
To Do |
To Do |
| 605 |
Can Place Flowers |
Easy |
To Do |
To Do |
| 606 |
Construct String from Binary Tree |
Easy |
To Do |
To Do |
| 609 |
Find Duplicate File in System |
Medium |
To Do |
To Do |
| 611 |
Valid Triangle Number |
Medium |
To Do |
To Do |
| 616 |
Add Bold Tag in String 🔒 |
Medium |
To Do |
To Do |
| 617 |
Merge Two Binary Trees |
Easy |
Markdown |
To Do |
| 621 |
Task Scheduler |
Medium |
To Do |
To Do |
| 623 |
Add One Row to Tree |
Medium |
To Do |
To Do |
| 624 |
Maximum Distance in Arrays 🔒 |
Medium |
To Do |
To Do |
| 625 |
Minimum Factorization 🔒 |
Medium |
To Do |
To Do |
| 628 |
Maximum Product of Three Numbers |
Easy |
To Do |
To Do |
| 629 |
K Inverse Pairs Array |
Hard |
To Do |
To Do |
| 630 |
Course Schedule III |
Hard |
To Do |
To Do |
| 631 |
Design Excel Sum Formula 🔒 |
Hard |
To Do |
To Do |
| 632 |
Smallest Range Covering Elements from K Lists |
Hard |
To Do |
To Do |
| 633 |
Sum of Square Numbers |
Medium |
Markdown |
To Do |
| 634 |
Find the Derangement of An Array 🔒 |
Medium |
To Do |
To Do |
| 635 |
Design Log Storage System 🔒 |
Medium |
To Do |
To Do |
| 636 |
Exclusive Time of Functions |
Medium |
To Do |
To Do |
| 637 |
Average of Levels in Binary Tree |
Easy |
Markdown |
To Do |
| 638 |
Shopping Offers |
Medium |
To Do |
To Do |
| 639 |
Decode Ways II |
Hard |
To Do |
To Do |
| 640 |
Solve the Equation |
Medium |
To Do |
To Do |
| 642 |
Design Search Autocomplete System 🔒 |
Hard |
To Do |
To Do |
| 643 |
Maximum Average Subarray I |
Easy |
To Do |
To Do |
| 644 |
Maximum Average Subarray II 🔒 |
Hard |
To Do |
To Do |
| 645 |
Set Mismatch |
Easy |
To Do |
To Do |
| 646 |
Maximum Length of Pair Chain |
Medium |
Markdown |
To Do |
| 647 |
Palindromic Substrings |
Medium |
To Do |
To Do |
| 648 |
Replace Words |
Medium |
To Do |
To Do |
| 649 |
Dota2 Senate |
Medium |
To Do |
To Do |
| 650 |
2 Keys Keyboard |
Medium |
Markdown |
To Do |
| 651 |
4 Keys Keyboard 🔒 |
Medium |
To Do |
To Do |
| 652 |
Find Duplicate Subtrees |
Medium |
To Do |
To Do |
| 653 |
Two Sum IV - Input is a BST |
Easy |
Markdown |
To Do |
| 654 |
Maximum Binary Tree |
Medium |
To Do |
To Do |
| 655 |
Print Binary Tree |
Medium |
To Do |
To Do |
| 656 |
Coin Path 🔒 |
Hard |
To Do |
To Do |
| 657 |
Robot Return to Origin |
Easy |
To Do |
To Do |
| 658 |
Find K Closest Elements |
Medium |
To Do |
To Do |
| 659 |
Split Array into Consecutive Subsequences |
Medium |
To Do |
To Do |
| 660 |
Remove 9 🔒 |
Hard |
To Do |
To Do |
| 661 |
Image Smoother |
Easy |
To Do |
To Do |
| 662 |
Maximum Width of Binary Tree |
Medium |
To Do |
To Do |
| 663 |
Equal Tree Partition 🔒 |
Medium |
To Do |
To Do |
| 664 |
Strange Printer |
Hard |
To Do |
To Do |
| 665 |
Non-decreasing Array |
Easy |
To Do |
To Do |
| 666 |
Path Sum IV 🔒 |
Medium |
To Do |
To Do |
| 667 |
Beautiful Arrangement II |
Medium |
To Do |
To Do |
| 668 |
Kth Smallest Number in Multiplication Table |
Hard |
To Do |
To Do |
| 669 |
Trim a Binary Search Tree |
Easy |
Markdown |
To Do |
| 670 |
Maximum Swap |
Medium |
To Do |
To Do |
| 671 |
Second Minimum Node In a Binary Tree |
Easy |
Markdown |
To Do |
| 672 |
Bulb Switcher II |
Medium |
To Do |
To Do |
| 673 |
Number of Longest Increasing Subsequence |
Medium |
Markdown |
To Do |
| 674 |
Longest Continuous Increasing Subsequence |
Easy |
Markdown |
To Do |
| 675 |
Cut Off Trees for Golf Event |
Hard |
To Do |
To Do |
| 676 |
Implement Magic Dictionary |
Medium |
To Do |
To Do |
| 677 |
Map Sum Pairs |
Medium |
To Do |
To Do |
| 678 |
Valid Parenthesis String |
Medium |
To Do |
To Do |
| 679 |
24 Game |
Hard |
To Do |
To Do |
| 680 |
Valid Palindrome II |
Easy |
Markdown |
To Do |
| 681 |
Next Closest Time 🔒 |
Medium |
To Do |
To Do |
| 682 |
Baseball Game |
Easy |
To Do |
To Do |
| 683 |
K Empty Slots 🔒 |
Hard |
To Do |
To Do |
| 684 |
Redundant Connection |
Medium |
To Do |
To Do |
| 685 |
Redundant Connection II |
Hard |
To Do |
To Do |
| 686 |
Repeated String Match |
Medium |
To Do |
To Do |
| 687 |
Longest Univalue Path |
Easy |
Markdown |
To Do |
| 688 |
Knight Probability in Chessboard |
Medium |
To Do |
To Do |
| 689 |
Maximum Sum of 3 Non-Overlapping Subarrays |
Hard |
To Do |
To Do |
| 690 |
Employee Importance |
Easy |
To Do |
To Do |
| 691 |
Stickers to Spell Word |
Hard |
To Do |
To Do |
| 692 |
Top K Frequent Words |
Medium |
To Do |
To Do |
| 693 |
Binary Number with Alternating Bits |
Easy |
To Do |
To Do |
| 694 |
Number of Distinct Islands 🔒 |
Medium |
To Do |
To Do |
| 695 |
Max Area of Island |
Medium |
To Do |
To Do |
| 696 |
Count Binary Substrings |
Easy |
To Do |
To Do |
| 697 |
Degree of an Array |
Easy |
To Do |
To Do |
| 698 |
Partition to K Equal Sum Subsets |
Medium |
To Do |
To Do |
| 699 |
Falling Squares |
Hard |
To Do |
To Do |
| 711 |
Number of Distinct Islands II 🔒 |
Hard |
To Do |
To Do |
| 712 |
Minimum ASCII Delete Sum for Two Strings |
Medium |
To Do |
To Do |
| 713 |
Subarray Product Less Than K |
Medium |
To Do |
To Do |
| 714 |
Best Time to Buy and Sell Stock with Transaction Fee |
Medium |
Markdown |
To Do |
| 715 |
Range Module |
Hard |
To Do |
To Do |
| 716 |
Max Stack 🔒 |
Easy |
To Do |
To Do |
| 717 |
1-bit and 2-bit Characters |
Easy |
To Do |
To Do |
| 718 |
Maximum Length of Repeated Subarray |
Medium |
To Do |
To Do |
| 719 |
Find K-th Smallest Pair Distance |
Hard |
To Do |
To Do |
| 720 |
Longest Word in Dictionary |
Easy |
To Do |
To Do |
| 721 |
Accounts Merge |
Medium |
To Do |
To Do |
| 722 |
Remove Comments |
Medium |
To Do |
To Do |
| 723 |
Candy Crush 🔒 |
Medium |
To Do |
To Do |
| 724 |
Find Pivot Index |
Easy |
To Do |
To Do |
| 725 |
Split Linked List in Parts |
Medium |
Markdown |
To Do |
| 726 |
Number of Atoms |
Hard |
To Do |
To Do |
| 727 |
Minimum Window Subsequence 🔒 |
Hard |
To Do |
To Do |
| 728 |
Self Dividing Numbers |
Easy |
To Do |
To Do |
| 729 |
My Calendar I |
Medium |
To Do |
To Do |
| 730 |
Count Different Palindromic Subsequences |
Hard |
To Do |
To Do |
| 731 |
My Calendar II |
Medium |
To Do |
To Do |
| 732 |
My Calendar III |
Hard |
To Do |
To Do |
| 733 |
Flood Fill |
Easy |
To Do |
To Do |
| 734 |
Sentence Similarity 🔒 |
Easy |
To Do |
To Do |
| 735 |
Asteroid Collision |
Medium |
To Do |
To Do |
| 736 |
Parse Lisp Expression |
Hard |
To Do |
To Do |
| 737 |
Sentence Similarity II 🔒 |
Medium |
To Do |
To Do |
| 738 |
Monotone Increasing Digits |
Medium |
To Do |
To Do |
| 739 |
Daily Temperatures |
Medium |
Markdown |
To Do |
| 740 |
Delete and Earn |
Medium |
To Do |
To Do |
| 741 |
Cherry Pickup |
Hard |
To Do |
To Do |
| 709 |
To Lower Case |
Easy |
To Do |
To Do |
| 742 |
Closest Leaf in a Binary Tree 🔒 |
Medium |
To Do |
To Do |
| 743 |
Network Delay Time |
Medium |
To Do |
To Do |
| 744 |
Find Smallest Letter Greater Than Target |
Easy |
Markdown |
To Do |
| 745 |
Prefix and Suffix Search |
Hard |
To Do |
To Do |
| 746 |
Min Cost Climbing Stairs |
Easy |
To Do |
To Do |
| 747 |
Largest Number At Least Twice of Others |
Easy |
To Do |
To Do |
| 748 |
Shortest Completing Word |
Easy |
To Do |
To Do |
| 749 |
Contain Virus |
Hard |
To Do |
To Do |
| 750 |
Number Of Corner Rectangles 🔒 |
Medium |
To Do |
To Do |
| 751 |
IP to CIDR 🔒 |
Medium |
To Do |
To Do |
| 752 |
Open the Lock |
Medium |
To Do |
To Do |
| 753 |
Cracking the Safe |
Hard |
To Do |
To Do |
| 754 |
Reach a Number |
Medium |
To Do |
To Do |
| 755 |
Pour Water 🔒 |
Medium |
To Do |
To Do |
| 756 |
Pyramid Transition Matrix |
Medium |
To Do |
To Do |
| 426 |
Convert Binary Search Tree to Sorted Doubly Linked List 🔒 |
Medium |
To Do |
To Do |
| 757 |
Set Intersection Size At Least Two |
Hard |
To Do |
To Do |
| 758 |
Bold Words in String 🔒 |
Easy |
To Do |
To Do |
| 759 |
Employee Free Time 🔒 |
Hard |
To Do |
To Do |
| 760 |
Find Anagram Mappings 🔒 |
Easy |
To Do |
To Do |
| 761 |
Special Binary String |
Hard |
To Do |
To Do |
| 429 |
N-ary Tree Level Order Traversal |
Medium |
To Do |
To Do |
| 428 |
Serialize and Deserialize N-ary Tree 🔒 |
Hard |
To Do |
To Do |
| 430 |
Flatten a Multilevel Doubly Linked List |
Medium |
To Do |
To Do |
| 762 |
Prime Number of Set Bits in Binary Representation |
Easy |
To Do |
To Do |
| 763 |
Partition Labels |
Medium |
To Do |
To Do |
| 764 |
Largest Plus Sign |
Medium |
To Do |
To Do |
| 765 |
Couples Holding Hands |
Hard |
To Do |
To Do |
| 431 |
Encode N-ary Tree to Binary Tree 🔒 |
Hard |
To Do |
To Do |
| 427 |
Construct Quad Tree |
Medium |
To Do |
To Do |
| 558 |
Logical OR of Two Binary Grids Represented as Quad-Trees |
Medium |
To Do |
To Do |
| 559 |
Maximum Depth of N-ary Tree |
Easy |
To Do |
To Do |
| 589 |
N-ary Tree Preorder Traversal |
Easy |
To Do |
To Do |
| 590 |
N-ary Tree Postorder Traversal |
Easy |
To Do |
To Do |
| 766 |
Toeplitz Matrix |
Easy |
To Do |
To Do |
| 767 |
Reorganize String |
Medium |
To Do |
To Do |
| 768 |
Max Chunks To Make Sorted II |
Hard |
To Do |
To Do |
| 769 |
Max Chunks To Make Sorted |
Medium |
To Do |
To Do |
| 770 |
Basic Calculator IV |
Hard |
To Do |
To Do |
| 771 |
Jewels and Stones |
Easy |
To Do |
To Do |
| 700 |
Search in a Binary Search Tree |
Easy |
To Do |
To Do |
| 701 |
Insert into a Binary Search Tree |
Medium |
To Do |
To Do |
| 772 |
Basic Calculator III 🔒 |
Hard |
To Do |
To Do |
| 702 |
Search in a Sorted Array of Unknown Size 🔒 |
Medium |
To Do |
To Do |
| 773 |
Sliding Puzzle |
Hard |
To Do |
To Do |
| 774 |
Minimize Max Distance to Gas Station 🔒 |
Hard |
To Do |
To Do |
| 703 |
Kth Largest Element in a Stream |
Easy |
To Do |
To Do |
| 775 |
Global and Local Inversions |
Medium |
To Do |
To Do |
| 776 |
Split BST 🔒 |
Medium |
To Do |
To Do |
| 704 |
Binary Search |
Easy |
To Do |
To Do |
| 777 |
Swap Adjacent in LR String |
Medium |
To Do |
To Do |
| 778 |
Swim in Rising Water |
Hard |
To Do |
To Do |
| 779 |
K-th Symbol in Grammar |
Medium |
To Do |
To Do |
| 780 |
Reaching Points |
Hard |
To Do |
To Do |
| 781 |
Rabbits in Forest |
Medium |
To Do |
To Do |
| 782 |
Transform to Chessboard |
Hard |
To Do |
To Do |
| 783 |
Minimum Distance Between BST Nodes |
Easy |
Markdown |
To Do |
| 784 |
Letter Case Permutation |
Medium |
To Do |
To Do |
| 785 |
Is Graph Bipartite? |
Medium |
To Do |
To Do |
| 786 |
K-th Smallest Prime Fraction |
Hard |
To Do |
To Do |
| 787 |
Cheapest Flights Within K Stops |
Medium |
To Do |
To Do |
| 788 |
Rotated Digits |
Easy |
To Do |
To Do |
| 789 |
Escape The Ghosts |
Medium |
To Do |
To Do |
| 790 |
Domino and Tromino Tiling |
Medium |
To Do |
To Do |
| 791 |
Custom Sort String |
Medium |
To Do |
To Do |
| 792 |
Number of Matching Subsequences |
Medium |
To Do |
To Do |
| 793 |
Preimage Size of Factorial Zeroes Function |
Hard |
To Do |
To Do |
| 794 |
Valid Tic-Tac-Toe State |
Medium |
To Do |
To Do |
| 795 |
Number of Subarrays with Bounded Maximum |
Medium |
To Do |
To Do |
| 796 |
Rotate String |
Easy |
To Do |
To Do |
| 797 |
All Paths From Source to Target |
Medium |
To Do |
To Do |
| 798 |
Smallest Rotation with Highest Score |
Hard |
To Do |
To Do |
| 799 |
Champagne Tower |
Medium |
To Do |
To Do |
| 705 |
Design HashSet |
Easy |
To Do |
To Do |
| 706 |
Design HashMap |
Easy |
To Do |
To Do |
| 800 |
Similar RGB Color 🔒 |
Easy |
To Do |
To Do |
| 801 |
Minimum Swaps To Make Sequences Increasing |
Medium |
To Do |
To Do |
| 802 |
Find Eventual Safe States |
Medium |
To Do |
To Do |
| 803 |
Bricks Falling When Hit |
Hard |
To Do |
To Do |
| 804 |
Unique Morse Code Words |
Easy |
To Do |
To Do |
| 805 |
Split Array With Same Average |
Hard |
To Do |
To Do |
| 806 |
Number of Lines To Write String |
Easy |
To Do |
To Do |
| 807 |
Max Increase to Keep City Skyline |
Medium |
To Do |
To Do |
| 808 |
Soup Servings |
Medium |
To Do |
To Do |
| 809 |
Expressive Words |
Medium |
To Do |
To Do |
| 810 |
Chalkboard XOR Game |
Hard |
To Do |
To Do |
| 811 |
Subdomain Visit Count |
Easy |
To Do |
To Do |
| 812 |
Largest Triangle Area |
Easy |
To Do |
To Do |
| 813 |
Largest Sum of Averages |
Medium |
To Do |
To Do |
| 814 |
Binary Tree Pruning |
Medium |
To Do |
To Do |
| 815 |
Bus Routes |
Hard |
To Do |
To Do |
| 816 |
Ambiguous Coordinates |
Medium |
To Do |
To Do |
| 817 |
Linked List Components |
Medium |
To Do |
To Do |
| 818 |
Race Car |
Hard |
To Do |
To Do |
| 819 |
Most Common Word |
Easy |
To Do |
To Do |
| 707 |
Design Linked List |
Medium |
To Do |
To Do |
| 820 |
Short Encoding of Words |
Medium |
To Do |
To Do |
| 821 |
Shortest Distance to a Character |
Easy |
To Do |
To Do |
| 822 |
Card Flipping Game |
Medium |
To Do |
To Do |
| 823 |
Binary Trees With Factors |
Medium |
To Do |
To Do |
| 708 |
Insert into a Sorted Circular Linked List 🔒 |
Medium |
To Do |
To Do |
| 824 |
Goat Latin |
Easy |
To Do |
To Do |
| 825 |
Friends Of Appropriate Ages |
Medium |
To Do |
To Do |
| 826 |
Most Profit Assigning Work |
Medium |
To Do |
To Do |
| 827 |
Making A Large Island |
Hard |
To Do |
To Do |
| 828 |
Count Unique Characters of All Substrings of a Given String |
Hard |
To Do |
To Do |
| 829 |
Consecutive Numbers Sum |
Hard |
To Do |
To Do |
| 830 |
Positions of Large Groups |
Easy |
To Do |
To Do |
| 831 |
Masking Personal Information |
Medium |
To Do |
To Do |
| 641 |
Design Circular Deque |
Medium |
To Do |
To Do |
| 622 |
Design Circular Queue |
Medium |
To Do |
To Do |
| 832 |
Flipping an Image |
Easy |
To Do |
To Do |
| 833 |
Find And Replace in String |
Medium |
To Do |
To Do |
| 834 |
Sum of Distances in Tree |
Hard |
To Do |
To Do |
| 835 |
Image Overlap |
Medium |
To Do |
To Do |
| 489 |
Robot Room Cleaner 🔒 |
Hard |
To Do |
To Do |
| 836 |
Rectangle Overlap |
Easy |
To Do |
To Do |
| 837 |
New 21 Game |
Medium |
To Do |
To Do |
| 838 |
Push Dominoes |
Medium |
To Do |
To Do |
| 839 |
Similar String Groups |
Hard |
To Do |
To Do |
| 840 |
Magic Squares In Grid |
Medium |
To Do |
To Do |
| 841 |
Keys and Rooms |
Medium |
To Do |
To Do |
| 842 |
Split Array into Fibonacci Sequence |
Medium |
To Do |
To Do |
| 843 |
Guess the Word |
Hard |
To Do |
To Do |
| 844 |
Backspace String Compare |
Easy |
To Do |
To Do |
| 845 |
Longest Mountain in Array |
Medium |
To Do |
To Do |
| 846 |
Hand of Straights |
Medium |
To Do |
To Do |
| 847 |
Shortest Path Visiting All Nodes |
Hard |
To Do |
To Do |
| 848 |
Shifting Letters |
Medium |
To Do |
To Do |
| 849 |
Maximize Distance to Closest Person |
Medium |
To Do |
To Do |
| 850 |
Rectangle Area II |
Hard |
To Do |
To Do |
| 851 |
Loud and Rich |
Medium |
To Do |
To Do |
| 852 |
Peak Index in a Mountain Array |
Easy |
To Do |
To Do |
| 853 |
Car Fleet |
Medium |
To Do |
To Do |
| 854 |
K-Similar Strings |
Hard |
To Do |
To Do |
| 855 |
Exam Room |
Medium |
To Do |
To Do |
| 856 |
Score of Parentheses |
Medium |
To Do |
To Do |
| 857 |
Minimum Cost to Hire K Workers |
Hard |
To Do |
To Do |
| 858 |
Mirror Reflection |
Medium |
To Do |
To Do |
| 859 |
Buddy Strings |
Easy |
To Do |
To Do |
| 860 |
Lemonade Change |
Easy |
To Do |
To Do |
| 861 |
Score After Flipping Matrix |
Medium |
To Do |
To Do |
| 862 |
Shortest Subarray with Sum at Least K |
Hard |
To Do |
To Do |
| 863 |
All Nodes Distance K in Binary Tree |
Medium |
To Do |
To Do |
| 710 |
Random Pick with Blacklist |
Hard |
To Do |
To Do |
| 864 |
Shortest Path to Get All Keys |
Hard |
To Do |
To Do |
| 865 |
Smallest Subtree with all the Deepest Nodes |
Medium |
To Do |
To Do |
| 866 |
Prime Palindrome |
Medium |
To Do |
To Do |
| 867 |
Transpose Matrix |
Easy |
To Do |
To Do |
| 868 |
Binary Gap |
Easy |
To Do |
To Do |
| 869 |
Reordered Power of 2 |
Medium |
To Do |
To Do |
| 870 |
Advantage Shuffle |
Medium |
To Do |
To Do |
| 871 |
Minimum Number of Refueling Stops |
Hard |
To Do |
To Do |
| 470 |
Implement Rand10() Using Rand7() |
Medium |
To Do |
To Do |
| 872 |
Leaf-Similar Trees |
Easy |
To Do |
To Do |
| 873 |
Length of Longest Fibonacci Subsequence |
Medium |
To Do |
To Do |
| 874 |
Walking Robot Simulation |
Easy |
To Do |
To Do |
| 875 |
Koko Eating Bananas |
Medium |
To Do |
To Do |
| 876 |
Middle of the Linked List |
Easy |
To Do |
To Do |
| 877 |
Stone Game |
Medium |
To Do |
To Do |
| 878 |
Nth Magical Number |
Hard |
To Do |
To Do |
| 879 |
Profitable Schemes |
Hard |
To Do |
To Do |
| 528 |
Random Pick with Weight |
Medium |
To Do |
To Do |
| 519 |
Random Flip Matrix |
Medium |
To Do |
To Do |
| 497 |
Random Point in Non-overlapping Rectangles |
Medium |
To Do |
To Do |
| 478 |
Generate Random Point in a Circle |
Medium |
To Do |
To Do |
| 880 |
Decoded String at Index |
Medium |
To Do |
To Do |
| 881 |
Boats to Save People |
Medium |
To Do |
To Do |
| 882 |
Reachable Nodes In Subdivided Graph |
Hard |
To Do |
To Do |
| 883 |
Projection Area of 3D Shapes |
Easy |
To Do |
To Do |
| 884 |
Uncommon Words from Two Sentences |
Easy |
To Do |
To Do |
| 885 |
Spiral Matrix III |
Medium |
To Do |
To Do |
| 886 |
Possible Bipartition |
Medium |
To Do |
To Do |
| 887 |
Super Egg Drop |
Hard |
To Do |
To Do |
| 888 |
Fair Candy Swap |
Easy |
To Do |
To Do |
| 889 |
Construct Binary Tree from Preorder and Postorder Traversal |
Medium |
To Do |
To Do |
| 890 |
Find and Replace Pattern |
Medium |
To Do |
To Do |
| 891 |
Sum of Subsequence Widths |
Hard |
To Do |
To Do |
| 892 |
Surface Area of 3D Shapes |
Easy |
To Do |
To Do |
| 893 |
Groups of Special-Equivalent Strings |
Easy |
To Do |
To Do |
| 894 |
All Possible Full Binary Trees |
Medium |
To Do |
To Do |
| 895 |
Maximum Frequency Stack |
Hard |
To Do |
To Do |
| 896 |
Monotonic Array |
Easy |
To Do |
To Do |
| 897 |
Increasing Order Search Tree |
Easy |
To Do |
To Do |
| 898 |
Bitwise ORs of Subarrays |
Medium |
To Do |
To Do |
| 899 |
Orderly Queue |
Hard |
To Do |
To Do |
| 900 |
RLE Iterator |
Medium |
To Do |
To Do |
| 901 |
Online Stock Span |
Medium |
To Do |
To Do |
| 902 |
Numbers At Most N Given Digit Set |
Hard |
To Do |
To Do |
| 903 |
Valid Permutations for DI Sequence |
Hard |
To Do |
To Do |
| 904 |
Fruit Into Baskets |
Medium |
To Do |
To Do |
| 905 |
Sort Array By Parity |
Easy |
To Do |
To Do |
| 906 |
Super Palindromes |
Hard |
To Do |
To Do |
| 907 |
Sum of Subarray Minimums |
Medium |
To Do |
To Do |
| 908 |
Smallest Range I |
Easy |
To Do |
To Do |
| 909 |
Snakes and Ladders |
Medium |
To Do |
To Do |
| 910 |
Smallest Range II |
Medium |
To Do |
To Do |
| 911 |
Online Election |
Medium |
To Do |
To Do |
| 912 |
Sort an Array |
Medium |
To Do |
To Do |
| 913 |
Cat and Mouse |
Hard |
To Do |
To Do |
| 914 |
X of a Kind in a Deck of Cards |
Easy |
To Do |
To Do |
| 915 |
Partition Array into Disjoint Intervals |
Medium |
To Do |
To Do |
| 916 |
Word Subsets |
Medium |
To Do |
To Do |
| 917 |
Reverse Only Letters |
Easy |
To Do |
To Do |
| 918 |
Maximum Sum Circular Subarray |
Medium |
To Do |
To Do |
| 919 |
Complete Binary Tree Inserter |
Medium |
To Do |
To Do |
| 920 |
Number of Music Playlists |
Hard |
To Do |
To Do |
| 921 |
Minimum Add to Make Parentheses Valid |
Medium |
To Do |
To Do |
| 922 |
Sort Array By Parity II |
Easy |
To Do |
To Do |
| 923 |
3Sum With Multiplicity |
Medium |
To Do |
To Do |
| 924 |
Minimize Malware Spread |
Hard |
To Do |
To Do |
| 925 |
Long Pressed Name |
Easy |
To Do |
To Do |
| 926 |
Flip String to Monotone Increasing |
Medium |
To Do |
To Do |
| 927 |
Three Equal Parts |
Hard |
To Do |
To Do |
| 928 |
Minimize Malware Spread II |
Hard |
To Do |
To Do |
| 929 |
Unique Email Addresses |
Easy |
To Do |
To Do |
| 930 |
Binary Subarrays With Sum |
Medium |
To Do |
To Do |
| 931 |
Minimum Falling Path Sum |
Medium |
To Do |
To Do |
| 932 |
Beautiful Array |
Medium |
To Do |
To Do |
| 933 |
Number of Recent Calls |
Easy |
To Do |
To Do |
| 934 |
Shortest Bridge |
Medium |
To Do |
To Do |
| 935 |
Knight Dialer |
Medium |
To Do |
To Do |
| 936 |
Stamping The Sequence |
Hard |
To Do |
To Do |
| 937 |
Reorder Data in Log Files |
Easy |
To Do |
To Do |
| 938 |
Range Sum of BST |
Easy |
To Do |
To Do |
| 939 |
Minimum Area Rectangle |
Medium |
To Do |
To Do |
| 940 |
Distinct Subsequences II |
Hard |
To Do |
To Do |
| 941 |
Valid Mountain Array |
Easy |
To Do |
To Do |
| 942 |
DI String Match |
Easy |
To Do |
To Do |
| 943 |
Find the Shortest Superstring |
Hard |
To Do |
To Do |
| 944 |
Delete Columns to Make Sorted |
Easy |
To Do |
To Do |
| 945 |
Minimum Increment to Make Array Unique |
Medium |
To Do |
To Do |
| 946 |
Validate Stack Sequences |
Medium |
To Do |
To Do |
| 947 |
Most Stones Removed with Same Row or Column |
Medium |
To Do |
To Do |
| 948 |
Bag of Tokens |
Medium |
To Do |
To Do |
| 949 |
Largest Time for Given Digits |
Medium |
To Do |
To Do |
| 950 |
Reveal Cards In Increasing Order |
Medium |
To Do |
To Do |
| 951 |
Flip Equivalent Binary Trees |
Medium |
To Do |
To Do |
| 952 |
Largest Component Size by Common Factor |
Hard |
To Do |
To Do |
| 953 |
Verifying an Alien Dictionary |
Easy |
To Do |
To Do |
| 954 |
Array of Doubled Pairs |
Medium |
To Do |
To Do |
| 955 |
Delete Columns to Make Sorted II |
Medium |
To Do |
To Do |
| 956 |
Tallest Billboard |
Hard |
To Do |
To Do |
| 957 |
Prison Cells After N Days |
Medium |
To Do |
To Do |
| 958 |
Check Completeness of a Binary Tree |
Medium |
To Do |
To Do |
| 959 |
Regions Cut By Slashes |
Medium |
To Do |
To Do |
| 960 |
Delete Columns to Make Sorted III |
Hard |
To Do |
To Do |
| 961 |
N-Repeated Element in Size 2N Array |
Easy |
To Do |
To Do |
| 962 |
Maximum Width Ramp |
Medium |
To Do |
To Do |
| 963 |
Minimum Area Rectangle II |
Medium |
To Do |
To Do |
| 964 |
Least Operators to Express Number |
Hard |
To Do |
To Do |
| 965 |
Univalued Binary Tree |
Easy |
To Do |
To Do |
| 966 |
Vowel Spellchecker |
Medium |
To Do |
To Do |
| 967 |
Numbers With Same Consecutive Differences |
Medium |
To Do |
To Do |
| 968 |
Binary Tree Cameras |
Hard |
To Do |
To Do |
| 969 |
Pancake Sorting |
Medium |
To Do |
To Do |
| 970 |
Powerful Integers |
Easy |
To Do |
To Do |
| 971 |
Flip Binary Tree To Match Preorder Traversal |
Medium |
To Do |
To Do |
| 972 |
Equal Rational Numbers |
Hard |
To Do |
To Do |
| 509 |
Fibonacci Number |
Easy |
To Do |
To Do |
| 973 |
K Closest Points to Origin |
Medium |
To Do |
To Do |
| 974 |
Subarray Sums Divisible by K |
Medium |
To Do |
To Do |
| 975 |
Odd Even Jump |
Hard |
To Do |
To Do |
| 976 |
Largest Perimeter Triangle |
Easy |
To Do |
To Do |
| 977 |
Squares of a Sorted Array |
Easy |
To Do |
To Do |
| 978 |
Longest Turbulent Subarray |
Medium |
To Do |
To Do |
| 979 |
Distribute Coins in Binary Tree |
Medium |
To Do |
To Do |
| 980 |
Unique Paths III |
Hard |
To Do |
To Do |
| 981 |
Time Based Key-Value Store |
Medium |
To Do |
To Do |
| 982 |
Triples with Bitwise AND Equal To Zero |
Hard |
To Do |
To Do |
| 983 |
Minimum Cost For Tickets |
Medium |
To Do |
To Do |
| 984 |
String Without AAA or BBB |
Medium |
To Do |
To Do |
| 985 |
Sum of Even Numbers After Queries |
Easy |
To Do |
To Do |
| 986 |
Interval List Intersections |
Medium |
To Do |
To Do |
| 987 |
Vertical Order Traversal of a Binary Tree |
Medium |
To Do |
To Do |
| 988 |
Smallest String Starting From Leaf |
Medium |
To Do |
To Do |
| 989 |
Add to Array-Form of Integer |
Easy |
To Do |
To Do |
| 990 |
Satisfiability of Equality Equations |
Medium |
To Do |
To Do |
| 991 |
Broken Calculator |
Medium |
To Do |
To Do |
| 992 |
Subarrays with K Different Integers |
Hard |
To Do |
To Do |
| 993 |
Cousins in Binary Tree |
Easy |
To Do |
To Do |
| 994 |
Rotting Oranges |
Medium |
To Do |
To Do |
| 995 |
Minimum Number of K Consecutive Bit Flips |
Hard |
To Do |
To Do |
| 996 |
Number of Squareful Arrays |
Hard |
To Do |
To Do |
| 997 |
Find the Town Judge |
Easy |
To Do |
To Do |
| 998 |
Maximum Binary Tree II |
Medium |
To Do |
To Do |
| 999 |
Available Captures for Rook |
Easy |
To Do |
To Do |
| 1000 |
Minimum Cost to Merge Stones |
Hard |
To Do |
To Do |
| 1001 |
Grid Illumination |
Hard |
To Do |
To Do |
| 1002 |
Find Common Characters |
Easy |
To Do |
To Do |
| 1003 |
Check If Word Is Valid After Substitutions |
Medium |
To Do |
To Do |
| 1004 |
Max Consecutive Ones III |
Medium |
To Do |
To Do |
| 1005 |
Maximize Sum Of Array After K Negations |
Easy |
To Do |
To Do |
| 1006 |
Clumsy Factorial |
Medium |
To Do |
To Do |
| 1007 |
Minimum Domino Rotations For Equal Row |
Medium |
To Do |
To Do |
| 1008 |
Construct Binary Search Tree from Preorder Traversal |
Medium |
To Do |
To Do |
| 1055 |
Shortest Way to Form String 🔒 |
Medium |
To Do |
To Do |
| 1057 |
Campus Bikes 🔒 |
Medium |
To Do |
To Do |
| 1058 |
Minimize Rounding Error to Meet Target 🔒 |
Medium |
To Do |
To Do |
| 1009 |
Complement of Base 10 Integer |
Easy |
To Do |
To Do |
| 1010 |
Pairs of Songs With Total Durations Divisible by 60 |
Easy |
To Do |
To Do |
| 1011 |
Capacity To Ship Packages Within D Days |
Medium |
To Do |
To Do |
| 1012 |
Numbers With Repeated Digits |
Hard |
To Do |
To Do |
| 1061 |
Lexicographically Smallest Equivalent String 🔒 |
Medium |
To Do |
To Do |
| 1060 |
Missing Element in Sorted Array 🔒 |
Medium |
To Do |
To Do |
| 1062 |
Longest Repeating Substring 🔒 |
Medium |
To Do |
To Do |
| 1063 |
Number of Valid Subarrays 🔒 |
Hard |
To Do |
To Do |
| 1013 |
Partition Array Into Three Parts With Equal Sum |
Easy |
To Do |
To Do |
| 1014 |
Best Sightseeing Pair |
Medium |
To Do |
To Do |
| 1015 |
Smallest Integer Divisible by K |
Medium |
To Do |
To Do |
| 1016 |
Binary String With Substrings Representing 1 To N |
Medium |
To Do |
To Do |
| 1064 |
Fixed Point 🔒 |
Easy |
To Do |
To Do |
| 1066 |
Campus Bikes II 🔒 |
Medium |
To Do |
To Do |
| 1067 |
Digit Count in Range 🔒 |
Hard |
To Do |
To Do |
| 1056 |
Confusing Number 🔒 |
Easy |
To Do |
To Do |
| 1017 |
Convert to Base -2 |
Medium |
To Do |
To Do |
| 1018 |
Binary Prefix Divisible By 5 |
Easy |
To Do |
To Do |
| 1019 |
Next Greater Node In Linked List |
Medium |
To Do |
To Do |
| 1020 |
Number of Enclaves |
Medium |
To Do |
To Do |
| 1086 |
High Five 🔒 |
Easy |
To Do |
To Do |
| 1065 |
Index Pairs of a String 🔒 |
Easy |
To Do |
To Do |
| 1087 |
Brace Expansion 🔒 |
Medium |
To Do |
To Do |
| 1088 |
Confusing Number II 🔒 |
Hard |
To Do |
To Do |
| 1021 |
Remove Outermost Parentheses |
Easy |
To Do |
To Do |
| 1022 |
Sum of Root To Leaf Binary Numbers |
Easy |
To Do |
To Do |
| 1023 |
Camelcase Matching |
Medium |
To Do |
To Do |
| 1024 |
Video Stitching |
Medium |
To Do |
To Do |
| 1085 |
Sum of Digits in the Minimum Number 🔒 |
Easy |
To Do |
To Do |
| 1099 |
Two Sum Less Than K 🔒 |
Easy |
To Do |
To Do |
| 1100 |
Find K-Length Substrings With No Repeated Characters 🔒 |
Medium |
To Do |
To Do |
| 1101 |
The Earliest Moment When Everyone Become Friends 🔒 |
Medium |
To Do |
To Do |
| 1025 |
Divisor Game |
Easy |
To Do |
To Do |
| 1027 |
Longest Arithmetic Subsequence |
Medium |
To Do |
To Do |
| 1118 |
Number of Days in a Month 🔒 |
Easy |
To Do |
To Do |
| 1119 |
Remove Vowels from a String 🔒 |
Easy |
To Do |
To Do |
| 1134 |
Armstrong Number 🔒 |
Easy |
To Do |
To Do |
| 1120 |
Maximum Average Subtree 🔒 |
Medium |
To Do |
To Do |
| 1026 |
Maximum Difference Between Node and Ancestor |
Medium |
To Do |
To Do |
| 1028 |
Recover a Tree From Preorder Traversal |
Hard |
To Do |
To Do |
| 1030 |
Matrix Cells in Distance Order |
Easy |
To Do |
To Do |
| 1029 |
Two City Scheduling |
Medium |
To Do |
To Do |
| 1031 |
Maximum Sum of Two Non-Overlapping Subarrays |
Medium |
To Do |
To Do |
| 1032 |
Stream of Characters |
Hard |
To Do |
To Do |
| 1133 |
Largest Unique Number 🔒 |
Easy |
To Do |
To Do |
| 1102 |
Path With Maximum Minimum Value 🔒 |
Medium |
To Do |
To Do |
| 1135 |
Connecting Cities With Minimum Cost 🔒 |
Medium |
To Do |
To Do |
| 1136 |
Parallel Courses 🔒 |
Hard |
To Do |
To Do |
| 1150 |
Check If a Number Is Majority Element in a Sorted Array 🔒 |
Easy |
To Do |
To Do |
| 1033 |
Moving Stones Until Consecutive |
Easy |
To Do |
To Do |
| 1034 |
Coloring A Border |
Medium |
To Do |
To Do |
| 1035 |
Uncrossed Lines |
Medium |
To Do |
To Do |
| 1036 |
Escape a Large Maze |
Hard |
To Do |
To Do |
| 1151 |
Minimum Swaps to Group All 1's Together 🔒 |
Medium |
To Do |
To Do |
| 1152 |
Analyze User Website Visit Pattern 🔒 |
Medium |
To Do |
To Do |
| 1039 |
Minimum Score Triangulation of Polygon |
Medium |
To Do |
To Do |
| 1160 |
Find Words That Can Be Formed by Characters |
Easy |
To Do |
To Do |
| 1040 |
Moving Stones Until Consecutive II |
Medium |
To Do |
To Do |
| 1038 |
Binary Search Tree to Greater Sum Tree |
Medium |
To Do |
To Do |
| 1037 |
Valid Boomerang |
Easy |
To Do |
To Do |
| 1161 |
Maximum Level Sum of a Binary Tree |
Medium |
To Do |
To Do |
| 1162 |
As Far from Land as Possible |
Medium |
To Do |
To Do |
| 1121 |
Divide Array Into Increasing Sequences 🔒 |
Hard |
To Do |
To Do |
| 1041 |
Robot Bounded In Circle |
Medium |
To Do |
To Do |
| 1042 |
Flower Planting With No Adjacent |
Easy |
To Do |
To Do |
| 1043 |
Partition Array for Maximum Sum |
Medium |
To Do |
To Do |
| 1044 |
Longest Duplicate Substring |
Hard |
To Do |
To Do |
| 1165 |
Single-Row Keyboard 🔒 |
Easy |
To Do |
To Do |
| 1153 |
String Transforms Into Another String 🔒 |
Hard |
To Do |
To Do |
| 1166 |
Design File System 🔒 |
Medium |
To Do |
To Do |
| 1167 |
Minimum Cost to Connect Sticks 🔒 |
Medium |
To Do |
To Do |
| 1046 |
Last Stone Weight |
Easy |
To Do |
To Do |
| 1047 |
Remove All Adjacent Duplicates In String |
Easy |
To Do |
To Do |
| 1048 |
Longest String Chain |
Medium |
To Do |
To Do |
| 1049 |
Last Stone Weight II |
Medium |
To Do |
To Do |
| 1180 |
Count Substrings with Only One Distinct Letter 🔒 |
Easy |
To Do |
To Do |
| 1181 |
Before and After Puzzle 🔒 |
Medium |
To Do |
To Do |
| 1163 |
Last Substring in Lexicographical Order |
Hard |
To Do |
To Do |
| 1182 |
Shortest Distance to Target Color 🔒 |
Medium |
To Do |
To Do |
| 1051 |
Height Checker |
Easy |
To Do |
To Do |
| 1052 |
Grumpy Bookstore Owner |
Medium |
To Do |
To Do |
| 1053 |
Previous Permutation With One Swap |
Medium |
To Do |
To Do |
| 1054 |
Distant Barcodes |
Medium |
To Do |
To Do |
| 1196 |
How Many Apples Can You Put into the Basket 🔒 |
Easy |
To Do |
To Do |
| 1197 |
Minimum Knight Moves 🔒 |
Medium |
To Do |
To Do |
| 1198 |
Find Smallest Common Element in All Rows 🔒 |
Medium |
To Do |
To Do |
| 1168 |
Optimize Water Distribution in a Village 🔒 |
Hard |
To Do |
To Do |
| 1074 |
Number of Submatrices That Sum to Target |
Hard |
To Do |
To Do |
| 1071 |
Greatest Common Divisor of Strings |
Easy |
To Do |
To Do |
| 1072 |
Flip Columns For Maximum Number of Equal Rows |
Medium |
To Do |
To Do |
| 1073 |
Adding Two Negabinary Numbers |
Medium |
To Do |
To Do |
| 1213 |
Intersection of Three Sorted Arrays 🔒 |
Easy |
To Do |
To Do |
| 1214 |
Two Sum BSTs 🔒 |
Medium |
To Do |
To Do |
| 1215 |
Stepping Numbers 🔒 |
Medium |
To Do |
To Do |
| 1183 |
Maximum Number of Ones 🔒 |
Hard |
To Do |
To Do |
| 1078 |
Occurrences After Bigram |
Easy |
To Do |
To Do |
| 1080 |
Insufficient Nodes in Root to Leaf Paths |
Medium |
To Do |
To Do |
| 1081 |
Smallest Subsequence of Distinct Characters |
Medium |
To Do |
To Do |
| 1079 |
Letter Tile Possibilities |
Medium |
To Do |
To Do |
| 1228 |
Missing Number In Arithmetic Progression 🔒 |
Easy |
To Do |
To Do |
| 1229 |
Meeting Scheduler 🔒 |
Medium |
To Do |
To Do |
| 1230 |
Toss Strange Coins 🔒 |
Medium |
To Do |
To Do |
| 1199 |
Minimum Time to Build Blocks 🔒 |
Hard |
To Do |
To Do |
| 1089 |
Duplicate Zeros |
Easy |
To Do |
To Do |
| 1090 |
Largest Values From Labels |
Medium |
To Do |
To Do |
| 1092 |
Shortest Common Supersequence |
Hard |
To Do |
To Do |
| 1091 |
Shortest Path in Binary Matrix |
Medium |
To Do |
To Do |
| 1243 |
Array Transformation 🔒 |
Easy |
To Do |
To Do |
| 1244 |
Design A Leaderboard 🔒 |
Medium |
To Do |
To Do |
| 1245 |
Tree Diameter 🔒 |
Medium |
To Do |
To Do |
| 1216 |
Valid Palindrome III 🔒 |
Hard |
To Do |
To Do |
| 1093 |
Statistics from a Large Sample |
Medium |
To Do |
To Do |
| 1094 |
Car Pooling |
Medium |
To Do |
To Do |
| 1095 |
Find in Mountain Array |
Hard |
To Do |
To Do |
| 1096 |
Brace Expansion II |
Hard |
To Do |
To Do |
| 1256 |
Encode Number 🔒 |
Medium |
To Do |
To Do |
| 1257 |
Smallest Common Region 🔒 |
Medium |
To Do |
To Do |
| 1258 |
Synonymous Sentences 🔒 |
Medium |
To Do |
To Do |
| 1231 |
Divide Chocolate 🔒 |
Hard |
To Do |
To Do |
| 1104 |
Path In Zigzag Labelled Binary Tree |
Medium |
To Do |
To Do |
| 1103 |
Distribute Candies to People |
Easy |
To Do |
To Do |
| 1105 |
Filling Bookcase Shelves |
Medium |
To Do |
To Do |
| 1106 |
Parsing A Boolean Expression |
Hard |
To Do |
To Do |
| 1271 |
Hexspeak 🔒 |
Easy |
To Do |
To Do |
| 1272 |
Remove Interval 🔒 |
Medium |
To Do |
To Do |
| 1273 |
Delete Tree Nodes 🔒 |
Medium |
To Do |
To Do |
| 1246 |
Palindrome Removal 🔒 |
Hard |
To Do |
To Do |
| 1108 |
Defanging an IP Address |
Easy |
To Do |
To Do |
| 1109 |
Corporate Flight Bookings |
Medium |
To Do |
To Do |
| 1110 |
Delete Nodes And Return Forest |
Medium |
To Do |
To Do |
| 1111 |
Maximum Nesting Depth of Two Valid Parentheses Strings |
Medium |
To Do |
To Do |
| 1286 |
Iterator for Combination |
Medium |
To Do |
To Do |
| 1291 |
Sequential Digits |
Medium |
To Do |
To Do |
| 1259 |
Handshakes That Don't Cross 🔒 |
Hard |
To Do |
To Do |
| 1122 |
Relative Sort Array |
Easy |
To Do |
To Do |
| 1123 |
Lowest Common Ancestor of Deepest Leaves |
Medium |
To Do |
To Do |
| 1124 |
Longest Well-Performing Interval |
Medium |
To Do |
To Do |
| 1125 |
Smallest Sufficient Team |
Hard |
To Do |
To Do |
| 1287 |
Element Appearing More Than 25% In Sorted Array |
Easy |
To Do |
To Do |
| 1288 |
Remove Covered Intervals |
Medium |
To Do |
To Do |
| 1289 |
Minimum Falling Path Sum II |
Hard |
To Do |
To Do |
| 1128 |
Number of Equivalent Domino Pairs |
Easy |
To Do |
To Do |
| 1130 |
Minimum Cost Tree From Leaf Values |
Medium |
To Do |
To Do |
| 1129 |
Shortest Path with Alternating Colors |
Medium |
To Do |
To Do |
| 1131 |
Maximum of Absolute Value Expression |
Medium |
To Do |
To Do |
| 1299 |
Replace Elements with Greatest Element on Right Side |
Easy |
To Do |
To Do |
| 1300 |
Sum of Mutated Array Closest to Target |
Medium |
To Do |
To Do |
| 1274 |
Number of Ships in a Rectangle 🔒 |
Hard |
To Do |
To Do |
| 1301 |
Number of Paths with Max Score |
Hard |
To Do |
To Do |
| 1137 |
N-th Tribonacci Number |
Easy |
To Do |
To Do |
| 1138 |
Alphabet Board Path |
Medium |
To Do |
To Do |
| 1139 |
Largest 1-Bordered Square |
Medium |
To Do |
To Do |
| 1140 |
Stone Game II |
Medium |
To Do |
To Do |
| 1313 |
Decompress Run-Length Encoded List |
Easy |
To Do |
To Do |
| 1314 |
Matrix Block Sum |
Medium |
To Do |
To Do |
| 1315 |
Sum of Nodes with Even-Valued Grandparent |
Medium |
To Do |
To Do |
| 1316 |
Distinct Echo Substrings |
Hard |
To Do |
To Do |
| 1144 |
Decrease Elements To Make Array Zigzag |
Medium |
To Do |
To Do |
| 1145 |
Binary Tree Coloring Game |
Medium |
To Do |
To Do |
| 1146 |
Snapshot Array |
Medium |
To Do |
To Do |
| 1143 |
Longest Common Subsequence |
Medium |
To Do |
To Do |
| 1147 |
Longest Chunked Palindrome Decomposition |
Hard |
To Do |
To Do |
| 1328 |
Break a Palindrome |
Medium |
To Do |
To Do |
| 1329 |
Sort the Matrix Diagonally |
Medium |
To Do |
To Do |
| 1302 |
Deepest Leaves Sum |
Medium |
To Do |
To Do |
| 1330 |
Reverse Subarray To Maximize Array Value |
Hard |
To Do |
To Do |
| 1331 |
Rank Transform of an Array |
Easy |
To Do |
To Do |
| 1154 |
Day of the Year |
Easy |
To Do |
To Do |
| 1156 |
Swap For Longest Repeated Character Substring |
Medium |
To Do |
To Do |
| 1157 |
Online Majority Element In Subarray |
Hard |
To Do |
To Do |
| 1155 |
Number of Dice Rolls With Target Sum |
Medium |
To Do |
To Do |
| 1171 |
Remove Zero Sum Consecutive Nodes from Linked List |
Medium |
To Do |
To Do |
| 1172 |
Dinner Plate Stacks |
Hard |
To Do |
To Do |
| 1236 |
Web Crawler 🔒 |
Medium |
To Do |
To Do |
| 1169 |
Invalid Transactions |
Medium |
To Do |
To Do |
| 1170 |
Compare Strings by Frequency of the Smallest Character |
Easy |
To Do |
To Do |
| 1360 |
Number of Days Between Two Dates |
Easy |
To Do |
To Do |
| 1361 |
Validate Binary Tree Nodes |
Medium |
To Do |
To Do |
| 1362 |
Closest Divisors |
Medium |
To Do |
To Do |
| 1363 |
Largest Multiple of Three |
Hard |
To Do |
To Do |
| 1175 |
Prime Arrangements |
Easy |
To Do |
To Do |
| 1176 |
Diet Plan Performance 🔒 |
Easy |
To Do |
To Do |
| 1177 |
Can Make Palindrome from Substring |
Medium |
To Do |
To Do |
| 1178 |
Number of Valid Words for Each Puzzle |
Hard |
To Do |
To Do |
| 1507 |
Reformat Date |
Easy |
To Do |
To Do |
| 1390 |
Four Divisors |
Medium |
To Do |
To Do |
| 1382 |
Balance a Binary Search Tree |
Medium |
To Do |
To Do |
| 1425 |
Constrained Subsequence Sum |
Hard |
To Do |
To Do |
| 1184 |
Distance Between Bus Stops |
Easy |
To Do |
To Do |
| 1186 |
Maximum Subarray Sum with One Deletion |
Medium |
To Do |
To Do |
| 1185 |
Day of the Week |
Easy |
To Do |
To Do |
| 1187 |
Make Array Strictly Increasing |
Hard |
To Do |
To Do |
| 1550 |
Three Consecutive Odds |
Easy |
To Do |
To Do |
| 1483 |
Kth Ancestor of a Tree Node |
Hard |
To Do |
To Do |
| 1189 |
Maximum Number of Balloons |
Easy |
To Do |
To Do |
| 1190 |
Reverse Substrings Between Each Pair of Parentheses |
Medium |
To Do |
To Do |
| 1191 |
K-Concatenation Maximum Sum |
Medium |
To Do |
To Do |
| 1192 |
Critical Connections in a Network |
Hard |
To Do |
To Do |
| 1405 |
Longest Happy String |
Medium |
To Do |
To Do |
| 1200 |
Minimum Absolute Difference |
Easy |
To Do |
To Do |
| 1201 |
Ugly Number III |
Medium |
To Do |
To Do |
| 1202 |
Smallest String With Swaps |
Medium |
To Do |
To Do |
| 1203 |
Sort Items by Groups Respecting Dependencies |
Hard |
To Do |
To Do |
| 1207 |
Unique Number of Occurrences |
Easy |
To Do |
To Do |
| 1209 |
Remove All Adjacent Duplicates in String II |
Medium |
To Do |
To Do |
| 1208 |
Get Equal Substrings Within Budget |
Medium |
To Do |
To Do |
| 1210 |
Minimum Moves to Reach Target with Rotations |
Hard |
To Do |
To Do |
| 1514 |
Path with Maximum Probability |
Medium |
To Do |
To Do |
| 1217 |
Minimum Cost to Move Chips to The Same Position |
Easy |
To Do |
To Do |
| 1218 |
Longest Arithmetic Subsequence of Given Difference |
Medium |
To Do |
To Do |
| 1219 |
Path with Maximum Gold |
Medium |
To Do |
To Do |
| 1220 |
Count Vowels Permutation |
Hard |
To Do |
To Do |
| 1206 |
Design Skiplist |
Hard |
To Do |
To Do |
| 1221 |
Split a String in Balanced Strings |
Easy |
To Do |
To Do |
| 1222 |
Queens That Can Attack the King |
Medium |
To Do |
To Do |
| 1223 |
Dice Roll Simulation |
Medium |
To Do |
To Do |
| 1224 |
Maximum Equal Frequency |
Hard |
To Do |
To Do |
| 1427 |
Perform String Shifts 🔒 |
Easy |
To Do |
To Do |
| 1232 |
Check If It Is a Straight Line |
Easy |
To Do |
To Do |
| 1233 |
Remove Sub-Folders from the Filesystem |
Medium |
To Do |
To Do |
| 1234 |
Replace the Substring for Balanced String |
Medium |
To Do |
To Do |
| 1235 |
Maximum Profit in Job Scheduling |
Hard |
To Do |
To Do |
| 1237 |
Find Positive Integer Solution for a Given Equation |
Easy |
To Do |
To Do |
| 1238 |
Circular Permutation in Binary Representation |
Medium |
To Do |
To Do |
| 1239 |
Maximum Length of a Concatenated String with Unique Characters |
Medium |
To Do |
To Do |
| 1240 |
Tiling a Rectangle with the Fewest Squares |
Hard |
To Do |
To Do |
| 1227 |
Airplane Seat Assignment Probability |
Medium |
To Do |
To Do |
| 1429 |
First Unique Number 🔒 |
Medium |
To Do |
To Do |
| 1247 |
Minimum Swaps to Make Strings Equal |
Medium |
To Do |
To Do |
| 1248 |
Count Number of Nice Subarrays |
Medium |
To Do |
To Do |
| 1249 |
Minimum Remove to Make Valid Parentheses |
Medium |
To Do |
To Do |
| 1250 |
Check If It Is a Good Array |
Hard |
To Do |
To Do |
| 1428 |
Leftmost Column with at Least a One 🔒 |
Medium |
To Do |
To Do |
| 1252 |
Cells with Odd Values in a Matrix |
Easy |
To Do |
To Do |
| 1253 |
Reconstruct a 2-Row Binary Matrix |
Medium |
To Do |
To Do |
| 1254 |
Number of Closed Islands |
Medium |
To Do |
To Do |
| 1255 |
Maximum Score Words Formed by Letters |
Hard |
To Do |
To Do |
| 1260 |
Shift 2D Grid |
Easy |
To Do |
To Do |
| 1261 |
Find Elements in a Contaminated Binary Tree |
Medium |
To Do |
To Do |
| 1262 |
Greatest Sum Divisible by Three |
Medium |
To Do |
To Do |
| 1263 |
Minimum Moves to Move a Box to Their Target Location |
Hard |
To Do |
To Do |
| 1426 |
Counting Elements 🔒 |
Easy |
To Do |
To Do |
| 1266 |
Minimum Time Visiting All Points |
Easy |
To Do |
To Do |
| 1267 |
Count Servers that Communicate |
Medium |
To Do |
To Do |
| 1268 |
Search Suggestions System |
Medium |
To Do |
To Do |
| 1269 |
Number of Ways to Stay in the Same Place After Some Steps |
Hard |
To Do |
To Do |
| 1275 |
Find Winner on a Tic Tac Toe Game |
Easy |
To Do |
To Do |
| 1276 |
Number of Burgers with No Waste of Ingredients |
Medium |
To Do |
To Do |
| 1277 |
Count Square Submatrices with All Ones |
Medium |
To Do |
To Do |
| 1278 |
Palindrome Partitioning III |
Hard |
To Do |
To Do |
| 1265 |
Print Immutable Linked List in Reverse 🔒 |
Medium |
To Do |
To Do |
| 1281 |
Subtract the Product and Sum of Digits of an Integer |
Easy |
To Do |
To Do |
| 1282 |
Group the People Given the Group Size They Belong To |
Medium |
To Do |
To Do |
| 1283 |
Find the Smallest Divisor Given a Threshold |
Medium |
To Do |
To Do |
| 1284 |
Minimum Number of Flips to Convert Binary Matrix to Zero Matrix |
Hard |
To Do |
To Do |
| 1290 |
Convert Binary Number in a Linked List to Integer |
Easy |
To Do |
To Do |
| 1292 |
Maximum Side Length of a Square with Sum Less than or Equal to Threshold |
Medium |
To Do |
To Do |
| 1293 |
Shortest Path in a Grid with Obstacles Elimination |
Hard |
To Do |
To Do |
| 1295 |
Find Numbers with Even Number of Digits |
Easy |
To Do |
To Do |
| 1296 |
Divide Array in Sets of K Consecutive Numbers |
Medium |
To Do |
To Do |
| 1297 |
Maximum Number of Occurrences of a Substring |
Medium |
To Do |
To Do |
| 1298 |
Maximum Candies You Can Get from Boxes |
Hard |
To Do |
To Do |
| 1304 |
Find N Unique Integers Sum up to Zero |
Easy |
To Do |
To Do |
| 1305 |
All Elements in Two Binary Search Trees |
Medium |
To Do |
To Do |
| 1306 |
Jump Game III |
Medium |
To Do |
To Do |
| 1307 |
Verbal Arithmetic Puzzle |
Hard |
To Do |
To Do |
| 1430 |
Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree 🔒 |
Medium |
To Do |
To Do |
| 1309 |
Decrypt String from Alphabet to Integer Mapping |
Easy |
To Do |
To Do |
| 1310 |
XOR Queries of a Subarray |
Medium |
To Do |
To Do |
| 1311 |
Get Watched Videos by Your Friends |
Medium |
To Do |
To Do |
| 1312 |
Minimum Insertion Steps to Make a String Palindrome |
Hard |
To Do |
To Do |
| 1317 |
Convert Integer to the Sum of Two No-Zero Integers |
Easy |
To Do |
To Do |
| 1318 |
Minimum Flips to Make a OR b Equal to c |
Medium |
To Do |
To Do |
| 1319 |
Number of Operations to Make Network Connected |
Medium |
To Do |
To Do |
| 1320 |
Minimum Distance to Type a Word Using Two Fingers |
Hard |
To Do |
To Do |
| 1342 |
Number of Steps to Reduce a Number to Zero |
Easy |
To Do |
To Do |
| 1343 |
Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold |
Medium |
To Do |
To Do |
| 1344 |
Angle Between Hands of a Clock |
Medium |
To Do |
To Do |
| 1345 |
Jump Game IV |
Hard |
To Do |
To Do |
| 1323 |
Maximum 69 Number |
Easy |
To Do |
To Do |
| 1324 |
Print Words Vertically |
Medium |
To Do |
To Do |
| 1325 |
Delete Leaves With a Given Value |
Medium |
To Do |
To Do |
| 1326 |
Minimum Number of Taps to Open to Water a Garden |
Hard |
To Do |
To Do |
| 1332 |
Remove Palindromic Subsequences |
Easy |
To Do |
To Do |
| 1333 |
Filter Restaurants by Vegan-Friendly, Price and Distance |
Medium |
To Do |
To Do |
| 1334 |
Find the City With the Smallest Number of Neighbors at a Threshold Distance |
Medium |
To Do |
To Do |
| 1335 |
Minimum Difficulty of a Job Schedule |
Hard |
To Do |
To Do |
| 1356 |
Sort Integers by The Number of 1 Bits |
Easy |
To Do |
To Do |
| 1357 |
Apply Discount Every n Orders |
Medium |
To Do |
To Do |
| 1358 |
Number of Substrings Containing All Three Characters |
Medium |
To Do |
To Do |
| 1359 |
Count All Valid Pickup and Delivery Options |
Hard |
To Do |
To Do |
| 1337 |
The K Weakest Rows in a Matrix |
Easy |
To Do |
To Do |
| 1338 |
Reduce Array Size to The Half |
Medium |
To Do |
To Do |
| 1339 |
Maximum Product of Splitted Binary Tree |
Medium |
To Do |
To Do |
| 1340 |
Jump Game V |
Hard |
To Do |
To Do |
| 1346 |
Check If N and Its Double Exist |
Easy |
To Do |
To Do |
| 1347 |
Minimum Number of Steps to Make Two Strings Anagram |
Medium |
To Do |
To Do |
| 1348 |
Tweet Counts Per Frequency |
Medium |
To Do |
To Do |
| 1349 |
Maximum Students Taking Exam |
Hard |
To Do |
To Do |
| 1370 |
Increasing Decreasing String |
Easy |
To Do |
To Do |
| 1371 |
Find the Longest Substring Containing Vowels in Even Counts |
Medium |
To Do |
To Do |
| 1372 |
Longest ZigZag Path in a Binary Tree |
Medium |
To Do |
To Do |
| 1373 |
Maximum Sum BST in Binary Tree |
Hard |
To Do |
To Do |
| 1351 |
Count Negative Numbers in a Sorted Matrix |
Easy |
To Do |
To Do |
| 1352 |
Product of the Last K Numbers |
Medium |
To Do |
To Do |
| 1353 |
Maximum Number of Events That Can Be Attended |
Medium |
To Do |
To Do |
| 1354 |
Construct Target Array With Multiple Sums |
Hard |
To Do |
To Do |
| 1365 |
How Many Numbers Are Smaller Than the Current Number |
Easy |
To Do |
To Do |
| 1366 |
Rank Teams by Votes |
Medium |
To Do |
To Do |
| 1367 |
Linked List in Binary Tree |
Medium |
To Do |
To Do |
| 1368 |
Minimum Cost to Make at Least One Valid Path in a Grid |
Hard |
To Do |
To Do |
| 1385 |
Find the Distance Value Between Two Arrays |
Easy |
To Do |
To Do |
| 1386 |
Cinema Seat Allocation |
Medium |
To Do |
To Do |
| 1387 |
Sort Integers by The Power Value |
Medium |
To Do |
To Do |
| 1388 |
Pizza With 3n Slices |
Hard |
To Do |
To Do |
| 1374 |
Generate a String With Characters That Have Odd Counts |
Easy |
To Do |
To Do |
| 1375 |
Bulb Switcher III |
Medium |
To Do |
To Do |
| 1376 |
Time Needed to Inform All Employees |
Medium |
To Do |
To Do |
| 1377 |
Frog Position After T Seconds |
Hard |
To Do |
To Do |
| 1380 |
Lucky Numbers in a Matrix |
Easy |
To Do |
To Do |
| 1381 |
Design a Stack With Increment Operation |
Medium |
To Do |
To Do |
| 1379 |
Find a Corresponding Node of a Binary Tree in a Clone of That Tree |
Medium |
To Do |
To Do |
| 1383 |
Maximum Performance of a Team |
Hard |
To Do |
To Do |
| 1399 |
Count Largest Group |
Easy |
To Do |
To Do |
| 1401 |
Circle and Rectangle Overlapping |
Medium |
To Do |
To Do |
| 1400 |
Construct K Palindrome Strings |
Medium |
To Do |
To Do |
| 1402 |
Reducing Dishes |
Hard |
To Do |
To Do |
| 1389 |
Create Target Array in the Given Order |
Easy |
To Do |
To Do |
| 1391 |
Check if There is a Valid Path in a Grid |
Medium |
To Do |
To Do |
| 1392 |
Longest Happy Prefix |
Hard |
To Do |
To Do |
| 1394 |
Find Lucky Integer in an Array |
Easy |
To Do |
To Do |
| 1395 |
Count Number of Teams |
Medium |
To Do |
To Do |
| 1396 |
Design Underground System |
Medium |
To Do |
To Do |
| 1397 |
Find All Good Strings |
Hard |
To Do |
To Do |
| 1413 |
Minimum Value to Get Positive Step by Step Sum |
Easy |
To Do |
To Do |
| 1414 |
Find the Minimum Number of Fibonacci Numbers Whose Sum Is K |
Medium |
To Do |
To Do |
| 1415 |
The k-th Lexicographical String of All Happy Strings of Length n |
Medium |
To Do |
To Do |
| 1416 |
Restore The Array |
Hard |
To Do |
To Do |
| 1403 |
Minimum Subsequence in Non-Increasing Order |
Easy |
To Do |
To Do |
| 1404 |
Number of Steps to Reduce a Number in Binary Representation to One |
Medium |
To Do |
To Do |
| 1406 |
Stone Game III |
Hard |
To Do |
To Do |
| 1408 |
String Matching in an Array |
Easy |
To Do |
To Do |
| 1409 |
Queries on a Permutation With Key |
Medium |
To Do |
To Do |
| 1410 |
HTML Entity Parser |
Medium |
To Do |
To Do |
| 1411 |
Number of Ways to Paint N × 3 Grid |
Hard |
To Do |
To Do |
| 1431 |
Kids With the Greatest Number of Candies |
Easy |
To Do |
To Do |
| 1432 |
Max Difference You Can Get From Changing an Integer |
Medium |
To Do |
To Do |
| 1433 |
Check If a String Can Break Another String |
Medium |
To Do |
To Do |
| 1434 |
Number of Ways to Wear Different Hats to Each Other |
Hard |
To Do |
To Do |
| 1417 |
Reformat The String |
Easy |
To Do |
To Do |
| 1418 |
Display Table of Food Orders in a Restaurant |
Medium |
To Do |
To Do |
| 1419 |
Minimum Number of Frogs Croaking |
Medium |
To Do |
To Do |
| 1420 |
Build Array Where You Can Find The Maximum Exactly K Comparisons |
Hard |
To Do |
To Do |
| 1422 |
Maximum Score After Splitting a String |
Easy |
To Do |
To Do |
| 1423 |
Maximum Points You Can Obtain from Cards |
Medium |
To Do |
To Do |
| 1424 |
Diagonal Traverse II |
Medium |
To Do |
To Do |
| 1446 |
Consecutive Characters |
Easy |
To Do |
To Do |
| 1447 |
Simplified Fractions |
Medium |
To Do |
To Do |
| 1448 |
Count Good Nodes in Binary Tree |
Medium |
To Do |
To Do |
| 1449 |
Form Largest Integer With Digits That Add up to Target |
Hard |
To Do |
To Do |
| 1436 |
Destination City |
Easy |
To Do |
To Do |
| 1437 |
Check If All 1's Are at Least Length K Places Away |
Medium |
To Do |
To Do |
| 1438 |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit |
Medium |
To Do |
To Do |
| 1439 |
Find the Kth Smallest Sum of a Matrix With Sorted Rows |
Hard |
To Do |
To Do |
| 1441 |
Build an Array With Stack Operations |
Easy |
To Do |
To Do |
| 1442 |
Count Triplets That Can Form Two Arrays of Equal XOR |
Medium |
To Do |
To Do |
| 1443 |
Minimum Time to Collect All Apples in a Tree |
Medium |
To Do |
To Do |
| 1444 |
Number of Ways of Cutting a Pizza |
Hard |
To Do |
To Do |
| 1460 |
Make Two Arrays Equal by Reversing Sub-arrays |
Easy |
To Do |
To Do |
| 1461 |
Check If a String Contains All Binary Codes of Size K |
Medium |
To Do |
To Do |
| 1462 |
Course Schedule IV |
Medium |
To Do |
To Do |
| 1463 |
Cherry Pickup II |
Hard |
To Do |
To Do |
| 1450 |
Number of Students Doing Homework at a Given Time |
Easy |
To Do |
To Do |
| 1451 |
Rearrange Words in a Sentence |
Medium |
To Do |
To Do |
| 1452 |
People Whose List of Favorite Companies Is Not a Subset of Another List |
Medium |
To Do |
To Do |
| 1453 |
Maximum Number of Darts Inside of a Circular Dartboard |
Hard |
To Do |
To Do |
| 1455 |
Check If a Word Occurs As a Prefix of Any Word in a Sentence |
Easy |
To Do |
To Do |
| 1456 |
Maximum Number of Vowels in a Substring of Given Length |
Medium |
To Do |
To Do |
| 1457 |
Pseudo-Palindromic Paths in a Binary Tree |
Medium |
To Do |
To Do |
| 1458 |
Max Dot Product of Two Subsequences |
Hard |
To Do |
To Do |
| 1475 |
Final Prices With a Special Discount in a Shop |
Easy |
To Do |
To Do |
| 1478 |
Allocate Mailboxes |
Hard |
To Do |
To Do |
| 1476 |
Subrectangle Queries |
Medium |
To Do |
To Do |
| 1477 |
Find Two Non-overlapping Sub-arrays Each With Target Sum |
Medium |
To Do |
To Do |
| 1464 |
Maximum Product of Two Elements in an Array |
Easy |
To Do |
To Do |
| 1465 |
Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts |
Medium |
To Do |
To Do |
| 1466 |
Reorder Routes to Make All Paths Lead to the City Zero |
Medium |
To Do |
To Do |
| 1467 |
Probability of a Two Boxes Having The Same Number of Distinct Balls |
Hard |
To Do |
To Do |
| 1470 |
Shuffle the Array |
Easy |
To Do |
To Do |
| 1471 |
The k Strongest Values in an Array |
Medium |
To Do |
To Do |
| 1472 |
Design Browser History |
Medium |
To Do |
To Do |
| 1473 |
Paint House III |
Hard |
To Do |
To Do |
| 1491 |
Average Salary Excluding the Minimum and Maximum Salary |
Easy |
To Do |
To Do |
| 1492 |
The kth Factor of n |
Medium |
To Do |
To Do |
| 1493 |
Longest Subarray of 1's After Deleting One Element |
Medium |
To Do |
To Do |
| 1494 |
Parallel Courses II |
Hard |
To Do |
To Do |
| 1480 |
Running Sum of 1d Array |
Easy |
To Do |
To Do |
| 1481 |
Least Number of Unique Integers after K Removals |
Medium |
To Do |
To Do |
| 1482 |
Minimum Number of Days to Make m Bouquets |
Medium |
To Do |
To Do |
| 1469 |
Find All The Lonely Nodes 🔒 |
Easy |
To Do |
To Do |
| 1486 |
XOR Operation in an Array |
Easy |
To Do |
To Do |
| 1487 |
Making File Names Unique |
Medium |
To Do |
To Do |
| 1488 |
Avoid Flood in The City |
Medium |
To Do |
To Do |
| 1489 |
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree |
Hard |
To Do |
To Do |
| 1508 |
Range Sum of Sorted Subarray Sums |
Medium |
To Do |
To Do |
| 1509 |
Minimum Difference Between Largest and Smallest Value in Three Moves |
Medium |
To Do |
To Do |
| 1510 |
Stone Game IV |
Hard |
To Do |
To Do |
| 1474 |
Delete N Nodes After M Nodes of a Linked List 🔒 |
Easy |
To Do |
To Do |
| 1496 |
Path Crossing |
Easy |
To Do |
To Do |
| 1497 |
Check If Array Pairs Are Divisible by k |
Medium |
To Do |
To Do |
| 1498 |
Number of Subsequences That Satisfy the Given Sum Condition |
Medium |
To Do |
To Do |
| 1499 |
Max Value of Equation |
Hard |
To Do |
To Do |
| 1485 |
Clone Binary Tree With Random Pointer 🔒 |
Medium |
To Do |
To Do |
| 1502 |
Can Make Arithmetic Progression From Sequence |
Easy |
To Do |
To Do |
| 1503 |
Last Moment Before All Ants Fall Out of a Plank |
Medium |
To Do |
To Do |
| 1504 |
Count Submatrices With All Ones |
Medium |
To Do |
To Do |
| 1505 |
Minimum Possible Integer After at Most K Adjacent Swaps On Digits |
Hard |
To Do |
To Do |
| 1523 |
Count Odd Numbers in an Interval Range |
Easy |
To Do |
To Do |
| 1524 |
Number of Sub-arrays With Odd Sum |
Medium |
To Do |
To Do |
| 1525 |
Number of Good Ways to Split a String |
Medium |
To Do |
To Do |
| 1526 |
Minimum Number of Increments on Subarrays to Form a Target Array |
Hard |
To Do |
To Do |
| 1490 |
Clone N-ary Tree 🔒 |
Medium |
To Do |
To Do |
| 1512 |
Number of Good Pairs |
Easy |
To Do |
To Do |
| 1513 |
Number of Substrings With Only 1s |
Medium |
To Do |
To Do |
| 1531 |
String Compression II |
Hard |
To Do |
To Do |
| 1515 |
Best Position for a Service Centre |
Hard |
To Do |
To Do |
| 1500 |
Design a File Sharing System 🔒 |
Medium |
To Do |
To Do |
| 1518 |
Water Bottles |
Easy |
To Do |
To Do |
| 1519 |
Number of Nodes in the Sub-Tree With the Same Label |
Medium |
To Do |
To Do |
| 1520 |
Maximum Number of Non-Overlapping Substrings |
Hard |
To Do |
To Do |
| 1521 |
Find a Value of a Mysterious Function Closest to Target |
Hard |
To Do |
To Do |
| 1539 |
Kth Missing Positive Number |
Easy |
To Do |
To Do |
| 1540 |
Can Convert String in K Moves |
Medium |
To Do |
To Do |
| 1541 |
Minimum Insertions to Balance a Parentheses String |
Medium |
To Do |
To Do |
| 1546 |
Maximum Number of Non-Overlapping Subarrays With Sum Equals Target |
Medium |
To Do |
To Do |
| 1506 |
Find Root of N-Ary Tree 🔒 |
Medium |
To Do |
To Do |
| 1528 |
Shuffle String |
Easy |
To Do |
To Do |
| 1529 |
Bulb Switcher IV |
Medium |
To Do |
To Do |
| 1530 |
Number of Good Leaf Nodes Pairs |
Medium |
To Do |
To Do |
| 1516 |
Move Sub-Tree of N-Ary Tree 🔒 |
Hard |
To Do |
To Do |
| 1534 |
Count Good Triplets |
Easy |
To Do |
To Do |
| 1535 |
Find the Winner of an Array Game |
Medium |
To Do |
To Do |
| 1536 |
Minimum Swaps to Arrange a Binary Grid |
Medium |
To Do |
To Do |
| 1537 |
Get the Maximum Score |
Hard |
To Do |
To Do |
| 1556 |
Thousand Separator |
Easy |
To Do |
To Do |
| 1557 |
Minimum Number of Vertices to Reach All Nodes |
Medium |
To Do |
To Do |
| 1558 |
Minimum Numbers of Function Calls to Make Target Array |
Medium |
To Do |
To Do |
| 1559 |
Detect Cycles in 2D Grid |
Hard |
To Do |
To Do |
| 1522 |
Diameter of N-Ary Tree 🔒 |
Medium |
To Do |
To Do |
| 1544 |
Make The String Great |
Easy |
To Do |
To Do |
| 1545 |
Find Kth Bit in Nth Binary String |
Medium |
To Do |
To Do |
| 1542 |
Find Longest Awesome Substring |
Hard |
To Do |
To Do |
| 1547 |
Minimum Cost to Cut a Stick |
Hard |
To Do |
To Do |
| 1533 |
Find the Index of the Large Integer 🔒 |
Medium |
To Do |
To Do |
| 1551 |
Minimum Operations to Make Array Equal |
Medium |
To Do |
To Do |
| 1552 |
Magnetic Force Between Two Balls |
Medium |
To Do |
To Do |
| 1553 |
Minimum Number of Days to Eat N Oranges |
Hard |
To Do |
To Do |
| 1572 |
Matrix Diagonal Sum |
Easy |
To Do |
To Do |
| 1573 |
Number of Ways to Split a String |
Medium |
To Do |
To Do |
| 1574 |
Shortest Subarray to be Removed to Make Array Sorted |
Medium |
To Do |
To Do |
| 1575 |
Count All Possible Routes |
Hard |
To Do |
To Do |
| 1538 |
Guess the Majority in a Hidden Array 🔒 |
Medium |
To Do |
To Do |
| 1560 |
Most Visited Sector in a Circular Track |
Easy |
To Do |
To Do |
| 1561 |
Maximum Number of Coins You Can Get |
Medium |
To Do |
To Do |
| 1562 |
Find Latest Group of Size M |
Medium |
To Do |
To Do |
| 1563 |
Stone Game V |
Hard |
To Do |
To Do |
| 1548 |
The Most Similar Path in a Graph 🔒 |
Hard |
To Do |
To Do |
| 1566 |
Detect Pattern of Length M Repeated K or More Times |
Easy |
To Do |
To Do |
| 1567 |
Maximum Length of Subarray With Positive Product |
Medium |
To Do |
To Do |
| 1568 |
Minimum Number of Days to Disconnect Island |
Hard |
To Do |
To Do |
| 1569 |
Number of Ways to Reorder Array to Get Same BST |
Hard |
To Do |
To Do |
| 1588 |
Sum of All Odd Length Subarrays |
Easy |
To Do |
To Do |
| 1590 |
Make Sum Divisible by P |
Medium |
To Do |
To Do |
| 1589 |
Maximum Sum Obtained of Any Permutation |
Medium |
To Do |
To Do |
| 1591 |
Strange Printer II |
Hard |
To Do |
To Do |
| 1554 |
Strings Differ by One Character 🔒 |
Medium |
To Do |
To Do |
| 1576 |
Replace All ?'s to Avoid Consecutive Repeating Characters |
Easy |
To Do |
To Do |
| 1577 |
Number of Ways Where Square of Number Is Equal to Product of Two Numbers |
Medium |
To Do |
To Do |
| 1578 |
Minimum Deletion Cost to Avoid Repeating Letters |
Medium |
To Do |
To Do |
| 1579 |
Remove Max Number of Edges to Keep Graph Fully Traversable |
Hard |
To Do |
To Do |
| 1564 |
Put Boxes Into the Warehouse I 🔒 |
Medium |
To Do |
To Do |
| 1582 |
Special Positions in a Binary Matrix |
Easy |
To Do |
To Do |
| 1583 |
Count Unhappy Friends |
Medium |
To Do |
To Do |
| 1584 |
Min Cost to Connect All Points |
Medium |
To Do |
To Do |
| 1585 |
Check If String Is Transformable With Substring Sort Operations |
Hard |
To Do |
To Do |
| 1603 |
Design Parking System |
Easy |
To Do |
To Do |
| 1604 |
Alert Using Same Key-Card Three or More Times in a One Hour Period |
Medium |
To Do |
To Do |
| 1606 |
Find Servers That Handled Most Number of Requests |
Hard |
To Do |
To Do |
| 1605 |
Find Valid Matrix Given Row and Column Sums |
Medium |
To Do |
To Do |
| 1570 |
Dot Product of Two Sparse Vectors 🔒 |
Medium |
To Do |
To Do |
| 1592 |
Rearrange Spaces Between Words |
Easy |
To Do |
To Do |
| 1593 |
Split a String Into the Max Number of Unique Substrings |
Medium |
To Do |
To Do |
| 1594 |
Maximum Non Negative Product in a Matrix |
Medium |
To Do |
To Do |
| 1595 |
Minimum Cost to Connect Two Groups of Points |
Hard |
To Do |
To Do |
| 1580 |
Put Boxes Into the Warehouse II 🔒 |
Medium |
To Do |
To Do |
| 1598 |
Crawler Log Folder |
Easy |
To Do |
To Do |
| 1599 |
Maximum Profit of Operating a Centennial Wheel |
Medium |
To Do |
To Do |
| 1600 |
Throne Inheritance |
Medium |
To Do |
To Do |
| 1601 |
Maximum Number of Achievable Transfer Requests |
Hard |
To Do |
To Do |
| 1586 |
Binary Search Tree Iterator II 🔒 |
Medium |
To Do |
To Do |
| 1608 |
Special Array With X Elements Greater Than or Equal X |
Easy |
To Do |
To Do |
| 1609 |
Even Odd Tree |
Medium |
To Do |
To Do |
| 1611 |
Minimum One Bit Operations to Make Integers Zero |
Hard |
To Do |
To Do |
| 1610 |
Maximum Number of Visible Points |
Hard |
To Do |
To Do |
| 1597 |
Build Binary Expression Tree From Infix Expression 🔒 |
Hard |
To Do |
To Do |
| 1602 |
Find Nearest Right Node in Binary Tree 🔒 |
Medium |
To Do |
To Do |