|
32 | 32 | | **0037** | [Sudoku Solver][37] | Array, Backtracking, Matrix | ![][hard] | |
|
33 | 33 | | **0041** | [First Missing Positive][41] | Array, Hash Table | ![][hard] | |
|
34 | 34 | | **0042** | [Trapping Rain Water][42] | Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack | ![][hard] | |
|
| 35 | +| **0048** | [Rotate Image][48] | Array, Math, Matrix | ![][medium] | | |
35 | 36 | | **0051** | [N-Queens][51] | Array, Backtracking | ![][hard] | |
|
36 | 37 | | **0053** | [Maximum Subarray][53] | Array, Divide and Conquer, DP | ![][medium] | |
|
37 | 38 | | **0055** | [Jump Game][55] | Array, Dynamic Programming, Greedy | ![][medium] | |
|
|
42 | 43 | | **0069** | [Sqrt(x)][69] | Math, BS | ![][easy] | |
|
43 | 44 | | **0070** | [Climbing Stairs][70] | Math, Dynamic Programming, Memorization | ![][easy] | |
|
44 | 45 | | **0072** | [Edit Distance][72] | String, DP | ![][hard] | |
|
| 46 | +| **0074** | [Search a 2D Matrix][74] | Array, Binary Search, Matrix | ![][medium] | | |
45 | 47 | | **0075** | [Sort Colors][75] | Array, Two Pointers, Sorting | ![][medium] | |
|
46 | 48 | | **0078** | [Subsets][78] | Array, Backtracking, Bit Manip | ![][medium] | |
|
47 | 49 | | **0083** | [Remove Duplicates from Sorted List][83] | LL | ![][easy] | |
|
|
139 | 141 | | **0482** | [License Key Formatting][482] | String | ![][easy] | |
|
140 | 142 | | **0485** | [Max Consecutive Ones][485] | Array | ![][easy] | |
|
141 | 143 | | **0492** | [Construct the Rectangle][492] | Math | ![][easy] | |
|
| 144 | +| **0498** | [Diagonal Traverse][498] | Array, Matrix, Simulation | ![][medium] | | |
142 | 145 | | **0502** | [IPO][502] | Array, Greedy, Sorting, Heap (Priority Queue) | ![][hard] | |
|
143 | 146 | | **0504** | [Base 7][504] | Math | ![][easy] | |
|
144 | 147 | | **0506** | [Relative Ranks][506] | Array, Sorting, Heap | ![][easy] | |
|
|
166 | 169 | | **0958** | [Check Completeness of a Binary Tree][958] | Tree, Breadth-First Search, Binary Tree | ![][medium] | |
|
167 | 170 | | **0997** | [Find the Town Judge][997] | Array, Hash Table, Graph | ![][easy] | |
|
168 | 171 | | **1011** | [Capacity To Ship Packages Within D Days][1011] | Array, BS | ![][medium] | |
|
| 172 | +| **1029** | [Two City Scheduling][1029] | Array, Greedy, Sorting | ![][medium] | | |
169 | 173 | | **1047** | [Remove All Adjacent Duplicates In String][1047] | String, Stack | ![][easy] | |
|
170 | 174 | | **1092** | [Shortest Common Supersequence][1092] | String, DP | ![][hard] | |
|
171 | 175 | | **1108** | [Defanging an IP Address][1108] | String | ![][easy] | |
|
|
201 | 205 | | **2427** | [Number of Common Factors][2427] | Math, Enumeration, Number Theory | ![][easy] | |
|
202 | 206 | | **2444** | [Count Subarrays With Fixed Bounds][2444] | Array, Queue, Sliding Window, Monotonic Queue | ![][hard] | |
|
203 | 207 | | **2469** | [Convert the Temperature][2469] | Math | ![][easy] | |
|
| 208 | +| **2551** | [Put Marbles in Bags][2551] | Array, Greedy, Sorting, Heap (Priority Queue) | ![][hard] | | |
204 | 209 | | **2574** | [Left and Right Sum Differences][2574] | Array, Prefix Sum | ![][easy] | |
|
205 | 210 |
|
206 | 211 | </div>
|
|
224 | 229 | [37]: ./solution/0001-0100/037%20-%20Sudoku%20Solver.md
|
225 | 230 | [41]: ./solution/0001-0100/041%20-%20First%20Missing%20Positive.md
|
226 | 231 | [42]: ./solution/0001-0100/042%20-%20Trapping%20Rain%20Water.md
|
| 232 | +[48]: ./solution/0001-0100/048%20-%20Rotate%20Image.md |
227 | 233 | [51]: ./solution/0001-0100/051%20-%20N-Queens.md
|
228 | 234 | [53]: ./solution/0001-0100/053%20-%20Maximum%20Subarray.md
|
229 | 235 | [55]: ./solution/0001-0100/055%20-%20Jump%20Game.md
|
|
235 | 241 | [69]: ./solution/0001-0100/069%20-%20Sqrt(x).md
|
236 | 242 | [70]: ./solution/0001-0100/070%20-%20Climbing%20Stairs.md
|
237 | 243 | [72]: ./solution/0001-0100/072%20-%20Edit%20Distance.md
|
| 244 | +[74]: ./solution/0001-0100/074%20-%20Search%20a%202D%20Matrix.md |
238 | 245 | [75]: ./solution/0001-0100/075%20-%20Sort%20Colors.md
|
239 | 246 | [78]: ./solution/0001-0100/078%20-%20Subsets.md
|
240 | 247 | [83]: ./solution/0001-0100/083%20-%20Remove%20Duplicates%20from%20Sorted%20List.md
|
|
337 | 344 | [482]: ./solution/0401-0500/482%20-%20License%20Key%20Formatting.md
|
338 | 345 | [485]: ./solution/0401-0500/485%20-%20Max%20Consecutive%20Ones.md
|
339 | 346 | [492]: ./solution/0401-0500/492%20-%20Construct%20the%20Rectangle.md
|
| 347 | +[498]: ./solution/0401-0500/498%20-%20Diagonal%20Traverse.md |
340 | 348 | [502]: ./solution/0501-0600/502%20-%20IPO.md
|
341 | 349 | [504]: ./solution/0501-0600/504%20-%20Base%207.md
|
342 | 350 | [506]: ./solution/0501-0600/506%20-%20%20Relative%20Ranks.md
|
|
365 | 373 | [997]: ./solution/0901-1000/997%20-%20Find%20the%20Town%20Judge.md
|
366 | 374 | [997]: ./solution/0901-1000/997%20-%20Find%20the%20Town%20Judge.md
|
367 | 375 | [1011]: ./solution/1001-1100/1011%20-%20Capacity%20To%20Ship%20Packages%20Within%20D%20Days.md
|
| 376 | +[1029]: ./solution/1001-1100/1029%20-%20Two%20City%20Scheduling.md |
368 | 377 | [1047]: ./solution/1001-1100/1047%20-%20Remove%20All%20Adjacent%20Duplicates%20In%20String.md
|
369 | 378 | [1092]: ./solution/1001-1100/1092%20-%20Shortest%20Common%20Supersequence.md
|
370 | 379 | [1108]: ./solution/1101-1200/1108%20-%20Defanging%20an%20IP%20Address.md
|
|
400 | 409 | [2427]: ./solution/2401-2500/2427%20-%20Number%20of%20Common%20Factors.md
|
401 | 410 | [2444]: ./solution/2401-2500/2444%20-%20Count%20Subarrays%20With%20Fixed%20Bounds.md
|
402 | 411 | [2469]: ./solution/2401-2500/2469%20-%20Convert%20the%20Temperature.md
|
| 412 | +[2551]: ./solution/2501-2600/2551%20-%20Put%20Marbles%20in%20Bags.md |
403 | 413 | [2574]: ./solution/2401-2500/2574%20-%20Left%20and%20Right%20Sum%20Differences.md
|
404 | 414 |
|
405 | 415 | <!----------------------------------{ Labels }--------------------------------->
|
|
0 commit comments