|
282 | 282 | "57": { |
283 | 283 | "link": "https://leetcode.com/problems/insert-interval", |
284 | 284 | "name": "Insert Interval", |
285 | | - "difficulty": "Hard" |
| 285 | + "difficulty": "Medium" |
286 | 286 | }, |
287 | 287 | "58": { |
288 | 288 | "link": "https://leetcode.com/problems/length-of-last-word", |
|
892 | 892 | "189": { |
893 | 893 | "link": "https://leetcode.com/problems/rotate-array", |
894 | 894 | "name": "Rotate Array", |
895 | | - "difficulty": "Easy" |
| 895 | + "difficulty": "Medium" |
896 | 896 | }, |
897 | 897 | "190": { |
898 | 898 | "link": "https://leetcode.com/problems/reverse-bits", |
|
1197 | 1197 | "256": { |
1198 | 1198 | "link": "https://leetcode.com/problems/paint-house", |
1199 | 1199 | "name": "Paint House", |
1200 | | - "difficulty": "Easy" |
| 1200 | + "difficulty": "Medium" |
1201 | 1201 | }, |
1202 | 1202 | "257": { |
1203 | 1203 | "link": "https://leetcode.com/problems/binary-tree-paths", |
|
1407 | 1407 | "299": { |
1408 | 1408 | "link": "https://leetcode.com/problems/bulls-and-cows", |
1409 | 1409 | "name": "Bulls and Cows", |
1410 | | - "difficulty": "Easy" |
| 1410 | + "difficulty": "Medium" |
1411 | 1411 | }, |
1412 | 1412 | "300": { |
1413 | 1413 | "link": "https://leetcode.com/problems/longest-increasing-subsequence", |
|
1492 | 1492 | "316": { |
1493 | 1493 | "link": "https://leetcode.com/problems/remove-duplicate-letters", |
1494 | 1494 | "name": "Remove Duplicate Letters", |
1495 | | - "difficulty": "Hard" |
| 1495 | + "difficulty": "Medium" |
1496 | 1496 | }, |
1497 | 1497 | "317": { |
1498 | 1498 | "link": "https://leetcode.com/problems/shortest-distance-from-all-buildings", |
|
2127 | 2127 | "443": { |
2128 | 2128 | "link": "https://leetcode.com/problems/string-compression", |
2129 | 2129 | "name": "String Compression", |
2130 | | - "difficulty": "Easy" |
| 2130 | + "difficulty": "Medium" |
2131 | 2131 | }, |
2132 | 2132 | "444": { |
2133 | 2133 | "link": "https://leetcode.com/problems/sequence-reconstruction", |
|
2287 | 2287 | "475": { |
2288 | 2288 | "link": "https://leetcode.com/problems/heaters", |
2289 | 2289 | "name": "Heaters", |
2290 | | - "difficulty": "Easy" |
| 2290 | + "difficulty": "Medium" |
2291 | 2291 | }, |
2292 | 2292 | "476": { |
2293 | 2293 | "link": "https://leetcode.com/problems/number-complement", |
|
2562 | 2562 | "532": { |
2563 | 2563 | "link": "https://leetcode.com/problems/k-diff-pairs-in-an-array", |
2564 | 2564 | "name": "K-diff Pairs in an Array", |
2565 | | - "difficulty": "Easy" |
| 2565 | + "difficulty": "Medium" |
2566 | 2566 | }, |
2567 | 2567 | "533": { |
2568 | 2568 | "link": "https://leetcode.com/problems/lonely-pixel-ii", |
|
2587 | 2587 | "538": { |
2588 | 2588 | "link": "https://leetcode.com/problems/convert-bst-to-greater-tree", |
2589 | 2589 | "name": "Convert BST to Greater Tree", |
2590 | | - "difficulty": "Easy" |
| 2590 | + "difficulty": "Medium" |
2591 | 2591 | }, |
2592 | 2592 | "539": { |
2593 | 2593 | "link": "https://leetcode.com/problems/minimum-time-difference", |
|
2757 | 2757 | "581": { |
2758 | 2758 | "link": "https://leetcode.com/problems/shortest-unsorted-continuous-subarray", |
2759 | 2759 | "name": "Shortest Unsorted Continuous Subarray", |
2760 | | - "difficulty": "Easy" |
| 2760 | + "difficulty": "Medium" |
2761 | 2761 | }, |
2762 | 2762 | "582": { |
2763 | 2763 | "link": "https://leetcode.com/problems/kill-process", |
|
2877 | 2877 | "624": { |
2878 | 2878 | "link": "https://leetcode.com/problems/maximum-distance-in-arrays", |
2879 | 2879 | "name": "Maximum Distance in Arrays", |
2880 | | - "difficulty": "Easy" |
| 2880 | + "difficulty": "Medium" |
2881 | 2881 | }, |
2882 | 2882 | "625": { |
2883 | 2883 | "link": "https://leetcode.com/problems/minimum-factorization", |
|
2912 | 2912 | "633": { |
2913 | 2913 | "link": "https://leetcode.com/problems/sum-of-square-numbers", |
2914 | 2914 | "name": "Sum of Square Numbers", |
2915 | | - "difficulty": "Easy" |
| 2915 | + "difficulty": "Medium" |
2916 | 2916 | }, |
2917 | 2917 | "634": { |
2918 | 2918 | "link": "https://leetcode.com/problems/find-the-derangement-of-an-array", |
|
3182 | 3182 | "687": { |
3183 | 3183 | "link": "https://leetcode.com/problems/longest-univalue-path", |
3184 | 3184 | "name": "Longest Univalue Path", |
3185 | | - "difficulty": "Easy" |
| 3185 | + "difficulty": "Medium" |
3186 | 3186 | }, |
3187 | 3187 | "688": { |
3188 | 3188 | "link": "https://leetcode.com/problems/knight-probability-in-chessboard", |
|
3947 | 3947 | "840": { |
3948 | 3948 | "link": "https://leetcode.com/problems/magic-squares-in-grid", |
3949 | 3949 | "name": "Magic Squares In Grid", |
3950 | | - "difficulty": "Easy" |
| 3950 | + "difficulty": "Medium" |
3951 | 3951 | }, |
3952 | 3952 | "841": { |
3953 | 3953 | "link": "https://leetcode.com/problems/keys-and-rooms", |
|
3992 | 3992 | "849": { |
3993 | 3993 | "link": "https://leetcode.com/problems/maximize-distance-to-closest-person", |
3994 | 3994 | "name": "Maximize Distance to Closest Person", |
3995 | | - "difficulty": "Easy" |
| 3995 | + "difficulty": "Medium" |
3996 | 3996 | }, |
3997 | 3997 | "850": { |
3998 | 3998 | "link": "https://leetcode.com/problems/rectangle-area-ii", |
|
4492 | 4492 | "949": { |
4493 | 4493 | "link": "https://leetcode.com/problems/largest-time-for-given-digits", |
4494 | 4494 | "name": "Largest Time for Given Digits", |
4495 | | - "difficulty": "Easy" |
| 4495 | + "difficulty": "Medium" |
4496 | 4496 | }, |
4497 | 4497 | "950": { |
4498 | 4498 | "link": "https://leetcode.com/problems/reveal-cards-in-increasing-order", |
|
7198 | 7198 | "link": "https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable", |
7199 | 7199 | "name": "Remove Max Number of Edges to Keep Graph Fully Traversable", |
7200 | 7200 | "difficulty": "Hard" |
| 7201 | + }, |
| 7202 | + "1580": { |
| 7203 | + "link": "https://leetcode.com/problems/put-boxes-into-the-warehouse-ii", |
| 7204 | + "name": "Put Boxes Into the Warehouse II", |
| 7205 | + "difficulty": "Medium" |
| 7206 | + }, |
| 7207 | + "1582": { |
| 7208 | + "link": "https://leetcode.com/problems/special-positions-in-a-binary-matrix", |
| 7209 | + "name": "Special Positions in a Binary Matrix", |
| 7210 | + "difficulty": "Easy" |
| 7211 | + }, |
| 7212 | + "1583": { |
| 7213 | + "link": "https://leetcode.com/problems/count-unhappy-friends", |
| 7214 | + "name": "Count Unhappy Friends", |
| 7215 | + "difficulty": "Medium" |
| 7216 | + }, |
| 7217 | + "1584": { |
| 7218 | + "link": "https://leetcode.com/problems/min-cost-to-connect-all-points", |
| 7219 | + "name": "Min Cost to Connect All Points", |
| 7220 | + "difficulty": "Medium" |
| 7221 | + }, |
| 7222 | + "1585": { |
| 7223 | + "link": "https://leetcode.com/problems/check-if-string-is-transformable-with-substring-sort-operations", |
| 7224 | + "name": "Check If String Is Transformable With Substring Sort Operations", |
| 7225 | + "difficulty": "Hard" |
| 7226 | + }, |
| 7227 | + "1586": { |
| 7228 | + "link": "https://leetcode.com/problems/binary-search-tree-iterator-ii", |
| 7229 | + "name": "Binary Search Tree Iterator II", |
| 7230 | + "difficulty": "Medium" |
| 7231 | + }, |
| 7232 | + "1588": { |
| 7233 | + "link": "https://leetcode.com/problems/sum-of-all-odd-length-subarrays", |
| 7234 | + "name": "Sum of All Odd Length Subarrays", |
| 7235 | + "difficulty": "Easy" |
| 7236 | + }, |
| 7237 | + "1589": { |
| 7238 | + "link": "https://leetcode.com/problems/maximum-sum-obtained-of-any-permutation", |
| 7239 | + "name": "Maximum Sum Obtained of Any Permutation", |
| 7240 | + "difficulty": "Medium" |
| 7241 | + }, |
| 7242 | + "1590": { |
| 7243 | + "link": "https://leetcode.com/problems/make-sum-divisible-by-p", |
| 7244 | + "name": "Make Sum Divisible by P", |
| 7245 | + "difficulty": "Medium" |
| 7246 | + }, |
| 7247 | + "1591": { |
| 7248 | + "link": "https://leetcode.com/problems/strange-printer-ii", |
| 7249 | + "name": "Strange Printer II", |
| 7250 | + "difficulty": "Hard" |
| 7251 | + }, |
| 7252 | + "1592": { |
| 7253 | + "link": "https://leetcode.com/problems/rearrange-spaces-between-words", |
| 7254 | + "name": "Rearrange Spaces Between Words", |
| 7255 | + "difficulty": "Easy" |
| 7256 | + }, |
| 7257 | + "1593": { |
| 7258 | + "link": "https://leetcode.com/problems/split-a-string-into-the-max-number-of-unique-substrings", |
| 7259 | + "name": "Split a String Into the Max Number of Unique Substrings", |
| 7260 | + "difficulty": "Medium" |
| 7261 | + }, |
| 7262 | + "1594": { |
| 7263 | + "link": "https://leetcode.com/problems/maximum-non-negative-product-in-a-matrix", |
| 7264 | + "name": "Maximum Non Negative Product in a Matrix", |
| 7265 | + "difficulty": "Medium" |
| 7266 | + }, |
| 7267 | + "1595": { |
| 7268 | + "link": "https://leetcode.com/problems/minimum-cost-to-connect-two-groups-of-points", |
| 7269 | + "name": "Minimum Cost to Connect Two Groups of Points", |
| 7270 | + "difficulty": "Hard" |
| 7271 | + }, |
| 7272 | + "1597": { |
| 7273 | + "link": "https://leetcode.com/problems/build-binary-expression-tree-from-infix-expression", |
| 7274 | + "name": "Build Binary Expression Tree From Infix Expression", |
| 7275 | + "difficulty": "Hard" |
| 7276 | + }, |
| 7277 | + "1598": { |
| 7278 | + "link": "https://leetcode.com/problems/crawler-log-folder", |
| 7279 | + "name": "Crawler Log Folder", |
| 7280 | + "difficulty": "Easy" |
| 7281 | + }, |
| 7282 | + "1599": { |
| 7283 | + "link": "https://leetcode.com/problems/maximum-profit-of-operating-a-centennial-wheel", |
| 7284 | + "name": "Maximum Profit of Operating a Centennial Wheel", |
| 7285 | + "difficulty": "Medium" |
| 7286 | + }, |
| 7287 | + "1600": { |
| 7288 | + "link": "https://leetcode.com/problems/throne-inheritance", |
| 7289 | + "name": "Throne Inheritance", |
| 7290 | + "difficulty": "Medium" |
| 7291 | + }, |
| 7292 | + "1601": { |
| 7293 | + "link": "https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests", |
| 7294 | + "name": "Maximum Number of Achievable Transfer Requests", |
| 7295 | + "difficulty": "Hard" |
| 7296 | + }, |
| 7297 | + "1602": { |
| 7298 | + "link": "https://leetcode.com/problems/find-nearest-right-node-in-binary-tree", |
| 7299 | + "name": "Find Nearest Right Node in Binary Tree", |
| 7300 | + "difficulty": "Medium" |
| 7301 | + }, |
| 7302 | + "1603": { |
| 7303 | + "link": "https://leetcode.com/problems/design-parking-system", |
| 7304 | + "name": "Design Parking System", |
| 7305 | + "difficulty": "Easy" |
| 7306 | + }, |
| 7307 | + "1604": { |
| 7308 | + "link": "https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period", |
| 7309 | + "name": "Alert Using Same Key-Card Three or More Times in a One Hour Period", |
| 7310 | + "difficulty": "Medium" |
| 7311 | + }, |
| 7312 | + "1605": { |
| 7313 | + "link": "https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums", |
| 7314 | + "name": "Find Valid Matrix Given Row and Column Sums", |
| 7315 | + "difficulty": "Medium" |
| 7316 | + }, |
| 7317 | + "1606": { |
| 7318 | + "link": "https://leetcode.com/problems/find-servers-that-handled-most-number-of-requests", |
| 7319 | + "name": "Find Servers That Handled Most Number of Requests", |
| 7320 | + "difficulty": "Hard" |
| 7321 | + }, |
| 7322 | + "1608": { |
| 7323 | + "link": "https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x", |
| 7324 | + "name": "Special Array With X Elements Greater Than or Equal X", |
| 7325 | + "difficulty": "Easy" |
| 7326 | + }, |
| 7327 | + "1609": { |
| 7328 | + "link": "https://leetcode.com/problems/even-odd-tree", |
| 7329 | + "name": "Even Odd Tree", |
| 7330 | + "difficulty": "Medium" |
| 7331 | + }, |
| 7332 | + "1610": { |
| 7333 | + "link": "https://leetcode.com/problems/maximum-number-of-visible-points", |
| 7334 | + "name": "Maximum Number of Visible Points", |
| 7335 | + "difficulty": "Hard" |
| 7336 | + }, |
| 7337 | + "1611": { |
| 7338 | + "link": "https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero", |
| 7339 | + "name": "Minimum One Bit Operations to Make Integers Zero", |
| 7340 | + "difficulty": "Hard" |
| 7341 | + }, |
| 7342 | + "1612": { |
| 7343 | + "link": "https://leetcode.com/problems/check-if-two-expression-trees-are-equivalent", |
| 7344 | + "name": "Check If Two Expression Trees are Equivalent", |
| 7345 | + "difficulty": "Medium" |
| 7346 | + }, |
| 7347 | + "1614": { |
| 7348 | + "link": "https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses", |
| 7349 | + "name": "Maximum Nesting Depth of the Parentheses", |
| 7350 | + "difficulty": "Easy" |
| 7351 | + }, |
| 7352 | + "1615": { |
| 7353 | + "link": "https://leetcode.com/problems/maximal-network-rank", |
| 7354 | + "name": "Maximal Network Rank", |
| 7355 | + "difficulty": "Medium" |
| 7356 | + }, |
| 7357 | + "1616": { |
| 7358 | + "link": "https://leetcode.com/problems/split-two-strings-to-make-palindrome", |
| 7359 | + "name": "Split Two Strings to Make Palindrome", |
| 7360 | + "difficulty": "Medium" |
| 7361 | + }, |
| 7362 | + "1617": { |
| 7363 | + "link": "https://leetcode.com/problems/count-subtrees-with-max-distance-between-cities", |
| 7364 | + "name": "Count Subtrees With Max Distance Between Cities", |
| 7365 | + "difficulty": "Hard" |
7201 | 7366 | } |
7202 | 7367 | } |
0 commit comments