diff --git a/stormlevel/data.json b/stormlevel/data.json
index 5aa3676a..f5a10b85 100644
--- a/stormlevel/data.json
+++ b/stormlevel/data.json
@@ -1 +1 @@
-[{"ID": 1, "Title": "Two Sum", "TitleCn": "\u4e24\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/two-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 2, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2, "Title": "Add Two Numbers", "TitleCn": "\u4e24\u6570\u76f8\u52a0", "Url": "https://leetcode.cn/problems/add-two-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3, "Title": "Longest Substring Without Repeating Characters", "TitleCn": "\u65e0\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32", "Url": "https://leetcode.cn/problems/longest-substring-without-repeating-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 4, "Title": "Median of Two Sorted Arrays", "TitleCn": "\u5bfb\u627e\u4e24\u4e2a\u6b63\u5e8f\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570", "Url": "https://leetcode.cn/problems/median-of-two-sorted-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 5, "Title": "Longest Palindromic Substring", "TitleCn": "\u6700\u957f\u56de\u6587\u5b50\u4e32", "Url": "https://leetcode.cn/problems/longest-palindromic-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 6, "Title": "Zigzag Conversion", "TitleCn": "Z \u5b57\u5f62\u53d8\u6362", "Url": "https://leetcode.cn/problems/zigzag-conversion/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 7, "Title": "Reverse Integer", "TitleCn": "\u6574\u6570\u53cd\u8f6c", "Url": "https://leetcode.cn/problems/reverse-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 8, "Title": "String to Integer (atoi)", "TitleCn": "\u5b57\u7b26\u4e32\u8f6c\u6362\u6574\u6570 (atoi)", "Url": "https://leetcode.cn/problems/string-to-integer-atoi/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 9, "Title": "Palindrome Number", "TitleCn": "\u56de\u6587\u6570", "Url": "https://leetcode.cn/problems/palindrome-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 10, "Title": "Regular Expression Matching", "TitleCn": "\u6b63\u5219\u8868\u8fbe\u5f0f\u5339\u914d", "Url": "https://leetcode.cn/problems/regular-expression-matching/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 11, "Title": "Container With Most Water", "TitleCn": "\u76db\u6700\u591a\u6c34\u7684\u5bb9\u5668", "Url": "https://leetcode.cn/problems/container-with-most-water/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 12, "Title": "Integer to Roman", "TitleCn": "\u6574\u6570\u8f6c\u7f57\u9a6c\u6570\u5b57", "Url": "https://leetcode.cn/problems/integer-to-roman/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 13, "Title": "Roman to Integer", "TitleCn": "\u7f57\u9a6c\u6570\u5b57\u8f6c\u6574\u6570", "Url": "https://leetcode.cn/problems/roman-to-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 14, "Title": "Longest Common Prefix", "TitleCn": "\u6700\u957f\u516c\u5171\u524d\u7f00", "Url": "https://leetcode.cn/problems/longest-common-prefix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 15, "Title": "3Sum", "TitleCn": "\u4e09\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/3sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 16, "Title": "3Sum Closest", "TitleCn": "\u6700\u63a5\u8fd1\u7684\u4e09\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/3sum-closest/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 17, "Title": "Letter Combinations of a Phone Number", "TitleCn": "\u7535\u8bdd\u53f7\u7801\u7684\u5b57\u6bcd\u7ec4\u5408", "Url": "https://leetcode.cn/problems/letter-combinations-of-a-phone-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 18, "Title": "4Sum", "TitleCn": "\u56db\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/4sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 19, "Title": "Remove Nth Node From End of List", "TitleCn": "\u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2cN\u4e2a\u8282\u70b9", "Url": "https://leetcode.cn/problems/remove-nth-node-from-end-of-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 20, "Title": "Valid Parentheses", "TitleCn": "\u6709\u6548\u7684\u62ec\u53f7", "Url": "https://leetcode.cn/problems/valid-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 21, "Title": "Merge Two Sorted Lists", "TitleCn": "\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u94fe\u8868", "Url": "https://leetcode.cn/problems/merge-two-sorted-lists/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 22, "Title": "Generate Parentheses", "TitleCn": "\u62ec\u53f7\u751f\u6210", "Url": "https://leetcode.cn/problems/generate-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 23, "Title": "Merge k Sorted Lists", "TitleCn": "\u5408\u5e76K\u4e2a\u5347\u5e8f\u94fe\u8868", "Url": "https://leetcode.cn/problems/merge-k-sorted-lists/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 24, "Title": "Swap Nodes in Pairs", "TitleCn": "\u4e24\u4e24\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/swap-nodes-in-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 25, "Title": "Reverse Nodes in k-Group", "TitleCn": "K \u4e2a\u4e00\u7ec4\u7ffb\u8f6c\u94fe\u8868", "Url": "https://leetcode.cn/problems/reverse-nodes-in-k-group/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 7, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 26, "Title": "Remove Duplicates from Sorted Array", "TitleCn": "\u5220\u9664\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879", "Url": "https://leetcode.cn/problems/remove-duplicates-from-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 27, "Title": "Remove Element", "TitleCn": "\u79fb\u9664\u5143\u7d20", "Url": "https://leetcode.cn/problems/remove-element/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 28, "Title": "Find the Index of the First Occurrence in a String", "TitleCn": "\u627e\u51fa\u5b57\u7b26\u4e32\u4e2d\u7b2c\u4e00\u4e2a\u5339\u914d\u9879\u7684\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 29, "Title": "Divide Two Integers", "TitleCn": "\u4e24\u6570\u76f8\u9664", "Url": "https://leetcode.cn/problems/divide-two-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 30, "Title": "Substring with Concatenation of All Words", "TitleCn": "\u4e32\u8054\u6240\u6709\u5355\u8bcd\u7684\u5b50\u4e32", "Url": "https://leetcode.cn/problems/substring-with-concatenation-of-all-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 31, "Title": "Next Permutation", "TitleCn": "\u4e0b\u4e00\u4e2a\u6392\u5217", "Url": "https://leetcode.cn/problems/next-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 32, "Title": "Longest Valid Parentheses", "TitleCn": "\u6700\u957f\u6709\u6548\u62ec\u53f7", "Url": "https://leetcode.cn/problems/longest-valid-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 33, "Title": "Search in Rotated Sorted Array", "TitleCn": "\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/search-in-rotated-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 34, "Title": "Find First and Last Position of Element in Sorted Array", "TitleCn": "\u5728\u6392\u5e8f\u6570\u7ec4\u4e2d\u67e5\u627e\u5143\u7d20\u7684\u7b2c\u4e00\u4e2a\u548c\u6700\u540e\u4e00\u4e2a\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 35, "Title": "Search Insert Position", "TitleCn": "\u641c\u7d22\u63d2\u5165\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/search-insert-position/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 36, "Title": "Valid Sudoku", "TitleCn": "\u6709\u6548\u7684\u6570\u72ec", "Url": "https://leetcode.cn/problems/valid-sudoku/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 37, "Title": "Sudoku Solver", "TitleCn": "\u89e3\u6570\u72ec", "Url": "https://leetcode.cn/problems/sudoku-solver/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 38, "Title": "Count and Say", "TitleCn": "\u5916\u89c2\u6570\u5217", "Url": "https://leetcode.cn/problems/count-and-say/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 39, "Title": "Combination Sum", "TitleCn": "\u7ec4\u5408\u603b\u548c", "Url": "https://leetcode.cn/problems/combination-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 40, "Title": "Combination Sum II", "TitleCn": "\u7ec4\u5408\u603b\u548c II", "Url": "https://leetcode.cn/problems/combination-sum-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 41, "Title": "First Missing Positive", "TitleCn": "\u7f3a\u5931\u7684\u7b2c\u4e00\u4e2a\u6b63\u6570", "Url": "https://leetcode.cn/problems/first-missing-positive/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 42, "Title": "Trapping Rain Water", "TitleCn": "\u63a5\u96e8\u6c34", "Url": "https://leetcode.cn/problems/trapping-rain-water/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 43, "Title": "Multiply Strings", "TitleCn": "\u5b57\u7b26\u4e32\u76f8\u4e58", "Url": "https://leetcode.cn/problems/multiply-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 44, "Title": "Wildcard Matching", "TitleCn": "\u901a\u914d\u7b26\u5339\u914d", "Url": "https://leetcode.cn/problems/wildcard-matching/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 45, "Title": "Jump Game II", "TitleCn": "\u8df3\u8dc3\u6e38\u620f II", "Url": "https://leetcode.cn/problems/jump-game-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 46, "Title": "Permutations", "TitleCn": "\u5168\u6392\u5217", "Url": "https://leetcode.cn/problems/permutations/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 47, "Title": "Permutations II", "TitleCn": "\u5168\u6392\u5217 II", "Url": "https://leetcode.cn/problems/permutations-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 48, "Title": "Rotate Image", "TitleCn": "\u65cb\u8f6c\u56fe\u50cf", "Url": "https://leetcode.cn/problems/rotate-image/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 49, "Title": "Group Anagrams", "TitleCn": "\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u5206\u7ec4", "Url": "https://leetcode.cn/problems/group-anagrams/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 50, "Title": "Pow(x, n)", "TitleCn": "Pow(x, n)", "Url": "https://leetcode.cn/problems/powx-n/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 51, "Title": "N-Queens", "TitleCn": "N \u7687\u540e", "Url": "https://leetcode.cn/problems/n-queens/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 52, "Title": "N-Queens II", "TitleCn": "N\u7687\u540e II", "Url": "https://leetcode.cn/problems/n-queens-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 53, "Title": "Maximum Subarray", "TitleCn": "\u6700\u5927\u5b50\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/maximum-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 54, "Title": "Spiral Matrix", "TitleCn": "\u87ba\u65cb\u77e9\u9635", "Url": "https://leetcode.cn/problems/spiral-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 55, "Title": "Jump Game", "TitleCn": "\u8df3\u8dc3\u6e38\u620f", "Url": "https://leetcode.cn/problems/jump-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 56, "Title": "Merge Intervals", "TitleCn": "\u5408\u5e76\u533a\u95f4", "Url": "https://leetcode.cn/problems/merge-intervals/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 57, "Title": "Insert Interval", "TitleCn": "\u63d2\u5165\u533a\u95f4", "Url": "https://leetcode.cn/problems/insert-interval/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 58, "Title": "Length of Last Word", "TitleCn": "\u6700\u540e\u4e00\u4e2a\u5355\u8bcd\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/length-of-last-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 59, "Title": "Spiral Matrix II", "TitleCn": "\u87ba\u65cb\u77e9\u9635 II", "Url": "https://leetcode.cn/problems/spiral-matrix-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 60, "Title": "Permutation Sequence", "TitleCn": "\u6392\u5217\u5e8f\u5217", "Url": "https://leetcode.cn/problems/permutation-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 61, "Title": "Rotate List", "TitleCn": "\u65cb\u8f6c\u94fe\u8868", "Url": "https://leetcode.cn/problems/rotate-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 62, "Title": "Unique Paths", "TitleCn": "\u4e0d\u540c\u8def\u5f84", "Url": "https://leetcode.cn/problems/unique-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 63, "Title": "Unique Paths II", "TitleCn": "\u4e0d\u540c\u8def\u5f84 II", "Url": "https://leetcode.cn/problems/unique-paths-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 64, "Title": "Minimum Path Sum", "TitleCn": "\u6700\u5c0f\u8def\u5f84\u548c", "Url": "https://leetcode.cn/problems/minimum-path-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 65, "Title": "Valid Number", "TitleCn": "\u6709\u6548\u6570\u5b57", "Url": "https://leetcode.cn/problems/valid-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 66, "Title": "Plus One", "TitleCn": "\u52a0\u4e00", "Url": "https://leetcode.cn/problems/plus-one/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 67, "Title": "Add Binary", "TitleCn": "\u4e8c\u8fdb\u5236\u6c42\u548c", "Url": "https://leetcode.cn/problems/add-binary/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 68, "Title": "Text Justification", "TitleCn": "\u6587\u672c\u5de6\u53f3\u5bf9\u9f50", "Url": "https://leetcode.cn/problems/text-justification/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 69, "Title": "Sqrt(x)", "TitleCn": "x \u7684\u5e73\u65b9\u6839", "Url": "https://leetcode.cn/problems/sqrtx/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 70, "Title": "Climbing Stairs", "TitleCn": "\u722c\u697c\u68af", "Url": "https://leetcode.cn/problems/climbing-stairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 71, "Title": "Simplify Path", "TitleCn": "\u7b80\u5316\u8def\u5f84", "Url": "https://leetcode.cn/problems/simplify-path/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 72, "Title": "Edit Distance", "TitleCn": "\u7f16\u8f91\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/edit-distance/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 73, "Title": "Set Matrix Zeroes", "TitleCn": "\u77e9\u9635\u7f6e\u96f6", "Url": "https://leetcode.cn/problems/set-matrix-zeroes/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 74, "Title": "Search a 2D Matrix", "TitleCn": "\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635", "Url": "https://leetcode.cn/problems/search-a-2d-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 75, "Title": "Sort Colors", "TitleCn": "\u989c\u8272\u5206\u7c7b", "Url": "https://leetcode.cn/problems/sort-colors/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 76, "Title": "Minimum Window Substring", "TitleCn": "\u6700\u5c0f\u8986\u76d6\u5b50\u4e32", "Url": "https://leetcode.cn/problems/minimum-window-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 6, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 77, "Title": "Combinations", "TitleCn": "\u7ec4\u5408", "Url": "https://leetcode.cn/problems/combinations/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 78, "Title": "Subsets", "TitleCn": "\u5b50\u96c6", "Url": "https://leetcode.cn/problems/subsets/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 79, "Title": "Word Search", "TitleCn": "\u5355\u8bcd\u641c\u7d22", "Url": "https://leetcode.cn/problems/word-search/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 80, "Title": "Remove Duplicates from Sorted Array II", "TitleCn": "\u5220\u9664\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879 II", "Url": "https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 81, "Title": "Search in Rotated Sorted Array II", "TitleCn": "\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/search-in-rotated-sorted-array-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 82, "Title": "Remove Duplicates from Sorted List II", "TitleCn": "\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20 II", "Url": "https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 83, "Title": "Remove Duplicates from Sorted List", "TitleCn": "\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20", "Url": "https://leetcode.cn/problems/remove-duplicates-from-sorted-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 84, "Title": "Largest Rectangle in Histogram", "TitleCn": "\u67f1\u72b6\u56fe\u4e2d\u6700\u5927\u7684\u77e9\u5f62", "Url": "https://leetcode.cn/problems/largest-rectangle-in-histogram/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 85, "Title": "Maximal Rectangle", "TitleCn": "\u6700\u5927\u77e9\u5f62", "Url": "https://leetcode.cn/problems/maximal-rectangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 86, "Title": "Partition List", "TitleCn": "\u5206\u9694\u94fe\u8868", "Url": "https://leetcode.cn/problems/partition-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 87, "Title": "Scramble String", "TitleCn": "\u6270\u4e71\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/scramble-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 88, "Title": "Merge Sorted Array", "TitleCn": "\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/merge-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 89, "Title": "Gray Code", "TitleCn": "\u683c\u96f7\u7f16\u7801", "Url": "https://leetcode.cn/problems/gray-code/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 90, "Title": "Subsets II", "TitleCn": "\u5b50\u96c6 II", "Url": "https://leetcode.cn/problems/subsets-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 91, "Title": "Decode Ways", "TitleCn": "\u89e3\u7801\u65b9\u6cd5", "Url": "https://leetcode.cn/problems/decode-ways/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 92, "Title": "Reverse Linked List II", "TitleCn": "\u53cd\u8f6c\u94fe\u8868 II", "Url": "https://leetcode.cn/problems/reverse-linked-list-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 93, "Title": "Restore IP Addresses", "TitleCn": "\u590d\u539fIP\u5730\u5740", "Url": "https://leetcode.cn/problems/restore-ip-addresses/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 94, "Title": "Binary Tree Inorder Traversal", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u4e2d\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/binary-tree-inorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 95, "Title": "Unique Binary Search Trees II", "TitleCn": "\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811 II", "Url": "https://leetcode.cn/problems/unique-binary-search-trees-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 96, "Title": "Unique Binary Search Trees", "TitleCn": "\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/unique-binary-search-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 97, "Title": "Interleaving String", "TitleCn": "\u4ea4\u9519\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/interleaving-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 98, "Title": "Validate Binary Search Tree", "TitleCn": "\u9a8c\u8bc1\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/validate-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 99, "Title": "Recover Binary Search Tree", "TitleCn": "\u6062\u590d\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/recover-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 9, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 100, "Title": "Same Tree", "TitleCn": "\u76f8\u540c\u7684\u6811", "Url": "https://leetcode.cn/problems/same-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 101, "Title": "Symmetric Tree", "TitleCn": "\u5bf9\u79f0\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/symmetric-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 102, "Title": "Binary Tree Level Order Traversal", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/binary-tree-level-order-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 103, "Title": "Binary Tree Zigzag Level Order Traversal", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u952f\u9f7f\u5f62\u5c42\u6b21\u904d\u5386", "Url": "https://leetcode.cn/problems/binary-tree-zigzag-level-order-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 104, "Title": "Maximum Depth of Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6", "Url": "https://leetcode.cn/problems/maximum-depth-of-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 105, "Title": "Construct Binary Tree from Preorder and Inorder Traversal", "TitleCn": "\u4ece\u524d\u5e8f\u4e0e\u4e2d\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 106, "Title": "Construct Binary Tree from Inorder and Postorder Traversal", "TitleCn": "\u4ece\u4e2d\u5e8f\u4e0e\u540e\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 107, "Title": "Binary Tree Level Order Traversal II", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5c42\u6b21\u904d\u5386 II", "Url": "https://leetcode.cn/problems/binary-tree-level-order-traversal-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 108, "Title": "Convert Sorted Array to Binary Search Tree", "TitleCn": "\u5c06\u6709\u5e8f\u6570\u7ec4\u8f6c\u6362\u4e3a\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 109, "Title": "Convert Sorted List to Binary Search Tree", "TitleCn": "\u6709\u5e8f\u94fe\u8868\u8f6c\u6362\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/convert-sorted-list-to-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 110, "Title": "Balanced Binary Tree", "TitleCn": "\u5e73\u8861\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/balanced-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 111, "Title": "Minimum Depth of Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u6700\u5c0f\u6df1\u5ea6", "Url": "https://leetcode.cn/problems/minimum-depth-of-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 112, "Title": "Path Sum", "TitleCn": "\u8def\u5f84\u603b\u548c", "Url": "https://leetcode.cn/problems/path-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 113, "Title": "Path Sum II", "TitleCn": "\u8def\u5f84\u603b\u548c II", "Url": "https://leetcode.cn/problems/path-sum-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 114, "Title": "Flatten Binary Tree to Linked List", "TitleCn": "\u4e8c\u53c9\u6811\u5c55\u5f00\u4e3a\u94fe\u8868", "Url": "https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 115, "Title": "Distinct Subsequences", "TitleCn": "\u4e0d\u540c\u7684\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/distinct-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 116, "Title": "Populating Next Right Pointers in Each Node", "TitleCn": "\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488", "Url": "https://leetcode.cn/problems/populating-next-right-pointers-in-each-node/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 117, "Title": "Populating Next Right Pointers in Each Node II", "TitleCn": "\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488 II", "Url": "https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 118, "Title": "Pascal's Triangle", "TitleCn": "\u6768\u8f89\u4e09\u89d2", "Url": "https://leetcode.cn/problems/pascals-triangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 119, "Title": "Pascal's Triangle II", "TitleCn": "\u6768\u8f89\u4e09\u89d2 II", "Url": "https://leetcode.cn/problems/pascals-triangle-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 120, "Title": "Triangle", "TitleCn": "\u4e09\u89d2\u5f62\u6700\u5c0f\u8def\u5f84\u548c", "Url": "https://leetcode.cn/problems/triangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 121, "Title": "Best Time to Buy and Sell Stock", "TitleCn": "\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a", "Url": "https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 122, "Title": "Best Time to Buy and Sell Stock II", "TitleCn": "\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a II", "Url": "https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 123, "Title": "Best Time to Buy and Sell Stock III", "TitleCn": "\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a III", "Url": "https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 124, "Title": "Binary Tree Maximum Path Sum", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u5927\u8def\u5f84\u548c", "Url": "https://leetcode.cn/problems/binary-tree-maximum-path-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 125, "Title": "Valid Palindrome", "TitleCn": "\u9a8c\u8bc1\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/valid-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 126, "Title": "Word Ladder II", "TitleCn": "\u5355\u8bcd\u63a5\u9f99 II", "Url": "https://leetcode.cn/problems/word-ladder-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 127, "Title": "Word Ladder", "TitleCn": "\u5355\u8bcd\u63a5\u9f99", "Url": "https://leetcode.cn/problems/word-ladder/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 128, "Title": "Longest Consecutive Sequence", "TitleCn": "\u6700\u957f\u8fde\u7eed\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-consecutive-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 129, "Title": "Sum Root to Leaf Numbers", "TitleCn": "\u6c42\u6839\u5230\u53f6\u5b50\u8282\u70b9\u6570\u5b57\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-root-to-leaf-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 130, "Title": "Surrounded Regions", "TitleCn": "\u88ab\u56f4\u7ed5\u7684\u533a\u57df", "Url": "https://leetcode.cn/problems/surrounded-regions/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 131, "Title": "Palindrome Partitioning", "TitleCn": "\u5206\u5272\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/palindrome-partitioning/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 132, "Title": "Palindrome Partitioning II", "TitleCn": "\u5206\u5272\u56de\u6587\u4e32 II", "Url": "https://leetcode.cn/problems/palindrome-partitioning-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 133, "Title": "Clone Graph", "TitleCn": "\u514b\u9686\u56fe", "Url": "https://leetcode.cn/problems/clone-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 134, "Title": "Gas Station", "TitleCn": "\u52a0\u6cb9\u7ad9", "Url": "https://leetcode.cn/problems/gas-station/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 135, "Title": "Candy", "TitleCn": "\u5206\u53d1\u7cd6\u679c", "Url": "https://leetcode.cn/problems/candy/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 136, "Title": "Single Number", "TitleCn": "\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/single-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 137, "Title": "Single Number II", "TitleCn": "\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 II", "Url": "https://leetcode.cn/problems/single-number-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 138, "Title": "Copy List with Random Pointer", "TitleCn": "\u590d\u5236\u5e26\u968f\u673a\u6307\u9488\u7684\u94fe\u8868", "Url": "https://leetcode.cn/problems/copy-list-with-random-pointer/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 139, "Title": "Word Break", "TitleCn": "\u5355\u8bcd\u62c6\u5206", "Url": "https://leetcode.cn/problems/word-break/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 140, "Title": "Word Break II", "TitleCn": "\u5355\u8bcd\u62c6\u5206 II", "Url": "https://leetcode.cn/problems/word-break-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 141, "Title": "Linked List Cycle", "TitleCn": "\u73af\u5f62\u94fe\u8868", "Url": "https://leetcode.cn/problems/linked-list-cycle/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 142, "Title": "Linked List Cycle II", "TitleCn": "\u73af\u5f62\u94fe\u8868 II", "Url": "https://leetcode.cn/problems/linked-list-cycle-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 143, "Title": "Reorder List", "TitleCn": "\u91cd\u6392\u94fe\u8868", "Url": "https://leetcode.cn/problems/reorder-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 144, "Title": "Binary Tree Preorder Traversal", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/binary-tree-preorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 145, "Title": "Binary Tree Postorder Traversal", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/binary-tree-postorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 146, "Title": "LRU Cache", "TitleCn": "LRU \u7f13\u5b58", "Url": "https://leetcode.cn/problems/lru-cache/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 147, "Title": "Insertion Sort List", "TitleCn": "\u5bf9\u94fe\u8868\u8fdb\u884c\u63d2\u5165\u6392\u5e8f", "Url": "https://leetcode.cn/problems/insertion-sort-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 148, "Title": "Sort List", "TitleCn": "\u6392\u5e8f\u94fe\u8868", "Url": "https://leetcode.cn/problems/sort-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 149, "Title": "Max Points on a Line", "TitleCn": "\u76f4\u7ebf\u4e0a\u6700\u591a\u7684\u70b9\u6570", "Url": "https://leetcode.cn/problems/max-points-on-a-line/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 150, "Title": "Evaluate Reverse Polish Notation", "TitleCn": "\u9006\u6ce2\u5170\u8868\u8fbe\u5f0f\u6c42\u503c", "Url": "https://leetcode.cn/problems/evaluate-reverse-polish-notation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 151, "Title": "Reverse Words in a String", "TitleCn": "\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd", "Url": "https://leetcode.cn/problems/reverse-words-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 152, "Title": "Maximum Product Subarray", "TitleCn": "\u4e58\u79ef\u6700\u5927\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/maximum-product-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 153, "Title": "Find Minimum in Rotated Sorted Array", "TitleCn": "\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 154, "Title": "Find Minimum in Rotated Sorted Array II", "TitleCn": "\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c II", "Url": "https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 6, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 155, "Title": "Min Stack", "TitleCn": "\u6700\u5c0f\u6808", "Url": "https://leetcode.cn/problems/min-stack/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 156, "Title": "Binary Tree Upside Down", "TitleCn": "\u4e0a\u4e0b\u7ffb\u8f6c\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/binary-tree-upside-down/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 157, "Title": "Read N Characters Given Read4", "TitleCn": "\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26", "Url": "https://leetcode.cn/problems/read-n-characters-given-read4/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 158, "Title": "Read N Characters Given read4 II - Call Multiple Times", "TitleCn": "\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26 II - \u591a\u6b21\u8c03\u7528", "Url": "https://leetcode.cn/problems/read-n-characters-given-read4-ii-call-multiple-times/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 159, "Title": "Longest Substring with At Most Two Distinct Characters", "TitleCn": "\u81f3\u591a\u5305\u542b\u4e24\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32", "Url": "https://leetcode.cn/problems/longest-substring-with-at-most-two-distinct-characters/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 160, "Title": "Intersection of Two Linked Lists", "TitleCn": "\u76f8\u4ea4\u94fe\u8868", "Url": "https://leetcode.cn/problems/intersection-of-two-linked-lists/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 161, "Title": "One Edit Distance", "TitleCn": "\u76f8\u9694\u4e3a 1 \u7684\u7f16\u8f91\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/one-edit-distance/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 162, "Title": "Find Peak Element", "TitleCn": "\u5bfb\u627e\u5cf0\u503c", "Url": "https://leetcode.cn/problems/find-peak-element/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 163, "Title": "Missing Ranges", "TitleCn": "\u7f3a\u5931\u7684\u533a\u95f4", "Url": "https://leetcode.cn/problems/missing-ranges/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 164, "Title": "Maximum Gap", "TitleCn": "\u6700\u5927\u95f4\u8ddd", "Url": "https://leetcode.cn/problems/maximum-gap/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 165, "Title": "Compare Version Numbers", "TitleCn": "\u6bd4\u8f83\u7248\u672c\u53f7", "Url": "https://leetcode.cn/problems/compare-version-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 166, "Title": "Fraction to Recurring Decimal", "TitleCn": "\u5206\u6570\u5230\u5c0f\u6570", "Url": "https://leetcode.cn/problems/fraction-to-recurring-decimal/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 167, "Title": "Two Sum II - Input Array Is Sorted", "TitleCn": "\u4e24\u6570\u4e4b\u548c II - \u8f93\u5165\u6709\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 168, "Title": "Excel Sheet Column Title", "TitleCn": "Excel\u8868\u5217\u540d\u79f0", "Url": "https://leetcode.cn/problems/excel-sheet-column-title/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 169, "Title": "Majority Element", "TitleCn": "\u591a\u6570\u5143\u7d20", "Url": "https://leetcode.cn/problems/majority-element/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 170, "Title": "Two Sum III - Data structure design", "TitleCn": "\u4e24\u6570\u4e4b\u548c III - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1", "Url": "https://leetcode.cn/problems/two-sum-iii-data-structure-design/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 171, "Title": "Excel Sheet Column Number", "TitleCn": "Excel\u8868\u5217\u5e8f\u53f7", "Url": "https://leetcode.cn/problems/excel-sheet-column-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 172, "Title": "Factorial Trailing Zeroes", "TitleCn": "\u9636\u4e58\u540e\u7684\u96f6", "Url": "https://leetcode.cn/problems/factorial-trailing-zeroes/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 173, "Title": "Binary Search Tree Iterator", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668", "Url": "https://leetcode.cn/problems/binary-search-tree-iterator/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 174, "Title": "Dungeon Game", "TitleCn": "\u5730\u4e0b\u57ce\u6e38\u620f", "Url": "https://leetcode.cn/problems/dungeon-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 175, "Title": "Combine Two Tables", "TitleCn": "\u7ec4\u5408\u4e24\u4e2a\u8868", "Url": "https://leetcode.cn/problems/combine-two-tables/", "Ispaid": 0, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 176, "Title": "Second Highest Salary", "TitleCn": "\u7b2c\u4e8c\u9ad8\u7684\u85aa\u6c34", "Url": "https://leetcode.cn/problems/second-highest-salary/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 177, "Title": "Nth Highest Salary", "TitleCn": "\u7b2cN\u9ad8\u7684\u85aa\u6c34", "Url": "https://leetcode.cn/problems/nth-highest-salary/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 178, "Title": "Rank Scores", "TitleCn": "\u5206\u6570\u6392\u540d", "Url": "https://leetcode.cn/problems/rank-scores/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 179, "Title": "Largest Number", "TitleCn": "\u6700\u5927\u6570", "Url": "https://leetcode.cn/problems/largest-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 180, "Title": "Consecutive Numbers", "TitleCn": "\u8fde\u7eed\u51fa\u73b0\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/consecutive-numbers/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 181, "Title": "Employees Earning More Than Their Managers", "TitleCn": "\u8d85\u8fc7\u7ecf\u7406\u6536\u5165\u7684\u5458\u5de5", "Url": "https://leetcode.cn/problems/employees-earning-more-than-their-managers/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 182, "Title": "Duplicate Emails", "TitleCn": "\u67e5\u627e\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1", "Url": "https://leetcode.cn/problems/duplicate-emails/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 183, "Title": "Customers Who Never Order", "TitleCn": "\u4ece\u4e0d\u8ba2\u8d2d\u7684\u5ba2\u6237", "Url": "https://leetcode.cn/problems/customers-who-never-order/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 184, "Title": "Department Highest Salary", "TitleCn": "\u90e8\u95e8\u5de5\u8d44\u6700\u9ad8\u7684\u5458\u5de5", "Url": "https://leetcode.cn/problems/department-highest-salary/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 185, "Title": "Department Top Three Salaries", "TitleCn": "\u90e8\u95e8\u5de5\u8d44\u524d\u4e09\u9ad8\u7684\u6240\u6709\u5458\u5de5", "Url": "https://leetcode.cn/problems/department-top-three-salaries/", "Ispaid": 0, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 186, "Title": "Reverse Words in a String II", "TitleCn": "\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd II", "Url": "https://leetcode.cn/problems/reverse-words-in-a-string-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 187, "Title": "Repeated DNA Sequences", "TitleCn": "\u91cd\u590d\u7684DNA\u5e8f\u5217", "Url": "https://leetcode.cn/problems/repeated-dna-sequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 188, "Title": "Best Time to Buy and Sell Stock IV", "TitleCn": "\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a IV", "Url": "https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 189, "Title": "Rotate Array", "TitleCn": "\u8f6e\u8f6c\u6570\u7ec4", "Url": "https://leetcode.cn/problems/rotate-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 190, "Title": "Reverse Bits", "TitleCn": "\u98a0\u5012\u4e8c\u8fdb\u5236\u4f4d", "Url": "https://leetcode.cn/problems/reverse-bits/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 191, "Title": "Number of 1 Bits", "TitleCn": "\u4f4d1\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/number-of-1-bits/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 192, "Title": "Word Frequency", "TitleCn": "\u7edf\u8ba1\u8bcd\u9891", "Url": "https://leetcode.cn/problems/word-frequency/", "Ispaid": 0, "Type": "Shell", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 193, "Title": "Valid Phone Numbers", "TitleCn": "\u6709\u6548\u7535\u8bdd\u53f7\u7801", "Url": "https://leetcode.cn/problems/valid-phone-numbers/", "Ispaid": 0, "Type": "Shell", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 194, "Title": "Transpose File", "TitleCn": "\u8f6c\u7f6e\u6587\u4ef6", "Url": "https://leetcode.cn/problems/transpose-file/", "Ispaid": 0, "Type": "Shell", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 195, "Title": "Tenth Line", "TitleCn": "\u7b2c\u5341\u884c", "Url": "https://leetcode.cn/problems/tenth-line/", "Ispaid": 0, "Type": "Shell", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 196, "Title": "Delete Duplicate Emails", "TitleCn": "\u5220\u9664\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1", "Url": "https://leetcode.cn/problems/delete-duplicate-emails/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 197, "Title": "Rising Temperature", "TitleCn": "\u4e0a\u5347\u7684\u6e29\u5ea6", "Url": "https://leetcode.cn/problems/rising-temperature/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 198, "Title": "House Robber", "TitleCn": "\u6253\u5bb6\u52ab\u820d", "Url": "https://leetcode.cn/problems/house-robber/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 199, "Title": "Binary Tree Right Side View", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u53f3\u89c6\u56fe", "Url": "https://leetcode.cn/problems/binary-tree-right-side-view/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 200, "Title": "Number of Islands", "TitleCn": "\u5c9b\u5c7f\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-islands/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 201, "Title": "Bitwise AND of Numbers Range", "TitleCn": "\u6570\u5b57\u8303\u56f4\u6309\u4f4d\u4e0e", "Url": "https://leetcode.cn/problems/bitwise-and-of-numbers-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 202, "Title": "Happy Number", "TitleCn": "\u5feb\u4e50\u6570", "Url": "https://leetcode.cn/problems/happy-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 203, "Title": "Remove Linked List Elements", "TitleCn": "\u79fb\u9664\u94fe\u8868\u5143\u7d20", "Url": "https://leetcode.cn/problems/remove-linked-list-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 204, "Title": "Count Primes", "TitleCn": "\u8ba1\u6570\u8d28\u6570", "Url": "https://leetcode.cn/problems/count-primes/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 205, "Title": "Isomorphic Strings", "TitleCn": "\u540c\u6784\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/isomorphic-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 206, "Title": "Reverse Linked List", "TitleCn": "\u53cd\u8f6c\u94fe\u8868", "Url": "https://leetcode.cn/problems/reverse-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 207, "Title": "Course Schedule", "TitleCn": "\u8bfe\u7a0b\u8868", "Url": "https://leetcode.cn/problems/course-schedule/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 208, "Title": "Implement Trie (Prefix Tree)", "TitleCn": "\u5b9e\u73b0 Trie (\u524d\u7f00\u6811)", "Url": "https://leetcode.cn/problems/implement-trie-prefix-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 209, "Title": "Minimum Size Subarray Sum", "TitleCn": "\u957f\u5ea6\u6700\u5c0f\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/minimum-size-subarray-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 210, "Title": "Course Schedule II", "TitleCn": "\u8bfe\u7a0b\u8868 II", "Url": "https://leetcode.cn/problems/course-schedule-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 211, "Title": "Design Add and Search Words Data Structure", "TitleCn": "\u6dfb\u52a0\u4e0e\u641c\u7d22\u5355\u8bcd - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1", "Url": "https://leetcode.cn/problems/design-add-and-search-words-data-structure/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 212, "Title": "Word Search II", "TitleCn": "\u5355\u8bcd\u641c\u7d22 II", "Url": "https://leetcode.cn/problems/word-search-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 213, "Title": "House Robber II", "TitleCn": "\u6253\u5bb6\u52ab\u820d II", "Url": "https://leetcode.cn/problems/house-robber-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 214, "Title": "Shortest Palindrome", "TitleCn": "\u6700\u77ed\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/shortest-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 215, "Title": "Kth Largest Element in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684\u7b2cK\u4e2a\u6700\u5927\u5143\u7d20", "Url": "https://leetcode.cn/problems/kth-largest-element-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 216, "Title": "Combination Sum III", "TitleCn": "\u7ec4\u5408\u603b\u548c III", "Url": "https://leetcode.cn/problems/combination-sum-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 217, "Title": "Contains Duplicate", "TitleCn": "\u5b58\u5728\u91cd\u590d\u5143\u7d20", "Url": "https://leetcode.cn/problems/contains-duplicate/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 218, "Title": "The Skyline Problem", "TitleCn": "\u5929\u9645\u7ebf\u95ee\u9898", "Url": "https://leetcode.cn/problems/the-skyline-problem/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 219, "Title": "Contains Duplicate II", "TitleCn": "\u5b58\u5728\u91cd\u590d\u5143\u7d20 II", "Url": "https://leetcode.cn/problems/contains-duplicate-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 220, "Title": "Contains Duplicate III", "TitleCn": "\u5b58\u5728\u91cd\u590d\u5143\u7d20 III", "Url": "https://leetcode.cn/problems/contains-duplicate-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 221, "Title": "Maximal Square", "TitleCn": "\u6700\u5927\u6b63\u65b9\u5f62", "Url": "https://leetcode.cn/problems/maximal-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 222, "Title": "Count Complete Tree Nodes", "TitleCn": "\u5b8c\u5168\u4e8c\u53c9\u6811\u7684\u8282\u70b9\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-complete-tree-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 223, "Title": "Rectangle Area", "TitleCn": "\u77e9\u5f62\u9762\u79ef", "Url": "https://leetcode.cn/problems/rectangle-area/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 224, "Title": "Basic Calculator", "TitleCn": "\u57fa\u672c\u8ba1\u7b97\u5668", "Url": "https://leetcode.cn/problems/basic-calculator/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 225, "Title": "Implement Stack using Queues", "TitleCn": "\u7528\u961f\u5217\u5b9e\u73b0\u6808", "Url": "https://leetcode.cn/problems/implement-stack-using-queues/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 226, "Title": "Invert Binary Tree", "TitleCn": "\u7ffb\u8f6c\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/invert-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 227, "Title": "Basic Calculator II", "TitleCn": "\u57fa\u672c\u8ba1\u7b97\u5668 II", "Url": "https://leetcode.cn/problems/basic-calculator-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 228, "Title": "Summary Ranges", "TitleCn": "\u6c47\u603b\u533a\u95f4", "Url": "https://leetcode.cn/problems/summary-ranges/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 229, "Title": "Majority Element II", "TitleCn": "\u591a\u6570\u5143\u7d20 II", "Url": "https://leetcode.cn/problems/majority-element-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 230, "Title": "Kth Smallest Element in a BST", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7b2cK\u5c0f\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/kth-smallest-element-in-a-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 231, "Title": "Power of Two", "TitleCn": "2\u7684\u5e42", "Url": "https://leetcode.cn/problems/power-of-two/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 232, "Title": "Implement Queue using Stacks", "TitleCn": "\u7528\u6808\u5b9e\u73b0\u961f\u5217", "Url": "https://leetcode.cn/problems/implement-queue-using-stacks/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 233, "Title": "Number of Digit One", "TitleCn": "\u6570\u5b57 1 \u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/number-of-digit-one/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 234, "Title": "Palindrome Linked List", "TitleCn": "\u56de\u6587\u94fe\u8868", "Url": "https://leetcode.cn/problems/palindrome-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 235, "Title": "Lowest Common Ancestor of a Binary Search Tree", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148", "Url": "https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 236, "Title": "Lowest Common Ancestor of a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148", "Url": "https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 237, "Title": "Delete Node in a Linked List", "TitleCn": "\u5220\u9664\u94fe\u8868\u4e2d\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/delete-node-in-a-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 238, "Title": "Product of Array Except Self", "TitleCn": "\u9664\u81ea\u8eab\u4ee5\u5916\u6570\u7ec4\u7684\u4e58\u79ef", "Url": "https://leetcode.cn/problems/product-of-array-except-self/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 239, "Title": "Sliding Window Maximum", "TitleCn": "\u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/sliding-window-maximum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 240, "Title": "Search a 2D Matrix II", "TitleCn": "\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635 II", "Url": "https://leetcode.cn/problems/search-a-2d-matrix-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 241, "Title": "Different Ways to Add Parentheses", "TitleCn": "\u4e3a\u8fd0\u7b97\u8868\u8fbe\u5f0f\u8bbe\u8ba1\u4f18\u5148\u7ea7", "Url": "https://leetcode.cn/problems/different-ways-to-add-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 242, "Title": "Valid Anagram", "TitleCn": "\u6709\u6548\u7684\u5b57\u6bcd\u5f02\u4f4d\u8bcd", "Url": "https://leetcode.cn/problems/valid-anagram/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 243, "Title": "Shortest Word Distance", "TitleCn": "\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/shortest-word-distance/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 244, "Title": "Shortest Word Distance II", "TitleCn": "\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb II", "Url": "https://leetcode.cn/problems/shortest-word-distance-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 245, "Title": "Shortest Word Distance III", "TitleCn": "\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb III", "Url": "https://leetcode.cn/problems/shortest-word-distance-iii/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 246, "Title": "Strobogrammatic Number", "TitleCn": "\u4e2d\u5fc3\u5bf9\u79f0\u6570", "Url": "https://leetcode.cn/problems/strobogrammatic-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 247, "Title": "Strobogrammatic Number II", "TitleCn": "\u4e2d\u5fc3\u5bf9\u79f0\u6570 II", "Url": "https://leetcode.cn/problems/strobogrammatic-number-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 248, "Title": "Strobogrammatic Number III", "TitleCn": "\u4e2d\u5fc3\u5bf9\u79f0\u6570 III", "Url": "https://leetcode.cn/problems/strobogrammatic-number-iii/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 249, "Title": "Group Shifted Strings", "TitleCn": "\u79fb\u4f4d\u5b57\u7b26\u4e32\u5206\u7ec4", "Url": "https://leetcode.cn/problems/group-shifted-strings/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 250, "Title": "Count Univalue Subtrees", "TitleCn": "\u7edf\u8ba1\u540c\u503c\u5b50\u6811", "Url": "https://leetcode.cn/problems/count-univalue-subtrees/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 251, "Title": "Flatten 2D Vector", "TitleCn": "\u5c55\u5f00\u4e8c\u7ef4\u5411\u91cf", "Url": "https://leetcode.cn/problems/flatten-2d-vector/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 252, "Title": "Meeting Rooms", "TitleCn": "\u4f1a\u8bae\u5ba4", "Url": "https://leetcode.cn/problems/meeting-rooms/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 253, "Title": "Meeting Rooms II", "TitleCn": "\u4f1a\u8bae\u5ba4 II", "Url": "https://leetcode.cn/problems/meeting-rooms-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 254, "Title": "Factor Combinations", "TitleCn": "\u56e0\u5b50\u7684\u7ec4\u5408", "Url": "https://leetcode.cn/problems/factor-combinations/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 255, "Title": "Verify Preorder Sequence in Binary Search Tree", "TitleCn": "\u9a8c\u8bc1\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u524d\u5e8f\u904d\u5386\u5e8f\u5217", "Url": "https://leetcode.cn/problems/verify-preorder-sequence-in-binary-search-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 256, "Title": "Paint House", "TitleCn": "\u7c89\u5237\u623f\u5b50", "Url": "https://leetcode.cn/problems/paint-house/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 257, "Title": "Binary Tree Paths", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u6240\u6709\u8def\u5f84", "Url": "https://leetcode.cn/problems/binary-tree-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 258, "Title": "Add Digits", "TitleCn": "\u5404\u4f4d\u76f8\u52a0", "Url": "https://leetcode.cn/problems/add-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 259, "Title": "3Sum Smaller", "TitleCn": "\u8f83\u5c0f\u7684\u4e09\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/3sum-smaller/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 260, "Title": "Single Number III", "TitleCn": "\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 III", "Url": "https://leetcode.cn/problems/single-number-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 261, "Title": "Graph Valid Tree", "TitleCn": "\u4ee5\u56fe\u5224\u6811", "Url": "https://leetcode.cn/problems/graph-valid-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 262, "Title": "Trips and Users", "TitleCn": "\u884c\u7a0b\u548c\u7528\u6237", "Url": "https://leetcode.cn/problems/trips-and-users/", "Ispaid": 0, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 263, "Title": "Ugly Number", "TitleCn": "\u4e11\u6570", "Url": "https://leetcode.cn/problems/ugly-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 264, "Title": "Ugly Number II", "TitleCn": "\u4e11\u6570 II", "Url": "https://leetcode.cn/problems/ugly-number-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 265, "Title": "Paint House II", "TitleCn": "\u7c89\u5237\u623f\u5b50 II", "Url": "https://leetcode.cn/problems/paint-house-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 6, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 266, "Title": "Palindrome Permutation", "TitleCn": "\u56de\u6587\u6392\u5217", "Url": "https://leetcode.cn/problems/palindrome-permutation/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 267, "Title": "Palindrome Permutation II", "TitleCn": "\u56de\u6587\u6392\u5217 II", "Url": "https://leetcode.cn/problems/palindrome-permutation-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 268, "Title": "Missing Number", "TitleCn": "\u4e22\u5931\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/missing-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 269, "Title": "Alien Dictionary", "TitleCn": "\u706b\u661f\u8bcd\u5178", "Url": "https://leetcode.cn/problems/alien-dictionary/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 270, "Title": "Closest Binary Search Tree Value", "TitleCn": "\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c", "Url": "https://leetcode.cn/problems/closest-binary-search-tree-value/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 271, "Title": "Encode and Decode Strings", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u7f16\u7801\u4e0e\u89e3\u7801", "Url": "https://leetcode.cn/problems/encode-and-decode-strings/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 272, "Title": "Closest Binary Search Tree Value II", "TitleCn": "\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c II", "Url": "https://leetcode.cn/problems/closest-binary-search-tree-value-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 8, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 273, "Title": "Integer to English Words", "TitleCn": "\u6574\u6570\u8f6c\u6362\u82f1\u6587\u8868\u793a", "Url": "https://leetcode.cn/problems/integer-to-english-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 274, "Title": "H-Index", "TitleCn": "H \u6307\u6570", "Url": "https://leetcode.cn/problems/h-index/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 275, "Title": "H-Index II", "TitleCn": "H \u6307\u6570 II", "Url": "https://leetcode.cn/problems/h-index-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 276, "Title": "Paint Fence", "TitleCn": "\u6805\u680f\u6d82\u8272", "Url": "https://leetcode.cn/problems/paint-fence/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 277, "Title": "Find the Celebrity", "TitleCn": "\u641c\u5bfb\u540d\u4eba", "Url": "https://leetcode.cn/problems/find-the-celebrity/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 278, "Title": "First Bad Version", "TitleCn": "\u7b2c\u4e00\u4e2a\u9519\u8bef\u7684\u7248\u672c", "Url": "https://leetcode.cn/problems/first-bad-version/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 279, "Title": "Perfect Squares", "TitleCn": "\u5b8c\u5168\u5e73\u65b9\u6570", "Url": "https://leetcode.cn/problems/perfect-squares/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 280, "Title": "Wiggle Sort", "TitleCn": "\u6446\u52a8\u6392\u5e8f", "Url": "https://leetcode.cn/problems/wiggle-sort/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 281, "Title": "Zigzag Iterator", "TitleCn": "\u952f\u9f7f\u8fed\u4ee3\u5668", "Url": "https://leetcode.cn/problems/zigzag-iterator/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 282, "Title": "Expression Add Operators", "TitleCn": "\u7ed9\u8868\u8fbe\u5f0f\u6dfb\u52a0\u8fd0\u7b97\u7b26", "Url": "https://leetcode.cn/problems/expression-add-operators/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 283, "Title": "Move Zeroes", "TitleCn": "\u79fb\u52a8\u96f6", "Url": "https://leetcode.cn/problems/move-zeroes/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 284, "Title": "Peeking Iterator", "TitleCn": "\u7aa5\u89c6\u8fed\u4ee3\u5668", "Url": "https://leetcode.cn/problems/peeking-iterator/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 285, "Title": "Inorder Successor in BST", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7", "Url": "https://leetcode.cn/problems/inorder-successor-in-bst/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 286, "Title": "Walls and Gates", "TitleCn": "\u5899\u4e0e\u95e8", "Url": "https://leetcode.cn/problems/walls-and-gates/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 287, "Title": "Find the Duplicate Number", "TitleCn": "\u5bfb\u627e\u91cd\u590d\u6570", "Url": "https://leetcode.cn/problems/find-the-duplicate-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 288, "Title": "Unique Word Abbreviation", "TitleCn": "\u5355\u8bcd\u7684\u552f\u4e00\u7f29\u5199", "Url": "https://leetcode.cn/problems/unique-word-abbreviation/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 289, "Title": "Game of Life", "TitleCn": "\u751f\u547d\u6e38\u620f", "Url": "https://leetcode.cn/problems/game-of-life/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 290, "Title": "Word Pattern", "TitleCn": "\u5355\u8bcd\u89c4\u5f8b", "Url": "https://leetcode.cn/problems/word-pattern/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 291, "Title": "Word Pattern II", "TitleCn": "\u5355\u8bcd\u89c4\u5f8b II", "Url": "https://leetcode.cn/problems/word-pattern-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 292, "Title": "Nim Game", "TitleCn": "Nim \u6e38\u620f", "Url": "https://leetcode.cn/problems/nim-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 293, "Title": "Flip Game", "TitleCn": "\u7ffb\u8f6c\u6e38\u620f", "Url": "https://leetcode.cn/problems/flip-game/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 294, "Title": "Flip Game II", "TitleCn": "\u7ffb\u8f6c\u6e38\u620f II", "Url": "https://leetcode.cn/problems/flip-game-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 295, "Title": "Find Median from Data Stream", "TitleCn": "\u6570\u636e\u6d41\u7684\u4e2d\u4f4d\u6570", "Url": "https://leetcode.cn/problems/find-median-from-data-stream/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 8, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 296, "Title": "Best Meeting Point", "TitleCn": "\u6700\u4f73\u7684\u78b0\u5934\u5730\u70b9", "Url": "https://leetcode.cn/problems/best-meeting-point/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 297, "Title": "Serialize and Deserialize Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5e8f\u5217\u5316\u4e0e\u53cd\u5e8f\u5217\u5316", "Url": "https://leetcode.cn/problems/serialize-and-deserialize-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 298, "Title": "Binary Tree Longest Consecutive Sequence", "TitleCn": "\u4e8c\u53c9\u6811\u6700\u957f\u8fde\u7eed\u5e8f\u5217", "Url": "https://leetcode.cn/problems/binary-tree-longest-consecutive-sequence/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 299, "Title": "Bulls and Cows", "TitleCn": "\u731c\u6570\u5b57\u6e38\u620f", "Url": "https://leetcode.cn/problems/bulls-and-cows/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 300, "Title": "Longest Increasing Subsequence", "TitleCn": "\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-increasing-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 301, "Title": "Remove Invalid Parentheses", "TitleCn": "\u5220\u9664\u65e0\u6548\u7684\u62ec\u53f7", "Url": "https://leetcode.cn/problems/remove-invalid-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 302, "Title": "Smallest Rectangle Enclosing Black Pixels", "TitleCn": "\u5305\u542b\u5168\u90e8\u9ed1\u8272\u50cf\u7d20\u7684\u6700\u5c0f\u77e9\u5f62", "Url": "https://leetcode.cn/problems/smallest-rectangle-enclosing-black-pixels/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 303, "Title": "Range Sum Query - Immutable", "TitleCn": "\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u4e0d\u53ef\u53d8", "Url": "https://leetcode.cn/problems/range-sum-query-immutable/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 304, "Title": "Range Sum Query 2D - Immutable", "TitleCn": "\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u77e9\u9635\u4e0d\u53ef\u53d8", "Url": "https://leetcode.cn/problems/range-sum-query-2d-immutable/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 305, "Title": "Number of Islands II", "TitleCn": "\u5c9b\u5c7f\u6570\u91cf II", "Url": "https://leetcode.cn/problems/number-of-islands-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 306, "Title": "Additive Number", "TitleCn": "\u7d2f\u52a0\u6570", "Url": "https://leetcode.cn/problems/additive-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 307, "Title": "Range Sum Query - Mutable", "TitleCn": "\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u53ef\u4fee\u6539", "Url": "https://leetcode.cn/problems/range-sum-query-mutable/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 308, "Title": "Range Sum Query 2D - Mutable", "TitleCn": "\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u77e9\u9635\u53ef\u4fee\u6539", "Url": "https://leetcode.cn/problems/range-sum-query-2d-mutable/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 309, "Title": "Best Time to Buy and Sell Stock with Cooldown", "TitleCn": "\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a\u542b\u51b7\u51bb\u671f", "Url": "https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 310, "Title": "Minimum Height Trees", "TitleCn": "\u6700\u5c0f\u9ad8\u5ea6\u6811", "Url": "https://leetcode.cn/problems/minimum-height-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 311, "Title": "Sparse Matrix Multiplication", "TitleCn": "\u7a00\u758f\u77e9\u9635\u7684\u4e58\u6cd5", "Url": "https://leetcode.cn/problems/sparse-matrix-multiplication/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 312, "Title": "Burst Balloons", "TitleCn": "\u6233\u6c14\u7403", "Url": "https://leetcode.cn/problems/burst-balloons/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 313, "Title": "Super Ugly Number", "TitleCn": "\u8d85\u7ea7\u4e11\u6570", "Url": "https://leetcode.cn/problems/super-ugly-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 314, "Title": "Binary Tree Vertical Order Traversal", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5782\u76f4\u904d\u5386", "Url": "https://leetcode.cn/problems/binary-tree-vertical-order-traversal/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 315, "Title": "Count of Smaller Numbers After Self", "TitleCn": "\u8ba1\u7b97\u53f3\u4fa7\u5c0f\u4e8e\u5f53\u524d\u5143\u7d20\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-of-smaller-numbers-after-self/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 316, "Title": "Remove Duplicate Letters", "TitleCn": "\u53bb\u9664\u91cd\u590d\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/remove-duplicate-letters/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 317, "Title": "Shortest Distance from All Buildings", "TitleCn": "\u79bb\u5efa\u7b51\u7269\u6700\u8fd1\u7684\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/shortest-distance-from-all-buildings/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 318, "Title": "Maximum Product of Word Lengths", "TitleCn": "\u6700\u5927\u5355\u8bcd\u957f\u5ea6\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-product-of-word-lengths/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 319, "Title": "Bulb Switcher", "TitleCn": "\u706f\u6ce1\u5f00\u5173", "Url": "https://leetcode.cn/problems/bulb-switcher/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 320, "Title": "Generalized Abbreviation", "TitleCn": "\u5217\u4e3e\u5355\u8bcd\u7684\u5168\u90e8\u7f29\u5199", "Url": "https://leetcode.cn/problems/generalized-abbreviation/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 321, "Title": "Create Maximum Number", "TitleCn": "\u62fc\u63a5\u6700\u5927\u6570", "Url": "https://leetcode.cn/problems/create-maximum-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 322, "Title": "Coin Change", "TitleCn": "\u96f6\u94b1\u5151\u6362", "Url": "https://leetcode.cn/problems/coin-change/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 323, "Title": "Number of Connected Components in an Undirected Graph", "TitleCn": "\u65e0\u5411\u56fe\u4e2d\u8fde\u901a\u5206\u91cf\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 324, "Title": "Wiggle Sort II", "TitleCn": "\u6446\u52a8\u6392\u5e8f II", "Url": "https://leetcode.cn/problems/wiggle-sort-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 325, "Title": "Maximum Size Subarray Sum Equals k", "TitleCn": "\u548c\u7b49\u4e8e k \u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6", "Url": "https://leetcode.cn/problems/maximum-size-subarray-sum-equals-k/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 326, "Title": "Power of Three", "TitleCn": "3\u7684\u5e42", "Url": "https://leetcode.cn/problems/power-of-three/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 327, "Title": "Count of Range Sum", "TitleCn": "\u533a\u95f4\u548c\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-of-range-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 328, "Title": "Odd Even Linked List", "TitleCn": "\u5947\u5076\u94fe\u8868", "Url": "https://leetcode.cn/problems/odd-even-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 329, "Title": "Longest Increasing Path in a Matrix", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u6700\u957f\u9012\u589e\u8def\u5f84", "Url": "https://leetcode.cn/problems/longest-increasing-path-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 330, "Title": "Patching Array", "TitleCn": "\u6309\u8981\u6c42\u8865\u9f50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/patching-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 331, "Title": "Verify Preorder Serialization of a Binary Tree", "TitleCn": "\u9a8c\u8bc1\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u5e8f\u5217\u5316", "Url": "https://leetcode.cn/problems/verify-preorder-serialization-of-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 332, "Title": "Reconstruct Itinerary", "TitleCn": "\u91cd\u65b0\u5b89\u6392\u884c\u7a0b", "Url": "https://leetcode.cn/problems/reconstruct-itinerary/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 333, "Title": "Largest BST Subtree", "TitleCn": "\u6700\u5927\u4e8c\u53c9\u641c\u7d22\u5b50\u6811", "Url": "https://leetcode.cn/problems/largest-bst-subtree/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 334, "Title": "Increasing Triplet Subsequence", "TitleCn": "\u9012\u589e\u7684\u4e09\u5143\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/increasing-triplet-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 335, "Title": "Self Crossing", "TitleCn": "\u8def\u5f84\u4ea4\u53c9", "Url": "https://leetcode.cn/problems/self-crossing/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 336, "Title": "Palindrome Pairs", "TitleCn": "\u56de\u6587\u5bf9", "Url": "https://leetcode.cn/problems/palindrome-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 337, "Title": "House Robber III", "TitleCn": "\u6253\u5bb6\u52ab\u820d III", "Url": "https://leetcode.cn/problems/house-robber-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 338, "Title": "Counting Bits", "TitleCn": "\u6bd4\u7279\u4f4d\u8ba1\u6570", "Url": "https://leetcode.cn/problems/counting-bits/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 339, "Title": "Nested List Weight Sum", "TitleCn": "\u5d4c\u5957\u5217\u8868\u52a0\u6743\u548c", "Url": "https://leetcode.cn/problems/nested-list-weight-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 340, "Title": "Longest Substring with At Most K Distinct Characters", "TitleCn": "\u81f3\u591a\u5305\u542b K \u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32", "Url": "https://leetcode.cn/problems/longest-substring-with-at-most-k-distinct-characters/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 341, "Title": "Flatten Nested List Iterator", "TitleCn": "\u6241\u5e73\u5316\u5d4c\u5957\u5217\u8868\u8fed\u4ee3\u5668", "Url": "https://leetcode.cn/problems/flatten-nested-list-iterator/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 342, "Title": "Power of Four", "TitleCn": "4\u7684\u5e42", "Url": "https://leetcode.cn/problems/power-of-four/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 343, "Title": "Integer Break", "TitleCn": "\u6574\u6570\u62c6\u5206", "Url": "https://leetcode.cn/problems/integer-break/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 344, "Title": "Reverse String", "TitleCn": "\u53cd\u8f6c\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/reverse-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 345, "Title": "Reverse Vowels of a String", "TitleCn": "\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/reverse-vowels-of-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 346, "Title": "Moving Average from Data Stream", "TitleCn": "\u6570\u636e\u6d41\u4e2d\u7684\u79fb\u52a8\u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/moving-average-from-data-stream/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 347, "Title": "Top K Frequent Elements", "TitleCn": "\u524d K \u4e2a\u9ad8\u9891\u5143\u7d20", "Url": "https://leetcode.cn/problems/top-k-frequent-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 348, "Title": "Design Tic-Tac-Toe", "TitleCn": "\u8bbe\u8ba1\u4e95\u5b57\u68cb", "Url": "https://leetcode.cn/problems/design-tic-tac-toe/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 349, "Title": "Intersection of Two Arrays", "TitleCn": "\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6", "Url": "https://leetcode.cn/problems/intersection-of-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 350, "Title": "Intersection of Two Arrays II", "TitleCn": "\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6 II", "Url": "https://leetcode.cn/problems/intersection-of-two-arrays-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 351, "Title": "Android Unlock Patterns", "TitleCn": "\u5b89\u5353\u7cfb\u7edf\u624b\u52bf\u89e3\u9501", "Url": "https://leetcode.cn/problems/android-unlock-patterns/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 352, "Title": "Data Stream as Disjoint Intervals", "TitleCn": "\u5c06\u6570\u636e\u6d41\u53d8\u4e3a\u591a\u4e2a\u4e0d\u76f8\u4ea4\u533a\u95f4", "Url": "https://leetcode.cn/problems/data-stream-as-disjoint-intervals/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 8, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 353, "Title": "Design Snake Game", "TitleCn": "\u8d2a\u5403\u86c7", "Url": "https://leetcode.cn/problems/design-snake-game/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 354, "Title": "Russian Doll Envelopes", "TitleCn": "\u4fc4\u7f57\u65af\u5957\u5a03\u4fe1\u5c01\u95ee\u9898", "Url": "https://leetcode.cn/problems/russian-doll-envelopes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 355, "Title": "Design Twitter", "TitleCn": "\u8bbe\u8ba1\u63a8\u7279", "Url": "https://leetcode.cn/problems/design-twitter/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 356, "Title": "Line Reflection", "TitleCn": "\u76f4\u7ebf\u955c\u50cf", "Url": "https://leetcode.cn/problems/line-reflection/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 357, "Title": "Count Numbers with Unique Digits", "TitleCn": "\u7edf\u8ba1\u5404\u4f4d\u6570\u5b57\u90fd\u4e0d\u540c\u7684\u6570\u5b57\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-numbers-with-unique-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 358, "Title": "Rearrange String k Distance Apart", "TitleCn": "K \u8ddd\u79bb\u95f4\u9694\u91cd\u6392\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/rearrange-string-k-distance-apart/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 359, "Title": "Logger Rate Limiter", "TitleCn": "\u65e5\u5fd7\u901f\u7387\u9650\u5236\u5668", "Url": "https://leetcode.cn/problems/logger-rate-limiter/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 360, "Title": "Sort Transformed Array", "TitleCn": "\u6709\u5e8f\u8f6c\u5316\u6570\u7ec4", "Url": "https://leetcode.cn/problems/sort-transformed-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 361, "Title": "Bomb Enemy", "TitleCn": "\u8f70\u70b8\u654c\u4eba", "Url": "https://leetcode.cn/problems/bomb-enemy/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 362, "Title": "Design Hit Counter", "TitleCn": "\u6572\u51fb\u8ba1\u6570\u5668", "Url": "https://leetcode.cn/problems/design-hit-counter/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 363, "Title": "Max Sum of Rectangle No Larger Than K", "TitleCn": "\u77e9\u5f62\u533a\u57df\u4e0d\u8d85\u8fc7 K \u7684\u6700\u5927\u6570\u503c\u548c", "Url": "https://leetcode.cn/problems/max-sum-of-rectangle-no-larger-than-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 8, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 364, "Title": "Nested List Weight Sum II", "TitleCn": "\u5d4c\u5957\u5217\u8868\u52a0\u6743\u548c II", "Url": "https://leetcode.cn/problems/nested-list-weight-sum-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 365, "Title": "Water and Jug Problem", "TitleCn": "\u6c34\u58f6\u95ee\u9898", "Url": "https://leetcode.cn/problems/water-and-jug-problem/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 366, "Title": "Find Leaves of Binary Tree", "TitleCn": "\u5bfb\u627e\u4e8c\u53c9\u6811\u7684\u53f6\u5b50\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-leaves-of-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 367, "Title": "Valid Perfect Square", "TitleCn": "\u6709\u6548\u7684\u5b8c\u5168\u5e73\u65b9\u6570", "Url": "https://leetcode.cn/problems/valid-perfect-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 368, "Title": "Largest Divisible Subset", "TitleCn": "\u6700\u5927\u6574\u9664\u5b50\u96c6", "Url": "https://leetcode.cn/problems/largest-divisible-subset/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 369, "Title": "Plus One Linked List", "TitleCn": "\u7ed9\u5355\u94fe\u8868\u52a0\u4e00", "Url": "https://leetcode.cn/problems/plus-one-linked-list/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 370, "Title": "Range Addition", "TitleCn": "\u533a\u95f4\u52a0\u6cd5", "Url": "https://leetcode.cn/problems/range-addition/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 371, "Title": "Sum of Two Integers", "TitleCn": "\u4e24\u6574\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-two-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 372, "Title": "Super Pow", "TitleCn": "\u8d85\u7ea7\u6b21\u65b9", "Url": "https://leetcode.cn/problems/super-pow/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 373, "Title": "Find K Pairs with Smallest Sums", "TitleCn": "\u67e5\u627e\u548c\u6700\u5c0f\u7684K\u5bf9\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-k-pairs-with-smallest-sums/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 374, "Title": "Guess Number Higher or Lower", "TitleCn": "\u731c\u6570\u5b57\u5927\u5c0f", "Url": "https://leetcode.cn/problems/guess-number-higher-or-lower/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 375, "Title": "Guess Number Higher or Lower II", "TitleCn": "\u731c\u6570\u5b57\u5927\u5c0f II", "Url": "https://leetcode.cn/problems/guess-number-higher-or-lower-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 376, "Title": "Wiggle Subsequence", "TitleCn": "\u6446\u52a8\u5e8f\u5217", "Url": "https://leetcode.cn/problems/wiggle-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 377, "Title": "Combination Sum IV", "TitleCn": "\u7ec4\u5408\u603b\u548c \u2163", "Url": "https://leetcode.cn/problems/combination-sum-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 378, "Title": "Kth Smallest Element in a Sorted Matrix", "TitleCn": "\u6709\u5e8f\u77e9\u9635\u4e2d\u7b2cK\u5c0f\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/kth-smallest-element-in-a-sorted-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 11, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 379, "Title": "Design Phone Directory", "TitleCn": "\u7535\u8bdd\u76ee\u5f55\u7ba1\u7406\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-phone-directory/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 380, "Title": "Insert Delete GetRandom O(1)", "TitleCn": "\u5e38\u6570\u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20", "Url": "https://leetcode.cn/problems/insert-delete-getrandom-o1/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 381, "Title": "Insert Delete GetRandom O(1) - Duplicates allowed", "TitleCn": "O(1) \u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20 - \u5141\u8bb8\u91cd\u590d", "Url": "https://leetcode.cn/problems/insert-delete-getrandom-o1-duplicates-allowed/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 382, "Title": "Linked List Random Node", "TitleCn": "\u94fe\u8868\u968f\u673a\u8282\u70b9", "Url": "https://leetcode.cn/problems/linked-list-random-node/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 383, "Title": "Ransom Note", "TitleCn": "\u8d4e\u91d1\u4fe1", "Url": "https://leetcode.cn/problems/ransom-note/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 384, "Title": "Shuffle an Array", "TitleCn": "\u6253\u4e71\u6570\u7ec4", "Url": "https://leetcode.cn/problems/shuffle-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 385, "Title": "Mini Parser", "TitleCn": "\u8ff7\u4f60\u8bed\u6cd5\u5206\u6790\u5668", "Url": "https://leetcode.cn/problems/mini-parser/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 386, "Title": "Lexicographical Numbers", "TitleCn": "\u5b57\u5178\u5e8f\u6392\u6570", "Url": "https://leetcode.cn/problems/lexicographical-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Warm Up Contest 1 Problem 1"}, {"ID": 387, "Title": "First Unique Character in a String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c\u4e00\u4e2a\u552f\u4e00\u5b57\u7b26", "Url": "https://leetcode.cn/problems/first-unique-character-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Warm Up Contest 1 Problem 2"}, {"ID": 388, "Title": "Longest Absolute File Path", "TitleCn": "\u6587\u4ef6\u7684\u6700\u957f\u7edd\u5bf9\u8def\u5f84", "Url": "https://leetcode.cn/problems/longest-absolute-file-path/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Warm Up Contest 1 Problem 3"}, {"ID": 389, "Title": "Find the Difference", "TitleCn": "\u627e\u4e0d\u540c", "Url": "https://leetcode.cn/problems/find-the-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 2 Problem 1"}, {"ID": 390, "Title": "Elimination Game", "TitleCn": "\u6d88\u9664\u6e38\u620f", "Url": "https://leetcode.cn/problems/elimination-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 2 Problem 2"}, {"ID": 391, "Title": "Perfect Rectangle", "TitleCn": "\u5b8c\u7f8e\u77e9\u5f62", "Url": "https://leetcode.cn/problems/perfect-rectangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 2 Problem 3"}, {"ID": 392, "Title": "Is Subsequence", "TitleCn": "\u5224\u65ad\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/is-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 3 Problem 1"}, {"ID": 393, "Title": "UTF-8 Validation", "TitleCn": "UTF-8 \u7f16\u7801\u9a8c\u8bc1", "Url": "https://leetcode.cn/problems/utf-8-validation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 3 Problem 2"}, {"ID": 394, "Title": "Decode String", "TitleCn": "\u5b57\u7b26\u4e32\u89e3\u7801", "Url": "https://leetcode.cn/problems/decode-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 3 Problem 3"}, {"ID": 395, "Title": "Longest Substring with At Least K Repeating Characters", "TitleCn": "\u81f3\u5c11\u6709K\u4e2a\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32", "Url": "https://leetcode.cn/problems/longest-substring-with-at-least-k-repeating-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 3 Problem 4"}, {"ID": 396, "Title": "Rotate Function", "TitleCn": "\u65cb\u8f6c\u51fd\u6570", "Url": "https://leetcode.cn/problems/rotate-function/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 4 Problem 1"}, {"ID": 397, "Title": "Integer Replacement", "TitleCn": "\u6574\u6570\u66ff\u6362", "Url": "https://leetcode.cn/problems/integer-replacement/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 4 Problem 2"}, {"ID": 398, "Title": "Random Pick Index", "TitleCn": "\u968f\u673a\u6570\u7d22\u5f15", "Url": "https://leetcode.cn/problems/random-pick-index/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 4 Problem 3"}, {"ID": 399, "Title": "Evaluate Division", "TitleCn": "\u9664\u6cd5\u6c42\u503c", "Url": "https://leetcode.cn/problems/evaluate-division/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 4 Problem 4"}, {"ID": 400, "Title": "Nth Digit", "TitleCn": "\u7b2c N \u4f4d\u6570\u5b57", "Url": "https://leetcode.cn/problems/nth-digit/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 5 Problem 1"}, {"ID": 401, "Title": "Binary Watch", "TitleCn": "\u4e8c\u8fdb\u5236\u624b\u8868", "Url": "https://leetcode.cn/problems/binary-watch/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 5 Problem 2"}, {"ID": 402, "Title": "Remove K Digits", "TitleCn": "\u79fb\u6389K\u4f4d\u6570\u5b57", "Url": "https://leetcode.cn/problems/remove-k-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 5 Problem 3"}, {"ID": 403, "Title": "Frog Jump", "TitleCn": "\u9752\u86d9\u8fc7\u6cb3", "Url": "https://leetcode.cn/problems/frog-jump/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 5 Problem 4"}, {"ID": 404, "Title": "Sum of Left Leaves", "TitleCn": "\u5de6\u53f6\u5b50\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-left-leaves/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 6 Problem 1"}, {"ID": 405, "Title": "Convert a Number to Hexadecimal", "TitleCn": "\u6570\u5b57\u8f6c\u6362\u4e3a\u5341\u516d\u8fdb\u5236\u6570", "Url": "https://leetcode.cn/problems/convert-a-number-to-hexadecimal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 6 Problem 2"}, {"ID": 406, "Title": "Queue Reconstruction by Height", "TitleCn": "\u6839\u636e\u8eab\u9ad8\u91cd\u5efa\u961f\u5217", "Url": "https://leetcode.cn/problems/queue-reconstruction-by-height/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 6 Problem 3"}, {"ID": 407, "Title": "Trapping Rain Water II", "TitleCn": "\u63a5\u96e8\u6c34 II", "Url": "https://leetcode.cn/problems/trapping-rain-water-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 6 Problem 4"}, {"ID": 408, "Title": "Valid Word Abbreviation", "TitleCn": "\u6709\u6548\u5355\u8bcd\u7f29\u5199", "Url": "https://leetcode.cn/problems/valid-word-abbreviation/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 7 Problem 1"}, {"ID": 409, "Title": "Longest Palindrome", "TitleCn": "\u6700\u957f\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/longest-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 7 Problem 2"}, {"ID": 410, "Title": "Split Array Largest Sum", "TitleCn": "\u5206\u5272\u6570\u7ec4\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/split-array-largest-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 7 Problem 3"}, {"ID": 411, "Title": "Minimum Unique Word Abbreviation", "TitleCn": "\u6700\u77ed\u72ec\u5360\u5355\u8bcd\u7f29\u5199", "Url": "https://leetcode.cn/problems/minimum-unique-word-abbreviation/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 7 Problem 4"}, {"ID": 412, "Title": "Fizz Buzz", "TitleCn": "Fizz Buzz", "Url": "https://leetcode.cn/problems/fizz-buzz/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 413, "Title": "Arithmetic Slices", "TitleCn": "\u7b49\u5dee\u6570\u5217\u5212\u5206", "Url": "https://leetcode.cn/problems/arithmetic-slices/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 414, "Title": "Third Maximum Number", "TitleCn": "\u7b2c\u4e09\u5927\u7684\u6570", "Url": "https://leetcode.cn/problems/third-maximum-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 415, "Title": "Add Strings", "TitleCn": "\u5b57\u7b26\u4e32\u76f8\u52a0", "Url": "https://leetcode.cn/problems/add-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 8 Problem 1"}, {"ID": 416, "Title": "Partition Equal Subset Sum", "TitleCn": "\u5206\u5272\u7b49\u548c\u5b50\u96c6", "Url": "https://leetcode.cn/problems/partition-equal-subset-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 8 Problem 2"}, {"ID": 417, "Title": "Pacific Atlantic Water Flow", "TitleCn": "\u592a\u5e73\u6d0b\u5927\u897f\u6d0b\u6c34\u6d41\u95ee\u9898", "Url": "https://leetcode.cn/problems/pacific-atlantic-water-flow/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 8 Problem 3"}, {"ID": 418, "Title": "Sentence Screen Fitting", "TitleCn": "\u5c4f\u5e55\u53ef\u663e\u793a\u53e5\u5b50\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/sentence-screen-fitting/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 8 Problem 4"}, {"ID": 419, "Title": "Battleships in a Board", "TitleCn": "\u7532\u677f\u4e0a\u7684\u6218\u8230", "Url": "https://leetcode.cn/problems/battleships-in-a-board/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 420, "Title": "Strong Password Checker", "TitleCn": "\u5f3a\u5bc6\u7801\u68c0\u9a8c\u5668", "Url": "https://leetcode.cn/problems/strong-password-checker/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 421, "Title": "Maximum XOR of Two Numbers in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u4e24\u4e2a\u6570\u7684\u6700\u5927\u5f02\u6216\u503c", "Url": "https://leetcode.cn/problems/maximum-xor-of-two-numbers-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 422, "Title": "Valid Word Square", "TitleCn": "\u6709\u6548\u7684\u5355\u8bcd\u65b9\u5757", "Url": "https://leetcode.cn/problems/valid-word-square/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 9 Problem 1"}, {"ID": 423, "Title": "Reconstruct Original Digits from English", "TitleCn": "\u4ece\u82f1\u6587\u4e2d\u91cd\u5efa\u6570\u5b57", "Url": "https://leetcode.cn/problems/reconstruct-original-digits-from-english/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 9 Problem 2"}, {"ID": 424, "Title": "Longest Repeating Character Replacement", "TitleCn": "\u66ff\u6362\u540e\u7684\u6700\u957f\u91cd\u590d\u5b57\u7b26", "Url": "https://leetcode.cn/problems/longest-repeating-character-replacement/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 9 Problem 3"}, {"ID": 425, "Title": "Word Squares", "TitleCn": "\u5355\u8bcd\u65b9\u5757", "Url": "https://leetcode.cn/problems/word-squares/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 9 Problem 4"}, {"ID": 426, "Title": "Convert Binary Search Tree to Sorted Doubly Linked List", "TitleCn": "\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u5316\u4e3a\u6392\u5e8f\u7684\u53cc\u5411\u94fe\u8868", "Url": "https://leetcode.cn/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 427, "Title": "Construct Quad Tree", "TitleCn": "\u5efa\u7acb\u56db\u53c9\u6811", "Url": "https://leetcode.cn/problems/construct-quad-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 428, "Title": "Serialize and Deserialize N-ary Tree", "TitleCn": "\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316 N \u53c9\u6811", "Url": "https://leetcode.cn/problems/serialize-and-deserialize-n-ary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 429, "Title": "N-ary Tree Level Order Traversal", "TitleCn": "N\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/n-ary-tree-level-order-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 430, "Title": "Flatten a Multilevel Doubly Linked List", "TitleCn": "\u6241\u5e73\u5316\u591a\u7ea7\u53cc\u5411\u94fe\u8868", "Url": "https://leetcode.cn/problems/flatten-a-multilevel-doubly-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 431, "Title": "Encode N-ary Tree to Binary Tree", "TitleCn": "\u5c06 N \u53c9\u6811\u7f16\u7801\u4e3a\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/encode-n-ary-tree-to-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 432, "Title": "All O`one Data Structure", "TitleCn": "\u5168 O(1) \u7684\u6570\u636e\u7ed3\u6784", "Url": "https://leetcode.cn/problems/all-oone-data-structure/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 433, "Title": "Minimum Genetic Mutation", "TitleCn": "\u6700\u5c0f\u57fa\u56e0\u53d8\u5316", "Url": "https://leetcode.cn/problems/minimum-genetic-mutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 434, "Title": "Number of Segments in a String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd\u6570", "Url": "https://leetcode.cn/problems/number-of-segments-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 11 Problem 1"}, {"ID": 435, "Title": "Non-overlapping Intervals", "TitleCn": "\u65e0\u91cd\u53e0\u533a\u95f4", "Url": "https://leetcode.cn/problems/non-overlapping-intervals/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 2 Problem 1"}, {"ID": 436, "Title": "Find Right Interval", "TitleCn": "\u5bfb\u627e\u53f3\u533a\u95f4", "Url": "https://leetcode.cn/problems/find-right-interval/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 2 Problem 2"}, {"ID": 437, "Title": "Path Sum III", "TitleCn": "\u8def\u5f84\u603b\u548c III", "Url": "https://leetcode.cn/problems/path-sum-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest Problem 1"}, {"ID": 438, "Title": "Find All Anagrams in a String", "TitleCn": "\u627e\u5230\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u5b57\u6bcd\u5f02\u4f4d\u8bcd", "Url": "https://leetcode.cn/problems/find-all-anagrams-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest Problem 2"}, {"ID": 439, "Title": "Ternary Expression Parser", "TitleCn": "\u4e09\u5143\u8868\u8fbe\u5f0f\u89e3\u6790\u5668", "Url": "https://leetcode.cn/problems/ternary-expression-parser/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest Problem 3"}, {"ID": 440, "Title": "K-th Smallest in Lexicographical Order", "TitleCn": "\u5b57\u5178\u5e8f\u7684\u7b2cK\u5c0f\u6570\u5b57", "Url": "https://leetcode.cn/problems/k-th-smallest-in-lexicographical-order/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Smarking Algorithm Contest Problem 4"}, {"ID": 441, "Title": "Arranging Coins", "TitleCn": "\u6392\u5217\u786c\u5e01", "Url": "https://leetcode.cn/problems/arranging-coins/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Smarking Algorithm Contest 2 Problem 3"}, {"ID": 442, "Title": "Find All Duplicates in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u91cd\u590d\u7684\u6570\u636e", "Url": "https://leetcode.cn/problems/find-all-duplicates-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 443, "Title": "String Compression", "TitleCn": "\u538b\u7f29\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/string-compression/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 56 Problem 2"}, {"ID": 444, "Title": "Sequence Reconstruction", "TitleCn": "\u5e8f\u5217\u91cd\u5efa", "Url": "https://leetcode.cn/problems/sequence-reconstruction/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 2 Problem 4"}, {"ID": 445, "Title": "Add Two Numbers II", "TitleCn": "\u4e24\u6570\u76f8\u52a0 II", "Url": "https://leetcode.cn/problems/add-two-numbers-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 446, "Title": "Arithmetic Slices II - Subsequence", "TitleCn": "\u7b49\u5dee\u6570\u5217\u5212\u5206 II - \u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/arithmetic-slices-ii-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Smarking Algorithm Contest 3 Problem 4"}, {"ID": 447, "Title": "Number of Boomerangs", "TitleCn": "\u56de\u65cb\u9556\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-boomerangs/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 3 Problem 2"}, {"ID": 448, "Title": "Find All Numbers Disappeared in an Array", "TitleCn": "\u627e\u5230\u6240\u6709\u6570\u7ec4\u4e2d\u6d88\u5931\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-all-numbers-disappeared-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 449, "Title": "Serialize and Deserialize BST", "TitleCn": "\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/serialize-and-deserialize-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 450, "Title": "Delete Node in a BST", "TitleCn": "\u5220\u9664\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/delete-node-in-a-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 451, "Title": "Sort Characters By Frequency", "TitleCn": "\u6839\u636e\u5b57\u7b26\u51fa\u73b0\u9891\u7387\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-characters-by-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 452, "Title": "Minimum Number of Arrows to Burst Balloons", "TitleCn": "\u7528\u6700\u5c11\u6570\u91cf\u7684\u7bad\u5f15\u7206\u6c14\u7403", "Url": "https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 3 Problem 3"}, {"ID": 453, "Title": "Minimum Moves to Equal Array Elements", "TitleCn": "\u6700\u5c0f\u79fb\u52a8\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49", "Url": "https://leetcode.cn/problems/minimum-moves-to-equal-array-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 3 Problem 1"}, {"ID": 454, "Title": "4Sum II", "TitleCn": "\u56db\u6570\u76f8\u52a0 II", "Url": "https://leetcode.cn/problems/4sum-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 4 Problem 3"}, {"ID": 455, "Title": "Assign Cookies", "TitleCn": "\u5206\u53d1\u997c\u5e72", "Url": "https://leetcode.cn/problems/assign-cookies/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Smarking Algorithm Contest 4 Problem 1"}, {"ID": 456, "Title": "132 Pattern", "TitleCn": "132\u6a21\u5f0f", "Url": "https://leetcode.cn/problems/132-pattern/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 4 Problem 4"}, {"ID": 457, "Title": "Circular Array Loop", "TitleCn": "\u73af\u5f62\u6570\u7ec4\u662f\u5426\u5b58\u5728\u5faa\u73af", "Url": "https://leetcode.cn/problems/circular-array-loop/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 458, "Title": "Poor Pigs", "TitleCn": "\u53ef\u601c\u7684\u5c0f\u732a", "Url": "https://leetcode.cn/problems/poor-pigs/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 459, "Title": "Repeated Substring Pattern", "TitleCn": "\u91cd\u590d\u7684\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/repeated-substring-pattern/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Smarking Algorithm Contest 4 Problem 2"}, {"ID": 460, "Title": "LFU Cache", "TitleCn": "LFU \u7f13\u5b58", "Url": "https://leetcode.cn/problems/lfu-cache/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 461, "Title": "Hamming Distance", "TitleCn": "\u6c49\u660e\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/hamming-distance/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 13 Problem 1"}, {"ID": 462, "Title": "Minimum Moves to Equal Array Elements II", "TitleCn": "\u6700\u5c0f\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49 II", "Url": "https://leetcode.cn/problems/minimum-moves-to-equal-array-elements-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 10 Problem 3"}, {"ID": 463, "Title": "Island Perimeter", "TitleCn": "\u5c9b\u5c7f\u7684\u5468\u957f", "Url": "https://leetcode.cn/problems/island-perimeter/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 10 Problem 1"}, {"ID": 464, "Title": "Can I Win", "TitleCn": "\u6211\u80fd\u8d62\u5417", "Url": "https://leetcode.cn/problems/can-i-win/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 10 Problem 2"}, {"ID": 465, "Title": "Optimal Account Balancing", "TitleCn": "\u6700\u4f18\u8d26\u5355\u5e73\u8861", "Url": "https://leetcode.cn/problems/optimal-account-balancing/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 10 Problem 4"}, {"ID": 466, "Title": "Count The Repetitions", "TitleCn": "\u7edf\u8ba1\u91cd\u590d\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-the-repetitions/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 11 Problem 4"}, {"ID": 467, "Title": "Unique Substrings in Wraparound String", "TitleCn": "\u73af\u7ed5\u5b57\u7b26\u4e32\u4e2d\u552f\u4e00\u7684\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/unique-substrings-in-wraparound-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 11 Problem 3"}, {"ID": 468, "Title": "Validate IP Address", "TitleCn": "\u9a8c\u8bc1IP\u5730\u5740", "Url": "https://leetcode.cn/problems/validate-ip-address/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 12 Problem 2"}, {"ID": 469, "Title": "Convex Polygon", "TitleCn": "\u51f8\u591a\u8fb9\u5f62", "Url": "https://leetcode.cn/problems/convex-polygon/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 11 Problem 2"}, {"ID": 470, "Title": "Implement Rand10() Using Rand7()", "TitleCn": "\u7528 Rand7() \u5b9e\u73b0 Rand10()", "Url": "https://leetcode.cn/problems/implement-rand10-using-rand7/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 471, "Title": "Encode String with Shortest Length", "TitleCn": "\u7f16\u7801\u6700\u77ed\u957f\u5ea6\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/encode-string-with-shortest-length/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 12 Problem 4"}, {"ID": 472, "Title": "Concatenated Words", "TitleCn": "\u8fde\u63a5\u8bcd", "Url": "https://leetcode.cn/problems/concatenated-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 13 Problem 4"}, {"ID": 473, "Title": "Matchsticks to Square", "TitleCn": "\u706b\u67f4\u62fc\u6b63\u65b9\u5f62", "Url": "https://leetcode.cn/problems/matchsticks-to-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 13 Problem 3"}, {"ID": 474, "Title": "Ones and Zeroes", "TitleCn": "\u4e00\u548c\u96f6", "Url": "https://leetcode.cn/problems/ones-and-zeroes/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 12 Problem 3"}, {"ID": 475, "Title": "Heaters", "TitleCn": "\u4f9b\u6696\u5668", "Url": "https://leetcode.cn/problems/heaters/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 12 Problem 1"}, {"ID": 476, "Title": "Number Complement", "TitleCn": "\u6570\u5b57\u7684\u8865\u6570", "Url": "https://leetcode.cn/problems/number-complement/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 14 Problem 1"}, {"ID": 477, "Title": "Total Hamming Distance", "TitleCn": "\u6c49\u660e\u8ddd\u79bb\u603b\u548c", "Url": "https://leetcode.cn/problems/total-hamming-distance/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 13 Problem 2"}, {"ID": 478, "Title": "Generate Random Point in a Circle", "TitleCn": "\u5728\u5706\u5185\u968f\u673a\u751f\u6210\u70b9", "Url": "https://leetcode.cn/problems/generate-random-point-in-a-circle/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 479, "Title": "Largest Palindrome Product", "TitleCn": "\u6700\u5927\u56de\u6587\u6570\u4e58\u79ef", "Url": "https://leetcode.cn/problems/largest-palindrome-product/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 480, "Title": "Sliding Window Median", "TitleCn": "\u6ed1\u52a8\u7a97\u53e3\u4e2d\u4f4d\u6570", "Url": "https://leetcode.cn/problems/sliding-window-median/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 14 Problem 4"}, {"ID": 481, "Title": "Magical String", "TitleCn": "\u795e\u5947\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/magical-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 14 Problem 2"}, {"ID": 482, "Title": "License Key Formatting", "TitleCn": "\u5bc6\u94a5\u683c\u5f0f\u5316", "Url": "https://leetcode.cn/problems/license-key-formatting/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 14 Problem 3"}, {"ID": 483, "Title": "Smallest Good Base", "TitleCn": "\u6700\u5c0f\u597d\u8fdb\u5236", "Url": "https://leetcode.cn/problems/smallest-good-base/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 16B Problem 3"}, {"ID": 484, "Title": "Find Permutation", "TitleCn": "\u5bfb\u627e\u6392\u5217", "Url": "https://leetcode.cn/problems/find-permutation/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 16A Problem 1"}, {"ID": 485, "Title": "Max Consecutive Ones", "TitleCn": "\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/max-consecutive-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 15 Problem 1"}, {"ID": 486, "Title": "Predict the Winner", "TitleCn": "\u9884\u6d4b\u8d62\u5bb6", "Url": "https://leetcode.cn/problems/predict-the-winner/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 16B Problem 2"}, {"ID": 487, "Title": "Max Consecutive Ones II", "TitleCn": "\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 II", "Url": "https://leetcode.cn/problems/max-consecutive-ones-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 15 Problem 2"}, {"ID": 488, "Title": "Zuma Game", "TitleCn": "\u7956\u739b\u6e38\u620f", "Url": "https://leetcode.cn/problems/zuma-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 15 Problem 3"}, {"ID": 489, "Title": "Robot Room Cleaner", "TitleCn": "\u626b\u5730\u673a\u5668\u4eba", "Url": "https://leetcode.cn/problems/robot-room-cleaner/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 490, "Title": "The Maze", "TitleCn": "\u8ff7\u5bab", "Url": "https://leetcode.cn/problems/the-maze/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 491, "Title": "Non-decreasing Subsequences", "TitleCn": "\u975e\u9012\u51cf\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/non-decreasing-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 16A Problem 3"}, {"ID": 492, "Title": "Construct the Rectangle", "TitleCn": "\u6784\u9020\u77e9\u5f62", "Url": "https://leetcode.cn/problems/construct-the-rectangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 16B Problem 1"}, {"ID": 493, "Title": "Reverse Pairs", "TitleCn": "\u7ffb\u8f6c\u5bf9", "Url": "https://leetcode.cn/problems/reverse-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 19 Problem 4"}, {"ID": 494, "Title": "Target Sum", "TitleCn": "\u76ee\u6807\u548c", "Url": "https://leetcode.cn/problems/target-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 16A Problem 2"}, {"ID": 495, "Title": "Teemo Attacking", "TitleCn": "\u63d0\u83ab\u653b\u51fb", "Url": "https://leetcode.cn/problems/teemo-attacking/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 17 Problem 2"}, {"ID": 496, "Title": "Next Greater Element I", "TitleCn": "\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 I", "Url": "https://leetcode.cn/problems/next-greater-element-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 18B Problem 1"}, {"ID": 497, "Title": "Random Point in Non-overlapping Rectangles", "TitleCn": "\u975e\u91cd\u53e0\u77e9\u5f62\u4e2d\u7684\u968f\u673a\u70b9", "Url": "https://leetcode.cn/problems/random-point-in-non-overlapping-rectangles/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 498, "Title": "Diagonal Traverse", "TitleCn": "\u5bf9\u89d2\u7ebf\u904d\u5386", "Url": "https://leetcode.cn/problems/diagonal-traverse/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 18B Problem 4"}, {"ID": 499, "Title": "The Maze III", "TitleCn": "\u8ff7\u5bab III", "Url": "https://leetcode.cn/problems/the-maze-iii/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 17 Problem 3"}, {"ID": 500, "Title": "Keyboard Row", "TitleCn": "\u952e\u76d8\u884c", "Url": "https://leetcode.cn/problems/keyboard-row/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 18A Problem 1"}, {"ID": 501, "Title": "Find Mode in Binary Search Tree", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4f17\u6570", "Url": "https://leetcode.cn/problems/find-mode-in-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 8, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 17 Problem 1"}, {"ID": 502, "Title": "IPO", "TitleCn": "IPO", "Url": "https://leetcode.cn/problems/ipo/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 18A Problem 3"}, {"ID": 503, "Title": "Next Greater Element II", "TitleCn": "\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 II", "Url": "https://leetcode.cn/problems/next-greater-element-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 18B Problem 3"}, {"ID": 504, "Title": "Base 7", "TitleCn": "\u4e03\u8fdb\u5236\u6570", "Url": "https://leetcode.cn/problems/base-7/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 19 Problem 1"}, {"ID": 505, "Title": "The Maze II", "TitleCn": "\u8ff7\u5bab II", "Url": "https://leetcode.cn/problems/the-maze-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 506, "Title": "Relative Ranks", "TitleCn": "\u76f8\u5bf9\u540d\u6b21", "Url": "https://leetcode.cn/problems/relative-ranks/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 18B Problem 2"}, {"ID": 507, "Title": "Perfect Number", "TitleCn": "\u5b8c\u7f8e\u6570", "Url": "https://leetcode.cn/problems/perfect-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 25 Problem 1"}, {"ID": 508, "Title": "Most Frequent Subtree Sum", "TitleCn": "\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5b50\u6811\u5143\u7d20\u548c", "Url": "https://leetcode.cn/problems/most-frequent-subtree-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 18A Problem 2"}, {"ID": 509, "Title": "Fibonacci Number", "TitleCn": "\u6590\u6ce2\u90a3\u5951\u6570", "Url": "https://leetcode.cn/problems/fibonacci-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 510, "Title": "Inorder Successor in BST II", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7 II", "Url": "https://leetcode.cn/problems/inorder-successor-in-bst-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 511, "Title": "Game Play Analysis I", "TitleCn": "\u6e38\u620f\u73a9\u6cd5\u5206\u6790 I", "Url": "https://leetcode.cn/problems/game-play-analysis-i/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 512, "Title": "Game Play Analysis II", "TitleCn": "\u6e38\u620f\u73a9\u6cd5\u5206\u6790 II", "Url": "https://leetcode.cn/problems/game-play-analysis-ii/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 513, "Title": "Find Bottom Left Tree Value", "TitleCn": "\u627e\u6811\u5de6\u4e0b\u89d2\u7684\u503c", "Url": "https://leetcode.cn/problems/find-bottom-left-tree-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 19 Problem 2"}, {"ID": 514, "Title": "Freedom Trail", "TitleCn": "\u81ea\u7531\u4e4b\u8def", "Url": "https://leetcode.cn/problems/freedom-trail/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 22 Problem 4"}, {"ID": 515, "Title": "Find Largest Value in Each Tree Row", "TitleCn": "\u5728\u6bcf\u4e2a\u6811\u884c\u4e2d\u627e\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/find-largest-value-in-each-tree-row/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 19 Problem 3"}, {"ID": 516, "Title": "Longest Palindromic Subsequence", "TitleCn": "\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-palindromic-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 517, "Title": "Super Washing Machines", "TitleCn": "\u8d85\u7ea7\u6d17\u8863\u673a", "Url": "https://leetcode.cn/problems/super-washing-machines/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 20 Problem 4"}, {"ID": 518, "Title": "Coin Change II", "TitleCn": "\u96f6\u94b1\u5151\u6362 II", "Url": "https://leetcode.cn/problems/coin-change-2/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 519, "Title": "Random Flip Matrix", "TitleCn": "\u968f\u673a\u7ffb\u8f6c\u77e9\u9635", "Url": "https://leetcode.cn/problems/random-flip-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 520, "Title": "Detect Capital", "TitleCn": "\u68c0\u6d4b\u5927\u5199\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/detect-capital/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 20 Problem 1"}, {"ID": 521, "Title": "Longest Uncommon Subsequence I", "TitleCn": "\u6700\u957f\u7279\u6b8a\u5e8f\u5217 \u2160", "Url": "https://leetcode.cn/problems/longest-uncommon-subsequence-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 26 Problem 1"}, {"ID": 522, "Title": "Longest Uncommon Subsequence II", "TitleCn": "\u6700\u957f\u7279\u6b8a\u5e8f\u5217 II", "Url": "https://leetcode.cn/problems/longest-uncommon-subsequence-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 26 Problem 2"}, {"ID": 523, "Title": "Continuous Subarray Sum", "TitleCn": "\u8fde\u7eed\u7684\u5b50\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/continuous-subarray-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 21 Problem 2"}, {"ID": 524, "Title": "Longest Word in Dictionary through Deleting", "TitleCn": "\u901a\u8fc7\u5220\u9664\u5b57\u6bcd\u5339\u914d\u5230\u5b57\u5178\u91cc\u6700\u957f\u5355\u8bcd", "Url": "https://leetcode.cn/problems/longest-word-in-dictionary-through-deleting/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 21 Problem 3"}, {"ID": 525, "Title": "Contiguous Array", "TitleCn": "\u8fde\u7eed\u6570\u7ec4", "Url": "https://leetcode.cn/problems/contiguous-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 20 Problem 3"}, {"ID": 526, "Title": "Beautiful Arrangement", "TitleCn": "\u4f18\u7f8e\u7684\u6392\u5217", "Url": "https://leetcode.cn/problems/beautiful-arrangement/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 20 Problem 2"}, {"ID": 527, "Title": "Word Abbreviation", "TitleCn": "\u5355\u8bcd\u7f29\u5199", "Url": "https://leetcode.cn/problems/word-abbreviation/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 23 Problem 4"}, {"ID": 528, "Title": "Random Pick with Weight", "TitleCn": "\u6309\u6743\u91cd\u968f\u673a\u9009\u62e9", "Url": "https://leetcode.cn/problems/random-pick-with-weight/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 529, "Title": "Minesweeper", "TitleCn": "\u626b\u96f7\u6e38\u620f", "Url": "https://leetcode.cn/problems/minesweeper/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 21 Problem 4"}, {"ID": 530, "Title": "Minimum Absolute Difference in BST", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u5c0f\u7edd\u5bf9\u5dee", "Url": "https://leetcode.cn/problems/minimum-absolute-difference-in-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 21 Problem 1"}, {"ID": 531, "Title": "Lonely Pixel I", "TitleCn": "\u5b64\u72ec\u50cf\u7d20 I", "Url": "https://leetcode.cn/problems/lonely-pixel-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 22 Problem 2"}, {"ID": 532, "Title": "K-diff Pairs in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684 k-diff \u6570\u5bf9", "Url": "https://leetcode.cn/problems/k-diff-pairs-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 22 Problem 1"}, {"ID": 533, "Title": "Lonely Pixel II", "TitleCn": "\u5b64\u72ec\u50cf\u7d20 II", "Url": "https://leetcode.cn/problems/lonely-pixel-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 22 Problem 3"}, {"ID": 534, "Title": "Game Play Analysis III", "TitleCn": "\u6e38\u620f\u73a9\u6cd5\u5206\u6790 III", "Url": "https://leetcode.cn/problems/game-play-analysis-iii/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 535, "Title": "Encode and Decode TinyURL", "TitleCn": "TinyURL \u7684\u52a0\u5bc6\u4e0e\u89e3\u5bc6", "Url": "https://leetcode.cn/problems/encode-and-decode-tinyurl/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 536, "Title": "Construct Binary Tree from String", "TitleCn": "\u4ece\u5b57\u7b26\u4e32\u751f\u6210\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/construct-binary-tree-from-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 23 Problem 3"}, {"ID": 537, "Title": "Complex Number Multiplication", "TitleCn": "\u590d\u6570\u4e58\u6cd5", "Url": "https://leetcode.cn/problems/complex-number-multiplication/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 25 Problem 2"}, {"ID": 538, "Title": "Convert BST to Greater Tree", "TitleCn": "\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811", "Url": "https://leetcode.cn/problems/convert-bst-to-greater-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 24 Problem 2"}, {"ID": 539, "Title": "Minimum Time Difference", "TitleCn": "\u6700\u5c0f\u65f6\u95f4\u5dee", "Url": "https://leetcode.cn/problems/minimum-time-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 23 Problem 2"}, {"ID": 540, "Title": "Single Element in a Sorted Array", "TitleCn": "\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u5355\u4e00\u5143\u7d20", "Url": "https://leetcode.cn/problems/single-element-in-a-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 541, "Title": "Reverse String II", "TitleCn": "\u53cd\u8f6c\u5b57\u7b26\u4e32 II", "Url": "https://leetcode.cn/problems/reverse-string-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 23 Problem 1"}, {"ID": 542, "Title": "01 Matrix", "TitleCn": "01 \u77e9\u9635", "Url": "https://leetcode.cn/problems/01-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 24 Problem 3"}, {"ID": 543, "Title": "Diameter of Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u76f4\u5f84", "Url": "https://leetcode.cn/problems/diameter-of-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 24 Problem 1"}, {"ID": 544, "Title": "Output Contest Matches", "TitleCn": "\u8f93\u51fa\u6bd4\u8d5b\u5339\u914d\u5bf9", "Url": "https://leetcode.cn/problems/output-contest-matches/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 24 Problem 4"}, {"ID": 545, "Title": "Boundary of Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u8fb9\u754c", "Url": "https://leetcode.cn/problems/boundary-of-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 25 Problem 3"}, {"ID": 546, "Title": "Remove Boxes", "TitleCn": "\u79fb\u9664\u76d2\u5b50", "Url": "https://leetcode.cn/problems/remove-boxes/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 25 Problem 4"}, {"ID": 547, "Title": "Number of Provinces", "TitleCn": "\u7701\u4efd\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-provinces/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 26 Problem 3"}, {"ID": 548, "Title": "Split Array with Equal Sum", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u5272\u6210\u548c\u76f8\u7b49\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/split-array-with-equal-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 26 Problem 4"}, {"ID": 549, "Title": "Binary Tree Longest Consecutive Sequence II", "TitleCn": "\u4e8c\u53c9\u6811\u6700\u957f\u8fde\u7eed\u5e8f\u5217 II", "Url": "https://leetcode.cn/problems/binary-tree-longest-consecutive-sequence-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 27 Problem 4"}, {"ID": 550, "Title": "Game Play Analysis IV", "TitleCn": "\u6e38\u620f\u73a9\u6cd5\u5206\u6790 IV", "Url": "https://leetcode.cn/problems/game-play-analysis-iv/", "Ispaid": 0, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 551, "Title": "Student Attendance Record I", "TitleCn": "\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 I", "Url": "https://leetcode.cn/problems/student-attendance-record-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 28 Problem 1"}, {"ID": 552, "Title": "Student Attendance Record II", "TitleCn": "\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 II", "Url": "https://leetcode.cn/problems/student-attendance-record-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 28 Problem 4"}, {"ID": 553, "Title": "Optimal Division", "TitleCn": "\u6700\u4f18\u9664\u6cd5", "Url": "https://leetcode.cn/problems/optimal-division/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 28 Problem 2"}, {"ID": 554, "Title": "Brick Wall", "TitleCn": "\u7816\u5899", "Url": "https://leetcode.cn/problems/brick-wall/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 27 Problem 2"}, {"ID": 555, "Title": "Split Concatenated Strings", "TitleCn": "\u5206\u5272\u8fde\u63a5\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/split-concatenated-strings/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 28 Problem 3"}, {"ID": 556, "Title": "Next Greater Element III", "TitleCn": "\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 III", "Url": "https://leetcode.cn/problems/next-greater-element-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 27 Problem 3"}, {"ID": 557, "Title": "Reverse Words in a String III", "TitleCn": "\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd III", "Url": "https://leetcode.cn/problems/reverse-words-in-a-string-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 27 Problem 1"}, {"ID": 558, "Title": "Logical OR of Two Binary Grids Represented as Quad-Trees", "TitleCn": "\u56db\u53c9\u6811\u4ea4\u96c6", "Url": "https://leetcode.cn/problems/logical-or-of-two-binary-grids-represented-as-quad-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 559, "Title": "Maximum Depth of N-ary Tree", "TitleCn": "N\u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6", "Url": "https://leetcode.cn/problems/maximum-depth-of-n-ary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 560, "Title": "Subarray Sum Equals K", "TitleCn": "\u548c\u4e3aK\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/subarray-sum-equals-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 30 Problem 2"}, {"ID": 561, "Title": "Array Partition", "TitleCn": "\u6570\u7ec4\u62c6\u5206", "Url": "https://leetcode.cn/problems/array-partition/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 29 Problem 2"}, {"ID": 562, "Title": "Longest Line of Consecutive One in Matrix", "TitleCn": "\u77e9\u9635\u4e2d\u6700\u957f\u7684\u8fde\u7eed1\u7ebf\u6bb5", "Url": "https://leetcode.cn/problems/longest-line-of-consecutive-one-in-matrix/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 29 Problem 3"}, {"ID": 563, "Title": "Binary Tree Tilt", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5761\u5ea6", "Url": "https://leetcode.cn/problems/binary-tree-tilt/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 29 Problem 1"}, {"ID": 564, "Title": "Find the Closest Palindrome", "TitleCn": "\u5bfb\u627e\u6700\u8fd1\u7684\u56de\u6587\u6570", "Url": "https://leetcode.cn/problems/find-the-closest-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 29 Problem 4"}, {"ID": 565, "Title": "Array Nesting", "TitleCn": "\u6570\u7ec4\u5d4c\u5957", "Url": "https://leetcode.cn/problems/array-nesting/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 34 Problem 3"}, {"ID": 566, "Title": "Reshape the Matrix", "TitleCn": "\u91cd\u5851\u77e9\u9635", "Url": "https://leetcode.cn/problems/reshape-the-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 30 Problem 1"}, {"ID": 567, "Title": "Permutation in String", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u6392\u5217", "Url": "https://leetcode.cn/problems/permutation-in-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 30 Problem 3"}, {"ID": 568, "Title": "Maximum Vacation Days", "TitleCn": "\u6700\u5927\u4f11\u5047\u5929\u6570", "Url": "https://leetcode.cn/problems/maximum-vacation-days/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 30 Problem 4"}, {"ID": 569, "Title": "Median Employee Salary", "TitleCn": "\u5458\u5de5\u85aa\u6c34\u4e2d\u4f4d\u6570", "Url": "https://leetcode.cn/problems/median-employee-salary/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 570, "Title": "Managers with at Least 5 Direct Reports", "TitleCn": "\u81f3\u5c11\u67095\u540d\u76f4\u63a5\u4e0b\u5c5e\u7684\u7ecf\u7406", "Url": "https://leetcode.cn/problems/managers-with-at-least-5-direct-reports/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 571, "Title": "Find Median Given Frequency of Numbers", "TitleCn": "\u7ed9\u5b9a\u6570\u5b57\u7684\u9891\u7387\u67e5\u8be2\u4e2d\u4f4d\u6570", "Url": "https://leetcode.cn/problems/find-median-given-frequency-of-numbers/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 572, "Title": "Subtree of Another Tree", "TitleCn": "\u53e6\u4e00\u4e2a\u6811\u7684\u5b50\u6811", "Url": "https://leetcode.cn/problems/subtree-of-another-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 31 Problem 2"}, {"ID": 573, "Title": "Squirrel Simulation", "TitleCn": "\u677e\u9f20\u6a21\u62df", "Url": "https://leetcode.cn/problems/squirrel-simulation/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 31 Problem 3"}, {"ID": 574, "Title": "Winning Candidate", "TitleCn": "\u5f53\u9009\u8005", "Url": "https://leetcode.cn/problems/winning-candidate/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 575, "Title": "Distribute Candies", "TitleCn": "\u5206\u7cd6\u679c", "Url": "https://leetcode.cn/problems/distribute-candies/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 31 Problem 1"}, {"ID": 576, "Title": "Out of Boundary Paths", "TitleCn": "\u51fa\u754c\u7684\u8def\u5f84\u6570", "Url": "https://leetcode.cn/problems/out-of-boundary-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 31 Problem 4"}, {"ID": 577, "Title": "Employee Bonus", "TitleCn": "\u5458\u5de5\u5956\u91d1", "Url": "https://leetcode.cn/problems/employee-bonus/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 578, "Title": "Get Highest Answer Rate Question", "TitleCn": "\u67e5\u8be2\u56de\u7b54\u7387\u6700\u9ad8\u7684\u95ee\u9898", "Url": "https://leetcode.cn/problems/get-highest-answer-rate-question/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 579, "Title": "Find Cumulative Salary of an Employee", "TitleCn": "\u67e5\u8be2\u5458\u5de5\u7684\u7d2f\u8ba1\u85aa\u6c34", "Url": "https://leetcode.cn/problems/find-cumulative-salary-of-an-employee/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 580, "Title": "Count Student Number in Departments", "TitleCn": "\u7edf\u8ba1\u5404\u4e13\u4e1a\u5b66\u751f\u4eba\u6570", "Url": "https://leetcode.cn/problems/count-student-number-in-departments/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 581, "Title": "Shortest Unsorted Continuous Subarray", "TitleCn": "\u6700\u77ed\u65e0\u5e8f\u8fde\u7eed\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/shortest-unsorted-continuous-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 32 Problem 1"}, {"ID": 582, "Title": "Kill Process", "TitleCn": "\u6740\u6389\u8fdb\u7a0b", "Url": "https://leetcode.cn/problems/kill-process/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 32 Problem 2"}, {"ID": 583, "Title": "Delete Operation for Two Strings", "TitleCn": "\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u5220\u9664\u64cd\u4f5c", "Url": "https://leetcode.cn/problems/delete-operation-for-two-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 32 Problem 3"}, {"ID": 584, "Title": "Find Customer Referee", "TitleCn": "\u5bfb\u627e\u7528\u6237\u63a8\u8350\u4eba", "Url": "https://leetcode.cn/problems/find-customer-referee/", "Ispaid": 0, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 585, "Title": "Investments in 2016", "TitleCn": "2016\u5e74\u7684\u6295\u8d44", "Url": "https://leetcode.cn/problems/investments-in-2016/", "Ispaid": 0, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 586, "Title": "Customer Placing the Largest Number of Orders", "TitleCn": "\u8ba2\u5355\u6700\u591a\u7684\u5ba2\u6237", "Url": "https://leetcode.cn/problems/customer-placing-the-largest-number-of-orders/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 587, "Title": "Erect the Fence", "TitleCn": "\u5b89\u88c5\u6805\u680f", "Url": "https://leetcode.cn/problems/erect-the-fence/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 32 Problem 4"}, {"ID": 588, "Title": "Design In-Memory File System", "TitleCn": "\u8bbe\u8ba1\u5185\u5b58\u6587\u4ef6\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-in-memory-file-system/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 33 Problem 4"}, {"ID": 589, "Title": "N-ary Tree Preorder Traversal", "TitleCn": "N\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/n-ary-tree-preorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 590, "Title": "N-ary Tree Postorder Traversal", "TitleCn": "N\u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/n-ary-tree-postorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 591, "Title": "Tag Validator", "TitleCn": "\u6807\u7b7e\u9a8c\u8bc1\u5668", "Url": "https://leetcode.cn/problems/tag-validator/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 35 Problem 4"}, {"ID": 592, "Title": "Fraction Addition and Subtraction", "TitleCn": "\u5206\u6570\u52a0\u51cf\u8fd0\u7b97", "Url": "https://leetcode.cn/problems/fraction-addition-and-subtraction/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 33 Problem 3"}, {"ID": 593, "Title": "Valid Square", "TitleCn": "\u6709\u6548\u7684\u6b63\u65b9\u5f62", "Url": "https://leetcode.cn/problems/valid-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 33 Problem 2"}, {"ID": 594, "Title": "Longest Harmonious Subsequence", "TitleCn": "\u6700\u957f\u548c\u8c10\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-harmonious-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 33 Problem 1"}, {"ID": 595, "Title": "Big Countries", "TitleCn": "\u5927\u7684\u56fd\u5bb6", "Url": "https://leetcode.cn/problems/big-countries/", "Ispaid": 0, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 596, "Title": "Classes More Than 5 Students", "TitleCn": "\u8d85\u8fc75\u540d\u5b66\u751f\u7684\u8bfe", "Url": "https://leetcode.cn/problems/classes-more-than-5-students/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 597, "Title": "Friend Requests I: Overall Acceptance Rate", "TitleCn": "\u597d\u53cb\u7533\u8bf7 I \uff1a\u603b\u4f53\u901a\u8fc7\u7387", "Url": "https://leetcode.cn/problems/friend-requests-i-overall-acceptance-rate/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 598, "Title": "Range Addition II", "TitleCn": "\u533a\u95f4\u52a0\u6cd5 II", "Url": "https://leetcode.cn/problems/range-addition-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 34 Problem 1"}, {"ID": 599, "Title": "Minimum Index Sum of Two Lists", "TitleCn": "\u4e24\u4e2a\u5217\u8868\u7684\u6700\u5c0f\u7d22\u5f15\u603b\u548c", "Url": "https://leetcode.cn/problems/minimum-index-sum-of-two-lists/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 34 Problem 2"}, {"ID": 600, "Title": "Non-negative Integers without Consecutive Ones", "TitleCn": "\u4e0d\u542b\u8fde\u7eed1\u7684\u975e\u8d1f\u6574\u6570", "Url": "https://leetcode.cn/problems/non-negative-integers-without-consecutive-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 34 Problem 4"}, {"ID": 601, "Title": "Human Traffic of Stadium", "TitleCn": "\u4f53\u80b2\u9986\u7684\u4eba\u6d41\u91cf", "Url": "https://leetcode.cn/problems/human-traffic-of-stadium/", "Ispaid": 0, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 602, "Title": "Friend Requests II: Who Has the Most Friends", "TitleCn": "\u597d\u53cb\u7533\u8bf7 II \uff1a\u8c01\u6709\u6700\u591a\u7684\u597d\u53cb", "Url": "https://leetcode.cn/problems/friend-requests-ii-who-has-the-most-friends/", "Ispaid": 0, "Type": "Database", "Level": 6, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 603, "Title": "Consecutive Available Seats", "TitleCn": "\u8fde\u7eed\u7a7a\u4f59\u5ea7\u4f4d", "Url": "https://leetcode.cn/problems/consecutive-available-seats/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 604, "Title": "Design Compressed String Iterator", "TitleCn": "\u8fed\u4ee3\u538b\u7f29\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/design-compressed-string-iterator/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 36 Problem 2"}, {"ID": 605, "Title": "Can Place Flowers", "TitleCn": "\u79cd\u82b1\u95ee\u9898", "Url": "https://leetcode.cn/problems/can-place-flowers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 35 Problem 1"}, {"ID": 606, "Title": "Construct String from Binary Tree", "TitleCn": "\u6839\u636e\u4e8c\u53c9\u6811\u521b\u5efa\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/construct-string-from-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 35 Problem 2"}, {"ID": 607, "Title": "Sales Person", "TitleCn": "\u9500\u552e\u5458", "Url": "https://leetcode.cn/problems/sales-person/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 608, "Title": "Tree Node", "TitleCn": "\u6811\u8282\u70b9", "Url": "https://leetcode.cn/problems/tree-node/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 609, "Title": "Find Duplicate File in System", "TitleCn": "\u5728\u7cfb\u7edf\u4e2d\u67e5\u627e\u91cd\u590d\u6587\u4ef6", "Url": "https://leetcode.cn/problems/find-duplicate-file-in-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 35 Problem 3"}, {"ID": 610, "Title": "Triangle Judgement", "TitleCn": "\u5224\u65ad\u4e09\u89d2\u5f62", "Url": "https://leetcode.cn/problems/triangle-judgement/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 611, "Title": "Valid Triangle Number", "TitleCn": "\u6709\u6548\u4e09\u89d2\u5f62\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/valid-triangle-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 36 Problem 3"}, {"ID": 612, "Title": "Shortest Distance in a Plane", "TitleCn": "\u5e73\u9762\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/shortest-distance-in-a-plane/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 613, "Title": "Shortest Distance in a Line", "TitleCn": "\u76f4\u7ebf\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/shortest-distance-in-a-line/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 614, "Title": "Second Degree Follower", "TitleCn": "\u4e8c\u7ea7\u5173\u6ce8\u8005", "Url": "https://leetcode.cn/problems/second-degree-follower/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 615, "Title": "Average Salary: Departments VS Company", "TitleCn": "\u5e73\u5747\u5de5\u8d44\uff1a\u90e8\u95e8\u4e0e\u516c\u53f8\u6bd4\u8f83", "Url": "https://leetcode.cn/problems/average-salary-departments-vs-company/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 616, "Title": "Add Bold Tag in String", "TitleCn": "\u7ed9\u5b57\u7b26\u4e32\u6dfb\u52a0\u52a0\u7c97\u6807\u7b7e", "Url": "https://leetcode.cn/problems/add-bold-tag-in-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 36 Problem 4"}, {"ID": 617, "Title": "Merge Two Binary Trees", "TitleCn": "\u5408\u5e76\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/merge-two-binary-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 36 Problem 1"}, {"ID": 618, "Title": "Students Report By Geography", "TitleCn": "\u5b66\u751f\u5730\u7406\u4fe1\u606f\u62a5\u544a", "Url": "https://leetcode.cn/problems/students-report-by-geography/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 10, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 619, "Title": "Biggest Single Number", "TitleCn": "\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6700\u5927\u6570\u5b57", "Url": "https://leetcode.cn/problems/biggest-single-number/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 620, "Title": "Not Boring Movies", "TitleCn": "\u6709\u8da3\u7684\u7535\u5f71", "Url": "https://leetcode.cn/problems/not-boring-movies/", "Ispaid": 0, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 621, "Title": "Task Scheduler", "TitleCn": "\u4efb\u52a1\u8c03\u5ea6\u5668", "Url": "https://leetcode.cn/problems/task-scheduler/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 37 Problem 4"}, {"ID": 622, "Title": "Design Circular Queue", "TitleCn": "\u8bbe\u8ba1\u5faa\u73af\u961f\u5217", "Url": "https://leetcode.cn/problems/design-circular-queue/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 623, "Title": "Add One Row to Tree", "TitleCn": "\u5728\u4e8c\u53c9\u6811\u4e2d\u589e\u52a0\u4e00\u884c", "Url": "https://leetcode.cn/problems/add-one-row-to-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 37 Problem 2"}, {"ID": 624, "Title": "Maximum Distance in Arrays", "TitleCn": "\u6570\u7ec4\u5217\u8868\u4e2d\u7684\u6700\u5927\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/maximum-distance-in-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 37 Problem 1"}, {"ID": 625, "Title": "Minimum Factorization", "TitleCn": "\u6700\u5c0f\u56e0\u5f0f\u5206\u89e3", "Url": "https://leetcode.cn/problems/minimum-factorization/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 37 Problem 3"}, {"ID": 626, "Title": "Exchange Seats", "TitleCn": "\u6362\u5ea7\u4f4d", "Url": "https://leetcode.cn/problems/exchange-seats/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 627, "Title": "Swap Salary", "TitleCn": "\u4ea4\u6362\u5de5\u8d44", "Url": "https://leetcode.cn/problems/swap-salary/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 628, "Title": "Maximum Product of Three Numbers", "TitleCn": "\u4e09\u4e2a\u6570\u7684\u6700\u5927\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-product-of-three-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 38 Problem 1"}, {"ID": 629, "Title": "K Inverse Pairs Array", "TitleCn": "K\u4e2a\u9006\u5e8f\u5bf9\u6570\u7ec4", "Url": "https://leetcode.cn/problems/k-inverse-pairs-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 38 Problem 3"}, {"ID": 630, "Title": "Course Schedule III", "TitleCn": "\u8bfe\u7a0b\u8868 III", "Url": "https://leetcode.cn/problems/course-schedule-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 38 Problem 2"}, {"ID": 631, "Title": "Design Excel Sum Formula", "TitleCn": "\u8bbe\u8ba1 Excel \u6c42\u548c\u516c\u5f0f", "Url": "https://leetcode.cn/problems/design-excel-sum-formula/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 38 Problem 4"}, {"ID": 632, "Title": "Smallest Range Covering Elements from K Lists", "TitleCn": "\u6700\u5c0f\u533a\u95f4", "Url": "https://leetcode.cn/problems/smallest-range-covering-elements-from-k-lists/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 39 Problem 4"}, {"ID": 633, "Title": "Sum of Square Numbers", "TitleCn": "\u5e73\u65b9\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-square-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 39 Problem 1"}, {"ID": 634, "Title": "Find the Derangement of An Array", "TitleCn": "\u5bfb\u627e\u6570\u7ec4\u7684\u9519\u4f4d\u6392\u5217", "Url": "https://leetcode.cn/problems/find-the-derangement-of-an-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 39 Problem 3"}, {"ID": 635, "Title": "Design Log Storage System", "TitleCn": "\u8bbe\u8ba1\u65e5\u5fd7\u5b58\u50a8\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-log-storage-system/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 39 Problem 2"}, {"ID": 636, "Title": "Exclusive Time of Functions", "TitleCn": "\u51fd\u6570\u7684\u72ec\u5360\u65f6\u95f4", "Url": "https://leetcode.cn/problems/exclusive-time-of-functions/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 41 Problem 2"}, {"ID": 637, "Title": "Average of Levels in Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5c42\u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/average-of-levels-in-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 40 Problem 1"}, {"ID": 638, "Title": "Shopping Offers", "TitleCn": "\u5927\u793c\u5305", "Url": "https://leetcode.cn/problems/shopping-offers/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 40 Problem 3"}, {"ID": 639, "Title": "Decode Ways II", "TitleCn": "\u89e3\u7801\u65b9\u6cd5 II", "Url": "https://leetcode.cn/problems/decode-ways-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 40 Problem 4"}, {"ID": 640, "Title": "Solve the Equation", "TitleCn": "\u6c42\u89e3\u65b9\u7a0b", "Url": "https://leetcode.cn/problems/solve-the-equation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 40 Problem 2"}, {"ID": 641, "Title": "Design Circular Deque", "TitleCn": "\u8bbe\u8ba1\u5faa\u73af\u53cc\u7aef\u961f\u5217", "Url": "https://leetcode.cn/problems/design-circular-deque/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 642, "Title": "Design Search Autocomplete System", "TitleCn": "\u8bbe\u8ba1\u641c\u7d22\u81ea\u52a8\u8865\u5168\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-search-autocomplete-system/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 41 Problem 4"}, {"ID": 643, "Title": "Maximum Average Subarray I", "TitleCn": "\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 I", "Url": "https://leetcode.cn/problems/maximum-average-subarray-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 41 Problem 1"}, {"ID": 644, "Title": "Maximum Average Subarray II", "TitleCn": "\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 II", "Url": "https://leetcode.cn/problems/maximum-average-subarray-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 41 Problem 3"}, {"ID": 645, "Title": "Set Mismatch", "TitleCn": "\u9519\u8bef\u7684\u96c6\u5408", "Url": "https://leetcode.cn/problems/set-mismatch/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 42 Problem 4"}, {"ID": 646, "Title": "Maximum Length of Pair Chain", "TitleCn": "\u6700\u957f\u6570\u5bf9\u94fe", "Url": "https://leetcode.cn/problems/maximum-length-of-pair-chain/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 42 Problem 3"}, {"ID": 647, "Title": "Palindromic Substrings", "TitleCn": "\u56de\u6587\u5b50\u4e32", "Url": "https://leetcode.cn/problems/palindromic-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 42 Problem 2"}, {"ID": 648, "Title": "Replace Words", "TitleCn": "\u5355\u8bcd\u66ff\u6362", "Url": "https://leetcode.cn/problems/replace-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 42 Problem 1"}, {"ID": 649, "Title": "Dota2 Senate", "TitleCn": "Dota2 \u53c2\u8bae\u9662", "Url": "https://leetcode.cn/problems/dota2-senate/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 43 Problem 3"}, {"ID": 650, "Title": "2 Keys Keyboard", "TitleCn": "\u4e24\u4e2a\u952e\u7684\u952e\u76d8", "Url": "https://leetcode.cn/problems/2-keys-keyboard/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 43 Problem 2"}, {"ID": 651, "Title": "4 Keys Keyboard", "TitleCn": "\u56db\u4e2a\u952e\u7684\u952e\u76d8", "Url": "https://leetcode.cn/problems/4-keys-keyboard/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 43 Problem 4"}, {"ID": 652, "Title": "Find Duplicate Subtrees", "TitleCn": "\u5bfb\u627e\u91cd\u590d\u7684\u5b50\u6811", "Url": "https://leetcode.cn/problems/find-duplicate-subtrees/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 43 Problem 1"}, {"ID": 653, "Title": "Two Sum IV - Input is a BST", "TitleCn": "\u4e24\u6570\u4e4b\u548c IV - \u8f93\u5165 BST", "Url": "https://leetcode.cn/problems/two-sum-iv-input-is-a-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 44 Problem 1"}, {"ID": 654, "Title": "Maximum Binary Tree", "TitleCn": "\u6700\u5927\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/maximum-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 44 Problem 2"}, {"ID": 655, "Title": "Print Binary Tree", "TitleCn": "\u8f93\u51fa\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/print-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 44 Problem 3"}, {"ID": 656, "Title": "Coin Path", "TitleCn": "\u91d1\u5e01\u8def\u5f84", "Url": "https://leetcode.cn/problems/coin-path/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 44 Problem 4"}, {"ID": 657, "Title": "Robot Return to Origin", "TitleCn": "\u673a\u5668\u4eba\u80fd\u5426\u8fd4\u56de\u539f\u70b9", "Url": "https://leetcode.cn/problems/robot-return-to-origin/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 45 Problem 1"}, {"ID": 658, "Title": "Find K Closest Elements", "TitleCn": "\u627e\u5230 K \u4e2a\u6700\u63a5\u8fd1\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/find-k-closest-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 45 Problem 2"}, {"ID": 659, "Title": "Split Array into Consecutive Subsequences", "TitleCn": "\u5206\u5272\u6570\u7ec4\u4e3a\u8fde\u7eed\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/split-array-into-consecutive-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 45 Problem 3"}, {"ID": 660, "Title": "Remove 9", "TitleCn": "\u79fb\u9664 9", "Url": "https://leetcode.cn/problems/remove-9/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 45 Problem 4"}, {"ID": 661, "Title": "Image Smoother", "TitleCn": "\u56fe\u7247\u5e73\u6ed1\u5668", "Url": "https://leetcode.cn/problems/image-smoother/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 46 Problem 1"}, {"ID": 662, "Title": "Maximum Width of Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u6700\u5927\u5bbd\u5ea6", "Url": "https://leetcode.cn/problems/maximum-width-of-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 46 Problem 2"}, {"ID": 663, "Title": "Equal Tree Partition", "TitleCn": "\u5747\u5300\u6811\u5212\u5206", "Url": "https://leetcode.cn/problems/equal-tree-partition/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 46 Problem 3"}, {"ID": 664, "Title": "Strange Printer", "TitleCn": "\u5947\u602a\u7684\u6253\u5370\u673a", "Url": "https://leetcode.cn/problems/strange-printer/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 46 Problem 4"}, {"ID": 665, "Title": "Non-decreasing Array", "TitleCn": "\u975e\u9012\u51cf\u6570\u5217", "Url": "https://leetcode.cn/problems/non-decreasing-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 47 Problem 1"}, {"ID": 666, "Title": "Path Sum IV", "TitleCn": "\u8def\u5f84\u603b\u548c IV", "Url": "https://leetcode.cn/problems/path-sum-iv/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 47 Problem 2"}, {"ID": 667, "Title": "Beautiful Arrangement II", "TitleCn": "\u4f18\u7f8e\u7684\u6392\u5217 II", "Url": "https://leetcode.cn/problems/beautiful-arrangement-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 47 Problem 3"}, {"ID": 668, "Title": "Kth Smallest Number in Multiplication Table", "TitleCn": "\u4e58\u6cd5\u8868\u4e2d\u7b2ck\u5c0f\u7684\u6570", "Url": "https://leetcode.cn/problems/kth-smallest-number-in-multiplication-table/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 47 Problem 4"}, {"ID": 669, "Title": "Trim a Binary Search Tree", "TitleCn": "\u4fee\u526a\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/trim-a-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 48 Problem 2"}, {"ID": 670, "Title": "Maximum Swap", "TitleCn": "\u6700\u5927\u4ea4\u6362", "Url": "https://leetcode.cn/problems/maximum-swap/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 48 Problem 3"}, {"ID": 671, "Title": "Second Minimum Node In a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u7b2c\u4e8c\u5c0f\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/second-minimum-node-in-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 48 Problem 1"}, {"ID": 672, "Title": "Bulb Switcher II", "TitleCn": "\u706f\u6ce1\u5f00\u5173 \u2161", "Url": "https://leetcode.cn/problems/bulb-switcher-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 48 Problem 4"}, {"ID": 673, "Title": "Number of Longest Increasing Subsequence", "TitleCn": "\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/number-of-longest-increasing-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 49 Problem 4"}, {"ID": 674, "Title": "Longest Continuous Increasing Subsequence", "TitleCn": "\u6700\u957f\u8fde\u7eed\u9012\u589e\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-continuous-increasing-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 49 Problem 1"}, {"ID": 675, "Title": "Cut Off Trees for Golf Event", "TitleCn": "\u4e3a\u9ad8\u5c14\u592b\u6bd4\u8d5b\u780d\u6811", "Url": "https://leetcode.cn/problems/cut-off-trees-for-golf-event/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 49 Problem 3"}, {"ID": 676, "Title": "Implement Magic Dictionary", "TitleCn": "\u5b9e\u73b0\u4e00\u4e2a\u9b54\u6cd5\u5b57\u5178", "Url": "https://leetcode.cn/problems/implement-magic-dictionary/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 49 Problem 2"}, {"ID": 677, "Title": "Map Sum Pairs", "TitleCn": "\u952e\u503c\u6620\u5c04", "Url": "https://leetcode.cn/problems/map-sum-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 50 Problem 2"}, {"ID": 678, "Title": "Valid Parenthesis String", "TitleCn": "\u6709\u6548\u7684\u62ec\u53f7\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/valid-parenthesis-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 50 Problem 3"}, {"ID": 679, "Title": "24 Game", "TitleCn": "24 \u70b9\u6e38\u620f", "Url": "https://leetcode.cn/problems/24-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 50 Problem 4"}, {"ID": 680, "Title": "Valid Palindrome II", "TitleCn": "\u9a8c\u8bc1\u56de\u6587\u5b57\u7b26\u4e32 \u2161", "Url": "https://leetcode.cn/problems/valid-palindrome-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 50 Problem 1"}, {"ID": 681, "Title": "Next Closest Time", "TitleCn": "\u6700\u8fd1\u65f6\u523b", "Url": "https://leetcode.cn/problems/next-closest-time/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 51 Problem 2"}, {"ID": 682, "Title": "Baseball Game", "TitleCn": "\u68d2\u7403\u6bd4\u8d5b", "Url": "https://leetcode.cn/problems/baseball-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 51 Problem 1"}, {"ID": 683, "Title": "K Empty Slots", "TitleCn": "K \u4e2a\u5173\u95ed\u7684\u706f\u6ce1", "Url": "https://leetcode.cn/problems/k-empty-slots/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 51 Problem 4"}, {"ID": 684, "Title": "Redundant Connection", "TitleCn": "\u5197\u4f59\u8fde\u63a5", "Url": "https://leetcode.cn/problems/redundant-connection/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 51 Problem 3"}, {"ID": 685, "Title": "Redundant Connection II", "TitleCn": "\u5197\u4f59\u8fde\u63a5 II", "Url": "https://leetcode.cn/problems/redundant-connection-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 686, "Title": "Repeated String Match", "TitleCn": "\u91cd\u590d\u53e0\u52a0\u5b57\u7b26\u4e32\u5339\u914d", "Url": "https://leetcode.cn/problems/repeated-string-match/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 52 Problem 1"}, {"ID": 687, "Title": "Longest Univalue Path", "TitleCn": "\u6700\u957f\u540c\u503c\u8def\u5f84", "Url": "https://leetcode.cn/problems/longest-univalue-path/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 52 Problem 2"}, {"ID": 688, "Title": "Knight Probability in Chessboard", "TitleCn": "\u9a91\u58eb\u5728\u68cb\u76d8\u4e0a\u7684\u6982\u7387", "Url": "https://leetcode.cn/problems/knight-probability-in-chessboard/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 52 Problem 3"}, {"ID": 689, "Title": "Maximum Sum of 3 Non-Overlapping Subarrays", "TitleCn": "\u4e09\u4e2a\u65e0\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-of-3-non-overlapping-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 52 Problem 4"}, {"ID": 690, "Title": "Employee Importance", "TitleCn": "\u5458\u5de5\u7684\u91cd\u8981\u6027", "Url": "https://leetcode.cn/problems/employee-importance/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 691, "Title": "Stickers to Spell Word", "TitleCn": "\u8d34\u7eb8\u62fc\u8bcd", "Url": "https://leetcode.cn/problems/stickers-to-spell-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 53 Problem 4"}, {"ID": 692, "Title": "Top K Frequent Words", "TitleCn": "\u524dK\u4e2a\u9ad8\u9891\u5355\u8bcd", "Url": "https://leetcode.cn/problems/top-k-frequent-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 693, "Title": "Binary Number with Alternating Bits", "TitleCn": "\u4ea4\u66ff\u4f4d\u4e8c\u8fdb\u5236\u6570", "Url": "https://leetcode.cn/problems/binary-number-with-alternating-bits/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 53 Problem 1"}, {"ID": 694, "Title": "Number of Distinct Islands", "TitleCn": "\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-distinct-islands/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 53 Problem 3"}, {"ID": 695, "Title": "Max Area of Island", "TitleCn": "\u5c9b\u5c7f\u7684\u6700\u5927\u9762\u79ef", "Url": "https://leetcode.cn/problems/max-area-of-island/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 53 Problem 2"}, {"ID": 696, "Title": "Count Binary Substrings", "TitleCn": "\u8ba1\u6570\u4e8c\u8fdb\u5236\u5b50\u4e32", "Url": "https://leetcode.cn/problems/count-binary-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 54 Problem 2"}, {"ID": 697, "Title": "Degree of an Array", "TitleCn": "\u6570\u7ec4\u7684\u5ea6", "Url": "https://leetcode.cn/problems/degree-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 54 Problem 1"}, {"ID": 698, "Title": "Partition to K Equal Sum Subsets", "TitleCn": "\u5212\u5206\u4e3ak\u4e2a\u76f8\u7b49\u7684\u5b50\u96c6", "Url": "https://leetcode.cn/problems/partition-to-k-equal-sum-subsets/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 54 Problem 3"}, {"ID": 699, "Title": "Falling Squares", "TitleCn": "\u6389\u843d\u7684\u65b9\u5757", "Url": "https://leetcode.cn/problems/falling-squares/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 54 Problem 4"}, {"ID": 700, "Title": "Search in a Binary Search Tree", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u641c\u7d22", "Url": "https://leetcode.cn/problems/search-in-a-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 701, "Title": "Insert into a Binary Search Tree", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u63d2\u5165\u64cd\u4f5c", "Url": "https://leetcode.cn/problems/insert-into-a-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 702, "Title": "Search in a Sorted Array of Unknown Size", "TitleCn": "\u641c\u7d22\u957f\u5ea6\u672a\u77e5\u7684\u6709\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/search-in-a-sorted-array-of-unknown-size/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 703, "Title": "Kth Largest Element in a Stream", "TitleCn": "\u6570\u636e\u6d41\u4e2d\u7684\u7b2cK\u5927\u5143\u7d20", "Url": "https://leetcode.cn/problems/kth-largest-element-in-a-stream/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 704, "Title": "Binary Search", "TitleCn": "\u4e8c\u5206\u67e5\u627e", "Url": "https://leetcode.cn/problems/binary-search/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 705, "Title": "Design HashSet", "TitleCn": "\u8bbe\u8ba1\u54c8\u5e0c\u96c6\u5408", "Url": "https://leetcode.cn/problems/design-hashset/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 706, "Title": "Design HashMap", "TitleCn": "\u8bbe\u8ba1\u54c8\u5e0c\u6620\u5c04", "Url": "https://leetcode.cn/problems/design-hashmap/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 707, "Title": "Design Linked List", "TitleCn": "\u8bbe\u8ba1\u94fe\u8868", "Url": "https://leetcode.cn/problems/design-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 708, "Title": "Insert into a Sorted Circular Linked List", "TitleCn": "\u5faa\u73af\u6709\u5e8f\u5217\u8868\u7684\u63d2\u5165", "Url": "https://leetcode.cn/problems/insert-into-a-sorted-circular-linked-list/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 709, "Title": "To Lower Case", "TitleCn": "\u8f6c\u6362\u6210\u5c0f\u5199\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/to-lower-case/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 710, "Title": "Random Pick with Blacklist", "TitleCn": "\u9ed1\u540d\u5355\u4e2d\u7684\u968f\u673a\u6570", "Url": "https://leetcode.cn/problems/random-pick-with-blacklist/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 711, "Title": "Number of Distinct Islands II", "TitleCn": "\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf II", "Url": "https://leetcode.cn/problems/number-of-distinct-islands-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 712, "Title": "Minimum ASCII Delete Sum for Two Strings", "TitleCn": "\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u6700\u5c0fASCII\u5220\u9664\u548c", "Url": "https://leetcode.cn/problems/minimum-ascii-delete-sum-for-two-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 55 Problem 2"}, {"ID": 713, "Title": "Subarray Product Less Than K", "TitleCn": "\u4e58\u79ef\u5c0f\u4e8eK\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/subarray-product-less-than-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 55 Problem 3"}, {"ID": 714, "Title": "Best Time to Buy and Sell Stock with Transaction Fee", "TitleCn": "\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a\u542b\u624b\u7eed\u8d39", "Url": "https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 55 Problem 1"}, {"ID": 715, "Title": "Range Module", "TitleCn": "Range \u6a21\u5757", "Url": "https://leetcode.cn/problems/range-module/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 55 Problem 4"}, {"ID": 716, "Title": "Max Stack", "TitleCn": "\u6700\u5927\u6808", "Url": "https://leetcode.cn/problems/max-stack/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 717, "Title": "1-bit and 2-bit Characters", "TitleCn": "1 \u6bd4\u7279\u4e0e 2 \u6bd4\u7279\u5b57\u7b26", "Url": "https://leetcode.cn/problems/1-bit-and-2-bit-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 56 Problem 1"}, {"ID": 718, "Title": "Maximum Length of Repeated Subarray", "TitleCn": "\u6700\u957f\u91cd\u590d\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/maximum-length-of-repeated-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 56 Problem 3"}, {"ID": 719, "Title": "Find K-th Smallest Pair Distance", "TitleCn": "\u627e\u51fa\u7b2c k \u5c0f\u7684\u8ddd\u79bb\u5bf9", "Url": "https://leetcode.cn/problems/find-k-th-smallest-pair-distance/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 56 Problem 4"}, {"ID": 720, "Title": "Longest Word in Dictionary", "TitleCn": "\u8bcd\u5178\u4e2d\u6700\u957f\u7684\u5355\u8bcd", "Url": "https://leetcode.cn/problems/longest-word-in-dictionary/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 57 Problem 1"}, {"ID": 721, "Title": "Accounts Merge", "TitleCn": "\u8d26\u6237\u5408\u5e76", "Url": "https://leetcode.cn/problems/accounts-merge/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 57 Problem 2"}, {"ID": 722, "Title": "Remove Comments", "TitleCn": "\u5220\u9664\u6ce8\u91ca", "Url": "https://leetcode.cn/problems/remove-comments/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 57 Problem 3"}, {"ID": 723, "Title": "Candy Crush", "TitleCn": "\u7c89\u788e\u7cd6\u679c", "Url": "https://leetcode.cn/problems/candy-crush/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 57 Problem 4"}, {"ID": 724, "Title": "Find Pivot Index", "TitleCn": "\u5bfb\u627e\u6570\u7ec4\u7684\u4e2d\u5fc3\u7d22\u5f15", "Url": "https://leetcode.cn/problems/find-pivot-index/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 58 Problem 1"}, {"ID": 725, "Title": "Split Linked List in Parts", "TitleCn": "\u5206\u9694\u94fe\u8868", "Url": "https://leetcode.cn/problems/split-linked-list-in-parts/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 58 Problem 2"}, {"ID": 726, "Title": "Number of Atoms", "TitleCn": "\u539f\u5b50\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-atoms/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 58 Problem 3"}, {"ID": 727, "Title": "Minimum Window Subsequence", "TitleCn": "\u6700\u5c0f\u7a97\u53e3\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/minimum-window-subsequence/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 58 Problem 4"}, {"ID": 728, "Title": "Self Dividing Numbers", "TitleCn": "\u81ea\u9664\u6570", "Url": "https://leetcode.cn/problems/self-dividing-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 59 Problem 1"}, {"ID": 729, "Title": "My Calendar I", "TitleCn": "\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 I", "Url": "https://leetcode.cn/problems/my-calendar-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 59 Problem 2"}, {"ID": 730, "Title": "Count Different Palindromic Subsequences", "TitleCn": "\u7edf\u8ba1\u4e0d\u540c\u56de\u6587\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/count-different-palindromic-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 59 Problem 3"}, {"ID": 731, "Title": "My Calendar II", "TitleCn": "\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 II", "Url": "https://leetcode.cn/problems/my-calendar-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 59 Problem 4"}, {"ID": 732, "Title": "My Calendar III", "TitleCn": "\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 III", "Url": "https://leetcode.cn/problems/my-calendar-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 733, "Title": "Flood Fill", "TitleCn": "\u56fe\u50cf\u6e32\u67d3", "Url": "https://leetcode.cn/problems/flood-fill/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 60 Problem 1"}, {"ID": 734, "Title": "Sentence Similarity", "TitleCn": "\u53e5\u5b50\u76f8\u4f3c\u6027", "Url": "https://leetcode.cn/problems/sentence-similarity/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 60 Problem 2"}, {"ID": 735, "Title": "Asteroid Collision", "TitleCn": "\u884c\u661f\u78b0\u649e", "Url": "https://leetcode.cn/problems/asteroid-collision/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 60 Problem 3"}, {"ID": 736, "Title": "Parse Lisp Expression", "TitleCn": "Lisp \u8bed\u6cd5\u89e3\u6790", "Url": "https://leetcode.cn/problems/parse-lisp-expression/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 60 Problem 4"}, {"ID": 737, "Title": "Sentence Similarity II", "TitleCn": "\u53e5\u5b50\u76f8\u4f3c\u6027 II", "Url": "https://leetcode.cn/problems/sentence-similarity-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 738, "Title": "Monotone Increasing Digits", "TitleCn": "\u5355\u8c03\u9012\u589e\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/monotone-increasing-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 61 Problem 2"}, {"ID": 739, "Title": "Daily Temperatures", "TitleCn": "\u6bcf\u65e5\u6e29\u5ea6", "Url": "https://leetcode.cn/problems/daily-temperatures/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 61 Problem 1"}, {"ID": 740, "Title": "Delete and Earn", "TitleCn": "\u5220\u9664\u4e0e\u83b7\u5f97\u70b9\u6570", "Url": "https://leetcode.cn/problems/delete-and-earn/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 61 Problem 3"}, {"ID": 741, "Title": "Cherry Pickup", "TitleCn": "\u6458\u6a31\u6843", "Url": "https://leetcode.cn/problems/cherry-pickup/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 61 Problem 4"}, {"ID": 742, "Title": "Closest Leaf in a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u6700\u8fd1\u7684\u53f6\u8282\u70b9", "Url": "https://leetcode.cn/problems/closest-leaf-in-a-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 62 Problem 3"}, {"ID": 743, "Title": "Network Delay Time", "TitleCn": "\u7f51\u7edc\u5ef6\u8fdf\u65f6\u95f4", "Url": "https://leetcode.cn/problems/network-delay-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 62 Problem 2"}, {"ID": 744, "Title": "Find Smallest Letter Greater Than Target", "TitleCn": "\u5bfb\u627e\u6bd4\u76ee\u6807\u5b57\u6bcd\u5927\u7684\u6700\u5c0f\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/find-smallest-letter-greater-than-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 62 Problem 1"}, {"ID": 745, "Title": "Prefix and Suffix Search", "TitleCn": "\u524d\u7f00\u548c\u540e\u7f00\u641c\u7d22", "Url": "https://leetcode.cn/problems/prefix-and-suffix-search/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 62 Problem 4"}, {"ID": 746, "Title": "Min Cost Climbing Stairs", "TitleCn": "\u4f7f\u7528\u6700\u5c0f\u82b1\u8d39\u722c\u697c\u68af", "Url": "https://leetcode.cn/problems/min-cost-climbing-stairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 63 Problem 1"}, {"ID": 747, "Title": "Largest Number At Least Twice of Others", "TitleCn": "\u81f3\u5c11\u662f\u5176\u4ed6\u6570\u5b57\u4e24\u500d\u7684\u6700\u5927\u6570", "Url": "https://leetcode.cn/problems/largest-number-at-least-twice-of-others/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 64 Problem 1"}, {"ID": 748, "Title": "Shortest Completing Word", "TitleCn": "\u6700\u77ed\u8865\u5168\u8bcd", "Url": "https://leetcode.cn/problems/shortest-completing-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 63 Problem 2"}, {"ID": 749, "Title": "Contain Virus", "TitleCn": "\u9694\u79bb\u75c5\u6bd2", "Url": "https://leetcode.cn/problems/contain-virus/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 63 Problem 4"}, {"ID": 750, "Title": "Number Of Corner Rectangles", "TitleCn": "\u89d2\u77e9\u5f62\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-corner-rectangles/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 63 Problem 3"}, {"ID": 751, "Title": "IP to CIDR", "TitleCn": "IP \u5230 CIDR", "Url": "https://leetcode.cn/problems/ip-to-cidr/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 64 Problem 2"}, {"ID": 752, "Title": "Open the Lock", "TitleCn": "\u6253\u5f00\u8f6c\u76d8\u9501", "Url": "https://leetcode.cn/problems/open-the-lock/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 64 Problem 3"}, {"ID": 753, "Title": "Cracking the Safe", "TitleCn": "\u7834\u89e3\u4fdd\u9669\u7bb1", "Url": "https://leetcode.cn/problems/cracking-the-safe/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 64 Problem 4"}, {"ID": 754, "Title": "Reach a Number", "TitleCn": "\u5230\u8fbe\u7ec8\u70b9\u6570\u5b57", "Url": "https://leetcode.cn/problems/reach-a-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 65 Problem 1"}, {"ID": 755, "Title": "Pour Water", "TitleCn": "\u5012\u6c34", "Url": "https://leetcode.cn/problems/pour-water/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 65 Problem 2"}, {"ID": 756, "Title": "Pyramid Transition Matrix", "TitleCn": "\u91d1\u5b57\u5854\u8f6c\u6362\u77e9\u9635", "Url": "https://leetcode.cn/problems/pyramid-transition-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 65 Problem 3"}, {"ID": 757, "Title": "Set Intersection Size At Least Two", "TitleCn": "\u8bbe\u7f6e\u4ea4\u96c6\u5927\u5c0f\u81f3\u5c11\u4e3a2", "Url": "https://leetcode.cn/problems/set-intersection-size-at-least-two/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 65 Problem 4"}, {"ID": 758, "Title": "Bold Words in String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u7684\u52a0\u7c97\u5355\u8bcd", "Url": "https://leetcode.cn/problems/bold-words-in-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 66 Problem 2"}, {"ID": 759, "Title": "Employee Free Time", "TitleCn": "\u5458\u5de5\u7a7a\u95f2\u65f6\u95f4", "Url": "https://leetcode.cn/problems/employee-free-time/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 66 Problem 3"}, {"ID": 760, "Title": "Find Anagram Mappings", "TitleCn": "\u627e\u51fa\u53d8\u4f4d\u6620\u5c04", "Url": "https://leetcode.cn/problems/find-anagram-mappings/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 66 Problem 1"}, {"ID": 761, "Title": "Special Binary String", "TitleCn": "\u7279\u6b8a\u7684\u4e8c\u8fdb\u5236\u5e8f\u5217", "Url": "https://leetcode.cn/problems/special-binary-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 66 Problem 4"}, {"ID": 762, "Title": "Prime Number of Set Bits in Binary Representation", "TitleCn": "\u4e8c\u8fdb\u5236\u8868\u793a\u4e2d\u8d28\u6570\u4e2a\u8ba1\u7b97\u7f6e\u4f4d", "Url": "https://leetcode.cn/problems/prime-number-of-set-bits-in-binary-representation/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 67 Problem 1"}, {"ID": 763, "Title": "Partition Labels", "TitleCn": "\u5212\u5206\u5b57\u6bcd\u533a\u95f4", "Url": "https://leetcode.cn/problems/partition-labels/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 67 Problem 2"}, {"ID": 764, "Title": "Largest Plus Sign", "TitleCn": "\u6700\u5927\u52a0\u53f7\u6807\u5fd7", "Url": "https://leetcode.cn/problems/largest-plus-sign/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 67 Problem 3"}, {"ID": 765, "Title": "Couples Holding Hands", "TitleCn": "\u60c5\u4fa3\u7275\u624b", "Url": "https://leetcode.cn/problems/couples-holding-hands/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 67 Problem 4"}, {"ID": 766, "Title": "Toeplitz Matrix", "TitleCn": "\u6258\u666e\u5229\u8328\u77e9\u9635", "Url": "https://leetcode.cn/problems/toeplitz-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 68 Problem 1"}, {"ID": 767, "Title": "Reorganize String", "TitleCn": "\u91cd\u6784\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/reorganize-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 68 Problem 2"}, {"ID": 768, "Title": "Max Chunks To Make Sorted II", "TitleCn": "\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757 II", "Url": "https://leetcode.cn/problems/max-chunks-to-make-sorted-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 68 Problem 4"}, {"ID": 769, "Title": "Max Chunks To Make Sorted", "TitleCn": "\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757", "Url": "https://leetcode.cn/problems/max-chunks-to-make-sorted/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 68 Problem 3"}, {"ID": 770, "Title": "Basic Calculator IV", "TitleCn": "\u57fa\u672c\u8ba1\u7b97\u5668 IV", "Url": "https://leetcode.cn/problems/basic-calculator-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 68 Problem 5"}, {"ID": 771, "Title": "Jewels and Stones", "TitleCn": "\u5b9d\u77f3\u4e0e\u77f3\u5934", "Url": "https://leetcode.cn/problems/jewels-and-stones/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 69 Problem 1"}, {"ID": 772, "Title": "Basic Calculator III", "TitleCn": "\u57fa\u672c\u8ba1\u7b97\u5668 III", "Url": "https://leetcode.cn/problems/basic-calculator-iii/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 773, "Title": "Sliding Puzzle", "TitleCn": "\u6ed1\u52a8\u8c1c\u9898", "Url": "https://leetcode.cn/problems/sliding-puzzle/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 69 Problem 3"}, {"ID": 774, "Title": "Minimize Max Distance to Gas Station", "TitleCn": "\u6700\u5c0f\u5316\u53bb\u52a0\u6cb9\u7ad9\u7684\u6700\u5927\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/minimize-max-distance-to-gas-station/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 69 Problem 4"}, {"ID": 775, "Title": "Global and Local Inversions", "TitleCn": "\u5168\u5c40\u5012\u7f6e\u4e0e\u5c40\u90e8\u5012\u7f6e", "Url": "https://leetcode.cn/problems/global-and-local-inversions/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 69 Problem 2"}, {"ID": 776, "Title": "Split BST", "TitleCn": "\u62c6\u5206\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/split-bst/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 70 Problem 2"}, {"ID": 777, "Title": "Swap Adjacent in LR String", "TitleCn": "\u5728LR\u5b57\u7b26\u4e32\u4e2d\u4ea4\u6362\u76f8\u90bb\u5b57\u7b26", "Url": "https://leetcode.cn/problems/swap-adjacent-in-lr-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 70 Problem 3"}, {"ID": 778, "Title": "Swim in Rising Water", "TitleCn": "\u6c34\u4f4d\u4e0a\u5347\u7684\u6cf3\u6c60\u4e2d\u6e38\u6cf3", "Url": "https://leetcode.cn/problems/swim-in-rising-water/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 70 Problem 4"}, {"ID": 779, "Title": "K-th Symbol in Grammar", "TitleCn": "\u7b2cK\u4e2a\u8bed\u6cd5\u7b26\u53f7", "Url": "https://leetcode.cn/problems/k-th-symbol-in-grammar/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 70 Problem 1"}, {"ID": 780, "Title": "Reaching Points", "TitleCn": "\u5230\u8fbe\u7ec8\u70b9", "Url": "https://leetcode.cn/problems/reaching-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 71 Problem 3"}, {"ID": 781, "Title": "Rabbits in Forest", "TitleCn": "\u68ee\u6797\u4e2d\u7684\u5154\u5b50", "Url": "https://leetcode.cn/problems/rabbits-in-forest/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 71 Problem 2"}, {"ID": 782, "Title": "Transform to Chessboard", "TitleCn": "\u53d8\u4e3a\u68cb\u76d8", "Url": "https://leetcode.cn/problems/transform-to-chessboard/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 71 Problem 4"}, {"ID": 783, "Title": "Minimum Distance Between BST Nodes", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u8282\u70b9\u6700\u5c0f\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/minimum-distance-between-bst-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 71 Problem 1"}, {"ID": 784, "Title": "Letter Case Permutation", "TitleCn": "\u5b57\u6bcd\u5927\u5c0f\u5199\u5168\u6392\u5217", "Url": "https://leetcode.cn/problems/letter-case-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 72 Problem 1"}, {"ID": 785, "Title": "Is Graph Bipartite?", "TitleCn": "\u5224\u65ad\u4e8c\u5206\u56fe", "Url": "https://leetcode.cn/problems/is-graph-bipartite/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 72 Problem 2"}, {"ID": 786, "Title": "K-th Smallest Prime Fraction", "TitleCn": "\u7b2c K \u4e2a\u6700\u5c0f\u7684\u8d28\u6570\u5206\u6570", "Url": "https://leetcode.cn/problems/k-th-smallest-prime-fraction/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 72 Problem 4"}, {"ID": 787, "Title": "Cheapest Flights Within K Stops", "TitleCn": "K \u7ad9\u4e2d\u8f6c\u5185\u6700\u4fbf\u5b9c\u7684\u822a\u73ed", "Url": "https://leetcode.cn/problems/cheapest-flights-within-k-stops/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 72 Problem 3"}, {"ID": 788, "Title": "Rotated Digits", "TitleCn": "\u65cb\u8f6c\u6570\u5b57", "Url": "https://leetcode.cn/problems/rotated-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 73 Problem 1"}, {"ID": 789, "Title": "Escape The Ghosts", "TitleCn": "\u9003\u8131\u963b\u788d\u8005", "Url": "https://leetcode.cn/problems/escape-the-ghosts/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 73 Problem 2"}, {"ID": 790, "Title": "Domino and Tromino Tiling", "TitleCn": "\u591a\u7c73\u8bfa\u548c\u6258\u7c73\u8bfa\u5e73\u94fa", "Url": "https://leetcode.cn/problems/domino-and-tromino-tiling/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 73 Problem 4"}, {"ID": 791, "Title": "Custom Sort String", "TitleCn": "\u81ea\u5b9a\u4e49\u5b57\u7b26\u4e32\u6392\u5e8f", "Url": "https://leetcode.cn/problems/custom-sort-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 73 Problem 3"}, {"ID": 792, "Title": "Number of Matching Subsequences", "TitleCn": "\u5339\u914d\u5b50\u5e8f\u5217\u7684\u5355\u8bcd\u6570", "Url": "https://leetcode.cn/problems/number-of-matching-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 74 Problem 2"}, {"ID": 793, "Title": "Preimage Size of Factorial Zeroes Function", "TitleCn": "\u9636\u4e58\u51fd\u6570\u540eK\u4e2a\u96f6", "Url": "https://leetcode.cn/problems/preimage-size-of-factorial-zeroes-function/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 74 Problem 4"}, {"ID": 794, "Title": "Valid Tic-Tac-Toe State", "TitleCn": "\u6709\u6548\u7684\u4e95\u5b57\u6e38\u620f", "Url": "https://leetcode.cn/problems/valid-tic-tac-toe-state/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 74 Problem 1"}, {"ID": 795, "Title": "Number of Subarrays with Bounded Maximum", "TitleCn": "\u533a\u95f4\u5b50\u6570\u7ec4\u4e2a\u6570", "Url": "https://leetcode.cn/problems/number-of-subarrays-with-bounded-maximum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 74 Problem 3"}, {"ID": 796, "Title": "Rotate String", "TitleCn": "\u65cb\u8f6c\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/rotate-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 75 Problem 1"}, {"ID": 797, "Title": "All Paths From Source to Target", "TitleCn": "\u6240\u6709\u53ef\u80fd\u7684\u8def\u5f84", "Url": "https://leetcode.cn/problems/all-paths-from-source-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 75 Problem 2"}, {"ID": 798, "Title": "Smallest Rotation with Highest Score", "TitleCn": "\u5f97\u5206\u6700\u9ad8\u7684\u6700\u5c0f\u8f6e\u8c03", "Url": "https://leetcode.cn/problems/smallest-rotation-with-highest-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 75 Problem 4"}, {"ID": 799, "Title": "Champagne Tower", "TitleCn": "\u9999\u69df\u5854", "Url": "https://leetcode.cn/problems/champagne-tower/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 75 Problem 3"}, {"ID": 800, "Title": "Similar RGB Color", "TitleCn": "\u76f8\u4f3c RGB \u989c\u8272", "Url": "https://leetcode.cn/problems/similar-rgb-color/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 76 Problem 1"}, {"ID": 801, "Title": "Minimum Swaps To Make Sequences Increasing", "TitleCn": "\u4f7f\u5e8f\u5217\u9012\u589e\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-swaps-to-make-sequences-increasing/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 76 Problem 2"}, {"ID": 802, "Title": "Find Eventual Safe States", "TitleCn": "\u627e\u5230\u6700\u7ec8\u7684\u5b89\u5168\u72b6\u6001", "Url": "https://leetcode.cn/problems/find-eventual-safe-states/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 76 Problem 3"}, {"ID": 803, "Title": "Bricks Falling When Hit", "TitleCn": "\u6253\u7816\u5757", "Url": "https://leetcode.cn/problems/bricks-falling-when-hit/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 76 Problem 4"}, {"ID": 804, "Title": "Unique Morse Code Words", "TitleCn": "\u552f\u4e00\u6469\u5c14\u65af\u5bc6\u7801\u8bcd", "Url": "https://leetcode.cn/problems/unique-morse-code-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 77 Problem 2"}, {"ID": 805, "Title": "Split Array With Same Average", "TitleCn": "\u6570\u7ec4\u7684\u5747\u503c\u5206\u5272", "Url": "https://leetcode.cn/problems/split-array-with-same-average/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 77 Problem 4"}, {"ID": 806, "Title": "Number of Lines To Write String", "TitleCn": "\u5199\u5b57\u7b26\u4e32\u9700\u8981\u7684\u884c\u6570", "Url": "https://leetcode.cn/problems/number-of-lines-to-write-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 77 Problem 1"}, {"ID": 807, "Title": "Max Increase to Keep City Skyline", "TitleCn": "\u4fdd\u6301\u57ce\u5e02\u5929\u9645\u7ebf", "Url": "https://leetcode.cn/problems/max-increase-to-keep-city-skyline/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 77 Problem 3"}, {"ID": 808, "Title": "Soup Servings", "TitleCn": "\u5206\u6c64", "Url": "https://leetcode.cn/problems/soup-servings/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 78 Problem 3"}, {"ID": 809, "Title": "Expressive Words", "TitleCn": "\u60c5\u611f\u4e30\u5bcc\u7684\u6587\u5b57", "Url": "https://leetcode.cn/problems/expressive-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 78 Problem 2"}, {"ID": 810, "Title": "Chalkboard XOR Game", "TitleCn": "\u9ed1\u677f\u5f02\u6216\u6e38\u620f", "Url": "https://leetcode.cn/problems/chalkboard-xor-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 78 Problem 4"}, {"ID": 811, "Title": "Subdomain Visit Count", "TitleCn": "\u5b50\u57df\u540d\u8bbf\u95ee\u8ba1\u6570", "Url": "https://leetcode.cn/problems/subdomain-visit-count/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 78 Problem 1"}, {"ID": 812, "Title": "Largest Triangle Area", "TitleCn": "\u6700\u5927\u4e09\u89d2\u5f62\u9762\u79ef", "Url": "https://leetcode.cn/problems/largest-triangle-area/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 79 Problem 1"}, {"ID": 813, "Title": "Largest Sum of Averages", "TitleCn": "\u6700\u5927\u5e73\u5747\u503c\u548c\u7684\u5206\u7ec4", "Url": "https://leetcode.cn/problems/largest-sum-of-averages/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 79 Problem 3"}, {"ID": 814, "Title": "Binary Tree Pruning", "TitleCn": "\u4e8c\u53c9\u6811\u526a\u679d", "Url": "https://leetcode.cn/problems/binary-tree-pruning/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 79 Problem 2"}, {"ID": 815, "Title": "Bus Routes", "TitleCn": "\u516c\u4ea4\u8def\u7ebf", "Url": "https://leetcode.cn/problems/bus-routes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 79 Problem 4"}, {"ID": 816, "Title": "Ambiguous Coordinates", "TitleCn": "\u6a21\u7cca\u5750\u6807", "Url": "https://leetcode.cn/problems/ambiguous-coordinates/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 80 Problem 3"}, {"ID": 817, "Title": "Linked List Components", "TitleCn": "\u94fe\u8868\u7ec4\u4ef6", "Url": "https://leetcode.cn/problems/linked-list-components/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 80 Problem 2"}, {"ID": 818, "Title": "Race Car", "TitleCn": "\u8d5b\u8f66", "Url": "https://leetcode.cn/problems/race-car/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 80 Problem 4"}, {"ID": 819, "Title": "Most Common Word", "TitleCn": "\u6700\u5e38\u89c1\u7684\u5355\u8bcd", "Url": "https://leetcode.cn/problems/most-common-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 80 Problem 1"}, {"ID": 820, "Title": "Short Encoding of Words", "TitleCn": "\u5355\u8bcd\u7684\u538b\u7f29\u7f16\u7801", "Url": "https://leetcode.cn/problems/short-encoding-of-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 81 Problem 3"}, {"ID": 821, "Title": "Shortest Distance to a Character", "TitleCn": "\u5b57\u7b26\u7684\u6700\u77ed\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/shortest-distance-to-a-character/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 81 Problem 1"}, {"ID": 822, "Title": "Card Flipping Game", "TitleCn": "\u7ffb\u8f6c\u5361\u7247\u6e38\u620f", "Url": "https://leetcode.cn/problems/card-flipping-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 81 Problem 2"}, {"ID": 823, "Title": "Binary Trees With Factors", "TitleCn": "\u5e26\u56e0\u5b50\u7684\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/binary-trees-with-factors/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 81 Problem 4"}, {"ID": 824, "Title": "Goat Latin", "TitleCn": "\u5c71\u7f8a\u62c9\u4e01\u6587", "Url": "https://leetcode.cn/problems/goat-latin/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 82 Problem 1"}, {"ID": 825, "Title": "Friends Of Appropriate Ages", "TitleCn": "\u9002\u9f84\u7684\u670b\u53cb", "Url": "https://leetcode.cn/problems/friends-of-appropriate-ages/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 82 Problem 2"}, {"ID": 826, "Title": "Most Profit Assigning Work", "TitleCn": "\u5b89\u6392\u5de5\u4f5c\u4ee5\u8fbe\u5230\u6700\u5927\u6536\u76ca", "Url": "https://leetcode.cn/problems/most-profit-assigning-work/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 82 Problem 3"}, {"ID": 827, "Title": "Making A Large Island", "TitleCn": "\u6700\u5927\u4eba\u5de5\u5c9b", "Url": "https://leetcode.cn/problems/making-a-large-island/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 82 Problem 4"}, {"ID": 828, "Title": "Count Unique Characters of All Substrings of a Given String", "TitleCn": "\u7edf\u8ba1\u5b50\u4e32\u4e2d\u7684\u552f\u4e00\u5b57\u7b26", "Url": "https://leetcode.cn/problems/count-unique-characters-of-all-substrings-of-a-given-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 83 Problem 4"}, {"ID": 829, "Title": "Consecutive Numbers Sum", "TitleCn": "\u8fde\u7eed\u6574\u6570\u6c42\u548c", "Url": "https://leetcode.cn/problems/consecutive-numbers-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 83 Problem 3"}, {"ID": 830, "Title": "Positions of Large Groups", "TitleCn": "\u8f83\u5927\u5206\u7ec4\u7684\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/positions-of-large-groups/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 83 Problem 1"}, {"ID": 831, "Title": "Masking Personal Information", "TitleCn": "\u9690\u85cf\u4e2a\u4eba\u4fe1\u606f", "Url": "https://leetcode.cn/problems/masking-personal-information/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 83 Problem 2"}, {"ID": 832, "Title": "Flipping an Image", "TitleCn": "\u7ffb\u8f6c\u56fe\u50cf", "Url": "https://leetcode.cn/problems/flipping-an-image/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 84 Problem 1"}, {"ID": 833, "Title": "Find And Replace in String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u7684\u67e5\u627e\u4e0e\u66ff\u6362", "Url": "https://leetcode.cn/problems/find-and-replace-in-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 84 Problem 2"}, {"ID": 834, "Title": "Sum of Distances in Tree", "TitleCn": "\u6811\u4e2d\u8ddd\u79bb\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-distances-in-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 84 Problem 4"}, {"ID": 835, "Title": "Image Overlap", "TitleCn": "\u56fe\u50cf\u91cd\u53e0", "Url": "https://leetcode.cn/problems/image-overlap/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 84 Problem 3"}, {"ID": 836, "Title": "Rectangle Overlap", "TitleCn": "\u77e9\u5f62\u91cd\u53e0", "Url": "https://leetcode.cn/problems/rectangle-overlap/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 85 Problem 1"}, {"ID": 837, "Title": "New 21 Game", "TitleCn": "\u65b021\u70b9", "Url": "https://leetcode.cn/problems/new-21-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 85 Problem 3"}, {"ID": 838, "Title": "Push Dominoes", "TitleCn": "\u63a8\u591a\u7c73\u8bfa", "Url": "https://leetcode.cn/problems/push-dominoes/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 85 Problem 2"}, {"ID": 839, "Title": "Similar String Groups", "TitleCn": "\u76f8\u4f3c\u5b57\u7b26\u4e32\u7ec4", "Url": "https://leetcode.cn/problems/similar-string-groups/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 85 Problem 4"}, {"ID": 840, "Title": "Magic Squares In Grid", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u5e7b\u65b9", "Url": "https://leetcode.cn/problems/magic-squares-in-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 86 Problem 1"}, {"ID": 841, "Title": "Keys and Rooms", "TitleCn": "\u94a5\u5319\u548c\u623f\u95f4", "Url": "https://leetcode.cn/problems/keys-and-rooms/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 86 Problem 2"}, {"ID": 842, "Title": "Split Array into Fibonacci Sequence", "TitleCn": "\u5c06\u6570\u7ec4\u62c6\u5206\u6210\u6590\u6ce2\u90a3\u5951\u5e8f\u5217", "Url": "https://leetcode.cn/problems/split-array-into-fibonacci-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 86 Problem 3"}, {"ID": 843, "Title": "Guess the Word", "TitleCn": "\u731c\u731c\u8fd9\u4e2a\u5355\u8bcd", "Url": "https://leetcode.cn/problems/guess-the-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 86 Problem 4"}, {"ID": 844, "Title": "Backspace String Compare", "TitleCn": "\u6bd4\u8f83\u542b\u9000\u683c\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/backspace-string-compare/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 87 Problem 1"}, {"ID": 845, "Title": "Longest Mountain in Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684\u6700\u957f\u5c71\u8109", "Url": "https://leetcode.cn/problems/longest-mountain-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 87 Problem 2"}, {"ID": 846, "Title": "Hand of Straights", "TitleCn": "\u4e00\u624b\u987a\u5b50", "Url": "https://leetcode.cn/problems/hand-of-straights/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 87 Problem 3"}, {"ID": 847, "Title": "Shortest Path Visiting All Nodes", "TitleCn": "\u8bbf\u95ee\u6240\u6709\u8282\u70b9\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-path-visiting-all-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 87 Problem 4"}, {"ID": 848, "Title": "Shifting Letters", "TitleCn": "\u5b57\u6bcd\u79fb\u4f4d", "Url": "https://leetcode.cn/problems/shifting-letters/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 88 Problem 1"}, {"ID": 849, "Title": "Maximize Distance to Closest Person", "TitleCn": "\u5230\u6700\u8fd1\u7684\u4eba\u7684\u6700\u5927\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/maximize-distance-to-closest-person/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 88 Problem 2"}, {"ID": 850, "Title": "Rectangle Area II", "TitleCn": "\u77e9\u5f62\u9762\u79ef II", "Url": "https://leetcode.cn/problems/rectangle-area-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 88 Problem 4"}, {"ID": 851, "Title": "Loud and Rich", "TitleCn": "\u55a7\u95f9\u548c\u5bcc\u6709", "Url": "https://leetcode.cn/problems/loud-and-rich/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 88 Problem 3"}, {"ID": 852, "Title": "Peak Index in a Mountain Array", "TitleCn": "\u5c71\u8109\u6570\u7ec4\u7684\u5cf0\u9876\u7d22\u5f15", "Url": "https://leetcode.cn/problems/peak-index-in-a-mountain-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 89 Problem 1"}, {"ID": 853, "Title": "Car Fleet", "TitleCn": "\u8f66\u961f", "Url": "https://leetcode.cn/problems/car-fleet/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 89 Problem 2"}, {"ID": 854, "Title": "K-Similar Strings", "TitleCn": "\u76f8\u4f3c\u5ea6\u4e3a K \u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/k-similar-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 89 Problem 4"}, {"ID": 855, "Title": "Exam Room", "TitleCn": "\u8003\u573a\u5c31\u5ea7", "Url": "https://leetcode.cn/problems/exam-room/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 89 Problem 3"}, {"ID": 856, "Title": "Score of Parentheses", "TitleCn": "\u62ec\u53f7\u7684\u5206\u6570", "Url": "https://leetcode.cn/problems/score-of-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 90 Problem 2"}, {"ID": 857, "Title": "Minimum Cost to Hire K Workers", "TitleCn": "\u96c7\u4f63 K \u540d\u5de5\u4eba\u7684\u6700\u4f4e\u6210\u672c", "Url": "https://leetcode.cn/problems/minimum-cost-to-hire-k-workers/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 90 Problem 4"}, {"ID": 858, "Title": "Mirror Reflection", "TitleCn": "\u955c\u9762\u53cd\u5c04", "Url": "https://leetcode.cn/problems/mirror-reflection/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 90 Problem 3"}, {"ID": 859, "Title": "Buddy Strings", "TitleCn": "\u4eb2\u5bc6\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/buddy-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 90 Problem 1"}, {"ID": 860, "Title": "Lemonade Change", "TitleCn": "\u67e0\u6aac\u6c34\u627e\u96f6", "Url": "https://leetcode.cn/problems/lemonade-change/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 91 Problem 1"}, {"ID": 861, "Title": "Score After Flipping Matrix", "TitleCn": "\u7ffb\u8f6c\u77e9\u9635\u540e\u7684\u5f97\u5206", "Url": "https://leetcode.cn/problems/score-after-flipping-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 91 Problem 3"}, {"ID": 862, "Title": "Shortest Subarray with Sum at Least K", "TitleCn": "\u548c\u81f3\u5c11\u4e3a K \u7684\u6700\u77ed\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 91 Problem 4"}, {"ID": 863, "Title": "All Nodes Distance K in Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u6240\u6709\u8ddd\u79bb\u4e3a K \u7684\u7ed3\u70b9", "Url": "https://leetcode.cn/problems/all-nodes-distance-k-in-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 91 Problem 2"}, {"ID": 864, "Title": "Shortest Path to Get All Keys", "TitleCn": "\u83b7\u53d6\u6240\u6709\u94a5\u5319\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-path-to-get-all-keys/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 92 Problem 4"}, {"ID": 865, "Title": "Smallest Subtree with all the Deepest Nodes", "TitleCn": "\u5177\u6709\u6240\u6709\u6700\u6df1\u7ed3\u70b9\u7684\u6700\u5c0f\u5b50\u6811", "Url": "https://leetcode.cn/problems/smallest-subtree-with-all-the-deepest-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 92 Problem 2"}, {"ID": 866, "Title": "Prime Palindrome", "TitleCn": "\u56de\u6587\u8d28\u6570", "Url": "https://leetcode.cn/problems/prime-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 92 Problem 3"}, {"ID": 867, "Title": "Transpose Matrix", "TitleCn": "\u8f6c\u7f6e\u77e9\u9635", "Url": "https://leetcode.cn/problems/transpose-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 92 Problem 1"}, {"ID": 868, "Title": "Binary Gap", "TitleCn": "\u4e8c\u8fdb\u5236\u95f4\u8ddd", "Url": "https://leetcode.cn/problems/binary-gap/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 93 Problem 1"}, {"ID": 869, "Title": "Reordered Power of 2", "TitleCn": "\u91cd\u65b0\u6392\u5e8f\u5f97\u5230 2 \u7684\u5e42", "Url": "https://leetcode.cn/problems/reordered-power-of-2/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 93 Problem 2"}, {"ID": 870, "Title": "Advantage Shuffle", "TitleCn": "\u4f18\u52bf\u6d17\u724c", "Url": "https://leetcode.cn/problems/advantage-shuffle/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 93 Problem 3"}, {"ID": 871, "Title": "Minimum Number of Refueling Stops", "TitleCn": "\u6700\u4f4e\u52a0\u6cb9\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-refueling-stops/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 93 Problem 4"}, {"ID": 872, "Title": "Leaf-Similar Trees", "TitleCn": "\u53f6\u5b50\u76f8\u4f3c\u7684\u6811", "Url": "https://leetcode.cn/problems/leaf-similar-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 94 Problem 1"}, {"ID": 873, "Title": "Length of Longest Fibonacci Subsequence", "TitleCn": "\u6700\u957f\u7684\u6590\u6ce2\u90a3\u5951\u5b50\u5e8f\u5217\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/length-of-longest-fibonacci-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 94 Problem 4"}, {"ID": 874, "Title": "Walking Robot Simulation", "TitleCn": "\u6a21\u62df\u884c\u8d70\u673a\u5668\u4eba", "Url": "https://leetcode.cn/problems/walking-robot-simulation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 94 Problem 2"}, {"ID": 875, "Title": "Koko Eating Bananas", "TitleCn": "\u7231\u5403\u9999\u8549\u7684\u73c2\u73c2", "Url": "https://leetcode.cn/problems/koko-eating-bananas/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 94 Problem 3"}, {"ID": 876, "Title": "Middle of the Linked List", "TitleCn": "\u94fe\u8868\u7684\u4e2d\u95f4\u7ed3\u70b9", "Url": "https://leetcode.cn/problems/middle-of-the-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 95 Problem 1"}, {"ID": 877, "Title": "Stone Game", "TitleCn": "\u77f3\u5b50\u6e38\u620f", "Url": "https://leetcode.cn/problems/stone-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 95 Problem 2"}, {"ID": 878, "Title": "Nth Magical Number", "TitleCn": "\u7b2c N \u4e2a\u795e\u5947\u6570\u5b57", "Url": "https://leetcode.cn/problems/nth-magical-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 95 Problem 3"}, {"ID": 879, "Title": "Profitable Schemes", "TitleCn": "\u76c8\u5229\u8ba1\u5212", "Url": "https://leetcode.cn/problems/profitable-schemes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 95 Problem 4"}, {"ID": 880, "Title": "Decoded String at Index", "TitleCn": "\u7d22\u5f15\u5904\u7684\u89e3\u7801\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/decoded-string-at-index/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 96 Problem 3"}, {"ID": 881, "Title": "Boats to Save People", "TitleCn": "\u6551\u751f\u8247", "Url": "https://leetcode.cn/problems/boats-to-save-people/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 96 Problem 2"}, {"ID": 882, "Title": "Reachable Nodes In Subdivided Graph", "TitleCn": "\u7ec6\u5206\u56fe\u4e2d\u7684\u53ef\u5230\u8fbe\u7ed3\u70b9", "Url": "https://leetcode.cn/problems/reachable-nodes-in-subdivided-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 96 Problem 4"}, {"ID": 883, "Title": "Projection Area of 3D Shapes", "TitleCn": "\u4e09\u7ef4\u5f62\u4f53\u6295\u5f71\u9762\u79ef", "Url": "https://leetcode.cn/problems/projection-area-of-3d-shapes/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 96 Problem 1"}, {"ID": 884, "Title": "Uncommon Words from Two Sentences", "TitleCn": "\u4e24\u53e5\u8bdd\u4e2d\u7684\u4e0d\u5e38\u89c1\u5355\u8bcd", "Url": "https://leetcode.cn/problems/uncommon-words-from-two-sentences/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 97 Problem 1"}, {"ID": 885, "Title": "Spiral Matrix III", "TitleCn": "\u87ba\u65cb\u77e9\u9635 III", "Url": "https://leetcode.cn/problems/spiral-matrix-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 97 Problem 2"}, {"ID": 886, "Title": "Possible Bipartition", "TitleCn": "\u53ef\u80fd\u7684\u4e8c\u5206\u6cd5", "Url": "https://leetcode.cn/problems/possible-bipartition/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 97 Problem 3"}, {"ID": 887, "Title": "Super Egg Drop", "TitleCn": "\u9e21\u86cb\u6389\u843d", "Url": "https://leetcode.cn/problems/super-egg-drop/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 97 Problem 4"}, {"ID": 888, "Title": "Fair Candy Swap", "TitleCn": "\u516c\u5e73\u7684\u7cd6\u679c\u4ea4\u6362", "Url": "https://leetcode.cn/problems/fair-candy-swap/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 98 Problem 1"}, {"ID": 889, "Title": "Construct Binary Tree from Preorder and Postorder Traversal", "TitleCn": "\u6839\u636e\u524d\u5e8f\u548c\u540e\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-postorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 98 Problem 3"}, {"ID": 890, "Title": "Find and Replace Pattern", "TitleCn": "\u67e5\u627e\u548c\u66ff\u6362\u6a21\u5f0f", "Url": "https://leetcode.cn/problems/find-and-replace-pattern/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 98 Problem 2"}, {"ID": 891, "Title": "Sum of Subsequence Widths", "TitleCn": "\u5b50\u5e8f\u5217\u5bbd\u5ea6\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-subsequence-widths/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 98 Problem 4"}, {"ID": 892, "Title": "Surface Area of 3D Shapes", "TitleCn": "\u4e09\u7ef4\u5f62\u4f53\u7684\u8868\u9762\u79ef", "Url": "https://leetcode.cn/problems/surface-area-of-3d-shapes/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 99 Problem 1"}, {"ID": 893, "Title": "Groups of Special-Equivalent Strings", "TitleCn": "\u7279\u6b8a\u7b49\u4ef7\u5b57\u7b26\u4e32\u7ec4", "Url": "https://leetcode.cn/problems/groups-of-special-equivalent-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 99 Problem 3"}, {"ID": 894, "Title": "All Possible Full Binary Trees", "TitleCn": "\u6240\u6709\u53ef\u80fd\u7684\u771f\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/all-possible-full-binary-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 99 Problem 2"}, {"ID": 895, "Title": "Maximum Frequency Stack", "TitleCn": "\u6700\u5927\u9891\u7387\u6808", "Url": "https://leetcode.cn/problems/maximum-frequency-stack/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 99 Problem 4"}, {"ID": 896, "Title": "Monotonic Array", "TitleCn": "\u5355\u8c03\u6570\u5217", "Url": "https://leetcode.cn/problems/monotonic-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 100 Problem 1"}, {"ID": 897, "Title": "Increasing Order Search Tree", "TitleCn": "\u9012\u589e\u987a\u5e8f\u67e5\u627e\u6811", "Url": "https://leetcode.cn/problems/increasing-order-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 100 Problem 3"}, {"ID": 898, "Title": "Bitwise ORs of Subarrays", "TitleCn": "\u5b50\u6570\u7ec4\u6309\u4f4d\u6216\u64cd\u4f5c", "Url": "https://leetcode.cn/problems/bitwise-ors-of-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 100 Problem 2"}, {"ID": 899, "Title": "Orderly Queue", "TitleCn": "\u6709\u5e8f\u961f\u5217", "Url": "https://leetcode.cn/problems/orderly-queue/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 100 Problem 4"}, {"ID": 900, "Title": "RLE Iterator", "TitleCn": "RLE \u8fed\u4ee3\u5668", "Url": "https://leetcode.cn/problems/rle-iterator/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 101 Problem 1"}, {"ID": 901, "Title": "Online Stock Span", "TitleCn": "\u80a1\u7968\u4ef7\u683c\u8de8\u5ea6", "Url": "https://leetcode.cn/problems/online-stock-span/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 101 Problem 2"}, {"ID": 902, "Title": "Numbers At Most N Given Digit Set", "TitleCn": "\u6700\u5927\u4e3a N \u7684\u6570\u5b57\u7ec4\u5408", "Url": "https://leetcode.cn/problems/numbers-at-most-n-given-digit-set/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 101 Problem 3"}, {"ID": 903, "Title": "Valid Permutations for DI Sequence", "TitleCn": "DI \u5e8f\u5217\u7684\u6709\u6548\u6392\u5217", "Url": "https://leetcode.cn/problems/valid-permutations-for-di-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 101 Problem 4"}, {"ID": 904, "Title": "Fruit Into Baskets", "TitleCn": "\u6c34\u679c\u6210\u7bee", "Url": "https://leetcode.cn/problems/fruit-into-baskets/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 102 Problem 2"}, {"ID": 905, "Title": "Sort Array By Parity", "TitleCn": "\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/sort-array-by-parity/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 102 Problem 1"}, {"ID": 906, "Title": "Super Palindromes", "TitleCn": "\u8d85\u7ea7\u56de\u6587\u6570", "Url": "https://leetcode.cn/problems/super-palindromes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 102 Problem 4"}, {"ID": 907, "Title": "Sum of Subarray Minimums", "TitleCn": "\u5b50\u6570\u7ec4\u7684\u6700\u5c0f\u503c\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-subarray-minimums/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 102 Problem 3"}, {"ID": 908, "Title": "Smallest Range I", "TitleCn": "\u6700\u5c0f\u5dee\u503c I", "Url": "https://leetcode.cn/problems/smallest-range-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 103 Problem 1"}, {"ID": 909, "Title": "Snakes and Ladders", "TitleCn": "\u86c7\u68af\u68cb", "Url": "https://leetcode.cn/problems/snakes-and-ladders/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 103 Problem 2"}, {"ID": 910, "Title": "Smallest Range II", "TitleCn": "\u6700\u5c0f\u5dee\u503c II", "Url": "https://leetcode.cn/problems/smallest-range-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 103 Problem 3"}, {"ID": 911, "Title": "Online Election", "TitleCn": "\u5728\u7ebf\u9009\u4e3e", "Url": "https://leetcode.cn/problems/online-election/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 103 Problem 4"}, {"ID": 912, "Title": "Sort an Array", "TitleCn": "\u6392\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/sort-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 913, "Title": "Cat and Mouse", "TitleCn": "\u732b\u548c\u8001\u9f20", "Url": "https://leetcode.cn/problems/cat-and-mouse/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 104 Problem 4"}, {"ID": 914, "Title": "X of a Kind in a Deck of Cards", "TitleCn": "\u5361\u724c\u5206\u7ec4", "Url": "https://leetcode.cn/problems/x-of-a-kind-in-a-deck-of-cards/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 104 Problem 1"}, {"ID": 915, "Title": "Partition Array into Disjoint Intervals", "TitleCn": "\u5206\u5272\u6570\u7ec4", "Url": "https://leetcode.cn/problems/partition-array-into-disjoint-intervals/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 104 Problem 2"}, {"ID": 916, "Title": "Word Subsets", "TitleCn": "\u5355\u8bcd\u5b50\u96c6", "Url": "https://leetcode.cn/problems/word-subsets/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 104 Problem 3"}, {"ID": 917, "Title": "Reverse Only Letters", "TitleCn": "\u4ec5\u4ec5\u53cd\u8f6c\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/reverse-only-letters/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 105 Problem 1"}, {"ID": 918, "Title": "Maximum Sum Circular Subarray", "TitleCn": "\u73af\u5f62\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-circular-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 105 Problem 2"}, {"ID": 919, "Title": "Complete Binary Tree Inserter", "TitleCn": "\u5b8c\u5168\u4e8c\u53c9\u6811\u63d2\u5165\u5668", "Url": "https://leetcode.cn/problems/complete-binary-tree-inserter/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 105 Problem 3"}, {"ID": 920, "Title": "Number of Music Playlists", "TitleCn": "\u64ad\u653e\u5217\u8868\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-music-playlists/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 105 Problem 4"}, {"ID": 921, "Title": "Minimum Add to Make Parentheses Valid", "TitleCn": "\u4f7f\u62ec\u53f7\u6709\u6548\u7684\u6700\u5c11\u6dfb\u52a0", "Url": "https://leetcode.cn/problems/minimum-add-to-make-parentheses-valid/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 106 Problem 2"}, {"ID": 922, "Title": "Sort Array By Parity II", "TitleCn": "\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/sort-array-by-parity-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 106 Problem 1"}, {"ID": 923, "Title": "3Sum With Multiplicity", "TitleCn": "\u4e09\u6570\u4e4b\u548c\u7684\u591a\u79cd\u53ef\u80fd", "Url": "https://leetcode.cn/problems/3sum-with-multiplicity/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 106 Problem 3"}, {"ID": 924, "Title": "Minimize Malware Spread", "TitleCn": "\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad", "Url": "https://leetcode.cn/problems/minimize-malware-spread/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 106 Problem 4"}, {"ID": 925, "Title": "Long Pressed Name", "TitleCn": "\u957f\u6309\u952e\u5165", "Url": "https://leetcode.cn/problems/long-pressed-name/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 107 Problem 1"}, {"ID": 926, "Title": "Flip String to Monotone Increasing", "TitleCn": "\u5c06\u5b57\u7b26\u4e32\u7ffb\u8f6c\u5230\u5355\u8c03\u9012\u589e", "Url": "https://leetcode.cn/problems/flip-string-to-monotone-increasing/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 107 Problem 2"}, {"ID": 927, "Title": "Three Equal Parts", "TitleCn": "\u4e09\u7b49\u5206", "Url": "https://leetcode.cn/problems/three-equal-parts/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 107 Problem 3"}, {"ID": 928, "Title": "Minimize Malware Spread II", "TitleCn": "\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad II", "Url": "https://leetcode.cn/problems/minimize-malware-spread-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 107 Problem 4"}, {"ID": 929, "Title": "Unique Email Addresses", "TitleCn": "\u72ec\u7279\u7684\u7535\u5b50\u90ae\u4ef6\u5730\u5740", "Url": "https://leetcode.cn/problems/unique-email-addresses/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 108 Problem 1"}, {"ID": 930, "Title": "Binary Subarrays With Sum", "TitleCn": "\u548c\u76f8\u540c\u7684\u4e8c\u5143\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/binary-subarrays-with-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 108 Problem 2"}, {"ID": 931, "Title": "Minimum Falling Path Sum", "TitleCn": "\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c", "Url": "https://leetcode.cn/problems/minimum-falling-path-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 108 Problem 3"}, {"ID": 932, "Title": "Beautiful Array", "TitleCn": "\u6f02\u4eae\u6570\u7ec4", "Url": "https://leetcode.cn/problems/beautiful-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 108 Problem 4"}, {"ID": 933, "Title": "Number of Recent Calls", "TitleCn": "\u6700\u8fd1\u7684\u8bf7\u6c42\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-recent-calls/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 109 Problem 1"}, {"ID": 934, "Title": "Shortest Bridge", "TitleCn": "\u6700\u77ed\u7684\u6865", "Url": "https://leetcode.cn/problems/shortest-bridge/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 109 Problem 3"}, {"ID": 935, "Title": "Knight Dialer", "TitleCn": "\u9a91\u58eb\u62e8\u53f7\u5668", "Url": "https://leetcode.cn/problems/knight-dialer/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 109 Problem 2"}, {"ID": 936, "Title": "Stamping The Sequence", "TitleCn": "\u6233\u5370\u5e8f\u5217", "Url": "https://leetcode.cn/problems/stamping-the-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 109 Problem 4"}, {"ID": 937, "Title": "Reorder Data in Log Files", "TitleCn": "\u91cd\u65b0\u6392\u5217\u65e5\u5fd7\u6587\u4ef6", "Url": "https://leetcode.cn/problems/reorder-data-in-log-files/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 110 Problem 1"}, {"ID": 938, "Title": "Range Sum of BST", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u8303\u56f4\u548c", "Url": "https://leetcode.cn/problems/range-sum-of-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 110 Problem 2"}, {"ID": 939, "Title": "Minimum Area Rectangle", "TitleCn": "\u6700\u5c0f\u9762\u79ef\u77e9\u5f62", "Url": "https://leetcode.cn/problems/minimum-area-rectangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 110 Problem 3"}, {"ID": 940, "Title": "Distinct Subsequences II", "TitleCn": "\u4e0d\u540c\u7684\u5b50\u5e8f\u5217 II", "Url": "https://leetcode.cn/problems/distinct-subsequences-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 110 Problem 4"}, {"ID": 941, "Title": "Valid Mountain Array", "TitleCn": "\u6709\u6548\u7684\u5c71\u8109\u6570\u7ec4", "Url": "https://leetcode.cn/problems/valid-mountain-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 111 Problem 1"}, {"ID": 942, "Title": "DI String Match", "TitleCn": "\u589e\u51cf\u5b57\u7b26\u4e32\u5339\u914d", "Url": "https://leetcode.cn/problems/di-string-match/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 111 Problem 3"}, {"ID": 943, "Title": "Find the Shortest Superstring", "TitleCn": "\u6700\u77ed\u8d85\u7ea7\u4e32", "Url": "https://leetcode.cn/problems/find-the-shortest-superstring/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 111 Problem 4"}, {"ID": 944, "Title": "Delete Columns to Make Sorted", "TitleCn": "\u5220\u5217\u9020\u5e8f", "Url": "https://leetcode.cn/problems/delete-columns-to-make-sorted/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 111 Problem 2"}, {"ID": 945, "Title": "Minimum Increment to Make Array Unique", "TitleCn": "\u4f7f\u6570\u7ec4\u552f\u4e00\u7684\u6700\u5c0f\u589e\u91cf", "Url": "https://leetcode.cn/problems/minimum-increment-to-make-array-unique/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 112 Problem 1"}, {"ID": 946, "Title": "Validate Stack Sequences", "TitleCn": "\u9a8c\u8bc1\u6808\u5e8f\u5217", "Url": "https://leetcode.cn/problems/validate-stack-sequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 112 Problem 2"}, {"ID": 947, "Title": "Most Stones Removed with Same Row or Column", "TitleCn": "\u79fb\u9664\u6700\u591a\u7684\u540c\u884c\u6216\u540c\u5217\u77f3\u5934", "Url": "https://leetcode.cn/problems/most-stones-removed-with-same-row-or-column/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 112 Problem 3"}, {"ID": 948, "Title": "Bag of Tokens", "TitleCn": "\u4ee4\u724c\u653e\u7f6e", "Url": "https://leetcode.cn/problems/bag-of-tokens/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 112 Problem 4"}, {"ID": 949, "Title": "Largest Time for Given Digits", "TitleCn": "\u7ed9\u5b9a\u6570\u5b57\u80fd\u7ec4\u6210\u7684\u6700\u5927\u65f6\u95f4", "Url": "https://leetcode.cn/problems/largest-time-for-given-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 113 Problem 1"}, {"ID": 950, "Title": "Reveal Cards In Increasing Order", "TitleCn": "\u6309\u9012\u589e\u987a\u5e8f\u663e\u793a\u5361\u724c", "Url": "https://leetcode.cn/problems/reveal-cards-in-increasing-order/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 113 Problem 3"}, {"ID": 951, "Title": "Flip Equivalent Binary Trees", "TitleCn": "\u7ffb\u8f6c\u7b49\u4ef7\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/flip-equivalent-binary-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 113 Problem 2"}, {"ID": 952, "Title": "Largest Component Size by Common Factor", "TitleCn": "\u6309\u516c\u56e0\u6570\u8ba1\u7b97\u6700\u5927\u7ec4\u4ef6\u5927\u5c0f", "Url": "https://leetcode.cn/problems/largest-component-size-by-common-factor/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 113 Problem 4"}, {"ID": 953, "Title": "Verifying an Alien Dictionary", "TitleCn": "\u9a8c\u8bc1\u5916\u661f\u8bed\u8bcd\u5178", "Url": "https://leetcode.cn/problems/verifying-an-alien-dictionary/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 114 Problem 1"}, {"ID": 954, "Title": "Array of Doubled Pairs", "TitleCn": "\u4e8c\u500d\u6570\u5bf9\u6570\u7ec4", "Url": "https://leetcode.cn/problems/array-of-doubled-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 114 Problem 2"}, {"ID": 955, "Title": "Delete Columns to Make Sorted II", "TitleCn": "\u5220\u5217\u9020\u5e8f II", "Url": "https://leetcode.cn/problems/delete-columns-to-make-sorted-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 114 Problem 3"}, {"ID": 956, "Title": "Tallest Billboard", "TitleCn": "\u6700\u9ad8\u7684\u5e7f\u544a\u724c", "Url": "https://leetcode.cn/problems/tallest-billboard/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 114 Problem 4"}, {"ID": 957, "Title": "Prison Cells After N Days", "TitleCn": "N \u5929\u540e\u7684\u7262\u623f", "Url": "https://leetcode.cn/problems/prison-cells-after-n-days/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 115 Problem 1"}, {"ID": 958, "Title": "Check Completeness of a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5b8c\u5168\u6027\u68c0\u9a8c", "Url": "https://leetcode.cn/problems/check-completeness-of-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 115 Problem 2"}, {"ID": 959, "Title": "Regions Cut By Slashes", "TitleCn": "\u7531\u659c\u6760\u5212\u5206\u533a\u57df", "Url": "https://leetcode.cn/problems/regions-cut-by-slashes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 115 Problem 3"}, {"ID": 960, "Title": "Delete Columns to Make Sorted III", "TitleCn": "\u5220\u5217\u9020\u5e8f III", "Url": "https://leetcode.cn/problems/delete-columns-to-make-sorted-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 115 Problem 4"}, {"ID": 961, "Title": "N-Repeated Element in Size 2N Array", "TitleCn": "\u5728\u957f\u5ea6 2N \u7684\u6570\u7ec4\u4e2d\u627e\u51fa\u91cd\u590d N \u6b21\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/n-repeated-element-in-size-2n-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 116 Problem 1"}, {"ID": 962, "Title": "Maximum Width Ramp", "TitleCn": "\u6700\u5927\u5bbd\u5ea6\u5761", "Url": "https://leetcode.cn/problems/maximum-width-ramp/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 116 Problem 2"}, {"ID": 963, "Title": "Minimum Area Rectangle II", "TitleCn": "\u6700\u5c0f\u9762\u79ef\u77e9\u5f62 II", "Url": "https://leetcode.cn/problems/minimum-area-rectangle-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 116 Problem 3"}, {"ID": 964, "Title": "Least Operators to Express Number", "TitleCn": "\u8868\u793a\u6570\u5b57\u7684\u6700\u5c11\u8fd0\u7b97\u7b26", "Url": "https://leetcode.cn/problems/least-operators-to-express-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 116 Problem 4"}, {"ID": 965, "Title": "Univalued Binary Tree", "TitleCn": "\u5355\u503c\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/univalued-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 117 Problem 1"}, {"ID": 966, "Title": "Vowel Spellchecker", "TitleCn": "\u5143\u97f3\u62fc\u5199\u68c0\u67e5\u5668", "Url": "https://leetcode.cn/problems/vowel-spellchecker/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 117 Problem 3"}, {"ID": 967, "Title": "Numbers With Same Consecutive Differences", "TitleCn": "\u8fde\u7eed\u5dee\u76f8\u540c\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/numbers-with-same-consecutive-differences/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 117 Problem 2"}, {"ID": 968, "Title": "Binary Tree Cameras", "TitleCn": "\u76d1\u63a7\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/binary-tree-cameras/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 117 Problem 4"}, {"ID": 969, "Title": "Pancake Sorting", "TitleCn": "\u714e\u997c\u6392\u5e8f", "Url": "https://leetcode.cn/problems/pancake-sorting/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 118 Problem 2"}, {"ID": 970, "Title": "Powerful Integers", "TitleCn": "\u5f3a\u6574\u6570", "Url": "https://leetcode.cn/problems/powerful-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 118 Problem 1"}, {"ID": 971, "Title": "Flip Binary Tree To Match Preorder Traversal", "TitleCn": "\u7ffb\u8f6c\u4e8c\u53c9\u6811\u4ee5\u5339\u914d\u5148\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/flip-binary-tree-to-match-preorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 118 Problem 3"}, {"ID": 972, "Title": "Equal Rational Numbers", "TitleCn": "\u76f8\u7b49\u7684\u6709\u7406\u6570", "Url": "https://leetcode.cn/problems/equal-rational-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 118 Problem 4"}, {"ID": 973, "Title": "K Closest Points to Origin", "TitleCn": "\u6700\u63a5\u8fd1\u539f\u70b9\u7684 K \u4e2a\u70b9", "Url": "https://leetcode.cn/problems/k-closest-points-to-origin/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 119 Problem 1"}, {"ID": 974, "Title": "Subarray Sums Divisible by K", "TitleCn": "\u548c\u53ef\u88ab K \u6574\u9664\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/subarray-sums-divisible-by-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 119 Problem 3"}, {"ID": 975, "Title": "Odd Even Jump", "TitleCn": "\u5947\u5076\u8df3", "Url": "https://leetcode.cn/problems/odd-even-jump/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 119 Problem 4"}, {"ID": 976, "Title": "Largest Perimeter Triangle", "TitleCn": "\u4e09\u89d2\u5f62\u7684\u6700\u5927\u5468\u957f", "Url": "https://leetcode.cn/problems/largest-perimeter-triangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 119 Problem 2"}, {"ID": 977, "Title": "Squares of a Sorted Array", "TitleCn": "\u6709\u5e8f\u6570\u7ec4\u7684\u5e73\u65b9", "Url": "https://leetcode.cn/problems/squares-of-a-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 120 Problem 1"}, {"ID": 978, "Title": "Longest Turbulent Subarray", "TitleCn": "\u6700\u957f\u6e4d\u6d41\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-turbulent-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 120 Problem 2"}, {"ID": 979, "Title": "Distribute Coins in Binary Tree", "TitleCn": "\u5728\u4e8c\u53c9\u6811\u4e2d\u5206\u914d\u786c\u5e01", "Url": "https://leetcode.cn/problems/distribute-coins-in-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 120 Problem 3"}, {"ID": 980, "Title": "Unique Paths III", "TitleCn": "\u4e0d\u540c\u8def\u5f84 III", "Url": "https://leetcode.cn/problems/unique-paths-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 120 Problem 4"}, {"ID": 981, "Title": "Time Based Key-Value Store", "TitleCn": "\u57fa\u4e8e\u65f6\u95f4\u7684\u952e\u503c\u5b58\u50a8", "Url": "https://leetcode.cn/problems/time-based-key-value-store/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 121 Problem 2"}, {"ID": 982, "Title": "Triples with Bitwise AND Equal To Zero", "TitleCn": "\u6309\u4f4d\u4e0e\u4e3a\u96f6\u7684\u4e09\u5143\u7ec4", "Url": "https://leetcode.cn/problems/triples-with-bitwise-and-equal-to-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 121 Problem 4"}, {"ID": 983, "Title": "Minimum Cost For Tickets", "TitleCn": "\u6700\u4f4e\u7968\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-for-tickets/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 121 Problem 3"}, {"ID": 984, "Title": "String Without AAA or BBB", "TitleCn": "\u4e0d\u542b AAA \u6216 BBB \u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/string-without-aaa-or-bbb/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 121 Problem 1"}, {"ID": 985, "Title": "Sum of Even Numbers After Queries", "TitleCn": "\u67e5\u8be2\u540e\u7684\u5076\u6570\u548c", "Url": "https://leetcode.cn/problems/sum-of-even-numbers-after-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 122 Problem 1"}, {"ID": 986, "Title": "Interval List Intersections", "TitleCn": "\u533a\u95f4\u5217\u8868\u7684\u4ea4\u96c6", "Url": "https://leetcode.cn/problems/interval-list-intersections/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 122 Problem 3"}, {"ID": 987, "Title": "Vertical Order Traversal of a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5782\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/vertical-order-traversal-of-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 122 Problem 4"}, {"ID": 988, "Title": "Smallest String Starting From Leaf", "TitleCn": "\u4ece\u53f6\u7ed3\u70b9\u5f00\u59cb\u7684\u6700\u5c0f\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/smallest-string-starting-from-leaf/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 122 Problem 2"}, {"ID": 989, "Title": "Add to Array-Form of Integer", "TitleCn": "\u6570\u7ec4\u5f62\u5f0f\u7684\u6574\u6570\u52a0\u6cd5", "Url": "https://leetcode.cn/problems/add-to-array-form-of-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 123 Problem 1"}, {"ID": 990, "Title": "Satisfiability of Equality Equations", "TitleCn": "\u7b49\u5f0f\u65b9\u7a0b\u7684\u53ef\u6ee1\u8db3\u6027", "Url": "https://leetcode.cn/problems/satisfiability-of-equality-equations/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 123 Problem 2"}, {"ID": 991, "Title": "Broken Calculator", "TitleCn": "\u574f\u4e86\u7684\u8ba1\u7b97\u5668", "Url": "https://leetcode.cn/problems/broken-calculator/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 123 Problem 3"}, {"ID": 992, "Title": "Subarrays with K Different Integers", "TitleCn": "K \u4e2a\u4e0d\u540c\u6574\u6570\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/subarrays-with-k-different-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 123 Problem 4"}, {"ID": 993, "Title": "Cousins in Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5802\u5144\u5f1f\u8282\u70b9", "Url": "https://leetcode.cn/problems/cousins-in-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 124 Problem 1"}, {"ID": 994, "Title": "Rotting Oranges", "TitleCn": "\u8150\u70c2\u7684\u6a58\u5b50", "Url": "https://leetcode.cn/problems/rotting-oranges/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 124 Problem 2"}, {"ID": 995, "Title": "Minimum Number of K Consecutive Bit Flips", "TitleCn": "K \u8fde\u7eed\u4f4d\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-k-consecutive-bit-flips/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 124 Problem 3"}, {"ID": 996, "Title": "Number of Squareful Arrays", "TitleCn": "\u6b63\u65b9\u5f62\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-squareful-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 124 Problem 4"}, {"ID": 997, "Title": "Find the Town Judge", "TitleCn": "\u627e\u5230\u5c0f\u9547\u7684\u6cd5\u5b98", "Url": "https://leetcode.cn/problems/find-the-town-judge/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 125 Problem 1"}, {"ID": 998, "Title": "Maximum Binary Tree II", "TitleCn": "\u6700\u5927\u4e8c\u53c9\u6811 II", "Url": "https://leetcode.cn/problems/maximum-binary-tree-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 125 Problem 3"}, {"ID": 999, "Title": "Available Captures for Rook", "TitleCn": "\u53ef\u4ee5\u88ab\u4e00\u6b65\u6355\u83b7\u7684\u68cb\u5b50\u6570", "Url": "https://leetcode.cn/problems/available-captures-for-rook/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 125 Problem 2"}, {"ID": 1000, "Title": "Minimum Cost to Merge Stones", "TitleCn": "\u5408\u5e76\u77f3\u5934\u7684\u6700\u4f4e\u6210\u672c", "Url": "https://leetcode.cn/problems/minimum-cost-to-merge-stones/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 126 Problem 4"}, {"ID": 1001, "Title": "Grid Illumination", "TitleCn": "\u7f51\u683c\u7167\u660e", "Url": "https://leetcode.cn/problems/grid-illumination/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 125 Problem 4"}, {"ID": 1002, "Title": "Find Common Characters", "TitleCn": "\u67e5\u627e\u5e38\u7528\u5b57\u7b26", "Url": "https://leetcode.cn/problems/find-common-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 126 Problem 1"}, {"ID": 1003, "Title": "Check If Word Is Valid After Substitutions", "TitleCn": "\u68c0\u67e5\u66ff\u6362\u540e\u7684\u8bcd\u662f\u5426\u6709\u6548", "Url": "https://leetcode.cn/problems/check-if-word-is-valid-after-substitutions/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 126 Problem 2"}, {"ID": 1004, "Title": "Max Consecutive Ones III", "TitleCn": "\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 III", "Url": "https://leetcode.cn/problems/max-consecutive-ones-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 126 Problem 3"}, {"ID": 1005, "Title": "Maximize Sum Of Array After K Negations", "TitleCn": "K \u6b21\u53d6\u53cd\u540e\u6700\u5927\u5316\u7684\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/maximize-sum-of-array-after-k-negations/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 127 Problem 1"}, {"ID": 1006, "Title": "Clumsy Factorial", "TitleCn": "\u7b28\u9636\u4e58", "Url": "https://leetcode.cn/problems/clumsy-factorial/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 127 Problem 2"}, {"ID": 1007, "Title": "Minimum Domino Rotations For Equal Row", "TitleCn": "\u884c\u76f8\u7b49\u7684\u6700\u5c11\u591a\u7c73\u8bfa\u65cb\u8f6c", "Url": "https://leetcode.cn/problems/minimum-domino-rotations-for-equal-row/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 127 Problem 3"}, {"ID": 1008, "Title": "Construct Binary Search Tree from Preorder Traversal", "TitleCn": "\u524d\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/construct-binary-search-tree-from-preorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 127 Problem 4"}, {"ID": 1009, "Title": "Complement of Base 10 Integer", "TitleCn": "\u5341\u8fdb\u5236\u6574\u6570\u7684\u53cd\u7801", "Url": "https://leetcode.cn/problems/complement-of-base-10-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 128 Problem 1"}, {"ID": 1010, "Title": "Pairs of Songs With Total Durations Divisible by 60", "TitleCn": "\u603b\u6301\u7eed\u65f6\u95f4\u53ef\u88ab 60 \u6574\u9664\u7684\u6b4c\u66f2", "Url": "https://leetcode.cn/problems/pairs-of-songs-with-total-durations-divisible-by-60/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 128 Problem 2"}, {"ID": 1011, "Title": "Capacity To Ship Packages Within D Days", "TitleCn": "\u5728 D \u5929\u5185\u9001\u8fbe\u5305\u88f9\u7684\u80fd\u529b", "Url": "https://leetcode.cn/problems/capacity-to-ship-packages-within-d-days/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 128 Problem 3"}, {"ID": 1012, "Title": "Numbers With Repeated Digits", "TitleCn": "\u81f3\u5c11\u6709 1 \u4f4d\u91cd\u590d\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/numbers-with-repeated-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 128 Problem 4"}, {"ID": 1013, "Title": "Partition Array Into Three Parts With Equal Sum", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u6210\u548c\u76f8\u7b49\u7684\u4e09\u4e2a\u90e8\u5206", "Url": "https://leetcode.cn/problems/partition-array-into-three-parts-with-equal-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 129 Problem 1"}, {"ID": 1014, "Title": "Best Sightseeing Pair", "TitleCn": "\u6700\u4f73\u89c2\u5149\u7ec4\u5408", "Url": "https://leetcode.cn/problems/best-sightseeing-pair/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 129 Problem 3"}, {"ID": 1015, "Title": "Smallest Integer Divisible by K", "TitleCn": "\u53ef\u88ab K \u6574\u9664\u7684\u6700\u5c0f\u6574\u6570", "Url": "https://leetcode.cn/problems/smallest-integer-divisible-by-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 129 Problem 2"}, {"ID": 1016, "Title": "Binary String With Substrings Representing 1 To N", "TitleCn": "\u5b50\u4e32\u80fd\u8868\u793a\u4ece 1 \u5230 N \u6570\u5b57\u7684\u4e8c\u8fdb\u5236\u4e32", "Url": "https://leetcode.cn/problems/binary-string-with-substrings-representing-1-to-n/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 129 Problem 4"}, {"ID": 1017, "Title": "Convert to Base -2", "TitleCn": "\u8d1f\u4e8c\u8fdb\u5236\u8f6c\u6362", "Url": "https://leetcode.cn/problems/convert-to-base-2/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 130 Problem 2"}, {"ID": 1018, "Title": "Binary Prefix Divisible By 5", "TitleCn": "\u53ef\u88ab 5 \u6574\u9664\u7684\u4e8c\u8fdb\u5236\u524d\u7f00", "Url": "https://leetcode.cn/problems/binary-prefix-divisible-by-5/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 130 Problem 1"}, {"ID": 1019, "Title": "Next Greater Node In Linked List", "TitleCn": "\u94fe\u8868\u4e2d\u7684\u4e0b\u4e00\u4e2a\u66f4\u5927\u8282\u70b9", "Url": "https://leetcode.cn/problems/next-greater-node-in-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 130 Problem 3"}, {"ID": 1020, "Title": "Number of Enclaves", "TitleCn": "\u98de\u5730\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-enclaves/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 130 Problem 4"}, {"ID": 1021, "Title": "Remove Outermost Parentheses", "TitleCn": "\u5220\u9664\u6700\u5916\u5c42\u7684\u62ec\u53f7", "Url": "https://leetcode.cn/problems/remove-outermost-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 131 Problem 1"}, {"ID": 1022, "Title": "Sum of Root To Leaf Binary Numbers", "TitleCn": "\u4ece\u6839\u5230\u53f6\u7684\u4e8c\u8fdb\u5236\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-root-to-leaf-binary-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 131 Problem 2"}, {"ID": 1023, "Title": "Camelcase Matching", "TitleCn": "\u9a7c\u5cf0\u5f0f\u5339\u914d", "Url": "https://leetcode.cn/problems/camelcase-matching/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 131 Problem 3"}, {"ID": 1024, "Title": "Video Stitching", "TitleCn": "\u89c6\u9891\u62fc\u63a5", "Url": "https://leetcode.cn/problems/video-stitching/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 131 Problem 4"}, {"ID": 1025, "Title": "Divisor Game", "TitleCn": "\u9664\u6570\u535a\u5f08", "Url": "https://leetcode.cn/problems/divisor-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 132 Problem 1"}, {"ID": 1026, "Title": "Maximum Difference Between Node and Ancestor", "TitleCn": "\u8282\u70b9\u4e0e\u5176\u7956\u5148\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c", "Url": "https://leetcode.cn/problems/maximum-difference-between-node-and-ancestor/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 132 Problem 2"}, {"ID": 1027, "Title": "Longest Arithmetic Subsequence", "TitleCn": "\u6700\u957f\u7b49\u5dee\u6570\u5217", "Url": "https://leetcode.cn/problems/longest-arithmetic-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 132 Problem 3"}, {"ID": 1028, "Title": "Recover a Tree From Preorder Traversal", "TitleCn": "\u4ece\u5148\u5e8f\u904d\u5386\u8fd8\u539f\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/recover-a-tree-from-preorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 132 Problem 4"}, {"ID": 1029, "Title": "Two City Scheduling", "TitleCn": "\u4e24\u5730\u8c03\u5ea6", "Url": "https://leetcode.cn/problems/two-city-scheduling/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 133 Problem 1"}, {"ID": 1030, "Title": "Matrix Cells in Distance Order", "TitleCn": "\u8ddd\u79bb\u987a\u5e8f\u6392\u5217\u77e9\u9635\u5355\u5143\u683c", "Url": "https://leetcode.cn/problems/matrix-cells-in-distance-order/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 133 Problem 2"}, {"ID": 1031, "Title": "Maximum Sum of Two Non-Overlapping Subarrays", "TitleCn": "\u4e24\u4e2a\u975e\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-of-two-non-overlapping-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 133 Problem 3"}, {"ID": 1032, "Title": "Stream of Characters", "TitleCn": "\u5b57\u7b26\u6d41", "Url": "https://leetcode.cn/problems/stream-of-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 133 Problem 4"}, {"ID": 1033, "Title": "Moving Stones Until Consecutive", "TitleCn": "\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed", "Url": "https://leetcode.cn/problems/moving-stones-until-consecutive/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 134 Problem 1"}, {"ID": 1034, "Title": "Coloring A Border", "TitleCn": "\u8fb9\u6846\u7740\u8272", "Url": "https://leetcode.cn/problems/coloring-a-border/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 134 Problem 2"}, {"ID": 1035, "Title": "Uncrossed Lines", "TitleCn": "\u4e0d\u76f8\u4ea4\u7684\u7ebf", "Url": "https://leetcode.cn/problems/uncrossed-lines/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 134 Problem 3"}, {"ID": 1036, "Title": "Escape a Large Maze", "TitleCn": "\u9003\u79bb\u5927\u8ff7\u5bab", "Url": "https://leetcode.cn/problems/escape-a-large-maze/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 134 Problem 4"}, {"ID": 1037, "Title": "Valid Boomerang", "TitleCn": "\u6709\u6548\u7684\u56de\u65cb\u9556", "Url": "https://leetcode.cn/problems/valid-boomerang/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 135 Problem 1"}, {"ID": 1038, "Title": "Binary Search Tree to Greater Sum Tree", "TitleCn": "\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811", "Url": "https://leetcode.cn/problems/binary-search-tree-to-greater-sum-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 135 Problem 2"}, {"ID": 1039, "Title": "Minimum Score Triangulation of Polygon", "TitleCn": "\u591a\u8fb9\u5f62\u4e09\u89d2\u5256\u5206\u7684\u6700\u4f4e\u5f97\u5206", "Url": "https://leetcode.cn/problems/minimum-score-triangulation-of-polygon/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 135 Problem 3"}, {"ID": 1040, "Title": "Moving Stones Until Consecutive II", "TitleCn": "\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed II", "Url": "https://leetcode.cn/problems/moving-stones-until-consecutive-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 135 Problem 4"}, {"ID": 1041, "Title": "Robot Bounded In Circle", "TitleCn": "\u56f0\u4e8e\u73af\u4e2d\u7684\u673a\u5668\u4eba", "Url": "https://leetcode.cn/problems/robot-bounded-in-circle/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 136 Problem 1"}, {"ID": 1042, "Title": "Flower Planting With No Adjacent", "TitleCn": "\u4e0d\u90bb\u63a5\u690d\u82b1", "Url": "https://leetcode.cn/problems/flower-planting-with-no-adjacent/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 136 Problem 2"}, {"ID": 1043, "Title": "Partition Array for Maximum Sum", "TitleCn": "\u5206\u9694\u6570\u7ec4\u4ee5\u5f97\u5230\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/partition-array-for-maximum-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 136 Problem 3"}, {"ID": 1044, "Title": "Longest Duplicate Substring", "TitleCn": "\u6700\u957f\u91cd\u590d\u5b50\u4e32", "Url": "https://leetcode.cn/problems/longest-duplicate-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 136 Problem 4"}, {"ID": 1045, "Title": "Customers Who Bought All Products", "TitleCn": "\u4e70\u4e0b\u6240\u6709\u4ea7\u54c1\u7684\u5ba2\u6237", "Url": "https://leetcode.cn/problems/customers-who-bought-all-products/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1046, "Title": "Last Stone Weight", "TitleCn": "\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf", "Url": "https://leetcode.cn/problems/last-stone-weight/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 137 Problem 1"}, {"ID": 1047, "Title": "Remove All Adjacent Duplicates In String", "TitleCn": "\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879", "Url": "https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 137 Problem 2"}, {"ID": 1048, "Title": "Longest String Chain", "TitleCn": "\u6700\u957f\u5b57\u7b26\u4e32\u94fe", "Url": "https://leetcode.cn/problems/longest-string-chain/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 137 Problem 3"}, {"ID": 1049, "Title": "Last Stone Weight II", "TitleCn": "\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf II", "Url": "https://leetcode.cn/problems/last-stone-weight-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 137 Problem 4"}, {"ID": 1050, "Title": "Actors and Directors Who Cooperated At Least Three Times", "TitleCn": "\u5408\u4f5c\u8fc7\u81f3\u5c11\u4e09\u6b21\u7684\u6f14\u5458\u548c\u5bfc\u6f14", "Url": "https://leetcode.cn/problems/actors-and-directors-who-cooperated-at-least-three-times/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1051, "Title": "Height Checker", "TitleCn": "\u9ad8\u5ea6\u68c0\u67e5\u5668", "Url": "https://leetcode.cn/problems/height-checker/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 138 Problem 1"}, {"ID": 1052, "Title": "Grumpy Bookstore Owner", "TitleCn": "\u7231\u751f\u6c14\u7684\u4e66\u5e97\u8001\u677f", "Url": "https://leetcode.cn/problems/grumpy-bookstore-owner/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 138 Problem 2"}, {"ID": 1053, "Title": "Previous Permutation With One Swap", "TitleCn": "\u4ea4\u6362\u4e00\u6b21\u7684\u5148\u524d\u6392\u5217", "Url": "https://leetcode.cn/problems/previous-permutation-with-one-swap/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 138 Problem 3"}, {"ID": 1054, "Title": "Distant Barcodes", "TitleCn": "\u8ddd\u79bb\u76f8\u7b49\u7684\u6761\u5f62\u7801", "Url": "https://leetcode.cn/problems/distant-barcodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 138 Problem 4"}, {"ID": 1055, "Title": "Shortest Way to Form String", "TitleCn": "\u5f62\u6210\u5b57\u7b26\u4e32\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-way-to-form-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1056, "Title": "Confusing Number", "TitleCn": "\u6613\u6df7\u6dc6\u6570", "Url": "https://leetcode.cn/problems/confusing-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "LCP 2019 Spring Preliminary Problem 1"}, {"ID": 1057, "Title": "Campus Bikes", "TitleCn": "\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d", "Url": "https://leetcode.cn/problems/campus-bikes/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "LCP 2019 Spring Preliminary Problem 2"}, {"ID": 1058, "Title": "Minimize Rounding Error to Meet Target", "TitleCn": "\u6700\u5c0f\u5316\u820d\u5165\u8bef\u5dee\u4ee5\u6ee1\u8db3\u76ee\u6807", "Url": "https://leetcode.cn/problems/minimize-rounding-error-to-meet-target/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "LCP 2019 Spring Preliminary Problem 3"}, {"ID": 1059, "Title": "All Paths from Source Lead to Destination", "TitleCn": "\u4ece\u59cb\u70b9\u5230\u7ec8\u70b9\u7684\u6240\u6709\u8def\u5f84", "Url": "https://leetcode.cn/problems/all-paths-from-source-lead-to-destination/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "LCP 2019 Spring Preliminary Problem 4"}, {"ID": 1060, "Title": "Missing Element in Sorted Array", "TitleCn": "\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u7f3a\u5931\u5143\u7d20", "Url": "https://leetcode.cn/problems/missing-element-in-sorted-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": "LCP 2019 Spring Final Problem 1"}, {"ID": 1061, "Title": "Lexicographically Smallest Equivalent String", "TitleCn": "\u6309\u5b57\u5178\u5e8f\u6392\u5217\u6700\u5c0f\u7684\u7b49\u6548\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-smallest-equivalent-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "LCP 2019 Spring Final Problem 2"}, {"ID": 1062, "Title": "Longest Repeating Substring", "TitleCn": "\u6700\u957f\u91cd\u590d\u5b50\u4e32", "Url": "https://leetcode.cn/problems/longest-repeating-substring/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "LCP 2019 Spring Final Problem 3"}, {"ID": 1063, "Title": "Number of Valid Subarrays", "TitleCn": "\u6709\u6548\u5b50\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-valid-subarrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "LCP 2019 Spring Final Problem 4"}, {"ID": 1064, "Title": "Fixed Point", "TitleCn": "\u4e0d\u52a8\u70b9", "Url": "https://leetcode.cn/problems/fixed-point/", "Ispaid": 1, "Type": "Algorithms", "Level": 1, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 1 Problem 1"}, {"ID": 1065, "Title": "Index Pairs of a String", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u7d22\u5f15\u5bf9", "Url": "https://leetcode.cn/problems/index-pairs-of-a-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 1 Problem 2"}, {"ID": 1066, "Title": "Campus Bikes II", "TitleCn": "\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d II", "Url": "https://leetcode.cn/problems/campus-bikes-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 1 Problem 3"}, {"ID": 1067, "Title": "Digit Count in Range", "TitleCn": "\u8303\u56f4\u5185\u7684\u6570\u5b57\u8ba1\u6570", "Url": "https://leetcode.cn/problems/digit-count-in-range/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 1 Problem 4"}, {"ID": 1068, "Title": "Product Sales Analysis I", "TitleCn": "\u4ea7\u54c1\u9500\u552e\u5206\u6790 I", "Url": "https://leetcode.cn/problems/product-sales-analysis-i/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1069, "Title": "Product Sales Analysis II", "TitleCn": "\u4ea7\u54c1\u9500\u552e\u5206\u6790 II", "Url": "https://leetcode.cn/problems/product-sales-analysis-ii/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1070, "Title": "Product Sales Analysis III", "TitleCn": "\u4ea7\u54c1\u9500\u552e\u5206\u6790 III", "Url": "https://leetcode.cn/problems/product-sales-analysis-iii/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1071, "Title": "Greatest Common Divisor of Strings", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u6700\u5927\u516c\u56e0\u5b50", "Url": "https://leetcode.cn/problems/greatest-common-divisor-of-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 139 Problem 1"}, {"ID": 1072, "Title": "Flip Columns For Maximum Number of Equal Rows", "TitleCn": "\u6309\u5217\u7ffb\u8f6c\u5f97\u5230\u6700\u5927\u503c\u7b49\u884c\u6570", "Url": "https://leetcode.cn/problems/flip-columns-for-maximum-number-of-equal-rows/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 139 Problem 2"}, {"ID": 1073, "Title": "Adding Two Negabinary Numbers", "TitleCn": "\u8d1f\u4e8c\u8fdb\u5236\u6570\u76f8\u52a0", "Url": "https://leetcode.cn/problems/adding-two-negabinary-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 139 Problem 3"}, {"ID": 1074, "Title": "Number of Submatrices That Sum to Target", "TitleCn": "\u5143\u7d20\u548c\u4e3a\u76ee\u6807\u503c\u7684\u5b50\u77e9\u9635\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-submatrices-that-sum-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 139 Problem 4"}, {"ID": 1075, "Title": "Project Employees I", "TitleCn": "\u9879\u76ee\u5458\u5de5 I", "Url": "https://leetcode.cn/problems/project-employees-i/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1076, "Title": "Project Employees II", "TitleCn": "\u9879\u76ee\u5458\u5de5II", "Url": "https://leetcode.cn/problems/project-employees-ii/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1077, "Title": "Project Employees III", "TitleCn": "\u9879\u76ee\u5458\u5de5 III", "Url": "https://leetcode.cn/problems/project-employees-iii/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1078, "Title": "Occurrences After Bigram", "TitleCn": "Bigram \u5206\u8bcd", "Url": "https://leetcode.cn/problems/occurrences-after-bigram/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 140 Problem 1"}, {"ID": 1079, "Title": "Letter Tile Possibilities", "TitleCn": "\u6d3b\u5b57\u5370\u5237", "Url": "https://leetcode.cn/problems/letter-tile-possibilities/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 140 Problem 2"}, {"ID": 1080, "Title": "Insufficient Nodes in Root to Leaf Paths", "TitleCn": "\u6839\u5230\u53f6\u8def\u5f84\u4e0a\u7684\u4e0d\u8db3\u8282\u70b9", "Url": "https://leetcode.cn/problems/insufficient-nodes-in-root-to-leaf-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 140 Problem 3"}, {"ID": 1081, "Title": "Smallest Subsequence of Distinct Characters", "TitleCn": "\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u5c0f\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/smallest-subsequence-of-distinct-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 140 Problem 4"}, {"ID": 1082, "Title": "Sales Analysis I", "TitleCn": "\u9500\u552e\u5206\u6790 I ", "Url": "https://leetcode.cn/problems/sales-analysis-i/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1083, "Title": "Sales Analysis II", "TitleCn": "\u9500\u552e\u5206\u6790 II", "Url": "https://leetcode.cn/problems/sales-analysis-ii/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1084, "Title": "Sales Analysis III", "TitleCn": "\u9500\u552e\u5206\u6790III", "Url": "https://leetcode.cn/problems/sales-analysis-iii/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1085, "Title": "Sum of Digits in the Minimum Number", "TitleCn": "\u6700\u5c0f\u5143\u7d20\u5404\u6570\u4f4d\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-digits-in-the-minimum-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 2 Problem 1"}, {"ID": 1086, "Title": "High Five", "TitleCn": "\u524d\u4e94\u79d1\u7684\u5747\u5206", "Url": "https://leetcode.cn/problems/high-five/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 2 Problem 2"}, {"ID": 1087, "Title": "Brace Expansion", "TitleCn": "\u82b1\u62ec\u53f7\u5c55\u5f00", "Url": "https://leetcode.cn/problems/brace-expansion/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 2 Problem 3"}, {"ID": 1088, "Title": "Confusing Number II", "TitleCn": "\u6613\u6df7\u6dc6\u6570 II", "Url": "https://leetcode.cn/problems/confusing-number-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 2 Problem 4"}, {"ID": 1089, "Title": "Duplicate Zeros", "TitleCn": "\u590d\u5199\u96f6", "Url": "https://leetcode.cn/problems/duplicate-zeros/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 141 Problem 1"}, {"ID": 1090, "Title": "Largest Values From Labels", "TitleCn": "\u53d7\u6807\u7b7e\u5f71\u54cd\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/largest-values-from-labels/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 141 Problem 2"}, {"ID": 1091, "Title": "Shortest Path in Binary Matrix", "TitleCn": "\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-path-in-binary-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 141 Problem 3"}, {"ID": 1092, "Title": "Shortest Common Supersequence", "TitleCn": "\u6700\u77ed\u516c\u5171\u8d85\u5e8f\u5217", "Url": "https://leetcode.cn/problems/shortest-common-supersequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 141 Problem 4"}, {"ID": 1093, "Title": "Statistics from a Large Sample", "TitleCn": "\u5927\u6837\u672c\u7edf\u8ba1", "Url": "https://leetcode.cn/problems/statistics-from-a-large-sample/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 142 Problem 1"}, {"ID": 1094, "Title": "Car Pooling", "TitleCn": "\u62fc\u8f66", "Url": "https://leetcode.cn/problems/car-pooling/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 142 Problem 2"}, {"ID": 1095, "Title": "Find in Mountain Array", "TitleCn": "\u5c71\u8109\u6570\u7ec4\u4e2d\u67e5\u627e\u76ee\u6807\u503c", "Url": "https://leetcode.cn/problems/find-in-mountain-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 142 Problem 3"}, {"ID": 1096, "Title": "Brace Expansion II", "TitleCn": "\u82b1\u62ec\u53f7\u5c55\u5f00 II", "Url": "https://leetcode.cn/problems/brace-expansion-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 142 Problem 4"}, {"ID": 1097, "Title": "Game Play Analysis V", "TitleCn": "\u6e38\u620f\u73a9\u6cd5\u5206\u6790 V", "Url": "https://leetcode.cn/problems/game-play-analysis-v/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1098, "Title": "Unpopular Books", "TitleCn": "\u5c0f\u4f17\u4e66\u7c4d", "Url": "https://leetcode.cn/problems/unpopular-books/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1099, "Title": "Two Sum Less Than K", "TitleCn": "\u5c0f\u4e8e K \u7684\u4e24\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/two-sum-less-than-k/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 3 Problem 1"}, {"ID": 1100, "Title": "Find K-Length Substrings With No Repeated Characters", "TitleCn": "\u957f\u5ea6\u4e3a K \u7684\u65e0\u91cd\u590d\u5b57\u7b26\u5b50\u4e32", "Url": "https://leetcode.cn/problems/find-k-length-substrings-with-no-repeated-characters/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 3 Problem 2"}, {"ID": 1101, "Title": "The Earliest Moment When Everyone Become Friends", "TitleCn": "\u5f7c\u6b64\u719f\u8bc6\u7684\u6700\u65e9\u65f6\u95f4", "Url": "https://leetcode.cn/problems/the-earliest-moment-when-everyone-become-friends/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 3 Problem 3"}, {"ID": 1102, "Title": "Path With Maximum Minimum Value", "TitleCn": "\u5f97\u5206\u6700\u9ad8\u7684\u8def\u5f84", "Url": "https://leetcode.cn/problems/path-with-maximum-minimum-value/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 3 Problem 4"}, {"ID": 1103, "Title": "Distribute Candies to People", "TitleCn": "\u5206\u7cd6\u679c II", "Url": "https://leetcode.cn/problems/distribute-candies-to-people/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 143 Problem 1"}, {"ID": 1104, "Title": "Path In Zigzag Labelled Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u5bfb\u8def", "Url": "https://leetcode.cn/problems/path-in-zigzag-labelled-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 143 Problem 2"}, {"ID": 1105, "Title": "Filling Bookcase Shelves", "TitleCn": "\u586b\u5145\u4e66\u67b6", "Url": "https://leetcode.cn/problems/filling-bookcase-shelves/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 143 Problem 3"}, {"ID": 1106, "Title": "Parsing A Boolean Expression", "TitleCn": "\u89e3\u6790\u5e03\u5c14\u8868\u8fbe\u5f0f", "Url": "https://leetcode.cn/problems/parsing-a-boolean-expression/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 143 Problem 4"}, {"ID": 1107, "Title": "New Users Daily Count", "TitleCn": "\u6bcf\u65e5\u65b0\u7528\u6237\u7edf\u8ba1", "Url": "https://leetcode.cn/problems/new-users-daily-count/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1108, "Title": "Defanging an IP Address", "TitleCn": "IP \u5730\u5740\u65e0\u6548\u5316", "Url": "https://leetcode.cn/problems/defanging-an-ip-address/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 144 Problem 1"}, {"ID": 1109, "Title": "Corporate Flight Bookings", "TitleCn": "\u822a\u73ed\u9884\u8ba2\u7edf\u8ba1", "Url": "https://leetcode.cn/problems/corporate-flight-bookings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 144 Problem 2"}, {"ID": 1110, "Title": "Delete Nodes And Return Forest", "TitleCn": "\u5220\u70b9\u6210\u6797", "Url": "https://leetcode.cn/problems/delete-nodes-and-return-forest/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 144 Problem 3"}, {"ID": 1111, "Title": "Maximum Nesting Depth of Two Valid Parentheses Strings", "TitleCn": "\u6709\u6548\u62ec\u53f7\u7684\u5d4c\u5957\u6df1\u5ea6", "Url": "https://leetcode.cn/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 144 Problem 4"}, {"ID": 1112, "Title": "Highest Grade For Each Student", "TitleCn": "\u6bcf\u4f4d\u5b66\u751f\u7684\u6700\u9ad8\u6210\u7ee9", "Url": "https://leetcode.cn/problems/highest-grade-for-each-student/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1113, "Title": "Reported Posts", "TitleCn": "\u62a5\u544a\u7684\u8bb0\u5f55", "Url": "https://leetcode.cn/problems/reported-posts/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1114, "Title": "Print in Order", "TitleCn": "\u6309\u5e8f\u6253\u5370", "Url": "https://leetcode.cn/problems/print-in-order/", "Ispaid": 0, "Type": "Concurrency", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1115, "Title": "Print FooBar Alternately", "TitleCn": "\u4ea4\u66ff\u6253\u5370FooBar", "Url": "https://leetcode.cn/problems/print-foobar-alternately/", "Ispaid": 0, "Type": "Concurrency", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1116, "Title": "Print Zero Even Odd", "TitleCn": "\u6253\u5370\u96f6\u4e0e\u5947\u5076\u6570", "Url": "https://leetcode.cn/problems/print-zero-even-odd/", "Ispaid": 0, "Type": "Concurrency", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1117, "Title": "Building H2O", "TitleCn": "H2O \u751f\u6210", "Url": "https://leetcode.cn/problems/building-h2o/", "Ispaid": 0, "Type": "Concurrency", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1118, "Title": "Number of Days in a Month", "TitleCn": "\u4e00\u6708\u6709\u591a\u5c11\u5929", "Url": "https://leetcode.cn/problems/number-of-days-in-a-month/", "Ispaid": 1, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 4 Problem 1"}, {"ID": 1119, "Title": "Remove Vowels from a String", "TitleCn": "\u5220\u53bb\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3", "Url": "https://leetcode.cn/problems/remove-vowels-from-a-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 4 Problem 2"}, {"ID": 1120, "Title": "Maximum Average Subtree", "TitleCn": "\u5b50\u6811\u7684\u6700\u5927\u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/maximum-average-subtree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 4 Problem 3"}, {"ID": 1121, "Title": "Divide Array Into Increasing Sequences", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u6210\u51e0\u4e2a\u9012\u589e\u5e8f\u5217", "Url": "https://leetcode.cn/problems/divide-array-into-increasing-sequences/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 4 Problem 4"}, {"ID": 1122, "Title": "Relative Sort Array", "TitleCn": "\u6570\u7ec4\u7684\u76f8\u5bf9\u6392\u5e8f", "Url": "https://leetcode.cn/problems/relative-sort-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 145 Problem 1"}, {"ID": 1123, "Title": "Lowest Common Ancestor of Deepest Leaves", "TitleCn": "\u6700\u6df1\u53f6\u8282\u70b9\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148", "Url": "https://leetcode.cn/problems/lowest-common-ancestor-of-deepest-leaves/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 145 Problem 2"}, {"ID": 1124, "Title": "Longest Well-Performing Interval", "TitleCn": "\u8868\u73b0\u826f\u597d\u7684\u6700\u957f\u65f6\u95f4\u6bb5", "Url": "https://leetcode.cn/problems/longest-well-performing-interval/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 145 Problem 3"}, {"ID": 1125, "Title": "Smallest Sufficient Team", "TitleCn": "\u6700\u5c0f\u7684\u5fc5\u8981\u56e2\u961f", "Url": "https://leetcode.cn/problems/smallest-sufficient-team/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 145 Problem 4"}, {"ID": 1126, "Title": "Active Businesses", "TitleCn": "\u67e5\u8be2\u6d3b\u8dc3\u4e1a\u52a1", "Url": "https://leetcode.cn/problems/active-businesses/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1127, "Title": "User Purchase Platform", "TitleCn": "\u7528\u6237\u8d2d\u4e70\u5e73\u53f0", "Url": "https://leetcode.cn/problems/user-purchase-platform/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1128, "Title": "Number of Equivalent Domino Pairs", "TitleCn": "\u7b49\u4ef7\u591a\u7c73\u8bfa\u9aa8\u724c\u5bf9\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-equivalent-domino-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 146 Problem 1"}, {"ID": 1129, "Title": "Shortest Path with Alternating Colors", "TitleCn": "\u989c\u8272\u4ea4\u66ff\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-path-with-alternating-colors/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 146 Problem 2"}, {"ID": 1130, "Title": "Minimum Cost Tree From Leaf Values", "TitleCn": "\u53f6\u503c\u7684\u6700\u5c0f\u4ee3\u4ef7\u751f\u6210\u6811", "Url": "https://leetcode.cn/problems/minimum-cost-tree-from-leaf-values/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 146 Problem 3"}, {"ID": 1131, "Title": "Maximum of Absolute Value Expression", "TitleCn": "\u7edd\u5bf9\u503c\u8868\u8fbe\u5f0f\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/maximum-of-absolute-value-expression/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 146 Problem 4"}, {"ID": 1132, "Title": "Reported Posts II", "TitleCn": "\u62a5\u544a\u7684\u8bb0\u5f55 II", "Url": "https://leetcode.cn/problems/reported-posts-ii/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1133, "Title": "Largest Unique Number", "TitleCn": "\u6700\u5927\u552f\u4e00\u6570", "Url": "https://leetcode.cn/problems/largest-unique-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 5 Problem 1"}, {"ID": 1134, "Title": "Armstrong Number", "TitleCn": "\u963f\u59c6\u65af\u7279\u6717\u6570", "Url": "https://leetcode.cn/problems/armstrong-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 5 Problem 2"}, {"ID": 1135, "Title": "Connecting Cities With Minimum Cost", "TitleCn": "\u6700\u4f4e\u6210\u672c\u8fde\u901a\u6240\u6709\u57ce\u5e02", "Url": "https://leetcode.cn/problems/connecting-cities-with-minimum-cost/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 5 Problem 3"}, {"ID": 1136, "Title": "Parallel Courses", "TitleCn": "\u5e76\u884c\u8bfe\u7a0b", "Url": "https://leetcode.cn/problems/parallel-courses/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 5 Problem 4"}, {"ID": 1137, "Title": "N-th Tribonacci Number", "TitleCn": "\u7b2c N \u4e2a\u6cf0\u6ce2\u90a3\u5951\u6570", "Url": "https://leetcode.cn/problems/n-th-tribonacci-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 147 Problem 1"}, {"ID": 1138, "Title": "Alphabet Board Path", "TitleCn": "\u5b57\u6bcd\u677f\u4e0a\u7684\u8def\u5f84", "Url": "https://leetcode.cn/problems/alphabet-board-path/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 147 Problem 2"}, {"ID": 1139, "Title": "Largest 1-Bordered Square", "TitleCn": "\u6700\u5927\u7684\u4ee5 1 \u4e3a\u8fb9\u754c\u7684\u6b63\u65b9\u5f62", "Url": "https://leetcode.cn/problems/largest-1-bordered-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 147 Problem 3"}, {"ID": 1140, "Title": "Stone Game II", "TitleCn": "\u77f3\u5b50\u6e38\u620f II", "Url": "https://leetcode.cn/problems/stone-game-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 147 Problem 4"}, {"ID": 1141, "Title": "User Activity for the Past 30 Days I", "TitleCn": "\u67e5\u8be2\u8fd130\u5929\u6d3b\u8dc3\u7528\u6237\u6570", "Url": "https://leetcode.cn/problems/user-activity-for-the-past-30-days-i/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1142, "Title": "User Activity for the Past 30 Days II", "TitleCn": "\u8fc7\u53bb30\u5929\u7684\u7528\u6237\u6d3b\u52a8 II", "Url": "https://leetcode.cn/problems/user-activity-for-the-past-30-days-ii/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1143, "Title": "Longest Common Subsequence", "TitleCn": "\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-common-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1144, "Title": "Decrease Elements To Make Array Zigzag", "TitleCn": "\u9012\u51cf\u5143\u7d20\u4f7f\u6570\u7ec4\u5448\u952f\u9f7f\u72b6", "Url": "https://leetcode.cn/problems/decrease-elements-to-make-array-zigzag/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 148 Problem 1"}, {"ID": 1145, "Title": "Binary Tree Coloring Game", "TitleCn": "\u4e8c\u53c9\u6811\u7740\u8272\u6e38\u620f", "Url": "https://leetcode.cn/problems/binary-tree-coloring-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 148 Problem 2"}, {"ID": 1146, "Title": "Snapshot Array", "TitleCn": "\u5feb\u7167\u6570\u7ec4", "Url": "https://leetcode.cn/problems/snapshot-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 148 Problem 3"}, {"ID": 1147, "Title": "Longest Chunked Palindrome Decomposition", "TitleCn": "\u6bb5\u5f0f\u56de\u6587", "Url": "https://leetcode.cn/problems/longest-chunked-palindrome-decomposition/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 148 Problem 4"}, {"ID": 1148, "Title": "Article Views I", "TitleCn": "\u6587\u7ae0\u6d4f\u89c8 I", "Url": "https://leetcode.cn/problems/article-views-i/", "Ispaid": 0, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1149, "Title": "Article Views II", "TitleCn": "\u6587\u7ae0\u6d4f\u89c8 II", "Url": "https://leetcode.cn/problems/article-views-ii/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1150, "Title": "Check If a Number Is Majority Element in a Sorted Array", "TitleCn": "\u68c0\u67e5\u4e00\u4e2a\u6570\u662f\u5426\u5728\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570", "Url": "https://leetcode.cn/problems/check-if-a-number-is-majority-element-in-a-sorted-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 6 Problem 1"}, {"ID": 1151, "Title": "Minimum Swaps to Group All 1's Together", "TitleCn": "\u6700\u5c11\u4ea4\u6362\u6b21\u6570\u6765\u7ec4\u5408\u6240\u6709\u7684 1", "Url": "https://leetcode.cn/problems/minimum-swaps-to-group-all-1s-together/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 6 Problem 2"}, {"ID": 1152, "Title": "Analyze User Website Visit Pattern", "TitleCn": "\u7528\u6237\u7f51\u7ad9\u8bbf\u95ee\u884c\u4e3a\u5206\u6790", "Url": "https://leetcode.cn/problems/analyze-user-website-visit-pattern/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 6 Problem 3"}, {"ID": 1153, "Title": "String Transforms Into Another String", "TitleCn": "\u5b57\u7b26\u4e32\u8f6c\u5316", "Url": "https://leetcode.cn/problems/string-transforms-into-another-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 6 Problem 4"}, {"ID": 1154, "Title": "Day of the Year", "TitleCn": "\u4e00\u5e74\u4e2d\u7684\u7b2c\u51e0\u5929", "Url": "https://leetcode.cn/problems/day-of-the-year/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 149 Problem 1"}, {"ID": 1155, "Title": "Number of Dice Rolls With Target Sum", "TitleCn": "\u63b7\u9ab0\u5b50\u7b49\u4e8e\u76ee\u6807\u548c\u7684\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/number-of-dice-rolls-with-target-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 149 Problem 2"}, {"ID": 1156, "Title": "Swap For Longest Repeated Character Substring", "TitleCn": "\u5355\u5b57\u7b26\u91cd\u590d\u5b50\u4e32\u7684\u6700\u5927\u957f\u5ea6", "Url": "https://leetcode.cn/problems/swap-for-longest-repeated-character-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 149 Problem 3"}, {"ID": 1157, "Title": "Online Majority Element In Subarray", "TitleCn": "\u5b50\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/online-majority-element-in-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 149 Problem 4"}, {"ID": 1158, "Title": "Market Analysis I", "TitleCn": "\u5e02\u573a\u5206\u6790 I", "Url": "https://leetcode.cn/problems/market-analysis-i/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1159, "Title": "Market Analysis II", "TitleCn": "\u5e02\u573a\u5206\u6790 II", "Url": "https://leetcode.cn/problems/market-analysis-ii/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1160, "Title": "Find Words That Can Be Formed by Characters", "TitleCn": "\u62fc\u5199\u5355\u8bcd", "Url": "https://leetcode.cn/problems/find-words-that-can-be-formed-by-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 150 Problem 1"}, {"ID": 1161, "Title": "Maximum Level Sum of a Binary Tree", "TitleCn": "\u6700\u5927\u5c42\u5185\u5143\u7d20\u548c", "Url": "https://leetcode.cn/problems/maximum-level-sum-of-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 150 Problem 2"}, {"ID": 1162, "Title": "As Far from Land as Possible", "TitleCn": "\u5730\u56fe\u5206\u6790", "Url": "https://leetcode.cn/problems/as-far-from-land-as-possible/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 150 Problem 3"}, {"ID": 1163, "Title": "Last Substring in Lexicographical Order", "TitleCn": "\u6309\u5b57\u5178\u5e8f\u6392\u5728\u6700\u540e\u7684\u5b50\u4e32", "Url": "https://leetcode.cn/problems/last-substring-in-lexicographical-order/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 150 Problem 4"}, {"ID": 1164, "Title": "Product Price at a Given Date", "TitleCn": "\u6307\u5b9a\u65e5\u671f\u7684\u4ea7\u54c1\u4ef7\u683c", "Url": "https://leetcode.cn/problems/product-price-at-a-given-date/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1165, "Title": "Single-Row Keyboard", "TitleCn": "\u5355\u884c\u952e\u76d8", "Url": "https://leetcode.cn/problems/single-row-keyboard/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 7 Problem 1"}, {"ID": 1166, "Title": "Design File System", "TitleCn": "\u8bbe\u8ba1\u6587\u4ef6\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-file-system/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 7 Problem 2"}, {"ID": 1167, "Title": "Minimum Cost to Connect Sticks", "TitleCn": "\u8fde\u63a5\u6728\u68cd\u7684\u6700\u4f4e\u8d39\u7528", "Url": "https://leetcode.cn/problems/minimum-cost-to-connect-sticks/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 7 Problem 3"}, {"ID": 1168, "Title": "Optimize Water Distribution in a Village", "TitleCn": "\u6c34\u8d44\u6e90\u5206\u914d\u4f18\u5316", "Url": "https://leetcode.cn/problems/optimize-water-distribution-in-a-village/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 7 Problem 4"}, {"ID": 1169, "Title": "Invalid Transactions", "TitleCn": "\u67e5\u8be2\u65e0\u6548\u4ea4\u6613", "Url": "https://leetcode.cn/problems/invalid-transactions/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 151 Problem 1"}, {"ID": 1170, "Title": "Compare Strings by Frequency of the Smallest Character", "TitleCn": "\u6bd4\u8f83\u5b57\u7b26\u4e32\u6700\u5c0f\u5b57\u6bcd\u51fa\u73b0\u9891\u6b21", "Url": "https://leetcode.cn/problems/compare-strings-by-frequency-of-the-smallest-character/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 151 Problem 2"}, {"ID": 1171, "Title": "Remove Zero Sum Consecutive Nodes from Linked List", "TitleCn": "\u4ece\u94fe\u8868\u4e2d\u5220\u53bb\u603b\u548c\u503c\u4e3a\u96f6\u7684\u8fde\u7eed\u8282\u70b9", "Url": "https://leetcode.cn/problems/remove-zero-sum-consecutive-nodes-from-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 151 Problem 3"}, {"ID": 1172, "Title": "Dinner Plate Stacks", "TitleCn": "\u9910\u76d8\u6808", "Url": "https://leetcode.cn/problems/dinner-plate-stacks/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 151 Problem 4"}, {"ID": 1173, "Title": "Immediate Food Delivery I", "TitleCn": "\u5373\u65f6\u98df\u7269\u914d\u9001 I", "Url": "https://leetcode.cn/problems/immediate-food-delivery-i/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1174, "Title": "Immediate Food Delivery II", "TitleCn": "\u5373\u65f6\u98df\u7269\u914d\u9001 II", "Url": "https://leetcode.cn/problems/immediate-food-delivery-ii/", "Ispaid": 0, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1175, "Title": "Prime Arrangements", "TitleCn": "\u8d28\u6570\u6392\u5217", "Url": "https://leetcode.cn/problems/prime-arrangements/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 152 Problem 1"}, {"ID": 1176, "Title": "Diet Plan Performance", "TitleCn": "\u5065\u8eab\u8ba1\u5212\u8bc4\u4f30", "Url": "https://leetcode.cn/problems/diet-plan-performance/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 152 Problem 2"}, {"ID": 1177, "Title": "Can Make Palindrome from Substring", "TitleCn": "\u6784\u5efa\u56de\u6587\u4e32\u68c0\u6d4b", "Url": "https://leetcode.cn/problems/can-make-palindrome-from-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 152 Problem 3"}, {"ID": 1178, "Title": "Number of Valid Words for Each Puzzle", "TitleCn": "\u731c\u5b57\u8c1c", "Url": "https://leetcode.cn/problems/number-of-valid-words-for-each-puzzle/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 152 Problem 4"}, {"ID": 1179, "Title": "Reformat Department Table", "TitleCn": "\u91cd\u65b0\u683c\u5f0f\u5316\u90e8\u95e8\u8868", "Url": "https://leetcode.cn/problems/reformat-department-table/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1180, "Title": "Count Substrings with Only One Distinct Letter", "TitleCn": "\u7edf\u8ba1\u53ea\u542b\u5355\u4e00\u5b57\u6bcd\u7684\u5b50\u4e32", "Url": "https://leetcode.cn/problems/count-substrings-with-only-one-distinct-letter/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 8 Problem 1"}, {"ID": 1181, "Title": "Before and After Puzzle", "TitleCn": "\u524d\u540e\u62fc\u63a5", "Url": "https://leetcode.cn/problems/before-and-after-puzzle/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 8 Problem 2"}, {"ID": 1182, "Title": "Shortest Distance to Target Color", "TitleCn": "\u4e0e\u76ee\u6807\u989c\u8272\u95f4\u7684\u6700\u77ed\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/shortest-distance-to-target-color/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 8 Problem 3"}, {"ID": 1183, "Title": "Maximum Number of Ones", "TitleCn": "\u77e9\u9635\u4e2d 1 \u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-ones/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 8 Problem 4"}, {"ID": 1184, "Title": "Distance Between Bus Stops", "TitleCn": "\u516c\u4ea4\u7ad9\u95f4\u7684\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/distance-between-bus-stops/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 153 Problem 1"}, {"ID": 1185, "Title": "Day of the Week", "TitleCn": "\u4e00\u5468\u4e2d\u7684\u7b2c\u51e0\u5929", "Url": "https://leetcode.cn/problems/day-of-the-week/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 153 Problem 2"}, {"ID": 1186, "Title": "Maximum Subarray Sum with One Deletion", "TitleCn": "\u5220\u9664\u4e00\u6b21\u5f97\u5230\u5b50\u6570\u7ec4\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-subarray-sum-with-one-deletion/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 153 Problem 3"}, {"ID": 1187, "Title": "Make Array Strictly Increasing", "TitleCn": "\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e", "Url": "https://leetcode.cn/problems/make-array-strictly-increasing/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 153 Problem 4"}, {"ID": 1188, "Title": "Design Bounded Blocking Queue", "TitleCn": "\u8bbe\u8ba1\u6709\u9650\u963b\u585e\u961f\u5217", "Url": "https://leetcode.cn/problems/design-bounded-blocking-queue/", "Ispaid": 1, "Type": "Concurrency", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1189, "Title": "Maximum Number of Balloons", "TitleCn": "\u201c\u6c14\u7403\u201d \u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-balloons/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 154 Problem 1"}, {"ID": 1190, "Title": "Reverse Substrings Between Each Pair of Parentheses", "TitleCn": "\u53cd\u8f6c\u6bcf\u5bf9\u62ec\u53f7\u95f4\u7684\u5b50\u4e32", "Url": "https://leetcode.cn/problems/reverse-substrings-between-each-pair-of-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 154 Problem 2"}, {"ID": 1191, "Title": "K-Concatenation Maximum Sum", "TitleCn": "K \u6b21\u4e32\u8054\u540e\u6700\u5927\u5b50\u6570\u7ec4\u4e4b\u548c", "Url": "https://leetcode.cn/problems/k-concatenation-maximum-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 154 Problem 3"}, {"ID": 1192, "Title": "Critical Connections in a Network", "TitleCn": "\u67e5\u627e\u96c6\u7fa4\u5185\u7684\u300c\u5173\u952e\u8fde\u63a5\u300d", "Url": "https://leetcode.cn/problems/critical-connections-in-a-network/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 154 Problem 4"}, {"ID": 1193, "Title": "Monthly Transactions I", "TitleCn": "\u6bcf\u6708\u4ea4\u6613 I", "Url": "https://leetcode.cn/problems/monthly-transactions-i/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1194, "Title": "Tournament Winners", "TitleCn": "\u9526\u6807\u8d5b\u4f18\u80dc\u8005", "Url": "https://leetcode.cn/problems/tournament-winners/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1195, "Title": "Fizz Buzz Multithreaded", "TitleCn": "\u4ea4\u66ff\u6253\u5370\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/fizz-buzz-multithreaded/", "Ispaid": 0, "Type": "Concurrency", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1196, "Title": "How Many Apples Can You Put into the Basket", "TitleCn": "\u6700\u591a\u53ef\u4ee5\u4e70\u5230\u7684\u82f9\u679c\u6570\u91cf", "Url": "https://leetcode.cn/problems/how-many-apples-can-you-put-into-the-basket/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 9 Problem 1"}, {"ID": 1197, "Title": "Minimum Knight Moves", "TitleCn": "\u8fdb\u51fb\u7684\u9a91\u58eb", "Url": "https://leetcode.cn/problems/minimum-knight-moves/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 9 Problem 2"}, {"ID": 1198, "Title": "Find Smallest Common Element in All Rows", "TitleCn": "\u627e\u51fa\u6240\u6709\u884c\u4e2d\u6700\u5c0f\u516c\u5171\u5143\u7d20", "Url": "https://leetcode.cn/problems/find-smallest-common-element-in-all-rows/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 9 Problem 3"}, {"ID": 1199, "Title": "Minimum Time to Build Blocks", "TitleCn": "\u5efa\u9020\u8857\u533a\u7684\u6700\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-build-blocks/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 9 Problem 4"}, {"ID": 1200, "Title": "Minimum Absolute Difference", "TitleCn": "\u6700\u5c0f\u7edd\u5bf9\u5dee", "Url": "https://leetcode.cn/problems/minimum-absolute-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 155 Problem 1"}, {"ID": 1201, "Title": "Ugly Number III", "TitleCn": "\u4e11\u6570 III", "Url": "https://leetcode.cn/problems/ugly-number-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 155 Problem 2"}, {"ID": 1202, "Title": "Smallest String With Swaps", "TitleCn": "\u4ea4\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/smallest-string-with-swaps/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 155 Problem 3"}, {"ID": 1203, "Title": "Sort Items by Groups Respecting Dependencies", "TitleCn": "\u9879\u76ee\u7ba1\u7406", "Url": "https://leetcode.cn/problems/sort-items-by-groups-respecting-dependencies/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 155 Problem 4"}, {"ID": 1204, "Title": "Last Person to Fit in the Bus", "TitleCn": "\u6700\u540e\u4e00\u4e2a\u80fd\u8fdb\u5165\u7535\u68af\u7684\u4eba", "Url": "https://leetcode.cn/problems/last-person-to-fit-in-the-elevator/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1205, "Title": "Monthly Transactions II", "TitleCn": "\u6bcf\u6708\u4ea4\u6613II", "Url": "https://leetcode.cn/problems/monthly-transactions-ii/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1206, "Title": "Design Skiplist", "TitleCn": "\u8bbe\u8ba1\u8df3\u8868", "Url": "https://leetcode.cn/problems/design-skiplist/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1207, "Title": "Unique Number of Occurrences", "TitleCn": "\u72ec\u4e00\u65e0\u4e8c\u7684\u51fa\u73b0\u6b21\u6570", "Url": "https://leetcode.cn/problems/unique-number-of-occurrences/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 156 Problem 1"}, {"ID": 1208, "Title": "Get Equal Substrings Within Budget", "TitleCn": "\u5c3d\u53ef\u80fd\u4f7f\u5b57\u7b26\u4e32\u76f8\u7b49", "Url": "https://leetcode.cn/problems/get-equal-substrings-within-budget/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 156 Problem 2"}, {"ID": 1209, "Title": "Remove All Adjacent Duplicates in String II", "TitleCn": "\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879 II", "Url": "https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 156 Problem 3"}, {"ID": 1210, "Title": "Minimum Moves to Reach Target with Rotations", "TitleCn": "\u7a7f\u8fc7\u8ff7\u5bab\u7684\u6700\u5c11\u79fb\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-moves-to-reach-target-with-rotations/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 156 Problem 4"}, {"ID": 1211, "Title": "Queries Quality and Percentage", "TitleCn": "\u67e5\u8be2\u7ed3\u679c\u7684\u8d28\u91cf\u548c\u5360\u6bd4", "Url": "https://leetcode.cn/problems/queries-quality-and-percentage/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1212, "Title": "Team Scores in Football Tournament", "TitleCn": "\u67e5\u8be2\u7403\u961f\u79ef\u5206", "Url": "https://leetcode.cn/problems/team-scores-in-football-tournament/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1213, "Title": "Intersection of Three Sorted Arrays", "TitleCn": "\u4e09\u4e2a\u6709\u5e8f\u6570\u7ec4\u7684\u4ea4\u96c6", "Url": "https://leetcode.cn/problems/intersection-of-three-sorted-arrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 10 Problem 1"}, {"ID": 1214, "Title": "Two Sum BSTs", "TitleCn": "\u67e5\u627e\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e4b\u548c", "Url": "https://leetcode.cn/problems/two-sum-bsts/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 10 Problem 2"}, {"ID": 1215, "Title": "Stepping Numbers", "TitleCn": "\u6b65\u8fdb\u6570", "Url": "https://leetcode.cn/problems/stepping-numbers/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 10 Problem 3"}, {"ID": 1216, "Title": "Valid Palindrome III", "TitleCn": "\u9a8c\u8bc1\u56de\u6587\u4e32 III", "Url": "https://leetcode.cn/problems/valid-palindrome-iii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 10 Problem 4"}, {"ID": 1217, "Title": "Minimum Cost to Move Chips to The Same Position", "TitleCn": "\u73a9\u7b79\u7801", "Url": "https://leetcode.cn/problems/minimum-cost-to-move-chips-to-the-same-position/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 157 Problem 1"}, {"ID": 1218, "Title": "Longest Arithmetic Subsequence of Given Difference", "TitleCn": "\u6700\u957f\u5b9a\u5dee\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-arithmetic-subsequence-of-given-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 157 Problem 2"}, {"ID": 1219, "Title": "Path with Maximum Gold", "TitleCn": "\u9ec4\u91d1\u77ff\u5de5", "Url": "https://leetcode.cn/problems/path-with-maximum-gold/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 157 Problem 3"}, {"ID": 1220, "Title": "Count Vowels Permutation", "TitleCn": "\u7edf\u8ba1\u5143\u97f3\u5b57\u6bcd\u5e8f\u5217\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-vowels-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 157 Problem 4"}, {"ID": 1221, "Title": "Split a String in Balanced Strings", "TitleCn": "\u5206\u5272\u5e73\u8861\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/split-a-string-in-balanced-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 158 Problem 1"}, {"ID": 1222, "Title": "Queens That Can Attack the King", "TitleCn": "\u53ef\u4ee5\u653b\u51fb\u56fd\u738b\u7684\u7687\u540e", "Url": "https://leetcode.cn/problems/queens-that-can-attack-the-king/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 158 Problem 2"}, {"ID": 1223, "Title": "Dice Roll Simulation", "TitleCn": "\u63b7\u9ab0\u5b50\u6a21\u62df", "Url": "https://leetcode.cn/problems/dice-roll-simulation/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 158 Problem 3"}, {"ID": 1224, "Title": "Maximum Equal Frequency", "TitleCn": "\u6700\u5927\u76f8\u7b49\u9891\u7387", "Url": "https://leetcode.cn/problems/maximum-equal-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 158 Problem 4"}, {"ID": 1225, "Title": "Report Contiguous Dates", "TitleCn": "\u62a5\u544a\u7cfb\u7edf\u72b6\u6001\u7684\u8fde\u7eed\u65e5\u671f", "Url": "https://leetcode.cn/problems/report-contiguous-dates/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1226, "Title": "The Dining Philosophers", "TitleCn": "\u54f2\u5b66\u5bb6\u8fdb\u9910", "Url": "https://leetcode.cn/problems/the-dining-philosophers/", "Ispaid": 0, "Type": "Concurrency", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1227, "Title": "Airplane Seat Assignment Probability", "TitleCn": "\u98de\u673a\u5ea7\u4f4d\u5206\u914d\u6982\u7387", "Url": "https://leetcode.cn/problems/airplane-seat-assignment-probability/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1228, "Title": "Missing Number In Arithmetic Progression", "TitleCn": "\u7b49\u5dee\u6570\u5217\u4e2d\u7f3a\u5931\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/missing-number-in-arithmetic-progression/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 11 Problem 1"}, {"ID": 1229, "Title": "Meeting Scheduler", "TitleCn": "\u5b89\u6392\u4f1a\u8bae\u65e5\u7a0b", "Url": "https://leetcode.cn/problems/meeting-scheduler/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 11 Problem 2"}, {"ID": 1230, "Title": "Toss Strange Coins", "TitleCn": "\u629b\u63b7\u786c\u5e01", "Url": "https://leetcode.cn/problems/toss-strange-coins/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 11 Problem 3"}, {"ID": 1231, "Title": "Divide Chocolate", "TitleCn": "\u5206\u4eab\u5de7\u514b\u529b", "Url": "https://leetcode.cn/problems/divide-chocolate/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 11 Problem 4"}, {"ID": 1232, "Title": "Check If It Is a Straight Line", "TitleCn": "\u7f00\u70b9\u6210\u7ebf", "Url": "https://leetcode.cn/problems/check-if-it-is-a-straight-line/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 159 Problem 1"}, {"ID": 1233, "Title": "Remove Sub-Folders from the Filesystem", "TitleCn": "\u5220\u9664\u5b50\u6587\u4ef6\u5939", "Url": "https://leetcode.cn/problems/remove-sub-folders-from-the-filesystem/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 159 Problem 2"}, {"ID": 1234, "Title": "Replace the Substring for Balanced String", "TitleCn": "\u66ff\u6362\u5b50\u4e32\u5f97\u5230\u5e73\u8861\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/replace-the-substring-for-balanced-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 159 Problem 3"}, {"ID": 1235, "Title": "Maximum Profit in Job Scheduling", "TitleCn": "\u89c4\u5212\u517c\u804c\u5de5\u4f5c", "Url": "https://leetcode.cn/problems/maximum-profit-in-job-scheduling/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 159 Problem 4"}, {"ID": 1236, "Title": "Web Crawler", "TitleCn": "\u7f51\u7edc\u722c\u866b", "Url": "https://leetcode.cn/problems/web-crawler/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1237, "Title": "Find Positive Integer Solution for a Given Equation", "TitleCn": "\u627e\u51fa\u7ed9\u5b9a\u65b9\u7a0b\u7684\u6b63\u6574\u6570\u89e3", "Url": "https://leetcode.cn/problems/find-positive-integer-solution-for-a-given-equation/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 160 Problem 1"}, {"ID": 1238, "Title": "Circular Permutation in Binary Representation", "TitleCn": "\u5faa\u73af\u7801\u6392\u5217", "Url": "https://leetcode.cn/problems/circular-permutation-in-binary-representation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 160 Problem 2"}, {"ID": 1239, "Title": "Maximum Length of a Concatenated String with Unique Characters", "TitleCn": "\u4e32\u8054\u5b57\u7b26\u4e32\u7684\u6700\u5927\u957f\u5ea6", "Url": "https://leetcode.cn/problems/maximum-length-of-a-concatenated-string-with-unique-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 160 Problem 3"}, {"ID": 1240, "Title": "Tiling a Rectangle with the Fewest Squares", "TitleCn": "\u94fa\u74f7\u7816", "Url": "https://leetcode.cn/problems/tiling-a-rectangle-with-the-fewest-squares/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 160 Problem 4"}, {"ID": 1241, "Title": "Number of Comments per Post", "TitleCn": "\u6bcf\u4e2a\u5e16\u5b50\u7684\u8bc4\u8bba\u6570", "Url": "https://leetcode.cn/problems/number-of-comments-per-post/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1242, "Title": "Web Crawler Multithreaded", "TitleCn": "\u591a\u7ebf\u7a0b\u7f51\u9875\u722c\u866b", "Url": "https://leetcode.cn/problems/web-crawler-multithreaded/", "Ispaid": 1, "Type": "Concurrency", "Level": 7, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1243, "Title": "Array Transformation", "TitleCn": "\u6570\u7ec4\u53d8\u6362", "Url": "https://leetcode.cn/problems/array-transformation/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 12 Problem 2"}, {"ID": 1244, "Title": "Design A Leaderboard", "TitleCn": "\u529b\u6263\u6392\u884c\u699c", "Url": "https://leetcode.cn/problems/design-a-leaderboard/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 12 Problem 1"}, {"ID": 1245, "Title": "Tree Diameter", "TitleCn": "\u6811\u7684\u76f4\u5f84", "Url": "https://leetcode.cn/problems/tree-diameter/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 12 Problem 3"}, {"ID": 1246, "Title": "Palindrome Removal", "TitleCn": "\u5220\u9664\u56de\u6587\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/palindrome-removal/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 12 Problem 4"}, {"ID": 1247, "Title": "Minimum Swaps to Make Strings Equal", "TitleCn": "\u4ea4\u6362\u5b57\u7b26\u4f7f\u5f97\u5b57\u7b26\u4e32\u76f8\u540c", "Url": "https://leetcode.cn/problems/minimum-swaps-to-make-strings-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 161 Problem 1"}, {"ID": 1248, "Title": "Count Number of Nice Subarrays", "TitleCn": "\u7edf\u8ba1\u300c\u4f18\u7f8e\u5b50\u6570\u7ec4\u300d", "Url": "https://leetcode.cn/problems/count-number-of-nice-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 161 Problem 2"}, {"ID": 1249, "Title": "Minimum Remove to Make Valid Parentheses", "TitleCn": "\u79fb\u9664\u65e0\u6548\u7684\u62ec\u53f7", "Url": "https://leetcode.cn/problems/minimum-remove-to-make-valid-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 161 Problem 3"}, {"ID": 1250, "Title": "Check If It Is a Good Array", "TitleCn": "\u68c0\u67e5\u300c\u597d\u6570\u7ec4\u300d", "Url": "https://leetcode.cn/problems/check-if-it-is-a-good-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 161 Problem 4"}, {"ID": 1251, "Title": "Average Selling Price", "TitleCn": "\u5e73\u5747\u552e\u4ef7", "Url": "https://leetcode.cn/problems/average-selling-price/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1252, "Title": "Cells with Odd Values in a Matrix", "TitleCn": "\u5947\u6570\u503c\u5355\u5143\u683c\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/cells-with-odd-values-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 162 Problem 1"}, {"ID": 1253, "Title": "Reconstruct a 2-Row Binary Matrix", "TitleCn": "\u91cd\u6784 2 \u884c\u4e8c\u8fdb\u5236\u77e9\u9635", "Url": "https://leetcode.cn/problems/reconstruct-a-2-row-binary-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 162 Problem 2"}, {"ID": 1254, "Title": "Number of Closed Islands", "TitleCn": "\u7edf\u8ba1\u5c01\u95ed\u5c9b\u5c7f\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-closed-islands/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 162 Problem 3"}, {"ID": 1255, "Title": "Maximum Score Words Formed by Letters", "TitleCn": "\u5f97\u5206\u6700\u9ad8\u7684\u5355\u8bcd\u96c6\u5408", "Url": "https://leetcode.cn/problems/maximum-score-words-formed-by-letters/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 162 Problem 4"}, {"ID": 1256, "Title": "Encode Number", "TitleCn": "\u52a0\u5bc6\u6570\u5b57", "Url": "https://leetcode.cn/problems/encode-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 13 Problem 1"}, {"ID": 1257, "Title": "Smallest Common Region", "TitleCn": "\u6700\u5c0f\u516c\u5171\u533a\u57df", "Url": "https://leetcode.cn/problems/smallest-common-region/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 13 Problem 2"}, {"ID": 1258, "Title": "Synonymous Sentences", "TitleCn": "\u8fd1\u4e49\u8bcd\u53e5\u5b50", "Url": "https://leetcode.cn/problems/synonymous-sentences/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 13 Problem 3"}, {"ID": 1259, "Title": "Handshakes That Don't Cross", "TitleCn": "\u4e0d\u76f8\u4ea4\u7684\u63e1\u624b", "Url": "https://leetcode.cn/problems/handshakes-that-dont-cross/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 13 Problem 4"}, {"ID": 1260, "Title": "Shift 2D Grid", "TitleCn": "\u4e8c\u7ef4\u7f51\u683c\u8fc1\u79fb", "Url": "https://leetcode.cn/problems/shift-2d-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 163 Problem 1"}, {"ID": 1261, "Title": "Find Elements in a Contaminated Binary Tree", "TitleCn": "\u5728\u53d7\u6c61\u67d3\u7684\u4e8c\u53c9\u6811\u4e2d\u67e5\u627e\u5143\u7d20", "Url": "https://leetcode.cn/problems/find-elements-in-a-contaminated-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 163 Problem 2"}, {"ID": 1262, "Title": "Greatest Sum Divisible by Three", "TitleCn": "\u53ef\u88ab\u4e09\u6574\u9664\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/greatest-sum-divisible-by-three/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 163 Problem 3"}, {"ID": 1263, "Title": "Minimum Moves to Move a Box to Their Target Location", "TitleCn": "\u63a8\u7bb1\u5b50", "Url": "https://leetcode.cn/problems/minimum-moves-to-move-a-box-to-their-target-location/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 163 Problem 4"}, {"ID": 1264, "Title": "Page Recommendations", "TitleCn": "\u9875\u9762\u63a8\u8350", "Url": "https://leetcode.cn/problems/page-recommendations/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1265, "Title": "Print Immutable Linked List in Reverse", "TitleCn": "\u9006\u5e8f\u6253\u5370\u4e0d\u53ef\u53d8\u94fe\u8868", "Url": "https://leetcode.cn/problems/print-immutable-linked-list-in-reverse/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1266, "Title": "Minimum Time Visiting All Points", "TitleCn": "\u8bbf\u95ee\u6240\u6709\u70b9\u7684\u6700\u5c0f\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-visiting-all-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 164 Problem 1"}, {"ID": 1267, "Title": "Count Servers that Communicate", "TitleCn": "\u7edf\u8ba1\u53c2\u4e0e\u901a\u4fe1\u7684\u670d\u52a1\u5668", "Url": "https://leetcode.cn/problems/count-servers-that-communicate/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 164 Problem 2"}, {"ID": 1268, "Title": "Search Suggestions System", "TitleCn": "\u641c\u7d22\u63a8\u8350\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/search-suggestions-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 164 Problem 3"}, {"ID": 1269, "Title": "Number of Ways to Stay in the Same Place After Some Steps", "TitleCn": "\u505c\u5728\u539f\u5730\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 164 Problem 4"}, {"ID": 1270, "Title": "All People Report to the Given Manager", "TitleCn": "\u5411\u516c\u53f8CEO\u6c47\u62a5\u5de5\u4f5c\u7684\u6240\u6709\u4eba", "Url": "https://leetcode.cn/problems/all-people-report-to-the-given-manager/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1271, "Title": "Hexspeak", "TitleCn": "\u5341\u516d\u8fdb\u5236\u9b54\u672f\u6570\u5b57", "Url": "https://leetcode.cn/problems/hexspeak/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 14 Problem 1"}, {"ID": 1272, "Title": "Remove Interval", "TitleCn": "\u5220\u9664\u533a\u95f4", "Url": "https://leetcode.cn/problems/remove-interval/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 14 Problem 2"}, {"ID": 1273, "Title": "Delete Tree Nodes", "TitleCn": "\u5220\u9664\u6811\u8282\u70b9", "Url": "https://leetcode.cn/problems/delete-tree-nodes/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 14 Problem 3"}, {"ID": 1274, "Title": "Number of Ships in a Rectangle", "TitleCn": "\u77e9\u5f62\u5185\u8239\u53ea\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-ships-in-a-rectangle/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 14 Problem 4"}, {"ID": 1275, "Title": "Find Winner on a Tic Tac Toe Game", "TitleCn": "\u627e\u51fa\u4e95\u5b57\u68cb\u7684\u83b7\u80dc\u8005", "Url": "https://leetcode.cn/problems/find-winner-on-a-tic-tac-toe-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 165 Problem 1"}, {"ID": 1276, "Title": "Number of Burgers with No Waste of Ingredients", "TitleCn": "\u4e0d\u6d6a\u8d39\u539f\u6599\u7684\u6c49\u5821\u5236\u4f5c\u65b9\u6848", "Url": "https://leetcode.cn/problems/number-of-burgers-with-no-waste-of-ingredients/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 165 Problem 2"}, {"ID": 1277, "Title": "Count Square Submatrices with All Ones", "TitleCn": "\u7edf\u8ba1\u5168\u4e3a 1 \u7684\u6b63\u65b9\u5f62\u5b50\u77e9\u9635", "Url": "https://leetcode.cn/problems/count-square-submatrices-with-all-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 165 Problem 3"}, {"ID": 1278, "Title": "Palindrome Partitioning III", "TitleCn": "\u5206\u5272\u56de\u6587\u4e32 III", "Url": "https://leetcode.cn/problems/palindrome-partitioning-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 165 Problem 4"}, {"ID": 1279, "Title": "Traffic Light Controlled Intersection", "TitleCn": "\u7ea2\u7eff\u706f\u8def\u53e3", "Url": "https://leetcode.cn/problems/traffic-light-controlled-intersection/", "Ispaid": 1, "Type": "Concurrency", "Level": 5, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1280, "Title": "Students and Examinations", "TitleCn": "\u5b66\u751f\u4eec\u53c2\u52a0\u5404\u79d1\u6d4b\u8bd5\u7684\u6b21\u6570", "Url": "https://leetcode.cn/problems/students-and-examinations/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1281, "Title": "Subtract the Product and Sum of Digits of an Integer", "TitleCn": "\u6574\u6570\u7684\u5404\u4f4d\u79ef\u548c\u4e4b\u5dee", "Url": "https://leetcode.cn/problems/subtract-the-product-and-sum-of-digits-of-an-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 166 Problem 1"}, {"ID": 1282, "Title": "Group the People Given the Group Size They Belong To", "TitleCn": "\u7528\u6237\u5206\u7ec4", "Url": "https://leetcode.cn/problems/group-the-people-given-the-group-size-they-belong-to/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 166 Problem 2"}, {"ID": 1283, "Title": "Find the Smallest Divisor Given a Threshold", "TitleCn": "\u4f7f\u7ed3\u679c\u4e0d\u8d85\u8fc7\u9608\u503c\u7684\u6700\u5c0f\u9664\u6570", "Url": "https://leetcode.cn/problems/find-the-smallest-divisor-given-a-threshold/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 166 Problem 3"}, {"ID": 1284, "Title": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix", "TitleCn": "\u8f6c\u5316\u4e3a\u5168\u96f6\u77e9\u9635\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 166 Problem 4"}, {"ID": 1285, "Title": "Find the Start and End Number of Continuous Ranges", "TitleCn": "\u627e\u5230\u8fde\u7eed\u533a\u95f4\u7684\u5f00\u59cb\u548c\u7ed3\u675f\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-the-start-and-end-number-of-continuous-ranges/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1286, "Title": "Iterator for Combination", "TitleCn": "\u5b57\u6bcd\u7ec4\u5408\u8fed\u4ee3\u5668", "Url": "https://leetcode.cn/problems/iterator-for-combination/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 15 Problem 3"}, {"ID": 1287, "Title": "Element Appearing More Than 25% In Sorted Array", "TitleCn": "\u6709\u5e8f\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u8d85\u8fc725%\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/element-appearing-more-than-25-in-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 15 Problem 1"}, {"ID": 1288, "Title": "Remove Covered Intervals", "TitleCn": "\u5220\u9664\u88ab\u8986\u76d6\u533a\u95f4", "Url": "https://leetcode.cn/problems/remove-covered-intervals/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 15 Problem 2"}, {"ID": 1289, "Title": "Minimum Falling Path Sum II", "TitleCn": "\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c  II", "Url": "https://leetcode.cn/problems/minimum-falling-path-sum-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 15 Problem 4"}, {"ID": 1290, "Title": "Convert Binary Number in a Linked List to Integer", "TitleCn": "\u4e8c\u8fdb\u5236\u94fe\u8868\u8f6c\u6574\u6570", "Url": "https://leetcode.cn/problems/convert-binary-number-in-a-linked-list-to-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 167 Problem 1"}, {"ID": 1291, "Title": "Sequential Digits", "TitleCn": "\u987a\u6b21\u6570", "Url": "https://leetcode.cn/problems/sequential-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 167 Problem 2"}, {"ID": 1292, "Title": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold", "TitleCn": "\u5143\u7d20\u548c\u5c0f\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u6b63\u65b9\u5f62\u7684\u6700\u5927\u8fb9\u957f", "Url": "https://leetcode.cn/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 167 Problem 3"}, {"ID": 1293, "Title": "Shortest Path in a Grid with Obstacles Elimination", "TitleCn": "\u7f51\u683c\u4e2d\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-path-in-a-grid-with-obstacles-elimination/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 167 Problem 4"}, {"ID": 1294, "Title": "Weather Type in Each Country", "TitleCn": "\u4e0d\u540c\u56fd\u5bb6\u7684\u5929\u6c14\u7c7b\u578b", "Url": "https://leetcode.cn/problems/weather-type-in-each-country/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1295, "Title": "Find Numbers with Even Number of Digits", "TitleCn": "\u7edf\u8ba1\u4f4d\u6570\u4e3a\u5076\u6570\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-numbers-with-even-number-of-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 168 Problem 1"}, {"ID": 1296, "Title": "Divide Array in Sets of K Consecutive Numbers", "TitleCn": "\u5212\u5206\u6570\u7ec4\u4e3a\u8fde\u7eed\u6570\u5b57\u7684\u96c6\u5408", "Url": "https://leetcode.cn/problems/divide-array-in-sets-of-k-consecutive-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 168 Problem 2"}, {"ID": 1297, "Title": "Maximum Number of Occurrences of a Substring", "TitleCn": "\u5b50\u4e32\u7684\u6700\u5927\u51fa\u73b0\u6b21\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-occurrences-of-a-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 168 Problem 3"}, {"ID": 1298, "Title": "Maximum Candies You Can Get from Boxes", "TitleCn": "\u4f60\u80fd\u4ece\u76d2\u5b50\u91cc\u83b7\u5f97\u7684\u6700\u5927\u7cd6\u679c\u6570", "Url": "https://leetcode.cn/problems/maximum-candies-you-can-get-from-boxes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 168 Problem 4"}, {"ID": 1299, "Title": "Replace Elements with Greatest Element on Right Side", "TitleCn": "\u5c06\u6bcf\u4e2a\u5143\u7d20\u66ff\u6362\u4e3a\u53f3\u4fa7\u6700\u5927\u5143\u7d20", "Url": "https://leetcode.cn/problems/replace-elements-with-greatest-element-on-right-side/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 16 Problem 1"}, {"ID": 1300, "Title": "Sum of Mutated Array Closest to Target", "TitleCn": "\u8f6c\u53d8\u6570\u7ec4\u540e\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/sum-of-mutated-array-closest-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 16 Problem 2"}, {"ID": 1301, "Title": "Number of Paths with Max Score", "TitleCn": "\u6700\u5927\u5f97\u5206\u7684\u8def\u5f84\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-paths-with-max-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 16 Problem 4"}, {"ID": 1302, "Title": "Deepest Leaves Sum", "TitleCn": "\u5c42\u6570\u6700\u6df1\u53f6\u5b50\u8282\u70b9\u7684\u548c", "Url": "https://leetcode.cn/problems/deepest-leaves-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 16 Problem 3"}, {"ID": 1303, "Title": "Find the Team Size", "TitleCn": "\u6c42\u56e2\u961f\u4eba\u6570", "Url": "https://leetcode.cn/problems/find-the-team-size/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1304, "Title": "Find N Unique Integers Sum up to Zero", "TitleCn": "\u548c\u4e3a\u96f6\u7684 N \u4e2a\u4e0d\u540c\u6574\u6570", "Url": "https://leetcode.cn/problems/find-n-unique-integers-sum-up-to-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 169 Problem 1"}, {"ID": 1305, "Title": "All Elements in Two Binary Search Trees", "TitleCn": "\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u6240\u6709\u5143\u7d20", "Url": "https://leetcode.cn/problems/all-elements-in-two-binary-search-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 169 Problem 2"}, {"ID": 1306, "Title": "Jump Game III", "TitleCn": "\u8df3\u8dc3\u6e38\u620f III", "Url": "https://leetcode.cn/problems/jump-game-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 169 Problem 3"}, {"ID": 1307, "Title": "Verbal Arithmetic Puzzle", "TitleCn": "\u53e3\u7b97\u96be\u9898", "Url": "https://leetcode.cn/problems/verbal-arithmetic-puzzle/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 169 Problem 4"}, {"ID": 1308, "Title": "Running Total for Different Genders", "TitleCn": "\u4e0d\u540c\u6027\u522b\u6bcf\u65e5\u5206\u6570\u603b\u8ba1", "Url": "https://leetcode.cn/problems/running-total-for-different-genders/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1309, "Title": "Decrypt String from Alphabet to Integer Mapping", "TitleCn": "\u89e3\u7801\u5b57\u6bcd\u5230\u6574\u6570\u6620\u5c04", "Url": "https://leetcode.cn/problems/decrypt-string-from-alphabet-to-integer-mapping/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 170 Problem 1"}, {"ID": 1310, "Title": "XOR Queries of a Subarray", "TitleCn": "\u5b50\u6570\u7ec4\u5f02\u6216\u67e5\u8be2", "Url": "https://leetcode.cn/problems/xor-queries-of-a-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 170 Problem 2"}, {"ID": 1311, "Title": "Get Watched Videos by Your Friends", "TitleCn": "\u83b7\u53d6\u4f60\u597d\u53cb\u5df2\u89c2\u770b\u7684\u89c6\u9891", "Url": "https://leetcode.cn/problems/get-watched-videos-by-your-friends/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 170 Problem 3"}, {"ID": 1312, "Title": "Minimum Insertion Steps to Make a String Palindrome", "TitleCn": "\u8ba9\u5b57\u7b26\u4e32\u6210\u4e3a\u56de\u6587\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-insertion-steps-to-make-a-string-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 170 Problem 4"}, {"ID": 1313, "Title": "Decompress Run-Length Encoded List", "TitleCn": "\u89e3\u538b\u7f29\u7f16\u7801\u5217\u8868", "Url": "https://leetcode.cn/problems/decompress-run-length-encoded-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 17 Problem 1"}, {"ID": 1314, "Title": "Matrix Block Sum", "TitleCn": "\u77e9\u9635\u533a\u57df\u548c", "Url": "https://leetcode.cn/problems/matrix-block-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 17 Problem 2"}, {"ID": 1315, "Title": "Sum of Nodes with Even-Valued Grandparent", "TitleCn": "\u7956\u7236\u8282\u70b9\u503c\u4e3a\u5076\u6570\u7684\u8282\u70b9\u548c", "Url": "https://leetcode.cn/problems/sum-of-nodes-with-even-valued-grandparent/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 17 Problem 3"}, {"ID": 1316, "Title": "Distinct Echo Substrings", "TitleCn": "\u4e0d\u540c\u7684\u5faa\u73af\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/distinct-echo-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 17 Problem 4"}, {"ID": 1317, "Title": "Convert Integer to the Sum of Two No-Zero Integers", "TitleCn": "\u5c06\u6574\u6570\u8f6c\u6362\u4e3a\u4e24\u4e2a\u65e0\u96f6\u6574\u6570\u7684\u548c", "Url": "https://leetcode.cn/problems/convert-integer-to-the-sum-of-two-no-zero-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 171 Problem 1"}, {"ID": 1318, "Title": "Minimum Flips to Make a OR b Equal to c", "TitleCn": "\u6216\u8fd0\u7b97\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-flips-to-make-a-or-b-equal-to-c/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 171 Problem 2"}, {"ID": 1319, "Title": "Number of Operations to Make Network Connected", "TitleCn": "\u8fde\u901a\u7f51\u7edc\u7684\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-operations-to-make-network-connected/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 171 Problem 3"}, {"ID": 1320, "Title": "Minimum Distance to Type a Word Using Two Fingers", "TitleCn": "\u4e8c\u6307\u8f93\u5165\u7684\u7684\u6700\u5c0f\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/minimum-distance-to-type-a-word-using-two-fingers/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 171 Problem 4"}, {"ID": 1321, "Title": "Restaurant Growth", "TitleCn": "\u9910\u9986\u8425\u4e1a\u989d\u53d8\u5316\u589e\u957f", "Url": "https://leetcode.cn/problems/restaurant-growth/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1322, "Title": "Ads Performance", "TitleCn": "\u5e7f\u544a\u6548\u679c", "Url": "https://leetcode.cn/problems/ads-performance/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1323, "Title": " Maximum 69 Number", "TitleCn": "6 \u548c 9 \u7ec4\u6210\u7684\u6700\u5927\u6570\u5b57", "Url": "https://leetcode.cn/problems/maximum-69-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 172 Problem 1"}, {"ID": 1324, "Title": "Print Words Vertically", "TitleCn": "\u7ad6\u76f4\u6253\u5370\u5355\u8bcd", "Url": "https://leetcode.cn/problems/print-words-vertically/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 172 Problem 2"}, {"ID": 1325, "Title": "Delete Leaves With a Given Value", "TitleCn": "\u5220\u9664\u7ed9\u5b9a\u503c\u7684\u53f6\u5b50\u8282\u70b9", "Url": "https://leetcode.cn/problems/delete-leaves-with-a-given-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 172 Problem 3"}, {"ID": 1326, "Title": "Minimum Number of Taps to Open to Water a Garden", "TitleCn": "\u704c\u6e89\u82b1\u56ed\u7684\u6700\u5c11\u6c34\u9f99\u5934\u6570\u76ee", "Url": "https://leetcode.cn/problems/minimum-number-of-taps-to-open-to-water-a-garden/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 172 Problem 4"}, {"ID": 1327, "Title": "List the Products Ordered in a Period", "TitleCn": "\u5217\u51fa\u6307\u5b9a\u65f6\u95f4\u6bb5\u5185\u6240\u6709\u7684\u4e0b\u5355\u4ea7\u54c1", "Url": "https://leetcode.cn/problems/list-the-products-ordered-in-a-period/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1328, "Title": "Break a Palindrome", "TitleCn": "\u7834\u574f\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/break-a-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 18 Problem 2"}, {"ID": 1329, "Title": "Sort the Matrix Diagonally", "TitleCn": "\u5c06\u77e9\u9635\u6309\u5bf9\u89d2\u7ebf\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-the-matrix-diagonally/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 18 Problem 3"}, {"ID": 1330, "Title": "Reverse Subarray To Maximize Array Value", "TitleCn": "\u7ffb\u8f6c\u5b50\u6570\u7ec4\u5f97\u5230\u6700\u5927\u7684\u6570\u7ec4\u503c", "Url": "https://leetcode.cn/problems/reverse-subarray-to-maximize-array-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 18 Problem 4"}, {"ID": 1331, "Title": "Rank Transform of an Array", "TitleCn": "\u6570\u7ec4\u5e8f\u53f7\u8f6c\u6362", "Url": "https://leetcode.cn/problems/rank-transform-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 18 Problem 1"}, {"ID": 1332, "Title": "Remove Palindromic Subsequences", "TitleCn": "\u5220\u9664\u56de\u6587\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/remove-palindromic-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 173 Problem 1"}, {"ID": 1333, "Title": "Filter Restaurants by Vegan-Friendly, Price and Distance", "TitleCn": "\u9910\u5385\u8fc7\u6ee4\u5668", "Url": "https://leetcode.cn/problems/filter-restaurants-by-vegan-friendly-price-and-distance/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 173 Problem 2"}, {"ID": 1334, "Title": "Find the City With the Smallest Number of Neighbors at a Threshold Distance", "TitleCn": "\u9608\u503c\u8ddd\u79bb\u5185\u90bb\u5c45\u6700\u5c11\u7684\u57ce\u5e02", "Url": "https://leetcode.cn/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 173 Problem 3"}, {"ID": 1335, "Title": "Minimum Difficulty of a Job Schedule", "TitleCn": "\u5de5\u4f5c\u8ba1\u5212\u7684\u6700\u4f4e\u96be\u5ea6", "Url": "https://leetcode.cn/problems/minimum-difficulty-of-a-job-schedule/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 173 Problem 4"}, {"ID": 1336, "Title": "Number of Transactions per Visit", "TitleCn": "\u6bcf\u6b21\u8bbf\u95ee\u7684\u4ea4\u6613\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-transactions-per-visit/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1337, "Title": "The K Weakest Rows in a Matrix", "TitleCn": "\u65b9\u9635\u4e2d\u6218\u6597\u529b\u6700\u5f31\u7684 K \u884c", "Url": "https://leetcode.cn/problems/the-k-weakest-rows-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 174 Problem 1"}, {"ID": 1338, "Title": "Reduce Array Size to The Half", "TitleCn": "\u6570\u7ec4\u5927\u5c0f\u51cf\u534a", "Url": "https://leetcode.cn/problems/reduce-array-size-to-the-half/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 174 Problem 2"}, {"ID": 1339, "Title": "Maximum Product of Splitted Binary Tree", "TitleCn": "\u5206\u88c2\u4e8c\u53c9\u6811\u7684\u6700\u5927\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-product-of-splitted-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 174 Problem 3"}, {"ID": 1340, "Title": "Jump Game V", "TitleCn": "\u8df3\u8dc3\u6e38\u620f V", "Url": "https://leetcode.cn/problems/jump-game-v/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 174 Problem 4"}, {"ID": 1341, "Title": "Movie Rating", "TitleCn": "\u7535\u5f71\u8bc4\u5206", "Url": "https://leetcode.cn/problems/movie-rating/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1342, "Title": "Number of Steps to Reduce a Number to Zero", "TitleCn": "\u5c06\u6570\u5b57\u53d8\u6210 0 \u7684\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-steps-to-reduce-a-number-to-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 19 Problem 1"}, {"ID": 1343, "Title": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold", "TitleCn": "\u5927\u5c0f\u4e3a K \u4e14\u5e73\u5747\u503c\u5927\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 19 Problem 2"}, {"ID": 1344, "Title": "Angle Between Hands of a Clock", "TitleCn": "\u65f6\u949f\u6307\u9488\u7684\u5939\u89d2", "Url": "https://leetcode.cn/problems/angle-between-hands-of-a-clock/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 19 Problem 3"}, {"ID": 1345, "Title": "Jump Game IV", "TitleCn": "\u8df3\u8dc3\u6e38\u620f IV", "Url": "https://leetcode.cn/problems/jump-game-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 19 Problem 4"}, {"ID": 1346, "Title": "Check If N and Its Double Exist", "TitleCn": "\u68c0\u67e5\u6574\u6570\u53ca\u5176\u4e24\u500d\u6570\u662f\u5426\u5b58\u5728", "Url": "https://leetcode.cn/problems/check-if-n-and-its-double-exist/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 175 Problem 1"}, {"ID": 1347, "Title": "Minimum Number of Steps to Make Two Strings Anagram", "TitleCn": "\u5236\u9020\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u7684\u6700\u5c0f\u6b65\u9aa4\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-steps-to-make-two-strings-anagram/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 175 Problem 2"}, {"ID": 1348, "Title": "Tweet Counts Per Frequency", "TitleCn": "\u63a8\u6587\u8ba1\u6570", "Url": "https://leetcode.cn/problems/tweet-counts-per-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 175 Problem 3"}, {"ID": 1349, "Title": "Maximum Students Taking Exam", "TitleCn": "\u53c2\u52a0\u8003\u8bd5\u7684\u6700\u5927\u5b66\u751f\u6570", "Url": "https://leetcode.cn/problems/maximum-students-taking-exam/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 175 Problem 4"}, {"ID": 1350, "Title": "Students With Invalid Departments", "TitleCn": "\u9662\u7cfb\u65e0\u6548\u7684\u5b66\u751f", "Url": "https://leetcode.cn/problems/students-with-invalid-departments/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1351, "Title": "Count Negative Numbers in a Sorted Matrix", "TitleCn": "\u7edf\u8ba1\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u8d1f\u6570", "Url": "https://leetcode.cn/problems/count-negative-numbers-in-a-sorted-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 176 Problem 1"}, {"ID": 1352, "Title": "Product of the Last K Numbers", "TitleCn": "\u6700\u540e K \u4e2a\u6570\u7684\u4e58\u79ef", "Url": "https://leetcode.cn/problems/product-of-the-last-k-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 176 Problem 2"}, {"ID": 1353, "Title": "Maximum Number of Events That Can Be Attended", "TitleCn": "\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-events-that-can-be-attended/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 176 Problem 3"}, {"ID": 1354, "Title": "Construct Target Array With Multiple Sums", "TitleCn": "\u591a\u6b21\u6c42\u548c\u6784\u9020\u76ee\u6807\u6570\u7ec4", "Url": "https://leetcode.cn/problems/construct-target-array-with-multiple-sums/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 176 Problem 4"}, {"ID": 1355, "Title": "Activity Participants", "TitleCn": "\u6d3b\u52a8\u53c2\u4e0e\u8005", "Url": "https://leetcode.cn/problems/activity-participants/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1356, "Title": "Sort Integers by The Number of 1 Bits", "TitleCn": "\u6839\u636e\u6570\u5b57\u4e8c\u8fdb\u5236\u4e0b 1 \u7684\u6570\u76ee\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-integers-by-the-number-of-1-bits/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 20 Problem 1"}, {"ID": 1357, "Title": "Apply Discount Every n Orders", "TitleCn": "\u6bcf\u9694 n \u4e2a\u987e\u5ba2\u6253\u6298", "Url": "https://leetcode.cn/problems/apply-discount-every-n-orders/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 20 Problem 2"}, {"ID": 1358, "Title": "Number of Substrings Containing All Three Characters", "TitleCn": "\u5305\u542b\u6240\u6709\u4e09\u79cd\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 20 Problem 3"}, {"ID": 1359, "Title": "Count All Valid Pickup and Delivery Options", "TitleCn": "\u6709\u6548\u7684\u5feb\u9012\u5e8f\u5217\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-all-valid-pickup-and-delivery-options/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 20 Problem 4"}, {"ID": 1360, "Title": "Number of Days Between Two Dates", "TitleCn": "\u65e5\u671f\u4e4b\u95f4\u9694\u51e0\u5929", "Url": "https://leetcode.cn/problems/number-of-days-between-two-dates/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 177 Problem 1"}, {"ID": 1361, "Title": "Validate Binary Tree Nodes", "TitleCn": "\u9a8c\u8bc1\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/validate-binary-tree-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 177 Problem 2"}, {"ID": 1362, "Title": "Closest Divisors", "TitleCn": "\u6700\u63a5\u8fd1\u7684\u56e0\u6570", "Url": "https://leetcode.cn/problems/closest-divisors/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 177 Problem 3"}, {"ID": 1363, "Title": "Largest Multiple of Three", "TitleCn": "\u5f62\u6210\u4e09\u7684\u6700\u5927\u500d\u6570", "Url": "https://leetcode.cn/problems/largest-multiple-of-three/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 177 Problem 4"}, {"ID": 1364, "Title": "Number of Trusted Contacts of a Customer", "TitleCn": "\u987e\u5ba2\u7684\u53ef\u4fe1\u8054\u7cfb\u4eba\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-trusted-contacts-of-a-customer/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1365, "Title": "How Many Numbers Are Smaller Than the Current Number", "TitleCn": "\u6709\u591a\u5c11\u5c0f\u4e8e\u5f53\u524d\u6570\u5b57\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/how-many-numbers-are-smaller-than-the-current-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 178 Problem 1"}, {"ID": 1366, "Title": "Rank Teams by Votes", "TitleCn": "\u901a\u8fc7\u6295\u7968\u5bf9\u56e2\u961f\u6392\u540d", "Url": "https://leetcode.cn/problems/rank-teams-by-votes/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 178 Problem 2"}, {"ID": 1367, "Title": "Linked List in Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u7684\u5217\u8868", "Url": "https://leetcode.cn/problems/linked-list-in-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 178 Problem 3"}, {"ID": 1368, "Title": "Minimum Cost to Make at Least One Valid Path in a Grid", "TitleCn": "\u4f7f\u7f51\u683c\u56fe\u81f3\u5c11\u6709\u4e00\u6761\u6709\u6548\u8def\u5f84\u7684\u6700\u5c0f\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 178 Problem 4"}, {"ID": 1369, "Title": "Get the Second Most Recent Activity", "TitleCn": "\u83b7\u53d6\u6700\u8fd1\u7b2c\u4e8c\u6b21\u7684\u6d3b\u52a8", "Url": "https://leetcode.cn/problems/get-the-second-most-recent-activity/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1370, "Title": "Increasing Decreasing String", "TitleCn": "\u4e0a\u5347\u4e0b\u964d\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/increasing-decreasing-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 21 Problem 1"}, {"ID": 1371, "Title": "Find the Longest Substring Containing Vowels in Even Counts", "TitleCn": "\u6bcf\u4e2a\u5143\u97f3\u5305\u542b\u5076\u6570\u6b21\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-the-longest-substring-containing-vowels-in-even-counts/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 21 Problem 2"}, {"ID": 1372, "Title": "Longest ZigZag Path in a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u957f\u4ea4\u9519\u8def\u5f84", "Url": "https://leetcode.cn/problems/longest-zigzag-path-in-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 21 Problem 3"}, {"ID": 1373, "Title": "Maximum Sum BST in Binary Tree", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u5b50\u6811\u7684\u6700\u5927\u952e\u503c\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-bst-in-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 21 Problem 4"}, {"ID": 1374, "Title": "Generate a String With Characters That Have Odd Counts", "TitleCn": "\u751f\u6210\u6bcf\u79cd\u5b57\u7b26\u90fd\u662f\u5947\u6570\u4e2a\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/generate-a-string-with-characters-that-have-odd-counts/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 179 Problem 1"}, {"ID": 1375, "Title": "Number of Times Binary String Is Prefix-Aligned", "TitleCn": "\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u524d\u7f00\u4e00\u81f4\u7684\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-times-binary-string-is-prefix-aligned/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 179 Problem 2"}, {"ID": 1376, "Title": "Time Needed to Inform All Employees", "TitleCn": "\u901a\u77e5\u6240\u6709\u5458\u5de5\u6240\u9700\u7684\u65f6\u95f4", "Url": "https://leetcode.cn/problems/time-needed-to-inform-all-employees/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 179 Problem 3"}, {"ID": 1377, "Title": "Frog Position After T Seconds", "TitleCn": "T \u79d2\u540e\u9752\u86d9\u7684\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/frog-position-after-t-seconds/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 179 Problem 4"}, {"ID": 1378, "Title": "Replace Employee ID With The Unique Identifier", "TitleCn": "\u4f7f\u7528\u552f\u4e00\u6807\u8bc6\u7801\u66ff\u6362\u5458\u5de5ID", "Url": "https://leetcode.cn/problems/replace-employee-id-with-the-unique-identifier/", "Ispaid": 0, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1379, "Title": "Find a Corresponding Node of a Binary Tree in a Clone of That Tree", "TitleCn": "\u627e\u51fa\u514b\u9686\u4e8c\u53c9\u6811\u4e2d\u7684\u76f8\u540c\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1380, "Title": "Lucky Numbers in a Matrix", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u5e78\u8fd0\u6570", "Url": "https://leetcode.cn/problems/lucky-numbers-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 180 Problem 1"}, {"ID": 1381, "Title": "Design a Stack With Increment Operation", "TitleCn": "\u8bbe\u8ba1\u4e00\u4e2a\u652f\u6301\u589e\u91cf\u64cd\u4f5c\u7684\u6808", "Url": "https://leetcode.cn/problems/design-a-stack-with-increment-operation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 180 Problem 2"}, {"ID": 1382, "Title": "Balance a Binary Search Tree", "TitleCn": "\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u53d8\u5e73\u8861", "Url": "https://leetcode.cn/problems/balance-a-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 180 Problem 3"}, {"ID": 1383, "Title": "Maximum Performance of a Team", "TitleCn": "\u6700\u5927\u7684\u56e2\u961f\u8868\u73b0\u503c", "Url": "https://leetcode.cn/problems/maximum-performance-of-a-team/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 180 Problem 4"}, {"ID": 1384, "Title": "Total Sales Amount by Year", "TitleCn": "\u6309\u5e74\u5ea6\u5217\u51fa\u9500\u552e\u603b\u989d", "Url": "https://leetcode.cn/problems/total-sales-amount-by-year/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1385, "Title": "Find the Distance Value Between Two Arrays", "TitleCn": "\u4e24\u4e2a\u6570\u7ec4\u95f4\u7684\u8ddd\u79bb\u503c", "Url": "https://leetcode.cn/problems/find-the-distance-value-between-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 22 Problem 1"}, {"ID": 1386, "Title": "Cinema Seat Allocation", "TitleCn": "\u5b89\u6392\u7535\u5f71\u9662\u5ea7\u4f4d", "Url": "https://leetcode.cn/problems/cinema-seat-allocation/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 22 Problem 2"}, {"ID": 1387, "Title": "Sort Integers by The Power Value", "TitleCn": "\u5c06\u6574\u6570\u6309\u6743\u91cd\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-integers-by-the-power-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 22 Problem 3"}, {"ID": 1388, "Title": "Pizza With 3n Slices", "TitleCn": "3n \u5757\u62ab\u8428", "Url": "https://leetcode.cn/problems/pizza-with-3n-slices/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 22 Problem 4"}, {"ID": 1389, "Title": "Create Target Array in the Given Order", "TitleCn": "\u6309\u65e2\u5b9a\u987a\u5e8f\u521b\u5efa\u76ee\u6807\u6570\u7ec4", "Url": "https://leetcode.cn/problems/create-target-array-in-the-given-order/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 181 Problem 1"}, {"ID": 1390, "Title": "Four Divisors", "TitleCn": "\u56db\u56e0\u6570", "Url": "https://leetcode.cn/problems/four-divisors/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 181 Problem 2"}, {"ID": 1391, "Title": "Check if There is a Valid Path in a Grid", "TitleCn": "\u68c0\u67e5\u7f51\u683c\u4e2d\u662f\u5426\u5b58\u5728\u6709\u6548\u8def\u5f84", "Url": "https://leetcode.cn/problems/check-if-there-is-a-valid-path-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 181 Problem 3"}, {"ID": 1392, "Title": "Longest Happy Prefix", "TitleCn": "\u6700\u957f\u5feb\u4e50\u524d\u7f00", "Url": "https://leetcode.cn/problems/longest-happy-prefix/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 181 Problem 4"}, {"ID": 1393, "Title": "Capital Gain/Loss", "TitleCn": "\u80a1\u7968\u7684\u8d44\u672c\u635f\u76ca", "Url": "https://leetcode.cn/problems/capital-gainloss/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1394, "Title": "Find Lucky Integer in an Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u5e78\u8fd0\u6570", "Url": "https://leetcode.cn/problems/find-lucky-integer-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 182 Problem 1"}, {"ID": 1395, "Title": "Count Number of Teams", "TitleCn": "\u7edf\u8ba1\u4f5c\u6218\u5355\u4f4d\u6570", "Url": "https://leetcode.cn/problems/count-number-of-teams/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 182 Problem 2"}, {"ID": 1396, "Title": "Design Underground System", "TitleCn": "\u8bbe\u8ba1\u5730\u94c1\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-underground-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 182 Problem 3"}, {"ID": 1397, "Title": "Find All Good Strings", "TitleCn": "\u627e\u5230\u6240\u6709\u597d\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-all-good-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 182 Problem 4"}, {"ID": 1398, "Title": "Customers Who Bought Products A and B but Not C", "TitleCn": "\u8d2d\u4e70\u4e86\u4ea7\u54c1A\u548c\u4ea7\u54c1B\u5374\u6ca1\u6709\u8d2d\u4e70\u4ea7\u54c1C\u7684\u987e\u5ba2", "Url": "https://leetcode.cn/problems/customers-who-bought-products-a-and-b-but-not-c/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1399, "Title": "Count Largest Group", "TitleCn": "\u7edf\u8ba1\u6700\u5927\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-largest-group/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 23 Problem 1"}, {"ID": 1400, "Title": "Construct K Palindrome Strings", "TitleCn": "\u6784\u9020 K \u4e2a\u56de\u6587\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/construct-k-palindrome-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 23 Problem 2"}, {"ID": 1401, "Title": "Circle and Rectangle Overlapping", "TitleCn": "\u5706\u548c\u77e9\u5f62\u662f\u5426\u6709\u91cd\u53e0", "Url": "https://leetcode.cn/problems/circle-and-rectangle-overlapping/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 23 Problem 3"}, {"ID": 1402, "Title": "Reducing Dishes", "TitleCn": "\u505a\u83dc\u987a\u5e8f", "Url": "https://leetcode.cn/problems/reducing-dishes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 23 Problem 4"}, {"ID": 1403, "Title": "Minimum Subsequence in Non-Increasing Order", "TitleCn": "\u975e\u9012\u589e\u987a\u5e8f\u7684\u6700\u5c0f\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/minimum-subsequence-in-non-increasing-order/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 183 Problem 1"}, {"ID": 1404, "Title": "Number of Steps to Reduce a Number in Binary Representation to One", "TitleCn": "\u5c06\u4e8c\u8fdb\u5236\u8868\u793a\u51cf\u5230 1 \u7684\u6b65\u9aa4\u6570", "Url": "https://leetcode.cn/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 183 Problem 2"}, {"ID": 1405, "Title": "Longest Happy String", "TitleCn": "\u6700\u957f\u5feb\u4e50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/longest-happy-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 183 Problem 3"}, {"ID": 1406, "Title": "Stone Game III", "TitleCn": "\u77f3\u5b50\u6e38\u620f III", "Url": "https://leetcode.cn/problems/stone-game-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 183 Problem 4"}, {"ID": 1407, "Title": "Top Travellers", "TitleCn": "\u6392\u540d\u9760\u524d\u7684\u65c5\u884c\u8005", "Url": "https://leetcode.cn/problems/top-travellers/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1408, "Title": "String Matching in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684\u5b57\u7b26\u4e32\u5339\u914d", "Url": "https://leetcode.cn/problems/string-matching-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 184 Problem 1"}, {"ID": 1409, "Title": "Queries on a Permutation With Key", "TitleCn": "\u67e5\u8be2\u5e26\u952e\u7684\u6392\u5217", "Url": "https://leetcode.cn/problems/queries-on-a-permutation-with-key/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 184 Problem 2"}, {"ID": 1410, "Title": "HTML Entity Parser", "TitleCn": "HTML \u5b9e\u4f53\u89e3\u6790\u5668", "Url": "https://leetcode.cn/problems/html-entity-parser/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 184 Problem 3"}, {"ID": 1411, "Title": "Number of Ways to Paint N \u00d7 3 Grid", "TitleCn": "\u7ed9 N x 3 \u7f51\u683c\u56fe\u6d82\u8272\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-paint-n-3-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 184 Problem 4"}, {"ID": 1412, "Title": "Find the Quiet Students in All Exams", "TitleCn": "\u67e5\u627e\u6210\u7ee9\u5904\u4e8e\u4e2d\u6e38\u7684\u5b66\u751f", "Url": "https://leetcode.cn/problems/find-the-quiet-students-in-all-exams/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1413, "Title": "Minimum Value to Get Positive Step by Step Sum", "TitleCn": "\u9010\u6b65\u6c42\u548c\u5f97\u5230\u6b63\u6570\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/minimum-value-to-get-positive-step-by-step-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 24 Problem 1"}, {"ID": 1414, "Title": "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K", "TitleCn": "\u548c\u4e3a K \u7684\u6700\u5c11\u6590\u6ce2\u90a3\u5951\u6570\u5b57\u6570\u76ee", "Url": "https://leetcode.cn/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 24 Problem 2"}, {"ID": 1415, "Title": "The k-th Lexicographical String of All Happy Strings of Length n", "TitleCn": "\u957f\u5ea6\u4e3a n \u7684\u5f00\u5fc3\u5b57\u7b26\u4e32\u4e2d\u5b57\u5178\u5e8f\u7b2c k \u5c0f\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 24 Problem 3"}, {"ID": 1416, "Title": "Restore The Array", "TitleCn": "\u6062\u590d\u6570\u7ec4", "Url": "https://leetcode.cn/problems/restore-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 24 Problem 4"}, {"ID": 1417, "Title": "Reformat The String", "TitleCn": "\u91cd\u65b0\u683c\u5f0f\u5316\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/reformat-the-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 185 Problem 1"}, {"ID": 1418, "Title": "Display Table of Food Orders in a Restaurant", "TitleCn": "\u70b9\u83dc\u5c55\u793a\u8868", "Url": "https://leetcode.cn/problems/display-table-of-food-orders-in-a-restaurant/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 185 Problem 2"}, {"ID": 1419, "Title": "Minimum Number of Frogs Croaking", "TitleCn": "\u6570\u9752\u86d9", "Url": "https://leetcode.cn/problems/minimum-number-of-frogs-croaking/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 185 Problem 3"}, {"ID": 1420, "Title": "Build Array Where You Can Find The Maximum Exactly K Comparisons", "TitleCn": "\u751f\u6210\u6570\u7ec4", "Url": "https://leetcode.cn/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 185 Problem 4"}, {"ID": 1421, "Title": "NPV Queries", "TitleCn": "\u51c0\u73b0\u503c\u67e5\u8be2", "Url": "https://leetcode.cn/problems/npv-queries/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1422, "Title": "Maximum Score After Splitting a String", "TitleCn": "\u5206\u5272\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-score-after-splitting-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 186 Problem 1"}, {"ID": 1423, "Title": "Maximum Points You Can Obtain from Cards", "TitleCn": "\u53ef\u83b7\u5f97\u7684\u6700\u5927\u70b9\u6570", "Url": "https://leetcode.cn/problems/maximum-points-you-can-obtain-from-cards/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 186 Problem 2"}, {"ID": 1424, "Title": "Diagonal Traverse II", "TitleCn": "\u5bf9\u89d2\u7ebf\u904d\u5386 II", "Url": "https://leetcode.cn/problems/diagonal-traverse-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 186 Problem 3"}, {"ID": 1425, "Title": "Constrained Subsequence Sum", "TitleCn": "\u5e26\u9650\u5236\u7684\u5b50\u5e8f\u5217\u548c", "Url": "https://leetcode.cn/problems/constrained-subsequence-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 186 Problem 4"}, {"ID": 1426, "Title": "Counting Elements", "TitleCn": "\u6570\u5143\u7d20", "Url": "https://leetcode.cn/problems/counting-elements/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1427, "Title": "Perform String Shifts", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u5de6\u53f3\u79fb", "Url": "https://leetcode.cn/problems/perform-string-shifts/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1428, "Title": "Leftmost Column with at Least a One", "TitleCn": "\u81f3\u5c11\u6709\u4e00\u4e2a 1 \u7684\u6700\u5de6\u7aef\u5217", "Url": "https://leetcode.cn/problems/leftmost-column-with-at-least-a-one/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1429, "Title": "First Unique Number", "TitleCn": "\u7b2c\u4e00\u4e2a\u552f\u4e00\u6570\u5b57", "Url": "https://leetcode.cn/problems/first-unique-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1430, "Title": "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree", "TitleCn": "\u5224\u65ad\u7ed9\u5b9a\u7684\u5e8f\u5217\u662f\u5426\u662f\u4e8c\u53c9\u6811\u4ece\u6839\u5230\u53f6\u7684\u8def\u5f84", "Url": "https://leetcode.cn/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1431, "Title": "Kids With the Greatest Number of Candies", "TitleCn": "\u62e5\u6709\u6700\u591a\u7cd6\u679c\u7684\u5b69\u5b50", "Url": "https://leetcode.cn/problems/kids-with-the-greatest-number-of-candies/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 25 Problem 1"}, {"ID": 1432, "Title": "Max Difference You Can Get From Changing an Integer", "TitleCn": "\u6539\u53d8\u4e00\u4e2a\u6574\u6570\u80fd\u5f97\u5230\u7684\u6700\u5927\u5dee\u503c", "Url": "https://leetcode.cn/problems/max-difference-you-can-get-from-changing-an-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 25 Problem 2"}, {"ID": 1433, "Title": "Check If a String Can Break Another String", "TitleCn": "\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u6253\u7834\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/check-if-a-string-can-break-another-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 25 Problem 3"}, {"ID": 1434, "Title": "Number of Ways to Wear Different Hats to Each Other", "TitleCn": "\u6bcf\u4e2a\u4eba\u6234\u4e0d\u540c\u5e3d\u5b50\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-wear-different-hats-to-each-other/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 25 Problem 4"}, {"ID": 1435, "Title": "Create a Session Bar Chart", "TitleCn": "\u5236\u4f5c\u4f1a\u8bdd\u67f1\u72b6\u56fe", "Url": "https://leetcode.cn/problems/create-a-session-bar-chart/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1436, "Title": "Destination City", "TitleCn": "\u65c5\u884c\u7ec8\u70b9\u7ad9", "Url": "https://leetcode.cn/problems/destination-city/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 187 Problem 1"}, {"ID": 1437, "Title": "Check If All 1's Are at Least Length K Places Away", "TitleCn": "\u662f\u5426\u6240\u6709 1 \u90fd\u81f3\u5c11\u76f8\u9694 k \u4e2a\u5143\u7d20", "Url": "https://leetcode.cn/problems/check-if-all-1s-are-at-least-length-k-places-away/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 187 Problem 2"}, {"ID": 1438, "Title": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit", "TitleCn": "\u7edd\u5bf9\u5dee\u4e0d\u8d85\u8fc7\u9650\u5236\u7684\u6700\u957f\u8fde\u7eed\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 187 Problem 3"}, {"ID": 1439, "Title": "Find the Kth Smallest Sum of a Matrix With Sorted Rows", "TitleCn": "\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u7b2c k \u4e2a\u6700\u5c0f\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 187 Problem 4"}, {"ID": 1440, "Title": "Evaluate Boolean Expression", "TitleCn": "\u8ba1\u7b97\u5e03\u5c14\u8868\u8fbe\u5f0f\u7684\u503c", "Url": "https://leetcode.cn/problems/evaluate-boolean-expression/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1441, "Title": "Build an Array With Stack Operations", "TitleCn": "\u7528\u6808\u64cd\u4f5c\u6784\u5efa\u6570\u7ec4", "Url": "https://leetcode.cn/problems/build-an-array-with-stack-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 188 Problem 1"}, {"ID": 1442, "Title": "Count Triplets That Can Form Two Arrays of Equal XOR", "TitleCn": "\u5f62\u6210\u4e24\u4e2a\u5f02\u6216\u76f8\u7b49\u6570\u7ec4\u7684\u4e09\u5143\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 188 Problem 2"}, {"ID": 1443, "Title": "Minimum Time to Collect All Apples in a Tree", "TitleCn": "\u6536\u96c6\u6811\u4e0a\u6240\u6709\u82f9\u679c\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-collect-all-apples-in-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 188 Problem 3"}, {"ID": 1444, "Title": "Number of Ways of Cutting a Pizza", "TitleCn": "\u5207\u62ab\u8428\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-of-cutting-a-pizza/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 188 Problem 4"}, {"ID": 1445, "Title": "Apples & Oranges", "TitleCn": "\u82f9\u679c\u548c\u6854\u5b50", "Url": "https://leetcode.cn/problems/apples-oranges/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1446, "Title": "Consecutive Characters", "TitleCn": "\u8fde\u7eed\u5b57\u7b26", "Url": "https://leetcode.cn/problems/consecutive-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 26 Problem 1"}, {"ID": 1447, "Title": "Simplified Fractions", "TitleCn": "\u6700\u7b80\u5206\u6570", "Url": "https://leetcode.cn/problems/simplified-fractions/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 26 Problem 2"}, {"ID": 1448, "Title": "Count Good Nodes in Binary Tree", "TitleCn": "\u7edf\u8ba1\u4e8c\u53c9\u6811\u4e2d\u597d\u8282\u70b9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-good-nodes-in-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 26 Problem 3"}, {"ID": 1449, "Title": "Form Largest Integer With Digits That Add up to Target", "TitleCn": "\u6570\u4f4d\u6210\u672c\u548c\u4e3a\u76ee\u6807\u503c\u7684\u6700\u5927\u6570\u5b57", "Url": "https://leetcode.cn/problems/form-largest-integer-with-digits-that-add-up-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 26 Problem 4"}, {"ID": 1450, "Title": "Number of Students Doing Homework at a Given Time", "TitleCn": "\u5728\u65e2\u5b9a\u65f6\u95f4\u505a\u4f5c\u4e1a\u7684\u5b66\u751f\u4eba\u6570", "Url": "https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 189 Problem 1"}, {"ID": 1451, "Title": "Rearrange Words in a Sentence", "TitleCn": "\u91cd\u65b0\u6392\u5217\u53e5\u5b50\u4e2d\u7684\u5355\u8bcd", "Url": "https://leetcode.cn/problems/rearrange-words-in-a-sentence/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 189 Problem 2"}, {"ID": 1452, "Title": "People Whose List of Favorite Companies Is Not a Subset of Another List", "TitleCn": "\u6536\u85cf\u6e05\u5355", "Url": "https://leetcode.cn/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 189 Problem 3"}, {"ID": 1453, "Title": "Maximum Number of Darts Inside of a Circular Dartboard", "TitleCn": "\u5706\u5f62\u9776\u5185\u7684\u6700\u5927\u98de\u9556\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-darts-inside-of-a-circular-dartboard/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 189 Problem 4"}, {"ID": 1454, "Title": "Active Users", "TitleCn": "\u6d3b\u8dc3\u7528\u6237", "Url": "https://leetcode.cn/problems/active-users/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1455, "Title": "Check If a Word Occurs As a Prefix of Any Word in a Sentence", "TitleCn": "\u68c0\u67e5\u5355\u8bcd\u662f\u5426\u4e3a\u53e5\u4e2d\u5176\u4ed6\u5355\u8bcd\u7684\u524d\u7f00", "Url": "https://leetcode.cn/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 190 Problem 1"}, {"ID": 1456, "Title": "Maximum Number of Vowels in a Substring of Given Length", "TitleCn": "\u5b9a\u957f\u5b50\u4e32\u4e2d\u5143\u97f3\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-vowels-in-a-substring-of-given-length/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 190 Problem 2"}, {"ID": 1457, "Title": "Pseudo-Palindromic Paths in a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u7684\u4f2a\u56de\u6587\u8def\u5f84", "Url": "https://leetcode.cn/problems/pseudo-palindromic-paths-in-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 190 Problem 3"}, {"ID": 1458, "Title": "Max Dot Product of Two Subsequences", "TitleCn": "\u4e24\u4e2a\u5b50\u5e8f\u5217\u7684\u6700\u5927\u70b9\u79ef", "Url": "https://leetcode.cn/problems/max-dot-product-of-two-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 190 Problem 4"}, {"ID": 1459, "Title": "Rectangles Area", "TitleCn": "\u77e9\u5f62\u9762\u79ef", "Url": "https://leetcode.cn/problems/rectangles-area/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1460, "Title": "Make Two Arrays Equal by Reversing Subarrays", "TitleCn": "\u901a\u8fc7\u7ffb\u8f6c\u5b50\u6570\u7ec4\u4f7f\u4e24\u4e2a\u6570\u7ec4\u76f8\u7b49", "Url": "https://leetcode.cn/problems/make-two-arrays-equal-by-reversing-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 27 Problem 1"}, {"ID": 1461, "Title": "Check If a String Contains All Binary Codes of Size K", "TitleCn": "\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u5305\u542b\u6240\u6709\u957f\u5ea6\u4e3a K \u7684\u4e8c\u8fdb\u5236\u5b50\u4e32", "Url": "https://leetcode.cn/problems/check-if-a-string-contains-all-binary-codes-of-size-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 27 Problem 2"}, {"ID": 1462, "Title": "Course Schedule IV", "TitleCn": "\u8bfe\u7a0b\u8868 IV", "Url": "https://leetcode.cn/problems/course-schedule-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 27 Problem 3"}, {"ID": 1463, "Title": "Cherry Pickup II", "TitleCn": "\u6458\u6a31\u6843 II", "Url": "https://leetcode.cn/problems/cherry-pickup-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 27 Problem 4"}, {"ID": 1464, "Title": "Maximum Product of Two Elements in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u4e24\u5143\u7d20\u7684\u6700\u5927\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-product-of-two-elements-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 191 Problem 1"}, {"ID": 1465, "Title": "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts", "TitleCn": "\u5207\u5272\u540e\u9762\u79ef\u6700\u5927\u7684\u86cb\u7cd5", "Url": "https://leetcode.cn/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 191 Problem 2"}, {"ID": 1466, "Title": "Reorder Routes to Make All Paths Lead to the City Zero", "TitleCn": "\u91cd\u65b0\u89c4\u5212\u8def\u7ebf", "Url": "https://leetcode.cn/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 191 Problem 3"}, {"ID": 1467, "Title": "Probability of a Two Boxes Having The Same Number of Distinct Balls", "TitleCn": "\u4e24\u4e2a\u76d2\u5b50\u4e2d\u7403\u7684\u989c\u8272\u6570\u76f8\u540c\u7684\u6982\u7387", "Url": "https://leetcode.cn/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 191 Problem 4"}, {"ID": 1468, "Title": "Calculate Salaries", "TitleCn": "\u8ba1\u7b97\u7a0e\u540e\u5de5\u8d44", "Url": "https://leetcode.cn/problems/calculate-salaries/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1469, "Title": "Find All The Lonely Nodes", "TitleCn": "\u5bfb\u627e\u6240\u6709\u7684\u72ec\u751f\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-all-the-lonely-nodes/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1470, "Title": "Shuffle the Array", "TitleCn": "\u91cd\u65b0\u6392\u5217\u6570\u7ec4", "Url": "https://leetcode.cn/problems/shuffle-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 192 Problem 1"}, {"ID": 1471, "Title": "The k Strongest Values in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684 k \u4e2a\u6700\u5f3a\u503c", "Url": "https://leetcode.cn/problems/the-k-strongest-values-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 192 Problem 2"}, {"ID": 1472, "Title": "Design Browser History", "TitleCn": "\u8bbe\u8ba1\u6d4f\u89c8\u5668\u5386\u53f2\u8bb0\u5f55", "Url": "https://leetcode.cn/problems/design-browser-history/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 192 Problem 3"}, {"ID": 1473, "Title": "Paint House III", "TitleCn": "\u7c89\u5237\u623f\u5b50 III", "Url": "https://leetcode.cn/problems/paint-house-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 192 Problem 4"}, {"ID": 1474, "Title": "Delete N Nodes After M Nodes of a Linked List", "TitleCn": "\u5220\u9664\u94fe\u8868 M \u4e2a\u8282\u70b9\u4e4b\u540e\u7684 N \u4e2a\u8282\u70b9", "Url": "https://leetcode.cn/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1475, "Title": "Final Prices With a Special Discount in a Shop", "TitleCn": "\u5546\u54c1\u6298\u6263\u540e\u7684\u6700\u7ec8\u4ef7\u683c", "Url": "https://leetcode.cn/problems/final-prices-with-a-special-discount-in-a-shop/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 28 Problem 1"}, {"ID": 1476, "Title": "Subrectangle Queries", "TitleCn": "\u5b50\u77e9\u5f62\u67e5\u8be2", "Url": "https://leetcode.cn/problems/subrectangle-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 28 Problem 2"}, {"ID": 1477, "Title": "Find Two Non-overlapping Sub-arrays Each With Target Sum", "TitleCn": "\u627e\u4e24\u4e2a\u548c\u4e3a\u76ee\u6807\u503c\u4e14\u4e0d\u91cd\u53e0\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 28 Problem 3"}, {"ID": 1478, "Title": "Allocate Mailboxes", "TitleCn": "\u5b89\u6392\u90ae\u7b52", "Url": "https://leetcode.cn/problems/allocate-mailboxes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 28 Problem 4"}, {"ID": 1479, "Title": "Sales by Day of the Week", "TitleCn": "\u5468\u5185\u6bcf\u5929\u7684\u9500\u552e\u60c5\u51b5", "Url": "https://leetcode.cn/problems/sales-by-day-of-the-week/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1480, "Title": "Running Sum of 1d Array", "TitleCn": "\u4e00\u7ef4\u6570\u7ec4\u7684\u52a8\u6001\u548c", "Url": "https://leetcode.cn/problems/running-sum-of-1d-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 193 Problem 1"}, {"ID": 1481, "Title": "Least Number of Unique Integers after K Removals", "TitleCn": "\u4e0d\u540c\u6574\u6570\u7684\u6700\u5c11\u6570\u76ee", "Url": "https://leetcode.cn/problems/least-number-of-unique-integers-after-k-removals/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 193 Problem 2"}, {"ID": 1482, "Title": "Minimum Number of Days to Make m Bouquets", "TitleCn": "\u5236\u4f5c m \u675f\u82b1\u6240\u9700\u7684\u6700\u5c11\u5929\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-days-to-make-m-bouquets/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 193 Problem 3"}, {"ID": 1483, "Title": "Kth Ancestor of a Tree Node", "TitleCn": "\u6811\u8282\u70b9\u7684\u7b2c K \u4e2a\u7956\u5148", "Url": "https://leetcode.cn/problems/kth-ancestor-of-a-tree-node/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 193 Problem 4"}, {"ID": 1484, "Title": "Group Sold Products By The Date", "TitleCn": "\u6309\u65e5\u671f\u5206\u7ec4\u9500\u552e\u4ea7\u54c1", "Url": "https://leetcode.cn/problems/group-sold-products-by-the-date/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1485, "Title": "Clone Binary Tree With Random Pointer", "TitleCn": "\u514b\u9686\u542b\u968f\u673a\u6307\u9488\u7684\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/clone-binary-tree-with-random-pointer/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1486, "Title": "XOR Operation in an Array", "TitleCn": "\u6570\u7ec4\u5f02\u6216\u64cd\u4f5c", "Url": "https://leetcode.cn/problems/xor-operation-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 194 Problem 1"}, {"ID": 1487, "Title": "Making File Names Unique", "TitleCn": "\u4fdd\u8bc1\u6587\u4ef6\u540d\u552f\u4e00", "Url": "https://leetcode.cn/problems/making-file-names-unique/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 194 Problem 2"}, {"ID": 1488, "Title": "Avoid Flood in The City", "TitleCn": "\u907f\u514d\u6d2a\u6c34\u6cdb\u6ee5", "Url": "https://leetcode.cn/problems/avoid-flood-in-the-city/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 194 Problem 3"}, {"ID": 1489, "Title": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree", "TitleCn": "\u627e\u5230\u6700\u5c0f\u751f\u6210\u6811\u91cc\u7684\u5173\u952e\u8fb9\u548c\u4f2a\u5173\u952e\u8fb9", "Url": "https://leetcode.cn/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 194 Problem 4"}, {"ID": 1490, "Title": "Clone N-ary Tree", "TitleCn": "\u514b\u9686 N \u53c9\u6811", "Url": "https://leetcode.cn/problems/clone-n-ary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1491, "Title": "Average Salary Excluding the Minimum and Maximum Salary", "TitleCn": "\u53bb\u6389\u6700\u4f4e\u5de5\u8d44\u548c\u6700\u9ad8\u5de5\u8d44\u540e\u7684\u5de5\u8d44\u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/average-salary-excluding-the-minimum-and-maximum-salary/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 29 Problem 1"}, {"ID": 1492, "Title": "The kth Factor of n", "TitleCn": "n \u7684\u7b2c k \u4e2a\u56e0\u5b50", "Url": "https://leetcode.cn/problems/the-kth-factor-of-n/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 29 Problem 2"}, {"ID": 1493, "Title": "Longest Subarray of 1's After Deleting One Element", "TitleCn": "\u5220\u6389\u4e00\u4e2a\u5143\u7d20\u4ee5\u540e\u5168\u4e3a 1 \u7684\u6700\u957f\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-subarray-of-1s-after-deleting-one-element/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 29 Problem 3"}, {"ID": 1494, "Title": "Parallel Courses II", "TitleCn": "\u5e76\u884c\u8bfe\u7a0b II", "Url": "https://leetcode.cn/problems/parallel-courses-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 29 Problem 4"}, {"ID": 1495, "Title": "Friendly Movies Streamed Last Month", "TitleCn": "\u4e0a\u6708\u64ad\u653e\u7684\u513f\u7ae5\u9002\u5b9c\u7535\u5f71", "Url": "https://leetcode.cn/problems/friendly-movies-streamed-last-month/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1496, "Title": "Path Crossing", "TitleCn": "\u5224\u65ad\u8def\u5f84\u662f\u5426\u76f8\u4ea4", "Url": "https://leetcode.cn/problems/path-crossing/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 195 Problem 1"}, {"ID": 1497, "Title": "Check If Array Pairs Are Divisible by k", "TitleCn": "\u68c0\u67e5\u6570\u7ec4\u5bf9\u662f\u5426\u53ef\u4ee5\u88ab k \u6574\u9664", "Url": "https://leetcode.cn/problems/check-if-array-pairs-are-divisible-by-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 195 Problem 2"}, {"ID": 1498, "Title": "Number of Subsequences That Satisfy the Given Sum Condition", "TitleCn": "\u6ee1\u8db3\u6761\u4ef6\u7684\u5b50\u5e8f\u5217\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 195 Problem 3"}, {"ID": 1499, "Title": "Max Value of Equation", "TitleCn": "\u6ee1\u8db3\u4e0d\u7b49\u5f0f\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/max-value-of-equation/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 195 Problem 4"}, {"ID": 1500, "Title": "Design a File Sharing System", "TitleCn": "\u8bbe\u8ba1\u6587\u4ef6\u5206\u4eab\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-a-file-sharing-system/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1501, "Title": "Countries You Can Safely Invest In", "TitleCn": "\u53ef\u4ee5\u653e\u5fc3\u6295\u8d44\u7684\u56fd\u5bb6", "Url": "https://leetcode.cn/problems/countries-you-can-safely-invest-in/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1502, "Title": "Can Make Arithmetic Progression From Sequence", "TitleCn": "\u5224\u65ad\u80fd\u5426\u5f62\u6210\u7b49\u5dee\u6570\u5217", "Url": "https://leetcode.cn/problems/can-make-arithmetic-progression-from-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 196 Problem 1"}, {"ID": 1503, "Title": "Last Moment Before All Ants Fall Out of a Plank", "TitleCn": "\u6240\u6709\u8682\u8681\u6389\u4e0b\u6765\u524d\u7684\u6700\u540e\u4e00\u523b", "Url": "https://leetcode.cn/problems/last-moment-before-all-ants-fall-out-of-a-plank/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 196 Problem 2"}, {"ID": 1504, "Title": "Count Submatrices With All Ones", "TitleCn": "\u7edf\u8ba1\u5168 1 \u5b50\u77e9\u5f62", "Url": "https://leetcode.cn/problems/count-submatrices-with-all-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 196 Problem 3"}, {"ID": 1505, "Title": "Minimum Possible Integer After at Most K Adjacent Swaps On Digits", "TitleCn": "\u6700\u591a K \u6b21\u4ea4\u6362\u76f8\u90bb\u6570\u4f4d\u540e\u5f97\u5230\u7684\u6700\u5c0f\u6574\u6570", "Url": "https://leetcode.cn/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 196 Problem 4"}, {"ID": 1506, "Title": "Find Root of N-Ary Tree", "TitleCn": "\u627e\u5230 N \u53c9\u6811\u7684\u6839\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-root-of-n-ary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1507, "Title": "Reformat Date", "TitleCn": "\u8f6c\u53d8\u65e5\u671f\u683c\u5f0f", "Url": "https://leetcode.cn/problems/reformat-date/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 30 Problem 1"}, {"ID": 1508, "Title": "Range Sum of Sorted Subarray Sums", "TitleCn": "\u5b50\u6570\u7ec4\u548c\u6392\u5e8f\u540e\u7684\u533a\u95f4\u548c", "Url": "https://leetcode.cn/problems/range-sum-of-sorted-subarray-sums/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 30 Problem 2"}, {"ID": 1509, "Title": "Minimum Difference Between Largest and Smallest Value in Three Moves", "TitleCn": "\u4e09\u6b21\u64cd\u4f5c\u540e\u6700\u5927\u503c\u4e0e\u6700\u5c0f\u503c\u7684\u6700\u5c0f\u5dee", "Url": "https://leetcode.cn/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 30 Problem 3"}, {"ID": 1510, "Title": "Stone Game IV", "TitleCn": "\u77f3\u5b50\u6e38\u620f IV", "Url": "https://leetcode.cn/problems/stone-game-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 30 Problem 4"}, {"ID": 1511, "Title": "Customer Order Frequency", "TitleCn": "\u6d88\u8d39\u8005\u4e0b\u5355\u9891\u7387", "Url": "https://leetcode.cn/problems/customer-order-frequency/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1512, "Title": "Number of Good Pairs", "TitleCn": "\u597d\u6570\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-good-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 197 Problem 1"}, {"ID": 1513, "Title": "Number of Substrings With Only 1s", "TitleCn": "\u4ec5\u542b 1 \u7684\u5b50\u4e32\u6570", "Url": "https://leetcode.cn/problems/number-of-substrings-with-only-1s/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 197 Problem 2"}, {"ID": 1514, "Title": "Path with Maximum Probability", "TitleCn": "\u6982\u7387\u6700\u5927\u7684\u8def\u5f84", "Url": "https://leetcode.cn/problems/path-with-maximum-probability/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 197 Problem 3"}, {"ID": 1515, "Title": "Best Position for a Service Centre", "TitleCn": "\u670d\u52a1\u4e2d\u5fc3\u7684\u6700\u4f73\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/best-position-for-a-service-centre/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 197 Problem 4"}, {"ID": 1516, "Title": "Move Sub-Tree of N-Ary Tree", "TitleCn": "\u79fb\u52a8 N \u53c9\u6811\u7684\u5b50\u6811", "Url": "https://leetcode.cn/problems/move-sub-tree-of-n-ary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1517, "Title": "Find Users With Valid E-Mails", "TitleCn": "\u67e5\u627e\u62e5\u6709\u6709\u6548\u90ae\u7bb1\u7684\u7528\u6237", "Url": "https://leetcode.cn/problems/find-users-with-valid-e-mails/", "Ispaid": 0, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1518, "Title": "Water Bottles", "TitleCn": "\u6362\u6c34\u95ee\u9898", "Url": "https://leetcode.cn/problems/water-bottles/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 198 Problem 1"}, {"ID": 1519, "Title": "Number of Nodes in the Sub-Tree With the Same Label", "TitleCn": "\u5b50\u6811\u4e2d\u6807\u7b7e\u76f8\u540c\u7684\u8282\u70b9\u6570", "Url": "https://leetcode.cn/problems/number-of-nodes-in-the-sub-tree-with-the-same-label/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 198 Problem 2"}, {"ID": 1520, "Title": "Maximum Number of Non-Overlapping Substrings", "TitleCn": "\u6700\u591a\u7684\u4e0d\u91cd\u53e0\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/maximum-number-of-non-overlapping-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 198 Problem 3"}, {"ID": 1521, "Title": "Find a Value of a Mysterious Function Closest to Target", "TitleCn": "\u627e\u5230\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u51fd\u6570\u503c", "Url": "https://leetcode.cn/problems/find-a-value-of-a-mysterious-function-closest-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 198 Problem 4"}, {"ID": 1522, "Title": "Diameter of N-Ary Tree", "TitleCn": "N \u53c9\u6811\u7684\u76f4\u5f84", "Url": "https://leetcode.cn/problems/diameter-of-n-ary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1523, "Title": "Count Odd Numbers in an Interval Range", "TitleCn": "\u5728\u533a\u95f4\u8303\u56f4\u5185\u7edf\u8ba1\u5947\u6570\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-odd-numbers-in-an-interval-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 31 Problem 1"}, {"ID": 1524, "Title": "Number of Sub-arrays With Odd Sum", "TitleCn": "\u548c\u4e3a\u5947\u6570\u7684\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-sub-arrays-with-odd-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 31 Problem 2"}, {"ID": 1525, "Title": "Number of Good Ways to Split a String", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u597d\u5206\u5272\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-good-ways-to-split-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 31 Problem 3"}, {"ID": 1526, "Title": "Minimum Number of Increments on Subarrays to Form a Target Array", "TitleCn": "\u5f62\u6210\u76ee\u6807\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u6700\u5c11\u589e\u52a0\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 31 Problem 4"}, {"ID": 1527, "Title": "Patients With a Condition", "TitleCn": "\u60a3\u67d0\u79cd\u75be\u75c5\u7684\u60a3\u8005", "Url": "https://leetcode.cn/problems/patients-with-a-condition/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1528, "Title": "Shuffle String", "TitleCn": "\u91cd\u65b0\u6392\u5217\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/shuffle-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 199 Problem 1"}, {"ID": 1529, "Title": "Minimum Suffix Flips", "TitleCn": "\u6700\u5c11\u7684\u540e\u7f00\u7ffb\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-suffix-flips/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 199 Problem 2"}, {"ID": 1530, "Title": "Number of Good Leaf Nodes Pairs", "TitleCn": "\u597d\u53f6\u5b50\u8282\u70b9\u5bf9\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-good-leaf-nodes-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 199 Problem 3"}, {"ID": 1531, "Title": "String Compression II", "TitleCn": "\u538b\u7f29\u5b57\u7b26\u4e32 II", "Url": "https://leetcode.cn/problems/string-compression-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 199 Problem 4"}, {"ID": 1532, "Title": "The Most Recent Three Orders", "TitleCn": "\u6700\u8fd1\u7684\u4e09\u7b14\u8ba2\u5355", "Url": "https://leetcode.cn/problems/the-most-recent-three-orders/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1533, "Title": "Find the Index of the Large Integer", "TitleCn": "\u627e\u5230\u6700\u5927\u6574\u6570\u7684\u7d22\u5f15", "Url": "https://leetcode.cn/problems/find-the-index-of-the-large-integer/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1534, "Title": "Count Good Triplets", "TitleCn": "\u7edf\u8ba1\u597d\u4e09\u5143\u7ec4", "Url": "https://leetcode.cn/problems/count-good-triplets/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 200 Problem 1"}, {"ID": 1535, "Title": "Find the Winner of an Array Game", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u6e38\u620f\u7684\u8d62\u5bb6", "Url": "https://leetcode.cn/problems/find-the-winner-of-an-array-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 200 Problem 2"}, {"ID": 1536, "Title": "Minimum Swaps to Arrange a Binary Grid", "TitleCn": "\u6392\u5e03\u4e8c\u8fdb\u5236\u7f51\u683c\u7684\u6700\u5c11\u4ea4\u6362\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-swaps-to-arrange-a-binary-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 200 Problem 3"}, {"ID": 1537, "Title": "Get the Maximum Score", "TitleCn": "\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/get-the-maximum-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 200 Problem 4"}, {"ID": 1538, "Title": "Guess the Majority in a Hidden Array", "TitleCn": "\u627e\u51fa\u9690\u85cf\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/guess-the-majority-in-a-hidden-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1539, "Title": "Kth Missing Positive Number", "TitleCn": "\u7b2c k \u4e2a\u7f3a\u5931\u7684\u6b63\u6574\u6570", "Url": "https://leetcode.cn/problems/kth-missing-positive-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 32 Problem 1"}, {"ID": 1540, "Title": "Can Convert String in K Moves", "TitleCn": "K \u6b21\u64cd\u4f5c\u8f6c\u53d8\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/can-convert-string-in-k-moves/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 32 Problem 2"}, {"ID": 1541, "Title": "Minimum Insertions to Balance a Parentheses String", "TitleCn": "\u5e73\u8861\u62ec\u53f7\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-insertions-to-balance-a-parentheses-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 32 Problem 3"}, {"ID": 1542, "Title": "Find Longest Awesome Substring", "TitleCn": "\u627e\u51fa\u6700\u957f\u7684\u8d85\u8d5e\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-longest-awesome-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 32 Problem 4"}, {"ID": 1543, "Title": "Fix Product Name Format", "TitleCn": "\u4ea7\u54c1\u540d\u79f0\u683c\u5f0f\u4fee\u590d", "Url": "https://leetcode.cn/problems/fix-product-name-format/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1544, "Title": "Make The String Great", "TitleCn": "\u6574\u7406\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/make-the-string-great/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 201 Problem 1"}, {"ID": 1545, "Title": "Find Kth Bit in Nth Binary String", "TitleCn": "\u627e\u51fa\u7b2c N \u4e2a\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c K \u4f4d", "Url": "https://leetcode.cn/problems/find-kth-bit-in-nth-binary-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 201 Problem 2"}, {"ID": 1546, "Title": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target", "TitleCn": "\u548c\u4e3a\u76ee\u6807\u503c\u7684\u6700\u5927\u6570\u76ee\u4e0d\u91cd\u53e0\u975e\u7a7a\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 201 Problem 3"}, {"ID": 1547, "Title": "Minimum Cost to Cut a Stick", "TitleCn": "\u5207\u68cd\u5b50\u7684\u6700\u5c0f\u6210\u672c", "Url": "https://leetcode.cn/problems/minimum-cost-to-cut-a-stick/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 201 Problem 4"}, {"ID": 1548, "Title": "The Most Similar Path in a Graph", "TitleCn": "\u56fe\u4e2d\u6700\u76f8\u4f3c\u7684\u8def\u5f84", "Url": "https://leetcode.cn/problems/the-most-similar-path-in-a-graph/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 9, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1549, "Title": "The Most Recent Orders for Each Product", "TitleCn": "\u6bcf\u4ef6\u5546\u54c1\u7684\u6700\u65b0\u8ba2\u5355", "Url": "https://leetcode.cn/problems/the-most-recent-orders-for-each-product/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1550, "Title": "Three Consecutive Odds", "TitleCn": "\u5b58\u5728\u8fde\u7eed\u4e09\u4e2a\u5947\u6570\u7684\u6570\u7ec4", "Url": "https://leetcode.cn/problems/three-consecutive-odds/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 202 Problem 1"}, {"ID": 1551, "Title": "Minimum Operations to Make Array Equal", "TitleCn": "\u4f7f\u6570\u7ec4\u4e2d\u6240\u6709\u5143\u7d20\u76f8\u7b49\u7684\u6700\u5c0f\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-array-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 202 Problem 2"}, {"ID": 1552, "Title": "Magnetic Force Between Two Balls", "TitleCn": "\u4e24\u7403\u4e4b\u95f4\u7684\u78c1\u529b", "Url": "https://leetcode.cn/problems/magnetic-force-between-two-balls/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 202 Problem 3"}, {"ID": 1553, "Title": "Minimum Number of Days to Eat N Oranges", "TitleCn": "\u5403\u6389 N \u4e2a\u6a58\u5b50\u7684\u6700\u5c11\u5929\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-days-to-eat-n-oranges/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 202 Problem 4"}, {"ID": 1554, "Title": "Strings Differ by One Character", "TitleCn": "\u53ea\u6709\u4e00\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/strings-differ-by-one-character/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1555, "Title": "Bank Account Summary", "TitleCn": "\u94f6\u884c\u8d26\u6237\u6982\u8981", "Url": "https://leetcode.cn/problems/bank-account-summary/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1556, "Title": "Thousand Separator", "TitleCn": "\u5343\u4f4d\u5206\u9694\u6570", "Url": "https://leetcode.cn/problems/thousand-separator/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 33 Problem 1"}, {"ID": 1557, "Title": "Minimum Number of Vertices to Reach All Nodes", "TitleCn": "\u53ef\u4ee5\u5230\u8fbe\u6240\u6709\u70b9\u7684\u6700\u5c11\u70b9\u6570\u76ee", "Url": "https://leetcode.cn/problems/minimum-number-of-vertices-to-reach-all-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 33 Problem 2"}, {"ID": 1558, "Title": "Minimum Numbers of Function Calls to Make Target Array", "TitleCn": "\u5f97\u5230\u76ee\u6807\u6570\u7ec4\u7684\u6700\u5c11\u51fd\u6570\u8c03\u7528\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-numbers-of-function-calls-to-make-target-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 33 Problem 3"}, {"ID": 1559, "Title": "Detect Cycles in 2D Grid", "TitleCn": "\u4e8c\u7ef4\u7f51\u683c\u56fe\u4e2d\u63a2\u6d4b\u73af", "Url": "https://leetcode.cn/problems/detect-cycles-in-2d-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 33 Problem 4"}, {"ID": 1560, "Title": "Most Visited Sector in a Circular Track", "TitleCn": "\u5706\u5f62\u8d5b\u9053\u4e0a\u7ecf\u8fc7\u6b21\u6570\u6700\u591a\u7684\u6247\u533a", "Url": "https://leetcode.cn/problems/most-visited-sector-in-a-circular-track/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 203 Problem 1"}, {"ID": 1561, "Title": "Maximum Number of Coins You Can Get", "TitleCn": "\u4f60\u53ef\u4ee5\u83b7\u5f97\u7684\u6700\u5927\u786c\u5e01\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-coins-you-can-get/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 203 Problem 2"}, {"ID": 1562, "Title": "Find Latest Group of Size M", "TitleCn": "\u67e5\u627e\u5927\u5c0f\u4e3a M \u7684\u6700\u65b0\u5206\u7ec4", "Url": "https://leetcode.cn/problems/find-latest-group-of-size-m/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 203 Problem 3"}, {"ID": 1563, "Title": "Stone Game V", "TitleCn": "\u77f3\u5b50\u6e38\u620f V", "Url": "https://leetcode.cn/problems/stone-game-v/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 203 Problem 4"}, {"ID": 1564, "Title": "Put Boxes Into the Warehouse I", "TitleCn": "\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc I", "Url": "https://leetcode.cn/problems/put-boxes-into-the-warehouse-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1565, "Title": "Unique Orders and Customers Per Month", "TitleCn": "\u6309\u6708\u7edf\u8ba1\u8ba2\u5355\u6570\u4e0e\u987e\u5ba2\u6570", "Url": "https://leetcode.cn/problems/unique-orders-and-customers-per-month/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1566, "Title": "Detect Pattern of Length M Repeated K or More Times", "TitleCn": "\u91cd\u590d\u81f3\u5c11 K \u6b21\u4e14\u957f\u5ea6\u4e3a M \u7684\u6a21\u5f0f", "Url": "https://leetcode.cn/problems/detect-pattern-of-length-m-repeated-k-or-more-times/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 204 Problem 1"}, {"ID": 1567, "Title": "Maximum Length of Subarray With Positive Product", "TitleCn": "\u4e58\u79ef\u4e3a\u6b63\u6570\u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6", "Url": "https://leetcode.cn/problems/maximum-length-of-subarray-with-positive-product/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 204 Problem 2"}, {"ID": 1568, "Title": "Minimum Number of Days to Disconnect Island", "TitleCn": "\u4f7f\u9646\u5730\u5206\u79bb\u7684\u6700\u5c11\u5929\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-days-to-disconnect-island/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 204 Problem 3"}, {"ID": 1569, "Title": "Number of Ways to Reorder Array to Get Same BST", "TitleCn": "\u5c06\u5b50\u6570\u7ec4\u91cd\u65b0\u6392\u5e8f\u5f97\u5230\u540c\u4e00\u4e2a\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-reorder-array-to-get-same-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 204 Problem 4"}, {"ID": 1570, "Title": "Dot Product of Two Sparse Vectors", "TitleCn": "\u4e24\u4e2a\u7a00\u758f\u5411\u91cf\u7684\u70b9\u79ef", "Url": "https://leetcode.cn/problems/dot-product-of-two-sparse-vectors/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1571, "Title": "Warehouse Manager", "TitleCn": "\u4ed3\u5e93\u7ecf\u7406", "Url": "https://leetcode.cn/problems/warehouse-manager/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1572, "Title": "Matrix Diagonal Sum", "TitleCn": "\u77e9\u9635\u5bf9\u89d2\u7ebf\u5143\u7d20\u7684\u548c", "Url": "https://leetcode.cn/problems/matrix-diagonal-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 34 Problem 1"}, {"ID": 1573, "Title": "Number of Ways to Split a String", "TitleCn": "\u5206\u5272\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-split-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 34 Problem 2"}, {"ID": 1574, "Title": "Shortest Subarray to be Removed to Make Array Sorted", "TitleCn": "\u5220\u9664\u6700\u77ed\u7684\u5b50\u6570\u7ec4\u4f7f\u5269\u4f59\u6570\u7ec4\u6709\u5e8f", "Url": "https://leetcode.cn/problems/shortest-subarray-to-be-removed-to-make-array-sorted/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 34 Problem 3"}, {"ID": 1575, "Title": "Count All Possible Routes", "TitleCn": "\u7edf\u8ba1\u6240\u6709\u53ef\u884c\u8def\u5f84", "Url": "https://leetcode.cn/problems/count-all-possible-routes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 34 Problem 4"}, {"ID": 1576, "Title": "Replace All ?'s to Avoid Consecutive Repeating Characters", "TitleCn": "\u66ff\u6362\u6240\u6709\u7684\u95ee\u53f7", "Url": "https://leetcode.cn/problems/replace-all-s-to-avoid-consecutive-repeating-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 205 Problem 1"}, {"ID": 1577, "Title": "Number of Ways Where Square of Number Is Equal to Product of Two Numbers", "TitleCn": "\u6570\u7684\u5e73\u65b9\u7b49\u4e8e\u4e24\u6570\u4e58\u79ef\u7684\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 205 Problem 2"}, {"ID": 1578, "Title": "Minimum Time to Make Rope Colorful", "TitleCn": "\u4f7f\u7ef3\u5b50\u53d8\u6210\u5f69\u8272\u7684\u6700\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-make-rope-colorful/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 205 Problem 3"}, {"ID": 1579, "Title": "Remove Max Number of Edges to Keep Graph Fully Traversable", "TitleCn": "\u4fdd\u8bc1\u56fe\u53ef\u5b8c\u5168\u904d\u5386", "Url": "https://leetcode.cn/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 205 Problem 4"}, {"ID": 1580, "Title": "Put Boxes Into the Warehouse II", "TitleCn": "\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc II", "Url": "https://leetcode.cn/problems/put-boxes-into-the-warehouse-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1581, "Title": "Customer Who Visited but Did Not Make Any Transactions", "TitleCn": "\u8fdb\u5e97\u5374\u672a\u8fdb\u884c\u8fc7\u4ea4\u6613\u7684\u5ba2\u6237", "Url": "https://leetcode.cn/problems/customer-who-visited-but-did-not-make-any-transactions/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1582, "Title": "Special Positions in a Binary Matrix", "TitleCn": "\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u7279\u6b8a\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/special-positions-in-a-binary-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 206 Problem 1"}, {"ID": 1583, "Title": "Count Unhappy Friends", "TitleCn": "\u7edf\u8ba1\u4e0d\u5f00\u5fc3\u7684\u670b\u53cb", "Url": "https://leetcode.cn/problems/count-unhappy-friends/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 206 Problem 2"}, {"ID": 1584, "Title": "Min Cost to Connect All Points", "TitleCn": "\u8fde\u63a5\u6240\u6709\u70b9\u7684\u6700\u5c0f\u8d39\u7528", "Url": "https://leetcode.cn/problems/min-cost-to-connect-all-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 206 Problem 3"}, {"ID": 1585, "Title": "Check If String Is Transformable With Substring Sort Operations", "TitleCn": "\u68c0\u67e5\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u901a\u8fc7\u6392\u5e8f\u5b50\u5b57\u7b26\u4e32\u5f97\u5230\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/check-if-string-is-transformable-with-substring-sort-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 206 Problem 4"}, {"ID": 1586, "Title": "Binary Search Tree Iterator II", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668 II", "Url": "https://leetcode.cn/problems/binary-search-tree-iterator-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1587, "Title": "Bank Account Summary II", "TitleCn": "\u94f6\u884c\u8d26\u6237\u6982\u8981 II", "Url": "https://leetcode.cn/problems/bank-account-summary-ii/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1588, "Title": "Sum of All Odd Length Subarrays", "TitleCn": "\u6240\u6709\u5947\u6570\u957f\u5ea6\u5b50\u6570\u7ec4\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-all-odd-length-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 35 Problem 1"}, {"ID": 1589, "Title": "Maximum Sum Obtained of Any Permutation", "TitleCn": "\u6240\u6709\u6392\u5217\u4e2d\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-obtained-of-any-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 35 Problem 2"}, {"ID": 1590, "Title": "Make Sum Divisible by P", "TitleCn": "\u4f7f\u6570\u7ec4\u548c\u80fd\u88ab P \u6574\u9664", "Url": "https://leetcode.cn/problems/make-sum-divisible-by-p/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 35 Problem 3"}, {"ID": 1591, "Title": "Strange Printer II", "TitleCn": "\u5947\u602a\u7684\u6253\u5370\u673a II", "Url": "https://leetcode.cn/problems/strange-printer-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 35 Problem 4"}, {"ID": 1592, "Title": "Rearrange Spaces Between Words", "TitleCn": "\u91cd\u65b0\u6392\u5217\u5355\u8bcd\u95f4\u7684\u7a7a\u683c", "Url": "https://leetcode.cn/problems/rearrange-spaces-between-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 207 Problem 1"}, {"ID": 1593, "Title": "Split a String Into the Max Number of Unique Substrings", "TitleCn": "\u62c6\u5206\u5b57\u7b26\u4e32\u4f7f\u552f\u4e00\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee\u6700\u5927", "Url": "https://leetcode.cn/problems/split-a-string-into-the-max-number-of-unique-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 207 Problem 2"}, {"ID": 1594, "Title": "Maximum Non Negative Product in a Matrix", "TitleCn": "\u77e9\u9635\u7684\u6700\u5927\u975e\u8d1f\u79ef", "Url": "https://leetcode.cn/problems/maximum-non-negative-product-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 207 Problem 3"}, {"ID": 1595, "Title": "Minimum Cost to Connect Two Groups of Points", "TitleCn": "\u8fde\u901a\u4e24\u7ec4\u70b9\u7684\u6700\u5c0f\u6210\u672c", "Url": "https://leetcode.cn/problems/minimum-cost-to-connect-two-groups-of-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 207 Problem 4"}, {"ID": 1596, "Title": "The Most Frequently Ordered Products for Each Customer", "TitleCn": "\u6bcf\u4f4d\u987e\u5ba2\u6700\u7ecf\u5e38\u8ba2\u8d2d\u7684\u5546\u54c1", "Url": "https://leetcode.cn/problems/the-most-frequently-ordered-products-for-each-customer/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1597, "Title": "Build Binary Expression Tree From Infix Expression", "TitleCn": "\u6839\u636e\u4e2d\u7f00\u8868\u8fbe\u5f0f\u6784\u9020\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811", "Url": "https://leetcode.cn/problems/build-binary-expression-tree-from-infix-expression/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1598, "Title": "Crawler Log Folder", "TitleCn": "\u6587\u4ef6\u5939\u64cd\u4f5c\u65e5\u5fd7\u641c\u96c6\u5668", "Url": "https://leetcode.cn/problems/crawler-log-folder/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 208 Problem 1"}, {"ID": 1599, "Title": "Maximum Profit of Operating a Centennial Wheel", "TitleCn": "\u7ecf\u8425\u6469\u5929\u8f6e\u7684\u6700\u5927\u5229\u6da6", "Url": "https://leetcode.cn/problems/maximum-profit-of-operating-a-centennial-wheel/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 208 Problem 2"}, {"ID": 1600, "Title": "Throne Inheritance", "TitleCn": "\u738b\u4f4d\u7ee7\u627f\u987a\u5e8f", "Url": "https://leetcode.cn/problems/throne-inheritance/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 208 Problem 3"}, {"ID": 1601, "Title": "Maximum Number of Achievable Transfer Requests", "TitleCn": "\u6700\u591a\u53ef\u8fbe\u6210\u7684\u6362\u697c\u8bf7\u6c42\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-achievable-transfer-requests/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 208 Problem 4"}, {"ID": 1602, "Title": "Find Nearest Right Node in Binary Tree", "TitleCn": "\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u6700\u8fd1\u7684\u53f3\u4fa7\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-nearest-right-node-in-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1603, "Title": "Design Parking System", "TitleCn": "\u8bbe\u8ba1\u505c\u8f66\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-parking-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 36 Problem 1"}, {"ID": 1604, "Title": "Alert Using Same Key-Card Three or More Times in a One Hour Period", "TitleCn": "\u8b66\u544a\u4e00\u5c0f\u65f6\u5185\u4f7f\u7528\u76f8\u540c\u5458\u5de5\u5361\u5927\u4e8e\u7b49\u4e8e\u4e09\u6b21\u7684\u4eba", "Url": "https://leetcode.cn/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 36 Problem 2"}, {"ID": 1605, "Title": "Find Valid Matrix Given Row and Column Sums", "TitleCn": "\u7ed9\u5b9a\u884c\u548c\u5217\u7684\u548c\u6c42\u53ef\u884c\u77e9\u9635", "Url": "https://leetcode.cn/problems/find-valid-matrix-given-row-and-column-sums/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 36 Problem 3"}, {"ID": 1606, "Title": "Find Servers That Handled Most Number of Requests", "TitleCn": "\u627e\u5230\u5904\u7406\u6700\u591a\u8bf7\u6c42\u7684\u670d\u52a1\u5668", "Url": "https://leetcode.cn/problems/find-servers-that-handled-most-number-of-requests/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 36 Problem 4"}, {"ID": 1607, "Title": "Sellers With No Sales", "TitleCn": "\u6ca1\u6709\u5356\u51fa\u7684\u5356\u5bb6", "Url": "https://leetcode.cn/problems/sellers-with-no-sales/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1608, "Title": "Special Array With X Elements Greater Than or Equal X", "TitleCn": "\u7279\u6b8a\u6570\u7ec4\u7684\u7279\u5f81\u503c", "Url": "https://leetcode.cn/problems/special-array-with-x-elements-greater-than-or-equal-x/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 209 Problem 1"}, {"ID": 1609, "Title": "Even Odd Tree", "TitleCn": "\u5947\u5076\u6811", "Url": "https://leetcode.cn/problems/even-odd-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 209 Problem 2"}, {"ID": 1610, "Title": "Maximum Number of Visible Points", "TitleCn": "\u53ef\u89c1\u70b9\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-visible-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 209 Problem 3"}, {"ID": 1611, "Title": "Minimum One Bit Operations to Make Integers Zero", "TitleCn": "\u4f7f\u6574\u6570\u53d8\u4e3a 0 \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-one-bit-operations-to-make-integers-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 209 Problem 4"}, {"ID": 1612, "Title": "Check If Two Expression Trees are Equivalent", "TitleCn": "\u68c0\u67e5\u4e24\u68f5\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811\u662f\u5426\u7b49\u4ef7", "Url": "https://leetcode.cn/problems/check-if-two-expression-trees-are-equivalent/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1613, "Title": "Find the Missing IDs", "TitleCn": "\u627e\u5230\u9057\u5931\u7684ID", "Url": "https://leetcode.cn/problems/find-the-missing-ids/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1614, "Title": "Maximum Nesting Depth of the Parentheses", "TitleCn": "\u62ec\u53f7\u7684\u6700\u5927\u5d4c\u5957\u6df1\u5ea6", "Url": "https://leetcode.cn/problems/maximum-nesting-depth-of-the-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 210 Problem 1"}, {"ID": 1615, "Title": "Maximal Network Rank", "TitleCn": "\u6700\u5927\u7f51\u7edc\u79e9", "Url": "https://leetcode.cn/problems/maximal-network-rank/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 210 Problem 2"}, {"ID": 1616, "Title": "Split Two Strings to Make Palindrome", "TitleCn": "\u5206\u5272\u4e24\u4e2a\u5b57\u7b26\u4e32\u5f97\u5230\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/split-two-strings-to-make-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 210 Problem 3"}, {"ID": 1617, "Title": "Count Subtrees With Max Distance Between Cities", "TitleCn": "\u7edf\u8ba1\u5b50\u6811\u4e2d\u57ce\u5e02\u4e4b\u95f4\u6700\u5927\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/count-subtrees-with-max-distance-between-cities/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 210 Problem 4"}, {"ID": 1618, "Title": "Maximum Font to Fit a Sentence in a Screen", "TitleCn": "\u627e\u51fa\u9002\u5e94\u5c4f\u5e55\u7684\u6700\u5927\u5b57\u53f7", "Url": "https://leetcode.cn/problems/maximum-font-to-fit-a-sentence-in-a-screen/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1619, "Title": "Mean of Array After Removing Some Elements", "TitleCn": "\u5220\u9664\u67d0\u4e9b\u5143\u7d20\u540e\u7684\u6570\u7ec4\u5747\u503c", "Url": "https://leetcode.cn/problems/mean-of-array-after-removing-some-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 37 Problem 1"}, {"ID": 1620, "Title": "Coordinate With Maximum Network Quality", "TitleCn": "\u7f51\u7edc\u4fe1\u53f7\u6700\u597d\u7684\u5750\u6807", "Url": "https://leetcode.cn/problems/coordinate-with-maximum-network-quality/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 37 Problem 2"}, {"ID": 1621, "Title": "Number of Sets of K Non-Overlapping Line Segments", "TitleCn": "\u5927\u5c0f\u4e3a K \u7684\u4e0d\u91cd\u53e0\u7ebf\u6bb5\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-sets-of-k-non-overlapping-line-segments/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 37 Problem 3"}, {"ID": 1622, "Title": "Fancy Sequence", "TitleCn": "\u5947\u5999\u5e8f\u5217", "Url": "https://leetcode.cn/problems/fancy-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 37 Problem 4"}, {"ID": 1623, "Title": "All Valid Triplets That Can Represent a Country", "TitleCn": "\u4e09\u4eba\u56fd\u5bb6\u4ee3\u8868\u961f", "Url": "https://leetcode.cn/problems/all-valid-triplets-that-can-represent-a-country", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1624, "Title": "Largest Substring Between Two Equal Characters", "TitleCn": "\u4e24\u4e2a\u76f8\u540c\u5b57\u7b26\u4e4b\u95f4\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/largest-substring-between-two-equal-characters", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 211 Problem 1"}, {"ID": 1625, "Title": "Lexicographically Smallest String After Applying Operations", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u540e\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-smallest-string-after-applying-operations", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 211 Problem 2"}, {"ID": 1626, "Title": "Best Team With No Conflicts", "TitleCn": "\u65e0\u77db\u76fe\u7684\u6700\u4f73\u7403\u961f", "Url": "https://leetcode.cn/problems/best-team-with-no-conflicts", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 211 Problem 3"}, {"ID": 1627, "Title": "Graph Connectivity With Threshold", "TitleCn": "\u5e26\u9608\u503c\u7684\u56fe\u8fde\u901a\u6027", "Url": "https://leetcode.cn/problems/graph-connectivity-with-threshold", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 211 Problem 4"}, {"ID": 1628, "Title": "Design an Expression Tree With Evaluate Function", "TitleCn": "\u8bbe\u8ba1\u5e26\u89e3\u6790\u51fd\u6570\u7684\u8868\u8fbe\u5f0f\u6811", "Url": "https://leetcode.cn/problems/design-an-expression-tree-with-evaluate-function/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1629, "Title": "Slowest Key", "TitleCn": "\u6309\u952e\u6301\u7eed\u65f6\u95f4\u6700\u957f\u7684\u952e", "Url": "https://leetcode.cn/problems/slowest-key/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 212 Problem 1"}, {"ID": 1630, "Title": "Arithmetic Subarrays", "TitleCn": "\u7b49\u5dee\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/arithmetic-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 212 Problem 2"}, {"ID": 1631, "Title": "Path With Minimum Effort", "TitleCn": "\u6700\u5c0f\u4f53\u529b\u6d88\u8017\u8def\u5f84", "Url": "https://leetcode.cn/problems/path-with-minimum-effort/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 212 Problem 3"}, {"ID": 1632, "Title": "Rank Transform of a Matrix", "TitleCn": "\u77e9\u9635\u8f6c\u6362\u540e\u7684\u79e9", "Url": "https://leetcode.cn/problems/rank-transform-of-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 212 Problem 4"}, {"ID": 1633, "Title": "Percentage of Users Attended a Contest", "TitleCn": "\u5404\u8d5b\u4e8b\u7684\u7528\u6237\u6ce8\u518c\u7387", "Url": "https://leetcode.cn/problems/percentage-of-users-attended-a-contest/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1634, "Title": "Add Two Polynomials Represented as Linked Lists", "TitleCn": "\u6c42\u4e24\u4e2a\u591a\u9879\u5f0f\u94fe\u8868\u7684\u548c", "Url": "https://leetcode.cn/problems/add-two-polynomials-represented-as-linked-lists/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1635, "Title": "Hopper Company Queries I", "TitleCn": "Hopper \u516c\u53f8\u67e5\u8be2 I", "Url": "https://leetcode.cn/problems/hopper-company-queries-i/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1636, "Title": "Sort Array by Increasing Frequency", "TitleCn": "\u6309\u7167\u9891\u7387\u5c06\u6570\u7ec4\u5347\u5e8f\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-array-by-increasing-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 38 Problem 1"}, {"ID": 1637, "Title": "Widest Vertical Area Between Two Points Containing No Points", "TitleCn": "\u4e24\u70b9\u4e4b\u95f4\u4e0d\u5305\u542b\u4efb\u4f55\u70b9\u7684\u6700\u5bbd\u5782\u76f4\u9762\u79ef", "Url": "https://leetcode.cn/problems/widest-vertical-area-between-two-points-containing-no-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 38 Problem 2"}, {"ID": 1638, "Title": "Count Substrings That Differ by One Character", "TitleCn": "\u7edf\u8ba1\u53ea\u5dee\u4e00\u4e2a\u5b57\u7b26\u7684\u5b50\u4e32\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-substrings-that-differ-by-one-character/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 38 Problem 3"}, {"ID": 1639, "Title": "Number of Ways to Form a Target String Given a Dictionary", "TitleCn": "\u901a\u8fc7\u7ed9\u5b9a\u8bcd\u5178\u6784\u9020\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-form-a-target-string-given-a-dictionary/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 38 Problem 4"}, {"ID": 1640, "Title": "Check Array Formation Through Concatenation", "TitleCn": "\u80fd\u5426\u8fde\u63a5\u5f62\u6210\u6570\u7ec4", "Url": "https://leetcode.cn/problems/check-array-formation-through-concatenation/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 213 Problem 1"}, {"ID": 1641, "Title": "Count Sorted Vowel Strings", "TitleCn": "\u7edf\u8ba1\u5b57\u5178\u5e8f\u5143\u97f3\u5b57\u7b26\u4e32\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-sorted-vowel-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 213 Problem 2"}, {"ID": 1642, "Title": "Furthest Building You Can Reach", "TitleCn": "\u53ef\u4ee5\u5230\u8fbe\u7684\u6700\u8fdc\u5efa\u7b51", "Url": "https://leetcode.cn/problems/furthest-building-you-can-reach/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 213 Problem 3"}, {"ID": 1643, "Title": "Kth Smallest Instructions", "TitleCn": "\u7b2c K \u6761\u6700\u5c0f\u6307\u4ee4", "Url": "https://leetcode.cn/problems/kth-smallest-instructions/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 213 Problem 4"}, {"ID": 1644, "Title": "Lowest Common Ancestor of a Binary Tree II", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 II", "Url": "https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1645, "Title": "Hopper Company Queries II", "TitleCn": "Hopper \u516c\u53f8\u67e5\u8be2 II", "Url": "https://leetcode.cn/problems/hopper-company-queries-ii/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1646, "Title": "Get Maximum in Generated Array", "TitleCn": "\u83b7\u53d6\u751f\u6210\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/get-maximum-in-generated-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 214 Problem 1"}, {"ID": 1647, "Title": "Minimum Deletions to Make Character Frequencies Unique", "TitleCn": "\u5b57\u7b26\u9891\u6b21\u552f\u4e00\u7684\u6700\u5c0f\u5220\u9664\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-deletions-to-make-character-frequencies-unique/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 214 Problem 2"}, {"ID": 1648, "Title": "Sell Diminishing-Valued Colored Balls", "TitleCn": "\u9500\u552e\u4ef7\u503c\u51cf\u5c11\u7684\u989c\u8272\u7403", "Url": "https://leetcode.cn/problems/sell-diminishing-valued-colored-balls/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 214 Problem 3"}, {"ID": 1649, "Title": "Create Sorted Array through Instructions", "TitleCn": "\u901a\u8fc7\u6307\u4ee4\u521b\u5efa\u6709\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/create-sorted-array-through-instructions/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 214 Problem 4"}, {"ID": 1650, "Title": "Lowest Common Ancestor of a Binary Tree III", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 III", "Url": "https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree-iii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1651, "Title": "Hopper Company Queries III", "TitleCn": "Hopper \u516c\u53f8\u67e5\u8be2 III", "Url": "https://leetcode.cn/problems/hopper-company-queries-iii/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1652, "Title": "Defuse the Bomb", "TitleCn": "\u62c6\u70b8\u5f39", "Url": "https://leetcode.cn/problems/defuse-the-bomb/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 39 Problem 1"}, {"ID": 1653, "Title": "Minimum Deletions to Make String Balanced", "TitleCn": "\u4f7f\u5b57\u7b26\u4e32\u5e73\u8861\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-deletions-to-make-string-balanced/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 39 Problem 2"}, {"ID": 1654, "Title": "Minimum Jumps to Reach Home", "TitleCn": "\u5230\u5bb6\u7684\u6700\u5c11\u8df3\u8dc3\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-jumps-to-reach-home/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 39 Problem 3"}, {"ID": 1655, "Title": "Distribute Repeating Integers", "TitleCn": "\u5206\u914d\u91cd\u590d\u6574\u6570", "Url": "https://leetcode.cn/problems/distribute-repeating-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 39 Problem 4"}, {"ID": 1656, "Title": "Design an Ordered Stream", "TitleCn": "\u8bbe\u8ba1\u6709\u5e8f\u6d41", "Url": "https://leetcode.cn/problems/design-an-ordered-stream", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 215 Problem 1"}, {"ID": 1657, "Title": "Determine if Two Strings Are Close", "TitleCn": "\u786e\u5b9a\u4e24\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u63a5\u8fd1", "Url": "https://leetcode.cn/problems/determine-if-two-strings-are-close", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 215 Problem 2"}, {"ID": 1658, "Title": "Minimum Operations to Reduce X to Zero", "TitleCn": "\u5c06 x \u51cf\u5230 0 \u7684\u6700\u5c0f\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-reduce-x-to-zero", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 215 Problem 3"}, {"ID": 1659, "Title": "Maximize Grid Happiness", "TitleCn": "\u6700\u5927\u5316\u7f51\u683c\u5e78\u798f\u611f", "Url": "https://leetcode.cn/problems/maximize-grid-happiness", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 215 Problem 4"}, {"ID": 1660, "Title": "Correct a Binary Tree", "TitleCn": "\u7ea0\u6b63\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/correct-a-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1661, "Title": "Average Time of Process per Machine", "TitleCn": "\u6bcf\u53f0\u673a\u5668\u7684\u8fdb\u7a0b\u5e73\u5747\u8fd0\u884c\u65f6\u95f4", "Url": "https://leetcode.cn/problems/average-time-of-process-per-machine/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1662, "Title": "Check If Two String Arrays are Equivalent", "TitleCn": "\u68c0\u67e5\u4e24\u4e2a\u5b57\u7b26\u4e32\u6570\u7ec4\u662f\u5426\u76f8\u7b49", "Url": "https://leetcode.cn/problems/check-if-two-string-arrays-are-equivalent/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 216 Problem 1"}, {"ID": 1663, "Title": "Smallest String With A Given Numeric Value", "TitleCn": "\u5177\u6709\u7ed9\u5b9a\u6570\u503c\u7684\u6700\u5c0f\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/smallest-string-with-a-given-numeric-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 216 Problem 2"}, {"ID": 1664, "Title": "Ways to Make a Fair Array", "TitleCn": "\u751f\u6210\u5e73\u8861\u6570\u7ec4\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/ways-to-make-a-fair-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 216 Problem 3"}, {"ID": 1665, "Title": "Minimum Initial Energy to Finish Tasks", "TitleCn": "\u5b8c\u6210\u6240\u6709\u4efb\u52a1\u7684\u6700\u5c11\u521d\u59cb\u80fd\u91cf", "Url": "https://leetcode.cn/problems/minimum-initial-energy-to-finish-tasks/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 216 Problem 4"}, {"ID": 1666, "Title": "Change the Root of a Binary Tree", "TitleCn": "\u6539\u53d8\u4e8c\u53c9\u6811\u7684\u6839\u8282\u70b9", "Url": "https://leetcode.cn/problems/change-the-root-of-a-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1667, "Title": "Fix Names in a Table", "TitleCn": "\u4fee\u590d\u8868\u4e2d\u7684\u540d\u5b57", "Url": "https://leetcode.cn/problems/fix-names-in-a-table/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1668, "Title": "Maximum Repeating Substring", "TitleCn": "\u6700\u5927\u91cd\u590d\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/maximum-repeating-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 40 Problem 1"}, {"ID": 1669, "Title": "Merge In Between Linked Lists", "TitleCn": "\u5408\u5e76\u4e24\u4e2a\u94fe\u8868", "Url": "https://leetcode.cn/problems/merge-in-between-linked-lists/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 40 Problem 2"}, {"ID": 1670, "Title": "Design Front Middle Back Queue", "TitleCn": "\u8bbe\u8ba1\u524d\u4e2d\u540e\u961f\u5217", "Url": "https://leetcode.cn/problems/design-front-middle-back-queue/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 40 Problem 3"}, {"ID": 1671, "Title": "Minimum Number of Removals to Make Mountain Array", "TitleCn": "\u5f97\u5230\u5c71\u5f62\u6570\u7ec4\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-removals-to-make-mountain-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 40 Problem 4"}, {"ID": 1672, "Title": "Richest Customer Wealth", "TitleCn": "\u6700\u5bcc\u6709\u5ba2\u6237\u7684\u8d44\u4ea7\u603b\u91cf", "Url": "https://leetcode.cn/problems/richest-customer-wealth/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 217 Problem 1"}, {"ID": 1673, "Title": "Find the Most Competitive Subsequence", "TitleCn": "\u627e\u51fa\u6700\u5177\u7ade\u4e89\u529b\u7684\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/find-the-most-competitive-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 217 Problem 2"}, {"ID": 1674, "Title": "Minimum Moves to Make Array Complementary", "TitleCn": "\u4f7f\u6570\u7ec4\u4e92\u8865\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-moves-to-make-array-complementary/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 217 Problem 3"}, {"ID": 1675, "Title": "Minimize Deviation in Array", "TitleCn": "\u6570\u7ec4\u7684\u6700\u5c0f\u504f\u79fb\u91cf", "Url": "https://leetcode.cn/problems/minimize-deviation-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 217 Problem 4"}, {"ID": 1676, "Title": "Lowest Common Ancestor of a Binary Tree IV", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 IV", "Url": "https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree-iv/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1677, "Title": "Product's Worth Over Invoices", "TitleCn": "\u53d1\u7968\u4e2d\u7684\u4ea7\u54c1\u91d1\u989d", "Url": "https://leetcode.cn/problems/products-worth-over-invoices/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1678, "Title": "Goal Parser Interpretation", "TitleCn": "\u8bbe\u8ba1 Goal \u89e3\u6790\u5668", "Url": "https://leetcode.cn/problems/goal-parser-interpretation/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 218 Problem 1"}, {"ID": 1679, "Title": "Max Number of K-Sum Pairs", "TitleCn": "K \u548c\u6570\u5bf9\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/max-number-of-k-sum-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 218 Problem 2"}, {"ID": 1680, "Title": "Concatenation of Consecutive Binary Numbers", "TitleCn": "\u8fde\u63a5\u8fde\u7eed\u4e8c\u8fdb\u5236\u6570\u5b57", "Url": "https://leetcode.cn/problems/concatenation-of-consecutive-binary-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 218 Problem 3"}, {"ID": 1681, "Title": "Minimum Incompatibility", "TitleCn": "\u6700\u5c0f\u4e0d\u517c\u5bb9\u6027", "Url": "https://leetcode.cn/problems/minimum-incompatibility/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 218 Problem 4"}, {"ID": 1682, "Title": "Longest Palindromic Subsequence II", "TitleCn": "\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217 II", "Url": "https://leetcode.cn/problems/longest-palindromic-subsequence-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1683, "Title": "Invalid Tweets", "TitleCn": "\u65e0\u6548\u7684\u63a8\u6587", "Url": "https://leetcode.cn/problems/invalid-tweets/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1684, "Title": "Count the Number of Consistent Strings", "TitleCn": "\u7edf\u8ba1\u4e00\u81f4\u5b57\u7b26\u4e32\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-consistent-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 41 Problem 1"}, {"ID": 1685, "Title": "Sum of Absolute Differences in a Sorted Array", "TitleCn": "\u6709\u5e8f\u6570\u7ec4\u4e2d\u5dee\u7edd\u5bf9\u503c\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-absolute-differences-in-a-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 41 Problem 2"}, {"ID": 1686, "Title": "Stone Game VI", "TitleCn": "\u77f3\u5b50\u6e38\u620f VI", "Url": "https://leetcode.cn/problems/stone-game-vi/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 41 Problem 3"}, {"ID": 1687, "Title": "Delivering Boxes from Storage to Ports", "TitleCn": "\u4ece\u4ed3\u5e93\u5230\u7801\u5934\u8fd0\u8f93\u7bb1\u5b50", "Url": "https://leetcode.cn/problems/delivering-boxes-from-storage-to-ports/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 41 Problem 4"}, {"ID": 1688, "Title": "Count of Matches in Tournament", "TitleCn": "\u6bd4\u8d5b\u4e2d\u7684\u914d\u5bf9\u6b21\u6570", "Url": "https://leetcode.cn/problems/count-of-matches-in-tournament/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 219 Problem 1"}, {"ID": 1689, "Title": "Partitioning Into Minimum Number Of Deci-Binary Numbers", "TitleCn": "\u5341-\u4e8c\u8fdb\u5236\u6570\u7684\u6700\u5c11\u6570\u76ee", "Url": "https://leetcode.cn/problems/partitioning-into-minimum-number-of-deci-binary-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 219 Problem 2"}, {"ID": 1690, "Title": "Stone Game VII", "TitleCn": "\u77f3\u5b50\u6e38\u620f VII", "Url": "https://leetcode.cn/problems/stone-game-vii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 219 Problem 3"}, {"ID": 1691, "Title": "Maximum Height by Stacking Cuboids", "TitleCn": "\u5806\u53e0\u957f\u65b9\u4f53\u7684\u6700\u5927\u9ad8\u5ea6", "Url": "https://leetcode.cn/problems/maximum-height-by-stacking-cuboids/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 219 Problem 4"}, {"ID": 1692, "Title": "Count Ways to Distribute Candies", "TitleCn": "\u8ba1\u7b97\u5206\u914d\u7cd6\u679c\u7684\u4e0d\u540c\u65b9\u5f0f", "Url": "https://leetcode.cn/problems/count-ways-to-distribute-candies/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1693, "Title": "Daily Leads and Partners", "TitleCn": "\u6bcf\u5929\u7684\u9886\u5bfc\u548c\u5408\u4f19\u4eba", "Url": "https://leetcode.cn/problems/daily-leads-and-partners/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1694, "Title": "Reformat Phone Number", "TitleCn": "\u91cd\u65b0\u683c\u5f0f\u5316\u7535\u8bdd\u53f7\u7801", "Url": "https://leetcode.cn/problems/reformat-phone-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 220 Problem 1"}, {"ID": 1695, "Title": "Maximum Erasure Value", "TitleCn": "\u5220\u9664\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-erasure-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 220 Problem 2"}, {"ID": 1696, "Title": "Jump Game VI", "TitleCn": "\u8df3\u8dc3\u6e38\u620f VI", "Url": "https://leetcode.cn/problems/jump-game-vi/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 220 Problem 3"}, {"ID": 1697, "Title": "Checking Existence of Edge Length Limited Paths", "TitleCn": "\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728", "Url": "https://leetcode.cn/problems/checking-existence-of-edge-length-limited-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 220 Problem 4"}, {"ID": 1698, "Title": "Number of Distinct Substrings in a String", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u4e0d\u540c\u5b50\u5b57\u7b26\u4e32\u4e2a\u6570", "Url": "https://leetcode.cn/problems/number-of-distinct-substrings-in-a-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 11, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1699, "Title": "Number of Calls Between Two Persons", "TitleCn": "\u4e24\u4eba\u4e4b\u95f4\u7684\u901a\u8bdd\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-calls-between-two-persons/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1700, "Title": "Number of Students Unable to Eat Lunch", "TitleCn": "\u65e0\u6cd5\u5403\u5348\u9910\u7684\u5b66\u751f\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-students-unable-to-eat-lunch/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 42 Problem 1"}, {"ID": 1701, "Title": "Average Waiting Time", "TitleCn": "\u5e73\u5747\u7b49\u5f85\u65f6\u95f4", "Url": "https://leetcode.cn/problems/average-waiting-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 42 Problem 2"}, {"ID": 1702, "Title": "Maximum Binary String After Change", "TitleCn": "\u4fee\u6539\u540e\u7684\u6700\u5927\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/maximum-binary-string-after-change/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 42 Problem 3"}, {"ID": 1703, "Title": "Minimum Adjacent Swaps for K Consecutive Ones", "TitleCn": "\u5f97\u5230\u8fde\u7eed K \u4e2a 1 \u7684\u6700\u5c11\u76f8\u90bb\u4ea4\u6362\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-adjacent-swaps-for-k-consecutive-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 42 Problem 4"}, {"ID": 1704, "Title": "Determine if String Halves Are Alike", "TitleCn": "\u5224\u65ad\u5b57\u7b26\u4e32\u7684\u4e24\u534a\u662f\u5426\u76f8\u4f3c", "Url": "https://leetcode.cn/problems/determine-if-string-halves-are-alike/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 221 Problem 1"}, {"ID": 1705, "Title": "Maximum Number of Eaten Apples", "TitleCn": "\u5403\u82f9\u679c\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-eaten-apples/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 221 Problem 2"}, {"ID": 1706, "Title": "Where Will the Ball Fall", "TitleCn": "\u7403\u4f1a\u843d\u4f55\u5904", "Url": "https://leetcode.cn/problems/where-will-the-ball-fall/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 221 Problem 3"}, {"ID": 1707, "Title": "Maximum XOR With an Element From Array", "TitleCn": "\u4e0e\u6570\u7ec4\u4e2d\u5143\u7d20\u7684\u6700\u5927\u5f02\u6216\u503c", "Url": "https://leetcode.cn/problems/maximum-xor-with-an-element-from-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 221 Problem 4"}, {"ID": 1708, "Title": "Largest Subarray Length K", "TitleCn": "\u957f\u5ea6\u4e3a K \u7684\u6700\u5927\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/largest-subarray-length-k/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 9, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1709, "Title": "Biggest Window Between Visits", "TitleCn": "\u8bbf\u95ee\u65e5\u671f\u4e4b\u95f4\u6700\u5927\u7684\u7a7a\u6863\u671f", "Url": "https://leetcode.cn/problems/biggest-window-between-visits/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1710, "Title": "Maximum Units on a Truck", "TitleCn": "\u5361\u8f66\u4e0a\u7684\u6700\u5927\u5355\u5143\u6570", "Url": "https://leetcode.cn/problems/maximum-units-on-a-truck/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 222 Problem 1"}, {"ID": 1711, "Title": "Count Good Meals", "TitleCn": "\u5927\u9910\u8ba1\u6570", "Url": "https://leetcode.cn/problems/count-good-meals/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 222 Problem 2"}, {"ID": 1712, "Title": "Ways to Split Array Into Three Subarrays", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u6210\u4e09\u4e2a\u5b50\u6570\u7ec4\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/ways-to-split-array-into-three-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 222 Problem 3"}, {"ID": 1713, "Title": "Minimum Operations to Make a Subsequence", "TitleCn": "\u5f97\u5230\u5b50\u5e8f\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-a-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 222 Problem 4"}, {"ID": 1714, "Title": "Sum Of Special Evenly-Spaced Elements In Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7279\u6b8a\u7b49\u95f4\u8ddd\u5143\u7d20\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-special-evenly-spaced-elements-in-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1715, "Title": "Count Apples and Oranges", "TitleCn": "\u82f9\u679c\u548c\u6a58\u5b50\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-apples-and-oranges/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1716, "Title": "Calculate Money in Leetcode Bank", "TitleCn": "\u8ba1\u7b97\u529b\u6263\u94f6\u884c\u7684\u94b1", "Url": "https://leetcode.cn/problems/calculate-money-in-leetcode-bank/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 43 Problem 1"}, {"ID": 1717, "Title": "Maximum Score From Removing Substrings", "TitleCn": "\u5220\u9664\u5b50\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-score-from-removing-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 43 Problem 2"}, {"ID": 1718, "Title": "Construct the Lexicographically Largest Valid Sequence", "TitleCn": "\u6784\u5efa\u5b57\u5178\u5e8f\u6700\u5927\u7684\u53ef\u884c\u5e8f\u5217", "Url": "https://leetcode.cn/problems/construct-the-lexicographically-largest-valid-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 43 Problem 3"}, {"ID": 1719, "Title": "Number Of Ways To Reconstruct A Tree", "TitleCn": "\u91cd\u6784\u4e00\u68f5\u6811\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-reconstruct-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 43 Problem 4"}, {"ID": 1720, "Title": "Decode XORed Array", "TitleCn": "\u89e3\u7801\u5f02\u6216\u540e\u7684\u6570\u7ec4", "Url": "https://leetcode.cn/problems/decode-xored-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 223 Problem 1"}, {"ID": 1721, "Title": "Swapping Nodes in a Linked List", "TitleCn": "\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/swapping-nodes-in-a-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 223 Problem 2"}, {"ID": 1722, "Title": "Minimize Hamming Distance After Swap Operations", "TitleCn": "\u6267\u884c\u4ea4\u6362\u64cd\u4f5c\u540e\u7684\u6700\u5c0f\u6c49\u660e\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/minimize-hamming-distance-after-swap-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 223 Problem 3"}, {"ID": 1723, "Title": "Find Minimum Time to Finish All Jobs", "TitleCn": "\u5b8c\u6210\u6240\u6709\u5de5\u4f5c\u7684\u6700\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/find-minimum-time-to-finish-all-jobs/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 223 Problem 4"}, {"ID": 1724, "Title": "Checking Existence of Edge Length Limited Paths II", "TitleCn": "\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728 II", "Url": "https://leetcode.cn/problems/checking-existence-of-edge-length-limited-paths-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1725, "Title": "Number Of Rectangles That Can Form The Largest Square", "TitleCn": "\u53ef\u4ee5\u5f62\u6210\u6700\u5927\u6b63\u65b9\u5f62\u7684\u77e9\u5f62\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-rectangles-that-can-form-the-largest-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 224 Problem 1"}, {"ID": 1726, "Title": "Tuple with Same Product", "TitleCn": "\u540c\u79ef\u5143\u7ec4", "Url": "https://leetcode.cn/problems/tuple-with-same-product/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 224 Problem 2"}, {"ID": 1727, "Title": "Largest Submatrix With Rearrangements", "TitleCn": "\u91cd\u65b0\u6392\u5217\u540e\u7684\u6700\u5927\u5b50\u77e9\u9635", "Url": "https://leetcode.cn/problems/largest-submatrix-with-rearrangements/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 224 Problem 3"}, {"ID": 1728, "Title": "Cat and Mouse II", "TitleCn": "\u732b\u548c\u8001\u9f20 II", "Url": "https://leetcode.cn/problems/cat-and-mouse-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 224 Problem 4"}, {"ID": 1729, "Title": "Find Followers Count", "TitleCn": "\u6c42\u5173\u6ce8\u8005\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/find-followers-count/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1730, "Title": "Shortest Path to Get Food", "TitleCn": "\u83b7\u53d6\u98df\u7269\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-path-to-get-food/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1731, "Title": "The Number of Employees Which Report to Each Employee", "TitleCn": "\u6bcf\u4f4d\u7ecf\u7406\u7684\u4e0b\u5c5e\u5458\u5de5\u6570\u91cf", "Url": "https://leetcode.cn/problems/the-number-of-employees-which-report-to-each-employee/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1732, "Title": "Find the Highest Altitude", "TitleCn": "\u627e\u5230\u6700\u9ad8\u6d77\u62d4", "Url": "https://leetcode.cn/problems/find-the-highest-altitude/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 44 Problem 1"}, {"ID": 1733, "Title": "Minimum Number of People to Teach", "TitleCn": "\u9700\u8981\u6559\u8bed\u8a00\u7684\u6700\u5c11\u4eba\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-people-to-teach/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 44 Problem 2"}, {"ID": 1734, "Title": "Decode XORed Permutation", "TitleCn": "\u89e3\u7801\u5f02\u6216\u540e\u7684\u6392\u5217", "Url": "https://leetcode.cn/problems/decode-xored-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 44 Problem 3"}, {"ID": 1735, "Title": "Count Ways to Make Array With Product", "TitleCn": "\u751f\u6210\u4e58\u79ef\u6570\u7ec4\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/count-ways-to-make-array-with-product/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 44 Problem 4"}, {"ID": 1736, "Title": "Latest Time by Replacing Hidden Digits", "TitleCn": "\u66ff\u6362\u9690\u85cf\u6570\u5b57\u5f97\u5230\u7684\u6700\u665a\u65f6\u95f4", "Url": "https://leetcode.cn/problems/latest-time-by-replacing-hidden-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 225 Problem 1"}, {"ID": 1737, "Title": "Change Minimum Characters to Satisfy One of Three Conditions", "TitleCn": "\u6ee1\u8db3\u4e09\u6761\u4ef6\u4e4b\u4e00\u9700\u6539\u53d8\u7684\u6700\u5c11\u5b57\u7b26\u6570", "Url": "https://leetcode.cn/problems/change-minimum-characters-to-satisfy-one-of-three-conditions/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 225 Problem 2"}, {"ID": 1738, "Title": "Find Kth Largest XOR Coordinate Value", "TitleCn": "\u627e\u51fa\u7b2c K \u5927\u7684\u5f02\u6216\u5750\u6807\u503c", "Url": "https://leetcode.cn/problems/find-kth-largest-xor-coordinate-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 225 Problem 3"}, {"ID": 1739, "Title": "Building Boxes", "TitleCn": "\u653e\u7f6e\u76d2\u5b50", "Url": "https://leetcode.cn/problems/building-boxes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 225 Problem 4"}, {"ID": 1740, "Title": "Find Distance in a Binary Tree", "TitleCn": "\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u7684\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/find-distance-in-a-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1741, "Title": "Find Total Time Spent by Each Employee", "TitleCn": "\u67e5\u627e\u6bcf\u4e2a\u5458\u5de5\u82b1\u8d39\u7684\u603b\u65f6\u95f4", "Url": "https://leetcode.cn/problems/find-total-time-spent-by-each-employee/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1742, "Title": "Maximum Number of Balls in a Box", "TitleCn": "\u76d2\u5b50\u4e2d\u5c0f\u7403\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-balls-in-a-box/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 226 Problem 1"}, {"ID": 1743, "Title": "Restore the Array From Adjacent Pairs", "TitleCn": "\u4ece\u76f8\u90bb\u5143\u7d20\u5bf9\u8fd8\u539f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/restore-the-array-from-adjacent-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 226 Problem 2"}, {"ID": 1744, "Title": "Can You Eat Your Favorite Candy on Your Favorite Day?", "TitleCn": "\u4f60\u80fd\u5728\u4f60\u6700\u559c\u6b22\u7684\u90a3\u5929\u5403\u5230\u4f60\u6700\u559c\u6b22\u7684\u7cd6\u679c\u5417\uff1f", "Url": "https://leetcode.cn/problems/can-you-eat-your-favorite-candy-on-your-favorite-day/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 226 Problem 3"}, {"ID": 1745, "Title": "Palindrome Partitioning IV", "TitleCn": "\u5206\u5272\u56de\u6587\u4e32 IV", "Url": "https://leetcode.cn/problems/palindrome-partitioning-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 226 Problem 4"}, {"ID": 1746, "Title": "Maximum Subarray Sum After One Operation", "TitleCn": "\u7ecf\u8fc7\u4e00\u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5b50\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/maximum-subarray-sum-after-one-operation/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1747, "Title": "Leetflex Banned Accounts", "TitleCn": "\u5e94\u8be5\u88ab\u7981\u6b62\u7684Leetflex\u8d26\u6237", "Url": "https://leetcode.cn/problems/leetflex-banned-accounts/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1748, "Title": "Sum of Unique Elements", "TitleCn": "\u552f\u4e00\u5143\u7d20\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-unique-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 45 Problem 1"}, {"ID": 1749, "Title": "Maximum Absolute Sum of Any Subarray", "TitleCn": "\u4efb\u610f\u5b50\u6570\u7ec4\u548c\u7684\u7edd\u5bf9\u503c\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/maximum-absolute-sum-of-any-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 45 Problem 2"}, {"ID": 1750, "Title": "Minimum Length of String After Deleting Similar Ends", "TitleCn": "\u5220\u9664\u5b57\u7b26\u4e32\u4e24\u7aef\u76f8\u540c\u5b57\u7b26\u540e\u7684\u6700\u77ed\u957f\u5ea6", "Url": "https://leetcode.cn/problems/minimum-length-of-string-after-deleting-similar-ends/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 45 Problem 3"}, {"ID": 1751, "Title": "Maximum Number of Events That Can Be Attended II", "TitleCn": "\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee II", "Url": "https://leetcode.cn/problems/maximum-number-of-events-that-can-be-attended-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 45 Problem 4"}, {"ID": 1752, "Title": "Check if Array Is Sorted and Rotated", "TitleCn": "\u68c0\u67e5\u6570\u7ec4\u662f\u5426\u7ecf\u6392\u5e8f\u548c\u8f6e\u8f6c\u5f97\u5230", "Url": "https://leetcode.cn/problems/check-if-array-is-sorted-and-rotated/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 227 Problem 1"}, {"ID": 1753, "Title": "Maximum Score From Removing Stones", "TitleCn": "\u79fb\u9664\u77f3\u5b50\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-score-from-removing-stones/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 227 Problem 2"}, {"ID": 1754, "Title": "Largest Merge Of Two Strings", "TitleCn": "\u6784\u9020\u5b57\u5178\u5e8f\u6700\u5927\u7684\u5408\u5e76\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/largest-merge-of-two-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 227 Problem 3"}, {"ID": 1755, "Title": "Closest Subsequence Sum", "TitleCn": "\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u5b50\u5e8f\u5217\u548c", "Url": "https://leetcode.cn/problems/closest-subsequence-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 227 Problem 4"}, {"ID": 1756, "Title": "Design Most Recently Used Queue", "TitleCn": "\u8bbe\u8ba1\u6700\u8fd1\u4f7f\u7528\uff08MRU\uff09\u961f\u5217", "Url": "https://leetcode.cn/problems/design-most-recently-used-queue/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1757, "Title": "Recyclable and Low Fat Products", "TitleCn": "\u53ef\u56de\u6536\u4e14\u4f4e\u8102\u7684\u4ea7\u54c1", "Url": "https://leetcode.cn/problems/recyclable-and-low-fat-products/", "Ispaid": 0, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1758, "Title": "Minimum Changes To Make Alternating Binary String", "TitleCn": "\u751f\u6210\u4ea4\u66ff\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-changes-to-make-alternating-binary-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 228 Problem 1"}, {"ID": 1759, "Title": "Count Number of Homogenous Substrings", "TitleCn": "\u7edf\u8ba1\u540c\u8d28\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-homogenous-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 228 Problem 2"}, {"ID": 1760, "Title": "Minimum Limit of Balls in a Bag", "TitleCn": "\u888b\u5b50\u91cc\u6700\u5c11\u6570\u76ee\u7684\u7403", "Url": "https://leetcode.cn/problems/minimum-limit-of-balls-in-a-bag/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 228 Problem 3"}, {"ID": 1761, "Title": "Minimum Degree of a Connected Trio in a Graph", "TitleCn": "\u4e00\u4e2a\u56fe\u4e2d\u8fde\u901a\u4e09\u5143\u7ec4\u7684\u6700\u5c0f\u5ea6\u6570", "Url": "https://leetcode.cn/problems/minimum-degree-of-a-connected-trio-in-a-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 228 Problem 4"}, {"ID": 1762, "Title": "Buildings With an Ocean View", "TitleCn": "\u80fd\u770b\u5230\u6d77\u666f\u7684\u5efa\u7b51\u7269", "Url": "https://leetcode.cn/problems/buildings-with-an-ocean-view/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1763, "Title": "Longest Nice Substring", "TitleCn": "\u6700\u957f\u7684\u7f8e\u597d\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/longest-nice-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 46 Problem 1"}, {"ID": 1764, "Title": "Form Array by Concatenating Subarrays of Another Array", "TitleCn": "\u901a\u8fc7\u8fde\u63a5\u53e6\u4e00\u4e2a\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u5f97\u5230\u4e00\u4e2a\u6570\u7ec4", "Url": "https://leetcode.cn/problems/form-array-by-concatenating-subarrays-of-another-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 46 Problem 2"}, {"ID": 1765, "Title": "Map of Highest Peak", "TitleCn": "\u5730\u56fe\u4e2d\u7684\u6700\u9ad8\u70b9", "Url": "https://leetcode.cn/problems/map-of-highest-peak/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 46 Problem 3"}, {"ID": 1766, "Title": "Tree of Coprimes", "TitleCn": "\u4e92\u8d28\u6811", "Url": "https://leetcode.cn/problems/tree-of-coprimes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 46 Problem 4"}, {"ID": 1767, "Title": "Find the Subtasks That Did Not Execute", "TitleCn": "\u5bfb\u627e\u6ca1\u6709\u88ab\u6267\u884c\u7684\u4efb\u52a1\u5bf9", "Url": "https://leetcode.cn/problems/find-the-subtasks-that-did-not-execute/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1768, "Title": "Merge Strings Alternately", "TitleCn": "\u4ea4\u66ff\u5408\u5e76\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/merge-strings-alternately/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 229 Problem 1"}, {"ID": 1769, "Title": "Minimum Number of Operations to Move All Balls to Each Box", "TitleCn": "\u79fb\u52a8\u6240\u6709\u7403\u5230\u6bcf\u4e2a\u76d2\u5b50\u6240\u9700\u7684\u6700\u5c0f\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 229 Problem 2"}, {"ID": 1770, "Title": "Maximum Score from Performing Multiplication Operations", "TitleCn": "\u6267\u884c\u4e58\u6cd5\u8fd0\u7b97\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-score-from-performing-multiplication-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 229 Problem 3"}, {"ID": 1771, "Title": "Maximize Palindrome Length From Subsequences", "TitleCn": "\u7531\u5b50\u5e8f\u5217\u6784\u9020\u7684\u6700\u957f\u56de\u6587\u4e32\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/maximize-palindrome-length-from-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 229 Problem 4"}, {"ID": 1772, "Title": "Sort Features by Popularity", "TitleCn": "\u6309\u53d7\u6b22\u8fce\u7a0b\u5ea6\u6392\u5217\u529f\u80fd", "Url": "https://leetcode.cn/problems/sort-features-by-popularity/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1773, "Title": "Count Items Matching a Rule", "TitleCn": "\u7edf\u8ba1\u5339\u914d\u68c0\u7d22\u89c4\u5219\u7684\u7269\u54c1\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-items-matching-a-rule/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 230 Problem 1"}, {"ID": 1774, "Title": "Closest Dessert Cost", "TitleCn": "\u6700\u63a5\u8fd1\u76ee\u6807\u4ef7\u683c\u7684\u751c\u70b9\u6210\u672c", "Url": "https://leetcode.cn/problems/closest-dessert-cost/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 230 Problem 2"}, {"ID": 1775, "Title": "Equal Sum Arrays With Minimum Number of Operations", "TitleCn": "\u901a\u8fc7\u6700\u5c11\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u7684\u548c\u76f8\u7b49", "Url": "https://leetcode.cn/problems/equal-sum-arrays-with-minimum-number-of-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 230 Problem 3"}, {"ID": 1776, "Title": "Car Fleet II", "TitleCn": "\u8f66\u961f II", "Url": "https://leetcode.cn/problems/car-fleet-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 230 Problem 4"}, {"ID": 1777, "Title": "Product's Price for Each Store", "TitleCn": "\u6bcf\u5bb6\u5546\u5e97\u7684\u4ea7\u54c1\u4ef7\u683c", "Url": "https://leetcode.cn/problems/products-price-for-each-store/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1778, "Title": "Shortest Path in a Hidden Grid", "TitleCn": "\u672a\u77e5\u7f51\u683c\u4e2d\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-path-in-a-hidden-grid/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1779, "Title": "Find Nearest Point That Has the Same X or Y Coordinate", "TitleCn": "\u627e\u5230\u6700\u8fd1\u7684\u6709\u76f8\u540c X \u6216 Y \u5750\u6807\u7684\u70b9", "Url": "https://leetcode.cn/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 47 Problem 1"}, {"ID": 1780, "Title": "Check if Number is a Sum of Powers of Three", "TitleCn": "\u5224\u65ad\u4e00\u4e2a\u6570\u5b57\u662f\u5426\u53ef\u4ee5\u8868\u793a\u6210\u4e09\u7684\u5e42\u7684\u548c", "Url": "https://leetcode.cn/problems/check-if-number-is-a-sum-of-powers-of-three/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 47 Problem 2"}, {"ID": 1781, "Title": "Sum of Beauty of All Substrings", "TitleCn": "\u6240\u6709\u5b50\u5b57\u7b26\u4e32\u7f8e\u4e3d\u503c\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-beauty-of-all-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 47 Problem 3"}, {"ID": 1782, "Title": "Count Pairs Of Nodes", "TitleCn": "\u7edf\u8ba1\u70b9\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/contest/biweekly-contest-47/problems/count-pairs-of-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 47 Problem 4"}, {"ID": 1783, "Title": "Grand Slam Titles", "TitleCn": "\u5927\u6ee1\u8d2f\u6570\u91cf", "Url": "https://leetcode.cn/problems/grand-slam-titles/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1784, "Title": "Check if Binary String Has at Most One Segment of Ones", "TitleCn": "\u68c0\u67e5\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u6bb5", "Url": "https://leetcode.cn/problems/check-if-binary-string-has-at-most-one-segment-of-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 231 Problem 1"}, {"ID": 1785, "Title": "Minimum Elements to Add to Form a Given Sum", "TitleCn": "\u6784\u6210\u7279\u5b9a\u548c\u9700\u8981\u6dfb\u52a0\u7684\u6700\u5c11\u5143\u7d20", "Url": "https://leetcode.cn/problems/minimum-elements-to-add-to-form-a-given-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 231 Problem 2"}, {"ID": 1786, "Title": "Number of Restricted Paths From First to Last Node", "TitleCn": "\u4ece\u7b2c\u4e00\u4e2a\u8282\u70b9\u51fa\u53d1\u5230\u6700\u540e\u4e00\u4e2a\u8282\u70b9\u7684\u53d7\u9650\u8def\u5f84\u6570", "Url": "https://leetcode.cn/problems/number-of-restricted-paths-from-first-to-last-node/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 231 Problem 3"}, {"ID": 1787, "Title": "Make the XOR of All Segments Equal to Zero", "TitleCn": "\u4f7f\u6240\u6709\u533a\u95f4\u7684\u5f02\u6216\u7ed3\u679c\u4e3a\u96f6", "Url": "https://leetcode.cn/problems/make-the-xor-of-all-segments-equal-to-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 231 Problem 4"}, {"ID": 1788, "Title": "Maximize the Beauty of the Garden", "TitleCn": "\u6700\u5927\u5316\u82b1\u56ed\u7684\u7f8e\u89c2\u5ea6", "Url": "https://leetcode.cn/problems/maximize-the-beauty-of-the-garden/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1789, "Title": "Primary Department for Each Employee", "TitleCn": "\u5458\u5de5\u7684\u76f4\u5c5e\u90e8\u95e8", "Url": "https://leetcode.cn/problems/primary-department-for-each-employee/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1790, "Title": "Check if One String Swap Can Make Strings Equal", "TitleCn": "\u4ec5\u6267\u884c\u4e00\u6b21\u5b57\u7b26\u4e32\u4ea4\u6362\u80fd\u5426\u4f7f\u4e24\u4e2a\u5b57\u7b26\u4e32\u76f8\u7b49", "Url": "https://leetcode.cn/problems/check-if-one-string-swap-can-make-strings-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 232 Problem 1"}, {"ID": 1791, "Title": "Find Center of Star Graph", "TitleCn": "\u627e\u51fa\u661f\u578b\u56fe\u7684\u4e2d\u5fc3\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-center-of-star-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 232 Problem 2"}, {"ID": 1792, "Title": "Maximum Average Pass Ratio", "TitleCn": "\u6700\u5927\u5e73\u5747\u901a\u8fc7\u7387", "Url": "https://leetcode.cn/problems/maximum-average-pass-ratio/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 232 Problem 3"}, {"ID": 1793, "Title": "Maximum Score of a Good Subarray", "TitleCn": "\u597d\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-score-of-a-good-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 232 Problem 4"}, {"ID": 1794, "Title": "Count Pairs of Equal Substrings With Minimum Difference", "TitleCn": "\u7edf\u8ba1\u8ddd\u79bb\u6700\u5c0f\u7684\u5b50\u4e32\u5bf9\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-pairs-of-equal-substrings-with-minimum-difference/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1795, "Title": "Rearrange Products Table", "TitleCn": "\u6bcf\u4e2a\u4ea7\u54c1\u5728\u4e0d\u540c\u5546\u5e97\u7684\u4ef7\u683c", "Url": "https://leetcode.cn/problems/rearrange-products-table/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1796, "Title": "Second Largest Digit in a String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u7b2c\u4e8c\u5927\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/second-largest-digit-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 48 Problem 1"}, {"ID": 1797, "Title": "Design Authentication Manager", "TitleCn": "\u8bbe\u8ba1\u4e00\u4e2a\u9a8c\u8bc1\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-authentication-manager/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 48 Problem 2"}, {"ID": 1798, "Title": "Maximum Number of Consecutive Values You Can Make", "TitleCn": "\u4f60\u80fd\u6784\u9020\u51fa\u8fde\u7eed\u503c\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-consecutive-values-you-can-make/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 48 Problem 3"}, {"ID": 1799, "Title": "Maximize Score After N Operations", "TitleCn": "N \u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5206\u6570\u548c", "Url": "https://leetcode.cn/problems/maximize-score-after-n-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 48 Problem 4"}, {"ID": 1800, "Title": "Maximum Ascending Subarray Sum", "TitleCn": "\u6700\u5927\u5347\u5e8f\u5b50\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/maximum-ascending-subarray-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 233 Problem 1"}, {"ID": 1801, "Title": "Number of Orders in the Backlog", "TitleCn": "\u79ef\u538b\u8ba2\u5355\u4e2d\u7684\u8ba2\u5355\u603b\u6570", "Url": "https://leetcode.cn/problems/number-of-orders-in-the-backlog/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 233 Problem 2"}, {"ID": 1802, "Title": "Maximum Value at a Given Index in a Bounded Array", "TitleCn": "\u6709\u754c\u6570\u7ec4\u4e2d\u6307\u5b9a\u4e0b\u6807\u5904\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/maximum-value-at-a-given-index-in-a-bounded-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 233 Problem 3"}, {"ID": 1803, "Title": "Count Pairs With XOR in a Range", "TitleCn": "\u7edf\u8ba1\u5f02\u6216\u503c\u5728\u8303\u56f4\u5185\u7684\u6570\u5bf9\u6709\u591a\u5c11", "Url": "https://leetcode.cn/problems/count-pairs-with-xor-in-a-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 233 Problem 4"}, {"ID": 1804, "Title": "Implement Trie II (Prefix Tree)", "TitleCn": "\u5b9e\u73b0 Trie \uff08\u524d\u7f00\u6811\uff09 II", "Url": "https://leetcode.cn/problems/implement-trie-ii-prefix-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1805, "Title": "Number of Different Integers in a String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u4e0d\u540c\u6574\u6570\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-different-integers-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 234 Problem 1"}, {"ID": 1806, "Title": "Minimum Number of Operations to Reinitialize a Permutation", "TitleCn": "\u8fd8\u539f\u6392\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b65\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-reinitialize-a-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 234 Problem 2"}, {"ID": 1807, "Title": "Evaluate the Bracket Pairs of a String", "TitleCn": "\u66ff\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u62ec\u53f7\u5185\u5bb9", "Url": "https://leetcode.cn/problems/evaluate-the-bracket-pairs-of-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 234 Problem 3"}, {"ID": 1808, "Title": "Maximize Number of Nice Divisors", "TitleCn": "\u597d\u56e0\u5b50\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximize-number-of-nice-divisors/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 234 Problem 4"}, {"ID": 1809, "Title": "Ad-Free Sessions", "TitleCn": "\u6ca1\u6709\u5e7f\u544a\u7684\u5267\u96c6", "Url": "https://leetcode.cn/problems/ad-free-sessions/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1810, "Title": "Minimum Path Cost in a Hidden Grid", "TitleCn": "\u9690\u85cf\u7f51\u683c\u4e0b\u7684\u6700\u5c0f\u6d88\u8017\u8def\u5f84", "Url": "https://leetcode.cn/problems/minimum-path-cost-in-a-hidden-grid/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1811, "Title": "Find Interview Candidates", "TitleCn": "\u5bfb\u627e\u9762\u8bd5\u5019\u9009\u4eba", "Url": "https://leetcode.cn/problems/find-interview-candidates/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1812, "Title": "Determine Color of a Chessboard Square", "TitleCn": "\u5224\u65ad\u56fd\u9645\u8c61\u68cb\u68cb\u76d8\u4e2d\u4e00\u4e2a\u683c\u5b50\u7684\u989c\u8272", "Url": "https://leetcode.cn/problems/determine-color-of-a-chessboard-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 49 Problem 1"}, {"ID": 1813, "Title": "Sentence Similarity III", "TitleCn": "\u53e5\u5b50\u76f8\u4f3c\u6027 III", "Url": "https://leetcode.cn/problems/sentence-similarity-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 49 Problem 2"}, {"ID": 1814, "Title": "Count Nice Pairs in an Array", "TitleCn": "\u7edf\u8ba1\u4e00\u4e2a\u6570\u7ec4\u4e2d\u597d\u5bf9\u5b50\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-nice-pairs-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 49 Problem 3"}, {"ID": 1815, "Title": "Maximum Number of Groups Getting Fresh Donuts", "TitleCn": "\u5f97\u5230\u65b0\u9c9c\u751c\u751c\u5708\u7684\u6700\u591a\u7ec4\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-groups-getting-fresh-donuts/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 49 Problem 4"}, {"ID": 1816, "Title": "Truncate Sentence", "TitleCn": "\u622a\u65ad\u53e5\u5b50", "Url": "https://leetcode.cn/problems/truncate-sentence/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 235 Problem 1"}, {"ID": 1817, "Title": "Finding the Users Active Minutes", "TitleCn": "\u67e5\u627e\u7528\u6237\u6d3b\u8dc3\u5206\u949f\u6570", "Url": "https://leetcode.cn/problems/finding-the-users-active-minutes/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 235 Problem 2"}, {"ID": 1818, "Title": "Minimum Absolute Sum Difference", "TitleCn": "\u7edd\u5bf9\u5dee\u503c\u548c", "Url": "https://leetcode.cn/problems/minimum-absolute-sum-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 235 Problem 3"}, {"ID": 1819, "Title": "Number of Different Subsequences GCDs", "TitleCn": "\u5e8f\u5217\u4e2d\u4e0d\u540c\u6700\u5927\u516c\u7ea6\u6570\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-different-subsequences-gcds/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 235 Problem 4"}, {"ID": 1820, "Title": "Maximum Number of Accepted Invitations", "TitleCn": "\u6700\u591a\u9080\u8bf7\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-accepted-invitations/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1821, "Title": "Find Customers With Positive Revenue this Year", "TitleCn": "\u5bfb\u627e\u4eca\u5e74\u5177\u6709\u6b63\u6536\u5165\u7684\u5ba2\u6237", "Url": "https://leetcode.cn/problems/find-customers-with-positive-revenue-this-year/", "Ispaid": 1, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1822, "Title": "Sign of the Product of an Array", "TitleCn": "\u6570\u7ec4\u5143\u7d20\u79ef\u7684\u7b26\u53f7", "Url": "https://leetcode.cn/problems/sign-of-the-product-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 236 Problem 1"}, {"ID": 1823, "Title": "Find the Winner of the Circular Game", "TitleCn": "\u627e\u51fa\u6e38\u620f\u7684\u83b7\u80dc\u8005", "Url": "https://leetcode.cn/problems/find-the-winner-of-the-circular-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 236 Problem 2"}, {"ID": 1824, "Title": "Minimum Sideway Jumps", "TitleCn": "\u6700\u5c11\u4fa7\u8df3\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-sideway-jumps/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 236 Problem 3"}, {"ID": 1825, "Title": "Finding MK Average", "TitleCn": "\u6c42\u51fa MK \u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/finding-mk-average/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 236 Problem 4"}, {"ID": 1826, "Title": "Faulty Sensor", "TitleCn": "\u6709\u7f3a\u9677\u7684\u4f20\u611f\u5668", "Url": "https://leetcode.cn/problems/faulty-sensor/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1827, "Title": "Minimum Operations to Make the Array Increasing", "TitleCn": "\u6700\u5c11\u64cd\u4f5c\u4f7f\u6570\u7ec4\u9012\u589e", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-the-array-increasing/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 50 Problem 1"}, {"ID": 1828, "Title": "Queries on Number of Points Inside a Circle", "TitleCn": "\u7edf\u8ba1\u4e00\u4e2a\u5706\u4e2d\u70b9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/queries-on-number-of-points-inside-a-circle/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 11, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 50 Problem 2"}, {"ID": 1829, "Title": "Maximum XOR for Each Query", "TitleCn": "\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5927\u5f02\u6216\u503c", "Url": "https://leetcode.cn/problems/maximum-xor-for-each-query/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 50 Problem 3"}, {"ID": 1830, "Title": "Minimum Number of Operations to Make String Sorted", "TitleCn": "\u4f7f\u5b57\u7b26\u4e32\u6709\u5e8f\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-string-sorted/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 50 Problem 4"}, {"ID": 1831, "Title": "Maximum Transaction Each Day", "TitleCn": "\u6bcf\u5929\u7684\u6700\u5927\u4ea4\u6613", "Url": "https://leetcode.cn/problems/maximum-transaction-each-day/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1832, "Title": "Check if the Sentence Is Pangram", "TitleCn": "\u5224\u65ad\u53e5\u5b50\u662f\u5426\u4e3a\u5168\u5b57\u6bcd\u53e5", "Url": "https://leetcode.cn/problems/check-if-the-sentence-is-pangram/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 237 Problem 1"}, {"ID": 1833, "Title": "Maximum Ice Cream Bars", "TitleCn": "\u96ea\u7cd5\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-ice-cream-bars/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 237 Problem 2"}, {"ID": 1834, "Title": "Single-Threaded CPU", "TitleCn": "\u5355\u7ebf\u7a0b CPU", "Url": "https://leetcode.cn/problems/single-threaded-cpu/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 237 Problem 3"}, {"ID": 1835, "Title": "Find XOR Sum of All Pairs Bitwise AND", "TitleCn": "\u6240\u6709\u6570\u5bf9\u6309\u4f4d\u4e0e\u7ed3\u679c\u7684\u5f02\u6216\u548c", "Url": "https://leetcode.cn/problems/find-xor-sum-of-all-pairs-bitwise-and/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 237 Problem 4"}, {"ID": 1836, "Title": "Remove Duplicates From an Unsorted Linked List", "TitleCn": "\u4ece\u672a\u6392\u5e8f\u7684\u94fe\u8868\u4e2d\u79fb\u9664\u91cd\u590d\u5143\u7d20", "Url": "https://leetcode.cn/problems/remove-duplicates-from-an-unsorted-linked-list/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1837, "Title": "Sum of Digits in Base K", "TitleCn": "K \u8fdb\u5236\u8868\u793a\u4e0b\u7684\u5404\u4f4d\u6570\u5b57\u603b\u548c", "Url": "https://leetcode.cn/problems/sum-of-digits-in-base-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 238 Problem 1"}, {"ID": 1838, "Title": "Frequency of the Most Frequent Element", "TitleCn": "\u6700\u9ad8\u9891\u5143\u7d20\u7684\u9891\u6570", "Url": "https://leetcode.cn/problems/frequency-of-the-most-frequent-element/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 238 Problem 2"}, {"ID": 1839, "Title": "Longest Substring Of All Vowels in Order", "TitleCn": "\u6240\u6709\u5143\u97f3\u6309\u987a\u5e8f\u6392\u5e03\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/longest-substring-of-all-vowels-in-order/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 238 Problem 3"}, {"ID": 1840, "Title": "Maximum Building Height", "TitleCn": "\u6700\u9ad8\u5efa\u7b51\u9ad8\u5ea6", "Url": "https://leetcode.cn/problems/maximum-building-height/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 238 Problem 4"}, {"ID": 1841, "Title": "League Statistics", "TitleCn": "\u8054\u8d5b\u4fe1\u606f\u7edf\u8ba1", "Url": "https://leetcode.cn/problems/league-statistics/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1842, "Title": "Next Palindrome Using Same Digits", "TitleCn": "\u4e0b\u4e2a\u7531\u76f8\u540c\u6570\u5b57\u6784\u6210\u7684\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/next-palindrome-using-same-digits/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1843, "Title": "Suspicious Bank Accounts", "TitleCn": "\u53ef\u7591\u94f6\u884c\u8d26\u6237", "Url": "https://leetcode.cn/problems/suspicious-bank-accounts/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1844, "Title": "Replace All Digits with Characters", "TitleCn": "\u5c06\u6240\u6709\u6570\u5b57\u7528\u5b57\u7b26\u66ff\u6362", "Url": "https://leetcode.cn/problems/replace-all-digits-with-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 51 Problem 1"}, {"ID": 1845, "Title": "Seat Reservation Manager", "TitleCn": "\u5ea7\u4f4d\u9884\u7ea6\u7ba1\u7406\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/seat-reservation-manager/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 51 Problem 2"}, {"ID": 1846, "Title": "Maximum Element After Decreasing and Rearranging", "TitleCn": "\u51cf\u5c0f\u548c\u91cd\u65b0\u6392\u5217\u6570\u7ec4\u540e\u7684\u6700\u5927\u5143\u7d20", "Url": "https://leetcode.cn/problems/maximum-element-after-decreasing-and-rearranging/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 51 Problem 3"}, {"ID": 1847, "Title": "Closest Room", "TitleCn": "\u6700\u8fd1\u7684\u623f\u95f4", "Url": "https://leetcode.cn/problems/closest-room/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 51 Problem 4"}, {"ID": 1848, "Title": "Minimum Distance to the Target Element", "TitleCn": "\u5230\u76ee\u6807\u5143\u7d20\u7684\u6700\u5c0f\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/minimum-distance-to-the-target-element/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 239 Problem 1"}, {"ID": 1849, "Title": "Splitting a String Into Descending Consecutive Values", "TitleCn": "\u5c06\u5b57\u7b26\u4e32\u62c6\u5206\u4e3a\u9012\u51cf\u7684\u8fde\u7eed\u503c", "Url": "https://leetcode.cn/problems/splitting-a-string-into-descending-consecutive-values/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 239 Problem 2"}, {"ID": 1850, "Title": "Minimum Adjacent Swaps to Reach the Kth Smallest Number", "TitleCn": "\u90bb\u4f4d\u4ea4\u6362\u7684\u6700\u5c0f\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 239 Problem 3"}, {"ID": 1851, "Title": "Minimum Interval to Include Each Query", "TitleCn": "\u5305\u542b\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5c0f\u533a\u95f4", "Url": "https://leetcode.cn/problems/minimum-interval-to-include-each-query/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 239 Problem 4"}, {"ID": 1852, "Title": "Distinct Numbers in Each Subarray", "TitleCn": "\u6bcf\u4e2a\u5b50\u6570\u7ec4\u7684\u6570\u5b57\u79cd\u7c7b\u6570", "Url": "https://leetcode.cn/problems/distinct-numbers-in-each-subarray/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1853, "Title": "Convert Date Format", "TitleCn": "\u8f6c\u6362\u65e5\u671f\u683c\u5f0f", "Url": "https://leetcode.cn/problems/convert-date-format/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1854, "Title": "Maximum Population Year", "TitleCn": "\u4eba\u53e3\u6700\u591a\u7684\u5e74\u4efd", "Url": "https://leetcode.cn/problems/maximum-population-year/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 240 Problem 1"}, {"ID": 1855, "Title": "Maximum Distance Between a Pair of Values", "TitleCn": "\u4e0b\u6807\u5bf9\u4e2d\u7684\u6700\u5927\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/maximum-distance-between-a-pair-of-values/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 240 Problem 2"}, {"ID": 1856, "Title": "Maximum Subarray Min-Product", "TitleCn": "\u5b50\u6570\u7ec4\u6700\u5c0f\u4e58\u79ef\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/maximum-subarray-min-product/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 240 Problem 3"}, {"ID": 1857, "Title": "Largest Color Value in a Directed Graph", "TitleCn": "\u6709\u5411\u56fe\u4e2d\u6700\u5927\u989c\u8272\u503c", "Url": "https://leetcode.cn/problems/largest-color-value-in-a-directed-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 240 Problem 4"}, {"ID": 1858, "Title": "Longest Word With All Prefixes", "TitleCn": "\u5305\u542b\u6240\u6709\u524d\u7f00\u7684\u6700\u957f\u5355\u8bcd", "Url": "https://leetcode.cn/problems/longest-word-with-all-prefixes/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1859, "Title": "Sorting the Sentence", "TitleCn": "\u5c06\u53e5\u5b50\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sorting-the-sentence/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 52 Problem 1"}, {"ID": 1860, "Title": "Incremental Memory Leak", "TitleCn": "\u589e\u957f\u7684\u5185\u5b58\u6cc4\u9732", "Url": "https://leetcode.cn/problems/incremental-memory-leak/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 52 Problem 2"}, {"ID": 1861, "Title": "Rotating the Box", "TitleCn": "\u65cb\u8f6c\u76d2\u5b50", "Url": "https://leetcode.cn/problems/rotating-the-box/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 52 Problem 3"}, {"ID": 1862, "Title": "Sum of Floored Pairs", "TitleCn": "\u5411\u4e0b\u53d6\u6574\u6570\u5bf9\u548c", "Url": "https://leetcode.cn/problems/sum-of-floored-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 52 Problem 4"}, {"ID": 1863, "Title": "Sum of All Subset XOR Totals", "TitleCn": "\u627e\u51fa\u6240\u6709\u5b50\u96c6\u7684\u5f02\u6216\u603b\u548c\u518d\u6c42\u548c", "Url": "https://leetcode.cn/problems/sum-of-all-subset-xor-totals/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 241 Problem 1"}, {"ID": 1864, "Title": "Minimum Number of Swaps to Make the Binary String Alternating", "TitleCn": "\u6784\u6210\u4ea4\u66ff\u5b57\u7b26\u4e32\u9700\u8981\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-swaps-to-make-the-binary-string-alternating/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 241 Problem 2"}, {"ID": 1865, "Title": "Finding Pairs With a Certain Sum", "TitleCn": "\u627e\u51fa\u548c\u4e3a\u6307\u5b9a\u503c\u7684\u4e0b\u6807\u5bf9", "Url": "https://leetcode.cn/problems/finding-pairs-with-a-certain-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 241 Problem 3"}, {"ID": 1866, "Title": "Number of Ways to Rearrange Sticks With K Sticks Visible", "TitleCn": "\u6070\u6709 K \u6839\u6728\u68cd\u53ef\u4ee5\u770b\u5230\u7684\u6392\u5217\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-ways-to-rearrange-sticks-with-k-sticks-visible/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 241 Problem 4"}, {"ID": 1867, "Title": "Orders With Maximum Quantity Above Average", "TitleCn": "\u6700\u5927\u6570\u91cf\u9ad8\u4e8e\u5e73\u5747\u6c34\u5e73\u7684\u8ba2\u5355", "Url": "https://leetcode.cn/problems/orders-with-maximum-quantity-above-average/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1868, "Title": "Product of Two Run-Length Encoded Arrays", "TitleCn": "\u4e24\u4e2a\u884c\u7a0b\u7f16\u7801\u6570\u7ec4\u7684\u79ef", "Url": "https://leetcode.cn/problems/product-of-two-run-length-encoded-arrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1869, "Title": "Longer Contiguous Segments of Ones than Zeros", "TitleCn": "\u54ea\u79cd\u8fde\u7eed\u5b50\u5b57\u7b26\u4e32\u66f4\u957f", "Url": "https://leetcode.cn/problems/longer-contiguous-segments-of-ones-than-zeros/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 242 Problem 1"}, {"ID": 1870, "Title": "Minimum Speed to Arrive on Time", "TitleCn": "\u51c6\u65f6\u5230\u8fbe\u7684\u5217\u8f66\u6700\u5c0f\u65f6\u901f", "Url": "https://leetcode.cn/problems/minimum-speed-to-arrive-on-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 242 Problem 2"}, {"ID": 1871, "Title": "Jump Game VII", "TitleCn": "\u8df3\u8dc3\u6e38\u620f VII", "Url": "https://leetcode.cn/problems/jump-game-vii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 242 Problem 3"}, {"ID": 1872, "Title": "Stone Game VIII", "TitleCn": "\u77f3\u5b50\u6e38\u620f VIII", "Url": "https://leetcode.cn/problems/stone-game-viii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 242 Problem 4"}, {"ID": 1873, "Title": "Calculate Special Bonus", "TitleCn": "\u8ba1\u7b97\u7279\u6b8a\u5956\u91d1", "Url": "https://leetcode.cn/problems/calculate-special-bonus/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1874, "Title": "Minimize Product Sum of Two Arrays", "TitleCn": "\u4e24\u4e2a\u6570\u7ec4\u7684\u6700\u5c0f\u4e58\u79ef\u548c", "Url": "https://leetcode.cn/problems/minimize-product-sum-of-two-arrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1875, "Title": "Group Employees of the Same Salary", "TitleCn": "\u5c06\u5de5\u8d44\u76f8\u540c\u7684\u96c7\u5458\u5206\u7ec4", "Url": "https://leetcode.cn/problems/group-employees-of-the-same-salary/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1876, "Title": "Substrings of Size Three with Distinct Characters", "TitleCn": "\u957f\u5ea6\u4e3a\u4e09\u4e14\u5404\u5b57\u7b26\u4e0d\u540c\u7684\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/substrings-of-size-three-with-distinct-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 53 Problem 1"}, {"ID": 1877, "Title": "Minimize Maximum Pair Sum in Array", "TitleCn": "\u6570\u7ec4\u4e2d\u6700\u5927\u6570\u5bf9\u548c\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/minimize-maximum-pair-sum-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 53 Problem 2"}, {"ID": 1878, "Title": "Get Biggest Three Rhombus Sums in a Grid", "TitleCn": "\u77e9\u9635\u4e2d\u6700\u5927\u7684\u4e09\u4e2a\u83f1\u5f62\u548c", "Url": "https://leetcode.cn/problems/get-biggest-three-rhombus-sums-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 53 Problem 3"}, {"ID": 1879, "Title": "Minimum XOR Sum of Two Arrays", "TitleCn": "\u4e24\u4e2a\u6570\u7ec4\u6700\u5c0f\u7684\u5f02\u6216\u503c\u4e4b\u548c", "Url": "https://leetcode.cn/problems/minimum-xor-sum-of-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 53 Problem 4"}, {"ID": 1880, "Title": "Check if Word Equals Summation of Two Words", "TitleCn": "\u68c0\u67e5\u67d0\u5355\u8bcd\u662f\u5426\u7b49\u4e8e\u4e24\u5355\u8bcd\u4e4b\u548c", "Url": "https://leetcode.cn/problems/check-if-word-equals-summation-of-two-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 243 Problem 1"}, {"ID": 1881, "Title": "Maximum Value after Insertion", "TitleCn": "\u63d2\u5165\u540e\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/maximum-value-after-insertion/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 243 Problem 2"}, {"ID": 1882, "Title": "Process Tasks Using Servers", "TitleCn": "\u4f7f\u7528\u670d\u52a1\u5668\u5904\u7406\u4efb\u52a1", "Url": "https://leetcode.cn/problems/process-tasks-using-servers/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 243 Problem 3"}, {"ID": 1883, "Title": "Minimum Skips to Arrive at Meeting On Time", "TitleCn": "\u51c6\u65f6\u62b5\u8fbe\u4f1a\u8bae\u73b0\u573a\u7684\u6700\u5c0f\u8df3\u8fc7\u4f11\u606f\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-skips-to-arrive-at-meeting-on-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 243 Problem 4"}, {"ID": 1884, "Title": "Egg Drop With 2 Eggs and N Floors", "TitleCn": "\u9e21\u86cb\u6389\u843d-\u4e24\u679a\u9e21\u86cb", "Url": "https://leetcode.cn/problems/egg-drop-with-2-eggs-and-n-floors/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1885, "Title": "Count Pairs in Two Arrays", "TitleCn": "\u7edf\u8ba1\u6570\u5bf9", "Url": "https://leetcode.cn/problems/count-pairs-in-two-arrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1886, "Title": "Determine Whether Matrix Can Be Obtained By Rotation", "TitleCn": "\u5224\u65ad\u77e9\u9635\u7ecf\u8f6e\u8f6c\u540e\u662f\u5426\u4e00\u81f4", "Url": "https://leetcode.cn/problems/determine-whether-matrix-can-be-obtained-by-rotation/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 244 Problem 1"}, {"ID": 1887, "Title": "Reduction Operations to Make the Array Elements Equal", "TitleCn": "\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49\u7684\u51cf\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/reduction-operations-to-make-the-array-elements-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 244 Problem 2"}, {"ID": 1888, "Title": "Minimum Number of Flips to Make the Binary String Alternating", "TitleCn": "\u4f7f\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u7b26\u4ea4\u66ff\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-flips-to-make-the-binary-string-alternating/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 244 Problem 3"}, {"ID": 1889, "Title": "Minimum Space Wasted From Packaging", "TitleCn": "\u88c5\u5305\u88f9\u7684\u6700\u5c0f\u6d6a\u8d39\u7a7a\u95f4", "Url": "https://leetcode.cn/problems/minimum-space-wasted-from-packaging/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 244 Problem 4"}, {"ID": 1890, "Title": "The Latest Login in 2020", "TitleCn": "2020\u5e74\u6700\u540e\u4e00\u6b21\u767b\u5f55", "Url": "https://leetcode.cn/problems/the-latest-login-in-2020/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1891, "Title": "Cutting Ribbons", "TitleCn": "\u5272\u7ef3\u5b50", "Url": "https://leetcode.cn/problems/cutting-ribbons/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1892, "Title": "Page Recommendations II", "TitleCn": "\u9875\u9762\u63a8\u8350\u2161", "Url": "https://leetcode.cn/problems/page-recommendations-ii/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1893, "Title": "Check if All the Integers in a Range Are Covered", "TitleCn": "\u68c0\u67e5\u662f\u5426\u533a\u57df\u5185\u6240\u6709\u6574\u6570\u90fd\u88ab\u8986\u76d6", "Url": "https://leetcode.cn/problems/check-if-all-the-integers-in-a-range-are-covered/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 54 Problem 1"}, {"ID": 1894, "Title": "Find the Student that Will Replace the Chalk", "TitleCn": "\u627e\u5230\u9700\u8981\u8865\u5145\u7c89\u7b14\u7684\u5b66\u751f\u7f16\u53f7", "Url": "https://leetcode.cn/problems/find-the-student-that-will-replace-the-chalk/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 54 Problem 2"}, {"ID": 1895, "Title": "Largest Magic Square", "TitleCn": "\u6700\u5927\u7684\u5e7b\u65b9", "Url": "https://leetcode.cn/problems/largest-magic-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 54 Problem 3"}, {"ID": 1896, "Title": "Minimum Cost to Change the Final Value of Expression", "TitleCn": "\u53cd\u8f6c\u8868\u8fbe\u5f0f\u503c\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-cost-to-change-the-final-value-of-expression/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 54 Problem 4"}, {"ID": 1897, "Title": "Redistribute Characters to Make All Strings Equal", "TitleCn": "\u91cd\u65b0\u5206\u914d\u5b57\u7b26\u4f7f\u6240\u6709\u5b57\u7b26\u4e32\u90fd\u76f8\u7b49", "Url": "https://leetcode.cn/problems/redistribute-characters-to-make-all-strings-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 245 Problem 1"}, {"ID": 1898, "Title": "Maximum Number of Removable Characters", "TitleCn": "\u53ef\u79fb\u9664\u5b57\u7b26\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-removable-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 245 Problem 2"}, {"ID": 1899, "Title": "Merge Triplets to Form Target Triplet", "TitleCn": "\u5408\u5e76\u82e5\u5e72\u4e09\u5143\u7ec4\u4ee5\u5f62\u6210\u76ee\u6807\u4e09\u5143\u7ec4", "Url": "https://leetcode.cn/problems/merge-triplets-to-form-target-triplet/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 245 Problem 3"}, {"ID": 1900, "Title": "The Earliest and Latest Rounds Where Players Compete", "TitleCn": "\u6700\u4f73\u8fd0\u52a8\u5458\u7684\u6bd4\u62fc\u56de\u5408", "Url": "https://leetcode.cn/problems/the-earliest-and-latest-rounds-where-players-compete/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 245 Problem 4"}, {"ID": 1901, "Title": "Find a Peak Element II", "TitleCn": "\u5bfb\u627e\u5cf0\u503c II", "Url": "https://leetcode.cn/problems/find-a-peak-element-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1902, "Title": "Depth of BST Given Insertion Order", "TitleCn": "\u7ed9\u5b9a\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u63d2\u5165\u987a\u5e8f\u6c42\u6df1\u5ea6", "Url": "https://leetcode.cn/problems/depth-of-bst-given-insertion-order/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1903, "Title": "Largest Odd Number in String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u7684\u6700\u5927\u5947\u6570", "Url": "https://leetcode.cn/problems/largest-odd-number-in-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 246 Problem 1"}, {"ID": 1904, "Title": "The Number of Full Rounds You Have Played", "TitleCn": "\u4f60\u5b8c\u6210\u7684\u5b8c\u6574\u5bf9\u5c40\u6570", "Url": "https://leetcode.cn/problems/the-number-of-full-rounds-you-have-played/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 246 Problem 2"}, {"ID": 1905, "Title": "Count Sub Islands", "TitleCn": "\u7edf\u8ba1\u5b50\u5c9b\u5c7f", "Url": "https://leetcode.cn/problems/count-sub-islands/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 246 Problem 3"}, {"ID": 1906, "Title": "Minimum Absolute Difference Queries", "TitleCn": "\u67e5\u8be2\u5dee\u7edd\u5bf9\u503c\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/minimum-absolute-difference-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 246 Problem 4"}, {"ID": 1907, "Title": "Count Salary Categories", "TitleCn": "\u6309\u5206\u7c7b\u7edf\u8ba1\u85aa\u6c34", "Url": "https://leetcode.cn/problems/count-salary-categories/", "Ispaid": 0, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1908, "Title": "Game of Nim", "TitleCn": "Nim \u6e38\u620f II", "Url": "https://leetcode.cn/problems/game-of-nim/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1909, "Title": "Remove One Element to Make the Array Strictly Increasing", "TitleCn": "\u5220\u9664\u4e00\u4e2a\u5143\u7d20\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e", "Url": "https://leetcode.cn/problems/remove-one-element-to-make-the-array-strictly-increasing/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 55 Problem 1"}, {"ID": 1910, "Title": "Remove All Occurrences of a Substring", "TitleCn": "\u5220\u9664\u4e00\u4e2a\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u51fa\u73b0\u7684\u7ed9\u5b9a\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/remove-all-occurrences-of-a-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 55 Problem 2"}, {"ID": 1911, "Title": "Maximum Alternating Subsequence Sum", "TitleCn": "\u6700\u5927\u5b50\u5e8f\u5217\u4ea4\u66ff\u548c", "Url": "https://leetcode.cn/problems/maximum-alternating-subsequence-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 55 Problem 3"}, {"ID": 1912, "Title": "Design Movie Rental System", "TitleCn": "\u8bbe\u8ba1\u7535\u5f71\u79df\u501f\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-movie-rental-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 55 Problem 4"}, {"ID": 1913, "Title": "Maximum Product Difference Between Two Pairs", "TitleCn": "\u4e24\u4e2a\u6570\u5bf9\u4e4b\u95f4\u7684\u6700\u5927\u4e58\u79ef\u5dee", "Url": "https://leetcode.cn/problems/maximum-product-difference-between-two-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 247 Problem 1"}, {"ID": 1914, "Title": "Cyclically Rotating a Grid", "TitleCn": "\u5faa\u73af\u8f6e\u8f6c\u77e9\u9635", "Url": "https://leetcode.cn/problems/cyclically-rotating-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 247 Problem 2"}, {"ID": 1915, "Title": "Number of Wonderful Substrings", "TitleCn": "\u6700\u7f8e\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-wonderful-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 247 Problem 3"}, {"ID": 1916, "Title": "Count Ways to Build Rooms in an Ant Colony", "TitleCn": "\u7edf\u8ba1\u4e3a\u8681\u7fa4\u6784\u7b51\u623f\u95f4\u7684\u4e0d\u540c\u987a\u5e8f", "Url": "https://leetcode.cn/problems/count-ways-to-build-rooms-in-an-ant-colony/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 247 Problem 4"}, {"ID": 1917, "Title": "Leetcodify Friends Recommendations", "TitleCn": "Leetcodify \u597d\u53cb\u63a8\u8350", "Url": "https://leetcode.cn/problems/leetcodify-friends-recommendations/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1918, "Title": "Kth Smallest Subarray Sum", "TitleCn": "\u7b2c K \u5c0f\u7684\u5b50\u5e8f\u5217\u548c", "Url": "https://leetcode.cn/problems/kth-smallest-subarray-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1919, "Title": "Leetcodify Similar Friends", "TitleCn": "\u5174\u8da3\u76f8\u540c\u7684\u670b\u53cb", "Url": "https://leetcode.cn/problems/leetcodify-similar-friends/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1920, "Title": "Build Array from Permutation", "TitleCn": "\u57fa\u4e8e\u6392\u5217\u6784\u5efa\u6570\u7ec4", "Url": "https://leetcode.cn/problems/build-array-from-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 248 Problem 1"}, {"ID": 1921, "Title": "Eliminate Maximum Number of Monsters", "TitleCn": "\u6d88\u706d\u602a\u7269\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/eliminate-maximum-number-of-monsters/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 248 Problem 2"}, {"ID": 1922, "Title": "Count Good Numbers", "TitleCn": "\u7edf\u8ba1\u597d\u6570\u5b57\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-good-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 248 Problem 3"}, {"ID": 1923, "Title": "Longest Common Subpath", "TitleCn": "\u6700\u957f\u516c\u5171\u5b50\u8def\u5f84", "Url": "https://leetcode.cn/problems/longest-common-subpath/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 248 Problem 4"}, {"ID": 1924, "Title": "Erect the Fence II", "TitleCn": "\u5b89\u88c5\u6805\u680f II", "Url": "https://leetcode.cn/problems/erect-the-fence-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1925, "Title": "Count Square Sum Triples", "TitleCn": "\u7edf\u8ba1\u5e73\u65b9\u548c\u4e09\u5143\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-square-sum-triples/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 56 Problem 1"}, {"ID": 1926, "Title": "Nearest Exit from Entrance in Maze", "TitleCn": "\u8ff7\u5bab\u4e2d\u79bb\u5165\u53e3\u6700\u8fd1\u7684\u51fa\u53e3", "Url": "https://leetcode.cn/problems/nearest-exit-from-entrance-in-maze/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 56 Problem 2"}, {"ID": 1927, "Title": "Sum Game", "TitleCn": "\u6c42\u548c\u6e38\u620f", "Url": "https://leetcode.cn/problems/sum-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 56 Problem 3"}, {"ID": 1928, "Title": "Minimum Cost to Reach Destination in Time", "TitleCn": "\u89c4\u5b9a\u65f6\u95f4\u5185\u5230\u8fbe\u7ec8\u70b9\u7684\u6700\u5c0f\u82b1\u8d39", "Url": "https://leetcode.cn/problems/minimum-cost-to-reach-destination-in-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 56 Problem 4"}, {"ID": 1929, "Title": "Concatenation of Array", "TitleCn": "\u6570\u7ec4\u4e32\u8054", "Url": "https://leetcode.cn/problems/concatenation-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 249 Problem 1"}, {"ID": 1930, "Title": "Unique Length-3 Palindromic Subsequences", "TitleCn": "\u957f\u5ea6\u4e3a 3 \u7684\u4e0d\u540c\u56de\u6587\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/unique-length-3-palindromic-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 249 Problem 2"}, {"ID": 1931, "Title": "Painting a Grid With Three Different Colors", "TitleCn": "\u7528\u4e09\u79cd\u4e0d\u540c\u989c\u8272\u4e3a\u7f51\u683c\u6d82\u8272", "Url": "https://leetcode.cn/problems/painting-a-grid-with-three-different-colors/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 249 Problem 3"}, {"ID": 1932, "Title": "Merge BSTs to Create Single BST", "TitleCn": "\u5408\u5e76\u591a\u68f5\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/merge-bsts-to-create-single-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 249 Problem 4"}, {"ID": 1933, "Title": "Check if String Is Decomposable Into Value-Equal Substrings", "TitleCn": "\u5224\u65ad\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u5206\u89e3\u4e3a\u503c\u5747\u7b49\u7684\u5b50\u4e32", "Url": "https://leetcode.cn/problems/check-if-string-is-decomposable-into-value-equal-substrings/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1934, "Title": "Confirmation Rate", "TitleCn": "\u786e\u8ba4\u7387", "Url": "https://leetcode.cn/problems/confirmation-rate/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1935, "Title": "Maximum Number of Words You Can Type", "TitleCn": "\u53ef\u4ee5\u8f93\u5165\u7684\u6700\u5927\u5355\u8bcd\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-words-you-can-type/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 250 Problem 1"}, {"ID": 1936, "Title": "Add Minimum Number of Rungs", "TitleCn": "\u65b0\u589e\u7684\u6700\u5c11\u53f0\u9636\u6570", "Url": "https://leetcode.cn/problems/add-minimum-number-of-rungs/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 250 Problem 2"}, {"ID": 1937, "Title": "Maximum Number of Points with Cost", "TitleCn": "\u6263\u5206\u540e\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-number-of-points-with-cost/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 250 Problem 3"}, {"ID": 1938, "Title": "Maximum Genetic Difference Query", "TitleCn": "\u67e5\u8be2\u6700\u5927\u57fa\u56e0\u5dee", "Url": "https://leetcode.cn/problems/maximum-genetic-difference-query/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 250 Problem 4"}, {"ID": 1939, "Title": "Users That Actively Request Confirmation Messages", "TitleCn": "\u4e3b\u52a8\u8bf7\u6c42\u786e\u8ba4\u6d88\u606f\u7684\u7528\u6237", "Url": "https://leetcode.cn/problems/users-that-actively-request-confirmation-messages/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1940, "Title": "Longest Common Subsequence Between Sorted Arrays", "TitleCn": "\u6392\u5e8f\u6570\u7ec4\u4e4b\u95f4\u7684\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-common-subsequence-between-sorted-arrays", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1941, "Title": "Check if All Characters Have Equal Number of Occurrences", "TitleCn": "\u68c0\u67e5\u662f\u5426\u6240\u6709\u5b57\u7b26\u51fa\u73b0\u6b21\u6570\u76f8\u540c", "Url": "https://leetcode.cn/problems/check-if-all-characters-have-equal-number-of-occurrences/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 57 Problem 1"}, {"ID": 1942, "Title": "The Number of the Smallest Unoccupied Chair", "TitleCn": "\u6700\u5c0f\u672a\u88ab\u5360\u636e\u6905\u5b50\u7684\u7f16\u53f7", "Url": "https://leetcode.cn/problems/the-number-of-the-smallest-unoccupied-chair/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 57 Problem 2"}, {"ID": 1943, "Title": "Describe the Painting", "TitleCn": "\u63cf\u8ff0\u7ed8\u753b\u7ed3\u679c", "Url": "https://leetcode.cn/problems/describe-the-painting/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 57 Problem 3"}, {"ID": 1944, "Title": "Number of Visible People in a Queue", "TitleCn": "\u961f\u5217\u4e2d\u53ef\u4ee5\u770b\u5230\u7684\u4eba\u6570", "Url": "https://leetcode.cn/problems/number-of-visible-people-in-a-queue/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 57 Problem 4"}, {"ID": 1945, "Title": "Sum of Digits of String After Convert", "TitleCn": "\u5b57\u7b26\u4e32\u8f6c\u5316\u540e\u7684\u5404\u4f4d\u6570\u5b57\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-digits-of-string-after-convert/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 251 Problem 1"}, {"ID": 1946, "Title": "Largest Number After Mutating Substring", "TitleCn": "\u5b50\u5b57\u7b26\u4e32\u7a81\u53d8\u540e\u53ef\u80fd\u5f97\u5230\u7684\u6700\u5927\u6574\u6570", "Url": "https://leetcode.cn/problems/largest-number-after-mutating-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 251 Problem 2"}, {"ID": 1947, "Title": "Maximum Compatibility Score Sum", "TitleCn": "\u6700\u5927\u517c\u5bb9\u6027\u8bc4\u5206\u548c", "Url": "https://leetcode.cn/problems/maximum-compatibility-score-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 251 Problem 3"}, {"ID": 1948, "Title": "Delete Duplicate Folders in System", "TitleCn": "\u5220\u9664\u7cfb\u7edf\u4e2d\u7684\u91cd\u590d\u6587\u4ef6\u5939", "Url": "https://leetcode.cn/problems/delete-duplicate-folders-in-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 251 Problem 4"}, {"ID": 1949, "Title": "Strong Friendship", "TitleCn": "\u575a\u5b9a\u7684\u53cb\u8c0a", "Url": "https://leetcode.cn/problems/strong-friendship/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1950, "Title": "Maximum of Minimum Values in All Subarrays", "TitleCn": "\u6240\u6709\u5b50\u6570\u7ec4\u6700\u5c0f\u503c\u4e2d\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/maximum-of-minimum-values-in-all-subarrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1951, "Title": "All the Pairs With the Maximum Number of Common Followers", "TitleCn": "\u67e5\u8be2\u5177\u6709\u6700\u591a\u5171\u540c\u5173\u6ce8\u8005\u7684\u6240\u6709\u4e24\u4e24\u7ed3\u5bf9\u7ec4", "Url": "https://leetcode.cn/problems/all-the-pairs-with-the-maximum-number-of-common-followers/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1952, "Title": "Three Divisors", "TitleCn": "\u4e09\u9664\u6570", "Url": "https://leetcode.cn/problems/three-divisors/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 252 Problem 1"}, {"ID": 1953, "Title": "Maximum Number of Weeks for Which You Can Work", "TitleCn": "\u4f60\u53ef\u4ee5\u5de5\u4f5c\u7684\u6700\u5927\u5468\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-weeks-for-which-you-can-work/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 252 Problem 2"}, {"ID": 1954, "Title": "Minimum Garden Perimeter to Collect Enough Apples", "TitleCn": "\u6536\u96c6\u8db3\u591f\u82f9\u679c\u7684\u6700\u5c0f\u82b1\u56ed\u5468\u957f", "Url": "https://leetcode.cn/problems/minimum-garden-perimeter-to-collect-enough-apples/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 252 Problem 3"}, {"ID": 1955, "Title": "Count Number of Special Subsequences", "TitleCn": "\u7edf\u8ba1\u7279\u6b8a\u5b50\u5e8f\u5217\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-special-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 252 Problem 4"}, {"ID": 1956, "Title": "Minimum Time For K Virus Variants to Spread", "TitleCn": "\u611f\u67d3 K \u79cd\u75c5\u6bd2\u6240\u9700\u7684\u6700\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-for-k-virus-variants-to-spread/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1957, "Title": "Delete Characters to Make Fancy String", "TitleCn": "\u5220\u9664\u5b57\u7b26\u4f7f\u5b57\u7b26\u4e32\u53d8\u597d", "Url": "https://leetcode.cn/problems/delete-characters-to-make-fancy-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 58 Problem 1"}, {"ID": 1958, "Title": "Check if Move is Legal", "TitleCn": "\u68c0\u67e5\u64cd\u4f5c\u662f\u5426\u5408\u6cd5", "Url": "https://leetcode.cn/problems/check-if-move-is-legal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 58 Problem 2"}, {"ID": 1959, "Title": "Minimum Total Space Wasted With K Resizing Operations", "TitleCn": "K \u6b21\u8c03\u6574\u6570\u7ec4\u5927\u5c0f\u6d6a\u8d39\u7684\u6700\u5c0f\u603b\u7a7a\u95f4", "Url": "https://leetcode.cn/problems/minimum-total-space-wasted-with-k-resizing-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 58 Problem 3"}, {"ID": 1960, "Title": "Maximum Product of the Length of Two Palindromic Substrings", "TitleCn": "\u4e24\u4e2a\u56de\u6587\u5b50\u5b57\u7b26\u4e32\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-product-of-the-length-of-two-palindromic-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 58 Problem 4"}, {"ID": 1961, "Title": "Check If String Is a Prefix of Array", "TitleCn": "\u68c0\u67e5\u5b57\u7b26\u4e32\u662f\u5426\u4e3a\u6570\u7ec4\u524d\u7f00", "Url": "https://leetcode.cn/problems/check-if-string-is-a-prefix-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 253 Problem 1"}, {"ID": 1962, "Title": "Remove Stones to Minimize the Total", "TitleCn": "\u79fb\u9664\u77f3\u5b50\u4f7f\u603b\u6570\u6700\u5c0f", "Url": "https://leetcode.cn/problems/remove-stones-to-minimize-the-total/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 253 Problem 2"}, {"ID": 1963, "Title": "Minimum Number of Swaps to Make the String Balanced", "TitleCn": "\u4f7f\u5b57\u7b26\u4e32\u5e73\u8861\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-swaps-to-make-the-string-balanced/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 253 Problem 3"}, {"ID": 1964, "Title": "Find the Longest Valid Obstacle Course at Each Position", "TitleCn": "\u627e\u51fa\u5230\u6bcf\u4e2a\u4f4d\u7f6e\u4e3a\u6b62\u6700\u957f\u7684\u6709\u6548\u969c\u788d\u8d5b\u8dd1\u8def\u7ebf", "Url": "https://leetcode.cn/problems/find-the-longest-valid-obstacle-course-at-each-position/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 253 Problem 4"}, {"ID": 1965, "Title": "Employees With Missing Information", "TitleCn": "\u4e22\u5931\u4fe1\u606f\u7684\u96c7\u5458", "Url": "https://leetcode.cn/problems/employees-with-missing-information/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1966, "Title": "Binary Searchable Numbers in an Unsorted Array", "TitleCn": "\u672a\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u53ef\u88ab\u4e8c\u5206\u641c\u7d22\u7684\u6570", "Url": "https://leetcode.cn/problems/binary-searchable-numbers-in-an-unsorted-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1967, "Title": "Number of Strings That Appear as Substrings in Word", "TitleCn": "\u4f5c\u4e3a\u5b50\u5b57\u7b26\u4e32\u51fa\u73b0\u5728\u5355\u8bcd\u4e2d\u7684\u5b57\u7b26\u4e32\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-strings-that-appear-as-substrings-in-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 254 Problem 1"}, {"ID": 1968, "Title": "Array With Elements Not Equal to Average of Neighbors", "TitleCn": "\u6784\u9020\u5143\u7d20\u4e0d\u7b49\u4e8e\u4e24\u76f8\u90bb\u5143\u7d20\u5e73\u5747\u503c\u7684\u6570\u7ec4", "Url": "https://leetcode.cn/problems/array-with-elements-not-equal-to-average-of-neighbors/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 254 Problem 2"}, {"ID": 1969, "Title": "Minimum Non-Zero Product of the Array Elements", "TitleCn": "\u6570\u7ec4\u5143\u7d20\u7684\u6700\u5c0f\u975e\u96f6\u4e58\u79ef", "Url": "https://leetcode.cn/problems/minimum-non-zero-product-of-the-array-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 254 Problem 3"}, {"ID": 1970, "Title": "Last Day Where You Can Still Cross", "TitleCn": "\u4f60\u80fd\u7a7f\u8fc7\u77e9\u9635\u7684\u6700\u540e\u4e00\u5929", "Url": "https://leetcode.cn/problems/last-day-where-you-can-still-cross/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 254 Problem 4"}, {"ID": 1971, "Title": "Find if Path Exists in Graph", "TitleCn": "\u5bfb\u627e\u56fe\u4e2d\u662f\u5426\u5b58\u5728\u8def\u5f84", "Url": "https://leetcode.cn/problems/find-if-path-exists-in-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1972, "Title": "First and Last Call On the Same Day", "TitleCn": "\u540c\u4e00\u5929\u7684\u7b2c\u4e00\u4e2a\u7535\u8bdd\u548c\u6700\u540e\u4e00\u4e2a\u7535\u8bdd", "Url": "https://leetcode.cn/problems/first-and-last-call-on-the-same-day/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1973, "Title": "Count Nodes Equal to Sum of Descendants", "TitleCn": "\u503c\u7b49\u4e8e\u5b50\u8282\u70b9\u503c\u4e4b\u548c\u7684\u8282\u70b9\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-nodes-equal-to-sum-of-descendants/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1974, "Title": "Minimum Time to Type Word Using Special Typewriter", "TitleCn": "\u4f7f\u7528\u7279\u6b8a\u6253\u5b57\u673a\u952e\u5165\u5355\u8bcd\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-type-word-using-special-typewriter/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 59 Problem 1"}, {"ID": 1975, "Title": "Maximum Matrix Sum", "TitleCn": "\u6700\u5927\u65b9\u9635\u548c", "Url": "https://leetcode.cn/problems/maximum-matrix-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 59 Problem 2"}, {"ID": 1976, "Title": "Number of Ways to Arrive at Destination", "TitleCn": "\u5230\u8fbe\u76ee\u7684\u5730\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-arrive-at-destination/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 59 Problem 3"}, {"ID": 1977, "Title": "Number of Ways to Separate Numbers", "TitleCn": "\u5212\u5206\u6570\u5b57\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-separate-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 59 Problem 4"}, {"ID": 1978, "Title": "Employees Whose Manager Left the Company", "TitleCn": "\u4e0a\u7ea7\u7ecf\u7406\u5df2\u79bb\u804c\u7684\u516c\u53f8\u5458\u5de5", "Url": "https://leetcode.cn/problems/employees-whose-manager-left-the-company/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1979, "Title": "Find Greatest Common Divisor of Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u7684\u6700\u5927\u516c\u7ea6\u6570", "Url": "https://leetcode.cn/problems/find-greatest-common-divisor-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 255 Problem 1"}, {"ID": 1980, "Title": "Find Unique Binary String", "TitleCn": "\u627e\u51fa\u4e0d\u540c\u7684\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-unique-binary-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 255 Problem 2"}, {"ID": 1981, "Title": "Minimize the Difference Between Target and Chosen Elements", "TitleCn": "\u6700\u5c0f\u5316\u76ee\u6807\u503c\u4e0e\u6240\u9009\u5143\u7d20\u7684\u5dee", "Url": "https://leetcode.cn/problems/minimize-the-difference-between-target-and-chosen-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 255 Problem 3"}, {"ID": 1982, "Title": "Find Array Given Subset Sums", "TitleCn": "\u4ece\u5b50\u96c6\u7684\u548c\u8fd8\u539f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-array-given-subset-sums/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 255 Problem 4"}, {"ID": 1983, "Title": "Widest Pair of Indices With Equal Range Sum", "TitleCn": "\u8303\u56f4\u548c\u76f8\u7b49\u7684\u6700\u5bbd\u7d22\u5f15\u5bf9", "Url": "https://leetcode.cn/problems/widest-pair-of-indices-with-equal-range-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1984, "Title": "Minimum Difference Between Highest and Lowest of K Scores", "TitleCn": "\u5b66\u751f\u5206\u6570\u7684\u6700\u5c0f\u5dee\u503c", "Url": "https://leetcode.cn/problems/minimum-difference-between-highest-and-lowest-of-k-scores/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 256 Problem 1"}, {"ID": 1985, "Title": "Find the Kth Largest Integer in the Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u7b2c K \u5927\u6574\u6570", "Url": "https://leetcode.cn/problems/find-the-kth-largest-integer-in-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 256 Problem 2"}, {"ID": 1986, "Title": "Minimum Number of Work Sessions to Finish the Tasks", "TitleCn": "\u5b8c\u6210\u4efb\u52a1\u7684\u6700\u5c11\u5de5\u4f5c\u65f6\u95f4\u6bb5", "Url": "https://leetcode.cn/problems/minimum-number-of-work-sessions-to-finish-the-tasks/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 256 Problem 3"}, {"ID": 1987, "Title": "Number of Unique Good Subsequences", "TitleCn": "\u4e0d\u540c\u7684\u597d\u5b50\u5e8f\u5217\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-unique-good-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 256 Problem 4"}, {"ID": 1988, "Title": "Find Cutoff Score for Each School", "TitleCn": "\u627e\u51fa\u6bcf\u6240\u5b66\u6821\u7684\u6700\u4f4e\u5206\u6570\u8981\u6c42", "Url": "https://leetcode.cn/problems/find-cutoff-score-for-each-school/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1989, "Title": "Maximum Number of People That Can Be Caught in Tag", "TitleCn": "\u6349\u8ff7\u85cf\u4e2d\u53ef\u6355\u83b7\u7684\u6700\u5927\u4eba\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-people-that-can-be-caught-in-tag/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1990, "Title": "Count the Number of Experiments", "TitleCn": "\u7edf\u8ba1\u5b9e\u9a8c\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-the-number-of-experiments/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1991, "Title": "Find the Middle Index in Array", "TitleCn": "\u627e\u5230\u6570\u7ec4\u7684\u4e2d\u95f4\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/find-the-middle-index-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 60 Problem 1"}, {"ID": 1992, "Title": "Find All Groups of Farmland", "TitleCn": "\u627e\u5230\u6240\u6709\u7684\u519c\u573a\u7ec4", "Url": "https://leetcode.cn/problems/find-all-groups-of-farmland/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 60 Problem 2"}, {"ID": 1993, "Title": "Operations on Tree", "TitleCn": "\u6811\u4e0a\u7684\u64cd\u4f5c", "Url": "https://leetcode.cn/problems/operations-on-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 60 Problem 3"}, {"ID": 1994, "Title": "The Number of Good Subsets", "TitleCn": "\u597d\u5b50\u96c6\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/the-number-of-good-subsets/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 60 Problem 4"}, {"ID": 1995, "Title": "Count Special Quadruplets", "TitleCn": "\u7edf\u8ba1\u7279\u6b8a\u56db\u5143\u7ec4", "Url": "https://leetcode.cn/problems/count-special-quadruplets/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 257 Problem 1"}, {"ID": 1996, "Title": "The Number of Weak Characters in the Game", "TitleCn": "\u6e38\u620f\u4e2d\u5f31\u89d2\u8272\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/the-number-of-weak-characters-in-the-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 257 Problem 2"}, {"ID": 1997, "Title": "First Day Where You Have Been in All the Rooms", "TitleCn": "\u8bbf\u95ee\u5b8c\u6240\u6709\u623f\u95f4\u7684\u7b2c\u4e00\u5929", "Url": "https://leetcode.cn/problems/first-day-where-you-have-been-in-all-the-rooms/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 257 Problem 3"}, {"ID": 1998, "Title": "GCD Sort of an Array", "TitleCn": "\u6570\u7ec4\u7684\u6700\u5927\u516c\u56e0\u6570\u6392\u5e8f", "Url": "https://leetcode.cn/problems/gcd-sort-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 257 Problem 4"}, {"ID": 1999, "Title": "Smallest Greater Multiple Made of Two Digits", "TitleCn": "\u6700\u5c0f\u7684\u4ec5\u7531\u4e24\u4e2a\u6570\u7ec4\u6210\u7684\u500d\u6570", "Url": "https://leetcode.cn/problems/smallest-greater-multiple-made-of-two-digits/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2000, "Title": "Reverse Prefix of Word", "TitleCn": "\u53cd\u8f6c\u5355\u8bcd\u524d\u7f00", "Url": "https://leetcode.cn/problems/reverse-prefix-of-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 258 Problem 1"}, {"ID": 2001, "Title": "Number of Pairs of Interchangeable Rectangles", "TitleCn": "\u53ef\u4e92\u6362\u77e9\u5f62\u7684\u7ec4\u6570", "Url": "https://leetcode.cn/problems/number-of-pairs-of-interchangeable-rectangles/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 258 Problem 2"}, {"ID": 2002, "Title": "Maximum Product of the Length of Two Palindromic Subsequences", "TitleCn": "\u4e24\u4e2a\u56de\u6587\u5b50\u5e8f\u5217\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-product-of-the-length-of-two-palindromic-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 258 Problem 3"}, {"ID": 2003, "Title": "Smallest Missing Genetic Value in Each Subtree", "TitleCn": "\u6bcf\u68f5\u5b50\u6811\u5185\u7f3a\u5931\u7684\u6700\u5c0f\u57fa\u56e0\u503c", "Url": "https://leetcode.cn/problems/smallest-missing-genetic-value-in-each-subtree/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 258 Problem 4"}, {"ID": 2004, "Title": "The Number of Seniors and Juniors to Join the Company", "TitleCn": "\u804c\u5458\u62db\u8058\u4eba\u6570", "Url": "https://leetcode.cn/problems/the-number-of-seniors-and-juniors-to-join-the-company/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2005, "Title": "Subtree Removal Game with Fibonacci Tree", "TitleCn": "\u6590\u6ce2\u90a3\u5951\u6811\u7684\u79fb\u9664\u5b50\u6811\u6e38\u620f", "Url": "https://leetcode.cn/problems/subtree-removal-game-with-fibonacci-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2006, "Title": "Count Number of Pairs With Absolute Difference K", "TitleCn": "\u5dee\u7684\u7edd\u5bf9\u503c\u4e3a K \u7684\u6570\u5bf9\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-pairs-with-absolute-difference-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 61 Problem 1"}, {"ID": 2007, "Title": "Find Original Array From Doubled Array", "TitleCn": "\u4ece\u53cc\u500d\u6570\u7ec4\u4e2d\u8fd8\u539f\u539f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-original-array-from-doubled-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 61 Problem 2"}, {"ID": 2008, "Title": "Maximum Earnings From Taxi", "TitleCn": "\u51fa\u79df\u8f66\u7684\u6700\u5927\u76c8\u5229", "Url": "https://leetcode.cn/problems/maximum-earnings-from-taxi/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 61 Problem 3"}, {"ID": 2009, "Title": "Minimum Number of Operations to Make Array Continuous", "TitleCn": "\u4f7f\u6570\u7ec4\u8fde\u7eed\u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-array-continuous/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 61 Problem 4"}, {"ID": 2010, "Title": "The Number of Seniors and Juniors to Join the Company II", "TitleCn": "\u804c\u5458\u62db\u8058\u4eba\u6570 II", "Url": "https://leetcode.cn/problems/the-number-of-seniors-and-juniors-to-join-the-company-ii/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2011, "Title": "Final Value of Variable After Performing Operations", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u540e\u7684\u53d8\u91cf\u503c", "Url": "https://leetcode.cn/problems/final-value-of-variable-after-performing-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 259 Problem 1"}, {"ID": 2012, "Title": "Sum of Beauty in the Array", "TitleCn": "\u6570\u7ec4\u7f8e\u4e3d\u503c\u6c42\u548c", "Url": "https://leetcode.cn/problems/sum-of-beauty-in-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 259 Problem 2"}, {"ID": 2013, "Title": "Detect Squares", "TitleCn": "\u68c0\u6d4b\u6b63\u65b9\u5f62", "Url": "https://leetcode.cn/problems/detect-squares/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 259 Problem 3"}, {"ID": 2014, "Title": "Longest Subsequence Repeated k Times", "TitleCn": "\u91cd\u590d K \u6b21\u7684\u6700\u957f\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-subsequence-repeated-k-times/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 259 Problem 4"}, {"ID": 2015, "Title": "Average Height of Buildings in Each Segment", "TitleCn": "\u6bcf\u6bb5\u5efa\u7b51\u7269\u7684\u5e73\u5747\u9ad8\u5ea6", "Url": "https://leetcode.cn/problems/average-height-of-buildings-in-each-segment/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2016, "Title": "Maximum Difference Between Increasing Elements", "TitleCn": "\u589e\u91cf\u5143\u7d20\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c", "Url": "https://leetcode.cn/problems/maximum-difference-between-increasing-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 260 Problem 1"}, {"ID": 2017, "Title": "Grid Game", "TitleCn": "\u7f51\u683c\u6e38\u620f", "Url": "https://leetcode.cn/problems/grid-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 260 Problem 2"}, {"ID": 2018, "Title": "Check if Word Can Be Placed In Crossword", "TitleCn": "\u5224\u65ad\u5355\u8bcd\u662f\u5426\u80fd\u653e\u5165\u586b\u5b57\u6e38\u620f\u5185", "Url": "https://leetcode.cn/problems/check-if-word-can-be-placed-in-crossword/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 260 Problem 3"}, {"ID": 2019, "Title": "The Score of Students Solving Math Expression", "TitleCn": "\u89e3\u51fa\u6570\u5b66\u8868\u8fbe\u5f0f\u7684\u5b66\u751f\u5206\u6570", "Url": "https://leetcode.cn/problems/the-score-of-students-solving-math-expression/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 260 Problem 4"}, {"ID": 2020, "Title": "Number of Accounts That Did Not Stream", "TitleCn": "\u65e0\u6d41\u91cf\u7684\u5e10\u6237\u6570", "Url": "https://leetcode.cn/problems/number-of-accounts-that-did-not-stream/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2021, "Title": "Brightest Position on Street", "TitleCn": "\u8857\u4e0a\u6700\u4eae\u7684\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/brightest-position-on-street/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2022, "Title": "Convert 1D Array Into 2D Array", "TitleCn": "\u5c06\u4e00\u7ef4\u6570\u7ec4\u8f6c\u53d8\u6210\u4e8c\u7ef4\u6570\u7ec4", "Url": "https://leetcode.cn/problems/convert-1d-array-into-2d-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 62 Problem 1"}, {"ID": 2023, "Title": "Number of Pairs of Strings With Concatenation Equal to Target", "TitleCn": "\u8fde\u63a5\u540e\u7b49\u4e8e\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u5b57\u7b26\u4e32\u5bf9", "Url": "https://leetcode.cn/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 62 Problem 2"}, {"ID": 2024, "Title": "Maximize the Confusion of an Exam", "TitleCn": "\u8003\u8bd5\u7684\u6700\u5927\u56f0\u6270\u5ea6", "Url": "https://leetcode.cn/problems/maximize-the-confusion-of-an-exam/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 62 Problem 3"}, {"ID": 2025, "Title": "Maximum Number of Ways to Partition an Array", "TitleCn": "\u5206\u5272\u6570\u7ec4\u7684\u6700\u591a\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-ways-to-partition-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 62 Problem 4"}, {"ID": 2026, "Title": "Low-Quality Problems", "TitleCn": "\u4f4e\u8d28\u91cf\u7684\u95ee\u9898", "Url": "https://leetcode.cn/problems/low-quality-problems/", "Ispaid": 1, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2027, "Title": "Minimum Moves to Convert String", "TitleCn": "\u8f6c\u6362\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-moves-to-convert-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 261 Problem 1"}, {"ID": 2028, "Title": "Find Missing Observations", "TitleCn": "\u627e\u51fa\u7f3a\u5931\u7684\u89c2\u6d4b\u6570\u636e", "Url": "https://leetcode.cn/problems/find-missing-observations/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 261 Problem 2"}, {"ID": 2029, "Title": "Stone Game IX", "TitleCn": "\u77f3\u5b50\u6e38\u620f IX", "Url": "https://leetcode.cn/problems/stone-game-ix/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 261 Problem 3"}, {"ID": 2030, "Title": "Smallest K-Length Subsequence With Occurrences of a Letter", "TitleCn": "\u542b\u7279\u5b9a\u5b57\u6bcd\u7684\u6700\u5c0f\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/smallest-k-length-subsequence-with-occurrences-of-a-letter/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 261 Problem 4"}, {"ID": 2031, "Title": "Count Subarrays With More Ones Than Zeros", "TitleCn": "1 \u6bd4 0 \u591a\u7684\u5b50\u6570\u7ec4\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-subarrays-with-more-ones-than-zeros/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2032, "Title": "Two Out of Three", "TitleCn": "\u81f3\u5c11\u5728\u4e24\u4e2a\u6570\u7ec4\u4e2d\u51fa\u73b0\u7684\u503c", "Url": "https://leetcode.cn/problems/two-out-of-three/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 262 Problem 1"}, {"ID": 2033, "Title": "Minimum Operations to Make a Uni-Value Grid", "TitleCn": "\u83b7\u53d6\u5355\u503c\u7f51\u683c\u7684\u6700\u5c0f\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-a-uni-value-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 262 Problem 2"}, {"ID": 2034, "Title": "Stock Price Fluctuation", "TitleCn": "\u80a1\u7968\u4ef7\u683c\u6ce2\u52a8", "Url": "https://leetcode.cn/problems/stock-price-fluctuation/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 262 Problem 3"}, {"ID": 2035, "Title": "Partition Array Into Two Arrays to Minimize Sum Difference", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u6210\u4e24\u4e2a\u6570\u7ec4\u5e76\u6700\u5c0f\u5316\u6570\u7ec4\u548c\u7684\u5dee", "Url": "https://leetcode.cn/problems/partition-array-into-two-arrays-to-minimize-sum-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 262 Problem 4"}, {"ID": 2036, "Title": "Maximum Alternating Subarray Sum", "TitleCn": "\u6700\u5927\u4ea4\u66ff\u5b50\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/maximum-alternating-subarray-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2037, "Title": "Minimum Number of Moves to Seat Everyone", "TitleCn": "\u4f7f\u6bcf\u4f4d\u5b66\u751f\u90fd\u6709\u5ea7\u4f4d\u7684\u6700\u5c11\u79fb\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-moves-to-seat-everyone/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 63 Problem 1"}, {"ID": 2038, "Title": "Remove Colored Pieces if Both Neighbors are the Same Color", "TitleCn": "\u5982\u679c\u76f8\u90bb\u4e24\u4e2a\u989c\u8272\u5747\u76f8\u540c\u5219\u5220\u9664\u5f53\u524d\u989c\u8272", "Url": "https://leetcode.cn/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 63 Problem 2"}, {"ID": 2039, "Title": "The Time When the Network Becomes Idle", "TitleCn": "\u7f51\u7edc\u7a7a\u95f2\u7684\u65f6\u523b", "Url": "https://leetcode.cn/problems/the-time-when-the-network-becomes-idle/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 63 Problem 3"}, {"ID": 2040, "Title": "Kth Smallest Product of Two Sorted Arrays", "TitleCn": "\u4e24\u4e2a\u6709\u5e8f\u6570\u7ec4\u7684\u7b2c K \u5c0f\u4e58\u79ef", "Url": "https://leetcode.cn/problems/kth-smallest-product-of-two-sorted-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 63 Problem 4"}, {"ID": 2041, "Title": "Accepted Candidates From the Interviews", "TitleCn": "\u9762\u8bd5\u4e2d\u88ab\u5f55\u53d6\u7684\u5019\u9009\u4eba", "Url": "https://leetcode.cn/problems/accepted-candidates-from-the-interviews/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2042, "Title": "Check if Numbers Are Ascending in a Sentence", "TitleCn": "\u68c0\u67e5\u53e5\u5b50\u4e2d\u7684\u6570\u5b57\u662f\u5426\u9012\u589e", "Url": "https://leetcode.cn/problems/check-if-numbers-are-ascending-in-a-sentence/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 263 Problem 1"}, {"ID": 2043, "Title": "Simple Bank System", "TitleCn": "\u7b80\u6613\u94f6\u884c\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/simple-bank-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 263 Problem 2"}, {"ID": 2044, "Title": "Count Number of Maximum Bitwise-OR Subsets", "TitleCn": "\u7edf\u8ba1\u6309\u4f4d\u6216\u80fd\u5f97\u5230\u6700\u5927\u503c\u7684\u5b50\u96c6\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-maximum-bitwise-or-subsets/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 263 Problem 3"}, {"ID": 2045, "Title": "Second Minimum Time to Reach Destination", "TitleCn": "\u5230\u8fbe\u76ee\u7684\u5730\u7684\u7b2c\u4e8c\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/second-minimum-time-to-reach-destination/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 263 Problem 4"}, {"ID": 2046, "Title": "Sort Linked List Already Sorted Using Absolute Values", "TitleCn": "\u7ed9\u6309\u7167\u7edd\u5bf9\u503c\u6392\u5e8f\u7684\u94fe\u8868\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-linked-list-already-sorted-using-absolute-values/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2047, "Title": "Number of Valid Words in a Sentence", "TitleCn": "\u53e5\u5b50\u4e2d\u7684\u6709\u6548\u5355\u8bcd\u6570", "Url": "https://leetcode.cn/problems/number-of-valid-words-in-a-sentence/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 264 Problem 1"}, {"ID": 2048, "Title": "Next Greater Numerically Balanced Number", "TitleCn": "\u4e0b\u4e00\u4e2a\u66f4\u5927\u7684\u6570\u503c\u5e73\u8861\u6570", "Url": "https://leetcode.cn/problems/next-greater-numerically-balanced-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 264 Problem 2"}, {"ID": 2049, "Title": "Count Nodes With the Highest Score", "TitleCn": "\u7edf\u8ba1\u6700\u9ad8\u5206\u7684\u8282\u70b9\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-nodes-with-the-highest-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 264 Problem 3"}, {"ID": 2050, "Title": "Parallel Courses III", "TitleCn": "\u5e76\u884c\u8bfe\u7a0b III", "Url": "https://leetcode.cn/problems/parallel-courses-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 264 Problem 4"}, {"ID": 2051, "Title": "The Category of Each Member in the Store", "TitleCn": "\u5546\u5e97\u4e2d\u6bcf\u4e2a\u6210\u5458\u7684\u7ea7\u522b", "Url": "https://leetcode.cn/problems/the-category-of-each-member-in-the-store/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2052, "Title": "Minimum Cost to Separate Sentence Into Rows", "TitleCn": "\u5c06\u53e5\u5b50\u5206\u9694\u6210\u884c\u7684\u6700\u4f4e\u6210\u672c", "Url": "https://leetcode.cn/problems/minimum-cost-to-separate-sentence-into-rows/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2053, "Title": "Kth Distinct String in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7b2c K \u4e2a\u72ec\u4e00\u65e0\u4e8c\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/kth-distinct-string-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 64 Problem 1"}, {"ID": 2054, "Title": "Two Best Non-Overlapping Events", "TitleCn": "\u4e24\u4e2a\u6700\u597d\u7684\u4e0d\u91cd\u53e0\u6d3b\u52a8", "Url": "https://leetcode.cn/problems/two-best-non-overlapping-events/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 64 Problem 2"}, {"ID": 2055, "Title": "Plates Between Candles", "TitleCn": "\u8721\u70db\u4e4b\u95f4\u7684\u76d8\u5b50", "Url": "https://leetcode.cn/problems/plates-between-candles/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 64 Problem 3"}, {"ID": 2056, "Title": "Number of Valid Move Combinations On Chessboard", "TitleCn": "\u68cb\u76d8\u4e0a\u6709\u6548\u79fb\u52a8\u7ec4\u5408\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-valid-move-combinations-on-chessboard/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 64 Problem 4"}, {"ID": 2057, "Title": "Smallest Index With Equal Value", "TitleCn": "\u503c\u76f8\u7b49\u7684\u6700\u5c0f\u7d22\u5f15", "Url": "https://leetcode.cn/problems/smallest-index-with-equal-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 265 Problem 1"}, {"ID": 2058, "Title": "Find the Minimum and Maximum Number of Nodes Between Critical Points", "TitleCn": "\u627e\u51fa\u4e34\u754c\u70b9\u4e4b\u95f4\u7684\u6700\u5c0f\u548c\u6700\u5927\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 265 Problem 2"}, {"ID": 2059, "Title": "Minimum Operations to Convert Number", "TitleCn": "\u8f6c\u5316\u6570\u5b57\u7684\u6700\u5c0f\u8fd0\u7b97\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-convert-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 265 Problem 3"}, {"ID": 2060, "Title": "Check if an Original String Exists Given Two Encoded Strings", "TitleCn": "\u540c\u6e90\u5b57\u7b26\u4e32\u68c0\u6d4b", "Url": "https://leetcode.cn/problems/check-if-an-original-string-exists-given-two-encoded-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 265 Problem 4"}, {"ID": 2061, "Title": "Number of Spaces Cleaning Robot Cleaned", "TitleCn": "\u626b\u5730\u673a\u5668\u4eba\u6e05\u626b\u8fc7\u7684\u7a7a\u95f4\u4e2a\u6570", "Url": "https://leetcode.cn/problems/number-of-spaces-cleaning-robot-cleaned/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2062, "Title": "Count Vowel Substrings of a String", "TitleCn": "\u7edf\u8ba1\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/count-vowel-substrings-of-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 266 Problem 1"}, {"ID": 2063, "Title": "Vowels of All Substrings", "TitleCn": "\u6240\u6709\u5b50\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3", "Url": "https://leetcode.cn/problems/vowels-of-all-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 266 Problem 2"}, {"ID": 2064, "Title": "Minimized Maximum of Products Distributed to Any Store", "TitleCn": "\u5206\u914d\u7ed9\u5546\u5e97\u7684\u6700\u591a\u5546\u54c1\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/minimized-maximum-of-products-distributed-to-any-store/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 266 Problem 3"}, {"ID": 2065, "Title": "Maximum Path Quality of a Graph", "TitleCn": "\u6700\u5927\u5316\u4e00\u5f20\u56fe\u4e2d\u7684\u8def\u5f84\u4ef7\u503c", "Url": "https://leetcode.cn/problems/maximum-path-quality-of-a-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 266 Problem 4"}, {"ID": 2066, "Title": "Account Balance", "TitleCn": "\u8d26\u6237\u4f59\u989d", "Url": "https://leetcode.cn/problems/account-balance/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2067, "Title": "Number of Equal Count Substrings", "TitleCn": "\u7b49\u8ba1\u6570\u5b50\u4e32\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-equal-count-substrings/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2068, "Title": "Check Whether Two Strings are Almost Equivalent", "TitleCn": "\u68c0\u67e5\u4e24\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u51e0\u4e4e\u76f8\u7b49", "Url": "https://leetcode.cn/problems/check-whether-two-strings-are-almost-equivalent/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 65 Problem 1"}, {"ID": 2069, "Title": "Walking Robot Simulation II", "TitleCn": "\u6a21\u62df\u884c\u8d70\u673a\u5668\u4eba II", "Url": "https://leetcode.cn/problems/walking-robot-simulation-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 65 Problem 2"}, {"ID": 2070, "Title": "Most Beautiful Item for Each Query", "TitleCn": "\u6bcf\u4e00\u4e2a\u67e5\u8be2\u7684\u6700\u5927\u7f8e\u4e3d\u503c", "Url": "https://leetcode.cn/problems/most-beautiful-item-for-each-query/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 65 Problem 3"}, {"ID": 2071, "Title": "Maximum Number of Tasks You Can Assign", "TitleCn": "\u4f60\u53ef\u4ee5\u5b89\u6392\u7684\u6700\u591a\u4efb\u52a1\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-tasks-you-can-assign/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 65 Problem 4"}, {"ID": 2072, "Title": "The Winner University", "TitleCn": "\u8d62\u5f97\u6bd4\u8d5b\u7684\u5927\u5b66", "Url": "https://leetcode.cn/problems/the-winner-university/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2073, "Title": "Time Needed to Buy Tickets", "TitleCn": "\u4e70\u7968\u9700\u8981\u7684\u65f6\u95f4", "Url": "https://leetcode.cn/problems/time-needed-to-buy-tickets/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 267 Problem 1"}, {"ID": 2074, "Title": "Reverse Nodes in Even Length Groups", "TitleCn": "\u53cd\u8f6c\u5076\u6570\u957f\u5ea6\u7ec4\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/reverse-nodes-in-even-length-groups/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 267 Problem 2"}, {"ID": 2075, "Title": "Decode the Slanted Ciphertext", "TitleCn": "\u89e3\u7801\u659c\u5411\u6362\u4f4d\u5bc6\u7801", "Url": "https://leetcode.cn/problems/decode-the-slanted-ciphertext/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 267 Problem 3"}, {"ID": 2076, "Title": "Process Restricted Friend Requests", "TitleCn": "\u5904\u7406\u542b\u9650\u5236\u6761\u4ef6\u7684\u597d\u53cb\u8bf7\u6c42", "Url": "https://leetcode.cn/problems/process-restricted-friend-requests/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 267 Problem 4"}, {"ID": 2077, "Title": "Paths in Maze That Lead to Same Room", "TitleCn": "\u6b8a\u9014\u540c\u5f52", "Url": "https://leetcode.cn/problems/paths-in-maze-that-lead-to-same-room/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2078, "Title": "Two Furthest Houses With Different Colors", "TitleCn": "\u4e24\u680b\u989c\u8272\u4e0d\u540c\u4e14\u8ddd\u79bb\u6700\u8fdc\u7684\u623f\u5b50", "Url": "https://leetcode.cn/problems/two-furthest-houses-with-different-colors/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 268 Problem 1"}, {"ID": 2079, "Title": "Watering Plants", "TitleCn": "\u7ed9\u690d\u7269\u6d47\u6c34", "Url": "https://leetcode.cn/problems/watering-plants/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 268 Problem 2"}, {"ID": 2080, "Title": "Range Frequency Queries", "TitleCn": "\u533a\u95f4\u5185\u67e5\u8be2\u6570\u5b57\u7684\u9891\u7387", "Url": "https://leetcode.cn/problems/range-frequency-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 268 Problem 3"}, {"ID": 2081, "Title": "Sum of k-Mirror Numbers", "TitleCn": "k \u955c\u50cf\u6570\u5b57\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-k-mirror-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 268 Problem 4"}, {"ID": 2082, "Title": "The Number of Rich Customers", "TitleCn": "\u5bcc\u6709\u5ba2\u6237\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/the-number-of-rich-customers/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2083, "Title": "Substrings That Begin and End With the Same Letter", "TitleCn": "\u6c42\u4ee5\u76f8\u540c\u5b57\u6bcd\u5f00\u5934\u548c\u7ed3\u5c3e\u7684\u5b50\u4e32\u603b\u6570", "Url": "https://leetcode.cn/problems/substrings-that-begin-and-end-with-the-same-letter/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2084, "Title": "Drop Type 1 Orders for Customers With Type 0 Orders", "TitleCn": "\u4e3a\u8ba2\u5355\u7c7b\u578b\u4e3a 0 \u7684\u5ba2\u6237\u5220\u9664\u7c7b\u578b\u4e3a 1 \u7684\u8ba2\u5355", "Url": "https://leetcode.cn/problems/drop-type-1-orders-for-customers-with-type-0-orders/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2085, "Title": "Count Common Words With One Occurrence", "TitleCn": "\u7edf\u8ba1\u51fa\u73b0\u8fc7\u4e00\u6b21\u7684\u516c\u5171\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/count-common-words-with-one-occurrence/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 66 Problem 1"}, {"ID": 2086, "Title": "Minimum Number of Food Buckets to Feed the Hamsters", "TitleCn": "\u5582\u98df\u4ed3\u9f20\u7684\u6700\u5c0f\u98df\u7269\u6876\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-food-buckets-to-feed-the-hamsters/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 66 Problem 2"}, {"ID": 2087, "Title": "Minimum Cost Homecoming of a Robot in a Grid", "TitleCn": "\u7f51\u683c\u56fe\u4e2d\u673a\u5668\u4eba\u56de\u5bb6\u7684\u6700\u5c0f\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-homecoming-of-a-robot-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 66 Problem 3"}, {"ID": 2088, "Title": "Count Fertile Pyramids in a Land", "TitleCn": "\u7edf\u8ba1\u519c\u573a\u4e2d\u80a5\u6c83\u91d1\u5b57\u5854\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-fertile-pyramids-in-a-land/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 66 Problem 4"}, {"ID": 2089, "Title": "Find Target Indices After Sorting Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u6392\u5e8f\u540e\u7684\u76ee\u6807\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-target-indices-after-sorting-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 269 Problem 1"}, {"ID": 2090, "Title": "K Radius Subarray Averages", "TitleCn": "\u534a\u5f84\u4e3a k \u7684\u5b50\u6570\u7ec4\u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/k-radius-subarray-averages/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 269 Problem 2"}, {"ID": 2091, "Title": "Removing Minimum and Maximum From Array", "TitleCn": "\u4ece\u6570\u7ec4\u4e2d\u79fb\u9664\u6700\u5927\u503c\u548c\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/removing-minimum-and-maximum-from-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 269 Problem 3"}, {"ID": 2092, "Title": "Find All People With Secret", "TitleCn": "\u627e\u51fa\u77e5\u6653\u79d8\u5bc6\u7684\u6240\u6709\u4e13\u5bb6", "Url": "https://leetcode.cn/problems/find-all-people-with-secret/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 269 Problem 4"}, {"ID": 2093, "Title": "Minimum Cost to Reach City With Discounts", "TitleCn": "\u524d\u5f80\u76ee\u6807\u57ce\u5e02\u7684\u6700\u5c0f\u8d39\u7528", "Url": "https://leetcode.cn/problems/minimum-cost-to-reach-city-with-discounts/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2094, "Title": "Finding 3-Digit Even Numbers", "TitleCn": "\u627e\u51fa 3 \u4f4d\u5076\u6570", "Url": "https://leetcode.cn/problems/finding-3-digit-even-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 270 Problem 1"}, {"ID": 2095, "Title": "Delete the Middle Node of a Linked List", "TitleCn": "\u5220\u9664\u94fe\u8868\u7684\u4e2d\u95f4\u8282\u70b9", "Url": "https://leetcode.cn/problems/delete-the-middle-node-of-a-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 270 Problem 2"}, {"ID": 2096, "Title": "Step-By-Step Directions From a Binary Tree Node to Another", "TitleCn": "\u4ece\u4e8c\u53c9\u6811\u4e00\u4e2a\u8282\u70b9\u5230\u53e6\u4e00\u4e2a\u8282\u70b9\u6bcf\u4e00\u6b65\u7684\u65b9\u5411", "Url": "https://leetcode.cn/problems/step-by-step-directions-from-a-binary-tree-node-to-another/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 270 Problem 3"}, {"ID": 2097, "Title": "Valid Arrangement of Pairs", "TitleCn": "\u5408\u6cd5\u91cd\u65b0\u6392\u5217\u6570\u5bf9", "Url": "https://leetcode.cn/problems/valid-arrangement-of-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 270 Problem 4"}, {"ID": 2098, "Title": "Subsequence of Size K With the Largest Even Sum", "TitleCn": "\u957f\u5ea6\u4e3a K \u7684\u6700\u5927\u5076\u6570\u548c\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/subsequence-of-size-k-with-the-largest-even-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2099, "Title": "Find Subsequence of Length K With the Largest Sum", "TitleCn": "\u627e\u5230\u548c\u6700\u5927\u7684\u957f\u5ea6\u4e3a K \u7684\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/find-subsequence-of-length-k-with-the-largest-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 67 Problem 1"}, {"ID": 2100, "Title": "Find Good Days to Rob the Bank", "TitleCn": "\u9002\u5408\u91ce\u708a\u7684\u65e5\u5b50", "Url": "https://leetcode.cn/problems/find-good-days-to-rob-the-bank/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 67 Problem 2"}, {"ID": 2101, "Title": "Detonate the Maximum Bombs", "TitleCn": "\u5f15\u7206\u6700\u591a\u7684\u70b8\u5f39", "Url": "https://leetcode.cn/problems/detonate-the-maximum-bombs/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 67 Problem 3"}, {"ID": 2102, "Title": "Sequentially Ordinal Rank Tracker", "TitleCn": "\u5e8f\u5217\u987a\u5e8f\u67e5\u8be2", "Url": "https://leetcode.cn/problems/sequentially-ordinal-rank-tracker/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 67 Problem 4"}, {"ID": 2103, "Title": "Rings and Rods", "TitleCn": "\u73af\u548c\u6746", "Url": "https://leetcode.cn/problems/rings-and-rods/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 271 Problem 1"}, {"ID": 2104, "Title": "Sum of Subarray Ranges", "TitleCn": "\u5b50\u6570\u7ec4\u8303\u56f4\u548c", "Url": "https://leetcode.cn/problems/sum-of-subarray-ranges/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 271 Problem 2"}, {"ID": 2105, "Title": "Watering Plants II", "TitleCn": "\u7ed9\u690d\u7269\u6d47\u6c34 II", "Url": "https://leetcode.cn/problems/watering-plants-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 271 Problem 3"}, {"ID": 2106, "Title": "Maximum Fruits Harvested After at Most K Steps", "TitleCn": "\u6458\u6c34\u679c", "Url": "https://leetcode.cn/problems/maximum-fruits-harvested-after-at-most-k-steps/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 271 Problem 4"}, {"ID": 2107, "Title": "Number of Unique Flavors After Sharing K Candies", "TitleCn": "\u5206\u4eab K \u4e2a\u7cd6\u679c\u540e\u72ec\u7279\u53e3\u5473\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-unique-flavors-after-sharing-k-candies/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2108, "Title": "Find First Palindromic String in the Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u7b2c\u4e00\u4e2a\u56de\u6587\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-first-palindromic-string-in-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 272 Problem 1"}, {"ID": 2109, "Title": "Adding Spaces to a String", "TitleCn": "\u5411\u5b57\u7b26\u4e32\u6dfb\u52a0\u7a7a\u683c", "Url": "https://leetcode.cn/problems/adding-spaces-to-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 272 Problem 2"}, {"ID": 2110, "Title": "Number of Smooth Descent Periods of a Stock", "TitleCn": "\u80a1\u7968\u5e73\u6ed1\u4e0b\u8dcc\u9636\u6bb5\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-smooth-descent-periods-of-a-stock/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 272 Problem 3"}, {"ID": 2111, "Title": "Minimum Operations to Make the Array K-Increasing", "TitleCn": "\u4f7f\u6570\u7ec4 K \u9012\u589e\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-the-array-k-increasing/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 272 Problem 4"}, {"ID": 2112, "Title": "The Airport With the Most Traffic", "TitleCn": "\u6700\u7e41\u5fd9\u7684\u673a\u573a", "Url": "https://leetcode.cn/problems/the-airport-with-the-most-traffic/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2113, "Title": "Elements in Array After Removing and Replacing Elements", "TitleCn": "\u67e5\u8be2\u5220\u9664\u548c\u6dfb\u52a0\u5143\u7d20\u540e\u7684\u6570\u7ec4", "Url": "https://leetcode.cn/problems/elements-in-array-after-removing-and-replacing-elements/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2114, "Title": "Maximum Number of Words Found in Sentences", "TitleCn": "\u53e5\u5b50\u4e2d\u7684\u6700\u591a\u5355\u8bcd\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-words-found-in-sentences/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 68 Problem 1"}, {"ID": 2115, "Title": "Find All Possible Recipes from Given Supplies", "TitleCn": "\u4ece\u7ed9\u5b9a\u539f\u6750\u6599\u4e2d\u627e\u5230\u6240\u6709\u53ef\u4ee5\u505a\u51fa\u7684\u83dc", "Url": "https://leetcode.cn/problems/find-all-possible-recipes-from-given-supplies/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 68 Problem 2"}, {"ID": 2116, "Title": "Check if a Parentheses String Can Be Valid", "TitleCn": "\u5224\u65ad\u4e00\u4e2a\u62ec\u53f7\u5b57\u7b26\u4e32\u662f\u5426\u6709\u6548", "Url": "https://leetcode.cn/problems/check-if-a-parentheses-string-can-be-valid/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 68 Problem 3"}, {"ID": 2117, "Title": "Abbreviating the Product of a Range", "TitleCn": "\u4e00\u4e2a\u533a\u95f4\u5185\u6240\u6709\u6570\u4e58\u79ef\u7684\u7f29\u5199", "Url": "https://leetcode.cn/problems/abbreviating-the-product-of-a-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 68 Problem 4"}, {"ID": 2118, "Title": "Build the Equation", "TitleCn": "\u5efa\u7acb\u65b9\u7a0b", "Url": "https://leetcode.cn/problems/build-the-equation/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 10, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2119, "Title": "A Number After a Double Reversal", "TitleCn": "\u53cd\u8f6c\u4e24\u6b21\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/a-number-after-a-double-reversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 273 Problem 1"}, {"ID": 2120, "Title": "Execution of All Suffix Instructions Staying in a Grid", "TitleCn": "\u6267\u884c\u6240\u6709\u540e\u7f00\u6307\u4ee4", "Url": "https://leetcode.cn/problems/execution-of-all-suffix-instructions-staying-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 273 Problem 2"}, {"ID": 2121, "Title": "Intervals Between Identical Elements", "TitleCn": "\u76f8\u540c\u5143\u7d20\u7684\u95f4\u9694\u4e4b\u548c", "Url": "https://leetcode.cn/problems/intervals-between-identical-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 273 Problem 3"}, {"ID": 2122, "Title": "Recover the Original Array", "TitleCn": "\u8fd8\u539f\u539f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/recover-the-original-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 273 Problem 4"}, {"ID": 2123, "Title": "Minimum Operations to Remove Adjacent Ones in Matrix", "TitleCn": "\u4f7f\u77e9\u9635\u4e2d\u7684 1 \u4e92\u4e0d\u76f8\u90bb\u7684\u6700\u5c0f\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-remove-adjacent-ones-in-matrix/", "Ispaid": 1, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2124, "Title": "Check if All A's Appears Before All B's", "TitleCn": "\u68c0\u67e5\u662f\u5426\u6240\u6709 A \u90fd\u5728 B \u4e4b\u524d", "Url": "https://leetcode.cn/problems/check-if-all-as-appears-before-all-bs/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 274 Problem 1"}, {"ID": 2125, "Title": "Number of Laser Beams in a Bank", "TitleCn": "\u94f6\u884c\u4e2d\u7684\u6fc0\u5149\u675f\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-laser-beams-in-a-bank/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 274 Problem 2"}, {"ID": 2126, "Title": "Destroying Asteroids", "TitleCn": "\u6467\u6bc1\u5c0f\u884c\u661f", "Url": "https://leetcode.cn/problems/destroying-asteroids/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 274 Problem 3"}, {"ID": 2127, "Title": "Maximum Employees to Be Invited to a Meeting", "TitleCn": "\u53c2\u52a0\u4f1a\u8bae\u7684\u6700\u591a\u5458\u5de5\u6570", "Url": "https://leetcode.cn/problems/maximum-employees-to-be-invited-to-a-meeting/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 274 Problem 4"}, {"ID": 2128, "Title": "Remove All Ones With Row and Column Flips", "TitleCn": "\u901a\u8fc7\u7ffb\u8f6c\u884c\u6216\u5217\u6765\u53bb\u9664\u6240\u6709\u7684 1", "Url": "https://leetcode.cn/problems/remove-all-ones-with-row-and-column-flips/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2129, "Title": "Capitalize the Title", "TitleCn": "\u5c06\u6807\u9898\u9996\u5b57\u6bcd\u5927\u5199", "Url": "https://leetcode.cn/problems/capitalize-the-title/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 69 Problem 1"}, {"ID": 2130, "Title": "Maximum Twin Sum of a Linked List", "TitleCn": "\u94fe\u8868\u6700\u5927\u5b6a\u751f\u548c", "Url": "https://leetcode.cn/problems/maximum-twin-sum-of-a-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 69 Problem 2"}, {"ID": 2131, "Title": "Longest Palindrome by Concatenating Two Letter Words", "TitleCn": "\u8fde\u63a5\u4e24\u5b57\u6bcd\u5355\u8bcd\u5f97\u5230\u7684\u6700\u957f\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/longest-palindrome-by-concatenating-two-letter-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 69 Problem 3"}, {"ID": 2132, "Title": "Stamping the Grid", "TitleCn": "\u7528\u90ae\u7968\u8d34\u6ee1\u7f51\u683c\u56fe", "Url": "https://leetcode.cn/problems/stamping-the-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 69 Problem 4"}, {"ID": 2133, "Title": "Check if Every Row and Column Contains All Numbers", "TitleCn": "\u68c0\u67e5\u662f\u5426\u6bcf\u4e00\u884c\u6bcf\u4e00\u5217\u90fd\u5305\u542b\u5168\u90e8\u6574\u6570", "Url": "https://leetcode.cn/problems/check-if-every-row-and-column-contains-all-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 275 Problem 1"}, {"ID": 2134, "Title": "Minimum Swaps to Group All 1's Together II", "TitleCn": "\u6700\u5c11\u4ea4\u6362\u6b21\u6570\u6765\u7ec4\u5408\u6240\u6709\u7684 1 II", "Url": "https://leetcode.cn/problems/minimum-swaps-to-group-all-1s-together-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 275 Problem 2"}, {"ID": 2135, "Title": "Count Words Obtained After Adding a Letter", "TitleCn": "\u7edf\u8ba1\u8ffd\u52a0\u5b57\u6bcd\u53ef\u4ee5\u83b7\u5f97\u7684\u5355\u8bcd\u6570", "Url": "https://leetcode.cn/problems/count-words-obtained-after-adding-a-letter/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 275 Problem 3"}, {"ID": 2136, "Title": "Earliest Possible Day of Full Bloom", "TitleCn": "\u5168\u90e8\u5f00\u82b1\u7684\u6700\u65e9\u4e00\u5929", "Url": "https://leetcode.cn/problems/earliest-possible-day-of-full-bloom/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 275 Problem 4"}, {"ID": 2137, "Title": "Pour Water Between Buckets to Make Water Levels Equal", "TitleCn": "\u901a\u8fc7\u5012\u6c34\u64cd\u4f5c\u8ba9\u6240\u6709\u7684\u6c34\u6876\u6240\u542b\u6c34\u91cf\u76f8\u7b49", "Url": "https://leetcode.cn/problems/pour-water-between-buckets-to-make-water-levels-equal/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2138, "Title": "Divide a String Into Groups of Size k", "TitleCn": "\u5c06\u5b57\u7b26\u4e32\u62c6\u5206\u4e3a\u82e5\u5e72\u957f\u5ea6\u4e3a k \u7684\u7ec4", "Url": "https://leetcode.cn/problems/divide-a-string-into-groups-of-size-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 276 Problem 1"}, {"ID": 2139, "Title": "Minimum Moves to Reach Target Score", "TitleCn": "\u5f97\u5230\u76ee\u6807\u503c\u7684\u6700\u5c11\u884c\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-moves-to-reach-target-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 276 Problem 2"}, {"ID": 2140, "Title": "Solving Questions With Brainpower", "TitleCn": "\u89e3\u51b3\u667a\u529b\u95ee\u9898", "Url": "https://leetcode.cn/problems/solving-questions-with-brainpower/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 276 Problem 3"}, {"ID": 2141, "Title": "Maximum Running Time of N Computers", "TitleCn": "\u540c\u65f6\u8fd0\u884c N \u53f0\u7535\u8111\u7684\u6700\u957f\u65f6\u95f4", "Url": "https://leetcode.cn/problems/maximum-running-time-of-n-computers/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 276 Problem 4"}, {"ID": 2142, "Title": "The Number of Passengers in Each Bus I", "TitleCn": "\u6bcf\u8f86\u8f66\u7684\u4e58\u5ba2\u4eba\u6570 I", "Url": "https://leetcode.cn/problems/the-number-of-passengers-in-each-bus-i/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2143, "Title": "Choose Numbers From Two Arrays in Range", "TitleCn": "\u5728\u4e24\u4e2a\u6570\u7ec4\u7684\u533a\u95f4\u4e2d\u9009\u53d6\u6570\u5b57", "Url": "https://leetcode.cn/problems/choose-numbers-from-two-arrays-in-range/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2144, "Title": "Minimum Cost of Buying Candies With Discount", "TitleCn": "\u6253\u6298\u8d2d\u4e70\u7cd6\u679c\u7684\u6700\u5c0f\u5f00\u9500", "Url": "https://leetcode.cn/problems/minimum-cost-of-buying-candies-with-discount/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 70 Problem 1"}, {"ID": 2145, "Title": "Count the Hidden Sequences", "TitleCn": "\u7edf\u8ba1\u9690\u85cf\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-hidden-sequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 70 Problem 2"}, {"ID": 2146, "Title": "K Highest Ranked Items Within a Price Range", "TitleCn": "\u4ef7\u683c\u8303\u56f4\u5185\u6700\u9ad8\u6392\u540d\u7684 K \u6837\u7269\u54c1", "Url": "https://leetcode.cn/problems/k-highest-ranked-items-within-a-price-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 70 Problem 3"}, {"ID": 2147, "Title": "Number of Ways to Divide a Long Corridor", "TitleCn": "\u5206\u9694\u957f\u5eca\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-divide-a-long-corridor/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 70 Problem 4"}, {"ID": 2148, "Title": "Count Elements With Strictly Smaller and Greater Elements", "TitleCn": "\u5143\u7d20\u8ba1\u6570", "Url": "https://leetcode.cn/problems/count-elements-with-strictly-smaller-and-greater-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 277 Problem 1"}, {"ID": 2149, "Title": "Rearrange Array Elements by Sign", "TitleCn": "\u6309\u7b26\u53f7\u91cd\u6392\u6570\u7ec4", "Url": "https://leetcode.cn/problems/rearrange-array-elements-by-sign/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 277 Problem 2"}, {"ID": 2150, "Title": "Find All Lonely Numbers in the Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u6240\u6709\u5b64\u72ec\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-all-lonely-numbers-in-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 277 Problem 3"}, {"ID": 2151, "Title": "Maximum Good People Based on Statements", "TitleCn": "\u57fa\u4e8e\u9648\u8ff0\u7edf\u8ba1\u6700\u591a\u597d\u4eba\u6570", "Url": "https://leetcode.cn/problems/maximum-good-people-based-on-statements/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 277 Problem 4"}, {"ID": 2152, "Title": "Minimum Number of Lines to Cover Points", "TitleCn": "\u7a7f\u8fc7\u6240\u6709\u70b9\u7684\u6240\u9700\u6700\u5c11\u76f4\u7ebf\u6570\u91cf", "Url": "https://leetcode.cn/problems/minimum-number-of-lines-to-cover-points/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2153, "Title": "The Number of Passengers in Each Bus II", "TitleCn": "\u6bcf\u8f86\u8f66\u7684\u4e58\u5ba2\u4eba\u6570 II", "Url": "https://leetcode.cn/problems/the-number-of-passengers-in-each-bus-ii/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2154, "Title": "Keep Multiplying Found Values by Two", "TitleCn": "\u5c06\u627e\u5230\u7684\u503c\u4e58\u4ee5 2", "Url": "https://leetcode.cn/problems/keep-multiplying-found-values-by-two/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 278 Problem 1"}, {"ID": 2155, "Title": "All Divisions With the Highest Score of a Binary Array", "TitleCn": "\u5206\u7ec4\u5f97\u5206\u6700\u9ad8\u7684\u6240\u6709\u4e0b\u6807", "Url": "https://leetcode.cn/problems/all-divisions-with-the-highest-score-of-a-binary-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 278 Problem 2"}, {"ID": 2156, "Title": "Find Substring With Given Hash Value", "TitleCn": "\u67e5\u627e\u7ed9\u5b9a\u54c8\u5e0c\u503c\u7684\u5b50\u4e32", "Url": "https://leetcode.cn/problems/find-substring-with-given-hash-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 278 Problem 3"}, {"ID": 2157, "Title": "Groups of Strings", "TitleCn": "\u5b57\u7b26\u4e32\u5206\u7ec4", "Url": "https://leetcode.cn/problems/groups-of-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 278 Problem 4"}, {"ID": 2158, "Title": "Amount of New Area Painted Each Day", "TitleCn": "\u6bcf\u5929\u7ed8\u5236\u65b0\u533a\u57df\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/amount-of-new-area-painted-each-day/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2159, "Title": "Order Two Columns Independently", "TitleCn": "\u5206\u522b\u6392\u5e8f\u4e24\u5217", "Url": "https://leetcode.cn/problems/order-two-columns-independently/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2160, "Title": "Minimum Sum of Four Digit Number After Splitting Digits", "TitleCn": "\u62c6\u5206\u6570\u4f4d\u540e\u56db\u4f4d\u6570\u5b57\u7684\u6700\u5c0f\u548c", "Url": "https://leetcode.cn/problems/minimum-sum-of-four-digit-number-after-splitting-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 71 Problem 1"}, {"ID": 2161, "Title": "Partition Array According to Given Pivot", "TitleCn": "\u6839\u636e\u7ed9\u5b9a\u6570\u5b57\u5212\u5206\u6570\u7ec4", "Url": "https://leetcode.cn/problems/partition-array-according-to-given-pivot/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 71 Problem 2"}, {"ID": 2162, "Title": "Minimum Cost to Set Cooking Time", "TitleCn": "\u8bbe\u7f6e\u65f6\u95f4\u7684\u6700\u5c11\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-to-set-cooking-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 71 Problem 3"}, {"ID": 2163, "Title": "Minimum Difference in Sums After Removal of Elements", "TitleCn": "\u5220\u9664\u5143\u7d20\u540e\u548c\u7684\u6700\u5c0f\u5dee\u503c", "Url": "https://leetcode.cn/problems/minimum-difference-in-sums-after-removal-of-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 71 Problem 4"}, {"ID": 2164, "Title": "Sort Even and Odd Indices Independently", "TitleCn": "\u5bf9\u5947\u5076\u4e0b\u6807\u5206\u522b\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-even-and-odd-indices-independently/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 279 Problem 1"}, {"ID": 2165, "Title": "Smallest Value of the Rearranged Number", "TitleCn": "\u91cd\u6392\u6570\u5b57\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/smallest-value-of-the-rearranged-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 279 Problem 2"}, {"ID": 2166, "Title": "Design Bitset", "TitleCn": "\u8bbe\u8ba1\u4f4d\u96c6", "Url": "https://leetcode.cn/problems/design-bitset/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 279 Problem 3"}, {"ID": 2167, "Title": "Minimum Time to Remove All Cars Containing Illegal Goods", "TitleCn": "\u79fb\u9664\u6240\u6709\u8f7d\u6709\u8fdd\u7981\u8d27\u7269\u8f66\u53a2\u6240\u9700\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-remove-all-cars-containing-illegal-goods/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 279 Problem 4"}, {"ID": 2168, "Title": "Unique Substrings With Equal Digit Frequency", "TitleCn": "\u6bcf\u4e2a\u6570\u5b57\u7684\u9891\u7387\u90fd\u76f8\u540c\u7684\u72ec\u7279\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/unique-substrings-with-equal-digit-frequency/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2169, "Title": "Count Operations to Obtain Zero", "TitleCn": "\u5f97\u5230 0 \u7684\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/count-operations-to-obtain-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 280 Problem 1"}, {"ID": 2170, "Title": "Minimum Operations to Make the Array Alternating", "TitleCn": "\u4f7f\u6570\u7ec4\u53d8\u6210\u4ea4\u66ff\u6570\u7ec4\u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-the-array-alternating/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 280 Problem 2"}, {"ID": 2171, "Title": "Removing Minimum Number of Magic Beans", "TitleCn": "\u62ff\u51fa\u6700\u5c11\u6570\u76ee\u7684\u9b54\u6cd5\u8c46", "Url": "https://leetcode.cn/problems/removing-minimum-number-of-magic-beans/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 280 Problem 3"}, {"ID": 2172, "Title": "Maximum AND Sum of Array", "TitleCn": "\u6570\u7ec4\u7684\u6700\u5927\u4e0e\u548c", "Url": "https://leetcode.cn/problems/maximum-and-sum-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 280 Problem 4"}, {"ID": 2173, "Title": "Longest Winning Streak", "TitleCn": "\u6700\u591a\u8fde\u80dc\u7684\u6b21\u6570", "Url": "https://leetcode.cn/problems/longest-winning-streak/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 10, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2174, "Title": "Remove All Ones With Row and Column Flips II", "TitleCn": "\u901a\u8fc7\u7ffb\u8f6c\u884c\u6216\u5217\u6765\u53bb\u9664\u6240\u6709\u7684 1 II", "Url": "https://leetcode.cn/problems/remove-all-ones-with-row-and-column-flips-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2175, "Title": "The Change in Global Rankings", "TitleCn": "\u4e16\u754c\u6392\u540d\u7684\u53d8\u5316", "Url": "https://leetcode.cn/problems/the-change-in-global-rankings/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2176, "Title": "Count Equal and Divisible Pairs in an Array", "TitleCn": "\u7edf\u8ba1\u6570\u7ec4\u4e2d\u76f8\u7b49\u4e14\u53ef\u4ee5\u88ab\u6574\u9664\u7684\u6570\u5bf9", "Url": "https://leetcode.cn/problems/count-equal-and-divisible-pairs-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 72 Problem 1"}, {"ID": 2177, "Title": "Find Three Consecutive Integers That Sum to a Given Number", "TitleCn": "\u627e\u5230\u548c\u4e3a\u7ed9\u5b9a\u6574\u6570\u7684\u4e09\u4e2a\u8fde\u7eed\u6574\u6570", "Url": "https://leetcode.cn/problems/find-three-consecutive-integers-that-sum-to-a-given-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 72 Problem 2"}, {"ID": 2178, "Title": "Maximum Split of Positive Even Integers", "TitleCn": "\u62c6\u5206\u6210\u6700\u591a\u6570\u76ee\u7684\u6b63\u5076\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/maximum-split-of-positive-even-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 72 Problem 3"}, {"ID": 2179, "Title": "Count Good Triplets in an Array", "TitleCn": "\u7edf\u8ba1\u6570\u7ec4\u4e2d\u597d\u4e09\u5143\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-good-triplets-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 72 Problem 4"}, {"ID": 2180, "Title": "Count Integers With Even Digit Sum", "TitleCn": "\u7edf\u8ba1\u5404\u4f4d\u6570\u5b57\u4e4b\u548c\u4e3a\u5076\u6570\u7684\u6574\u6570\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-integers-with-even-digit-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 281 Problem 1"}, {"ID": 2181, "Title": "Merge Nodes in Between Zeros", "TitleCn": "\u5408\u5e76\u96f6\u4e4b\u95f4\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/merge-nodes-in-between-zeros/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 281 Problem 2"}, {"ID": 2182, "Title": "Construct String With Repeat Limit", "TitleCn": "\u6784\u9020\u9650\u5236\u91cd\u590d\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/construct-string-with-repeat-limit/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 281 Problem 3"}, {"ID": 2183, "Title": "Count Array Pairs Divisible by K", "TitleCn": "\u7edf\u8ba1\u53ef\u4ee5\u88ab K \u6574\u9664\u7684\u4e0b\u6807\u5bf9\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-array-pairs-divisible-by-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 281 Problem 4"}, {"ID": 2184, "Title": "Number of Ways to Build Sturdy Brick Wall", "TitleCn": "\u5efa\u9020\u575a\u5b9e\u7684\u7816\u5899\u7684\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-build-sturdy-brick-wall/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2185, "Title": "Counting Words With a Given Prefix", "TitleCn": "\u7edf\u8ba1\u5305\u542b\u7ed9\u5b9a\u524d\u7f00\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/counting-words-with-a-given-prefix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 282 Problem 1"}, {"ID": 2186, "Title": "Minimum Number of Steps to Make Two Strings Anagram II", "TitleCn": "\u5236\u9020\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u7684\u6700\u5c0f\u6b65\u9aa4\u6570 II", "Url": "https://leetcode.cn/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 282 Problem 2"}, {"ID": 2187, "Title": "Minimum Time to Complete Trips", "TitleCn": "\u5b8c\u6210\u65c5\u9014\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-complete-trips/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 282 Problem 3"}, {"ID": 2188, "Title": "Minimum Time to Finish the Race", "TitleCn": "\u5b8c\u6210\u6bd4\u8d5b\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-finish-the-race/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 282 Problem 4"}, {"ID": 2189, "Title": "Number of Ways to Build House of Cards", "TitleCn": "\u5efa\u9020\u7eb8\u724c\u5c4b\u7684\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-build-house-of-cards/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2190, "Title": "Most Frequent Number Following Key In an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7d27\u8ddf key \u4e4b\u540e\u51fa\u73b0\u6700\u9891\u7e41\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/most-frequent-number-following-key-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 73 Problem 1"}, {"ID": 2191, "Title": "Sort the Jumbled Numbers", "TitleCn": "\u5c06\u6742\u4e71\u65e0\u7ae0\u7684\u6570\u5b57\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-the-jumbled-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 73 Problem 2"}, {"ID": 2192, "Title": "All Ancestors of a Node in a Directed Acyclic Graph", "TitleCn": "\u6709\u5411\u65e0\u73af\u56fe\u4e2d\u4e00\u4e2a\u8282\u70b9\u7684\u6240\u6709\u7956\u5148", "Url": "https://leetcode.cn/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 73 Problem 3"}, {"ID": 2193, "Title": "Minimum Number of Moves to Make Palindrome", "TitleCn": "\u5f97\u5230\u56de\u6587\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-moves-to-make-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 73 Problem 4"}, {"ID": 2194, "Title": "Cells in a Range on an Excel Sheet", "TitleCn": "Excel \u8868\u4e2d\u67d0\u4e2a\u8303\u56f4\u5185\u7684\u5355\u5143\u683c", "Url": "https://leetcode.cn/problems/cells-in-a-range-on-an-excel-sheet/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 283 Problem 1"}, {"ID": 2195, "Title": "Append K Integers With Minimal Sum", "TitleCn": "\u5411\u6570\u7ec4\u4e2d\u8ffd\u52a0 K \u4e2a\u6574\u6570", "Url": "https://leetcode.cn/problems/append-k-integers-with-minimal-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 283 Problem 2"}, {"ID": 2196, "Title": "Create Binary Tree From Descriptions", "TitleCn": "\u6839\u636e\u63cf\u8ff0\u521b\u5efa\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/create-binary-tree-from-descriptions/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 283 Problem 3"}, {"ID": 2197, "Title": "Replace Non-Coprime Numbers in Array", "TitleCn": "\u66ff\u6362\u6570\u7ec4\u4e2d\u7684\u975e\u4e92\u8d28\u6570", "Url": "https://leetcode.cn/problems/replace-non-coprime-numbers-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 283 Problem 4"}, {"ID": 2198, "Title": "Number of Single Divisor Triplets", "TitleCn": "\u5355\u56e0\u6570\u4e09\u5143\u7ec4", "Url": "https://leetcode.cn/problems/number-of-single-divisor-triplets/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2199, "Title": "Finding the Topic of Each Post", "TitleCn": "\u627e\u5230\u6bcf\u7bc7\u6587\u7ae0\u7684\u4e3b\u9898", "Url": "https://leetcode.cn/problems/finding-the-topic-of-each-post/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2200, "Title": "Find All K-Distant Indices in an Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u6240\u6709 K \u8fd1\u90bb\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-all-k-distant-indices-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 284 Problem 1"}, {"ID": 2201, "Title": "Count Artifacts That Can Be Extracted", "TitleCn": "\u7edf\u8ba1\u53ef\u4ee5\u63d0\u53d6\u7684\u5de5\u4ef6", "Url": "https://leetcode.cn/problems/count-artifacts-that-can-be-extracted/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 284 Problem 2"}, {"ID": 2202, "Title": "Maximize the Topmost Element After K Moves", "TitleCn": "K \u6b21\u64cd\u4f5c\u540e\u6700\u5927\u5316\u9876\u7aef\u5143\u7d20", "Url": "https://leetcode.cn/problems/maximize-the-topmost-element-after-k-moves/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 284 Problem 3"}, {"ID": 2203, "Title": "Minimum Weighted Subgraph With the Required Paths", "TitleCn": "\u5f97\u5230\u8981\u6c42\u8def\u5f84\u7684\u6700\u5c0f\u5e26\u6743\u5b50\u56fe", "Url": "https://leetcode.cn/problems/minimum-weighted-subgraph-with-the-required-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 284 Problem 4"}, {"ID": 2204, "Title": "Distance to a Cycle in Undirected Graph", "TitleCn": "\u65e0\u5411\u56fe\u4e2d\u5230\u73af\u7684\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/distance-to-a-cycle-in-undirected-graph/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2205, "Title": "The Number of Users That Are Eligible for Discount", "TitleCn": "\u6709\u8d44\u683c\u4eab\u53d7\u6298\u6263\u7684\u7528\u6237\u6570\u91cf", "Url": "https://leetcode.cn/problems/the-number-of-users-that-are-eligible-for-discount/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2206, "Title": "Divide Array Into Equal Pairs", "TitleCn": "\u5c06\u6570\u7ec4\u5212\u5206\u6210\u76f8\u7b49\u6570\u5bf9", "Url": "https://leetcode.cn/problems/divide-array-into-equal-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 74 Problem 1"}, {"ID": 2207, "Title": "Maximize Number of Subsequences in a String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u6700\u591a\u6570\u76ee\u7684\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/maximize-number-of-subsequences-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 74 Problem 2"}, {"ID": 2208, "Title": "Minimum Operations to Halve Array Sum", "TitleCn": "\u5c06\u6570\u7ec4\u548c\u51cf\u534a\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-halve-array-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 74 Problem 3"}, {"ID": 2209, "Title": "Minimum White Tiles After Covering With Carpets", "TitleCn": "\u7528\u5730\u6bef\u8986\u76d6\u540e\u7684\u6700\u5c11\u767d\u8272\u7816\u5757", "Url": "https://leetcode.cn/problems/minimum-white-tiles-after-covering-with-carpets/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 74 Problem 4"}, {"ID": 2210, "Title": "Count Hills and Valleys in an Array", "TitleCn": "\u7edf\u8ba1\u6570\u7ec4\u4e2d\u5cf0\u548c\u8c37\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-hills-and-valleys-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 285 Problem 1"}, {"ID": 2211, "Title": "Count Collisions on a Road", "TitleCn": "\u7edf\u8ba1\u9053\u8def\u4e0a\u7684\u78b0\u649e\u6b21\u6570", "Url": "https://leetcode.cn/problems/count-collisions-on-a-road/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 285 Problem 2"}, {"ID": 2212, "Title": "Maximum Points in an Archery Competition", "TitleCn": "\u5c04\u7bad\u6bd4\u8d5b\u4e2d\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-points-in-an-archery-competition/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 285 Problem 3"}, {"ID": 2213, "Title": "Longest Substring of One Repeating Character", "TitleCn": "\u7531\u5355\u4e2a\u5b57\u7b26\u91cd\u590d\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/longest-substring-of-one-repeating-character/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 285 Problem 4"}, {"ID": 2214, "Title": "Minimum Health to Beat Game", "TitleCn": "\u901a\u5173\u6e38\u620f\u6240\u9700\u7684\u6700\u4f4e\u751f\u547d\u503c", "Url": "https://leetcode.cn/problems/minimum-health-to-beat-game/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2215, "Title": "Find the Difference of Two Arrays", "TitleCn": "\u627e\u51fa\u4e24\u6570\u7ec4\u7684\u4e0d\u540c", "Url": "https://leetcode.cn/problems/find-the-difference-of-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 286 Problem 1"}, {"ID": 2216, "Title": "Minimum Deletions to Make Array Beautiful", "TitleCn": "\u7f8e\u5316\u6570\u7ec4\u7684\u6700\u5c11\u5220\u9664\u6570", "Url": "https://leetcode.cn/problems/minimum-deletions-to-make-array-beautiful/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 286 Problem 2"}, {"ID": 2217, "Title": "Find Palindrome With Fixed Length", "TitleCn": "\u627e\u5230\u6307\u5b9a\u957f\u5ea6\u7684\u56de\u6587\u6570", "Url": "https://leetcode.cn/problems/find-palindrome-with-fixed-length/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 286 Problem 3"}, {"ID": 2218, "Title": "Maximum Value of K Coins From Piles", "TitleCn": "\u4ece\u6808\u4e2d\u53d6\u51fa K \u4e2a\u786c\u5e01\u7684\u6700\u5927\u9762\u503c\u548c", "Url": "https://leetcode.cn/problems/maximum-value-of-k-coins-from-piles/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 286 Problem 4"}, {"ID": 2219, "Title": "Maximum Sum Score of Array", "TitleCn": "\u6570\u7ec4\u7684\u6700\u5927\u603b\u5206", "Url": "https://leetcode.cn/problems/maximum-sum-score-of-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2220, "Title": "Minimum Bit Flips to Convert Number", "TitleCn": "\u8f6c\u6362\u6570\u5b57\u7684\u6700\u5c11\u4f4d\u7ffb\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-bit-flips-to-convert-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 75 Problem 1"}, {"ID": 2221, "Title": "Find Triangular Sum of an Array", "TitleCn": "\u6570\u7ec4\u7684\u4e09\u89d2\u548c", "Url": "https://leetcode.cn/problems/find-triangular-sum-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 75 Problem 2"}, {"ID": 2222, "Title": "Number of Ways to Select Buildings", "TitleCn": "\u9009\u62e9\u5efa\u7b51\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-select-buildings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 75 Problem 3"}, {"ID": 2223, "Title": "Sum of Scores of Built Strings", "TitleCn": "\u6784\u9020\u5b57\u7b26\u4e32\u7684\u603b\u5f97\u5206\u548c", "Url": "https://leetcode.cn/problems/sum-of-scores-of-built-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 75 Problem 4"}, {"ID": 2224, "Title": "Minimum Number of Operations to Convert Time", "TitleCn": "\u8f6c\u5316\u65f6\u95f4\u9700\u8981\u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-convert-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 287 Problem 1"}, {"ID": 2225, "Title": "Find Players With Zero or One Losses", "TitleCn": "\u627e\u51fa\u8f93\u6389\u96f6\u573a\u6216\u4e00\u573a\u6bd4\u8d5b\u7684\u73a9\u5bb6", "Url": "https://leetcode.cn/problems/find-players-with-zero-or-one-losses/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 287 Problem 2"}, {"ID": 2226, "Title": "Maximum Candies Allocated to K Children", "TitleCn": "\u6bcf\u4e2a\u5c0f\u5b69\u6700\u591a\u80fd\u5206\u5230\u591a\u5c11\u7cd6\u679c", "Url": "https://leetcode.cn/problems/maximum-candies-allocated-to-k-children/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 287 Problem 3"}, {"ID": 2227, "Title": "Encrypt and Decrypt Strings", "TitleCn": "\u52a0\u5bc6\u89e3\u5bc6\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/encrypt-and-decrypt-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 287 Problem 4"}, {"ID": 2228, "Title": "Users With Two Purchases Within Seven Days", "TitleCn": "7 \u5929\u5185\u4e24\u6b21\u8d2d\u4e70\u7684\u7528\u6237", "Url": "https://leetcode.cn/problems/users-with-two-purchases-within-seven-days/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2229, "Title": "Check if an Array Is Consecutive", "TitleCn": "\u68c0\u67e5\u6570\u7ec4\u662f\u5426\u8fde\u8d2f", "Url": "https://leetcode.cn/problems/check-if-an-array-is-consecutive/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2230, "Title": "The Users That Are Eligible for Discount", "TitleCn": "\u67e5\u627e\u53ef\u4eab\u53d7\u4f18\u60e0\u7684\u7528\u6237", "Url": "https://leetcode.cn/problems/the-users-that-are-eligible-for-discount/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2231, "Title": "Largest Number After Digit Swaps by Parity", "TitleCn": "\u6309\u5947\u5076\u6027\u4ea4\u6362\u540e\u7684\u6700\u5927\u6570\u5b57", "Url": "https://leetcode.cn/problems/largest-number-after-digit-swaps-by-parity/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 288 Problem 1"}, {"ID": 2232, "Title": "Minimize Result by Adding Parentheses to Expression", "TitleCn": "\u5411\u8868\u8fbe\u5f0f\u6dfb\u52a0\u62ec\u53f7\u540e\u7684\u6700\u5c0f\u7ed3\u679c", "Url": "https://leetcode.cn/problems/minimize-result-by-adding-parentheses-to-expression/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 288 Problem 2"}, {"ID": 2233, "Title": "Maximum Product After K Increments", "TitleCn": "K \u6b21\u589e\u52a0\u540e\u7684\u6700\u5927\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-product-after-k-increments/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 288 Problem 3"}, {"ID": 2234, "Title": "Maximum Total Beauty of the Gardens", "TitleCn": "\u82b1\u56ed\u7684\u6700\u5927\u603b\u7f8e\u4e3d\u503c", "Url": "https://leetcode.cn/problems/maximum-total-beauty-of-the-gardens/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 288 Problem 4"}, {"ID": 2235, "Title": "Add Two Integers", "TitleCn": "\u4e24\u6574\u6570\u76f8\u52a0", "Url": "https://leetcode.cn/problems/add-two-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2236, "Title": "Root Equals Sum of Children", "TitleCn": "\u5224\u65ad\u6839\u7ed3\u70b9\u662f\u5426\u7b49\u4e8e\u5b50\u7ed3\u70b9\u4e4b\u548c", "Url": "https://leetcode.cn/problems/root-equals-sum-of-children/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2237, "Title": "Count Positions on Street With Required Brightness", "TitleCn": "\u8ba1\u7b97\u8857\u9053\u4e0a\u6ee1\u8db3\u6240\u9700\u4eae\u5ea6\u7684\u4f4d\u7f6e\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-positions-on-street-with-required-brightness/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2238, "Title": "Number of Times a Driver Was a Passenger", "TitleCn": "\u53f8\u673a\u6210\u4e3a\u4e58\u5ba2\u7684\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-times-a-driver-was-a-passenger/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2239, "Title": "Find Closest Number to Zero", "TitleCn": "\u627e\u5230\u6700\u63a5\u8fd1 0 \u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-closest-number-to-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 76 Problem 1"}, {"ID": 2240, "Title": "Number of Ways to Buy Pens and Pencils", "TitleCn": "\u4e70\u94a2\u7b14\u548c\u94c5\u7b14\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-buy-pens-and-pencils/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 76 Problem 2"}, {"ID": 2241, "Title": "Design an ATM Machine", "TitleCn": "\u8bbe\u8ba1\u4e00\u4e2a ATM \u673a\u5668", "Url": "https://leetcode.cn/problems/design-an-atm-machine/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 76 Problem 3"}, {"ID": 2242, "Title": "Maximum Score of a Node Sequence", "TitleCn": "\u8282\u70b9\u5e8f\u5217\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-score-of-a-node-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 76 Problem 4"}, {"ID": 2243, "Title": "Calculate Digit Sum of a String", "TitleCn": "\u8ba1\u7b97\u5b57\u7b26\u4e32\u7684\u6570\u5b57\u548c", "Url": "https://leetcode.cn/problems/calculate-digit-sum-of-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 289 Problem 1"}, {"ID": 2244, "Title": "Minimum Rounds to Complete All Tasks", "TitleCn": "\u5b8c\u6210\u6240\u6709\u4efb\u52a1\u9700\u8981\u7684\u6700\u5c11\u8f6e\u6570", "Url": "https://leetcode.cn/problems/minimum-rounds-to-complete-all-tasks/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 289 Problem 2"}, {"ID": 2245, "Title": "Maximum Trailing Zeros in a Cornered Path", "TitleCn": "\u8f6c\u89d2\u8def\u5f84\u7684\u4e58\u79ef\u4e2d\u6700\u591a\u80fd\u6709\u51e0\u4e2a\u5c3e\u968f\u96f6", "Url": "https://leetcode.cn/problems/maximum-trailing-zeros-in-a-cornered-path/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 289 Problem 3"}, {"ID": 2246, "Title": "Longest Path With Different Adjacent Characters", "TitleCn": "\u76f8\u90bb\u5b57\u7b26\u4e0d\u540c\u7684\u6700\u957f\u8def\u5f84", "Url": "https://leetcode.cn/problems/longest-path-with-different-adjacent-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 289 Problem 4"}, {"ID": 2247, "Title": "Maximum Cost of Trip With K Highways", "TitleCn": "K \u6761\u9ad8\u901f\u516c\u8def\u7684\u6700\u5927\u65c5\u884c\u8d39\u7528", "Url": "https://leetcode.cn/problems/maximum-cost-of-trip-with-k-highways/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2248, "Title": "Intersection of Multiple Arrays", "TitleCn": "\u591a\u4e2a\u6570\u7ec4\u6c42\u4ea4\u96c6", "Url": "https://leetcode.cn/problems/intersection-of-multiple-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 290 Problem 1"}, {"ID": 2249, "Title": "Count Lattice Points Inside a Circle", "TitleCn": "\u7edf\u8ba1\u5706\u5185\u683c\u70b9\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-lattice-points-inside-a-circle/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 290 Problem 2"}, {"ID": 2250, "Title": "Count Number of Rectangles Containing Each Point", "TitleCn": "\u7edf\u8ba1\u5305\u542b\u6bcf\u4e2a\u70b9\u7684\u77e9\u5f62\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-rectangles-containing-each-point/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 290 Problem 3"}, {"ID": 2251, "Title": "Number of Flowers in Full Bloom", "TitleCn": "\u82b1\u671f\u5185\u82b1\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-flowers-in-full-bloom/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 290 Problem 4"}, {"ID": 2252, "Title": "Dynamic Pivoting of a Table", "TitleCn": "\u8868\u7684\u52a8\u6001\u65cb\u8f6c", "Url": "https://leetcode.cn/problems/dynamic-pivoting-of-a-table/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2253, "Title": "Dynamic Unpivoting of a Table", "TitleCn": "\u52a8\u6001\u53d6\u6d88\u8868\u7684\u65cb\u8f6c", "Url": "https://leetcode.cn/problems/dynamic-unpivoting-of-a-table/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2254, "Title": "Design Video Sharing Platform", "TitleCn": "\u8bbe\u8ba1\u89c6\u9891\u5171\u4eab\u5e73\u53f0", "Url": "https://leetcode.cn/problems/design-video-sharing-platform/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2255, "Title": "Count Prefixes of a Given String", "TitleCn": "\u7edf\u8ba1\u662f\u7ed9\u5b9a\u5b57\u7b26\u4e32\u524d\u7f00\u7684\u5b57\u7b26\u4e32\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-prefixes-of-a-given-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 77 Problem 1"}, {"ID": 2256, "Title": "Minimum Average Difference", "TitleCn": "\u6700\u5c0f\u5e73\u5747\u5dee", "Url": "https://leetcode.cn/problems/minimum-average-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 77 Problem 2"}, {"ID": 2257, "Title": "Count Unguarded Cells in the Grid", "TitleCn": "\u7edf\u8ba1\u7f51\u683c\u56fe\u4e2d\u6ca1\u6709\u88ab\u4fdd\u536b\u7684\u683c\u5b50\u6570", "Url": "https://leetcode.cn/problems/count-unguarded-cells-in-the-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 77 Problem 3"}, {"ID": 2258, "Title": "Escape the Spreading Fire", "TitleCn": "\u9003\u79bb\u706b\u707e", "Url": "https://leetcode.cn/problems/escape-the-spreading-fire/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 77 Problem 4"}, {"ID": 2259, "Title": "Remove Digit From Number to Maximize Result", "TitleCn": "\u79fb\u9664\u6307\u5b9a\u6570\u5b57\u5f97\u5230\u7684\u6700\u5927\u7ed3\u679c", "Url": "https://leetcode.cn/problems/remove-digit-from-number-to-maximize-result/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 291 Problem 1"}, {"ID": 2260, "Title": "Minimum Consecutive Cards to Pick Up", "TitleCn": "\u5fc5\u987b\u62ff\u8d77\u7684\u6700\u5c0f\u8fde\u7eed\u5361\u724c\u6570", "Url": "https://leetcode.cn/problems/minimum-consecutive-cards-to-pick-up/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 291 Problem 2"}, {"ID": 2261, "Title": "K Divisible Elements Subarrays", "TitleCn": "\u542b\u6700\u591a K \u4e2a\u53ef\u6574\u9664\u5143\u7d20\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/k-divisible-elements-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 9, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 291 Problem 3"}, {"ID": 2262, "Title": "Total Appeal of A String", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u603b\u5f15\u529b", "Url": "https://leetcode.cn/problems/total-appeal-of-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 291 Problem 4"}, {"ID": 2263, "Title": "Make Array Non-decreasing or Non-increasing", "TitleCn": "\u6570\u7ec4\u53d8\u4e3a\u6709\u5e8f\u7684\u6700\u5c0f\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/make-array-non-decreasing-or-non-increasing/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2264, "Title": "Largest 3-Same-Digit Number in String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u6700\u5927\u7684 3 \u4f4d\u76f8\u540c\u6570\u5b57", "Url": "https://leetcode.cn/problems/largest-3-same-digit-number-in-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 292 Problem 1"}, {"ID": 2265, "Title": "Count Nodes Equal to Average of Subtree", "TitleCn": "\u7edf\u8ba1\u503c\u7b49\u4e8e\u5b50\u6811\u5e73\u5747\u503c\u7684\u8282\u70b9\u6570", "Url": "https://leetcode.cn/problems/count-nodes-equal-to-average-of-subtree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 292 Problem 2"}, {"ID": 2266, "Title": "Count Number of Texts", "TitleCn": "\u7edf\u8ba1\u6253\u5b57\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/count-number-of-texts/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 292 Problem 3"}, {"ID": 2267, "Title": "Check if There Is a Valid Parentheses String Path", "TitleCn": "\u68c0\u67e5\u662f\u5426\u6709\u5408\u6cd5\u62ec\u53f7\u5b57\u7b26\u4e32\u8def\u5f84", "Url": "https://leetcode.cn/problems/check-if-there-is-a-valid-parentheses-string-path/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 292 Problem 4"}, {"ID": 2268, "Title": "Minimum Number of Keypresses", "TitleCn": "\u6700\u5c11\u6309\u952e\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-keypresses/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2269, "Title": "Find the K-Beauty of a Number", "TitleCn": "\u627e\u5230\u4e00\u4e2a\u6570\u5b57\u7684 K \u7f8e\u4e3d\u503c", "Url": "https://leetcode.cn/problems/find-the-k-beauty-of-a-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 78 Problem 1"}, {"ID": 2270, "Title": "Number of Ways to Split Array", "TitleCn": "\u5206\u5272\u6570\u7ec4\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-split-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 78 Problem 2"}, {"ID": 2271, "Title": "Maximum White Tiles Covered by a Carpet", "TitleCn": "\u6bef\u5b50\u8986\u76d6\u7684\u6700\u591a\u767d\u8272\u7816\u5757\u6570", "Url": "https://leetcode.cn/problems/maximum-white-tiles-covered-by-a-carpet/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 78 Problem 3"}, {"ID": 2272, "Title": "Substring With Largest Variance", "TitleCn": "\u6700\u5927\u6ce2\u52a8\u7684\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/substring-with-largest-variance/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 78 Problem 4"}, {"ID": 2273, "Title": "Find Resultant Array After Removing Anagrams", "TitleCn": "\u79fb\u9664\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u540e\u7684\u7ed3\u679c\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-resultant-array-after-removing-anagrams/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 293 Problem 1"}, {"ID": 2274, "Title": "Maximum Consecutive Floors Without Special Floors", "TitleCn": "\u4e0d\u542b\u7279\u6b8a\u697c\u5c42\u7684\u6700\u5927\u8fde\u7eed\u697c\u5c42\u6570", "Url": "https://leetcode.cn/problems/maximum-consecutive-floors-without-special-floors/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 293 Problem 2"}, {"ID": 2275, "Title": "Largest Combination With Bitwise AND Greater Than Zero", "TitleCn": "\u6309\u4f4d\u4e0e\u7ed3\u679c\u5927\u4e8e\u96f6\u7684\u6700\u957f\u7ec4\u5408", "Url": "https://leetcode.cn/problems/largest-combination-with-bitwise-and-greater-than-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 293 Problem 3"}, {"ID": 2276, "Title": "Count Integers in Intervals", "TitleCn": "\u7edf\u8ba1\u533a\u95f4\u4e2d\u7684\u6574\u6570\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-integers-in-intervals/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 293 Problem 4"}, {"ID": 2277, "Title": "Closest Node to Path in Tree", "TitleCn": "\u6811\u4e2d\u6700\u63a5\u8fd1\u8def\u5f84\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/closest-node-to-path-in-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2278, "Title": "Percentage of Letter in String", "TitleCn": "\u5b57\u6bcd\u5728\u5b57\u7b26\u4e32\u4e2d\u7684\u767e\u5206\u6bd4", "Url": "https://leetcode.cn/problems/percentage-of-letter-in-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 294 Problem 1"}, {"ID": 2279, "Title": "Maximum Bags With Full Capacity of Rocks", "TitleCn": "\u88c5\u6ee1\u77f3\u5934\u7684\u80cc\u5305\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-bags-with-full-capacity-of-rocks/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 294 Problem 2"}, {"ID": 2280, "Title": "Minimum Lines to Represent a Line Chart", "TitleCn": "\u8868\u793a\u4e00\u4e2a\u6298\u7ebf\u56fe\u7684\u6700\u5c11\u7ebf\u6bb5\u6570", "Url": "https://leetcode.cn/problems/minimum-lines-to-represent-a-line-chart/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 294 Problem 3"}, {"ID": 2281, "Title": "Sum of Total Strength of Wizards", "TitleCn": "\u5deb\u5e08\u7684\u603b\u529b\u91cf\u548c", "Url": "https://leetcode.cn/problems/sum-of-total-strength-of-wizards/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 294 Problem 4"}, {"ID": 2282, "Title": "Number of People That Can Be Seen in a Grid", "TitleCn": "\u5728\u4e00\u4e2a\u7f51\u683c\u4e2d\u53ef\u4ee5\u770b\u5230\u7684\u4eba\u6570", "Url": "https://leetcode.cn/problems/number-of-people-that-can-be-seen-in-a-grid/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2283, "Title": "Check if Number Has Equal Digit Count and Digit Value", "TitleCn": "\u5224\u65ad\u4e00\u4e2a\u6570\u7684\u6570\u5b57\u8ba1\u6570\u662f\u5426\u7b49\u4e8e\u6570\u4f4d\u7684\u503c", "Url": "https://leetcode.cn/problems/check-if-number-has-equal-digit-count-and-digit-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 79 Problem 1"}, {"ID": 2284, "Title": "Sender With Largest Word Count", "TitleCn": "\u6700\u591a\u5355\u8bcd\u6570\u7684\u53d1\u4ef6\u4eba", "Url": "https://leetcode.cn/problems/sender-with-largest-word-count/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 79 Problem 2"}, {"ID": 2285, "Title": "Maximum Total Importance of Roads", "TitleCn": "\u9053\u8def\u7684\u6700\u5927\u603b\u91cd\u8981\u6027", "Url": "https://leetcode.cn/problems/maximum-total-importance-of-roads/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 79 Problem 3"}, {"ID": 2286, "Title": "Booking Concert Tickets in Groups", "TitleCn": "\u4ee5\u7ec4\u4e3a\u5355\u4f4d\u8ba2\u97f3\u4e50\u4f1a\u7684\u95e8\u7968", "Url": "https://leetcode.cn/problems/booking-concert-tickets-in-groups/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 79 Problem 4"}, {"ID": 2287, "Title": "Rearrange Characters to Make Target String", "TitleCn": "\u91cd\u6392\u5b57\u7b26\u5f62\u6210\u76ee\u6807\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/rearrange-characters-to-make-target-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 295 Problem 1"}, {"ID": 2288, "Title": "Apply Discount to Prices", "TitleCn": "\u4ef7\u683c\u51cf\u514d", "Url": "https://leetcode.cn/problems/apply-discount-to-prices/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 295 Problem 2"}, {"ID": 2289, "Title": "Steps to Make Array Non-decreasing", "TitleCn": "\u4f7f\u6570\u7ec4\u6309\u975e\u9012\u51cf\u987a\u5e8f\u6392\u5217", "Url": "https://leetcode.cn/problems/steps-to-make-array-non-decreasing/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 295 Problem 3"}, {"ID": 2290, "Title": "Minimum Obstacle Removal to Reach Corner", "TitleCn": "\u5230\u8fbe\u89d2\u843d\u9700\u8981\u79fb\u9664\u969c\u788d\u7269\u7684\u6700\u5c0f\u6570\u76ee", "Url": "https://leetcode.cn/problems/minimum-obstacle-removal-to-reach-corner/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 295 Problem 4"}, {"ID": 2291, "Title": "Maximum Profit From Trading Stocks", "TitleCn": "\u6700\u5927\u80a1\u7968\u6536\u76ca", "Url": "https://leetcode.cn/problems/maximum-profit-from-trading-stocks/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2292, "Title": "Products With Three or More Orders in Two Consecutive Years", "TitleCn": "\u8fde\u7eed\u4e24\u5e74\u6709 3 \u4e2a\u53ca\u4ee5\u4e0a\u8ba2\u5355\u7684\u4ea7\u54c1", "Url": "https://leetcode.cn/problems/products-with-three-or-more-orders-in-two-consecutive-years/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2293, "Title": "Min Max Game", "TitleCn": "\u6781\u5927\u6781\u5c0f\u6e38\u620f", "Url": "https://leetcode.cn/problems/min-max-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 296 Problem 1"}, {"ID": 2294, "Title": "Partition Array Such That Maximum Difference Is K", "TitleCn": "\u5212\u5206\u6570\u7ec4\u4f7f\u6700\u5927\u5dee\u4e3a K", "Url": "https://leetcode.cn/problems/partition-array-such-that-maximum-difference-is-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 296 Problem 2"}, {"ID": 2295, "Title": "Replace Elements in an Array", "TitleCn": "\u66ff\u6362\u6570\u7ec4\u4e2d\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/replace-elements-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 296 Problem 3"}, {"ID": 2296, "Title": "Design a Text Editor", "TitleCn": "\u8bbe\u8ba1\u4e00\u4e2a\u6587\u672c\u7f16\u8f91\u5668", "Url": "https://leetcode.cn/problems/design-a-text-editor/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 6, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 296 Problem 4"}, {"ID": 2297, "Title": "Jump Game VIII", "TitleCn": "\u8df3\u8dc3\u6e38\u620f VIII", "Url": "https://leetcode.cn/problems/jump-game-viii/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2298, "Title": "Tasks Count in the Weekend", "TitleCn": "\u5468\u672b\u4efb\u52a1\u8ba1\u6570", "Url": "https://leetcode.cn/problems/tasks-count-in-the-weekend/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2299, "Title": "Strong Password Checker II", "TitleCn": "\u5f3a\u5bc6\u7801\u68c0\u9a8c\u5668 II", "Url": "https://leetcode.cn/problems/strong-password-checker-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 80 Problem 1"}, {"ID": 2300, "Title": "Successful Pairs of Spells and Potions", "TitleCn": "\u5492\u8bed\u548c\u836f\u6c34\u7684\u6210\u529f\u5bf9\u6570", "Url": "https://leetcode.cn/problems/successful-pairs-of-spells-and-potions/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 80 Problem 2"}, {"ID": 2301, "Title": "Match Substring After Replacement", "TitleCn": "\u66ff\u6362\u5b57\u7b26\u540e\u5339\u914d", "Url": "https://leetcode.cn/problems/match-substring-after-replacement/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 80 Problem 3"}, {"ID": 2302, "Title": "Count Subarrays With Score Less Than K", "TitleCn": "\u7edf\u8ba1\u5f97\u5206\u5c0f\u4e8e K \u7684\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-subarrays-with-score-less-than-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 80 Problem 4"}, {"ID": 2303, "Title": "Calculate Amount Paid in Taxes", "TitleCn": "\u8ba1\u7b97\u5e94\u7f34\u7a0e\u6b3e\u603b\u989d", "Url": "https://leetcode.cn/problems/calculate-amount-paid-in-taxes/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 297 Problem 1"}, {"ID": 2304, "Title": "Minimum Path Cost in a Grid", "TitleCn": "\u7f51\u683c\u4e2d\u7684\u6700\u5c0f\u8def\u5f84\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-path-cost-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 297 Problem 2"}, {"ID": 2305, "Title": "Fair Distribution of Cookies", "TitleCn": "\u516c\u5e73\u5206\u53d1\u997c\u5e72", "Url": "https://leetcode.cn/problems/fair-distribution-of-cookies/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 297 Problem 3"}, {"ID": 2306, "Title": "Naming a Company", "TitleCn": "\u516c\u53f8\u547d\u540d", "Url": "https://leetcode.cn/problems/naming-a-company/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 297 Problem 4"}, {"ID": 2307, "Title": "Check for Contradictions in Equations", "TitleCn": "\u68c0\u67e5\u65b9\u7a0b\u4e2d\u7684\u77db\u76fe\u4e4b\u5904", "Url": "https://leetcode.cn/problems/check-for-contradictions-in-equations/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2308, "Title": "Arrange Table by Gender", "TitleCn": "\u6309\u6027\u522b\u6392\u5217\u8868\u683c", "Url": "https://leetcode.cn/problems/arrange-table-by-gender/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2309, "Title": "Greatest English Letter in Upper and Lower Case", "TitleCn": "\u517c\u5177\u5927\u5c0f\u5199\u7684\u6700\u597d\u82f1\u6587\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/greatest-english-letter-in-upper-and-lower-case/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 298 Problem 1"}, {"ID": 2310, "Title": "Sum of Numbers With Units Digit K", "TitleCn": "\u4e2a\u4f4d\u6570\u5b57\u4e3a K \u7684\u6574\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-numbers-with-units-digit-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 298 Problem 2"}, {"ID": 2311, "Title": "Longest Binary Subsequence Less Than or Equal to K", "TitleCn": "\u5c0f\u4e8e\u7b49\u4e8e K \u7684\u6700\u957f\u4e8c\u8fdb\u5236\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-binary-subsequence-less-than-or-equal-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 298 Problem 3"}, {"ID": 2312, "Title": "Selling Pieces of Wood", "TitleCn": "\u5356\u6728\u5934\u5757", "Url": "https://leetcode.cn/problems/selling-pieces-of-wood/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 298 Problem 4"}, {"ID": 2313, "Title": "Minimum Flips in Binary Tree to Get Result", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u5f97\u5230\u7ed3\u679c\u6240\u9700\u7684\u6700\u5c11\u7ffb\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-flips-in-binary-tree-to-get-result/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2314, "Title": "The First Day of the Maximum Recorded Degree in Each City", "TitleCn": "\u6bcf\u4e2a\u57ce\u5e02\u6700\u9ad8\u6c14\u6e29\u7684\u7b2c\u4e00\u5929", "Url": "https://leetcode.cn/problems/the-first-day-of-the-maximum-recorded-degree-in-each-city/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2315, "Title": "Count Asterisks", "TitleCn": "\u7edf\u8ba1\u661f\u53f7", "Url": "https://leetcode.cn/problems/count-asterisks/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 81 Problem 1"}, {"ID": 2316, "Title": "Count Unreachable Pairs of Nodes in an Undirected Graph", "TitleCn": "\u7edf\u8ba1\u65e0\u5411\u56fe\u4e2d\u65e0\u6cd5\u4e92\u76f8\u5230\u8fbe\u70b9\u5bf9\u6570", "Url": "https://leetcode.cn/problems/count-unreachable-pairs-of-nodes-in-an-undirected-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 81 Problem 2"}, {"ID": 2317, "Title": "Maximum XOR After Operations", "TitleCn": "\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5f02\u6216\u548c", "Url": "https://leetcode.cn/problems/maximum-xor-after-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 81 Problem 3"}, {"ID": 2318, "Title": "Number of Distinct Roll Sequences", "TitleCn": "\u4e0d\u540c\u9ab0\u5b50\u5e8f\u5217\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-distinct-roll-sequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 81 Problem 4"}, {"ID": 2319, "Title": "Check if Matrix Is X-Matrix", "TitleCn": "\u5224\u65ad\u77e9\u9635\u662f\u5426\u662f\u4e00\u4e2a X \u77e9\u9635", "Url": "https://leetcode.cn/problems/check-if-matrix-is-x-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 299 Problem 1"}, {"ID": 2320, "Title": "Count Number of Ways to Place Houses", "TitleCn": "\u7edf\u8ba1\u653e\u7f6e\u623f\u5b50\u7684\u65b9\u5f0f\u6570", "Url": "https://leetcode.cn/problems/count-number-of-ways-to-place-houses/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 299 Problem 2"}, {"ID": 2321, "Title": "Maximum Score Of Spliced Array", "TitleCn": "\u62fc\u63a5\u6570\u7ec4\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-score-of-spliced-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 299 Problem 3"}, {"ID": 2322, "Title": "Minimum Score After Removals on a Tree", "TitleCn": "\u4ece\u6811\u4e2d\u5220\u9664\u8fb9\u7684\u6700\u5c0f\u5206\u6570", "Url": "https://leetcode.cn/problems/minimum-score-after-removals-on-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 299 Problem 4"}, {"ID": 2323, "Title": "Find Minimum Time to Finish All Jobs II", "TitleCn": "\u5b8c\u6210\u6240\u6709\u5de5\u4f5c\u7684\u6700\u77ed\u65f6\u95f4 II", "Url": "https://leetcode.cn/problems/find-minimum-time-to-finish-all-jobs-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2324, "Title": "Product Sales Analysis IV", "TitleCn": "\u4ea7\u54c1\u9500\u552e\u5206\u6790 IV", "Url": "https://leetcode.cn/problems/product-sales-analysis-iv/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2325, "Title": "Decode the Message", "TitleCn": "\u89e3\u5bc6\u6d88\u606f", "Url": "https://leetcode.cn/problems/decode-the-message/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 300 Problem 1"}, {"ID": 2326, "Title": "Spiral Matrix IV", "TitleCn": "\u87ba\u65cb\u77e9\u9635 IV", "Url": "https://leetcode.cn/problems/spiral-matrix-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 300 Problem 2"}, {"ID": 2327, "Title": "Number of People Aware of a Secret", "TitleCn": "\u77e5\u9053\u79d8\u5bc6\u7684\u4eba\u6570", "Url": "https://leetcode.cn/problems/number-of-people-aware-of-a-secret/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 300 Problem 3"}, {"ID": 2328, "Title": "Number of Increasing Paths in a Grid", "TitleCn": "\u7f51\u683c\u56fe\u4e2d\u9012\u589e\u8def\u5f84\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-increasing-paths-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 300 Problem 4"}, {"ID": 2329, "Title": "Product Sales Analysis V", "TitleCn": "\u4ea7\u54c1\u9500\u552e\u5206\u6790\u2164", "Url": "https://leetcode.cn/problems/product-sales-analysis-v/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2330, "Title": "Valid Palindrome IV", "TitleCn": "\u9a8c\u8bc1\u56de\u6587\u4e32 IV", "Url": "https://leetcode.cn/problems/valid-palindrome-iv/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2331, "Title": "Evaluate Boolean Binary Tree", "TitleCn": "\u8ba1\u7b97\u5e03\u5c14\u4e8c\u53c9\u6811\u7684\u503c", "Url": "https://leetcode.cn/problems/evaluate-boolean-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 82 Problem 1"}, {"ID": 2332, "Title": "The Latest Time to Catch a Bus", "TitleCn": "\u5750\u4e0a\u516c\u4ea4\u7684\u6700\u665a\u65f6\u95f4", "Url": "https://leetcode.cn/problems/the-latest-time-to-catch-a-bus/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 82 Problem 2"}, {"ID": 2333, "Title": "Minimum Sum of Squared Difference", "TitleCn": "\u6700\u5c0f\u5dee\u503c\u5e73\u65b9\u548c", "Url": "https://leetcode.cn/problems/minimum-sum-of-squared-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 82 Problem 3"}, {"ID": 2334, "Title": "Subarray With Elements Greater Than Varying Threshold", "TitleCn": "\u5143\u7d20\u503c\u5927\u4e8e\u53d8\u5316\u9608\u503c\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/subarray-with-elements-greater-than-varying-threshold/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 82 Problem 4"}, {"ID": 2335, "Title": "Minimum Amount of Time to Fill Cups", "TitleCn": "\u88c5\u6ee1\u676f\u5b50\u9700\u8981\u7684\u6700\u77ed\u603b\u65f6\u957f", "Url": "https://leetcode.cn/problems/minimum-amount-of-time-to-fill-cups/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 301 Problem 1"}, {"ID": 2336, "Title": "Smallest Number in Infinite Set", "TitleCn": "\u65e0\u9650\u96c6\u4e2d\u7684\u6700\u5c0f\u6570\u5b57", "Url": "https://leetcode.cn/problems/smallest-number-in-infinite-set/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 301 Problem 2"}, {"ID": 2337, "Title": "Move Pieces to Obtain a String", "TitleCn": "\u79fb\u52a8\u7247\u6bb5\u5f97\u5230\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/move-pieces-to-obtain-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 301 Problem 3"}, {"ID": 2338, "Title": "Count the Number of Ideal Arrays", "TitleCn": "\u7edf\u8ba1\u7406\u60f3\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-ideal-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 301 Problem 4"}, {"ID": 2339, "Title": "All the Matches of the League", "TitleCn": "\u8054\u8d5b\u7684\u6240\u6709\u6bd4\u8d5b", "Url": "https://leetcode.cn/problems/all-the-matches-of-the-league/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2340, "Title": "Minimum Adjacent Swaps to Make a Valid Array", "TitleCn": "\u751f\u6210\u6709\u6548\u6570\u7ec4\u7684\u6700\u5c11\u4ea4\u6362\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-adjacent-swaps-to-make-a-valid-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2341, "Title": "Maximum Number of Pairs in Array", "TitleCn": "\u6570\u7ec4\u80fd\u5f62\u6210\u591a\u5c11\u6570\u5bf9", "Url": "https://leetcode.cn/problems/maximum-number-of-pairs-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 302 Problem 1"}, {"ID": 2342, "Title": "Max Sum of a Pair With Equal Sum of Digits", "TitleCn": "\u6570\u4f4d\u548c\u76f8\u7b49\u6570\u5bf9\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/max-sum-of-a-pair-with-equal-sum-of-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 302 Problem 2"}, {"ID": 2343, "Title": "Query Kth Smallest Trimmed Number", "TitleCn": "\u88c1\u526a\u6570\u5b57\u540e\u67e5\u8be2\u7b2c K \u5c0f\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/query-kth-smallest-trimmed-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 302 Problem 3"}, {"ID": 2344, "Title": "Minimum Deletions to Make Array Divisible", "TitleCn": "\u4f7f\u6570\u7ec4\u53ef\u4ee5\u88ab\u6574\u9664\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-deletions-to-make-array-divisible/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 302 Problem 4"}, {"ID": 2345, "Title": "Finding the Number of Visible Mountains", "TitleCn": "\u5bfb\u627e\u53ef\u89c1\u5c71\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/finding-the-number-of-visible-mountains/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2346, "Title": "Compute the Rank as a Percentage", "TitleCn": "\u4ee5\u767e\u5206\u6bd4\u8ba1\u7b97\u6392\u540d", "Url": "https://leetcode.cn/problems/compute-the-rank-as-a-percentage/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2347, "Title": "Best Poker Hand", "TitleCn": "\u6700\u597d\u7684\u6251\u514b\u624b\u724c", "Url": "https://leetcode.cn/problems/best-poker-hand/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 83 Problem 1"}, {"ID": 2348, "Title": "Number of Zero-Filled Subarrays", "TitleCn": "\u5168 0 \u5b50\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-zero-filled-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 83 Problem 2"}, {"ID": 2349, "Title": "Design a Number Container System", "TitleCn": "\u8bbe\u8ba1\u6570\u5b57\u5bb9\u5668\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-a-number-container-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 83 Problem 3"}, {"ID": 2350, "Title": "Shortest Impossible Sequence of Rolls", "TitleCn": "\u4e0d\u53ef\u80fd\u5f97\u5230\u7684\u6700\u77ed\u9ab0\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/shortest-impossible-sequence-of-rolls/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 83 Problem 4"}, {"ID": 2351, "Title": "First Letter to Appear Twice", "TitleCn": "\u7b2c\u4e00\u4e2a\u51fa\u73b0\u4e24\u6b21\u7684\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/first-letter-to-appear-twice/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 303 Problem 1"}, {"ID": 2352, "Title": "Equal Row and Column Pairs", "TitleCn": "\u76f8\u7b49\u884c\u5217\u5bf9", "Url": "https://leetcode.cn/problems/equal-row-and-column-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 303 Problem 2"}, {"ID": 2353, "Title": "Design a Food Rating System", "TitleCn": "\u8bbe\u8ba1\u98df\u7269\u8bc4\u5206\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-a-food-rating-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 303 Problem 3"}, {"ID": 2354, "Title": "Number of Excellent Pairs", "TitleCn": "\u4f18\u8d28\u6570\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-excellent-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 303 Problem 4"}, {"ID": 2355, "Title": "Maximum Number of Books You Can Take", "TitleCn": "\u4f60\u80fd\u62ff\u8d70\u7684\u6700\u5927\u56fe\u4e66\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-books-you-can-take/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2356, "Title": "Number of Unique Subjects Taught by Each Teacher", "TitleCn": "\u6bcf\u4f4d\u6559\u5e08\u6240\u6559\u6388\u7684\u79d1\u76ee\u79cd\u7c7b\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-unique-subjects-taught-by-each-teacher/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2357, "Title": "Make Array Zero by Subtracting Equal Amounts", "TitleCn": "\u4f7f\u6570\u7ec4\u4e2d\u6240\u6709\u5143\u7d20\u90fd\u7b49\u4e8e\u96f6", "Url": "https://leetcode.cn/problems/make-array-zero-by-subtracting-equal-amounts/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 304 Problem 1"}, {"ID": 2358, "Title": "Maximum Number of Groups Entering a Competition", "TitleCn": "\u5206\u7ec4\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-groups-entering-a-competition/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 304 Problem 2"}, {"ID": 2359, "Title": "Find Closest Node to Given Two Nodes", "TitleCn": "\u627e\u5230\u79bb\u7ed9\u5b9a\u4e24\u4e2a\u8282\u70b9\u6700\u8fd1\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-closest-node-to-given-two-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 304 Problem 3"}, {"ID": 2360, "Title": "Longest Cycle in a Graph", "TitleCn": "\u56fe\u4e2d\u7684\u6700\u957f\u73af", "Url": "https://leetcode.cn/problems/longest-cycle-in-a-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 304 Problem 4"}, {"ID": 2361, "Title": "Minimum Costs Using the Train Line", "TitleCn": "\u4e58\u5750\u706b\u8f66\u8def\u7ebf\u7684\u6700\u5c11\u8d39\u7528", "Url": "https://leetcode.cn/problems/minimum-costs-using-the-train-line/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2362, "Title": "Generate the Invoice", "TitleCn": "\u751f\u6210\u53d1\u7968", "Url": "https://leetcode.cn/problems/generate-the-invoice/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2363, "Title": "Merge Similar Items", "TitleCn": "\u5408\u5e76\u76f8\u4f3c\u7684\u7269\u54c1", "Url": "https://leetcode.cn/problems/merge-similar-items/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 84 Problem 1"}, {"ID": 2364, "Title": "Count Number of Bad Pairs", "TitleCn": "\u7edf\u8ba1\u574f\u6570\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-bad-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 84 Problem 2"}, {"ID": 2365, "Title": "Task Scheduler II", "TitleCn": "\u4efb\u52a1\u8c03\u5ea6\u5668 II", "Url": "https://leetcode.cn/problems/task-scheduler-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 84 Problem 3"}, {"ID": 2366, "Title": "Minimum Replacements to Sort the Array", "TitleCn": "\u5c06\u6570\u7ec4\u6392\u5e8f\u7684\u6700\u5c11\u66ff\u6362\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-replacements-to-sort-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 84 Problem 4"}, {"ID": 2367, "Title": "Number of Arithmetic Triplets", "TitleCn": "\u7b97\u672f\u4e09\u5143\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-arithmetic-triplets/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 305 Problem 1"}, {"ID": 2368, "Title": "Reachable Nodes With Restrictions", "TitleCn": "\u53d7\u9650\u6761\u4ef6\u4e0b\u53ef\u5230\u8fbe\u8282\u70b9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/reachable-nodes-with-restrictions/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 305 Problem 2"}, {"ID": 2369, "Title": "Check if There is a Valid Partition For The Array", "TitleCn": "\u68c0\u67e5\u6570\u7ec4\u662f\u5426\u5b58\u5728\u6709\u6548\u5212\u5206", "Url": "https://leetcode.cn/problems/check-if-there-is-a-valid-partition-for-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 305 Problem 3"}, {"ID": 2370, "Title": "Longest Ideal Subsequence", "TitleCn": "\u6700\u957f\u7406\u60f3\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-ideal-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 305 Problem 4"}, {"ID": 2371, "Title": "Minimize Maximum Value in a Grid", "TitleCn": "\u6700\u5c0f\u5316\u7f51\u683c\u4e2d\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/minimize-maximum-value-in-a-grid/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2372, "Title": "Calculate the Influence of Each Salesperson", "TitleCn": "\u8ba1\u7b97\u6bcf\u4e2a\u9500\u552e\u4eba\u5458\u7684\u5f71\u54cd\u529b", "Url": "https://leetcode.cn/problems/calculate-the-influence-of-each-salesperson/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2373, "Title": "Largest Local Values in a Matrix", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u5c40\u90e8\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/largest-local-values-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 306 Problem 1"}, {"ID": 2374, "Title": "Node With Highest Edge Score", "TitleCn": "\u8fb9\u79ef\u5206\u6700\u9ad8\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/node-with-highest-edge-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 306 Problem 2"}, {"ID": 2375, "Title": "Construct Smallest Number From DI String", "TitleCn": "\u6839\u636e\u6a21\u5f0f\u4e32\u6784\u9020\u6700\u5c0f\u6570\u5b57", "Url": "https://leetcode.cn/problems/construct-smallest-number-from-di-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 306 Problem 3"}, {"ID": 2376, "Title": "Count Special Integers", "TitleCn": "\u7edf\u8ba1\u7279\u6b8a\u6574\u6570", "Url": "https://leetcode.cn/problems/count-special-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 306 Problem 4"}, {"ID": 2377, "Title": "Sort the Olympic Table", "TitleCn": "\u6574\u7406\u5965\u8fd0\u8868", "Url": "https://leetcode.cn/problems/sort-the-olympic-table/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2378, "Title": "Choose Edges to Maximize Score in a Tree", "TitleCn": "\u9009\u62e9\u8fb9\u6765\u6700\u5927\u5316\u6811\u7684\u5f97\u5206", "Url": "https://leetcode.cn/problems/choose-edges-to-maximize-score-in-a-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2379, "Title": "Minimum Recolors to Get K Consecutive Black Blocks", "TitleCn": "\u5f97\u5230 K \u4e2a\u9ed1\u5757\u7684\u6700\u5c11\u6d82\u8272\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-recolors-to-get-k-consecutive-black-blocks/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 85 Problem 1"}, {"ID": 2380, "Title": "Time Needed to Rearrange a Binary String", "TitleCn": "\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u91cd\u65b0\u5b89\u6392\u987a\u5e8f\u9700\u8981\u7684\u65f6\u95f4", "Url": "https://leetcode.cn/problems/time-needed-to-rearrange-a-binary-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 9, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 85 Problem 2"}, {"ID": 2381, "Title": "Shifting Letters II", "TitleCn": "\u5b57\u6bcd\u79fb\u4f4d II", "Url": "https://leetcode.cn/problems/shifting-letters-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 85 Problem 3"}, {"ID": 2382, "Title": "Maximum Segment Sum After Removals", "TitleCn": "\u5220\u9664\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5b50\u6bb5\u548c", "Url": "https://leetcode.cn/problems/maximum-segment-sum-after-removals/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 85 Problem 4"}, {"ID": 2383, "Title": "Minimum Hours of Training to Win a Competition", "TitleCn": "\u8d62\u5f97\u6bd4\u8d5b\u9700\u8981\u7684\u6700\u5c11\u8bad\u7ec3\u65f6\u957f", "Url": "https://leetcode.cn/problems/minimum-hours-of-training-to-win-a-competition/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 307 Problem 1"}, {"ID": 2384, "Title": "Largest Palindromic Number", "TitleCn": "\u6700\u5927\u56de\u6587\u6570\u5b57", "Url": "https://leetcode.cn/problems/largest-palindromic-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 307 Problem 2"}, {"ID": 2385, "Title": "Amount of Time for Binary Tree to Be Infected", "TitleCn": "\u611f\u67d3\u4e8c\u53c9\u6811\u9700\u8981\u7684\u603b\u65f6\u95f4", "Url": "https://leetcode.cn/problems/amount-of-time-for-binary-tree-to-be-infected/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 307 Problem 3"}, {"ID": 2386, "Title": "Find the K-Sum of an Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u7684\u7b2c K \u5927\u548c", "Url": "https://leetcode.cn/problems/find-the-k-sum-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 307 Problem 4"}, {"ID": 2387, "Title": "Median of a Row Wise Sorted Matrix", "TitleCn": "\u884c\u6392\u5e8f\u77e9\u9635\u7684\u4e2d\u4f4d\u6570", "Url": "https://leetcode.cn/problems/median-of-a-row-wise-sorted-matrix/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2388, "Title": "Change Null Values in a Table to the Previous Value", "TitleCn": "\u5c06\u8868\u4e2d\u7684\u7a7a\u503c\u66f4\u6539\u4e3a\u524d\u4e00\u4e2a\u503c", "Url": "https://leetcode.cn/problems/change-null-values-in-a-table-to-the-previous-value/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2389, "Title": "Longest Subsequence With Limited Sum", "TitleCn": "\u548c\u6709\u9650\u7684\u6700\u957f\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-subsequence-with-limited-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 308 Problem 1"}, {"ID": 2390, "Title": "Removing Stars From a String", "TitleCn": "\u4ece\u5b57\u7b26\u4e32\u4e2d\u79fb\u9664\u661f\u53f7", "Url": "https://leetcode.cn/problems/removing-stars-from-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 308 Problem 2"}, {"ID": 2391, "Title": "Minimum Amount of Time to Collect Garbage", "TitleCn": "\u6536\u96c6\u5783\u573e\u7684\u6700\u5c11\u603b\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-amount-of-time-to-collect-garbage/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 308 Problem 3"}, {"ID": 2392, "Title": "Build a Matrix With Conditions", "TitleCn": "\u7ed9\u5b9a\u6761\u4ef6\u4e0b\u6784\u9020\u77e9\u9635", "Url": "https://leetcode.cn/problems/build-a-matrix-with-conditions/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 308 Problem 4"}, {"ID": 2393, "Title": "Count Strictly Increasing Subarrays", "TitleCn": "\u4e25\u683c\u9012\u589e\u7684\u5b50\u6570\u7ec4\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-strictly-increasing-subarrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2394, "Title": "Employees With Deductions", "TitleCn": "\u5f00\u9664\u5458\u5de5", "Url": "https://leetcode.cn/problems/employees-with-deductions/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2395, "Title": "Find Subarrays With Equal Sum", "TitleCn": "\u548c\u76f8\u7b49\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-subarrays-with-equal-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 86 Problem 1"}, {"ID": 2396, "Title": "Strictly Palindromic Number", "TitleCn": "\u4e25\u683c\u56de\u6587\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/strictly-palindromic-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 86 Problem 2"}, {"ID": 2397, "Title": "Maximum Rows Covered by Columns", "TitleCn": "\u88ab\u5217\u8986\u76d6\u7684\u6700\u591a\u884c\u6570", "Url": "https://leetcode.cn/problems/maximum-rows-covered-by-columns/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 86 Problem 3"}, {"ID": 2398, "Title": "Maximum Number of Robots Within Budget", "TitleCn": "\u9884\u7b97\u5185\u7684\u6700\u591a\u673a\u5668\u4eba\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-robots-within-budget/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 86 Problem 4"}, {"ID": 2399, "Title": "Check Distances Between Same Letters", "TitleCn": "\u68c0\u67e5\u76f8\u540c\u5b57\u6bcd\u95f4\u7684\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/check-distances-between-same-letters/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 309 Problem 1"}, {"ID": 2400, "Title": "Number of Ways to Reach a Position After Exactly k Steps", "TitleCn": "\u6070\u597d\u79fb\u52a8 k \u6b65\u5230\u8fbe\u67d0\u4e00\u4f4d\u7f6e\u7684\u65b9\u6cd5\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-ways-to-reach-a-position-after-exactly-k-steps/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 309 Problem 2"}, {"ID": 2401, "Title": "Longest Nice Subarray", "TitleCn": "\u6700\u957f\u4f18\u96c5\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-nice-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 309 Problem 3"}, {"ID": 2402, "Title": "Meeting Rooms III", "TitleCn": "\u4f1a\u8bae\u5ba4 III", "Url": "https://leetcode.cn/problems/meeting-rooms-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 309 Problem 4"}, {"ID": 2403, "Title": "Minimum Time to Kill All Monsters", "TitleCn": "\u6740\u6b7b\u6240\u6709\u602a\u7269\u7684\u6700\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-kill-all-monsters/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2404, "Title": "Most Frequent Even Element", "TitleCn": "\u51fa\u73b0\u6700\u9891\u7e41\u7684\u5076\u6570\u5143\u7d20", "Url": "https://leetcode.cn/problems/most-frequent-even-element/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 310 Problem 1"}, {"ID": 2405, "Title": "Optimal Partition of String", "TitleCn": "\u5b50\u5b57\u7b26\u4e32\u7684\u6700\u4f18\u5212\u5206", "Url": "https://leetcode.cn/problems/optimal-partition-of-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 310 Problem 2"}, {"ID": 2406, "Title": "Divide Intervals Into Minimum Number of Groups", "TitleCn": "\u5c06\u533a\u95f4\u5206\u4e3a\u6700\u5c11\u7ec4\u6570", "Url": "https://leetcode.cn/problems/divide-intervals-into-minimum-number-of-groups/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 310 Problem 3"}, {"ID": 2407, "Title": "Longest Increasing Subsequence II", "TitleCn": "\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217 II", "Url": "https://leetcode.cn/problems/longest-increasing-subsequence-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 310 Problem 4"}, {"ID": 2408, "Title": "Design SQL", "TitleCn": "\u8bbe\u8ba1 SQL", "Url": "https://leetcode.cn/problems/design-sql/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2409, "Title": "Count Days Spent Together", "TitleCn": "\u7edf\u8ba1\u5171\u540c\u5ea6\u8fc7\u7684\u65e5\u5b50\u6570", "Url": "https://leetcode.cn/problems/count-days-spent-together/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 87 Problem 1"}, {"ID": 2410, "Title": "Maximum Matching of Players With Trainers", "TitleCn": "\u8fd0\u52a8\u5458\u548c\u8bad\u7ec3\u5e08\u7684\u6700\u5927\u5339\u914d\u6570", "Url": "https://leetcode.cn/problems/maximum-matching-of-players-with-trainers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 87 Problem 2"}, {"ID": 2411, "Title": "Smallest Subarrays With Maximum Bitwise OR", "TitleCn": "\u6309\u4f4d\u6216\u6700\u5927\u7684\u6700\u5c0f\u5b50\u6570\u7ec4\u957f\u5ea6", "Url": "https://leetcode.cn/problems/smallest-subarrays-with-maximum-bitwise-or/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 87 Problem 3"}, {"ID": 2412, "Title": "Minimum Money Required Before Transactions", "TitleCn": "\u5b8c\u6210\u6240\u6709\u4ea4\u6613\u7684\u521d\u59cb\u6700\u5c11\u94b1\u6570", "Url": "https://leetcode.cn/problems/minimum-money-required-before-transactions/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 87 Problem 4"}, {"ID": 2413, "Title": "Smallest Even Multiple", "TitleCn": "\u6700\u5c0f\u5076\u500d\u6570", "Url": "https://leetcode.cn/problems/smallest-even-multiple/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 311 Problem 1"}, {"ID": 2414, "Title": "Length of the Longest Alphabetical Continuous Substring", "TitleCn": "\u6700\u957f\u7684\u5b57\u6bcd\u5e8f\u8fde\u7eed\u5b50\u5b57\u7b26\u4e32\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/length-of-the-longest-alphabetical-continuous-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 311 Problem 2"}, {"ID": 2415, "Title": "Reverse Odd Levels of Binary Tree", "TitleCn": "\u53cd\u8f6c\u4e8c\u53c9\u6811\u7684\u5947\u6570\u5c42", "Url": "https://leetcode.cn/problems/reverse-odd-levels-of-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 311 Problem 3"}, {"ID": 2416, "Title": "Sum of Prefix Scores of Strings", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u524d\u7f00\u5206\u6570\u548c", "Url": "https://leetcode.cn/problems/sum-of-prefix-scores-of-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 311 Problem 4"}, {"ID": 2417, "Title": "Closest Fair Integer", "TitleCn": "\u6700\u8fd1\u7684\u516c\u5e73\u6574\u6570", "Url": "https://leetcode.cn/problems/closest-fair-integer/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2418, "Title": "Sort the People", "TitleCn": "\u6309\u8eab\u9ad8\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-the-people/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 312 Problem 1"}, {"ID": 2419, "Title": "Longest Subarray With Maximum Bitwise AND", "TitleCn": "\u6309\u4f4d\u4e0e\u6700\u5927\u7684\u6700\u957f\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-subarray-with-maximum-bitwise-and/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 312 Problem 2"}, {"ID": 2420, "Title": "Find All Good Indices", "TitleCn": "\u627e\u5230\u6240\u6709\u597d\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-all-good-indices/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 312 Problem 3"}, {"ID": 2421, "Title": "Number of Good Paths", "TitleCn": "\u597d\u8def\u5f84\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-good-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 312 Problem 4"}, {"ID": 2422, "Title": "Merge Operations to Turn Array Into a Palindrome", "TitleCn": "\u4f7f\u7528\u5408\u5e76\u64cd\u4f5c\u5c06\u6570\u7ec4\u8f6c\u6362\u4e3a\u56de\u6587\u5e8f\u5217", "Url": "https://leetcode.cn/problems/merge-operations-to-turn-array-into-a-palindrome/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2423, "Title": "Remove Letter To Equalize Frequency", "TitleCn": "\u5220\u9664\u5b57\u7b26\u4f7f\u9891\u7387\u76f8\u540c", "Url": "https://leetcode.cn/problems/remove-letter-to-equalize-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 88 Problem 1"}, {"ID": 2424, "Title": "Longest Uploaded Prefix", "TitleCn": "\u6700\u957f\u4e0a\u4f20\u524d\u7f00", "Url": "https://leetcode.cn/problems/longest-uploaded-prefix/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 88 Problem 2"}, {"ID": 2425, "Title": "Bitwise XOR of All Pairings", "TitleCn": "\u6240\u6709\u6570\u5bf9\u7684\u5f02\u6216\u548c", "Url": "https://leetcode.cn/problems/bitwise-xor-of-all-pairings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 88 Problem 3"}, {"ID": 2426, "Title": "Number of Pairs Satisfying Inequality", "TitleCn": "\u6ee1\u8db3\u4e0d\u7b49\u5f0f\u7684\u6570\u5bf9\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-pairs-satisfying-inequality/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 88 Problem 4"}, {"ID": 2427, "Title": "Number of Common Factors", "TitleCn": "\u516c\u56e0\u5b50\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-common-factors/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 313 Problem 1"}, {"ID": 2428, "Title": "Maximum Sum of an Hourglass", "TitleCn": "\u6c99\u6f0f\u7684\u6700\u5927\u603b\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-of-an-hourglass/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 313 Problem 2"}, {"ID": 2429, "Title": "Minimize XOR", "TitleCn": "\u6700\u5c0f\u5f02\u6216", "Url": "https://leetcode.cn/problems/minimize-xor/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 313 Problem 3"}, {"ID": 2430, "Title": "Maximum Deletions on a String", "TitleCn": "\u5bf9\u5b57\u6bcd\u4e32\u53ef\u6267\u884c\u7684\u6700\u5927\u5220\u9664\u6570", "Url": "https://leetcode.cn/problems/maximum-deletions-on-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 313 Problem 4"}, {"ID": 2431, "Title": "Maximize Total Tastiness of Purchased Fruits", "TitleCn": "\u6700\u5927\u9650\u5ea6\u5730\u63d0\u9ad8\u8d2d\u4e70\u6c34\u679c\u7684\u53e3\u5473", "Url": "https://leetcode.cn/problems/maximize-total-tastiness-of-purchased-fruits/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2432, "Title": "The Employee That Worked on the Longest Task", "TitleCn": "\u5904\u7406\u7528\u65f6\u6700\u957f\u7684\u90a3\u4e2a\u4efb\u52a1\u7684\u5458\u5de5", "Url": "https://leetcode.cn/problems/the-employee-that-worked-on-the-longest-task/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 314 Problem 1"}, {"ID": 2433, "Title": "Find The Original Array of Prefix Xor", "TitleCn": "\u627e\u51fa\u524d\u7f00\u5f02\u6216\u7684\u539f\u59cb\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-the-original-array-of-prefix-xor/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 314 Problem 2"}, {"ID": 2434, "Title": "Using a Robot to Print the Lexicographically Smallest String", "TitleCn": "\u4f7f\u7528\u673a\u5668\u4eba\u6253\u5370\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/using-a-robot-to-print-the-lexicographically-smallest-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 314 Problem 3"}, {"ID": 2435, "Title": "Paths in Matrix Whose Sum Is Divisible by K", "TitleCn": "\u77e9\u9635\u4e2d\u548c\u80fd\u88ab K \u6574\u9664\u7684\u8def\u5f84", "Url": "https://leetcode.cn/problems/paths-in-matrix-whose-sum-is-divisible-by-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 314 Problem 4"}, {"ID": 2436, "Title": "Minimum Split Into Subarrays With GCD Greater Than One", "TitleCn": "\u4f7f\u5b50\u6570\u7ec4\u6700\u5927\u516c\u7ea6\u6570\u5927\u4e8e\u4e00\u7684\u6700\u5c0f\u5206\u5272\u6570", "Url": "https://leetcode.cn/problems/minimum-split-into-subarrays-with-gcd-greater-than-one/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2437, "Title": "Number of Valid Clock Times", "TitleCn": "\u6709\u6548\u65f6\u95f4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-valid-clock-times/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 89 Problem 1"}, {"ID": 2438, "Title": "Range Product Queries of Powers", "TitleCn": "\u4e8c\u7684\u5e42\u6570\u7ec4\u4e2d\u67e5\u8be2\u8303\u56f4\u5185\u7684\u4e58\u79ef", "Url": "https://leetcode.cn/problems/range-product-queries-of-powers/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 89 Problem 2"}, {"ID": 2439, "Title": "Minimize Maximum of Array", "TitleCn": "\u6700\u5c0f\u5316\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/minimize-maximum-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 89 Problem 3"}, {"ID": 2440, "Title": "Create Components With Same Value", "TitleCn": "\u521b\u5efa\u4ef7\u503c\u76f8\u540c\u7684\u8fde\u901a\u5757", "Url": "https://leetcode.cn/problems/create-components-with-same-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 89 Problem 4"}, {"ID": 2441, "Title": "Largest Positive Integer That Exists With Its Negative", "TitleCn": "\u4e0e\u5bf9\u5e94\u8d1f\u6570\u540c\u65f6\u5b58\u5728\u7684\u6700\u5927\u6b63\u6574\u6570", "Url": "https://leetcode.cn/problems/largest-positive-integer-that-exists-with-its-negative/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 315 Problem 1"}, {"ID": 2442, "Title": "Count Number of Distinct Integers After Reverse Operations", "TitleCn": "\u53cd\u8f6c\u4e4b\u540e\u4e0d\u540c\u6574\u6570\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-distinct-integers-after-reverse-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 315 Problem 2"}, {"ID": 2443, "Title": "Sum of Number and Its Reverse", "TitleCn": "\u53cd\u8f6c\u4e4b\u540e\u7684\u6570\u5b57\u548c", "Url": "https://leetcode.cn/problems/sum-of-number-and-its-reverse/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 315 Problem 3"}, {"ID": 2444, "Title": "Count Subarrays With Fixed Bounds", "TitleCn": "\u7edf\u8ba1\u5b9a\u754c\u5b50\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-subarrays-with-fixed-bounds/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 315 Problem 4"}, {"ID": 2445, "Title": "Number of Nodes With Value One", "TitleCn": "\u503c\u4e3a 1 \u7684\u8282\u70b9\u6570", "Url": "https://leetcode.cn/problems/number-of-nodes-with-value-one/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2446, "Title": "Determine if Two Events Have Conflict", "TitleCn": "\u5224\u65ad\u4e24\u4e2a\u4e8b\u4ef6\u662f\u5426\u5b58\u5728\u51b2\u7a81", "Url": "https://leetcode.cn/problems/determine-if-two-events-have-conflict/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 316 Problem 1"}, {"ID": 2447, "Title": "Number of Subarrays With GCD Equal to K", "TitleCn": "\u6700\u5927\u516c\u56e0\u6570\u7b49\u4e8e K \u7684\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-subarrays-with-gcd-equal-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 316 Problem 2"}, {"ID": 2448, "Title": "Minimum Cost to Make Array Equal", "TitleCn": "\u4f7f\u6570\u7ec4\u76f8\u7b49\u7684\u6700\u5c0f\u5f00\u9500", "Url": "https://leetcode.cn/problems/minimum-cost-to-make-array-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 316 Problem 3"}, {"ID": 2449, "Title": "Minimum Number of Operations to Make Arrays Similar", "TitleCn": "\u4f7f\u6570\u7ec4\u76f8\u4f3c\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-arrays-similar/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 316 Problem 4"}, {"ID": 2450, "Title": "Number of Distinct Binary Strings After Applying Operations", "TitleCn": "\u5e94\u7528\u64cd\u4f5c\u540e\u4e0d\u540c\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-distinct-binary-strings-after-applying-operations/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2451, "Title": "Odd String Difference", "TitleCn": "\u5dee\u503c\u6570\u7ec4\u4e0d\u540c\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/odd-string-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 90 Problem 1"}, {"ID": 2452, "Title": "Words Within Two Edits of Dictionary", "TitleCn": "\u8ddd\u79bb\u5b57\u5178\u4e24\u6b21\u7f16\u8f91\u4ee5\u5185\u7684\u5355\u8bcd", "Url": "https://leetcode.cn/problems/words-within-two-edits-of-dictionary/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 90 Problem 2"}, {"ID": 2453, "Title": "Destroy Sequential Targets", "TitleCn": "\u6467\u6bc1\u4e00\u7cfb\u5217\u76ee\u6807", "Url": "https://leetcode.cn/problems/destroy-sequential-targets/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 90 Problem 3"}, {"ID": 2454, "Title": "Next Greater Element IV", "TitleCn": "\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 IV", "Url": "https://leetcode.cn/problems/next-greater-element-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 90 Problem 4"}, {"ID": 2455, "Title": "Average Value of Even Numbers That Are Divisible by Three", "TitleCn": "\u53ef\u88ab\u4e09\u6574\u9664\u7684\u5076\u6570\u7684\u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/average-value-of-even-numbers-that-are-divisible-by-three/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 317 Problem 1"}, {"ID": 2456, "Title": "Most Popular Video Creator", "TitleCn": "\u6700\u6d41\u884c\u7684\u89c6\u9891\u521b\u4f5c\u8005", "Url": "https://leetcode.cn/problems/most-popular-video-creator/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 317 Problem 2"}, {"ID": 2457, "Title": "Minimum Addition to Make Integer Beautiful", "TitleCn": "\u7f8e\u4e3d\u6574\u6570\u7684\u6700\u5c0f\u589e\u91cf", "Url": "https://leetcode.cn/problems/minimum-addition-to-make-integer-beautiful/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 317 Problem 3"}, {"ID": 2458, "Title": "Height of Binary Tree After Subtree Removal Queries", "TitleCn": "\u79fb\u9664\u5b50\u6811\u540e\u7684\u4e8c\u53c9\u6811\u9ad8\u5ea6", "Url": "https://leetcode.cn/problems/height-of-binary-tree-after-subtree-removal-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 317 Problem 4"}, {"ID": 2459, "Title": "Sort Array by Moving Items to Empty Space", "TitleCn": "\u901a\u8fc7\u79fb\u52a8\u9879\u76ee\u5230\u7a7a\u767d\u533a\u57df\u6765\u6392\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/sort-array-by-moving-items-to-empty-space/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2460, "Title": "Apply Operations to an Array", "TitleCn": "\u5bf9\u6570\u7ec4\u6267\u884c\u64cd\u4f5c", "Url": "https://leetcode.cn/problems/apply-operations-to-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 318 Problem 1"}, {"ID": 2461, "Title": "Maximum Sum of Distinct Subarrays With Length K", "TitleCn": "\u957f\u5ea6\u4e3a K \u5b50\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-of-distinct-subarrays-with-length-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 318 Problem 2"}, {"ID": 2462, "Title": "Total Cost to Hire K Workers", "TitleCn": "\u96c7\u4f63 K \u4f4d\u5de5\u4eba\u7684\u603b\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/total-cost-to-hire-k-workers/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 318 Problem 3"}, {"ID": 2463, "Title": "Minimum Total Distance Traveled", "TitleCn": "\u6700\u5c0f\u79fb\u52a8\u603b\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/minimum-total-distance-traveled/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 318 Problem 4"}, {"ID": 2464, "Title": "Minimum Subarrays in a Valid Split", "TitleCn": "\u6709\u6548\u5206\u5272\u4e2d\u7684\u6700\u5c11\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/minimum-subarrays-in-a-valid-split/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2465, "Title": "Number of Distinct Averages", "TitleCn": "\u4e0d\u540c\u7684\u5e73\u5747\u503c\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-distinct-averages/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 91 Problem 1"}, {"ID": 2466, "Title": "Count Ways To Build Good Strings", "TitleCn": "\u7edf\u8ba1\u6784\u9020\u597d\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/count-ways-to-build-good-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 91 Problem 2"}, {"ID": 2467, "Title": "Most Profitable Path in a Tree", "TitleCn": "\u6811\u4e0a\u6700\u5927\u5f97\u5206\u548c\u8def\u5f84", "Url": "https://leetcode.cn/problems/most-profitable-path-in-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 91 Problem 3"}, {"ID": 2468, "Title": "Split Message Based on Limit", "TitleCn": "\u6839\u636e\u9650\u5236\u5206\u5272\u6d88\u606f", "Url": "https://leetcode.cn/problems/split-message-based-on-limit/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 91 Problem 4"}, {"ID": 2469, "Title": "Convert the Temperature", "TitleCn": "\u6e29\u5ea6\u8f6c\u6362", "Url": "https://leetcode.cn/problems/convert-the-temperature/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 319 Problem 1"}, {"ID": 2470, "Title": "Number of Subarrays With LCM Equal to K", "TitleCn": "\u6700\u5c0f\u516c\u500d\u6570\u7b49\u4e8e K \u7684\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-subarrays-with-lcm-equal-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 319 Problem 2"}, {"ID": 2471, "Title": "Minimum Number of Operations to Sort a Binary Tree by Level", "TitleCn": "\u9010\u5c42\u6392\u5e8f\u4e8c\u53c9\u6811\u6240\u9700\u7684\u6700\u5c11\u64cd\u4f5c\u6570\u76ee", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 319 Problem 3"}, {"ID": 2472, "Title": "Maximum Number of Non-overlapping Palindrome Substrings", "TitleCn": "\u4e0d\u91cd\u53e0\u56de\u6587\u5b50\u5b57\u7b26\u4e32\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-non-overlapping-palindrome-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 319 Problem 4"}, {"ID": 2473, "Title": "Minimum Cost to Buy Apples", "TitleCn": "\u8d2d\u4e70\u82f9\u679c\u7684\u6700\u4f4e\u6210\u672c", "Url": "https://leetcode.cn/problems/minimum-cost-to-buy-apples/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2474, "Title": "Customers With Strictly Increasing Purchases", "TitleCn": "\u8d2d\u4e70\u91cf\u4e25\u683c\u589e\u52a0\u7684\u5ba2\u6237", "Url": "https://leetcode.cn/problems/customers-with-strictly-increasing-purchases/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2475, "Title": "Number of Unequal Triplets in Array", "TitleCn": "\u6570\u7ec4\u4e2d\u4e0d\u7b49\u4e09\u5143\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-unequal-triplets-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 320 Problem 1"}, {"ID": 2476, "Title": "Closest Nodes Queries in a Binary Search Tree", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u6700\u8fd1\u8282\u70b9\u67e5\u8be2", "Url": "https://leetcode.cn/problems/closest-nodes-queries-in-a-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 320 Problem 2"}, {"ID": 2477, "Title": "Minimum Fuel Cost to Report to the Capital", "TitleCn": "\u5230\u8fbe\u9996\u90fd\u7684\u6700\u5c11\u6cb9\u8017", "Url": "https://leetcode.cn/problems/minimum-fuel-cost-to-report-to-the-capital/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 320 Problem 3"}, {"ID": 2478, "Title": "Number of Beautiful Partitions", "TitleCn": "\u5b8c\u7f8e\u5206\u5272\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-beautiful-partitions/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 320 Problem 4"}, {"ID": 2479, "Title": "Maximum XOR of Two Non-Overlapping Subtrees", "TitleCn": "\u4e24\u4e2a\u4e0d\u91cd\u53e0\u5b50\u6811\u7684\u6700\u5927\u5f02\u6216\u503c", "Url": "https://leetcode.cn/problems/maximum-xor-of-two-non-overlapping-subtrees/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2480, "Title": "Form a Chemical Bond", "TitleCn": "\u5f62\u6210\u5316\u5b66\u952e", "Url": "https://leetcode.cn/problems/form-a-chemical-bond/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2481, "Title": "Minimum Cuts to Divide a Circle", "TitleCn": "\u5206\u5272\u5706\u7684\u6700\u5c11\u5207\u5272\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-cuts-to-divide-a-circle/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 92 Problem 1"}, {"ID": 2482, "Title": "Difference Between Ones and Zeros in Row and Column", "TitleCn": "\u884c\u548c\u5217\u4e2d\u4e00\u548c\u96f6\u7684\u5dee\u503c", "Url": "https://leetcode.cn/problems/difference-between-ones-and-zeros-in-row-and-column/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 92 Problem 2"}, {"ID": 2483, "Title": "Minimum Penalty for a Shop", "TitleCn": "\u5546\u5e97\u7684\u6700\u5c11\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-penalty-for-a-shop/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 92 Problem 3"}, {"ID": 2484, "Title": "Count Palindromic Subsequences", "TitleCn": "\u7edf\u8ba1\u56de\u6587\u5b50\u5e8f\u5217\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-palindromic-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 92 Problem 4"}, {"ID": 2485, "Title": "Find the Pivot Integer", "TitleCn": "\u627e\u51fa\u4e2d\u67a2\u6574\u6570", "Url": "https://leetcode.cn/problems/find-the-pivot-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 321 Problem 1"}, {"ID": 2486, "Title": "Append Characters to String to Make Subsequence", "TitleCn": "\u8ffd\u52a0\u5b57\u7b26\u4ee5\u83b7\u5f97\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/append-characters-to-string-to-make-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 321 Problem 2"}, {"ID": 2487, "Title": "Remove Nodes From Linked List", "TitleCn": "\u4ece\u94fe\u8868\u4e2d\u79fb\u9664\u8282\u70b9", "Url": "https://leetcode.cn/problems/remove-nodes-from-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 321 Problem 3"}, {"ID": 2488, "Title": "Count Subarrays With Median K", "TitleCn": "\u7edf\u8ba1\u4e2d\u4f4d\u6570\u4e3a K \u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/count-subarrays-with-median-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 321 Problem 4"}, {"ID": 2489, "Title": "Number of Substrings With Fixed Ratio", "TitleCn": "\u56fa\u5b9a\u6bd4\u7387\u7684\u5b50\u5b57\u7b26\u4e32\u6570", "Url": "https://leetcode.cn/problems/number-of-substrings-with-fixed-ratio/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2490, "Title": "Circular Sentence", "TitleCn": "\u56de\u73af\u53e5", "Url": "https://leetcode.cn/problems/circular-sentence/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 322 Problem 1"}, {"ID": 2491, "Title": "Divide Players Into Teams of Equal Skill", "TitleCn": "\u5212\u5206\u6280\u80fd\u70b9\u76f8\u7b49\u7684\u56e2\u961f", "Url": "https://leetcode.cn/problems/divide-players-into-teams-of-equal-skill/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 322 Problem 2"}, {"ID": 2492, "Title": "Minimum Score of a Path Between Two Cities", "TitleCn": "\u4e24\u4e2a\u57ce\u5e02\u95f4\u8def\u5f84\u7684\u6700\u5c0f\u5206\u6570", "Url": "https://leetcode.cn/problems/minimum-score-of-a-path-between-two-cities/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 322 Problem 3"}, {"ID": 2493, "Title": "Divide Nodes Into the Maximum Number of Groups", "TitleCn": "\u5c06\u8282\u70b9\u5206\u6210\u5c3d\u53ef\u80fd\u591a\u7684\u7ec4", "Url": "https://leetcode.cn/problems/divide-nodes-into-the-maximum-number-of-groups/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 322 Problem 4"}, {"ID": 2494, "Title": "Merge Overlapping Events in the Same Hall", "TitleCn": "\u5408\u5e76\u5728\u540c\u4e00\u4e2a\u5927\u5385\u91cd\u53e0\u7684\u6d3b\u52a8", "Url": "https://leetcode.cn/problems/merge-overlapping-events-in-the-same-hall/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2495, "Title": "Number of Subarrays Having Even Product", "TitleCn": "\u79ef\u662f\u5076\u6570\u7684\u5b50\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-subarrays-having-even-product/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2496, "Title": "Maximum Value of a String in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u5b57\u7b26\u4e32\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/maximum-value-of-a-string-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 93 Problem 1"}, {"ID": 2497, "Title": "Maximum Star Sum of a Graph", "TitleCn": "\u56fe\u4e2d\u6700\u5927\u661f\u548c", "Url": "https://leetcode.cn/problems/maximum-star-sum-of-a-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 93 Problem 2"}, {"ID": 2498, "Title": "Frog Jump II", "TitleCn": "\u9752\u86d9\u8fc7\u6cb3 II", "Url": "https://leetcode.cn/problems/frog-jump-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 93 Problem 3"}, {"ID": 2499, "Title": "Minimum Total Cost to Make Arrays Unequal", "TitleCn": "\u8ba9\u6570\u7ec4\u4e0d\u76f8\u7b49\u7684\u6700\u5c0f\u603b\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-total-cost-to-make-arrays-unequal/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 93 Problem 4"}, {"ID": 2500, "Title": "Delete Greatest Value in Each Row", "TitleCn": "\u5220\u9664\u6bcf\u884c\u4e2d\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/delete-greatest-value-in-each-row/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 323 Problem 1"}, {"ID": 2501, "Title": "Longest Square Streak in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u6700\u957f\u7684\u65b9\u6ce2", "Url": "https://leetcode.cn/problems/longest-square-streak-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 323 Problem 2"}, {"ID": 2502, "Title": "Design Memory Allocator", "TitleCn": "\u8bbe\u8ba1\u5185\u5b58\u5206\u914d\u5668", "Url": "https://leetcode.cn/problems/design-memory-allocator/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 323 Problem 3"}, {"ID": 2503, "Title": "Maximum Number of Points From Grid Queries", "TitleCn": "\u77e9\u9635\u67e5\u8be2\u53ef\u83b7\u5f97\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-points-from-grid-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 323 Problem 4"}, {"ID": 2504, "Title": "Concatenate the Name and the Profession", "TitleCn": "\u628a\u540d\u5b57\u548c\u804c\u4e1a\u8054\u7cfb\u8d77\u6765", "Url": "https://leetcode.cn/problems/concatenate-the-name-and-the-profession/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2505, "Title": "Bitwise OR of All Subsequence Sums", "TitleCn": "\u6240\u6709\u5b50\u5e8f\u5217\u548c\u7684\u6309\u4f4d\u6216", "Url": "https://leetcode.cn/problems/bitwise-or-of-all-subsequence-sums/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2506, "Title": "Count Pairs Of Similar Strings", "TitleCn": "\u7edf\u8ba1\u76f8\u4f3c\u5b57\u7b26\u4e32\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-pairs-of-similar-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 324 Problem 1"}, {"ID": 2507, "Title": "Smallest Value After Replacing With Sum of Prime Factors", "TitleCn": "\u4f7f\u7528\u8d28\u56e0\u6570\u4e4b\u548c\u66ff\u6362\u540e\u53ef\u4ee5\u53d6\u5230\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/smallest-value-after-replacing-with-sum-of-prime-factors/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 324 Problem 2"}, {"ID": 2508, "Title": "Add Edges to Make Degrees of All Nodes Even", "TitleCn": "\u6dfb\u52a0\u8fb9\u4f7f\u6240\u6709\u8282\u70b9\u5ea6\u6570\u90fd\u4e3a\u5076\u6570", "Url": "https://leetcode.cn/problems/add-edges-to-make-degrees-of-all-nodes-even/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 324 Problem 3"}, {"ID": 2509, "Title": "Cycle Length Queries in a Tree", "TitleCn": "\u67e5\u8be2\u6811\u4e2d\u73af\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/cycle-length-queries-in-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 324 Problem 4"}, {"ID": 2510, "Title": "Check if There is a Path With Equal Number of 0's And 1's", "TitleCn": "\u68c0\u67e5\u662f\u5426\u6709\u8def\u5f84\u7ecf\u8fc7\u76f8\u540c\u6570\u91cf\u7684 0 \u548c 1", "Url": "https://leetcode.cn/problems/check-if-there-is-a-path-with-equal-number-of-0s-and-1s/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2511, "Title": "Maximum Enemy Forts That Can Be Captured", "TitleCn": "\u6700\u591a\u53ef\u4ee5\u6467\u6bc1\u7684\u654c\u4eba\u57ce\u5821\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-enemy-forts-that-can-be-captured/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 94 Problem 1"}, {"ID": 2512, "Title": "Reward Top K Students", "TitleCn": "\u5956\u52b1\u6700\u9876\u5c16\u7684 K \u540d\u5b66\u751f", "Url": "https://leetcode.cn/problems/reward-top-k-students/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 94 Problem 2"}, {"ID": 2513, "Title": "Minimize the Maximum of Two Arrays", "TitleCn": "\u6700\u5c0f\u5316\u4e24\u4e2a\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/minimize-the-maximum-of-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 94 Problem 3"}, {"ID": 2514, "Title": "Count Anagrams", "TitleCn": "\u7edf\u8ba1\u540c\u4f4d\u5f02\u6784\u5b57\u7b26\u4e32\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-anagrams/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 94 Problem 4"}, {"ID": 2515, "Title": "Shortest Distance to Target String in a Circular Array", "TitleCn": "\u5230\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u6700\u77ed\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/shortest-distance-to-target-string-in-a-circular-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 325 Problem 1"}, {"ID": 2516, "Title": "Take K of Each Character From Left and Right", "TitleCn": "\u6bcf\u79cd\u5b57\u7b26\u81f3\u5c11\u53d6 K \u4e2a", "Url": "https://leetcode.cn/problems/take-k-of-each-character-from-left-and-right/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 325 Problem 2"}, {"ID": 2517, "Title": "Maximum Tastiness of Candy Basket", "TitleCn": "\u793c\u76d2\u7684\u6700\u5927\u751c\u871c\u5ea6", "Url": "https://leetcode.cn/problems/maximum-tastiness-of-candy-basket/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 325 Problem 3"}, {"ID": 2518, "Title": "Number of Great Partitions", "TitleCn": "\u597d\u5206\u533a\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-great-partitions/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 325 Problem 4"}, {"ID": 2519, "Title": "Count the Number of K-Big Indices", "TitleCn": "\u7edf\u8ba1 K-Big \u7d22\u5f15\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-the-number-of-k-big-indices/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2520, "Title": "Count the Digits That Divide a Number", "TitleCn": "\u7edf\u8ba1\u80fd\u6574\u9664\u6570\u5b57\u7684\u4f4d\u6570", "Url": "https://leetcode.cn/problems/count-the-digits-that-divide-a-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 326 Problem 1"}, {"ID": 2521, "Title": "Distinct Prime Factors of Product of Array", "TitleCn": "\u6570\u7ec4\u4e58\u79ef\u4e2d\u7684\u4e0d\u540c\u8d28\u56e0\u6570\u6570\u76ee", "Url": "https://leetcode.cn/problems/distinct-prime-factors-of-product-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 326 Problem 2"}, {"ID": 2522, "Title": "Partition String Into Substrings With Values at Most K", "TitleCn": "\u5c06\u5b57\u7b26\u4e32\u5206\u5272\u6210\u503c\u4e0d\u8d85\u8fc7 K \u7684\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/partition-string-into-substrings-with-values-at-most-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 326 Problem 3"}, {"ID": 2523, "Title": "Closest Prime Numbers in Range", "TitleCn": "\u8303\u56f4\u5185\u6700\u63a5\u8fd1\u7684\u4e24\u4e2a\u8d28\u6570", "Url": "https://leetcode.cn/problems/closest-prime-numbers-in-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 326 Problem 4"}, {"ID": 2524, "Title": "Maximum Frequency Score of a Subarray", "TitleCn": "\u5b50\u6570\u7ec4\u7684\u6700\u5927\u9891\u7387\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-frequency-score-of-a-subarray/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2525, "Title": "Categorize Box According to Criteria", "TitleCn": "\u6839\u636e\u89c4\u5219\u5c06\u7bb1\u5b50\u5206\u7c7b", "Url": "https://leetcode.cn/problems/categorize-box-according-to-criteria/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 95 Problem 1"}, {"ID": 2526, "Title": "Find Consecutive Integers from a Data Stream", "TitleCn": "\u627e\u5230\u6570\u636e\u6d41\u4e2d\u7684\u8fde\u7eed\u6574\u6570", "Url": "https://leetcode.cn/problems/find-consecutive-integers-from-a-data-stream/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 95 Problem 2"}, {"ID": 2527, "Title": "Find Xor-Beauty of Array", "TitleCn": "\u67e5\u8be2\u6570\u7ec4\u5f02\u6216\u7f8e\u4e3d\u503c", "Url": "https://leetcode.cn/problems/find-xor-beauty-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 95 Problem 3"}, {"ID": 2528, "Title": "Maximize the Minimum Powered City", "TitleCn": "\u6700\u5927\u5316\u57ce\u5e02\u7684\u6700\u5c0f\u4f9b\u7535\u7ad9\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximize-the-minimum-powered-city/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 95 Problem 4"}, {"ID": 2529, "Title": "Maximum Count of Positive Integer and Negative Integer", "TitleCn": "\u6b63\u6574\u6570\u548c\u8d1f\u6574\u6570\u7684\u6700\u5927\u8ba1\u6570", "Url": "https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 327 Problem 1"}, {"ID": 2530, "Title": "Maximal Score After Applying K Operations", "TitleCn": "\u6267\u884c K \u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximal-score-after-applying-k-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 327 Problem 2"}, {"ID": 2531, "Title": "Make Number of Distinct Characters Equal", "TitleCn": "\u4f7f\u5b57\u7b26\u4e32\u4e2d\u4e0d\u540c\u5b57\u7b26\u7684\u6570\u76ee\u76f8\u7b49", "Url": "https://leetcode.cn/problems/make-number-of-distinct-characters-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 327 Problem 3"}, {"ID": 2532, "Title": "Time to Cross a Bridge", "TitleCn": "\u8fc7\u6865\u7684\u65f6\u95f4", "Url": "https://leetcode.cn/problems/time-to-cross-a-bridge/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 327 Problem 4"}, {"ID": 2533, "Title": "Number of Good Binary Strings", "TitleCn": "\u597d\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-good-binary-strings/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2534, "Title": "Time Taken to Cross the Door", "TitleCn": "\u901a\u8fc7\u95e8\u7684\u65f6\u95f4", "Url": "https://leetcode.cn/problems/time-taken-to-cross-the-door/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2535, "Title": "Difference Between Element Sum and Digit Sum of an Array", "TitleCn": "\u6570\u7ec4\u5143\u7d20\u548c\u4e0e\u6570\u5b57\u548c\u7684\u7edd\u5bf9\u5dee", "Url": "https://leetcode.cn/problems/difference-between-element-sum-and-digit-sum-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 328 Problem 1"}, {"ID": 2536, "Title": "Increment Submatrices by One", "TitleCn": "\u5b50\u77e9\u9635\u5143\u7d20\u52a0 1", "Url": "https://leetcode.cn/problems/increment-submatrices-by-one/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 328 Problem 2"}, {"ID": 2537, "Title": "Count the Number of Good Subarrays", "TitleCn": "\u7edf\u8ba1\u597d\u5b50\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-good-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 328 Problem 3"}, {"ID": 2538, "Title": "Difference Between Maximum and Minimum Price Sum", "TitleCn": "\u6700\u5927\u4ef7\u503c\u548c\u4e0e\u6700\u5c0f\u4ef7\u503c\u548c\u7684\u5dee\u503c", "Url": "https://leetcode.cn/problems/difference-between-maximum-and-minimum-price-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 328 Problem 4"}, {"ID": 2539, "Title": "Count the Number of Good Subsequences", "TitleCn": "\u597d\u5b50\u5e8f\u5217\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-the-number-of-good-subsequences/", "Ispaid": 1, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2540, "Title": "Minimum Common Value", "TitleCn": "\u6700\u5c0f\u516c\u5171\u503c", "Url": "https://leetcode.cn/problems/minimum-common-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 96 Problem 1"}, {"ID": 2541, "Title": "Minimum Operations to Make Array Equal II", "TitleCn": "\u4f7f\u6570\u7ec4\u4e2d\u6240\u6709\u5143\u7d20\u76f8\u7b49\u7684\u6700\u5c0f\u64cd\u4f5c\u6570 II", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-array-equal-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 96 Problem 2"}, {"ID": 2542, "Title": "Maximum Subsequence Score", "TitleCn": "\u6700\u5927\u5b50\u5e8f\u5217\u7684\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-subsequence-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 96 Problem 3"}, {"ID": 2543, "Title": "Check if Point Is Reachable", "TitleCn": "\u5224\u65ad\u4e00\u4e2a\u70b9\u662f\u5426\u53ef\u4ee5\u5230\u8fbe", "Url": "https://leetcode.cn/problems/check-if-point-is-reachable/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 96 Problem 4"}, {"ID": 2544, "Title": "Alternating Digit Sum", "TitleCn": "\u4ea4\u66ff\u6570\u5b57\u548c", "Url": "https://leetcode.cn/problems/alternating-digit-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 329 Problem 1"}, {"ID": 2545, "Title": "Sort the Students by Their Kth Score", "TitleCn": "\u6839\u636e\u7b2c K \u573a\u8003\u8bd5\u7684\u5206\u6570\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-the-students-by-their-kth-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 329 Problem 2"}, {"ID": 2546, "Title": "Apply Bitwise Operations to Make Strings Equal", "TitleCn": "\u6267\u884c\u9010\u4f4d\u8fd0\u7b97\u4f7f\u5b57\u7b26\u4e32\u76f8\u7b49", "Url": "https://leetcode.cn/problems/apply-bitwise-operations-to-make-strings-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 329 Problem 3"}, {"ID": 2547, "Title": "Minimum Cost to Split an Array", "TitleCn": "\u62c6\u5206\u6570\u7ec4\u7684\u6700\u5c0f\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-to-split-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 329 Problem 4"}, {"ID": 2548, "Title": "Maximum Price to Fill a Bag", "TitleCn": "\u586b\u6ee1\u80cc\u5305\u7684\u6700\u5927\u4ef7\u683c", "Url": "https://leetcode.cn/problems/maximum-price-to-fill-a-bag/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2549, "Title": "Count Distinct Numbers on Board", "TitleCn": "\u7edf\u8ba1\u684c\u9762\u4e0a\u7684\u4e0d\u540c\u6570\u5b57", "Url": "https://leetcode.cn/problems/count-distinct-numbers-on-board/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 330 Problem 1"}, {"ID": 2550, "Title": "Count Collisions of Monkeys on a Polygon", "TitleCn": "\u7334\u5b50\u78b0\u649e\u7684\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/count-collisions-of-monkeys-on-a-polygon/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 330 Problem 2"}, {"ID": 2551, "Title": "Put Marbles in Bags", "TitleCn": "\u5c06\u73e0\u5b50\u653e\u5165\u80cc\u5305\u4e2d", "Url": "https://leetcode.cn/problems/put-marbles-in-bags/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 330 Problem 3"}, {"ID": 2552, "Title": "Count Increasing Quadruplets", "TitleCn": "\u7edf\u8ba1\u4e0a\u5347\u56db\u5143\u7ec4", "Url": "https://leetcode.cn/problems/count-increasing-quadruplets/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 330 Problem 4"}, {"ID": 2553, "Title": "Separate the Digits in an Array", "TitleCn": "\u5206\u5272\u6570\u7ec4\u4e2d\u6570\u5b57\u7684\u6570\u4f4d", "Url": "https://leetcode.cn/problems/separate-the-digits-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 97 Problem 1"}, {"ID": 2554, "Title": "Maximum Number of Integers to Choose From a Range I", "TitleCn": "\u4ece\u4e00\u4e2a\u8303\u56f4\u5185\u9009\u62e9\u6700\u591a\u6574\u6570 I", "Url": "https://leetcode.cn/problems/maximum-number-of-integers-to-choose-from-a-range-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 97 Problem 2"}, {"ID": 2555, "Title": "Maximize Win From Two Segments", "TitleCn": "\u4e24\u4e2a\u7ebf\u6bb5\u83b7\u5f97\u7684\u6700\u591a\u5956\u54c1", "Url": "https://leetcode.cn/problems/maximize-win-from-two-segments/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 97 Problem 3"}, {"ID": 2556, "Title": "Disconnect Path in a Binary Matrix by at Most One Flip", "TitleCn": "\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7ffb\u8f6c\u6700\u591a\u4e00\u6b21\u4f7f\u8def\u5f84\u4e0d\u8fde\u901a", "Url": "https://leetcode.cn/problems/disconnect-path-in-a-binary-matrix-by-at-most-one-flip/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 97 Problem 4"}, {"ID": 2557, "Title": "Maximum Number of Integers to Choose From a Range II", "TitleCn": "\u4ece\u4e00\u4e2a\u8303\u56f4\u5185\u9009\u62e9\u6700\u591a\u6574\u6570 II", "Url": "https://leetcode.cn/problems/maximum-number-of-integers-to-choose-from-a-range-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2558, "Title": "Take Gifts From the Richest Pile", "TitleCn": "\u4ece\u6570\u91cf\u6700\u591a\u7684\u5806\u53d6\u8d70\u793c\u7269", "Url": "https://leetcode.cn/problems/take-gifts-from-the-richest-pile/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 331 Problem 1"}, {"ID": 2559, "Title": "Count Vowel Strings in Ranges", "TitleCn": "\u7edf\u8ba1\u8303\u56f4\u5185\u7684\u5143\u97f3\u5b57\u7b26\u4e32\u6570", "Url": "https://leetcode.cn/problems/count-vowel-strings-in-ranges/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 331 Problem 2"}, {"ID": 2560, "Title": "House Robber IV", "TitleCn": "\u6253\u5bb6\u52ab\u820d IV", "Url": "https://leetcode.cn/problems/house-robber-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 331 Problem 3"}, {"ID": 2561, "Title": "Rearranging Fruits", "TitleCn": "\u91cd\u6392\u6c34\u679c", "Url": "https://leetcode.cn/problems/rearranging-fruits/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 331 Problem 4"}, {"ID": 2562, "Title": "Find the Array Concatenation Value", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u7684\u4e32\u8054\u503c", "Url": "https://leetcode.cn/problems/find-the-array-concatenation-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 332 Problem 1"}, {"ID": 2563, "Title": "Count the Number of Fair Pairs", "TitleCn": "\u7edf\u8ba1\u516c\u5e73\u6570\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-fair-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 332 Problem 2"}, {"ID": 2564, "Title": "Substring XOR Queries", "TitleCn": "\u5b50\u5b57\u7b26\u4e32\u5f02\u6216\u67e5\u8be2", "Url": "https://leetcode.cn/problems/substring-xor-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 332 Problem 3"}, {"ID": 2565, "Title": "Subsequence With the Minimum Score", "TitleCn": "\u6700\u5c11\u5f97\u5206\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/subsequence-with-the-minimum-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 332 Problem 4"}, {"ID": 2566, "Title": "Maximum Difference by Remapping a Digit", "TitleCn": "\u66ff\u6362\u4e00\u4e2a\u6570\u5b57\u540e\u7684\u6700\u5927\u5dee\u503c", "Url": "https://leetcode.cn/problems/maximum-difference-by-remapping-a-digit/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 98 Problem 1"}, {"ID": 2567, "Title": "Minimum Score by Changing Two Elements", "TitleCn": "\u4fee\u6539\u4e24\u4e2a\u5143\u7d20\u7684\u6700\u5c0f\u5206\u6570", "Url": "https://leetcode.cn/problems/minimum-score-by-changing-two-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 98 Problem 2"}, {"ID": 2568, "Title": "Minimum Impossible OR", "TitleCn": "\u6700\u5c0f\u65e0\u6cd5\u5f97\u5230\u7684\u6216\u503c", "Url": "https://leetcode.cn/problems/minimum-impossible-or/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 98 Problem 3"}, {"ID": 2569, "Title": "Handling Sum Queries After Update", "TitleCn": "\u66f4\u65b0\u6570\u7ec4\u540e\u5904\u7406\u6c42\u548c\u67e5\u8be2", "Url": "https://leetcode.cn/problems/handling-sum-queries-after-update/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 98 Problem 4"}, {"ID": 2570, "Title": "Merge Two 2D Arrays by Summing Values", "TitleCn": "\u5408\u5e76\u4e24\u4e2a\u4e8c\u7ef4\u6570\u7ec4 - \u6c42\u548c\u6cd5", "Url": "https://leetcode.cn/problems/merge-two-2d-arrays-by-summing-values/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 333 Problem 1"}, {"ID": 2571, "Title": "Minimum Operations to Reduce an Integer to 0", "TitleCn": "\u5c06\u6574\u6570\u51cf\u5c11\u5230\u96f6\u9700\u8981\u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-reduce-an-integer-to-0/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 333 Problem 2"}, {"ID": 2572, "Title": "Count the Number of Square-Free Subsets", "TitleCn": "\u65e0\u5e73\u65b9\u5b50\u96c6\u8ba1\u6570", "Url": "https://leetcode.cn/problems/count-the-number-of-square-free-subsets/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 333 Problem 3"}, {"ID": 2573, "Title": "Find the String with LCP", "TitleCn": "\u627e\u51fa\u5bf9\u5e94 LCP \u77e9\u9635\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-the-string-with-lcp/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 333 Problem 4"}, {"ID": 2574, "Title": "Left and Right Sum Differences", "TitleCn": "\u5de6\u53f3\u5143\u7d20\u548c\u7684\u5dee\u503c", "Url": "https://leetcode.cn/problems/left-and-right-sum-differences/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 334 Problem 1"}, {"ID": 2575, "Title": "Find the Divisibility Array of a String", "TitleCn": "\u627e\u51fa\u5b57\u7b26\u4e32\u7684\u53ef\u6574\u9664\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-the-divisibility-array-of-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 334 Problem 2"}, {"ID": 2576, "Title": "Find the Maximum Number of Marked Indices", "TitleCn": "\u6c42\u51fa\u6700\u591a\u6807\u8bb0\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-the-maximum-number-of-marked-indices/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 334 Problem 3"}, {"ID": 2577, "Title": "Minimum Time to Visit a Cell In a Grid", "TitleCn": "\u5728\u7f51\u683c\u56fe\u4e2d\u8bbf\u95ee\u4e00\u4e2a\u683c\u5b50\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-visit-a-cell-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 334 Problem 4"}, {"ID": 2578, "Title": "Split With Minimum Sum", "TitleCn": "\u6700\u5c0f\u548c\u5206\u5272", "Url": "https://leetcode.cn/problems/split-with-minimum-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 99 Problem 1"}, {"ID": 2579, "Title": "Count Total Number of Colored Cells", "TitleCn": "\u7edf\u8ba1\u67d3\u8272\u683c\u5b50\u6570", "Url": "https://leetcode.cn/problems/count-total-number-of-colored-cells/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 99 Problem 2"}, {"ID": 2580, "Title": "Count Ways to Group Overlapping Ranges", "TitleCn": "\u7edf\u8ba1\u5c06\u91cd\u53e0\u533a\u95f4\u5408\u5e76\u6210\u7ec4\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/count-ways-to-group-overlapping-ranges/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 99 Problem 3"}, {"ID": 2581, "Title": "Count Number of Possible Root Nodes", "TitleCn": "\u7edf\u8ba1\u53ef\u80fd\u7684\u6811\u6839\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-possible-root-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 99 Problem 4"}, {"ID": 2582, "Title": "Pass the Pillow", "TitleCn": "\u9012\u6795\u5934", "Url": "https://leetcode.cn/problems/pass-the-pillow/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 335 Problem 1"}, {"ID": 2583, "Title": "Kth Largest Sum in a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u7684\u7b2c K \u5927\u5c42\u548c", "Url": "https://leetcode.cn/problems/kth-largest-sum-in-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 335 Problem 2"}, {"ID": 2584, "Title": "Split the Array to Make Coprime Products", "TitleCn": "\u5206\u5272\u6570\u7ec4\u4f7f\u4e58\u79ef\u4e92\u8d28", "Url": "https://leetcode.cn/problems/split-the-array-to-make-coprime-products/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 335 Problem 3"}, {"ID": 2585, "Title": "Number of Ways to Earn Points", "TitleCn": "\u83b7\u5f97\u5206\u6570\u7684\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-earn-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 335 Problem 4"}, {"ID": 2586, "Title": "Count the Number of Vowel Strings in Range", "TitleCn": "\u7edf\u8ba1\u8303\u56f4\u5185\u7684\u5143\u97f3\u5b57\u7b26\u4e32\u6570", "Url": "https://leetcode.cn/problems/count-the-number-of-vowel-strings-in-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 336 Problem 1"}, {"ID": 2587, "Title": "Rearrange Array to Maximize Prefix Score", "TitleCn": "\u91cd\u6392\u6570\u7ec4\u4ee5\u5f97\u5230\u6700\u5927\u524d\u7f00\u5206\u6570", "Url": "https://leetcode.cn/problems/rearrange-array-to-maximize-prefix-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 336 Problem 2"}, {"ID": 2588, "Title": "Count the Number of Beautiful Subarrays", "TitleCn": "\u7edf\u8ba1\u7f8e\u4e3d\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-beautiful-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 336 Problem 3"}, {"ID": 2589, "Title": "Minimum Time to Complete All Tasks", "TitleCn": "\u5b8c\u6210\u6240\u6709\u4efb\u52a1\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-complete-all-tasks/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 336 Problem 4"}, {"ID": 2590, "Title": "Design a Todo List", "TitleCn": "\u8bbe\u8ba1\u4e00\u4e2a\u5f85\u529e\u4e8b\u9879\u6e05\u5355", "Url": "https://leetcode.cn/problems/design-a-todo-list/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2591, "Title": "Distribute Money to Maximum Children", "TitleCn": "\u5c06\u94b1\u5206\u7ed9\u6700\u591a\u7684\u513f\u7ae5", "Url": "https://leetcode.cn/problems/distribute-money-to-maximum-children/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 100 Problem 1"}, {"ID": 2592, "Title": "Maximize Greatness of an Array", "TitleCn": "\u6700\u5927\u5316\u6570\u7ec4\u7684\u4f1f\u5927\u503c", "Url": "https://leetcode.cn/problems/maximize-greatness-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 100 Problem 2"}, {"ID": 2593, "Title": "Find Score of an Array After Marking All Elements", "TitleCn": "\u6807\u8bb0\u6240\u6709\u5143\u7d20\u540e\u6570\u7ec4\u7684\u5206\u6570", "Url": "https://leetcode.cn/problems/find-score-of-an-array-after-marking-all-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 100 Problem 3"}, {"ID": 2594, "Title": "Minimum Time to Repair Cars", "TitleCn": "\u4fee\u8f66\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-repair-cars/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 100 Problem 4"}, {"ID": 2595, "Title": "Number of Even and Odd Bits", "TitleCn": "\u5947\u5076\u4f4d\u6570", "Url": "https://leetcode.cn/problems/number-of-even-and-odd-bits/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 337 Problem 1"}, {"ID": 2596, "Title": "Check Knight Tour Configuration", "TitleCn": "\u68c0\u67e5\u9a91\u58eb\u5de1\u89c6\u65b9\u6848", "Url": "https://leetcode.cn/problems/check-knight-tour-configuration/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 337 Problem 2"}, {"ID": 2597, "Title": "The Number of Beautiful Subsets", "TitleCn": "\u7f8e\u4e3d\u5b50\u96c6\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/the-number-of-beautiful-subsets/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 337 Problem 3"}, {"ID": 2598, "Title": "Smallest Missing Non-negative Integer After Operations", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u540e\u7684\u6700\u5927 MEX", "Url": "https://leetcode.cn/problems/smallest-missing-non-negative-integer-after-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 337 Problem 4"}, {"ID": 2599, "Title": "Make the Prefix Sum Non-negative", "TitleCn": "\u4f7f\u524d\u7f00\u548c\u6570\u7ec4\u975e\u8d1f", "Url": "https://leetcode.cn/problems/make-the-prefix-sum-non-negative/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2600, "Title": "K Items With the Maximum Sum", "TitleCn": "K \u4ef6\u7269\u54c1\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/k-items-with-the-maximum-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 338 Problem 1"}, {"ID": 2601, "Title": "Prime Subtraction Operation", "TitleCn": "\u8d28\u6570\u51cf\u6cd5\u8fd0\u7b97", "Url": "https://leetcode.cn/problems/prime-subtraction-operation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 338 Problem 2"}, {"ID": 2602, "Title": "Minimum Operations to Make All Array Elements Equal", "TitleCn": "\u4f7f\u6570\u7ec4\u5143\u7d20\u5168\u90e8\u76f8\u7b49\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-all-array-elements-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 338 Problem 3"}, {"ID": 2603, "Title": "Collect Coins in a Tree", "TitleCn": "\u6536\u96c6\u6811\u4e2d\u91d1\u5e01", "Url": "https://leetcode.cn/problems/collect-coins-in-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 338 Problem 4"}, {"ID": 2604, "Title": "Minimum Time to Eat All Grains", "TitleCn": "\u5403\u6389\u6240\u6709\u8c37\u5b50\u7684\u6700\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-eat-all-grains/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2605, "Title": "Form Smallest Number From Two Digit Arrays", "TitleCn": "\u4ece\u4e24\u4e2a\u6570\u5b57\u6570\u7ec4\u91cc\u751f\u6210\u6700\u5c0f\u6570\u5b57", "Url": "https://leetcode.cn/problems/form-smallest-number-from-two-digit-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 101 Problem 1"}, {"ID": 2606, "Title": "Find the Substring With Maximum Cost", "TitleCn": "\u627e\u5230\u6700\u5927\u5f00\u9500\u7684\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-the-substring-with-maximum-cost/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 101 Problem 2"}, {"ID": 2607, "Title": "Make K-Subarray Sums Equal", "TitleCn": "\u4f7f\u5b50\u6570\u7ec4\u5143\u7d20\u548c\u76f8\u7b49", "Url": "https://leetcode.cn/problems/make-k-subarray-sums-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 101 Problem 3"}, {"ID": 2608, "Title": "Shortest Cycle in a Graph", "TitleCn": "\u56fe\u4e2d\u7684\u6700\u77ed\u73af", "Url": "https://leetcode.cn/problems/shortest-cycle-in-a-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 101 Problem 4"}, {"ID": 2609, "Title": "Find the Longest Balanced Substring of a Binary String", "TitleCn": "\u6700\u957f\u5e73\u8861\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-the-longest-balanced-substring-of-a-binary-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 339 Problem 1"}, {"ID": 2610, "Title": "Convert an Array Into a 2D Array With Conditions", "TitleCn": "\u8f6c\u6362\u4e8c\u7ef4\u6570\u7ec4", "Url": "https://leetcode.cn/problems/convert-an-array-into-a-2d-array-with-conditions/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 339 Problem 2"}, {"ID": 2611, "Title": "Mice and Cheese", "TitleCn": "\u8001\u9f20\u548c\u5976\u916a", "Url": "https://leetcode.cn/problems/mice-and-cheese/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 339 Problem 3"}, {"ID": 2612, "Title": "Minimum Reverse Operations", "TitleCn": "\u6700\u5c11\u7ffb\u8f6c\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-reverse-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 339 Problem 4"}, {"ID": 2613, "Title": "Beautiful Pairs", "TitleCn": "\u7f8e\u6570\u5bf9", "Url": "https://leetcode.cn/problems/beautiful-pairs/", "Ispaid": 1, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2614, "Title": "Prime In Diagonal", "TitleCn": "\u5bf9\u89d2\u7ebf\u4e0a\u7684\u8d28\u6570", "Url": "https://leetcode.cn/problems/prime-in-diagonal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 340 Problem 1"}, {"ID": 2615, "Title": "Sum of Distances", "TitleCn": "\u7b49\u503c\u8ddd\u79bb\u548c", "Url": "https://leetcode.cn/problems/sum-of-distances/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 340 Problem 2"}, {"ID": 2616, "Title": "Minimize the Maximum Difference of Pairs", "TitleCn": "\u6700\u5c0f\u5316\u6570\u5bf9\u7684\u6700\u5927\u5dee\u503c", "Url": "https://leetcode.cn/problems/minimize-the-maximum-difference-of-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 340 Problem 3"}, {"ID": 2617, "Title": "Minimum Number of Visited Cells in a Grid", "TitleCn": "\u7f51\u683c\u56fe\u4e2d\u6700\u5c11\u8bbf\u95ee\u7684\u683c\u5b50\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-visited-cells-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 340 Problem 4"}, {"ID": 2618, "Title": "Check if Object Instance of Class", "TitleCn": "\u68c0\u67e5\u662f\u5426\u662f\u7c7b\u7684\u5bf9\u8c61\u5b9e\u4f8b", "Url": "https://leetcode.cn/problems/check-if-object-instance-of-class/", "Ispaid": 0, "Type": "JavaScript", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2619, "Title": "Array Prototype Last", "TitleCn": "\u6570\u7ec4\u539f\u578b\u5bf9\u8c61\u7684\u6700\u540e\u4e00\u4e2a\u5143\u7d20", "Url": "https://leetcode.cn/problems/array-prototype-last/", "Ispaid": 0, "Type": "JavaScript", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2620, "Title": "Counter", "TitleCn": "\u8ba1\u6570\u5668", "Url": "https://leetcode.cn/problems/counter/", "Ispaid": 0, "Type": "JavaScript", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2621, "Title": "Sleep", "TitleCn": "\u7761\u7720\u51fd\u6570", "Url": "https://leetcode.cn/problems/sleep/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2622, "Title": "Cache With Time Limit", "TitleCn": "\u6709\u65f6\u95f4\u9650\u5236\u7684\u7f13\u5b58", "Url": "https://leetcode.cn/problems/cache-with-time-limit/", "Ispaid": 0, "Type": "JavaScript", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2623, "Title": "Memoize", "TitleCn": "\u8bb0\u5fc6\u51fd\u6570", "Url": "https://leetcode.cn/problems/memoize/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2624, "Title": "Snail Traversal", "TitleCn": "\u8717\u725b\u6392\u5e8f", "Url": "https://leetcode.cn/problems/snail-traversal/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2625, "Title": "Flatten Deeply Nested Array", "TitleCn": "\u6241\u5e73\u5316\u5d4c\u5957\u6570\u7ec4", "Url": "https://leetcode.cn/problems/flatten-deeply-nested-array/", "Ispaid": 0, "Type": "JavaScript", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2626, "Title": "Array Reduce Transformation", "TitleCn": "\u6570\u7ec4\u5f52\u7ea6\u8fd0\u7b97", "Url": "https://leetcode.cn/problems/array-reduce-transformation/", "Ispaid": 0, "Type": "JavaScript", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2627, "Title": "Debounce", "TitleCn": "\u51fd\u6570\u9632\u6296", "Url": "https://leetcode.cn/problems/debounce/", "Ispaid": 0, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2628, "Title": "SON Deep Equal", "TitleCn": "\u5b8c\u5168\u76f8\u7b49\u7684 JSON \u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/json-deep-equal/", "Ispaid": 1, "Type": "JavaScript", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2629, "Title": "Function Composition", "TitleCn": "\u590d\u5408\u51fd\u6570", "Url": "https://leetcode.cn/problems/function-composition/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2630, "Title": "Memoize II", "TitleCn": "\u8bb0\u5fc6\u51fd\u6570 II", "Url": "https://leetcode.cn/problems/memoize-ii/", "Ispaid": 0, "Type": "JavaScript", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2631, "Title": "Group By", "TitleCn": "\u5206\u7ec4", "Url": "https://leetcode.cn/problems/group-by/", "Ispaid": 0, "Type": "JavaScript", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2632, "Title": "Curry", "TitleCn": "\u67ef\u91cc\u5316", "Url": "https://leetcode.cn/problems/curry/", "Ispaid": 1, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2633, "Title": "Convert Object to JSON String", "TitleCn": "\u5c06\u5bf9\u8c61\u8f6c\u6362\u4e3a JSON \u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/convert-object-to-json-string/", "Ispaid": 1, "Type": "JavaScript", "Level": 9, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2634, "Title": "Filter Elements from Array", "TitleCn": "\u8fc7\u6ee4\u6570\u7ec4\u4e2d\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/filter-elements-from-array/", "Ispaid": 0, "Type": "JavaScript", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2635, "Title": "Apply Transform Over Each Element in Array", "TitleCn": "\u8f6c\u6362\u6570\u7ec4\u4e2d\u7684\u6bcf\u4e2a\u5143\u7d20", "Url": "https://leetcode.cn/problems/apply-transform-over-each-element-in-array/", "Ispaid": 0, "Type": "JavaScript", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2636, "Title": "Promise Pool", "TitleCn": "Promice \u5bf9\u8c61\u6c60", "Url": "https://leetcode.cn/problems/promise-pool/", "Ispaid": 1, "Type": "JavaScript", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2637, "Title": "Promise Time Limit", "TitleCn": "\u6709\u65f6\u95f4\u9650\u5236\u7684 Promise \u5bf9\u8c61", "Url": "https://leetcode.cn/problems/promise-time-limit/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2638, "Title": "Count the Number of K-Free Subsets", "TitleCn": "\u7edf\u8ba1 K-Free \u5b50\u96c6\u7684\u603b\u6570", "Url": "https://leetcode.cn/problems/count-the-number-of-k-free-subsets/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2639, "Title": "Find the Width of Columns of a Grid", "TitleCn": "\u67e5\u8be2\u7f51\u683c\u56fe\u4e2d\u6bcf\u4e00\u5217\u7684\u5bbd\u5ea6", "Url": "https://leetcode.cn/problems/find-the-width-of-columns-of-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 102 Problem 1"}, {"ID": 2640, "Title": "Find the Score of All Prefixes of an Array", "TitleCn": "\u4e00\u4e2a\u6570\u7ec4\u6240\u6709\u524d\u7f00\u7684\u5206\u6570", "Url": "https://leetcode.cn/problems/find-the-score-of-all-prefixes-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 102 Problem 2"}, {"ID": 2641, "Title": "Cousins in Binary Tree II", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5802\u5144\u5f1f\u8282\u70b9 II", "Url": "https://leetcode.cn/problems/cousins-in-binary-tree-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 102 Problem 3"}, {"ID": 2642, "Title": "Design Graph With Shortest Path Calculator", "TitleCn": "\u8bbe\u8ba1\u53ef\u4ee5\u6c42\u6700\u77ed\u8def\u5f84\u7684\u56fe\u7c7b", "Url": "https://leetcode.cn/problems/design-graph-with-shortest-path-calculator/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 102 Problem 4"}, {"ID": 2643, "Title": "Row With Maximum Ones", "TitleCn": "\u4e00\u6700\u591a\u7684\u884c", "Url": "https://leetcode.cn/problems/row-with-maximum-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 341 Problem 1"}, {"ID": 2644, "Title": "Find the Maximum Divisibility Score", "TitleCn": "\u627e\u51fa\u53ef\u6574\u9664\u6027\u5f97\u5206\u6700\u5927\u7684\u6574\u6570", "Url": "https://leetcode.cn/problems/find-the-maximum-divisibility-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 341 Problem 2"}, {"ID": 2645, "Title": "Minimum Additions to Make Valid String", "TitleCn": "\u6784\u9020\u6709\u6548\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6570", "Url": "https://leetcode.cn/problems/minimum-additions-to-make-valid-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 341 Problem 3"}, {"ID": 2646, "Title": "Minimize the Total Price of the Trips", "TitleCn": "\u6700\u5c0f\u5316\u65c5\u884c\u7684\u4ef7\u683c\u603b\u548c", "Url": "https://leetcode.cn/problems/minimize-the-total-price-of-the-trips/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 341 Problem 4"}, {"ID": 2647, "Title": "Color the Triangle Red", "TitleCn": "\u628a\u4e09\u89d2\u5f62\u67d3\u6210\u7ea2\u8272", "Url": "https://leetcode.cn/problems/color-the-triangle-red/", "Ispaid": 1, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2648, "Title": "Generate Fibonacci Sequence", "TitleCn": "\u751f\u6210\u6590\u6ce2\u90a3\u5951\u6570\u5217", "Url": "https://leetcode.cn/problems/generate-fibonacci-sequence/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2649, "Title": "Nested Array Generator", "TitleCn": "\u5d4c\u5957\u6570\u7ec4\u751f\u6210\u5668", "Url": "https://leetcode.cn/problems/nested-array-generator/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2650, "Title": "Design Cancellable Function", "TitleCn": "\u8bbe\u8ba1\u53ef\u53d6\u6d88\u51fd\u6570", "Url": "https://leetcode.cn/problems/design-cancellable-function/", "Ispaid": 0, "Type": "JavaScript", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2651, "Title": "Calculate Delayed Arrival Time", "TitleCn": "\u8ba1\u7b97\u5217\u8f66\u5230\u7ad9\u65f6\u95f4", "Url": "https://leetcode.cn/problems/calculate-delayed-arrival-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 342 Problem 1"}, {"ID": 2652, "Title": "Sum Multiples", "TitleCn": "\u500d\u6570\u6c42\u548c", "Url": "https://leetcode.cn/problems/sum-multiples/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 342 Problem 2"}, {"ID": 2653, "Title": "Sliding Subarray Beauty", "TitleCn": "\u6ed1\u52a8\u5b50\u6570\u7ec4\u7684\u7f8e\u4e3d\u503c", "Url": "https://leetcode.cn/problems/sliding-subarray-beauty/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 342 Problem 3"}, {"ID": 2654, "Title": "Minimum Number of Operations to Make All Array Elements Equal to 1", "TitleCn": "\u4f7f\u6570\u7ec4\u6240\u6709\u5143\u7d20\u53d8\u6210 1 \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-all-array-elements-equal-to-1/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 342 Problem 4"}, {"ID": 2655, "Title": "Find Maximal Uncovered Ranges", "TitleCn": "\u5bfb\u627e\u6700\u5927\u957f\u5ea6\u7684\u672a\u8986\u76d6\u533a\u95f4", "Url": "https://leetcode.cn/problems/find-maximal-uncovered-ranges/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2656, "Title": "Maximum Sum With Exactly K Elements", "TitleCn": "K \u4e2a\u5143\u7d20\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-with-exactly-k-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 103 Problem 1"}, {"ID": 2657, "Title": "Find the Prefix Common Array of Two Arrays", "TitleCn": "\u627e\u5230\u4e24\u4e2a\u6570\u7ec4\u7684\u524d\u7f00\u516c\u5171\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-the-prefix-common-array-of-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 103 Problem 2"}, {"ID": 2658, "Title": "Maximum Number of Fish in a Grid", "TitleCn": "\u7f51\u683c\u56fe\u4e2d\u9c7c\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-fish-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 103 Problem 3"}, {"ID": 2659, "Title": "Make Array Empty", "TitleCn": "\u5c06\u6570\u7ec4\u6e05\u7a7a", "Url": "https://leetcode.cn/problems/make-array-empty/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 103 Problem 4"}, {"ID": 2660, "Title": "Determine the Winner of a Bowling Game", "TitleCn": "\u4fdd\u9f84\u7403\u6e38\u620f\u7684\u83b7\u80dc\u8005", "Url": "https://leetcode.cn/problems/determine-the-winner-of-a-bowling-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 343 Problem 1"}, {"ID": 2661, "Title": "First Completely Painted Row or Column", "TitleCn": "\u627e\u51fa\u53e0\u6d82\u5143\u7d20", "Url": "https://leetcode.cn/problems/first-completely-painted-row-or-column/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 343 Problem 2"}, {"ID": 2662, "Title": "Minimum Cost of a Path With Special Roads", "TitleCn": "\u524d\u5f80\u76ee\u6807\u7684\u6700\u5c0f\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-of-a-path-with-special-roads/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 343 Problem 3"}, {"ID": 2663, "Title": "Lexicographically Smallest Beautiful String", "TitleCn": "\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u7f8e\u4e3d\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-smallest-beautiful-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 343 Problem 4"}, {"ID": 2664, "Title": "The Knight\u2019s Tour", "TitleCn": "\u5de1\u903b\u7684\u9a91\u58eb", "Url": "https://leetcode.cn/problems/the-knights-tour/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2665, "Title": "Counter II", "TitleCn": "\u8ba1\u6570\u5668 II", "Url": "https://leetcode.cn/problems/counter-ii/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2666, "Title": "Allow One Function Call", "TitleCn": "\u53ea\u5141\u8bb8\u4e00\u6b21\u51fd\u6570\u8c03\u7528", "Url": "https://leetcode.cn/problems/allow-one-function-call/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2667, "Title": "Create Hello World Function", "TitleCn": "\u521b\u5efa Hello World \u51fd\u6570", "Url": "https://leetcode.cn/problems/create-hello-world-function/", "Ispaid": 0, "Type": "JavaScript", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2668, "Title": "Find Latest Salaries", "TitleCn": "\u67e5\u8be2\u5458\u5de5\u5f53\u524d\u85aa\u6c34", "Url": "https://leetcode.cn/problems/find-latest-salaries/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2669, "Title": "Count Artist Occurrences On Spotify Ranking List", "TitleCn": "\u7edf\u8ba1 Spotify \u6392\u884c\u699c\u4e0a\u827a\u672f\u5bb6\u51fa\u73b0\u6b21\u6570", "Url": "https://leetcode.cn/problems/count-artist-occurrences-on-spotify-ranking-list/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2670, "Title": "Find the Distinct Difference Array", "TitleCn": "\u627e\u51fa\u4e0d\u540c\u5143\u7d20\u6570\u76ee\u5dee\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-the-distinct-difference-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 344 Problem 1"}, {"ID": 2671, "Title": "Frequency Tracker", "TitleCn": "\u9891\u7387\u8ddf\u8e2a\u5668", "Url": "https://leetcode.cn/problems/frequency-tracker/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 344 Problem 2"}, {"ID": 2672, "Title": "Number of Adjacent Elements With the Same Color", "TitleCn": "\u6709\u76f8\u540c\u989c\u8272\u7684\u76f8\u90bb\u5143\u7d20\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-adjacent-elements-with-the-same-color/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 344 Problem 3"}, {"ID": 2673, "Title": "Make Costs of Paths Equal in a Binary Tree", "TitleCn": "\u4f7f\u4e8c\u53c9\u6811\u6240\u6709\u8def\u5f84\u503c\u76f8\u7b49\u7684\u6700\u5c0f\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/make-costs-of-paths-equal-in-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 344 Problem 4"}, {"ID": 2674, "Title": "Split a Circular Linked List", "TitleCn": "\u62c6\u5206\u5faa\u73af\u94fe\u8868", "Url": "https://leetcode.cn/problems/split-a-circular-linked-list/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2675, "Title": "Array of Objects to Matrix", "TitleCn": "\u5c06\u5bf9\u8c61\u6570\u7ec4\u8f6c\u6362\u4e3a\u77e9\u9635", "Url": "https://leetcode.cn/problems/array-of-objects-to-matrix/", "Ispaid": 1, "Type": "JavaScript", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2676, "Title": "Throttle", "TitleCn": "\u8282\u6d41", "Url": "https://leetcode.cn/problems/throttle/", "Ispaid": 1, "Type": "JavaScript", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2677, "Title": "Chunk Array", "TitleCn": "\u5206\u5757\u6570\u7ec4", "Url": "https://leetcode.cn/problems/chunk-array/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2678, "Title": "Number of Senior Citizens", "TitleCn": "\u8001\u4eba\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-senior-citizens/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 104 Problem 1"}, {"ID": 2679, "Title": "Sum in a Matrix", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 104 Problem 2"}, {"ID": 2680, "Title": "Maximum OR", "TitleCn": "\u6700\u5927\u6216\u503c", "Url": "https://leetcode.cn/problems/maximum-or/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 104 Problem 3"}, {"ID": 2681, "Title": "Power of Heroes", "TitleCn": "\u82f1\u96c4\u7684\u529b\u91cf", "Url": "https://leetcode.cn/problems/power-of-heroes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 104 Problem 4"}, {"ID": 2682, "Title": "Find the Losers of the Circular Game", "TitleCn": "\u627e\u51fa\u8f6c\u5708\u6e38\u620f\u8f93\u5bb6", "Url": "https://leetcode.cn/problems/find-the-losers-of-the-circular-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 345 Problem 1"}, {"ID": 2683, "Title": "Neighboring Bitwise XOR", "TitleCn": "\u76f8\u90bb\u503c\u7684\u6309\u4f4d\u5f02\u6216", "Url": "https://leetcode.cn/problems/neighboring-bitwise-xor/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 345 Problem 2"}, {"ID": 2684, "Title": "Maximum Number of Moves in a Grid", "TitleCn": "\u77e9\u9635\u4e2d\u79fb\u52a8\u7684\u6700\u5927\u6b21\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-moves-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 345 Problem 3"}, {"ID": 2685, "Title": "Count the Number of Complete Components", "TitleCn": "\u7edf\u8ba1\u5b8c\u5168\u8fde\u901a\u5206\u91cf\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-the-number-of-complete-components/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 345 Problem 4"}, {"ID": 2686, "Title": "Immediate Food Delivery III", "TitleCn": "\u5373\u65f6\u98df\u7269\u914d\u9001 III", "Url": "https://leetcode.cn/problems/immediate-food-delivery-iii/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2687, "Title": "Bikes Last Time Used", "TitleCn": "\u81ea\u884c\u8f66\u7684\u6700\u540e\u4f7f\u7528\u65f6\u95f4", "Url": "https://leetcode.cn/problems/bikes-last-time-used/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2688, "Title": "Find Active Users", "TitleCn": "\u67e5\u627e\u6d3b\u8dc3\u7528\u6237", "Url": "https://leetcode.cn/problems/find-active-users/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2689, "Title": "Extract Kth Character From The Rope Tree", "TitleCn": "\u4ece Rope \u6811\u4e2d\u63d0\u53d6\u7b2c K \u4e2a\u5b57\u7b26", "Url": "https://leetcode.cn/problems/extract-kth-character-from-the-rope-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2690, "Title": "Infinite Method Object", "TitleCn": "\u65e0\u7a77\u65b9\u6cd5\u5bf9\u8c61", "Url": "https://leetcode.cn/problems/infinite-method-object/", "Ispaid": 1, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2691, "Title": "Immutability Helper", "TitleCn": "\u4e0d\u53ef\u53d8\u8f85\u52a9\u5de5\u5177", "Url": "https://leetcode.cn/problems/immutability-helper/", "Ispaid": 1, "Type": "JavaScript", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2692, "Title": "Make Object Immutable", "TitleCn": "\u4f7f\u5bf9\u8c61\u4e0d\u53ef\u53d8", "Url": "https://leetcode.cn/problems/make-object-immutable/", "Ispaid": 1, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2693, "Title": "Call Function with Custom Context", "TitleCn": "\u4f7f\u7528\u81ea\u5b9a\u4e49\u4e0a\u4e0b\u6587\u8c03\u7528\u51fd\u6570", "Url": "https://leetcode.cn/problems/call-function-with-custom-context/", "Ispaid": 0, "Type": "JavaScript", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2694, "Title": "Event Emitter", "TitleCn": "\u4e8b\u4ef6\u53d1\u5c04\u5668", "Url": "https://leetcode.cn/problems/event-emitter/", "Ispaid": 0, "Type": "JavaScript", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2695, "Title": "Array Wrapper", "TitleCn": "\u5305\u88c5\u6570\u7ec4", "Url": "https://leetcode.cn/problems/array-wrapper/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2696, "Title": "Minimum String Length After Removing Substrings", "TitleCn": "\u5220\u9664\u5b50\u4e32\u540e\u7684\u5b57\u7b26\u4e32\u6700\u5c0f\u957f\u5ea6", "Url": "https://leetcode.cn/problems/minimum-string-length-after-removing-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 346 Problem 1"}, {"ID": 2697, "Title": "Lexicographically Smallest Palindrome", "TitleCn": "\u5b57\u5178\u5e8f\u6700\u5c0f\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-smallest-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 346 Problem 2"}, {"ID": 2698, "Title": "Find the Punishment Number of an Integer", "TitleCn": "\u6c42\u4e00\u4e2a\u6574\u6570\u7684\u60e9\u7f5a\u6570", "Url": "https://leetcode.cn/problems/find-the-punishment-number-of-an-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 346 Problem 3"}, {"ID": 2699, "Title": "Modify Graph Edge Weights", "TitleCn": "\u4fee\u6539\u56fe\u4e2d\u7684\u8fb9\u6743", "Url": "https://leetcode.cn/problems/modify-graph-edge-weights/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 346 Problem 4"}, {"ID": 2700, "Title": "Differences Between Two Objects", "TitleCn": "\u4e24\u4e2a\u5bf9\u8c61\u4e4b\u95f4\u7684\u5dee\u5f02", "Url": "https://leetcode.cn/problems/differences-between-two-objects/", "Ispaid": 1, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2701, "Title": "Consecutive Transactions with Increasing Amounts", "TitleCn": "\u8fde\u7eed\u9012\u589e\u4ea4\u6613", "Url": "https://leetcode.cn/problems/consecutive-transactions-with-increasing-amounts/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2702, "Title": "Minimum Operations to Make Numbers Non-positive", "TitleCn": "\u4f7f\u6570\u5b57\u53d8\u4e3a\u975e\u6b63\u6570\u7684\u6700\u5c0f\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-numbers-non-positive/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2703, "Title": "Return Length of Arguments Passed", "TitleCn": "\u8fd4\u56de\u4f20\u9012\u7684\u53c2\u6570\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/return-length-of-arguments-passed/", "Ispaid": 0, "Type": "JavaScript", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2704, "Title": "To Be Or Not To Be", "TitleCn": "\u76f8\u7b49\u8fd8\u662f\u4e0d\u76f8\u7b49", "Url": "https://leetcode.cn/problems/to-be-or-not-to-be/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2705, "Title": "Compact Object", "TitleCn": "\u7cbe\u7b80\u5bf9\u8c61", "Url": "https://leetcode.cn/problems/compact-object/", "Ispaid": 0, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2706, "Title": "Buy Two Chocolates", "TitleCn": "\u8d2d\u4e70\u4e24\u5757\u5de7\u514b\u529b", "Url": "https://leetcode.cn/problems/buy-two-chocolates/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 105 Problem 1"}, {"ID": 2707, "Title": "Extra Characters in a String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u7684\u989d\u5916\u5b57\u7b26", "Url": "https://leetcode.cn/problems/extra-characters-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 105 Problem 2"}, {"ID": 2708, "Title": "Maximum Strength of a Group", "TitleCn": "\u4e00\u4e2a\u5c0f\u7ec4\u7684\u6700\u5927\u5b9e\u529b\u503c", "Url": "https://leetcode.cn/problems/maximum-strength-of-a-group/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 105 Problem 3"}, {"ID": 2709, "Title": "Greatest Common Divisor Traversal", "TitleCn": "\u6700\u5927\u516c\u7ea6\u6570\u904d\u5386", "Url": "https://leetcode.cn/problems/greatest-common-divisor-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 105 Problem 4"}, {"ID": 2710, "Title": "Remove Trailing Zeros From a String", "TitleCn": "\u79fb\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u5c3e\u968f\u96f6", "Url": "https://leetcode.cn/problems/remove-trailing-zeros-from-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 347 Problem 1"}, {"ID": 2711, "Title": "Difference of Number of Distinct Values on Diagonals", "TitleCn": "\u5bf9\u89d2\u7ebf\u4e0a\u4e0d\u540c\u503c\u7684\u6570\u91cf\u5dee", "Url": "https://leetcode.cn/problems/difference-of-number-of-distinct-values-on-diagonals/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 347 Problem 2"}, {"ID": 2712, "Title": "Minimum Cost to Make All Characters Equal", "TitleCn": "\u4f7f\u6240\u6709\u5b57\u7b26\u76f8\u7b49\u7684\u6700\u5c0f\u6210\u672c", "Url": "https://leetcode.cn/problems/minimum-cost-to-make-all-characters-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 347 Problem 3"}, {"ID": 2713, "Title": "Maximum Strictly Increasing Cells in a Matrix", "TitleCn": "\u77e9\u9635\u4e2d\u4e25\u683c\u9012\u589e\u7684\u5355\u5143\u683c\u6570", "Url": "https://leetcode.cn/problems/maximum-strictly-increasing-cells-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 347 Problem 4"}, {"ID": 2714, "Title": "Find Shortest Path with K Hops", "TitleCn": "\u627e\u5230 K \u6b21\u8de8\u8d8a\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/find-shortest-path-with-k-hops/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2715, "Title": "Timeout Cancellation", "TitleCn": "\u6267\u884c\u53ef\u53d6\u6d88\u7684\u5ef6\u8fdf\u51fd\u6570", "Url": "https://leetcode.cn/problems/execute-cancellable-function-with-delay/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2716, "Title": "Minimize String Length", "TitleCn": "\u6700\u5c0f\u5316\u5b57\u7b26\u4e32\u957f\u5ea6", "Url": "https://leetcode.cn/problems/minimize-string-length/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 348 Problem 1"}, {"ID": 2717, "Title": "Semi-Ordered Permutation", "TitleCn": "\u534a\u6709\u5e8f\u6392\u5217", "Url": "https://leetcode.cn/problems/semi-ordered-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 348 Problem 2"}, {"ID": 2718, "Title": "Sum of Matrix After Queries", "TitleCn": "\u67e5\u8be2\u540e\u77e9\u9635\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-matrix-after-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 348 Problem 3"}, {"ID": 2719, "Title": "Count of Integers", "TitleCn": "\u7edf\u8ba1\u6574\u6570\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-of-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 348 Problem 4"}, {"ID": 2720, "Title": "Popularity Percentage", "TitleCn": "\u53d7\u6b22\u8fce\u5ea6\u767e\u5206\u6bd4", "Url": "https://leetcode.cn/problems/popularity-percentage/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2721, "Title": "Execute Asynchronous Functions in Parallel", "TitleCn": "\u5e76\u884c\u6267\u884c\u5f02\u6b65\u51fd\u6570", "Url": "https://leetcode.cn/problems/execute-asynchronous-functions-in-parallel/", "Ispaid": 0, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2722, "Title": "Join Two Arrays by ID", "TitleCn": "\u6839\u636e ID \u5408\u5e76\u4e24\u4e2a\u6570\u7ec4", "Url": "https://leetcode.cn/problems/join-two-arrays-by-id/", "Ispaid": 0, "Type": "JavaScript", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2723, "Title": "Add Two Promises", "TitleCn": "\u6dfb\u52a0\u4e24\u4e2a Promise \u5bf9\u8c61", "Url": "https://leetcode.cn/problems/add-two-promises/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2724, "Title": "Sort By", "TitleCn": "\u6392\u5e8f\u65b9\u5f0f", "Url": "https://leetcode.cn/problems/sort-by/", "Ispaid": 0, "Type": "JavaScript", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2725, "Title": "Interval Cancellation", "TitleCn": "\u95f4\u9694\u53d6\u6d88", "Url": "https://leetcode.cn/problems/interval-cancellation/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2726, "Title": "Calculator with Method Chaining", "TitleCn": "\u4f7f\u7528\u65b9\u6cd5\u94fe\u7684\u8ba1\u7b97\u5668", "Url": "https://leetcode.cn/problems/calculator-with-method-chaining/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2727, "Title": "Is Object Empty", "TitleCn": "\u5224\u65ad\u5bf9\u8c61\u662f\u5426\u4e3a\u7a7a", "Url": "https://leetcode.cn/problems/is-object-empty/", "Ispaid": 0, "Type": "JavaScript", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2728, "Title": "Count Houses in a Circular Street", "TitleCn": "\u8ba1\u7b97\u4e00\u4e2a\u73af\u5f62\u8857\u9053\u4e0a\u7684\u623f\u5c4b\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-houses-in-a-circular-street/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2729, "Title": "Check if The Number is Fascinating", "TitleCn": "\u5224\u65ad\u4e00\u4e2a\u6570\u662f\u5426\u8ff7\u4eba", "Url": "https://leetcode.cn/problems/check-if-the-number-is-fascinating/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 106 Problem 1"}, {"ID": 2730, "Title": "Find the Longest Semi-Repetitive Substring", "TitleCn": "\u627e\u5230\u6700\u957f\u7684\u534a\u91cd\u590d\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-the-longest-semi-repetitive-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 106 Problem 2"}, {"ID": 2731, "Title": "Movement of Robots", "TitleCn": "\u79fb\u52a8\u673a\u5668\u4eba", "Url": "https://leetcode.cn/problems/movement-of-robots/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 106 Problem 3"}, {"ID": 2732, "Title": "Find a Good Subset of the Matrix", "TitleCn": "\u627e\u5230\u77e9\u9635\u4e2d\u7684\u597d\u5b50\u96c6", "Url": "https://leetcode.cn/problems/find-a-good-subset-of-the-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 106 Problem 4"}, {"ID": 2733, "Title": "Neither Minimum nor Maximum", "TitleCn": "\u65e2\u4e0d\u662f\u6700\u5c0f\u503c\u4e5f\u4e0d\u662f\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/neither-minimum-nor-maximum/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 349 Problem 1"}, {"ID": 2734, "Title": "Lexicographically Smallest String After Substring Operation", "TitleCn": "\u6267\u884c\u5b50\u4e32\u64cd\u4f5c\u540e\u7684\u5b57\u5178\u5e8f\u6700\u5c0f\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-smallest-string-after-substring-operation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 349 Problem 2"}, {"ID": 2735, "Title": "Collecting Chocolates", "TitleCn": "\u6536\u96c6\u5de7\u514b\u529b", "Url": "https://leetcode.cn/problems/collecting-chocolates/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 349 Problem 3"}, {"ID": 2736, "Title": "Maximum Sum Queries", "TitleCn": "\u6700\u5927\u548c\u67e5\u8be2", "Url": "https://leetcode.cn/problems/maximum-sum-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 349 Problem 4"}, {"ID": 2737, "Title": "Find the Closest Marked Node", "TitleCn": "\u627e\u5230\u6700\u8fd1\u7684\u6807\u8bb0\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-the-closest-marked-node/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2738, "Title": "Count Occurrences in Text", "TitleCn": "\u7edf\u8ba1\u6587\u672c\u4e2d\u5355\u8bcd\u7684\u51fa\u73b0\u6b21\u6570", "Url": "https://leetcode.cn/problems/count-occurrences-in-text/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2739, "Title": "Total Distance Traveled", "TitleCn": "\u603b\u884c\u9a76\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/total-distance-traveled/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 350 Problem 1"}, {"ID": 2740, "Title": "Find the Value of the Partition", "TitleCn": "\u627e\u51fa\u5206\u533a\u503c", "Url": "https://leetcode.cn/problems/find-the-value-of-the-partition/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 350 Problem 2"}, {"ID": 2741, "Title": "Special Permutations", "TitleCn": "\u7279\u522b\u7684\u6392\u5217", "Url": "https://leetcode.cn/problems/special-permutations/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 350 Problem 3"}, {"ID": 2742, "Title": "Painting the Walls", "TitleCn": "\u7ed9\u5899\u58c1\u5237\u6cb9\u6f06", "Url": "https://leetcode.cn/problems/painting-the-walls/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 350 Problem 4"}, {"ID": 2743, "Title": "Count Substrings Without Repeating Character", "TitleCn": "\u8ba1\u7b97\u6ca1\u6709\u91cd\u590d\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-substrings-without-repeating-character/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2744, "Title": "Find Maximum Number of String Pairs", "TitleCn": "\u6700\u5927\u5b57\u7b26\u4e32\u914d\u5bf9\u6570\u76ee", "Url": "https://leetcode.cn/problems/find-maximum-number-of-string-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 107 Problem 1"}, {"ID": 2745, "Title": "Construct the Longest New String", "TitleCn": "\u6784\u9020\u6700\u957f\u7684\u65b0\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/construct-the-longest-new-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 107 Problem 2"}, {"ID": 2746, "Title": "Decremental String Concatenation", "TitleCn": "\u5b57\u7b26\u4e32\u8fde\u63a5\u5220\u51cf\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/decremental-string-concatenation/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 107 Problem 3"}, {"ID": 2747, "Title": "Count Zero Request Servers", "TitleCn": "\u7edf\u8ba1\u6ca1\u6709\u6536\u5230\u8bf7\u6c42\u7684\u670d\u52a1\u5668\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-zero-request-servers/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 107 Problem 4"}, {"ID": 2748, "Title": "Number of Beautiful Pairs", "TitleCn": "\u7f8e\u4e3d\u4e0b\u6807\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-beautiful-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 351 Problem 1"}, {"ID": 2749, "Title": "Minimum Operations to Make the Integer Zero", "TitleCn": "\u5f97\u5230\u6574\u6570\u96f6\u9700\u8981\u6267\u884c\u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-the-integer-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 351 Problem 2"}, {"ID": 2750, "Title": "Ways to Split Array Into Good Subarrays", "TitleCn": "\u5c06\u6570\u7ec4\u5212\u5206\u6210\u82e5\u5e72\u597d\u5b50\u6570\u7ec4\u7684\u65b9\u5f0f", "Url": "https://leetcode.cn/problems/ways-to-split-array-into-good-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 351 Problem 3"}, {"ID": 2751, "Title": "Robot Collisions", "TitleCn": "\u673a\u5668\u4eba\u78b0\u649e", "Url": "https://leetcode.cn/problems/robot-collisions/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 351 Problem 4"}, {"ID": 2752, "Title": "Customers with Maximum Number of Transactions on Consecutive Days", "TitleCn": "\u5728\u8fde\u7eed\u5929\u6570\u4e0a\u8fdb\u884c\u4e86\u6700\u591a\u4ea4\u6613\u6b21\u6570\u7684\u987e\u5ba2", "Url": "https://leetcode.cn/problems/customers-with-maximum-number-of-transactions-on-consecutive-days/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2753, "Title": "Count Houses in a Circular Street II", "TitleCn": "\u8ba1\u7b97\u4e00\u4e2a\u73af\u5f62\u8857\u9053\u4e0a\u7684\u623f\u5c4b\u6570\u91cf II", "Url": "https://leetcode.cn/problems/count-houses-in-a-circular-street-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2754, "Title": "Bind Function to Context", "TitleCn": "\u5c06\u51fd\u6570\u7ed1\u5b9a\u5230\u4e0a\u4e0b\u6587", "Url": "https://leetcode.cn/problems/bind-function-to-context/", "Ispaid": 1, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2755, "Title": "Deep Merge of Two Objects", "TitleCn": "\u6df1\u5ea6\u5408\u5e76\u4e24\u4e2a\u5bf9\u8c61", "Url": "https://leetcode.cn/problems/deep-merge-of-two-objects/", "Ispaid": 1, "Type": "JavaScript", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2756, "Title": "Query Batching", "TitleCn": "\u6279\u5904\u7406\u67e5\u8be2", "Url": "https://leetcode.cn/problems/query-batching/", "Ispaid": 1, "Type": "JavaScript", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2757, "Title": "Generate Circular Array Values", "TitleCn": "\u751f\u6210\u5faa\u73af\u6570\u7ec4\u7684\u503c", "Url": "https://leetcode.cn/problems/generate-circular-array-values/", "Ispaid": 1, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2758, "Title": "Next Day", "TitleCn": "\u4e0b\u4e00\u5929", "Url": "https://leetcode.cn/problems/next-day/", "Ispaid": 1, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2759, "Title": "Convert JSON String to Object", "TitleCn": "\u5c06 JSON \u5b57\u7b26\u4e32\u8f6c\u6362\u4e3a\u5bf9\u8c61", "Url": "https://leetcode.cn/problems/convert-json-string-to-object/", "Ispaid": 1, "Type": "JavaScript", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2760, "Title": "Longest Even Odd Subarray With Threshold", "TitleCn": "\u6700\u957f\u5947\u5076\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-even-odd-subarray-with-threshold/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 352 Problem 1"}, {"ID": 2761, "Title": "Prime Pairs With Target Sum", "TitleCn": "\u548c\u7b49\u4e8e\u76ee\u6807\u503c\u7684\u8d28\u6570\u5bf9", "Url": "https://leetcode.cn/problems/prime-pairs-with-target-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 352 Problem 2"}, {"ID": 2762, "Title": "Continuous Subarrays", "TitleCn": "\u4e0d\u95f4\u65ad\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/continuous-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 352 Problem 3"}, {"ID": 2763, "Title": "Sum of Imbalance Numbers of All Subarrays", "TitleCn": "\u6240\u6709\u5b50\u6570\u7ec4\u4e2d\u4e0d\u5e73\u8861\u6570\u5b57\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-imbalance-numbers-of-all-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 352 Problem 4"}, {"ID": 2764, "Title": "Is Array a Preorder of Some \u200cBinary Tree", "TitleCn": "\u6570\u7ec4\u662f\u5426\u8868\u793a\u67d0\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/is-array-a-preorder-of-some-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2765, "Title": "Longest Alternating Subarray", "TitleCn": "\u6700\u957f\u4ea4\u66ff\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-alternating-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 108 Problem 1"}, {"ID": 2766, "Title": "Relocate Marbles", "TitleCn": "\u91cd\u65b0\u653e\u7f6e\u77f3\u5757", "Url": "https://leetcode.cn/problems/relocate-marbles/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 108 Problem 2"}, {"ID": 2767, "Title": "Partition String Into Minimum Beautiful Substrings", "TitleCn": "\u5c06\u5b57\u7b26\u4e32\u5206\u5272\u4e3a\u6700\u5c11\u7684\u7f8e\u4e3d\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/partition-string-into-minimum-beautiful-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 108 Problem 3"}, {"ID": 2768, "Title": "Number of Black Blocks", "TitleCn": "\u9ed1\u683c\u5b50\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-black-blocks/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 108 Problem 4"}, {"ID": 2769, "Title": "Find the Maximum Achievable Number", "TitleCn": "\u627e\u51fa\u6700\u5927\u7684\u53ef\u8fbe\u6210\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-the-maximum-achievable-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 353 Problem 1"}, {"ID": 2770, "Title": "Maximum Number of Jumps to Reach the Last Index", "TitleCn": "\u8fbe\u5230\u672b\u5c3e\u4e0b\u6807\u6240\u9700\u7684\u6700\u5927\u8df3\u8dc3\u6b21\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-jumps-to-reach-the-last-index/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 353 Problem 2"}, {"ID": 2771, "Title": "Longest Non-decreasing Subarray From Two Arrays", "TitleCn": "\u6784\u9020\u6700\u957f\u975e\u9012\u51cf\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-non-decreasing-subarray-from-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 353 Problem 3"}, {"ID": 2772, "Title": "Apply Operations to Make All Array Elements Equal to Zero", "TitleCn": "\u4f7f\u6570\u7ec4\u4e2d\u7684\u6240\u6709\u5143\u7d20\u90fd\u7b49\u4e8e\u96f6", "Url": "https://leetcode.cn/problems/apply-operations-to-make-all-array-elements-equal-to-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 353 Problem 4"}, {"ID": 2773, "Title": "Height of Special Binary Tree", "TitleCn": "\u7279\u6b8a\u4e8c\u53c9\u6811\u7684\u9ad8\u5ea6", "Url": "https://leetcode.cn/problems/height-of-special-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2774, "Title": "Array Upper Bound", "TitleCn": "\u6570\u7ec4\u7684\u4e0a\u754c", "Url": "https://leetcode.cn/problems/array-upper-bound/", "Ispaid": 1, "Type": "JavaScript", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2775, "Title": "Undefined to Null", "TitleCn": "\u5c06 undefined \u8f6c\u4e3a null", "Url": "https://leetcode.cn/problems/undefined-to-null/", "Ispaid": 1, "Type": "JavaScript", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2776, "Title": "Convert Callback Based Function to Promise Based Function", "TitleCn": "\u8f6c\u6362\u56de\u8c03\u51fd\u6570\u4e3a Promise \u51fd\u6570", "Url": "https://leetcode.cn/problems/convert-callback-based-function-to-promise-based-function/", "Ispaid": 1, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2777, "Title": "Date Range Generator", "TitleCn": "\u65e5\u671f\u8303\u56f4\u751f\u6210\u5668", "Url": "https://leetcode.cn/problems/date-range-generator/", "Ispaid": 1, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2778, "Title": "Sum of Squares of Special Elements", "TitleCn": "\u7279\u6b8a\u5143\u7d20\u5e73\u65b9\u548c", "Url": "https://leetcode.cn/problems/sum-of-squares-of-special-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 354 Problem 1"}, {"ID": 2779, "Title": "Maximum Beauty of an Array After Applying Operation", "TitleCn": "\u6570\u7ec4\u7684\u6700\u5927\u7f8e\u4e3d\u503c", "Url": "https://leetcode.cn/problems/maximum-beauty-of-an-array-after-applying-operation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 354 Problem 2"}, {"ID": 2780, "Title": "Minimum Index of a Valid Split", "TitleCn": "\u5408\u6cd5\u5206\u5272\u7684\u6700\u5c0f\u4e0b\u6807", "Url": "https://leetcode.cn/problems/minimum-index-of-a-valid-split/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 354 Problem 3"}, {"ID": 2781, "Title": "Length of the Longest Valid Substring", "TitleCn": "\u6700\u957f\u5408\u6cd5\u5b50\u5b57\u7b26\u4e32\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/length-of-the-longest-valid-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 354 Problem 4"}, {"ID": 2782, "Title": "Number of Unique Categories", "TitleCn": "\u552f\u4e00\u7c7b\u522b\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-unique-categories/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2783, "Title": "Flight Occupancy and Waitlist Analysis", "TitleCn": "\u822a\u73ed\u5165\u5ea7\u7387\u548c\u7b49\u5f85\u540d\u5355\u5206\u6790", "Url": "https://leetcode.cn/problems/flight-occupancy-and-waitlist-analysis/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2784, "Title": "Check if Array is Good", "TitleCn": "\u68c0\u67e5\u6570\u7ec4\u662f\u5426\u662f\u597d\u7684", "Url": "https://leetcode.cn/problems/check-if-array-is-good/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 109 Problem 1"}, {"ID": 2785, "Title": "Sort Vowels in a String", "TitleCn": "\u5c06\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3\u5b57\u6bcd\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-vowels-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 109 Problem 2"}, {"ID": 2786, "Title": "Visit Array Positions to Maximize Score", "TitleCn": "\u8bbf\u95ee\u6570\u7ec4\u4e2d\u7684\u4f4d\u7f6e\u4f7f\u5206\u6570\u6700\u5927", "Url": "https://leetcode.cn/problems/visit-array-positions-to-maximize-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 109 Problem 3"}, {"ID": 2787, "Title": "Ways to Express an Integer as Sum of Powers", "TitleCn": "\u5c06\u4e00\u4e2a\u6570\u5b57\u8868\u793a\u6210\u5e42\u7684\u548c\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/ways-to-express-an-integer-as-sum-of-powers/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 109 Problem 4"}, {"ID": 2788, "Title": "Split Strings by Separator", "TitleCn": "\u6309\u5206\u9694\u7b26\u62c6\u5206\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/split-strings-by-separator/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 355 Problem 1"}, {"ID": 2789, "Title": "Largest Element in an Array after Merge Operations", "TitleCn": "\u5408\u5e76\u540e\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u5143\u7d20", "Url": "https://leetcode.cn/problems/largest-element-in-an-array-after-merge-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 355 Problem 2"}, {"ID": 2790, "Title": "Maximum Number of Groups With Increasing Length", "TitleCn": "\u957f\u5ea6\u9012\u589e\u7ec4\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-groups-with-increasing-length/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 355 Problem 3"}, {"ID": 2791, "Title": "Count Paths That Can Form a Palindrome in a Tree", "TitleCn": "\u6811\u4e2d\u53ef\u4ee5\u5f62\u6210\u56de\u6587\u7684\u8def\u5f84\u6570", "Url": "https://leetcode.cn/problems/count-paths-that-can-form-a-palindrome-in-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 355 Problem 4"}, {"ID": 2792, "Title": "Count Nodes That Are Great Enough", "TitleCn": "\u8ba1\u7b97\u8db3\u591f\u5927\u7684\u8282\u70b9\u6570", "Url": "https://leetcode.cn/problems/count-nodes-that-are-great-enough/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2793, "Title": "Status of Flight Tickets", "TitleCn": "\u822a\u73ed\u673a\u7968\u72b6\u6001", "Url": "https://leetcode.cn/problems/status-of-flight-tickets/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2794, "Title": "Create Object from Two Arrays", "TitleCn": "\u4ece\u4e24\u4e2a\u6570\u7ec4\u4e2d\u521b\u5efa\u5bf9\u8c61", "Url": "https://leetcode.cn/problems/create-object-from-two-arrays/", "Ispaid": 1, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2795, "Title": "Parallel Execution of Promises for Individual Results Retrieval", "TitleCn": "\u5e76\u884c\u6267\u884c Promise \u4ee5\u83b7\u53d6\u72ec\u6709\u7684\u7ed3\u679c", "Url": "https://leetcode.cn/problems/parallel-execution-of-promises-for-individual-results-retrieval/", "Ispaid": 1, "Type": "JavaScript", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2796, "Title": "Repeat String", "TitleCn": "\u91cd\u590d\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/repeat-string/", "Ispaid": 1, "Type": "JavaScript", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2797, "Title": "Partial Function with Placeholders", "TitleCn": "\u5e26\u6709\u5360\u4f4d\u7b26\u7684\u90e8\u5206\u51fd\u6570", "Url": "https://leetcode.cn/problems/partial-function-with-placeholders/", "Ispaid": 1, "Type": "JavaScript", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2798, "Title": "Number of Employees Who Met the Target", "TitleCn": "\u6ee1\u8db3\u76ee\u6807\u5de5\u4f5c\u65f6\u957f\u7684\u5458\u5de5\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-employees-who-met-the-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 356 Problem 1"}, {"ID": 2799, "Title": "Count Complete Subarrays in an Array", "TitleCn": "\u7edf\u8ba1\u5b8c\u5168\u5b50\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-complete-subarrays-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 356 Problem 2"}, {"ID": 2800, "Title": "Shortest String That Contains Three Strings", "TitleCn": "\u5305\u542b\u4e09\u4e2a\u5b57\u7b26\u4e32\u7684\u6700\u77ed\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/shortest-string-that-contains-three-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 356 Problem 3"}, {"ID": 2801, "Title": "Count Stepping Numbers in Range", "TitleCn": "\u7edf\u8ba1\u8303\u56f4\u5185\u7684\u6b65\u8fdb\u6570\u5b57\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-stepping-numbers-in-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 356 Problem 4"}, {"ID": 2802, "Title": "Find The K-th Lucky Number", "TitleCn": "\u627e\u51fa\u7b2c K \u4e2a\u5e78\u8fd0\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-the-k-th-lucky-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2803, "Title": "Factorial Generator", "TitleCn": "\u9636\u4e58\u751f\u6210\u5668", "Url": "https://leetcode.cn/problems/factorial-generator/", "Ispaid": 1, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2804, "Title": "Array Prototype ForEach", "TitleCn": "\u6570\u7ec4\u539f\u578b\u7684 forEach \u65b9\u6cd5", "Url": "https://leetcode.cn/problems/array-prototype-foreach/", "Ispaid": 1, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2805, "Title": "Custom Interval", "TitleCn": "\u81ea\u5b9a\u4e49\u95f4\u9694", "Url": "https://leetcode.cn/problems/custom-interval/", "Ispaid": 1, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2806, "Title": "Account Balance After Rounded Purchase", "TitleCn": "\u53d6\u6574\u8d2d\u4e70\u540e\u7684\u8d26\u6237\u4f59\u989d", "Url": "https://leetcode.cn/problems/account-balance-after-rounded-purchase/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 110 Problem 1"}, {"ID": 2807, "Title": "Insert Greatest Common Divisors in Linked List", "TitleCn": "\u5728\u94fe\u8868\u4e2d\u63d2\u5165\u6700\u5927\u516c\u7ea6\u6570", "Url": "https://leetcode.cn/problems/insert-greatest-common-divisors-in-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 110 Problem 2"}, {"ID": 2808, "Title": "Minimum Seconds to Equalize a Circular Array", "TitleCn": "\u4f7f\u5faa\u73af\u6570\u7ec4\u6240\u6709\u5143\u7d20\u76f8\u7b49\u7684\u6700\u5c11\u79d2\u6570", "Url": "https://leetcode.cn/problems/minimum-seconds-to-equalize-a-circular-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 110 Problem 3"}, {"ID": 2809, "Title": "Minimum Time to Make Array Sum At Most x", "TitleCn": "\u4f7f\u6570\u7ec4\u548c\u5c0f\u4e8e\u7b49\u4e8e x \u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-make-array-sum-at-most-x/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 110 Problem 4"}, {"ID": 2810, "Title": "Faulty Keyboard", "TitleCn": "\u6545\u969c\u952e\u76d8", "Url": "https://leetcode.cn/problems/faulty-keyboard/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 357 Problem 1"}, {"ID": 2811, "Title": "Check if it is Possible to Split Array", "TitleCn": "\u5224\u65ad\u662f\u5426\u80fd\u62c6\u5206\u6570\u7ec4", "Url": "https://leetcode.cn/problems/check-if-it-is-possible-to-split-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 357 Problem 2"}, {"ID": 2812, "Title": "Find the Safest Path in a Grid", "TitleCn": "\u627e\u51fa\u6700\u5b89\u5168\u8def\u5f84", "Url": "https://leetcode.cn/problems/find-the-safest-path-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 357 Problem 3"}, {"ID": 2813, "Title": "Maximum Elegance of a K-Length Subsequence", "TitleCn": "\u5b50\u5e8f\u5217\u6700\u5927\u4f18\u96c5\u5ea6", "Url": "https://leetcode.cn/problems/maximum-elegance-of-a-k-length-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 357 Problem 4"}, {"ID": 2814, "Title": "Minimum Time Takes to Reach Destination Without Drowning", "TitleCn": "\u907f\u514d\u6df9\u6b7b\u5e76\u5230\u8fbe\u76ee\u7684\u5730\u7684\u6700\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-takes-to-reach-destination-without-drowning/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2815, "Title": "Max Pair Sum in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u6570\u5bf9\u548c", "Url": "https://leetcode.cn/problems/max-pair-sum-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 358 Problem 1"}, {"ID": 2816, "Title": "Double a Number Represented as a Linked List", "TitleCn": "\u7ffb\u500d\u4ee5\u94fe\u8868\u5f62\u5f0f\u8868\u793a\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/double-a-number-represented-as-a-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 358 Problem 2"}, {"ID": 2817, "Title": "Minimum Absolute Difference Between Elements With Constraint", "TitleCn": "\u9650\u5236\u6761\u4ef6\u4e0b\u5143\u7d20\u4e4b\u95f4\u7684\u6700\u5c0f\u7edd\u5bf9\u5dee", "Url": "https://leetcode.cn/problems/minimum-absolute-difference-between-elements-with-constraint/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 358 Problem 3"}, {"ID": 2818, "Title": "Apply Operations to Maximize Score", "TitleCn": "\u64cd\u4f5c\u4f7f\u5f97\u5206\u6700\u5927", "Url": "https://leetcode.cn/problems/apply-operations-to-maximize-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 358 Problem 4"}, {"ID": 2819, "Title": "Minimum Relative Loss After Buying Chocolates", "TitleCn": "\u8d2d\u4e70\u5de7\u514b\u529b\u540e\u7684\u6700\u5c0f\u76f8\u5bf9\u635f\u5931", "Url": "https://leetcode.cn/problems/minimum-relative-loss-after-buying-chocolates/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2820, "Title": "Election Results", "TitleCn": "\u9009\u4e3e\u7ed3\u679c", "Url": "https://leetcode.cn/problems/election-results/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2821, "Title": "Delay the Resolution of Each Promise", "TitleCn": "\u5ef6\u8fdf\u6bcf\u4e2a Promise \u5bf9\u8c61\u7684\u89e3\u6790", "Url": "https://leetcode.cn/problems/delay-the-resolution-of-each-promise/", "Ispaid": 1, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2822, "Title": "Inversion of Object", "TitleCn": "\u5bf9\u8c61\u53cd\u8f6c", "Url": "https://leetcode.cn/problems/inversion-of-object/", "Ispaid": 1, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2823, "Title": "Deep Object Filter", "TitleCn": "\u6df1\u5ea6\u5bf9\u8c61\u7b5b\u9009", "Url": "https://leetcode.cn/problems/deep-object-filter/", "Ispaid": 1, "Type": "JavaScript", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2824, "Title": "Count Pairs Whose Sum is Less than Target", "TitleCn": "\u7edf\u8ba1\u548c\u5c0f\u4e8e\u76ee\u6807\u7684\u4e0b\u6807\u5bf9\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-pairs-whose-sum-is-less-than-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 111 Problem 1"}, {"ID": 2825, "Title": "Make String a Subsequence Using Cyclic Increments", "TitleCn": "\u5faa\u73af\u589e\u957f\u4f7f\u5b57\u7b26\u4e32\u5b50\u5e8f\u5217\u7b49\u4e8e\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/make-string-a-subsequence-using-cyclic-increments/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 111 Problem 2"}, {"ID": 2826, "Title": "Sorting Three Groups", "TitleCn": "\u5c06\u4e09\u4e2a\u7ec4\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sorting-three-groups/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 111 Problem 3"}, {"ID": 2827, "Title": "Number of Beautiful Integers in the Range", "TitleCn": "\u8303\u56f4\u4e2d\u7f8e\u4e3d\u6574\u6570\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-beautiful-integers-in-the-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 111 Problem 4"}, {"ID": 2828, "Title": "Check if a String Is an Acronym of Words", "TitleCn": "\u5224\u522b\u9996\u5b57\u6bcd\u7f29\u7565\u8bcd", "Url": "https://leetcode.cn/problems/check-if-a-string-is-an-acronym-of-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 359 Problem 1"}, {"ID": 2829, "Title": "Determine the Minimum Sum of a k-avoiding Array", "TitleCn": "k-avoiding \u6570\u7ec4\u7684\u6700\u5c0f\u603b\u548c", "Url": "https://leetcode.cn/problems/determine-the-minimum-sum-of-a-k-avoiding-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 359 Problem 2"}, {"ID": 2830, "Title": "Maximize the Profit as the Salesman", "TitleCn": "\u9500\u552e\u5229\u6da6\u6700\u5927\u5316", "Url": "https://leetcode.cn/problems/maximize-the-profit-as-the-salesman/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 359 Problem 3"}, {"ID": 2831, "Title": "Find the Longest Equal Subarray", "TitleCn": "\u627e\u51fa\u6700\u957f\u7b49\u503c\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-the-longest-equal-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 359 Problem 4"}, {"ID": 2832, "Title": "Maximal Range That Each Element Is Maximum in It", "TitleCn": "\u6bcf\u4e2a\u5143\u7d20\u4e3a\u6700\u5927\u503c\u7684\u6700\u5927\u8303\u56f4", "Url": "https://leetcode.cn/problems/maximal-range-that-each-element-is-maximum-in-it/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2833, "Title": "Furthest Point From Origin", "TitleCn": "\u8ddd\u79bb\u539f\u70b9\u6700\u8fdc\u7684\u70b9", "Url": "https://leetcode.cn/problems/furthest-point-from-origin/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 360 Problem 1"}, {"ID": 2834, "Title": "Find the Minimum Possible Sum of a Beautiful Array", "TitleCn": "\u627e\u51fa\u7f8e\u4e3d\u6570\u7ec4\u7684\u6700\u5c0f\u548c", "Url": "https://leetcode.cn/problems/find-the-minimum-possible-sum-of-a-beautiful-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 360 Problem 2"}, {"ID": 2835, "Title": "Minimum Operations to Form Subsequence With Target Sum", "TitleCn": "\u4f7f\u5b50\u5e8f\u5217\u7684\u548c\u7b49\u4e8e\u76ee\u6807\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-form-subsequence-with-target-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 360 Problem 3"}, {"ID": 2836, "Title": "Maximize Value of Function in a Ball Passing Game", "TitleCn": "\u5728\u4f20\u7403\u6e38\u620f\u4e2d\u6700\u5927\u5316\u51fd\u6570\u503c", "Url": "https://leetcode.cn/problems/maximize-value-of-function-in-a-ball-passing-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 360 Problem 4"}, {"ID": 2837, "Title": "Total Traveled Distance", "TitleCn": "\u603b\u65c5\u884c\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/total-traveled-distance/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2838, "Title": "Maximum Coins Heroes Can Collect", "TitleCn": "\u82f1\u96c4\u53ef\u4ee5\u83b7\u5f97\u7684\u6700\u5927\u91d1\u5e01\u6570", "Url": "https://leetcode.cn/problems/maximum-coins-heroes-can-collect/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2839, "Title": "Check if Strings Can be Made Equal With Operations I", "TitleCn": "\u5224\u65ad\u901a\u8fc7\u64cd\u4f5c\u80fd\u5426\u8ba9\u5b57\u7b26\u4e32\u76f8\u7b49 I", "Url": "https://leetcode.cn/problems/check-if-strings-can-be-made-equal-with-operations-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 112 Problem 1"}, {"ID": 2840, "Title": "Check if Strings Can be Made Equal With Operations II", "TitleCn": "\u5224\u65ad\u901a\u8fc7\u64cd\u4f5c\u80fd\u5426\u8ba9\u5b57\u7b26\u4e32\u76f8\u7b49 II", "Url": "https://leetcode.cn/problems/check-if-strings-can-be-made-equal-with-operations-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 112 Problem 2"}, {"ID": 2841, "Title": "Maximum Sum of Almost Unique Subarray", "TitleCn": "\u51e0\u4e4e\u552f\u4e00\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-of-almost-unique-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 112 Problem 3"}, {"ID": 2842, "Title": "Count K-Subsequences of a String With Maximum Beauty", "TitleCn": "\u7edf\u8ba1\u4e00\u4e2a\u5b57\u7b26\u4e32\u7684 k \u5b50\u5e8f\u5217\u7f8e\u4e3d\u503c\u6700\u5927\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-k-subsequences-of-a-string-with-maximum-beauty/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 112 Problem 4"}, {"ID": 2843, "Title": "Count Symmetric Integers", "TitleCn": "\u7edf\u8ba1\u5bf9\u79f0\u6574\u6570\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-symmetric-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 361 Problem 1"}, {"ID": 2844, "Title": "Minimum Operations to Make a Special Number", "TitleCn": "\u751f\u6210\u7279\u6b8a\u6570\u5b57\u7684\u6700\u5c11\u64cd\u4f5c", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-a-special-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 361 Problem 2"}, {"ID": 2845, "Title": "Count of Interesting Subarrays", "TitleCn": "\u7edf\u8ba1\u8da3\u5473\u5b50\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-of-interesting-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 361 Problem 3"}, {"ID": 2846, "Title": "Minimum Edge Weight Equilibrium Queries in a Tree", "TitleCn": "\u8fb9\u6743\u91cd\u5747\u7b49\u67e5\u8be2", "Url": "https://leetcode.cn/problems/minimum-edge-weight-equilibrium-queries-in-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 361 Problem 4"}, {"ID": 2847, "Title": "Smallest Number With Given Digit Product", "TitleCn": "\u7ed9\u5b9a\u6570\u5b57\u4e58\u79ef\u7684\u6700\u5c0f\u6570\u5b57", "Url": "https://leetcode.cn/problems/smallest-number-with-given-digit-product/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2848, "Title": "Points That Intersect With Cars", "TitleCn": "\u4e0e\u8f66\u76f8\u4ea4\u7684\u70b9", "Url": "https://leetcode.cn/problems/points-that-intersect-with-cars/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 362 Problem 1"}, {"ID": 2849, "Title": "Determine if a Cell Is Reachable at a Given Time", "TitleCn": "\u5224\u65ad\u80fd\u5426\u5728\u7ed9\u5b9a\u65f6\u95f4\u5230\u8fbe\u5355\u5143\u683c", "Url": "https://leetcode.cn/problems/determine-if-a-cell-is-reachable-at-a-given-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 362 Problem 2"}, {"ID": 2850, "Title": "Minimum Moves to Spread Stones Over Grid", "TitleCn": "\u5c06\u77f3\u5934\u5206\u6563\u5230\u7f51\u683c\u56fe\u7684\u6700\u5c11\u79fb\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-moves-to-spread-stones-over-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 362 Problem 3"}, {"ID": 2851, "Title": "String Transformation", "TitleCn": "\u5b57\u7b26\u4e32\u8f6c\u6362", "Url": "https://leetcode.cn/problems/string-transformation/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 362 Problem 4"}, {"ID": 2852, "Title": "Sum of Remoteness of All Cells", "TitleCn": "\u6240\u6709\u5355\u5143\u683c\u7684\u8fdc\u79bb\u7a0b\u5ea6\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-remoteness-of-all-cells/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2853, "Title": "Highest Salaries Difference", "TitleCn": "\u6700\u9ad8\u85aa\u6c34\u5dee\u5f02", "Url": "https://leetcode.cn/problems/highest-salaries-difference/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2854, "Title": "Rolling Average Steps", "TitleCn": "\u6eda\u52a8\u5e73\u5747\u6b65\u6570", "Url": "https://leetcode.cn/problems/rolling-average-steps/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2855, "Title": "Minimum Right Shifts to Sort the Array", "TitleCn": "\u4f7f\u6570\u7ec4\u6210\u4e3a\u9012\u589e\u6570\u7ec4\u7684\u6700\u5c11\u53f3\u79fb\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-right-shifts-to-sort-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 113 Problem 1"}, {"ID": 2856, "Title": "Minimum Array Length After Pair Removals", "TitleCn": "\u5220\u9664\u6570\u5bf9\u540e\u7684\u6700\u5c0f\u6570\u7ec4\u957f\u5ea6", "Url": "https://leetcode.cn/problems/minimum-array-length-after-pair-removals/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 113 Problem 2"}, {"ID": 2857, "Title": "Count Pairs of Points With Distance k", "TitleCn": "\u7edf\u8ba1\u8ddd\u79bb\u4e3a k \u7684\u70b9\u5bf9", "Url": "https://leetcode.cn/problems/count-pairs-of-points-with-distance-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 113 Problem 3"}, {"ID": 2858, "Title": "Minimum Edge Reversals So Every Node Is Reachable", "TitleCn": "\u53ef\u4ee5\u5230\u8fbe\u6bcf\u4e00\u4e2a\u8282\u70b9\u7684\u6700\u5c11\u8fb9\u53cd\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-edge-reversals-so-every-node-is-reachable/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 113 Problem 4"}, {"ID": 2859, "Title": "Sum of Values at Indices With K Set Bits", "TitleCn": "\u8ba1\u7b97 K \u7f6e\u4f4d\u4e0b\u6807\u5bf9\u5e94\u5143\u7d20\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-values-at-indices-with-k-set-bits/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 363 Problem 1"}, {"ID": 2860, "Title": "Happy Students", "TitleCn": "\u8ba9\u6240\u6709\u5b66\u751f\u4fdd\u6301\u5f00\u5fc3\u7684\u5206\u7ec4\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/happy-students/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 363 Problem 2"}, {"ID": 2861, "Title": "Maximum Number of Alloys", "TitleCn": "\u6700\u5927\u5408\u91d1\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-alloys/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 363 Problem 3"}, {"ID": 2862, "Title": "Maximum Element-Sum of a Complete Subset of Indices", "TitleCn": "\u5b8c\u5168\u5b50\u96c6\u7684\u6700\u5927\u5143\u7d20\u548c", "Url": "https://leetcode.cn/problems/maximum-element-sum-of-a-complete-subset-of-indices/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 363 Problem 4"}, {"ID": 2863, "Title": "Maximum Length of Semi-Decreasing Subarrays", "TitleCn": "\u6700\u957f\u534a\u9012\u51cf\u5b50\u6570\u7ec4\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/maximum-length-of-semi-decreasing-subarrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2864, "Title": "Maximum Odd Binary Number", "TitleCn": "\u6700\u5927\u4e8c\u8fdb\u5236\u5947\u6570", "Url": "https://leetcode.cn/problems/maximum-odd-binary-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 364 Problem 1"}, {"ID": 2865, "Title": "Beautiful Towers I", "TitleCn": "\u7f8e\u4e3d\u5854 I", "Url": "https://leetcode.cn/problems/beautiful-towers-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 364 Problem 2"}, {"ID": 2866, "Title": "Beautiful Towers II", "TitleCn": "\u7f8e\u4e3d\u5854 II", "Url": "https://leetcode.cn/problems/beautiful-towers-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 364 Problem 3"}, {"ID": 2867, "Title": "Count Valid Paths in a Tree", "TitleCn": "\u7edf\u8ba1\u6811\u4e2d\u7684\u5408\u6cd5\u8def\u5f84\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-valid-paths-in-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 364 Problem 4"}, {"ID": 2868, "Title": "The Wording Game", "TitleCn": "\u5355\u8bcd\u6e38\u620f", "Url": "https://leetcode.cn/problems/the-wording-game/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2869, "Title": "Minimum Operations to Collect Elements", "TitleCn": "\u6536\u96c6\u5143\u7d20\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-collect-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 114 Problem 1"}, {"ID": 2870, "Title": "Minimum Number of Operations to Make Array Empty", "TitleCn": "\u4f7f\u6570\u7ec4\u4e3a\u7a7a\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-array-empty/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 114 Problem 2"}, {"ID": 2871, "Title": "Split Array Into Maximum Number of Subarrays", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u5272\u6210\u6700\u591a\u6570\u76ee\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/split-array-into-maximum-number-of-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 114 Problem 3"}, {"ID": 2872, "Title": "Maximum Number of K-Divisible Components", "TitleCn": "\u53ef\u4ee5\u88ab K \u6574\u9664\u8fde\u901a\u5757\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-k-divisible-components/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 114 Problem 4"}, {"ID": 2873, "Title": "Maximum Value of an Ordered Triplet I", "TitleCn": "\u6709\u5e8f\u4e09\u5143\u7ec4\u4e2d\u7684\u6700\u5927\u503c I", "Url": "https://leetcode.cn/problems/maximum-value-of-an-ordered-triplet-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 365 Problem 1"}, {"ID": 2874, "Title": "Maximum Value of an Ordered Triplet II", "TitleCn": "\u6709\u5e8f\u4e09\u5143\u7ec4\u4e2d\u7684\u6700\u5927\u503c II", "Url": "https://leetcode.cn/problems/maximum-value-of-an-ordered-triplet-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 365 Problem 2"}, {"ID": 2875, "Title": "Minimum Size Subarray in Infinite Array", "TitleCn": "\u65e0\u9650\u6570\u7ec4\u7684\u6700\u77ed\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/minimum-size-subarray-in-infinite-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 365 Problem 3"}, {"ID": 2876, "Title": "Count Visited Nodes in a Directed Graph", "TitleCn": "\u6709\u5411\u56fe\u8bbf\u95ee\u8ba1\u6570", "Url": "https://leetcode.cn/problems/count-visited-nodes-in-a-directed-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 365 Problem 4"}, {"ID": 2877, "Title": "Create a DataFrame from List", "TitleCn": "\u4ece\u8868\u4e2d\u521b\u5efa DataFrame", "Url": "https://leetcode.cn/problems/create-a-dataframe-from-list/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2878, "Title": "Get the Size of a DataFrame", "TitleCn": "\u83b7\u53d6 DataFrame \u7684\u5927\u5c0f", "Url": "https://leetcode.cn/problems/get-the-size-of-a-dataframe/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2879, "Title": "Display the First Three Rows", "TitleCn": "\u663e\u793a\u524d\u4e09\u884c", "Url": "https://leetcode.cn/problems/display-the-first-three-rows/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2880, "Title": "Select Data", "TitleCn": "\u6570\u636e\u9009\u53d6", "Url": "https://leetcode.cn/problems/select-data/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2881, "Title": "Create a New Column", "TitleCn": "\u521b\u5efa\u65b0\u5217", "Url": "https://leetcode.cn/problems/create-a-new-column/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2882, "Title": "Drop Duplicate Rows", "TitleCn": "\u5220\u53bb\u91cd\u590d\u7684\u884c", "Url": "https://leetcode.cn/problems/drop-duplicate-rows/", "Ispaid": 0, "Type": "pandas", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2883, "Title": "Drop Missing Data", "TitleCn": "\u5220\u53bb\u4e22\u5931\u7684\u6570\u636e", "Url": "https://leetcode.cn/problems/drop-missing-data/", "Ispaid": 0, "Type": "pandas", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2884, "Title": "Modify Columns", "TitleCn": "\u4fee\u6539\u5217", "Url": "https://leetcode.cn/problems/modify-columns/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2885, "Title": "Rename Columns", "TitleCn": "\u91cd\u547d\u540d\u5217", "Url": "https://leetcode.cn/problems/rename-columns/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2886, "Title": "Change Data Type", "TitleCn": "\u6539\u53d8\u6570\u636e\u7c7b\u578b", "Url": "https://leetcode.cn/problems/change-data-type/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2887, "Title": "Fill Missing Data", "TitleCn": "\u586b\u5145\u7f3a\u5931\u503c", "Url": "https://leetcode.cn/problems/fill-missing-data/", "Ispaid": 0, "Type": "pandas", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2888, "Title": "Reshape Data: Concatenate", "TitleCn": "\u91cd\u5851\u6570\u636e\uff1a\u8fde\u7ed3", "Url": "https://leetcode.cn/problems/reshape-data-concatenate/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2889, "Title": "Reshape Data: Pivot", "TitleCn": "\u6570\u636e\u91cd\u5851\uff1a\u900f\u89c6", "Url": "https://leetcode.cn/problems/reshape-data-pivot/", "Ispaid": 0, "Type": "pandas", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2890, "Title": "Reshape Data: Melt", "TitleCn": "\u91cd\u5851\u6570\u636e\uff1a\u878d\u5408", "Url": "https://leetcode.cn/problems/reshape-data-melt/", "Ispaid": 0, "Type": "pandas", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2891, "Title": "Method Chaining", "TitleCn": "\u65b9\u6cd5\u94fe", "Url": "https://leetcode.cn/problems/method-chaining/", "Ispaid": 0, "Type": "pandas", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2892, "Title": "Minimizing Array After Replacing Pairs With Their Product", "TitleCn": "\u5c06\u76f8\u90bb\u5143\u7d20\u76f8\u4e58\u540e\u5f97\u5230\u6700\u5c0f\u5316\u6570\u7ec4", "Url": "https://leetcode.cn/problems/minimizing-array-after-replacing-pairs-with-their-product/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2893, "Title": "Calculate Orders Within Each Interval", "TitleCn": "\u8ba1\u7b97\u6bcf\u4e2a\u533a\u95f4\u5185\u7684\u8ba2\u5355", "Url": "https://leetcode.cn/problems/calculate-orders-within-each-interval/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2894, "Title": "Divisible and Non-divisible Sums Difference", "TitleCn": "\u5206\u7c7b\u6c42\u548c\u5e76\u4f5c\u5dee", "Url": "https://leetcode.cn/problems/divisible-and-non-divisible-sums-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 366 Problem 1"}, {"ID": 2895, "Title": "Minimum Processing Time", "TitleCn": "\u6700\u5c0f\u5904\u7406\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-processing-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 366 Problem 2"}, {"ID": 2896, "Title": "Apply Operations to Make Two Strings Equal", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u4f7f\u4e24\u4e2a\u5b57\u7b26\u4e32\u76f8\u7b49", "Url": "https://leetcode.cn/problems/apply-operations-to-make-two-strings-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 366 Problem 3"}, {"ID": 2897, "Title": "Apply Operations on Array to Maximize Sum of Squares", "TitleCn": "\u5bf9\u6570\u7ec4\u6267\u884c\u64cd\u4f5c\u4f7f\u5e73\u65b9\u548c\u6700\u5927", "Url": "https://leetcode.cn/problems/apply-operations-on-array-to-maximize-sum-of-squares/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 366 Problem 4"}, {"ID": 2898, "Title": "Maximum Linear Stock Score", "TitleCn": "\u6700\u5927\u7ebf\u6027\u80a1\u7968\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-linear-stock-score/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2899, "Title": "Last Visited Integers", "TitleCn": "\u4e0a\u4e00\u4e2a\u904d\u5386\u7684\u6574\u6570", "Url": "https://leetcode.cn/problems/last-visited-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 115 Problem 1"}, {"ID": 2900, "Title": "Longest Unequal Adjacent Groups Subsequence I", "TitleCn": "\u6700\u957f\u76f8\u90bb\u4e0d\u76f8\u7b49\u5b50\u5e8f\u5217 I", "Url": "https://leetcode.cn/problems/longest-unequal-adjacent-groups-subsequence-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 115 Problem 2"}, {"ID": 2901, "Title": "Longest Unequal Adjacent Groups Subsequence II", "TitleCn": "\u6700\u957f\u76f8\u90bb\u4e0d\u76f8\u7b49\u5b50\u5e8f\u5217 II", "Url": "https://leetcode.cn/problems/longest-unequal-adjacent-groups-subsequence-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 115 Problem 3"}, {"ID": 2902, "Title": "Count of Sub-Multisets With Bounded Sum", "TitleCn": "\u548c\u5e26\u9650\u5236\u7684\u5b50\u591a\u91cd\u96c6\u5408\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-of-sub-multisets-with-bounded-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 115 Problem 4"}, {"ID": 2903, "Title": "Find Indices With Index and Value Difference I", "TitleCn": "\u627e\u51fa\u6ee1\u8db3\u5dee\u503c\u6761\u4ef6\u7684\u4e0b\u6807 I", "Url": "https://leetcode.cn/problems/find-indices-with-index-and-value-difference-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 367 Problem 1"}, {"ID": 2904, "Title": "Shortest and Lexicographically Smallest Beautiful String", "TitleCn": "\u6700\u77ed\u4e14\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u7f8e\u4e3d\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/shortest-and-lexicographically-smallest-beautiful-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 367 Problem 2"}, {"ID": 2905, "Title": "Find Indices With Index and Value Difference II", "TitleCn": "\u627e\u51fa\u6ee1\u8db3\u5dee\u503c\u6761\u4ef6\u7684\u4e0b\u6807 II", "Url": "https://leetcode.cn/problems/find-indices-with-index-and-value-difference-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 367 Problem 3"}, {"ID": 2906, "Title": "Construct Product Matrix", "TitleCn": "\u6784\u9020\u4e58\u79ef\u77e9\u9635", "Url": "https://leetcode.cn/problems/construct-product-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 367 Problem 4"}, {"ID": 2907, "Title": "Maximum Profitable Triplets With Increasing Prices I", "TitleCn": "\u4ef7\u683c\u9012\u589e\u7684\u6700\u5927\u5229\u6da6\u4e09\u5143\u7ec4 I", "Url": "https://leetcode.cn/problems/maximum-profitable-triplets-with-increasing-prices-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2908, "Title": "Minimum Sum of Mountain Triplets I", "TitleCn": "\u5143\u7d20\u548c\u6700\u5c0f\u7684\u5c71\u5f62\u4e09\u5143\u7ec4 I", "Url": "https://leetcode.cn/problems/minimum-sum-of-mountain-triplets-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 368 Problem 1"}, {"ID": 2909, "Title": "Minimum Sum of Mountain Triplets II", "TitleCn": "\u5143\u7d20\u548c\u6700\u5c0f\u7684\u5c71\u5f62\u4e09\u5143\u7ec4 II", "Url": "https://leetcode.cn/problems/minimum-sum-of-mountain-triplets-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 368 Problem 2"}, {"ID": 2910, "Title": "Minimum Number of Groups to Create a Valid Assignment", "TitleCn": "\u5408\u6cd5\u5206\u7ec4\u7684\u6700\u5c11\u7ec4\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-groups-to-create-a-valid-assignment/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 368 Problem 3"}, {"ID": 2911, "Title": "Minimum Changes to Make K Semi-palindromes", "TitleCn": "\u5f97\u5230 K \u4e2a\u534a\u56de\u6587\u4e32\u7684\u6700\u5c11\u4fee\u6539\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-changes-to-make-k-semi-palindromes/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 368 Problem 4"}, {"ID": 2912, "Title": "Number of Ways to Reach Destination in the Grid", "TitleCn": "\u5728\u7f51\u683c\u4e0a\u79fb\u52a8\u5230\u76ee\u7684\u5730\u7684\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-reach-destination-in-the-grid/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2913, "Title": "Subarrays Distinct Element Sum of Squares I", "TitleCn": "\u5b50\u6570\u7ec4\u4e0d\u540c\u5143\u7d20\u6570\u76ee\u7684\u5e73\u65b9\u548c I", "Url": "https://leetcode.cn/problems/subarrays-distinct-element-sum-of-squares-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 116 Problem 1"}, {"ID": 2914, "Title": "Minimum Number of Changes to Make Binary String Beautiful", "TitleCn": "\u4f7f\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u53d8\u7f8e\u4e3d\u7684\u6700\u5c11\u4fee\u6539\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-changes-to-make-binary-string-beautiful/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 116 Problem 2"}, {"ID": 2915, "Title": "Length of the Longest Subsequence That Sums to Target", "TitleCn": "\u548c\u4e3a\u76ee\u6807\u503c\u7684\u6700\u957f\u5b50\u5e8f\u5217\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/length-of-the-longest-subsequence-that-sums-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 116 Problem 3"}, {"ID": 2916, "Title": "Subarrays Distinct Element Sum of Squares II", "TitleCn": "\u5b50\u6570\u7ec4\u4e0d\u540c\u5143\u7d20\u6570\u76ee\u7684\u5e73\u65b9\u548c II", "Url": "https://leetcode.cn/problems/subarrays-distinct-element-sum-of-squares-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 116 Problem 4"}, {"ID": 2917, "Title": "Find the K-or of an Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684 K-or \u503c", "Url": "https://leetcode.cn/problems/find-the-k-or-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 369 Problem 1"}, {"ID": 2918, "Title": "Minimum Equal Sum of Two Arrays After Replacing Zeros", "TitleCn": "\u6570\u7ec4\u7684\u6700\u5c0f\u76f8\u7b49\u548c", "Url": "https://leetcode.cn/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 369 Problem 2"}, {"ID": 2919, "Title": "Minimum Increment Operations to Make Array Beautiful", "TitleCn": "\u4f7f\u6570\u7ec4\u53d8\u7f8e\u7684\u6700\u5c0f\u589e\u91cf\u8fd0\u7b97\u6570", "Url": "https://leetcode.cn/problems/minimum-increment-operations-to-make-array-beautiful/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 369 Problem 3"}, {"ID": 2920, "Title": "Maximum Points After Collecting Coins From All Nodes", "TitleCn": "\u6536\u96c6\u6240\u6709\u91d1\u5e01\u53ef\u83b7\u5f97\u7684\u6700\u5927\u79ef\u5206", "Url": "https://leetcode.cn/problems/maximum-points-after-collecting-coins-from-all-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 369 Problem 4"}, {"ID": 2921, "Title": "Maximum Profitable Triplets With Increasing Prices II", "TitleCn": "\u4ef7\u683c\u9012\u589e\u7684\u6700\u5927\u5229\u6da6\u4e09\u5143\u7ec4 II", "Url": "https://leetcode.cn/problems/maximum-profitable-triplets-with-increasing-prices-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2922, "Title": "Market Analysis III", "TitleCn": "\u5e02\u573a\u5206\u6790 III", "Url": "https://leetcode.cn/problems/market-analysis-iii/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2923, "Title": "Find Champion I", "TitleCn": "\u627e\u5230\u51a0\u519b I", "Url": "https://leetcode.cn/problems/find-champion-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 370 Problem 1"}, {"ID": 2924, "Title": "Find Champion II", "TitleCn": "\u627e\u5230\u51a0\u519b II", "Url": "https://leetcode.cn/problems/find-champion-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 370 Problem 2"}, {"ID": 2925, "Title": "Maximum Score After Applying Operations on a Tree", "TitleCn": "\u5728\u6811\u4e0a\u6267\u884c\u64cd\u4f5c\u4ee5\u540e\u5f97\u5230\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-score-after-applying-operations-on-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 370 Problem 3"}, {"ID": 2926, "Title": "Maximum Balanced Subsequence Sum", "TitleCn": "\u5e73\u8861\u5b50\u5e8f\u5217\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-balanced-subsequence-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 370 Problem 4"}, {"ID": 2927, "Title": "Distribute Candies Among Children III", "TitleCn": "\u7ed9\u5c0f\u670b\u53cb\u4eec\u5206\u7cd6\u679c III", "Url": "https://leetcode.cn/problems/distribute-candies-among-children-iii/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2928, "Title": "Distribute Candies Among Children I", "TitleCn": "\u7ed9\u5c0f\u670b\u53cb\u4eec\u5206\u7cd6\u679c I", "Url": "https://leetcode.cn/problems/distribute-candies-among-children-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 117 Problem 1"}, {"ID": 2929, "Title": "Distribute Candies Among Children II", "TitleCn": "\u7ed9\u5c0f\u670b\u53cb\u4eec\u5206\u7cd6\u679c II", "Url": "https://leetcode.cn/problems/distribute-candies-among-children-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 117 Problem 2"}, {"ID": 2930, "Title": "Number of Strings Which Can Be Rearranged to Contain Substring", "TitleCn": "\u91cd\u65b0\u6392\u5217\u540e\u5305\u542b\u6307\u5b9a\u5b50\u5b57\u7b26\u4e32\u7684\u5b57\u7b26\u4e32\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-strings-which-can-be-rearranged-to-contain-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 117 Problem 3"}, {"ID": 2931, "Title": "Maximum Spending After Buying Items", "TitleCn": "\u8d2d\u4e70\u7269\u54c1\u7684\u6700\u5927\u5f00\u9500", "Url": "https://leetcode.cn/problems/maximum-spending-after-buying-items/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 117 Problem 4"}, {"ID": 2932, "Title": "Maximum Strong Pair XOR I", "TitleCn": "\u627e\u51fa\u5f3a\u6570\u5bf9\u7684\u6700\u5927\u5f02\u6216\u503c I", "Url": "https://leetcode.cn/problems/maximum-strong-pair-xor-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 371 Problem 1"}, {"ID": 2933, "Title": "High-Access Employees", "TitleCn": "\u9ad8\u8bbf\u95ee\u5458\u5de5", "Url": "https://leetcode.cn/problems/high-access-employees/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 371 Problem 2"}, {"ID": 2934, "Title": "Minimum Operations to Maximize Last Elements in Arrays", "TitleCn": "\u6700\u5927\u5316\u6570\u7ec4\u672b\u4f4d\u5143\u7d20\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-maximize-last-elements-in-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 371 Problem 3"}, {"ID": 2935, "Title": "Maximum Strong Pair XOR II", "TitleCn": "\u627e\u51fa\u5f3a\u6570\u5bf9\u7684\u6700\u5927\u5f02\u6216\u503c II", "Url": "https://leetcode.cn/problems/maximum-strong-pair-xor-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 371 Problem 4"}, {"ID": 2936, "Title": "Number of Equal Numbers Blocks", "TitleCn": "\u5305\u542b\u76f8\u7b49\u503c\u6570\u5b57\u5757\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-equal-numbers-blocks/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2937, "Title": "Make Three Strings Equal", "TitleCn": "\u4f7f\u4e09\u4e2a\u5b57\u7b26\u4e32\u76f8\u7b49", "Url": "https://leetcode.cn/problems/make-three-strings-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 372 Problem 1"}, {"ID": 2938, "Title": "Separate Black and White Balls", "TitleCn": "\u533a\u5206\u9ed1\u7403\u4e0e\u767d\u7403", "Url": "https://leetcode.cn/problems/separate-black-and-white-balls/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 372 Problem 2"}, {"ID": 2939, "Title": "Maximum Xor Product", "TitleCn": "\u6700\u5927\u5f02\u6216\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-xor-product/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 372 Problem 3"}, {"ID": 2940, "Title": "Find Building Where Alice and Bob Can Meet", "TitleCn": "\u627e\u5230 Alice \u548c Bob \u53ef\u4ee5\u76f8\u9047\u7684\u5efa\u7b51", "Url": "https://leetcode.cn/problems/find-building-where-alice-and-bob-can-meet/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 372 Problem 4"}, {"ID": 2941, "Title": "Maximum GCD-Sum of a Subarray", "TitleCn": "\u5b50\u6570\u7ec4\u7684\u6700\u5927 GCD-Sum", "Url": "https://leetcode.cn/problems/maximum-gcd-sum-of-a-subarray/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2942, "Title": "Find Words Containing Character", "TitleCn": "\u67e5\u627e\u5305\u542b\u7ed9\u5b9a\u5b57\u7b26\u7684\u5355\u8bcd", "Url": "https://leetcode.cn/problems/find-words-containing-character/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 118 Problem 1"}, {"ID": 2943, "Title": "Maximize Area of Square Hole in Grid", "TitleCn": "\u6700\u5927\u5316\u7f51\u683c\u56fe\u4e2d\u6b63\u65b9\u5f62\u7a7a\u6d1e\u7684\u9762\u79ef", "Url": "https://leetcode.cn/problems/maximize-area-of-square-hole-in-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 118 Problem 2"}, {"ID": 2944, "Title": "Minimum Number of Coins for Fruits", "TitleCn": "\u8d2d\u4e70\u6c34\u679c\u9700\u8981\u7684\u6700\u5c11\u91d1\u5e01\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-coins-for-fruits/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 118 Problem 3"}, {"ID": 2945, "Title": "Find Maximum Non-decreasing Array Length", "TitleCn": "\u627e\u5230\u6700\u5927\u975e\u9012\u51cf\u6570\u7ec4\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/find-maximum-non-decreasing-array-length/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 118 Problem 4"}, {"ID": 2946, "Title": "Matrix Similarity After Cyclic Shifts", "TitleCn": "\u5faa\u73af\u79fb\u4f4d\u540e\u7684\u77e9\u9635\u76f8\u4f3c\u68c0\u67e5", "Url": "https://leetcode.cn/problems/matrix-similarity-after-cyclic-shifts/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 373 Problem 1"}, {"ID": 2947, "Title": "Count Beautiful Substrings I", "TitleCn": "\u7edf\u8ba1\u7f8e\u4e3d\u5b50\u5b57\u7b26\u4e32 I", "Url": "https://leetcode.cn/problems/count-beautiful-substrings-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 373 Problem 2"}, {"ID": 2948, "Title": "Make Lexicographically Smallest Array by Swapping Elements", "TitleCn": "\u4ea4\u6362\u5f97\u5230\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u6570\u7ec4", "Url": "https://leetcode.cn/problems/make-lexicographically-smallest-array-by-swapping-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 373 Problem 3"}, {"ID": 2949, "Title": "Count Beautiful Substrings II", "TitleCn": "\u7edf\u8ba1\u7f8e\u4e3d\u5b50\u5b57\u7b26\u4e32 II", "Url": "https://leetcode.cn/problems/count-beautiful-substrings-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 373 Problem 4"}, {"ID": 2950, "Title": "Number of Divisible Substrings", "TitleCn": "\u53ef\u6574\u9664\u5b50\u4e32\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-divisible-substrings/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2951, "Title": "Find the Peaks", "TitleCn": "\u627e\u51fa\u5cf0\u503c", "Url": "https://leetcode.cn/problems/find-the-peaks/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 374 Problem 1"}, {"ID": 2952, "Title": "Minimum Number of Coins to be Added", "TitleCn": "\u9700\u8981\u6dfb\u52a0\u7684\u786c\u5e01\u7684\u6700\u5c0f\u6570\u91cf", "Url": "https://leetcode.cn/problems/minimum-number-of-coins-to-be-added/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 374 Problem 2"}, {"ID": 2953, "Title": "Count Complete Substrings", "TitleCn": "\u7edf\u8ba1\u5b8c\u5168\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/count-complete-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 374 Problem 3"}, {"ID": 2954, "Title": "Count the Number of Infection Sequences", "TitleCn": "\u7edf\u8ba1\u611f\u5192\u5e8f\u5217\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-infection-sequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 374 Problem 4"}, {"ID": 2955, "Title": "Number of Same-End Substrings", "TitleCn": "\u540c\u7aef\u5b50\u4e32\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-same-end-substrings/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2956, "Title": "Find Common Elements Between Two Arrays", "TitleCn": "\u627e\u5230\u4e24\u4e2a\u6570\u7ec4\u4e2d\u7684\u516c\u5171\u5143\u7d20", "Url": "https://leetcode.cn/problems/find-common-elements-between-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 119 Problem 1"}, {"ID": 2957, "Title": "Remove Adjacent Almost-Equal Characters", "TitleCn": "\u6d88\u9664\u76f8\u90bb\u8fd1\u4f3c\u76f8\u7b49\u5b57\u7b26", "Url": "https://leetcode.cn/problems/remove-adjacent-almost-equal-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 119 Problem 2"}, {"ID": 2958, "Title": "Length of Longest Subarray With at Most K Frequency", "TitleCn": "\u6700\u591a K \u4e2a\u91cd\u590d\u5143\u7d20\u7684\u6700\u957f\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/length-of-longest-subarray-with-at-most-k-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 119 Problem 3"}, {"ID": 2959, "Title": "Number of Possible Sets of Closing Branches", "TitleCn": "\u5173\u95ed\u5206\u90e8\u7684\u53ef\u884c\u96c6\u5408\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-possible-sets-of-closing-branches/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 119 Problem 4"}, {"ID": 2960, "Title": "Count Tested Devices After Test Operations", "TitleCn": "\u7edf\u8ba1\u5df2\u6d4b\u8bd5\u8bbe\u5907", "Url": "https://leetcode.cn/problems/count-tested-devices-after-test-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 375 Problem 1"}, {"ID": 2961, "Title": "Double Modular Exponentiation", "TitleCn": "\u53cc\u6a21\u5e42\u8fd0\u7b97", "Url": "https://leetcode.cn/problems/double-modular-exponentiation/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 375 Problem 2"}, {"ID": 2962, "Title": "Count Subarrays Where Max Element Appears at Least K Times", "TitleCn": "\u7edf\u8ba1\u6700\u5927\u5143\u7d20\u51fa\u73b0\u81f3\u5c11 K \u6b21\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/count-subarrays-where-max-element-appears-at-least-k-times/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 375 Problem 3"}, {"ID": 2963, "Title": "Count the Number of Good Partitions", "TitleCn": "\u7edf\u8ba1\u597d\u5206\u5272\u65b9\u6848\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-good-partitions/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 375 Problem 4"}, {"ID": 2964, "Title": "Number of Divisible Triplet Sums", "TitleCn": "\u53ef\u88ab\u6574\u9664\u7684\u4e09\u5143\u7ec4\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-divisible-triplet-sums/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2965, "Title": "Find Missing and Repeated Values", "TitleCn": "\u627e\u51fa\u7f3a\u5931\u548c\u91cd\u590d\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-missing-and-repeated-values/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 376 Problem 1"}, {"ID": 2966, "Title": "Divide Array Into Arrays With Max Difference", "TitleCn": "\u5212\u5206\u6570\u7ec4\u5e76\u6ee1\u8db3\u6700\u5927\u5dee\u9650\u5236", "Url": "https://leetcode.cn/problems/divide-array-into-arrays-with-max-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 376 Problem 2"}, {"ID": 2967, "Title": "Minimum Cost to Make Array Equalindromic", "TitleCn": "\u4f7f\u6570\u7ec4\u6210\u4e3a\u7b49\u6570\u6570\u7ec4\u7684\u6700\u5c0f\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-to-make-array-equalindromic/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 376 Problem 3"}, {"ID": 2968, "Title": "Apply Operations to Maximize Frequency Score", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u4f7f\u9891\u7387\u5206\u6570\u6700\u5927", "Url": "https://leetcode.cn/problems/apply-operations-to-maximize-frequency-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 376 Problem 4"}, {"ID": 2969, "Title": "Minimum Number of Coins for Fruits II", "TitleCn": "\u8d2d\u4e70\u6c34\u679c\u9700\u8981\u7684\u6700\u5c11\u91d1\u5e01\u6570 II", "Url": "https://leetcode.cn/problems/minimum-number-of-coins-for-fruits-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2970, "Title": "Count the Number of Incremovable Subarrays I", "TitleCn": "\u7edf\u8ba1\u79fb\u9664\u9012\u589e\u5b50\u6570\u7ec4\u7684\u6570\u76ee I", "Url": "https://leetcode.cn/problems/count-the-number-of-incremovable-subarrays-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 120 Problem 1"}, {"ID": 2971, "Title": "Find Polygon With the Largest Perimeter", "TitleCn": "\u627e\u5230\u6700\u5927\u5468\u957f\u7684\u591a\u8fb9\u5f62", "Url": "https://leetcode.cn/problems/find-polygon-with-the-largest-perimeter/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 120 Problem 2"}, {"ID": 2972, "Title": "Count the Number of Incremovable Subarrays II", "TitleCn": "\u7edf\u8ba1\u79fb\u9664\u9012\u589e\u5b50\u6570\u7ec4\u7684\u6570\u76ee II", "Url": "https://leetcode.cn/problems/count-the-number-of-incremovable-subarrays-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 120 Problem 3"}, {"ID": 2973, "Title": "Find Number of Coins to Place in Tree Nodes", "TitleCn": "\u6811\u4e2d\u6bcf\u4e2a\u8282\u70b9\u653e\u7f6e\u7684\u91d1\u5e01\u6570\u76ee", "Url": "https://leetcode.cn/problems/find-number-of-coins-to-place-in-tree-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 120 Problem 4"}, {"ID": 2974, "Title": "Minimum Number Game", "TitleCn": "\u6700\u5c0f\u6570\u5b57\u6e38\u620f", "Url": "https://leetcode.cn/problems/minimum-number-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 377 Problem 1"}, {"ID": 2975, "Title": "Maximum Square Area by Removing Fences From a Field", "TitleCn": "\u79fb\u9664\u6805\u680f\u5f97\u5230\u7684\u6b63\u65b9\u5f62\u7530\u5730\u7684\u6700\u5927\u9762\u79ef", "Url": "https://leetcode.cn/problems/maximum-square-area-by-removing-fences-from-a-field/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 377 Problem 2"}, {"ID": 2976, "Title": "Minimum Cost to Convert String I", "TitleCn": "\u8f6c\u6362\u5b57\u7b26\u4e32\u7684\u6700\u5c0f\u6210\u672c I", "Url": "https://leetcode.cn/problems/minimum-cost-to-convert-string-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 377 Problem 3"}, {"ID": 2977, "Title": "Minimum Cost to Convert String II", "TitleCn": "\u8f6c\u6362\u5b57\u7b26\u4e32\u7684\u6700\u5c0f\u6210\u672c II", "Url": "https://leetcode.cn/problems/minimum-cost-to-convert-string-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 377 Problem 4"}, {"ID": 2978, "Title": "Symmetric Coordinates", "TitleCn": "\u5bf9\u79f0\u5750\u6807", "Url": "https://leetcode.cn/problems/symmetric-coordinates/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2979, "Title": "Most Expensive Item That Can Not Be Bought", "TitleCn": "\u6700\u8d35\u7684\u65e0\u6cd5\u8d2d\u4e70\u7684\u5546\u54c1", "Url": "https://leetcode.cn/problems/most-expensive-item-that-can-not-be-bought/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2980, "Title": "Check if Bitwise OR Has Trailing Zeros", "TitleCn": "\u68c0\u67e5\u6309\u4f4d\u6216\u662f\u5426\u5b58\u5728\u5c3e\u968f\u96f6", "Url": "https://leetcode.cn/problems/check-if-bitwise-or-has-trailing-zeros/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 378 Problem 1"}, {"ID": 2981, "Title": "Find Longest Special Substring That Occurs Thrice I", "TitleCn": "\u627e\u51fa\u51fa\u73b0\u81f3\u5c11\u4e09\u6b21\u7684\u6700\u957f\u7279\u6b8a\u5b50\u5b57\u7b26\u4e32 I", "Url": "https://leetcode.cn/problems/find-longest-special-substring-that-occurs-thrice-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 378 Problem 2"}, {"ID": 2982, "Title": "Find Longest Special Substring That Occurs Thrice II", "TitleCn": "\u627e\u51fa\u51fa\u73b0\u81f3\u5c11\u4e09\u6b21\u7684\u6700\u957f\u7279\u6b8a\u5b50\u5b57\u7b26\u4e32 II", "Url": "https://leetcode.cn/problems/find-longest-special-substring-that-occurs-thrice-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 378 Problem 3"}, {"ID": 2983, "Title": "Palindrome Rearrangement Queries", "TitleCn": "\u56de\u6587\u4e32\u91cd\u65b0\u6392\u5217\u67e5\u8be2", "Url": "https://leetcode.cn/problems/palindrome-rearrangement-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 378 Problem 4"}, {"ID": 2984, "Title": "Find Peak Calling Hours for Each City", "TitleCn": "\u627e\u5230\u6bcf\u5ea7\u57ce\u5e02\u7684\u9ad8\u5cf0\u901a\u8bdd\u65f6\u95f4", "Url": "https://leetcode.cn/problems/find-peak-calling-hours-for-each-city/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2985, "Title": "Calculate Compressed Mean", "TitleCn": "\u8ba1\u7b97\u8ba2\u5355\u5e73\u5747\u5546\u54c1\u6570\u91cf", "Url": "https://leetcode.cn/problems/calculate-compressed-mean/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2986, "Title": "Find Third Transaction", "TitleCn": "\u627e\u5230\u7b2c\u4e09\u7b14\u4ea4\u6613", "Url": "https://leetcode.cn/problems/find-third-transaction/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2987, "Title": "Find Expensive Cities", "TitleCn": "\u5bfb\u627e\u623f\u4ef7\u6700\u8d35\u7684\u57ce\u5e02", "Url": "https://leetcode.cn/problems/find-expensive-cities/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2988, "Title": "Manager of the Largest Department", "TitleCn": "\u6700\u5927\u90e8\u95e8\u7684\u7ecf\u7406", "Url": "https://leetcode.cn/problems/manager-of-the-largest-department/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2989, "Title": "Class Performance", "TitleCn": "\u73ed\u7ea7\u8868\u73b0", "Url": "https://leetcode.cn/problems/class-performance/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2990, "Title": "Loan Types", "TitleCn": "\u8d37\u6b3e\u7c7b\u578b", "Url": "https://leetcode.cn/problems/loan-types/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2991, "Title": "Top Three Wineries", "TitleCn": "\u6700\u597d\u7684\u4e09\u5bb6\u9152\u5e84", "Url": "https://leetcode.cn/problems/top-three-wineries/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2992, "Title": "Number of Self-Divisible Permutations", "TitleCn": "\u81ea\u6574\u9664\u6392\u5217\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-self-divisible-permutations/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2993, "Title": "Friday Purchases I", "TitleCn": "\u53d1\u751f\u5728\u5468\u4e94\u7684\u4ea4\u6613 I", "Url": "https://leetcode.cn/problems/friday-purchases-i/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2994, "Title": "Friday Purchases II", "TitleCn": "\u53d1\u751f\u5728\u5468\u4e94\u7684\u4ea4\u6613 II", "Url": "https://leetcode.cn/problems/friday-purchases-ii/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2995, "Title": "Viewers Turned Streamers", "TitleCn": "\u89c2\u4f17\u53d8\u4e3b\u64ad", "Url": "https://leetcode.cn/problems/viewers-turned-streamers/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2996, "Title": "Smallest Missing Integer Greater Than Sequential Prefix Sum", "TitleCn": "\u5927\u4e8e\u7b49\u4e8e\u987a\u5e8f\u524d\u7f00\u548c\u7684\u6700\u5c0f\u7f3a\u5931\u6574\u6570", "Url": "https://leetcode.cn/problems/smallest-missing-integer-greater-than-sequential-prefix-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 121 Problem 1"}, {"ID": 2997, "Title": "Minimum Number of Operations to Make Array XOR Equal to K", "TitleCn": "\u4f7f\u6570\u7ec4\u5f02\u6216\u548c\u7b49\u4e8e K \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-array-xor-equal-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 121 Problem 2"}, {"ID": 2998, "Title": "Minimum Number of Operations to Make X and Y Equal", "TitleCn": "\u4f7f X \u548c Y \u76f8\u7b49\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-x-and-y-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 121 Problem 3"}, {"ID": 2999, "Title": "Count the Number of Powerful Integers", "TitleCn": "\u7edf\u8ba1\u5f3a\u5927\u6574\u6570\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-powerful-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 121 Problem 4"}, {"ID": 3000, "Title": "Maximum Area of Longest Diagonal Rectangle", "TitleCn": "\u5bf9\u89d2\u7ebf\u6700\u957f\u7684\u77e9\u5f62\u7684\u9762\u79ef", "Url": "https://leetcode.cn/problems/maximum-area-of-longest-diagonal-rectangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 379 Problem 1"}, {"ID": 3001, "Title": "Minimum Moves to Capture The Queen", "TitleCn": "\u6355\u83b7\u9ed1\u7687\u540e\u9700\u8981\u7684\u6700\u5c11\u79fb\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-moves-to-capture-the-queen/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 379 Problem 2"}, {"ID": 3002, "Title": "Maximum Size of a Set After Removals", "TitleCn": "\u79fb\u9664\u540e\u96c6\u5408\u7684\u6700\u591a\u5143\u7d20\u6570", "Url": "https://leetcode.cn/problems/maximum-size-of-a-set-after-removals/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 379 Problem 3"}, {"ID": 3003, "Title": "Maximize the Number of Partitions After Operations", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5206\u5272\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximize-the-number-of-partitions-after-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 379 Problem 4"}, {"ID": 3004, "Title": "Maximum Subtree of the Same Color", "TitleCn": "\u76f8\u540c\u989c\u8272\u7684\u6700\u5927\u5b50\u6811", "Url": "https://leetcode.cn/problems/maximum-subtree-of-the-same-color/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3005, "Title": "Count Elements With Maximum Frequency", "TitleCn": "\u6700\u5927\u9891\u7387\u5143\u7d20\u8ba1\u6570", "Url": "https://leetcode.cn/problems/count-elements-with-maximum-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 380 Problem 1"}, {"ID": 3006, "Title": "Find Beautiful Indices in the Given Array I", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u7f8e\u4e3d\u4e0b\u6807 I", "Url": "https://leetcode.cn/problems/find-beautiful-indices-in-the-given-array-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 380 Problem 2"}, {"ID": 3007, "Title": "Maximum Number That Sum of the Prices Is Less Than or Equal to K", "TitleCn": "\u4ef7\u503c\u548c\u5c0f\u4e8e\u7b49\u4e8e K \u7684\u6700\u5927\u6570\u5b57", "Url": "https://leetcode.cn/problems/maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 380 Problem 3"}, {"ID": 3008, "Title": "Find Beautiful Indices in the Given Array II", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u7f8e\u4e3d\u4e0b\u6807 II", "Url": "https://leetcode.cn/problems/find-beautiful-indices-in-the-given-array-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 380 Problem 4"}, {"ID": 3009, "Title": "Maximum Number of Intersections on the Chart", "TitleCn": "\u6298\u7ebf\u56fe\u4e0a\u7684\u6700\u5927\u4ea4\u70b9\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-intersections-on-the-chart/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3010, "Title": "Divide an Array Into Subarrays With Minimum Cost I", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u6210\u6700\u5c0f\u603b\u4ee3\u4ef7\u7684\u5b50\u6570\u7ec4 I", "Url": "https://leetcode.cn/problems/divide-an-array-into-subarrays-with-minimum-cost-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 122 Problem 1"}, {"ID": 3011, "Title": "Find if Array Can Be Sorted", "TitleCn": "\u5224\u65ad\u4e00\u4e2a\u6570\u7ec4\u662f\u5426\u53ef\u4ee5\u53d8\u4e3a\u6709\u5e8f", "Url": "https://leetcode.cn/problems/find-if-array-can-be-sorted/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 122 Problem 2"}, {"ID": 3012, "Title": "Minimize Length of Array Using Operations", "TitleCn": "\u901a\u8fc7\u64cd\u4f5c\u4f7f\u6570\u7ec4\u957f\u5ea6\u6700\u5c0f", "Url": "https://leetcode.cn/problems/minimize-length-of-array-using-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 122 Problem 3"}, {"ID": 3013, "Title": "Divide an Array Into Subarrays With Minimum Cost II", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u6210\u6700\u5c0f\u603b\u4ee3\u4ef7\u7684\u5b50\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/divide-an-array-into-subarrays-with-minimum-cost-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 122 Problem 4"}, {"ID": 3014, "Title": "Minimum Number of Pushes to Type Word I", "TitleCn": "\u8f93\u5165\u5355\u8bcd\u9700\u8981\u7684\u6700\u5c11\u6309\u952e\u6b21\u6570 I", "Url": "https://leetcode.cn/problems/minimum-number-of-pushes-to-type-word-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 381 Problem 1"}, {"ID": 3015, "Title": "Count the Number of Houses at a Certain Distance I", "TitleCn": "\u6309\u8ddd\u79bb\u7edf\u8ba1\u623f\u5c4b\u5bf9\u6570\u76ee I", "Url": "https://leetcode.cn/problems/count-the-number-of-houses-at-a-certain-distance-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 381 Problem 2"}, {"ID": 3016, "Title": "Minimum Number of Pushes to Type Word II", "TitleCn": "\u8f93\u5165\u5355\u8bcd\u9700\u8981\u7684\u6700\u5c11\u6309\u952e\u6b21\u6570 II", "Url": "https://leetcode.cn/problems/minimum-number-of-pushes-to-type-word-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 381 Problem 3"}, {"ID": 3017, "Title": "Count the Number of Houses at a Certain Distance II", "TitleCn": "\u6309\u8ddd\u79bb\u7edf\u8ba1\u623f\u5c4b\u5bf9\u6570\u76ee II", "Url": "https://leetcode.cn/problems/count-the-number-of-houses-at-a-certain-distance-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 381 Problem 4"}, {"ID": 3018, "Title": "Maximum Number of Removal Queries That Can Be Processed I", "TitleCn": "\u53ef\u5904\u7406\u7684\u6700\u5927\u5220\u9664\u64cd\u4f5c\u6570 I", "Url": "https://leetcode.cn/problems/maximum-number-of-removal-queries-that-can-be-processed-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3019, "Title": "Number of Changing Keys", "TitleCn": "\u6309\u952e\u53d8\u66f4\u7684\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-changing-keys/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 382 Problem 1"}, {"ID": 3020, "Title": "Find the Maximum Number of Elements in Subset", "TitleCn": "\u5b50\u96c6\u4e2d\u5143\u7d20\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/find-the-maximum-number-of-elements-in-subset/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 382 Problem 2"}, {"ID": 3021, "Title": "Alice and Bob Playing Flower Game", "TitleCn": "Alice \u548c Bob \u73a9\u9c9c\u82b1\u6e38\u620f", "Url": "https://leetcode.cn/problems/alice-and-bob-playing-flower-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 382 Problem 3"}, {"ID": 3022, "Title": "Minimize OR of Remaining Elements Using Operations", "TitleCn": "\u7ed9\u5b9a\u64cd\u4f5c\u6b21\u6570\u5185\u4f7f\u5269\u4f59\u5143\u7d20\u7684\u6216\u503c\u6700\u5c0f", "Url": "https://leetcode.cn/problems/minimize-or-of-remaining-elements-using-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 382 Problem 4"}, {"ID": 3023, "Title": "Find Pattern in Infinite Stream I", "TitleCn": "\u5728\u65e0\u9650\u6d41\u4e2d\u5bfb\u627e\u6a21\u5f0f I", "Url": "https://leetcode.cn/problems/find-pattern-in-infinite-stream-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3024, "Title": "Type of Triangle", "TitleCn": "\u4e09\u89d2\u5f62\u7c7b\u578b", "Url": "https://leetcode.cn/problems/type-of-triangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 123 Problem 1"}, {"ID": 3025, "Title": "Find the Number of Ways to Place People I", "TitleCn": "\u4eba\u5458\u7ad9\u4f4d\u7684\u65b9\u6848\u6570 I", "Url": "https://leetcode.cn/problems/find-the-number-of-ways-to-place-people-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 123 Problem 2"}, {"ID": 3026, "Title": "Maximum Good Subarray Sum", "TitleCn": "\u6700\u5927\u597d\u5b50\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/maximum-good-subarray-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 123 Problem 3"}, {"ID": 3027, "Title": "Find the Number of Ways to Place People II", "TitleCn": "\u4eba\u5458\u7ad9\u4f4d\u7684\u65b9\u6848\u6570 II", "Url": "https://leetcode.cn/problems/find-the-number-of-ways-to-place-people-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 123 Problem 4"}, {"ID": 3028, "Title": "Ant on the Boundary", "TitleCn": "\u8fb9\u754c\u4e0a\u7684\u8682\u8681", "Url": "https://leetcode.cn/problems/ant-on-the-boundary/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 383 Problem 1"}, {"ID": 3029, "Title": "Minimum Time to Revert Word to Initial State I", "TitleCn": "\u5c06\u5355\u8bcd\u6062\u590d\u521d\u59cb\u72b6\u6001\u6240\u9700\u7684\u6700\u77ed\u65f6\u95f4 I", "Url": "https://leetcode.cn/problems/minimum-time-to-revert-word-to-initial-state-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 383 Problem 2"}, {"ID": 3030, "Title": "Find the Grid of Region Average", "TitleCn": "\u627e\u51fa\u7f51\u683c\u7684\u533a\u57df\u5e73\u5747\u5f3a\u5ea6", "Url": "https://leetcode.cn/problems/find-the-grid-of-region-average/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 383 Problem 3"}, {"ID": 3031, "Title": "Minimum Time to Revert Word to Initial State II", "TitleCn": "\u5c06\u5355\u8bcd\u6062\u590d\u521d\u59cb\u72b6\u6001\u6240\u9700\u7684\u6700\u77ed\u65f6\u95f4 II", "Url": "https://leetcode.cn/problems/minimum-time-to-revert-word-to-initial-state-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 383 Problem 4"}, {"ID": 3032, "Title": "Count Numbers With Unique Digits II", "TitleCn": "\u7edf\u8ba1\u5404\u4f4d\u6570\u5b57\u90fd\u4e0d\u540c\u7684\u6570\u5b57\u4e2a\u6570 II", "Url": "https://leetcode.cn/problems/count-numbers-with-unique-digits-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3033, "Title": "Modify the Matrix", "TitleCn": "\u4fee\u6539\u77e9\u9635", "Url": "https://leetcode.cn/problems/modify-the-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 384 Problem 1"}, {"ID": 3034, "Title": "Number of Subarrays That Match a Pattern I", "TitleCn": "\u5339\u914d\u6a21\u5f0f\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u6570\u76ee I", "Url": "https://leetcode.cn/problems/number-of-subarrays-that-match-a-pattern-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 384 Problem 2"}, {"ID": 3035, "Title": "Maximum Palindromes After Operations", "TitleCn": "\u56de\u6587\u5b57\u7b26\u4e32\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-palindromes-after-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 384 Problem 3"}, {"ID": 3036, "Title": "Number of Subarrays That Match a Pattern II", "TitleCn": "\u5339\u914d\u6a21\u5f0f\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u6570\u76ee II", "Url": "https://leetcode.cn/problems/number-of-subarrays-that-match-a-pattern-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 384 Problem 4"}, {"ID": 3037, "Title": "Find Pattern in Infinite Stream II", "TitleCn": "\u5728\u65e0\u9650\u6d41\u4e2d\u5bfb\u627e\u6a21\u5f0f II", "Url": "https://leetcode.cn/problems/find-pattern-in-infinite-stream-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3038, "Title": "Maximum Number of Operations With the Same Score I", "TitleCn": "\u76f8\u540c\u5206\u6570\u7684\u6700\u5927\u64cd\u4f5c\u6570\u76ee I", "Url": "https://leetcode.cn/problems/maximum-number-of-operations-with-the-same-score-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 124 Problem 1"}, {"ID": 3039, "Title": "Apply Operations to Make String Empty", "TitleCn": "\u8fdb\u884c\u64cd\u4f5c\u4f7f\u5b57\u7b26\u4e32\u4e3a\u7a7a", "Url": "https://leetcode.cn/problems/apply-operations-to-make-string-empty/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 124 Problem 2"}, {"ID": 3040, "Title": "Maximum Number of Operations With the Same Score II", "TitleCn": "\u76f8\u540c\u5206\u6570\u7684\u6700\u5927\u64cd\u4f5c\u6570\u76ee II", "Url": "https://leetcode.cn/problems/maximum-number-of-operations-with-the-same-score-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 124 Problem 3"}, {"ID": 3041, "Title": "Maximize Consecutive Elements in an Array After Modification", "TitleCn": "\u4fee\u6539\u6570\u7ec4\u540e\u6700\u5927\u5316\u6570\u7ec4\u4e2d\u7684\u8fde\u7eed\u5143\u7d20\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximize-consecutive-elements-in-an-array-after-modification/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 124 Problem 4"}, {"ID": 3042, "Title": "Count Prefix and Suffix Pairs I", "TitleCn": "\u7edf\u8ba1\u524d\u540e\u7f00\u4e0b\u6807\u5bf9 I", "Url": "https://leetcode.cn/problems/count-prefix-and-suffix-pairs-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 385 Problem 1"}, {"ID": 3043, "Title": "Find the Length of the Longest Common Prefix", "TitleCn": "\u6700\u957f\u516c\u5171\u524d\u7f00\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/find-the-length-of-the-longest-common-prefix/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 385 Problem 2"}, {"ID": 3044, "Title": "Most Frequent Prime", "TitleCn": "\u51fa\u73b0\u9891\u7387\u6700\u9ad8\u7684\u8d28\u6570", "Url": "https://leetcode.cn/problems/most-frequent-prime/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 385 Problem 3"}, {"ID": 3045, "Title": "Count Prefix and Suffix Pairs II", "TitleCn": "\u7edf\u8ba1\u524d\u540e\u7f00\u4e0b\u6807\u5bf9 II", "Url": "https://leetcode.cn/problems/count-prefix-and-suffix-pairs-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 385 Problem 4"}, {"ID": 3046, "Title": "Split the Array", "TitleCn": "\u5206\u5272\u6570\u7ec4", "Url": "https://leetcode.cn/problems/split-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 386 Problem 1"}, {"ID": 3047, "Title": "Find the Largest Area of Square Inside Two Rectangles", "TitleCn": "\u6c42\u4ea4\u96c6\u533a\u57df\u5185\u7684\u6700\u5927\u6b63\u65b9\u5f62\u9762\u79ef", "Url": "https://leetcode.cn/problems/find-the-largest-area-of-square-inside-two-rectangles/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 386 Problem 2"}, {"ID": 3048, "Title": "Earliest Second to Mark Indices I", "TitleCn": "\u6807\u8bb0\u6240\u6709\u4e0b\u6807\u7684\u6700\u65e9\u79d2\u6570 I", "Url": "https://leetcode.cn/problems/earliest-second-to-mark-indices-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 386 Problem 3"}, {"ID": 3049, "Title": "Earliest Second to Mark Indices II", "TitleCn": "\u6807\u8bb0\u6240\u6709\u4e0b\u6807\u7684\u6700\u65e9\u79d2\u6570 II", "Url": "https://leetcode.cn/problems/earliest-second-to-mark-indices-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 386 Problem 4"}, {"ID": 3050, "Title": "Pizza Toppings Cost Analysis", "TitleCn": "\u62ab\u8428\u914d\u6599\u6210\u672c\u5206\u6790", "Url": "https://leetcode.cn/problems/pizza-toppings-cost-analysis/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3051, "Title": "Find Candidates for Data Scientist Position", "TitleCn": "\u5bfb\u627e\u6570\u636e\u79d1\u5b66\u5bb6\u804c\u4f4d\u7684\u5019\u9009\u4eba", "Url": "https://leetcode.cn/problems/find-candidates-for-data-scientist-position/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3052, "Title": "Maximize Items", "TitleCn": "\u6700\u5927\u5316\u5546\u54c1", "Url": "https://leetcode.cn/problems/maximize-items/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3053, "Title": "Classifying Triangles by Lengths", "TitleCn": "\u6839\u636e\u957f\u5ea6\u5206\u7c7b\u4e09\u89d2\u5f62", "Url": "https://leetcode.cn/problems/classifying-triangles-by-lengths/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3054, "Title": "Binary Tree Nodes", "TitleCn": "\u4e8c\u53c9\u6811\u8282\u70b9", "Url": "https://leetcode.cn/problems/binary-tree-nodes/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3055, "Title": "Top Percentile Fraud", "TitleCn": "\u6700\u9ad8\u6b3a\u8bc8\u767e\u5206\u4f4d\u6570", "Url": "https://leetcode.cn/problems/top-percentile-fraud/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3056, "Title": "Snaps Analysis", "TitleCn": "\u5feb\u7167\u5206\u6790", "Url": "https://leetcode.cn/problems/snaps-analysis/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3057, "Title": "Employees Project Allocation", "TitleCn": "\u5458\u5de5\u9879\u76ee\u5206\u914d", "Url": "https://leetcode.cn/problems/employees-project-allocation/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3058, "Title": "Friends With No Mutual Friends", "TitleCn": "\u6ca1\u6709\u5171\u540c\u670b\u53cb\u7684\u670b\u53cb", "Url": "https://leetcode.cn/problems/friends-with-no-mutual-friends/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3059, "Title": "Find All Unique Email Domains", "TitleCn": "\u627e\u5230\u6240\u6709\u4e0d\u540c\u7684\u90ae\u4ef6\u57df\u540d", "Url": "https://leetcode.cn/problems/find-all-unique-email-domains/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3060, "Title": "User Activities within Time Bounds", "TitleCn": "\u65f6\u95f4\u8303\u56f4\u5185\u7684\u7528\u6237\u6d3b\u52a8", "Url": "https://leetcode.cn/problems/user-activities-within-time-bounds/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3061, "Title": "Calculate Trapping Rain Water", "TitleCn": "\u8ba1\u7b97\u6ede\u7559\u96e8\u6c34", "Url": "https://leetcode.cn/problems/calculate-trapping-rain-water/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3062, "Title": "Winner of the Linked List Game", "TitleCn": "\u94fe\u8868\u6e38\u620f\u7684\u83b7\u80dc\u8005", "Url": "https://leetcode.cn/problems/winner-of-the-linked-list-game/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3063, "Title": "Linked List Frequency", "TitleCn": "\u94fe\u8868\u9891\u7387", "Url": "https://leetcode.cn/problems/linked-list-frequency/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3064, "Title": "Guess the Number Using Bitwise Questions I", "TitleCn": "\u4f7f\u7528\u6309\u4f4d\u67e5\u8be2\u731c\u6d4b\u6570\u5b57 I", "Url": "https://leetcode.cn/problems/guess-the-number-using-bitwise-questions-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3065, "Title": "Minimum Operations to Exceed Threshold Value I", "TitleCn": "\u8d85\u8fc7\u9608\u503c\u7684\u6700\u5c11\u64cd\u4f5c\u6570 I", "Url": "https://leetcode.cn/problems/minimum-operations-to-exceed-threshold-value-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 125 Problem 1"}, {"ID": 3066, "Title": "Minimum Operations to Exceed Threshold Value II", "TitleCn": "\u8d85\u8fc7\u9608\u503c\u7684\u6700\u5c11\u64cd\u4f5c\u6570 II", "Url": "https://leetcode.cn/problems/minimum-operations-to-exceed-threshold-value-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 125 Problem 2"}, {"ID": 3067, "Title": "Count Pairs of Connectable Servers in a Weighted Tree Network", "TitleCn": "\u5728\u5e26\u6743\u6811\u7f51\u7edc\u4e2d\u7edf\u8ba1\u53ef\u8fde\u63a5\u670d\u52a1\u5668\u5bf9\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-pairs-of-connectable-servers-in-a-weighted-tree-network/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 125 Problem 3"}, {"ID": 3068, "Title": "Find the Maximum Sum of Node Values", "TitleCn": "\u6700\u5927\u8282\u70b9\u4ef7\u503c\u4e4b\u548c", "Url": "https://leetcode.cn/problems/find-the-maximum-sum-of-node-values/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 125 Problem 4"}, {"ID": 3069, "Title": "Distribute Elements Into Two Arrays I", "TitleCn": "\u5c06\u5143\u7d20\u5206\u914d\u5230\u4e24\u4e2a\u6570\u7ec4\u4e2d I", "Url": "https://leetcode.cn/problems/distribute-elements-into-two-arrays-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 387 Problem 1"}, {"ID": 3070, "Title": "Count Submatrices with Top-Left Element and Sum Less Than k", "TitleCn": "\u5143\u7d20\u548c\u5c0f\u4e8e\u7b49\u4e8e k \u7684\u5b50\u77e9\u9635\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-submatrices-with-top-left-element-and-sum-less-than-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 387 Problem 2"}, {"ID": 3071, "Title": "Minimum Operations to Write the Letter Y on a Grid", "TitleCn": "\u5728\u77e9\u9635\u4e0a\u5199\u51fa\u5b57\u6bcd Y \u6240\u9700\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-write-the-letter-y-on-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 387 Problem 3"}, {"ID": 3072, "Title": "Distribute Elements Into Two Arrays II", "TitleCn": "\u5c06\u5143\u7d20\u5206\u914d\u5230\u4e24\u4e2a\u6570\u7ec4\u4e2d II", "Url": "https://leetcode.cn/problems/distribute-elements-into-two-arrays-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 387 Problem 4"}, {"ID": 3073, "Title": "Maximum Increasing Triplet Value", "TitleCn": "\u6700\u5927\u9012\u589e\u4e09\u5143\u7ec4", "Url": "https://leetcode.cn/problems/maximum-increasing-triplet-value/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3074, "Title": "Apple Redistribution into Boxes", "TitleCn": "\u91cd\u65b0\u5206\u88c5\u82f9\u679c", "Url": "https://leetcode.cn/problems/apple-redistribution-into-boxes/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 388 Problem 1"}, {"ID": 3075, "Title": "Maximize Happiness of Selected Children", "TitleCn": "\u5e78\u798f\u503c\u6700\u5927\u5316\u7684\u9009\u62e9\u65b9\u6848", "Url": "https://leetcode.cn/problems/maximize-happiness-of-selected-children/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 388 Problem 2"}, {"ID": 3076, "Title": "Shortest Uncommon Substring in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684\u6700\u77ed\u975e\u516c\u5171\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/shortest-uncommon-substring-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 388 Problem 3"}, {"ID": 3077, "Title": "Maximum Strength of K Disjoint Subarrays", "TitleCn": "K \u4e2a\u4e0d\u76f8\u4ea4\u5b50\u6570\u7ec4\u7684\u6700\u5927\u80fd\u91cf\u503c", "Url": "https://leetcode.cn/problems/maximum-strength-of-k-disjoint-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 388 Problem 4"}, {"ID": 3078, "Title": "Match Alphanumerical Pattern in Matrix I", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u5b57\u6bcd\u6570\u5b57\u6a21\u5f0f\u5339\u914d I", "Url": "https://leetcode.cn/problems/match-alphanumerical-pattern-in-matrix-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3079, "Title": "Find the Sum of Encrypted Integers", "TitleCn": "\u6c42\u51fa\u52a0\u5bc6\u6574\u6570\u7684\u548c", "Url": "https://leetcode.cn/problems/find-the-sum-of-encrypted-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 126 Problem 1"}, {"ID": 3080, "Title": "Mark Elements on Array by Performing Queries", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u6807\u8bb0\u6570\u7ec4\u4e2d\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/mark-elements-on-array-by-performing-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 126 Problem 2"}, {"ID": 3081, "Title": "Replace Question Marks in String to Minimize Its Value", "TitleCn": "\u66ff\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u95ee\u53f7\u4f7f\u5206\u6570\u6700\u5c0f", "Url": "https://leetcode.cn/problems/replace-question-marks-in-string-to-minimize-its-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 126 Problem 3"}, {"ID": 3082, "Title": "Find the Sum of the Power of All Subsequences", "TitleCn": "\u6c42\u51fa\u6240\u6709\u5b50\u5e8f\u5217\u7684\u80fd\u91cf\u548c", "Url": "https://leetcode.cn/problems/find-the-sum-of-the-power-of-all-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 126 Problem 4"}, {"ID": 3083, "Title": "Existence of a Substring in a String and Its Reverse", "TitleCn": "\u5b57\u7b26\u4e32\u53ca\u5176\u53cd\u8f6c\u4e2d\u662f\u5426\u5b58\u5728\u540c\u4e00\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/existence-of-a-substring-in-a-string-and-its-reverse/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 389 Problem 1"}, {"ID": 3084, "Title": "Count Substrings Starting and Ending with Given Character", "TitleCn": "\u7edf\u8ba1\u4ee5\u7ed9\u5b9a\u5b57\u7b26\u5f00\u5934\u548c\u7ed3\u5c3e\u7684\u5b50\u5b57\u7b26\u4e32\u603b\u6570", "Url": "https://leetcode.cn/problems/count-substrings-starting-and-ending-with-given-character/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 389 Problem 2"}, {"ID": 3085, "Title": "Minimum Deletions to Make String K-Special", "TitleCn": "\u6210\u4e3a K \u7279\u6b8a\u5b57\u7b26\u4e32\u9700\u8981\u5220\u9664\u7684\u6700\u5c11\u5b57\u7b26\u6570", "Url": "https://leetcode.cn/problems/minimum-deletions-to-make-string-k-special/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 389 Problem 3"}, {"ID": 3086, "Title": "Minimum Moves to Pick K Ones", "TitleCn": "\u62fe\u8d77 K \u4e2a 1 \u9700\u8981\u7684\u6700\u5c11\u884c\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-moves-to-pick-k-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 389 Problem 4"}, {"ID": 3087, "Title": "Find Trending Hashtags", "TitleCn": "\u67e5\u627e\u70ed\u95e8\u8bdd\u9898\u6807\u7b7e", "Url": "https://leetcode.cn/problems/find-trending-hashtags/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3088, "Title": "Make String Anti-palindrome", "TitleCn": "\u4f7f\u5b57\u7b26\u4e32\u53cd\u56de\u6587", "Url": "https://leetcode.cn/problems/make-string-anti-palindrome/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3089, "Title": "Find Bursty Behavior", "TitleCn": "\u67e5\u627e\u7a81\u53d1\u884c\u4e3a", "Url": "https://leetcode.cn/problems/find-bursty-behavior/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3090, "Title": "Maximum Length Substring With Two Occurrences", "TitleCn": "\u6bcf\u4e2a\u5b57\u7b26\u6700\u591a\u51fa\u73b0\u4e24\u6b21\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/maximum-length-substring-with-two-occurrences/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 390 Problem 1"}, {"ID": 3091, "Title": "Apply Operations to Make Sum of Array Greater Than or Equal to k", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u4f7f\u6570\u636e\u5143\u7d20\u4e4b\u548c\u5927\u4e8e\u7b49\u4e8e K", "Url": "https://leetcode.cn/problems/apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 390 Problem 2"}, {"ID": 3092, "Title": "Most Frequent IDs", "TitleCn": "\u6700\u9ad8\u9891\u7387\u7684 ID", "Url": "https://leetcode.cn/problems/most-frequent-ids/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 390 Problem 3"}, {"ID": 3093, "Title": "Longest Common Suffix Queries", "TitleCn": "\u6700\u957f\u516c\u5171\u540e\u7f00\u67e5\u8be2", "Url": "https://leetcode.cn/problems/longest-common-suffix-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 390 Problem 4"}, {"ID": 3094, "Title": "Guess the Number Using Bitwise Questions II", "TitleCn": "\u4f7f\u7528\u6309\u4f4d\u67e5\u8be2\u731c\u6d4b\u6570\u5b57 II", "Url": "https://leetcode.cn/problems/guess-the-number-using-bitwise-questions-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3095, "Title": "Shortest Subarray With OR at Least K I", "TitleCn": "\u6216\u503c\u81f3\u5c11 K \u7684\u6700\u77ed\u5b50\u6570\u7ec4 I", "Url": "https://leetcode.cn/problems/shortest-subarray-with-or-at-least-k-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 127 Problem 1"}, {"ID": 3096, "Title": "Minimum Levels to Gain More Points", "TitleCn": "\u5f97\u5230\u66f4\u591a\u5206\u6570\u7684\u6700\u5c11\u5173\u5361\u6570\u76ee", "Url": "https://leetcode.cn/problems/minimum-levels-to-gain-more-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 127 Problem 2"}, {"ID": 3097, "Title": "Shortest Subarray With OR at Least K II", "TitleCn": "\u6216\u503c\u81f3\u5c11\u4e3a K \u7684\u6700\u77ed\u5b50\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/shortest-subarray-with-or-at-least-k-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 127 Problem 3"}, {"ID": 3098, "Title": "Find the Sum of Subsequence Powers", "TitleCn": "\u6c42\u51fa\u6240\u6709\u5b50\u5e8f\u5217\u7684\u80fd\u91cf\u548c", "Url": "https://leetcode.cn/problems/find-the-sum-of-subsequence-powers/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 127 Problem 4"}, {"ID": 3099, "Title": "Harshad Number", "TitleCn": "\u54c8\u6c99\u5fb7\u6570", "Url": "https://leetcode.cn/problems/harshad-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 391 Problem 1"}, {"ID": 3100, "Title": "Water Bottles II", "TitleCn": "\u6362\u6c34\u95ee\u9898 II", "Url": "https://leetcode.cn/problems/water-bottles-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 391 Problem 2"}, {"ID": 3101, "Title": "Count Alternating Subarrays", "TitleCn": "\u4ea4\u66ff\u5b50\u6570\u7ec4\u8ba1\u6570", "Url": "https://leetcode.cn/problems/count-alternating-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 391 Problem 3"}, {"ID": 3102, "Title": "Minimize Manhattan Distances", "TitleCn": "\u6700\u5c0f\u5316\u66fc\u54c8\u987f\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/minimize-manhattan-distances/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 391 Problem 4"}, {"ID": 3103, "Title": "Find Trending Hashtags II", "TitleCn": "\u67e5\u627e\u70ed\u95e8\u8bdd\u9898\u6807\u7b7e II", "Url": "https://leetcode.cn/problems/find-trending-hashtags-ii/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3104, "Title": "Find Longest Self-Contained Substring", "TitleCn": "\u67e5\u627e\u6700\u957f\u7684\u81ea\u5305\u542b\u5b50\u4e32", "Url": "https://leetcode.cn/problems/find-longest-self-contained-substring/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3105, "Title": "Longest Strictly Increasing or Strictly Decreasing Subarray", "TitleCn": "\u6700\u957f\u7684\u4e25\u683c\u9012\u589e\u6216\u9012\u51cf\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-strictly-increasing-or-strictly-decreasing-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 392 Problem 1"}, {"ID": 3106, "Title": "Lexicographically Smallest String After Operations With Constraint", "TitleCn": "\u6ee1\u8db3\u8ddd\u79bb\u7ea6\u675f\u4e14\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-smallest-string-after-operations-with-constraint/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 392 Problem 2"}, {"ID": 3107, "Title": "Minimum Operations to Make Median of Array Equal to K", "TitleCn": "\u4f7f\u6570\u7ec4\u4e2d\u4f4d\u6570\u7b49\u4e8e K \u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-median-of-array-equal-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 392 Problem 3"}, {"ID": 3108, "Title": "Minimum Cost Walk in Weighted Graph", "TitleCn": "\u5e26\u6743\u56fe\u91cc\u65c5\u9014\u7684\u6700\u5c0f\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-walk-in-weighted-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 392 Problem 4"}, {"ID": 3109, "Title": "Find the Index of Permutation", "TitleCn": "\u67e5\u627e\u6392\u5217\u7684\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-the-index-of-permutation/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3110, "Title": "Score of a String", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u5206\u6570", "Url": "https://leetcode.cn/problems/score-of-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 128 Problem 1"}, {"ID": 3111, "Title": "Minimum Rectangles to Cover Points", "TitleCn": "\u8986\u76d6\u6240\u6709\u70b9\u7684\u6700\u5c11\u77e9\u5f62\u6570\u76ee", "Url": "https://leetcode.cn/problems/minimum-rectangles-to-cover-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 128 Problem 2"}, {"ID": 3112, "Title": "Minimum Time to Visit Disappearing Nodes", "TitleCn": "\u8bbf\u95ee\u6d88\u5931\u8282\u70b9\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-visit-disappearing-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 128 Problem 3"}, {"ID": 3113, "Title": "Find the Number of Subarrays Where Boundary Elements Are Maximum", "TitleCn": "\u8fb9\u754c\u5143\u7d20\u662f\u6700\u5927\u503c\u7684\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/find-the-number-of-subarrays-where-boundary-elements-are-maximum/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 128 Problem 4"}, {"ID": 3114, "Title": "Latest Time You Can Obtain After Replacing Characters", "TitleCn": "\u66ff\u6362\u5b57\u7b26\u53ef\u4ee5\u5f97\u5230\u7684\u6700\u665a\u65f6\u95f4", "Url": "https://leetcode.cn/problems/latest-time-you-can-obtain-after-replacing-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 393 Problem 1"}, {"ID": 3115, "Title": "Maximum Prime Difference", "TitleCn": "\u8d28\u6570\u7684\u6700\u5927\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/maximum-prime-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 393 Problem 2"}, {"ID": 3116, "Title": "Kth Smallest Amount With Single Denomination Combination", "TitleCn": "\u5355\u9762\u503c\u7ec4\u5408\u7684\u7b2c K \u5c0f\u91d1\u989d", "Url": "https://leetcode.cn/problems/kth-smallest-amount-with-single-denomination-combination/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 393 Problem 3"}, {"ID": 3117, "Title": "Minimum Sum of Values by Dividing Array", "TitleCn": "\u5212\u5206\u6570\u7ec4\u5f97\u5230\u6700\u5c0f\u7684\u503c\u4e4b\u548c", "Url": "https://leetcode.cn/problems/minimum-sum-of-values-by-dividing-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 393 Problem 4"}, {"ID": 3118, "Title": "Friday Purchase III ", "TitleCn": "\u53d1\u751f\u5728\u5468\u4e94\u7684\u4ea4\u6613 III", "Url": "https://leetcode.cn/problems/friday-purchase-iii/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3119, "Title": "Maximum Number of Potholes That Can Be Fixed", "TitleCn": "\u6700\u5927\u6570\u91cf\u7684\u53ef\u4fee\u590d\u5751\u6d3c", "Url": "https://leetcode.cn/problems/maximum-number-of-potholes-that-can-be-fixed/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3120, "Title": "Count the Number of Special Characters I", "TitleCn": "\u7edf\u8ba1\u7279\u6b8a\u5b57\u6bcd\u7684\u6570\u91cf I", "Url": "https://leetcode.cn/problems/count-the-number-of-special-characters-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 394 Problem 1"}, {"ID": 3121, "Title": "Count the Number of Special Characters II", "TitleCn": "\u7edf\u8ba1\u7279\u6b8a\u5b57\u6bcd\u7684\u6570\u91cf II", "Url": "https://leetcode.cn/problems/count-the-number-of-special-characters-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 394 Problem 2"}, {"ID": 3122, "Title": "Minimum Number of Operations to Satisfy Conditions", "TitleCn": "\u4f7f\u77e9\u9635\u6ee1\u8db3\u6761\u4ef6\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-satisfy-conditions/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 394 Problem 3"}, {"ID": 3123, "Title": "Find Edges in Shortest Paths", "TitleCn": "\u6700\u77ed\u8def\u5f84\u4e2d\u7684\u8fb9", "Url": "https://leetcode.cn/problems/find-edges-in-shortest-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 394 Problem 4"}, {"ID": 3124, "Title": "Find Longest Calls", "TitleCn": "\u67e5\u627e\u6700\u957f\u7684\u7535\u8bdd", "Url": "https://leetcode.cn/problems/find-longest-calls/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3125, "Title": "Maximum Number That Makes Result of Bitwise AND Zero", "TitleCn": "\u4f7f\u5f97\u6309\u4f4d\u4e0e\u7ed3\u679c\u4e3a 0 \u7684\u6700\u5927\u6570\u5b57", "Url": "https://leetcode.cn/problems/maximum-number-that-makes-result-of-bitwise-and-zero/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3126, "Title": "Server Utilization Time", "TitleCn": "\u670d\u52a1\u5668\u5229\u7528\u65f6\u95f4", "Url": "https://leetcode.cn/problems/server-utilization-time/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3127, "Title": "Make a Square with the Same Color", "TitleCn": "\u6784\u9020\u76f8\u540c\u989c\u8272\u7684\u6b63\u65b9\u5f62", "Url": "https://leetcode.cn/problems/make-a-square-with-the-same-color/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 129 Problem 1"}, {"ID": 3128, "Title": "Right Triangles", "TitleCn": "\u76f4\u89d2\u4e09\u89d2\u5f62", "Url": "https://leetcode.cn/problems/right-triangles/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 129 Problem 2"}, {"ID": 3129, "Title": "Find All Possible Stable Binary Arrays I", "TitleCn": "\u627e\u51fa\u6240\u6709\u7a33\u5b9a\u7684\u4e8c\u8fdb\u5236\u6570\u7ec4 I", "Url": "https://leetcode.cn/problems/find-all-possible-stable-binary-arrays-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 129 Problem 3"}, {"ID": 3130, "Title": "Find All Possible Stable Binary Arrays II", "TitleCn": "\u627e\u51fa\u6240\u6709\u7a33\u5b9a\u7684\u4e8c\u8fdb\u5236\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/find-all-possible-stable-binary-arrays-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 129 Problem 4"}, {"ID": 3131, "Title": "Find the Integer Added to Array I", "TitleCn": "\u627e\u51fa\u4e0e\u6570\u7ec4\u76f8\u52a0\u7684\u6574\u6570 I", "Url": "https://leetcode.cn/problems/find-the-integer-added-to-array-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 395 Problem 1"}, {"ID": 3132, "Title": "Find the Integer Added to Array II", "TitleCn": "\u627e\u51fa\u4e0e\u6570\u7ec4\u76f8\u52a0\u7684\u6574\u6570 II", "Url": "https://leetcode.cn/problems/find-the-integer-added-to-array-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 395 Problem 2"}, {"ID": 3133, "Title": "Minimum Array End", "TitleCn": "\u6570\u7ec4\u6700\u540e\u4e00\u4e2a\u5143\u7d20\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/minimum-array-end/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 395 Problem 3"}, {"ID": 3134, "Title": "Find the Median of the Uniqueness Array", "TitleCn": "\u627e\u51fa\u552f\u4e00\u6027\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570", "Url": "https://leetcode.cn/problems/find-the-median-of-the-uniqueness-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 395 Problem 4"}, {"ID": 3135, "Title": "Equalize Strings by Adding or Removing Characters at Ends", "TitleCn": "\u901a\u8fc7\u6dfb\u52a0\u6216\u5220\u9664\u7ed3\u5c3e\u5b57\u7b26\u6765\u540c\u5316\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/equalize-strings-by-adding-or-removing-characters-at-ends/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3136, "Title": "Valid Word", "TitleCn": "\u6709\u6548\u5355\u8bcd", "Url": "https://leetcode.cn/problems/valid-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 396 Problem 1"}, {"ID": 3137, "Title": "Minimum Number of Operations to Make Word K-Periodic", "TitleCn": "K \u5468\u671f\u5b57\u7b26\u4e32\u9700\u8981\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-word-k-periodic/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 396 Problem 2"}, {"ID": 3138, "Title": "Minimum Length of Anagram Concatenation", "TitleCn": "\u540c\u4f4d\u5b57\u7b26\u4e32\u8fde\u63a5\u7684\u6700\u5c0f\u957f\u5ea6", "Url": "https://leetcode.cn/problems/minimum-length-of-anagram-concatenation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 396 Problem 3"}, {"ID": 3139, "Title": "Minimum Cost to Equalize Array", "TitleCn": "\u4f7f\u6570\u7ec4\u4e2d\u6240\u6709\u5143\u7d20\u76f8\u7b49\u7684\u6700\u5c0f\u5f00\u9500", "Url": "https://leetcode.cn/problems/minimum-cost-to-equalize-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 396 Problem 4"}, {"ID": 3140, "Title": "Consecutive Available Seats II", "TitleCn": "\u8fde\u7eed\u7a7a\u4f59\u5ea7\u4f4d II", "Url": "https://leetcode.cn/problems/consecutive-available-seats-ii/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3141, "Title": "Maximum Hamming Distances", "TitleCn": "\u6700\u5927\u6c49\u660e\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/maximum-hamming-distances/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3142, "Title": "Check if Grid Satisfies Conditions", "TitleCn": "\u5224\u65ad\u77e9\u9635\u662f\u5426\u6ee1\u8db3\u6761\u4ef6", "Url": "https://leetcode.cn/problems/check-if-grid-satisfies-conditions/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 130 Problem 1"}, {"ID": 3143, "Title": "Maximum Points Inside the Square", "TitleCn": "\u6b63\u65b9\u5f62\u4e2d\u7684\u6700\u591a\u70b9\u6570", "Url": "https://leetcode.cn/problems/maximum-points-inside-the-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 130 Problem 2"}, {"ID": 3144, "Title": "Minimum Substring Partition of Equal Character Frequency", "TitleCn": "\u5206\u5272\u5b57\u7b26\u9891\u7387\u76f8\u7b49\u7684\u6700\u5c11\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/minimum-substring-partition-of-equal-character-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 130 Problem 3"}, {"ID": 3145, "Title": "Find Products of Elements of Big Array", "TitleCn": "\u5927\u6570\u7ec4\u5143\u7d20\u7684\u4e58\u79ef", "Url": "https://leetcode.cn/problems/find-products-of-elements-of-big-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 130 Problem 4"}, {"ID": 3146, "Title": "Permutation Difference between Two Strings", "TitleCn": "\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u6392\u5217\u5dee", "Url": "https://leetcode.cn/problems/permutation-difference-between-two-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 397 Problem 1"}, {"ID": 3147, "Title": "Taking Maximum Energy From the Mystic Dungeon", "TitleCn": "\u4ece\u9b54\u6cd5\u5e08\u8eab\u4e0a\u5438\u53d6\u7684\u6700\u5927\u80fd\u91cf", "Url": "https://leetcode.cn/problems/taking-maximum-energy-from-the-mystic-dungeon/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 397 Problem 2"}, {"ID": 3148, "Title": "Maximum Difference Score in a Grid", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-difference-score-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 397 Problem 3"}, {"ID": 3149, "Title": "Find the Minimum Cost Array Permutation", "TitleCn": "\u627e\u51fa\u5206\u6570\u6700\u4f4e\u7684\u6392\u5217", "Url": "https://leetcode.cn/problems/find-the-minimum-cost-array-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 397 Problem 4"}, {"ID": 3150, "Title": "Invalid Tweets II", "TitleCn": "\u65e0\u6548\u7684\u63a8\u6587 II", "Url": "https://leetcode.cn/problems/invalid-tweets-ii/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3151, "Title": "Special Array I", "TitleCn": "\u7279\u6b8a\u6570\u7ec4 I", "Url": "https://leetcode.cn/problems/special-array-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 398 Problem 1"}, {"ID": 3152, "Title": "Special Array II", "TitleCn": "\u7279\u6b8a\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/special-array-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 398 Problem 2"}, {"ID": 3153, "Title": "Sum of Digit Differences of All Pairs", "TitleCn": "\u6240\u6709\u6570\u5bf9\u4e2d\u6570\u4f4d\u4e0d\u540c\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-digit-differences-of-all-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 398 Problem 3"}, {"ID": 3154, "Title": "Find Number of Ways to Reach the K-th Stair", "TitleCn": "\u5230\u8fbe\u7b2c K \u7ea7\u53f0\u9636\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/find-number-of-ways-to-reach-the-k-th-stair/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 398 Problem 4"}, {"ID": 3155, "Title": "Maximum Number of Upgradable Servers", "TitleCn": "\u53ef\u5347\u7ea7\u670d\u52a1\u5668\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-upgradable-servers/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3156, "Title": "Employee Task Duration and Concurrent Tasks", "TitleCn": "\u5458\u5de5\u4efb\u52a1\u6301\u7eed\u65f6\u95f4\u548c\u5e76\u53d1\u4efb\u52a1", "Url": "https://leetcode.cn/problems/employee-task-duration-and-concurrent-tasks/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3157, "Title": "Find the Level of Tree with Minimum Sum", "TitleCn": "\u627e\u5230\u5177\u6709\u6700\u5c0f\u548c\u7684\u6811\u7684\u5c42\u6570", "Url": "https://leetcode.cn/problems/find-the-level-of-tree-with-minimum-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3158, "Title": "Find the XOR of Numbers Which Appear Twice", "TitleCn": "\u6c42\u51fa\u51fa\u73b0\u4e24\u6b21\u6570\u5b57\u7684 XOR \u503c", "Url": "https://leetcode.cn/problems/find-the-xor-of-numbers-which-appear-twice/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 131 Problem 1"}, {"ID": 3159, "Title": "Find Occurrences of an Element in an Array", "TitleCn": "\u67e5\u8be2\u6570\u7ec4\u4e2d\u5143\u7d20\u7684\u51fa\u73b0\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/find-occurrences-of-an-element-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 131 Problem 2"}, {"ID": 3160, "Title": "Find the Number of Distinct Colors Among the Balls", "TitleCn": "\u6240\u6709\u7403\u91cc\u9762\u4e0d\u540c\u989c\u8272\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/find-the-number-of-distinct-colors-among-the-balls/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 131 Problem 3"}, {"ID": 3161, "Title": "Block Placement Queries", "TitleCn": "\u7269\u5757\u653e\u7f6e\u67e5\u8be2", "Url": "https://leetcode.cn/problems/block-placement-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 131 Problem 4"}, {"ID": 3162, "Title": "Find the Number of Good Pairs I", "TitleCn": "\u4f18\u8d28\u6570\u5bf9\u7684\u603b\u6570 I", "Url": "https://leetcode.cn/problems/find-the-number-of-good-pairs-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 399 Problem 1"}, {"ID": 3163, "Title": "String Compression III", "TitleCn": "\u538b\u7f29\u5b57\u7b26\u4e32 III", "Url": "https://leetcode.cn/problems/string-compression-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 399 Problem 2"}, {"ID": 3164, "Title": "Find the Number of Good Pairs II", "TitleCn": "\u4f18\u8d28\u6570\u5bf9\u7684\u603b\u6570 II", "Url": "https://leetcode.cn/problems/find-the-number-of-good-pairs-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 399 Problem 3"}, {"ID": 3165, "Title": "Maximum Sum of Subsequence With Non-adjacent Elements", "TitleCn": "\u4e0d\u5305\u542b\u76f8\u90bb\u5143\u7d20\u7684\u5b50\u5e8f\u5217\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-of-subsequence-with-non-adjacent-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 399 Problem 4"}, {"ID": 3166, "Title": "Calculate Parking Fees and Duration", "TitleCn": "\u8ba1\u7b97\u505c\u8f66\u8d39\u4e0e\u65f6\u957f", "Url": "https://leetcode.cn/problems/calculate-parking-fees-and-duration/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3167, "Title": "Better Compression of String", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u66f4\u597d\u538b\u7f29", "Url": "https://leetcode.cn/problems/better-compression-of-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3168, "Title": "Minimum Number of Chairs in a Waiting Room", "TitleCn": "\u5019\u8bca\u5ba4\u4e2d\u7684\u6700\u5c11\u6905\u5b50\u6570", "Url": "https://leetcode.cn/minimum-number-of-chairs-in-a-waiting-room/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 400 Problem 1"}, {"ID": 3169, "Title": "Count Days Without Meetings", "TitleCn": "\u65e0\u9700\u5f00\u4f1a\u7684\u5de5\u4f5c\u65e5", "Url": "https://leetcode.cn/problems/count-days-without-meetings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 400 Problem 2"}, {"ID": 3170, "Title": "Lexicographically Minimum String After Removing Stars", "TitleCn": "\u5220\u9664\u661f\u53f7\u4ee5\u540e\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-minimum-string-after-removing-stars/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 400 Problem 3"}, {"ID": 3171, "Title": "Find Subarray With Bitwise OR Closest to K", "TitleCn": "\u627e\u5230\u6309\u4f4d\u6216\u6700\u63a5\u8fd1 K \u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-subarray-with-bitwise-or-closest-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 400 Problem 4"}, {"ID": 3172, "Title": "Second Day Verification", "TitleCn": "\u7b2c\u4e8c\u5929\u9a8c\u8bc1", "Url": "https://leetcode.cn/problems/second-day-verification/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3173, "Title": "Bitwise OR of Adjacent Elements", "TitleCn": "\u76f8\u90bb\u5143\u7d20\u7684\u6309\u4f4d\u6216", "Url": "https://leetcode.cn/problems/bitwise-or-of-adjacent-elements/", "Ispaid": 1, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3174, "Title": "Clear Digits", "TitleCn": "\u6e05\u9664\u6570\u5b57", "Url": "https://leetcode.cn/problems/clear-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 132 Problem 1"}, {"ID": 3175, "Title": "Find The First Player to win K Games in a Row", "TitleCn": "\u627e\u5230\u8fde\u7eed\u8d62 K \u573a\u6bd4\u8d5b\u7684\u7b2c\u4e00\u4f4d\u73a9\u5bb6", "Url": "https://leetcode.cn/problems/find-the-first-player-to-win-k-games-in-a-row/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 132 Problem 2"}, {"ID": 3176, "Title": "Find the Maximum Length of a Good Subsequence I", "TitleCn": "\u6c42\u51fa\u6700\u957f\u597d\u5b50\u5e8f\u5217 I", "Url": "https://leetcode.cn/problems/find-the-maximum-length-of-a-good-subsequence-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 132 Problem 3"}, {"ID": 3177, "Title": "Find the Maximum Length of a Good Subsequence II", "TitleCn": "\u6c42\u51fa\u6700\u957f\u597d\u5b50\u5e8f\u5217 II", "Url": "https://leetcode.cn/problems/find-the-maximum-length-of-a-good-subsequence-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 132 Problem 4"}, {"ID": 3178, "Title": "Find the Child Who Has the Ball After K Seconds", "TitleCn": "\u627e\u51fa K \u79d2\u540e\u62ff\u7740\u7403\u7684\u5b69\u5b50", "Url": "https://leetcode.cn/problems/find-the-child-who-has-the-ball-after-k-seconds/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 401 Problem 1"}, {"ID": 3179, "Title": "Find the N-th Value After K Seconds", "TitleCn": "K \u79d2\u540e\u7b2c N \u4e2a\u5143\u7d20\u7684\u503c", "Url": "https://leetcode.cn/problems/find-the-n-th-value-after-k-seconds/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 401 Problem 2"}, {"ID": 3180, "Title": "Maximum Total Reward Using Operations I", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u53ef\u83b7\u5f97\u7684\u6700\u5927\u603b\u5956\u52b1 I", "Url": "https://leetcode.cn/problems/maximum-total-reward-using-operations-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 401 Problem 3"}, {"ID": 3181, "Title": "Maximum Total Reward Using Operations II", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u53ef\u83b7\u5f97\u7684\u6700\u5927\u603b\u5956\u52b1 II", "Url": "https://leetcode.cn/problems/maximum-total-reward-using-operations-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 401 Problem 4"}, {"ID": 3182, "Title": "Find Top Scoring Students", "TitleCn": "\u67e5\u627e\u5f97\u5206\u6700\u9ad8\u7684\u5b66\u751f", "Url": "https://leetcode.cn/problems/find-top-scoring-students/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3183, "Title": "The Number of Ways to Make the Sum", "TitleCn": "\u8fbe\u5230\u603b\u548c\u7684\u65b9\u6cd5\u6570\u91cf", "Url": "https://leetcode.cn/problems/the-number-of-ways-to-make-the-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3184, "Title": "Count Pairs That Form a Complete Day I", "TitleCn": "\u6784\u6210\u6574\u5929\u7684\u4e0b\u6807\u5bf9\u6570\u76ee I", "Url": "https://leetcode.cn/problems/count-pairs-that-form-a-complete-day-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 402 Problem 1"}, {"ID": 3185, "Title": "Count Pairs That Form a Complete Day II", "TitleCn": "\u6784\u6210\u6574\u5929\u7684\u4e0b\u6807\u5bf9\u6570\u76ee II", "Url": "https://leetcode.cn/problems/count-pairs-that-form-a-complete-day-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 402 Problem 2"}, {"ID": 3186, "Title": "Maximum Total Damage With Spell Casting", "TitleCn": "\u65bd\u5492\u7684\u6700\u5927\u603b\u4f24\u5bb3", "Url": "https://leetcode.cn/problems/maximum-total-damage-with-spell-casting/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 402 Problem 3"}, {"ID": 3187, "Title": "Peaks in Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684\u5cf0\u503c", "Url": "https://leetcode.cn/problems/peaks-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 402 Problem 4"}, {"ID": 3188, "Title": "Find Top Scoring Students II", "TitleCn": "\u67e5\u627e\u5f97\u5206\u6700\u9ad8\u7684\u5b66\u751f II", "Url": "https://leetcode.cn/problems/find-top-scoring-students-ii/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3189, "Title": "Minimum Moves to Get a Peaceful Board", "TitleCn": "\u5f97\u5230\u4e00\u4e2a\u548c\u5e73\u68cb\u76d8\u7684\u6700\u5c11\u6b65\u9aa4", "Url": "https://leetcode.cn/problems/minimum-moves-to-get-a-peaceful-board/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3190, "Title": "Find Minimum Operations to Make All Elements Divisible by Three", "TitleCn": "\u4f7f\u6240\u6709\u5143\u7d20\u90fd\u53ef\u4ee5\u88ab 3 \u6574\u9664\u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 133 Problem 1"}, {"ID": 3191, "Title": "Minimum Operations to Make Binary Array Elements Equal to One I", "TitleCn": "\u4f7f\u4e8c\u8fdb\u5236\u6570\u7ec4\u5168\u90e8\u7b49\u4e8e 1 \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570 I", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 133 Problem 2"}, {"ID": 3192, "Title": "Minimum Operations to Make Binary Array Elements Equal to One II", "TitleCn": "\u4f7f\u4e8c\u8fdb\u5236\u6570\u7ec4\u5168\u90e8\u7b49\u4e8e 1 \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570 II", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 133 Problem 3"}, {"ID": 3193, "Title": "Count the Number of Inversions", "TitleCn": "\u7edf\u8ba1\u9006\u5e8f\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-inversions/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 133 Problem 4"}, {"ID": 3194, "Title": "Minimum Average of Smallest and Largest Elements", "TitleCn": "\u6700\u5c0f\u5143\u7d20\u548c\u6700\u5927\u5143\u7d20\u7684\u6700\u5c0f\u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/minimum-average-of-smallest-and-largest-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 403 Problem 1"}, {"ID": 3195, "Title": "Find the Minimum Area to Cover All Ones I", "TitleCn": "\u5305\u542b\u6240\u6709 1 \u7684\u6700\u5c0f\u77e9\u5f62\u9762\u79ef I", "Url": "https://leetcode.cn/problems/find-the-minimum-area-to-cover-all-ones-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 403 Problem 2"}, {"ID": 3196, "Title": "Maximize Total Cost of Alternating Subarrays", "TitleCn": "\u6700\u5927\u5316\u5b50\u6570\u7ec4\u7684\u603b\u6210\u672c", "Url": "https://leetcode.cn/problems/maximize-total-cost-of-alternating-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 403 Problem 3"}, {"ID": 3197, "Title": "Find the Minimum Area to Cover All Ones II", "TitleCn": "\u5305\u542b\u6240\u6709 1 \u7684\u6700\u5c0f\u77e9\u5f62\u9762\u79ef II", "Url": "https://leetcode.cn/problems/find-the-minimum-area-to-cover-all-ones-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 403 Problem 4"}, {"ID": 3198, "Title": "Find Cities in Each State", "TitleCn": "\u67e5\u627e\u6bcf\u4e2a\u5dde\u7684\u57ce\u5e02", "Url": "https://leetcode.cn/problems/find-cities-in-each-state/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3199, "Title": "Count Triplets with Even XOR Set Bits I", "TitleCn": "\u7528\u5076\u6570\u5f02\u6216\u8bbe\u7f6e\u4f4d\u8ba1\u6570\u4e09\u5143\u7ec4 I", "Url": "https://leetcode.cn/problems/count-triplets-with-even-xor-set-bits-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3200, "Title": "Maximum Height of a Triangle", "TitleCn": "\u4e09\u89d2\u5f62\u7684\u6700\u5927\u9ad8\u5ea6", "Url": "https://leetcode.cn/problems/maximum-height-of-a-triangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 404 Problem 1"}, {"ID": 3201, "Title": "Find the Maximum Length of Valid Subsequence I", "TitleCn": "\u627e\u51fa\u6709\u6548\u5b50\u5e8f\u5217\u7684\u6700\u5927\u957f\u5ea6 I", "Url": "https://leetcode.cn/problems/find-the-maximum-length-of-valid-subsequence-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 404 Problem 2"}, {"ID": 3202, "Title": "Find the Maximum Length of Valid Subsequence II", "TitleCn": "\u627e\u51fa\u6709\u6548\u5b50\u5e8f\u5217\u7684\u6700\u5927\u957f\u5ea6 II", "Url": "https://leetcode.cn/problems/find-the-maximum-length-of-valid-subsequence-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 404 Problem 3"}, {"ID": 3203, "Title": "Find Minimum Diameter After Merging Two Trees", "TitleCn": "\u5408\u5e76\u4e24\u68f5\u6811\u540e\u7684\u6700\u5c0f\u76f4\u5f84", "Url": "https://leetcode.cn/problems/find-minimum-diameter-after-merging-two-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 404 Problem 4"}, {"ID": 3204, "Title": "Bitwise User Permissions Analysis", "TitleCn": "\u6309\u4f4d\u7528\u6237\u6743\u9650\u5206\u6790", "Url": "https://leetcode.cn/problems/bitwise-user-permissions-analysis/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3205, "Title": "Maximum Array Hopping Score I", "TitleCn": "\u6700\u5927\u6570\u7ec4\u8df3\u8dc3\u5f97\u5206 I", "Url": "https://leetcode.cn/problems/maximum-array-hopping-score-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3206, "Title": "Alternating Groups I", "TitleCn": "\u4ea4\u66ff\u7ec4 I", "Url": "https://leetcode.cn/problems/alternating-groups-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 134 Problem 1"}, {"ID": 3207, "Title": "Maximum Points After Enemy Battles", "TitleCn": "\u4e0e\u654c\u4eba\u6218\u6597\u540e\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-points-after-enemy-battles/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 134 Problem 2"}, {"ID": 3208, "Title": "Alternating Groups II", "TitleCn": "\u4ea4\u66ff\u7ec4 II", "Url": "https://leetcode.cn/problems/alternating-groups-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 134 Problem 3"}, {"ID": 3209, "Title": "Number of Subarrays With AND Value of K", "TitleCn": "\u5b50\u6570\u7ec4\u6309\u4f4d\u4e0e\u503c\u4e3a K \u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-subarrays-with-and-value-of-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 134 Problem 4"}, {"ID": 3210, "Title": "Find the Encrypted String", "TitleCn": "\u627e\u51fa\u52a0\u5bc6\u540e\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-the-encrypted-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 405 Problem 1"}, {"ID": 3211, "Title": "Generate Binary Strings Without Adjacent Zeros", "TitleCn": "\u751f\u6210\u4e0d\u542b\u76f8\u90bb\u96f6\u7684\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/generate-binary-strings-without-adjacent-zeros/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 405 Problem 2"}, {"ID": 3212, "Title": "Count Submatrices With Equal Frequency of X and Y", "TitleCn": "\u7edf\u8ba1 X \u548c Y \u9891\u6570\u76f8\u7b49\u7684\u5b50\u77e9\u9635\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-submatrices-with-equal-frequency-of-x-and-y/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 405 Problem 3"}, {"ID": 3213, "Title": "Construct String with Minimum Cost", "TitleCn": "\u6700\u5c0f\u4ee3\u4ef7\u6784\u9020\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/construct-string-with-minimum-cost/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 405 Problem 4"}, {"ID": 3214, "Title": "Year on Year Growth Rate", "TitleCn": "\u540c\u6bd4\u589e\u957f\u7387", "Url": "https://leetcode.cn/problems/year-on-year-growth-rate/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3215, "Title": "Count Triplets with Even XOR Set Bits II", "TitleCn": "\u7528\u5076\u6570\u5f02\u6216\u8bbe\u7f6e\u4f4d\u8ba1\u6570\u4e09\u5143\u7ec4 II", "Url": "https://leetcode.cn/problems/count-triplets-with-even-xor-set-bits-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3216, "Title": "Lexicographically Smallest String After a Swap", "TitleCn": "\u4ea4\u6362\u540e\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-smallest-string-after-a-swap/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 406 Problem 1"}, {"ID": 3217, "Title": "Delete Nodes From Linked List Present in Array", "TitleCn": "\u4ece\u94fe\u8868\u4e2d\u79fb\u9664\u5728\u6570\u7ec4\u4e2d\u5b58\u5728\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/delete-nodes-from-linked-list-present-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 406 Problem 2"}, {"ID": 3218, "Title": "Minimum Cost for Cutting Cake I", "TitleCn": "\u5207\u86cb\u7cd5\u7684\u6700\u5c0f\u603b\u5f00\u9500 I", "Url": "https://leetcode.cn/problems/minimum-cost-for-cutting-cake-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 406 Problem 3"}, {"ID": 3219, "Title": "Minimum Cost for Cutting Cake II", "TitleCn": "\u5207\u86cb\u7cd5\u7684\u6700\u5c0f\u603b\u5f00\u9500 II", "Url": "https://leetcode.cn/problems/minimum-cost-for-cutting-cake-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 406 Problem 4"}, {"ID": 3220, "Title": "Odd and Even Transactions", "TitleCn": "\u5947\u6570\u548c\u5076\u6570\u4ea4\u6613", "Url": "https://leetcode.cn/problems/odd-and-even-transactions/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3221, "Title": "Maximum Array Hopping Score II", "TitleCn": "\u6700\u5927\u6570\u7ec4\u8df3\u8dc3\u5f97\u5206 II", "Url": "https://leetcode.cn/problems/maximum-array-hopping-score-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3222, "Title": "Find the Winning Player in Coin Game", "TitleCn": "\u6c42\u51fa\u786c\u5e01\u6e38\u620f\u7684\u8d62\u5bb6", "Url": "https://leetcode.cn/problems/find-the-winning-player-in-coin-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 135 Problem 1"}, {"ID": 3223, "Title": "Minimum Length of String After Operations", "TitleCn": "\u64cd\u4f5c\u540e\u5b57\u7b26\u4e32\u7684\u6700\u77ed\u957f\u5ea6", "Url": "https://leetcode.cn/problems/minimum-length-of-string-after-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 135 Problem 2"}, {"ID": 3224, "Title": "Minimum Array Changes to Make Differences Equal", "TitleCn": "\u4f7f\u5dee\u503c\u76f8\u7b49\u7684\u6700\u5c11\u6570\u7ec4\u6539\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-array-changes-to-make-differences-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 135 Problem 3"}, {"ID": 3225, "Title": "Maximum Score From Grid Operations", "TitleCn": "\u7f51\u683c\u56fe\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-score-from-grid-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 135 Problem 4"}, {"ID": 3226, "Title": "Number of Bit Changes to Make Two Integers Equal", "TitleCn": "\u4f7f\u4e24\u4e2a\u6574\u6570\u76f8\u7b49\u7684\u4f4d\u66f4\u6539\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-bit-changes-to-make-two-integers-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 407 Problem 1"}, {"ID": 3227, "Title": "Vowels Game in a String", "TitleCn": "\u5b57\u7b26\u4e32\u5143\u97f3\u6e38\u620f", "Url": "https://leetcode.cn/problems/vowels-game-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 407 Problem 2"}, {"ID": 3228, "Title": "Maximum Number of Operations to Move Ones to the End", "TitleCn": "\u5c06 1 \u79fb\u52a8\u5230\u672b\u5c3e\u7684\u6700\u5927\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-operations-to-move-ones-to-the-end/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 407 Problem 3"}, {"ID": 3229, "Title": "Minimum Operations to Make Array Equal to Target", "TitleCn": "\u4f7f\u6570\u7ec4\u7b49\u4e8e\u76ee\u6807\u6570\u7ec4\u6240\u9700\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-array-equal-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 407 Problem 4"}, {"ID": 3230, "Title": "Customer Purchasing Behavior Analysis", "TitleCn": "\u5ba2\u6237\u8d2d\u4e70\u884c\u4e3a\u5206\u6790", "Url": "https://leetcode.cn/problems/customer-purchasing-behavior-analysis/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3231, "Title": "Minimum Number of Increasing Subsequence to Be Removed", "TitleCn": "\u8981\u5220\u9664\u7684\u9012\u589e\u5b50\u5e8f\u5217\u7684\u6700\u5c0f\u6570\u91cf", "Url": "https://leetcode.cn/problems/minimum-number-of-increasing-subsequence-to-be-removed/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3232, "Title": "Find if Digit Game Can Be Won", "TitleCn": "\u5224\u65ad\u662f\u5426\u53ef\u4ee5\u8d62\u5f97\u6570\u5b57\u6e38\u620f", "Url": "https://leetcode.cn/problems/find-if-digit-game-can-be-won/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 408 Problem 1"}, {"ID": 3233, "Title": "Find the Count of Numbers Which Are Not Special", "TitleCn": "\u7edf\u8ba1\u4e0d\u662f\u7279\u6b8a\u6570\u5b57\u7684\u6570\u5b57\u6570\u91cf", "Url": "https://leetcode.cn/problems/find-the-count-of-numbers-which-are-not-special/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 408 Problem 2"}, {"ID": 3234, "Title": "Count the Number of Substrings With Dominant Ones", "TitleCn": "\u7edf\u8ba1 1 \u663e\u8457\u7684\u5b57\u7b26\u4e32\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-the-number-of-substrings-with-dominant-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 408 Problem 3"}, {"ID": 3235, "Title": "Check if the Rectangle Corner Is Reachable", "TitleCn": "\u5224\u65ad\u77e9\u5f62\u7684\u4e24\u4e2a\u89d2\u843d\u662f\u5426\u53ef\u8fbe", "Url": "https://leetcode.cn/problems/check-if-the-rectangle-corner-is-reachable/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 408 Problem 4"}, {"ID": 3236, "Title": "CEO Subordinate Hierarchy", "TitleCn": "\u9996\u5e2d\u6267\u884c\u5b98\u4e0b\u5c5e\u5c42\u7ea7", "Url": "https://leetcode.cn/problems/ceo-subordinate-hierarchy/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3237, "Title": "Alt and Tab Simulation", "TitleCn": "Alt \u548c Tab \u6a21\u62df", "Url": "https://leetcode.cn/problems/alt-and-tab-simulation/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3238, "Title": "Find the Number of Winning Players", "TitleCn": "\u6c42\u51fa\u80dc\u5229\u73a9\u5bb6\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/find-the-number-of-winning-players/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 136 Problem 1"}, {"ID": 3239, "Title": "Minimum Number of Flips to Make Binary Grid Palindromic I", "TitleCn": "\u6700\u5c11\u7ffb\u8f6c\u6b21\u6570\u4f7f\u4e8c\u8fdb\u5236\u77e9\u9635\u56de\u6587 I", "Url": "https://leetcode.cn/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 136 Problem 2"}, {"ID": 3240, "Title": "Minimum Number of Flips to Make Binary Grid Palindromic II", "TitleCn": "\u6700\u5c11\u7ffb\u8f6c\u6b21\u6570\u4f7f\u4e8c\u8fdb\u5236\u77e9\u9635\u56de\u6587 II", "Url": "https://leetcode.cn/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 136 Problem 3"}, {"ID": 3241, "Title": "Time Taken to Mark All Nodes", "TitleCn": "\u6807\u8bb0\u6240\u6709\u8282\u70b9\u9700\u8981\u7684\u65f6\u95f4", "Url": "https://leetcode.cn/problems/time-taken-to-mark-all-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 136 Problem 4"}, {"ID": 3242, "Title": "Design Neighbor Sum Service", "TitleCn": "\u8bbe\u8ba1\u76f8\u90bb\u5143\u7d20\u6c42\u548c\u670d\u52a1", "Url": "https://leetcode.cn/problems/design-neighbor-sum-service/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 409 Problem 1"}, {"ID": 3243, "Title": "Shortest Distance After Road Addition Queries I", "TitleCn": "\u65b0\u589e\u9053\u8def\u67e5\u8be2\u540e\u7684\u6700\u77ed\u8ddd\u79bb I", "Url": "https://leetcode.cn/problems/shortest-distance-after-road-addition-queries-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 409 Problem 2"}, {"ID": 3244, "Title": "Shortest Distance After Road Addition Queries II", "TitleCn": "\u65b0\u589e\u9053\u8def\u67e5\u8be2\u540e\u7684\u6700\u77ed\u8ddd\u79bb II", "Url": "https://leetcode.cn/problems/shortest-distance-after-road-addition-queries-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 409 Problem 3"}, {"ID": 3245, "Title": "Alternating Groups III", "TitleCn": "\u4ea4\u66ff\u7ec4 III", "Url": "https://leetcode.cn/problems/alternating-groups-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 409 Problem 4"}, {"ID": 3246, "Title": "Premier League Table Ranking", "TitleCn": "\u82f1\u8d85\u79ef\u5206\u699c\u6392\u540d", "Url": "https://leetcode.cn/problems/premier-league-table-ranking/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3247, "Title": "Number of Subsequences with Odd Sum", "TitleCn": "\u5947\u6570\u548c\u5b50\u5e8f\u5217\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-subsequences-with-odd-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3248, "Title": "Snake in Matrix", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u86c7", "Url": "https://leetcode.cn/problems/snake-in-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 410 Problem 1"}, {"ID": 3249, "Title": "Count the Number of Good Nodes", "TitleCn": "\u7edf\u8ba1\u597d\u8282\u70b9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-good-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 410 Problem 2"}, {"ID": 3250, "Title": "Find the Count of Monotonic Pairs I", "TitleCn": "\u5355\u8c03\u6570\u7ec4\u5bf9\u7684\u6570\u76ee I", "Url": "https://leetcode.cn/problems/find-the-count-of-monotonic-pairs-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 410 Problem 3"}, {"ID": 3251, "Title": "Find the Count of Monotonic Pairs II", "TitleCn": "\u5355\u8c03\u6570\u7ec4\u5bf9\u7684\u6570\u76ee II", "Url": "https://leetcode.cn/problems/find-the-count-of-monotonic-pairs-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 410 Problem 4"}, {"ID": 3252, "Title": "Premier League Table Ranking II", "TitleCn": "\u82f1\u8d85\u79ef\u5206\u699c\u6392\u540d II", "Url": "https://leetcode.cn/problems/premier-league-table-ranking-ii/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3253, "Title": "Construct String with Minimum Cost (Easy)", "TitleCn": "\u6700\u5c0f\u4ee3\u4ef7\u6784\u9020\u5b57\u7b26\u4e32\uff08\u7b80\u5355\uff09", "Url": "https://leetcode.cn/problems/construct-string-with-minimum-cost-easy/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3254, "Title": "Find the Power of K-Size Subarrays I", "TitleCn": "\u957f\u5ea6\u4e3a K \u7684\u5b50\u6570\u7ec4\u7684\u80fd\u91cf\u503c I", "Url": "https://leetcode.cn/problems/find-the-power-of-k-size-subarrays-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 137 Problem 1"}, {"ID": 3255, "Title": "Find the Power of K-Size Subarrays II", "TitleCn": "\u957f\u5ea6\u4e3a K \u7684\u5b50\u6570\u7ec4\u7684\u80fd\u91cf\u503c II", "Url": "https://leetcode.cn/problems/find-the-power-of-k-size-subarrays-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 137 Problem 2"}, {"ID": 3256, "Title": "Maximum Value Sum by Placing Three Rooks I", "TitleCn": "\u653e\u4e09\u4e2a\u8f66\u7684\u4ef7\u503c\u4e4b\u548c\u6700\u5927 I", "Url": "https://leetcode.cn/problems/maximum-value-sum-by-placing-three-rooks-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 137 Problem 3"}, {"ID": 3257, "Title": "Maximum Value Sum by Placing Three Rooks II", "TitleCn": "\u653e\u4e09\u4e2a\u8f66\u7684\u4ef7\u503c\u4e4b\u548c\u6700\u5927 II", "Url": "https://leetcode.cn/problems/maximum-value-sum-by-placing-three-rooks-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 137 Problem 4"}, {"ID": 3258, "Title": "Count Substrings That Satisfy K-Constraint I", "TitleCn": "\u7edf\u8ba1\u6ee1\u8db3 K \u7ea6\u675f\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u91cf I", "Url": "https://leetcode.cn/problems/count-substrings-that-satisfy-k-constraint-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 411 Problem 1"}, {"ID": 3259, "Title": "Maximum Energy Boost From Two Drinks", "TitleCn": "\u8d85\u7ea7\u996e\u6599\u7684\u6700\u5927\u5f3a\u5316\u80fd\u91cf", "Url": "https://leetcode.cn/problems/maximum-energy-boost-from-two-drinks/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 411 Problem 2"}, {"ID": 3260, "Title": "Find the Largest Palindrome Divisible by K", "TitleCn": "\u627e\u51fa\u6700\u5927\u7684 N \u4f4d K \u56de\u6587\u6570", "Url": "https://leetcode.cn/problems/find-the-largest-palindrome-divisible-by-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 411 Problem 3"}, {"ID": 3261, "Title": "Count Substrings That Satisfy K-Constraint II", "TitleCn": "\u7edf\u8ba1\u6ee1\u8db3 K \u7ea6\u675f\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u91cf II", "Url": "https://leetcode.cn/problems/count-substrings-that-satisfy-k-constraint-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 411 Problem 4"}, {"ID": 3262, "Title": "Find Overlapping Shifts", "TitleCn": "\u67e5\u627e\u91cd\u53e0\u7684\u73ed\u6b21", "Url": "https://leetcode.cn/problems/find-overlapping-shifts/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3263, "Title": "Convert Doubly Linked List to Array I", "TitleCn": "\u5c06\u53cc\u94fe\u8868\u8f6c\u6362\u4e3a\u6570\u7ec4 I", "Url": "https://leetcode.cn/problems/convert-doubly-linked-list-to-array-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3264, "Title": "Final Array State After K Multiplication Operations I", "TitleCn": "K \u6b21\u4e58\u8fd0\u7b97\u540e\u7684\u6700\u7ec8\u6570\u7ec4 I", "Url": "https://leetcode.cn/problems/final-array-state-after-k-multiplication-operations-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 412 Problem 1"}, {"ID": 3265, "Title": "Count Almost Equal Pairs I", "TitleCn": "\u7edf\u8ba1\u8fd1\u4f3c\u76f8\u7b49\u6570\u5bf9 I", "Url": "https://leetcode.cn/problems/count-almost-equal-pairs-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 412 Problem 2"}, {"ID": 3266, "Title": "Final Array State After K Multiplication Operations II", "TitleCn": "K \u6b21\u4e58\u8fd0\u7b97\u540e\u7684\u6700\u7ec8\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/final-array-state-after-k-multiplication-operations-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 412 Problem 3"}, {"ID": 3267, "Title": "Count Almost Equal Pairs II", "TitleCn": "\u7edf\u8ba1\u8fd1\u4f3c\u76f8\u7b49\u6570\u5bf9 II", "Url": "https://leetcode.cn/problems/count-almost-equal-pairs-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 412 Problem 4"}, {"ID": 3268, "Title": "Find Overlapping Shifts II", "TitleCn": "\u67e5\u627e\u91cd\u53e0\u7684\u73ed\u6b21 II", "Url": "https://leetcode.cn/problems/find-overlapping-shifts-ii/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3269, "Title": "Constructing Two Increasing Arrays", "TitleCn": "\u6784\u5efa\u4e24\u4e2a\u9012\u589e\u6570\u7ec4", "Url": "https://leetcode.cn/problems/constructing-two-increasing-arrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3270, "Title": "Find the Key of the Numbers", "TitleCn": "\u6c42\u51fa\u6570\u5b57\u7b54\u6848", "Url": "https://leetcode.cn/problems/find-the-key-of-the-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 138 Problem 1"}, {"ID": 3271, "Title": "Hash Divided String", "TitleCn": "\u54c8\u5e0c\u5206\u5272\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/hash-divided-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 138 Problem 2"}, {"ID": 3272, "Title": "Find the Count of Good Integers", "TitleCn": "\u7edf\u8ba1\u597d\u6574\u6570\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/find-the-count-of-good-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 138 Problem 3"}, {"ID": 3273, "Title": "Minimum Amount of Damage Dealt to Bob", "TitleCn": "\u5bf9 Bob \u9020\u6210\u7684\u6700\u5c11\u4f24\u5bb3", "Url": "https://leetcode.cn/problems/minimum-amount-of-damage-dealt-to-bob/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 138 Problem 4"}, {"ID": 3274, "Title": "Check if Two Chessboard Squares Have the Same Color", "TitleCn": "\u68c0\u67e5\u68cb\u76d8\u65b9\u683c\u989c\u8272\u662f\u5426\u76f8\u540c", "Url": "https://leetcode.cn/problems/check-if-two-chessboard-squares-have-the-same-color/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 413 Problem 1"}, {"ID": 3275, "Title": "K-th Nearest Obstacle Queries", "TitleCn": "\u7b2c K \u8fd1\u969c\u788d\u7269\u67e5\u8be2", "Url": "https://leetcode.cn/problems/k-th-nearest-obstacle-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 413 Problem 2"}, {"ID": 3276, "Title": "Select Cells in Grid With Maximum Score", "TitleCn": "\u9009\u62e9\u77e9\u9635\u4e2d\u5355\u5143\u683c\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/select-cells-in-grid-with-maximum-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 413 Problem 3"}, {"ID": 3277, "Title": "Maximum XOR Score Subarray Queries", "TitleCn": "\u67e5\u8be2\u5b50\u6570\u7ec4\u6700\u5927\u5f02\u6216\u503c", "Url": "https://leetcode.cn/problems/maximum-xor-score-subarray-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 413 Problem 4"}, {"ID": 3278, "Title": "Find Candidates for Data Scientist Position II", "TitleCn": "\u5bfb\u627e\u6570\u636e\u79d1\u5b66\u5bb6\u804c\u4f4d\u7684\u5019\u9009\u4eba II", "Url": "https://leetcode.cn/problems/find-candidates-for-data-scientist-position-ii/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3279, "Title": "Maximum Total Area Occupied by Pistons", "TitleCn": "\u6d3b\u585e\u5360\u636e\u7684\u6700\u5927\u603b\u9762\u79ef", "Url": "https://leetcode.cn/problems/maximum-total-area-occupied-by-pistons/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3280, "Title": "Convert Date to Binary", "TitleCn": "\u5c06\u65e5\u671f\u8f6c\u6362\u4e3a\u4e8c\u8fdb\u5236\u8868\u793a", "Url": "https://leetcode.cn/problems/convert-date-to-binary/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 414 Problem 1"}, {"ID": 3281, "Title": "Maximize Score of Numbers in Ranges", "TitleCn": "\u8303\u56f4\u5185\u6574\u6570\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximize-score-of-numbers-in-ranges/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 414 Problem 2"}, {"ID": 3282, "Title": "Reach End of Array With Max Score", "TitleCn": "\u5230\u8fbe\u6570\u7ec4\u672b\u5c3e\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/reach-end-of-array-with-max-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 414 Problem 3"}, {"ID": 3283, "Title": "Maximum Number of Moves to Kill All Pawns", "TitleCn": "\u5403\u6389\u6240\u6709\u5175\u9700\u8981\u7684\u6700\u591a\u79fb\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-moves-to-kill-all-pawns/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 414 Problem 4"}, {"ID": 3284, "Title": "Sum of Consecutive Subarrays", "TitleCn": "\u8fde\u7eed\u5b50\u6570\u7ec4\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-consecutive-subarrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3285, "Title": "Find Indices of Stable Mountains", "TitleCn": "\u627e\u5230\u7a33\u5b9a\u5c71\u7684\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-indices-of-stable-mountains/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 139 Problem 1"}, {"ID": 3286, "Title": "Find a Safe Walk Through a Grid", "TitleCn": "\u7a7f\u8d8a\u7f51\u683c\u56fe\u7684\u5b89\u5168\u8def\u5f84", "Url": "https://leetcode.cn/problems/find-a-safe-walk-through-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 139 Problem 2"}, {"ID": 3287, "Title": "Find the Maximum Sequence Value of Array", "TitleCn": "\u6c42\u51fa\u6570\u7ec4\u4e2d\u6700\u5927\u5e8f\u5217\u503c", "Url": "https://leetcode.cn/problems/find-the-maximum-sequence-value-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 139 Problem 3"}, {"ID": 3288, "Title": "Length of the Longest Increasing Path", "TitleCn": "\u6700\u957f\u4e0a\u5347\u8def\u5f84\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/length-of-the-longest-increasing-path/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 139 Problem 4"}, {"ID": 3289, "Title": "The Two Sneaky Numbers of Digitville", "TitleCn": "\u6570\u5b57\u5c0f\u9547\u4e2d\u7684\u6363\u86cb\u9b3c", "Url": "https://leetcode.cn/problems/the-two-sneaky-numbers-of-digitville/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 415 Problem 1"}, {"ID": 3290, "Title": "Maximum Multiplication Score", "TitleCn": "\u6700\u9ad8\u4e58\u6cd5\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-multiplication-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 415 Problem 2"}, {"ID": 3291, "Title": "Minimum Number of Valid Strings to Form Target I", "TitleCn": "\u5f62\u6210\u76ee\u6807\u5b57\u7b26\u4e32\u9700\u8981\u7684\u6700\u5c11\u5b57\u7b26\u4e32\u6570 I", "Url": "https://leetcode.cn/problems/minimum-number-of-valid-strings-to-form-target-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 415 Problem 3"}, {"ID": 3292, "Title": "Minimum Number of Valid Strings to Form Target II", "TitleCn": "\u5f62\u6210\u76ee\u6807\u5b57\u7b26\u4e32\u9700\u8981\u7684\u6700\u5c11\u5b57\u7b26\u4e32\u6570 II", "Url": "https://leetcode.cn/problems/minimum-number-of-valid-strings-to-form-target-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 415 Problem 4"}, {"ID": 3293, "Title": "Calculate Product Final Price", "TitleCn": "\u8ba1\u7b97\u4ea7\u54c1\u6700\u7ec8\u4ef7\u683c", "Url": "https://leetcode.cn/problems/calculate-product-final-price/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3294, "Title": "Convert Doubly Linked List to Array II", "TitleCn": "\u5c06\u53cc\u94fe\u8868\u8f6c\u6362\u4e3a\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/convert-doubly-linked-list-to-array-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3295, "Title": "Report Spam Message", "TitleCn": "\u4e3e\u62a5\u5783\u573e\u4fe1\u606f", "Url": "https://leetcode.cn/problems/report-spam-message/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 416 Problem 1"}, {"ID": 3296, "Title": "Minimum Number of Seconds to Make Mountain Height Zero", "TitleCn": "\u79fb\u5c71\u6240\u9700\u7684\u6700\u5c11\u79d2\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-seconds-to-make-mountain-height-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 416 Problem 2"}, {"ID": 3297, "Title": "Count Substrings That Can Be Rearranged to Contain a String I", "TitleCn": "\u7edf\u8ba1\u91cd\u65b0\u6392\u5217\u540e\u5305\u542b\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u76ee I", "Url": "https://leetcode.cn/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 416 Problem 3"}, {"ID": 3298, "Title": "Count Substrings That Can Be Rearranged to Contain a String II", "TitleCn": "\u7edf\u8ba1\u91cd\u65b0\u6392\u5217\u540e\u5305\u542b\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u76ee II", "Url": "https://leetcode.cn/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 416 Problem 4"}, {"ID": 3299, "Title": "Sum of Consecutive Subsequences", "TitleCn": "\u8fde\u7eed\u5b50\u5e8f\u5217\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-consecutive-subsequences/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3300, "Title": "Minimum Element After Replacement With Digit Sum", "TitleCn": "\u66ff\u6362\u4e3a\u6570\u4f4d\u548c\u4ee5\u540e\u7684\u6700\u5c0f\u5143\u7d20", "Url": "https://leetcode.cn/problems/minimum-element-after-replacement-with-digit-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 140 Problem 1"}, {"ID": 3301, "Title": "Maximize the Total Height of Unique Towers", "TitleCn": "\u9ad8\u5ea6\u4e92\u4e0d\u76f8\u540c\u7684\u6700\u5927\u5854\u9ad8\u548c", "Url": "https://leetcode.cn/problems/maximize-the-total-height-of-unique-towers/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 140 Problem 2"}, {"ID": 3302, "Title": "Find the Lexicographically Smallest Valid Sequence", "TitleCn": "\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5408\u6cd5\u5e8f\u5217", "Url": "https://leetcode.cn/problems/find-the-lexicographically-smallest-valid-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 140 Problem 3"}, {"ID": 3303, "Title": "Find the Occurrence of First Almost Equal Substring", "TitleCn": "\u7b2c\u4e00\u4e2a\u51e0\u4e4e\u76f8\u7b49\u5b50\u5b57\u7b26\u4e32\u7684\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-the-occurrence-of-first-almost-equal-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 11, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 140 Problem 4"}, {"ID": 3304, "Title": "Find the K-th Character in String Game I", "TitleCn": "\u627e\u51fa\u7b2c K \u4e2a\u5b57\u7b26 I", "Url": "https://leetcode.cn/problems/find-the-k-th-character-in-string-game-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 417 Problem 1"}, {"ID": 3305, "Title": "Count of Substrings Containing Every Vowel and K Consonants I", "TitleCn": "\u5143\u97f3\u8f85\u97f3\u5b57\u7b26\u4e32\u8ba1\u6570 I", "Url": "https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 417 Problem 2"}, {"ID": 3306, "Title": "Count of Substrings Containing Every Vowel and K Consonants II", "TitleCn": "\u5143\u97f3\u8f85\u97f3\u5b57\u7b26\u4e32\u8ba1\u6570 II", "Url": "https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 417 Problem 3"}, {"ID": 3307, "Title": "Find the K-th Character in String Game II", "TitleCn": "\u627e\u51fa\u7b2c K \u4e2a\u5b57\u7b26 II", "Url": "https://leetcode.cn/problems/find-the-k-th-character-in-string-game-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 417 Problem 4"}]
\ No newline at end of file
+[{"ID": 1, "Title": "Two Sum", "TitleCn": "\u4e24\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/two-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 2, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2, "Title": "Add Two Numbers", "TitleCn": "\u4e24\u6570\u76f8\u52a0", "Url": "https://leetcode.cn/problems/add-two-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3, "Title": "Longest Substring Without Repeating Characters", "TitleCn": "\u65e0\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32", "Url": "https://leetcode.cn/problems/longest-substring-without-repeating-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 4, "Title": "Median of Two Sorted Arrays", "TitleCn": "\u5bfb\u627e\u4e24\u4e2a\u6b63\u5e8f\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570", "Url": "https://leetcode.cn/problems/median-of-two-sorted-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 5, "Title": "Longest Palindromic Substring", "TitleCn": "\u6700\u957f\u56de\u6587\u5b50\u4e32", "Url": "https://leetcode.cn/problems/longest-palindromic-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 6, "Title": "Zigzag Conversion", "TitleCn": "Z \u5b57\u5f62\u53d8\u6362", "Url": "https://leetcode.cn/problems/zigzag-conversion/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 7, "Title": "Reverse Integer", "TitleCn": "\u6574\u6570\u53cd\u8f6c", "Url": "https://leetcode.cn/problems/reverse-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 8, "Title": "String to Integer (atoi)", "TitleCn": "\u5b57\u7b26\u4e32\u8f6c\u6362\u6574\u6570 (atoi)", "Url": "https://leetcode.cn/problems/string-to-integer-atoi/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 9, "Title": "Palindrome Number", "TitleCn": "\u56de\u6587\u6570", "Url": "https://leetcode.cn/problems/palindrome-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 10, "Title": "Regular Expression Matching", "TitleCn": "\u6b63\u5219\u8868\u8fbe\u5f0f\u5339\u914d", "Url": "https://leetcode.cn/problems/regular-expression-matching/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 11, "Title": "Container With Most Water", "TitleCn": "\u76db\u6700\u591a\u6c34\u7684\u5bb9\u5668", "Url": "https://leetcode.cn/problems/container-with-most-water/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 12, "Title": "Integer to Roman", "TitleCn": "\u6574\u6570\u8f6c\u7f57\u9a6c\u6570\u5b57", "Url": "https://leetcode.cn/problems/integer-to-roman/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 13, "Title": "Roman to Integer", "TitleCn": "\u7f57\u9a6c\u6570\u5b57\u8f6c\u6574\u6570", "Url": "https://leetcode.cn/problems/roman-to-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 14, "Title": "Longest Common Prefix", "TitleCn": "\u6700\u957f\u516c\u5171\u524d\u7f00", "Url": "https://leetcode.cn/problems/longest-common-prefix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 15, "Title": "3Sum", "TitleCn": "\u4e09\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/3sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 16, "Title": "3Sum Closest", "TitleCn": "\u6700\u63a5\u8fd1\u7684\u4e09\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/3sum-closest/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 17, "Title": "Letter Combinations of a Phone Number", "TitleCn": "\u7535\u8bdd\u53f7\u7801\u7684\u5b57\u6bcd\u7ec4\u5408", "Url": "https://leetcode.cn/problems/letter-combinations-of-a-phone-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 18, "Title": "4Sum", "TitleCn": "\u56db\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/4sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 19, "Title": "Remove Nth Node From End of List", "TitleCn": "\u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2cN\u4e2a\u8282\u70b9", "Url": "https://leetcode.cn/problems/remove-nth-node-from-end-of-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 20, "Title": "Valid Parentheses", "TitleCn": "\u6709\u6548\u7684\u62ec\u53f7", "Url": "https://leetcode.cn/problems/valid-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 21, "Title": "Merge Two Sorted Lists", "TitleCn": "\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u94fe\u8868", "Url": "https://leetcode.cn/problems/merge-two-sorted-lists/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 22, "Title": "Generate Parentheses", "TitleCn": "\u62ec\u53f7\u751f\u6210", "Url": "https://leetcode.cn/problems/generate-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 23, "Title": "Merge k Sorted Lists", "TitleCn": "\u5408\u5e76K\u4e2a\u5347\u5e8f\u94fe\u8868", "Url": "https://leetcode.cn/problems/merge-k-sorted-lists/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 24, "Title": "Swap Nodes in Pairs", "TitleCn": "\u4e24\u4e24\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/swap-nodes-in-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 25, "Title": "Reverse Nodes in k-Group", "TitleCn": "K \u4e2a\u4e00\u7ec4\u7ffb\u8f6c\u94fe\u8868", "Url": "https://leetcode.cn/problems/reverse-nodes-in-k-group/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 7, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 26, "Title": "Remove Duplicates from Sorted Array", "TitleCn": "\u5220\u9664\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879", "Url": "https://leetcode.cn/problems/remove-duplicates-from-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 27, "Title": "Remove Element", "TitleCn": "\u79fb\u9664\u5143\u7d20", "Url": "https://leetcode.cn/problems/remove-element/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 28, "Title": "Find the Index of the First Occurrence in a String", "TitleCn": "\u627e\u51fa\u5b57\u7b26\u4e32\u4e2d\u7b2c\u4e00\u4e2a\u5339\u914d\u9879\u7684\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 29, "Title": "Divide Two Integers", "TitleCn": "\u4e24\u6570\u76f8\u9664", "Url": "https://leetcode.cn/problems/divide-two-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 30, "Title": "Substring with Concatenation of All Words", "TitleCn": "\u4e32\u8054\u6240\u6709\u5355\u8bcd\u7684\u5b50\u4e32", "Url": "https://leetcode.cn/problems/substring-with-concatenation-of-all-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 31, "Title": "Next Permutation", "TitleCn": "\u4e0b\u4e00\u4e2a\u6392\u5217", "Url": "https://leetcode.cn/problems/next-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 32, "Title": "Longest Valid Parentheses", "TitleCn": "\u6700\u957f\u6709\u6548\u62ec\u53f7", "Url": "https://leetcode.cn/problems/longest-valid-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 33, "Title": "Search in Rotated Sorted Array", "TitleCn": "\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/search-in-rotated-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 34, "Title": "Find First and Last Position of Element in Sorted Array", "TitleCn": "\u5728\u6392\u5e8f\u6570\u7ec4\u4e2d\u67e5\u627e\u5143\u7d20\u7684\u7b2c\u4e00\u4e2a\u548c\u6700\u540e\u4e00\u4e2a\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 35, "Title": "Search Insert Position", "TitleCn": "\u641c\u7d22\u63d2\u5165\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/search-insert-position/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 36, "Title": "Valid Sudoku", "TitleCn": "\u6709\u6548\u7684\u6570\u72ec", "Url": "https://leetcode.cn/problems/valid-sudoku/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 37, "Title": "Sudoku Solver", "TitleCn": "\u89e3\u6570\u72ec", "Url": "https://leetcode.cn/problems/sudoku-solver/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 38, "Title": "Count and Say", "TitleCn": "\u5916\u89c2\u6570\u5217", "Url": "https://leetcode.cn/problems/count-and-say/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 39, "Title": "Combination Sum", "TitleCn": "\u7ec4\u5408\u603b\u548c", "Url": "https://leetcode.cn/problems/combination-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 40, "Title": "Combination Sum II", "TitleCn": "\u7ec4\u5408\u603b\u548c II", "Url": "https://leetcode.cn/problems/combination-sum-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 41, "Title": "First Missing Positive", "TitleCn": "\u7f3a\u5931\u7684\u7b2c\u4e00\u4e2a\u6b63\u6570", "Url": "https://leetcode.cn/problems/first-missing-positive/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 42, "Title": "Trapping Rain Water", "TitleCn": "\u63a5\u96e8\u6c34", "Url": "https://leetcode.cn/problems/trapping-rain-water/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 43, "Title": "Multiply Strings", "TitleCn": "\u5b57\u7b26\u4e32\u76f8\u4e58", "Url": "https://leetcode.cn/problems/multiply-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 44, "Title": "Wildcard Matching", "TitleCn": "\u901a\u914d\u7b26\u5339\u914d", "Url": "https://leetcode.cn/problems/wildcard-matching/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 45, "Title": "Jump Game II", "TitleCn": "\u8df3\u8dc3\u6e38\u620f II", "Url": "https://leetcode.cn/problems/jump-game-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 46, "Title": "Permutations", "TitleCn": "\u5168\u6392\u5217", "Url": "https://leetcode.cn/problems/permutations/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 47, "Title": "Permutations II", "TitleCn": "\u5168\u6392\u5217 II", "Url": "https://leetcode.cn/problems/permutations-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 48, "Title": "Rotate Image", "TitleCn": "\u65cb\u8f6c\u56fe\u50cf", "Url": "https://leetcode.cn/problems/rotate-image/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 49, "Title": "Group Anagrams", "TitleCn": "\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u5206\u7ec4", "Url": "https://leetcode.cn/problems/group-anagrams/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 50, "Title": "Pow(x, n)", "TitleCn": "Pow(x, n)", "Url": "https://leetcode.cn/problems/powx-n/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 51, "Title": "N-Queens", "TitleCn": "N \u7687\u540e", "Url": "https://leetcode.cn/problems/n-queens/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 52, "Title": "N-Queens II", "TitleCn": "N\u7687\u540e II", "Url": "https://leetcode.cn/problems/n-queens-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 53, "Title": "Maximum Subarray", "TitleCn": "\u6700\u5927\u5b50\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/maximum-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 54, "Title": "Spiral Matrix", "TitleCn": "\u87ba\u65cb\u77e9\u9635", "Url": "https://leetcode.cn/problems/spiral-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 55, "Title": "Jump Game", "TitleCn": "\u8df3\u8dc3\u6e38\u620f", "Url": "https://leetcode.cn/problems/jump-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 56, "Title": "Merge Intervals", "TitleCn": "\u5408\u5e76\u533a\u95f4", "Url": "https://leetcode.cn/problems/merge-intervals/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 57, "Title": "Insert Interval", "TitleCn": "\u63d2\u5165\u533a\u95f4", "Url": "https://leetcode.cn/problems/insert-interval/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 58, "Title": "Length of Last Word", "TitleCn": "\u6700\u540e\u4e00\u4e2a\u5355\u8bcd\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/length-of-last-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 59, "Title": "Spiral Matrix II", "TitleCn": "\u87ba\u65cb\u77e9\u9635 II", "Url": "https://leetcode.cn/problems/spiral-matrix-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 60, "Title": "Permutation Sequence", "TitleCn": "\u6392\u5217\u5e8f\u5217", "Url": "https://leetcode.cn/problems/permutation-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 61, "Title": "Rotate List", "TitleCn": "\u65cb\u8f6c\u94fe\u8868", "Url": "https://leetcode.cn/problems/rotate-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 62, "Title": "Unique Paths", "TitleCn": "\u4e0d\u540c\u8def\u5f84", "Url": "https://leetcode.cn/problems/unique-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 63, "Title": "Unique Paths II", "TitleCn": "\u4e0d\u540c\u8def\u5f84 II", "Url": "https://leetcode.cn/problems/unique-paths-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 64, "Title": "Minimum Path Sum", "TitleCn": "\u6700\u5c0f\u8def\u5f84\u548c", "Url": "https://leetcode.cn/problems/minimum-path-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 65, "Title": "Valid Number", "TitleCn": "\u6709\u6548\u6570\u5b57", "Url": "https://leetcode.cn/problems/valid-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 66, "Title": "Plus One", "TitleCn": "\u52a0\u4e00", "Url": "https://leetcode.cn/problems/plus-one/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 67, "Title": "Add Binary", "TitleCn": "\u4e8c\u8fdb\u5236\u6c42\u548c", "Url": "https://leetcode.cn/problems/add-binary/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 68, "Title": "Text Justification", "TitleCn": "\u6587\u672c\u5de6\u53f3\u5bf9\u9f50", "Url": "https://leetcode.cn/problems/text-justification/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 69, "Title": "Sqrt(x)", "TitleCn": "x \u7684\u5e73\u65b9\u6839", "Url": "https://leetcode.cn/problems/sqrtx/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 70, "Title": "Climbing Stairs", "TitleCn": "\u722c\u697c\u68af", "Url": "https://leetcode.cn/problems/climbing-stairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 71, "Title": "Simplify Path", "TitleCn": "\u7b80\u5316\u8def\u5f84", "Url": "https://leetcode.cn/problems/simplify-path/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 72, "Title": "Edit Distance", "TitleCn": "\u7f16\u8f91\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/edit-distance/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 73, "Title": "Set Matrix Zeroes", "TitleCn": "\u77e9\u9635\u7f6e\u96f6", "Url": "https://leetcode.cn/problems/set-matrix-zeroes/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 74, "Title": "Search a 2D Matrix", "TitleCn": "\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635", "Url": "https://leetcode.cn/problems/search-a-2d-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 75, "Title": "Sort Colors", "TitleCn": "\u989c\u8272\u5206\u7c7b", "Url": "https://leetcode.cn/problems/sort-colors/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 76, "Title": "Minimum Window Substring", "TitleCn": "\u6700\u5c0f\u8986\u76d6\u5b50\u4e32", "Url": "https://leetcode.cn/problems/minimum-window-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 6, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 77, "Title": "Combinations", "TitleCn": "\u7ec4\u5408", "Url": "https://leetcode.cn/problems/combinations/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 78, "Title": "Subsets", "TitleCn": "\u5b50\u96c6", "Url": "https://leetcode.cn/problems/subsets/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 79, "Title": "Word Search", "TitleCn": "\u5355\u8bcd\u641c\u7d22", "Url": "https://leetcode.cn/problems/word-search/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 80, "Title": "Remove Duplicates from Sorted Array II", "TitleCn": "\u5220\u9664\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879 II", "Url": "https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 81, "Title": "Search in Rotated Sorted Array II", "TitleCn": "\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/search-in-rotated-sorted-array-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 82, "Title": "Remove Duplicates from Sorted List II", "TitleCn": "\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20 II", "Url": "https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 83, "Title": "Remove Duplicates from Sorted List", "TitleCn": "\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20", "Url": "https://leetcode.cn/problems/remove-duplicates-from-sorted-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 84, "Title": "Largest Rectangle in Histogram", "TitleCn": "\u67f1\u72b6\u56fe\u4e2d\u6700\u5927\u7684\u77e9\u5f62", "Url": "https://leetcode.cn/problems/largest-rectangle-in-histogram/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 85, "Title": "Maximal Rectangle", "TitleCn": "\u6700\u5927\u77e9\u5f62", "Url": "https://leetcode.cn/problems/maximal-rectangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 86, "Title": "Partition List", "TitleCn": "\u5206\u9694\u94fe\u8868", "Url": "https://leetcode.cn/problems/partition-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 87, "Title": "Scramble String", "TitleCn": "\u6270\u4e71\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/scramble-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 88, "Title": "Merge Sorted Array", "TitleCn": "\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/merge-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 89, "Title": "Gray Code", "TitleCn": "\u683c\u96f7\u7f16\u7801", "Url": "https://leetcode.cn/problems/gray-code/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 90, "Title": "Subsets II", "TitleCn": "\u5b50\u96c6 II", "Url": "https://leetcode.cn/problems/subsets-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 91, "Title": "Decode Ways", "TitleCn": "\u89e3\u7801\u65b9\u6cd5", "Url": "https://leetcode.cn/problems/decode-ways/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 92, "Title": "Reverse Linked List II", "TitleCn": "\u53cd\u8f6c\u94fe\u8868 II", "Url": "https://leetcode.cn/problems/reverse-linked-list-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 93, "Title": "Restore IP Addresses", "TitleCn": "\u590d\u539fIP\u5730\u5740", "Url": "https://leetcode.cn/problems/restore-ip-addresses/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 94, "Title": "Binary Tree Inorder Traversal", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u4e2d\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/binary-tree-inorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 95, "Title": "Unique Binary Search Trees II", "TitleCn": "\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811 II", "Url": "https://leetcode.cn/problems/unique-binary-search-trees-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 96, "Title": "Unique Binary Search Trees", "TitleCn": "\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/unique-binary-search-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 97, "Title": "Interleaving String", "TitleCn": "\u4ea4\u9519\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/interleaving-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 98, "Title": "Validate Binary Search Tree", "TitleCn": "\u9a8c\u8bc1\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/validate-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 99, "Title": "Recover Binary Search Tree", "TitleCn": "\u6062\u590d\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/recover-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 9, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 100, "Title": "Same Tree", "TitleCn": "\u76f8\u540c\u7684\u6811", "Url": "https://leetcode.cn/problems/same-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 101, "Title": "Symmetric Tree", "TitleCn": "\u5bf9\u79f0\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/symmetric-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 102, "Title": "Binary Tree Level Order Traversal", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/binary-tree-level-order-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 103, "Title": "Binary Tree Zigzag Level Order Traversal", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u952f\u9f7f\u5f62\u5c42\u6b21\u904d\u5386", "Url": "https://leetcode.cn/problems/binary-tree-zigzag-level-order-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 104, "Title": "Maximum Depth of Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6", "Url": "https://leetcode.cn/problems/maximum-depth-of-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 105, "Title": "Construct Binary Tree from Preorder and Inorder Traversal", "TitleCn": "\u4ece\u524d\u5e8f\u4e0e\u4e2d\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 106, "Title": "Construct Binary Tree from Inorder and Postorder Traversal", "TitleCn": "\u4ece\u4e2d\u5e8f\u4e0e\u540e\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 107, "Title": "Binary Tree Level Order Traversal II", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5c42\u6b21\u904d\u5386 II", "Url": "https://leetcode.cn/problems/binary-tree-level-order-traversal-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 108, "Title": "Convert Sorted Array to Binary Search Tree", "TitleCn": "\u5c06\u6709\u5e8f\u6570\u7ec4\u8f6c\u6362\u4e3a\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 109, "Title": "Convert Sorted List to Binary Search Tree", "TitleCn": "\u6709\u5e8f\u94fe\u8868\u8f6c\u6362\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/convert-sorted-list-to-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 110, "Title": "Balanced Binary Tree", "TitleCn": "\u5e73\u8861\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/balanced-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 111, "Title": "Minimum Depth of Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u6700\u5c0f\u6df1\u5ea6", "Url": "https://leetcode.cn/problems/minimum-depth-of-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 112, "Title": "Path Sum", "TitleCn": "\u8def\u5f84\u603b\u548c", "Url": "https://leetcode.cn/problems/path-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 113, "Title": "Path Sum II", "TitleCn": "\u8def\u5f84\u603b\u548c II", "Url": "https://leetcode.cn/problems/path-sum-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 114, "Title": "Flatten Binary Tree to Linked List", "TitleCn": "\u4e8c\u53c9\u6811\u5c55\u5f00\u4e3a\u94fe\u8868", "Url": "https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 115, "Title": "Distinct Subsequences", "TitleCn": "\u4e0d\u540c\u7684\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/distinct-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 116, "Title": "Populating Next Right Pointers in Each Node", "TitleCn": "\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488", "Url": "https://leetcode.cn/problems/populating-next-right-pointers-in-each-node/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 117, "Title": "Populating Next Right Pointers in Each Node II", "TitleCn": "\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488 II", "Url": "https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 118, "Title": "Pascal's Triangle", "TitleCn": "\u6768\u8f89\u4e09\u89d2", "Url": "https://leetcode.cn/problems/pascals-triangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 119, "Title": "Pascal's Triangle II", "TitleCn": "\u6768\u8f89\u4e09\u89d2 II", "Url": "https://leetcode.cn/problems/pascals-triangle-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 120, "Title": "Triangle", "TitleCn": "\u4e09\u89d2\u5f62\u6700\u5c0f\u8def\u5f84\u548c", "Url": "https://leetcode.cn/problems/triangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 121, "Title": "Best Time to Buy and Sell Stock", "TitleCn": "\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a", "Url": "https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 122, "Title": "Best Time to Buy and Sell Stock II", "TitleCn": "\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a II", "Url": "https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 123, "Title": "Best Time to Buy and Sell Stock III", "TitleCn": "\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a III", "Url": "https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 124, "Title": "Binary Tree Maximum Path Sum", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u5927\u8def\u5f84\u548c", "Url": "https://leetcode.cn/problems/binary-tree-maximum-path-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 125, "Title": "Valid Palindrome", "TitleCn": "\u9a8c\u8bc1\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/valid-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 126, "Title": "Word Ladder II", "TitleCn": "\u5355\u8bcd\u63a5\u9f99 II", "Url": "https://leetcode.cn/problems/word-ladder-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 127, "Title": "Word Ladder", "TitleCn": "\u5355\u8bcd\u63a5\u9f99", "Url": "https://leetcode.cn/problems/word-ladder/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 128, "Title": "Longest Consecutive Sequence", "TitleCn": "\u6700\u957f\u8fde\u7eed\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-consecutive-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 129, "Title": "Sum Root to Leaf Numbers", "TitleCn": "\u6c42\u6839\u5230\u53f6\u5b50\u8282\u70b9\u6570\u5b57\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-root-to-leaf-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 130, "Title": "Surrounded Regions", "TitleCn": "\u88ab\u56f4\u7ed5\u7684\u533a\u57df", "Url": "https://leetcode.cn/problems/surrounded-regions/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 131, "Title": "Palindrome Partitioning", "TitleCn": "\u5206\u5272\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/palindrome-partitioning/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 132, "Title": "Palindrome Partitioning II", "TitleCn": "\u5206\u5272\u56de\u6587\u4e32 II", "Url": "https://leetcode.cn/problems/palindrome-partitioning-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 133, "Title": "Clone Graph", "TitleCn": "\u514b\u9686\u56fe", "Url": "https://leetcode.cn/problems/clone-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 134, "Title": "Gas Station", "TitleCn": "\u52a0\u6cb9\u7ad9", "Url": "https://leetcode.cn/problems/gas-station/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 135, "Title": "Candy", "TitleCn": "\u5206\u53d1\u7cd6\u679c", "Url": "https://leetcode.cn/problems/candy/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 136, "Title": "Single Number", "TitleCn": "\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/single-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 137, "Title": "Single Number II", "TitleCn": "\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 II", "Url": "https://leetcode.cn/problems/single-number-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 138, "Title": "Copy List with Random Pointer", "TitleCn": "\u590d\u5236\u5e26\u968f\u673a\u6307\u9488\u7684\u94fe\u8868", "Url": "https://leetcode.cn/problems/copy-list-with-random-pointer/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 139, "Title": "Word Break", "TitleCn": "\u5355\u8bcd\u62c6\u5206", "Url": "https://leetcode.cn/problems/word-break/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 140, "Title": "Word Break II", "TitleCn": "\u5355\u8bcd\u62c6\u5206 II", "Url": "https://leetcode.cn/problems/word-break-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 141, "Title": "Linked List Cycle", "TitleCn": "\u73af\u5f62\u94fe\u8868", "Url": "https://leetcode.cn/problems/linked-list-cycle/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 142, "Title": "Linked List Cycle II", "TitleCn": "\u73af\u5f62\u94fe\u8868 II", "Url": "https://leetcode.cn/problems/linked-list-cycle-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 143, "Title": "Reorder List", "TitleCn": "\u91cd\u6392\u94fe\u8868", "Url": "https://leetcode.cn/problems/reorder-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 144, "Title": "Binary Tree Preorder Traversal", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/binary-tree-preorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 145, "Title": "Binary Tree Postorder Traversal", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/binary-tree-postorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 146, "Title": "LRU Cache", "TitleCn": "LRU \u7f13\u5b58", "Url": "https://leetcode.cn/problems/lru-cache/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 147, "Title": "Insertion Sort List", "TitleCn": "\u5bf9\u94fe\u8868\u8fdb\u884c\u63d2\u5165\u6392\u5e8f", "Url": "https://leetcode.cn/problems/insertion-sort-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 148, "Title": "Sort List", "TitleCn": "\u6392\u5e8f\u94fe\u8868", "Url": "https://leetcode.cn/problems/sort-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 149, "Title": "Max Points on a Line", "TitleCn": "\u76f4\u7ebf\u4e0a\u6700\u591a\u7684\u70b9\u6570", "Url": "https://leetcode.cn/problems/max-points-on-a-line/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 150, "Title": "Evaluate Reverse Polish Notation", "TitleCn": "\u9006\u6ce2\u5170\u8868\u8fbe\u5f0f\u6c42\u503c", "Url": "https://leetcode.cn/problems/evaluate-reverse-polish-notation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 151, "Title": "Reverse Words in a String", "TitleCn": "\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd", "Url": "https://leetcode.cn/problems/reverse-words-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 152, "Title": "Maximum Product Subarray", "TitleCn": "\u4e58\u79ef\u6700\u5927\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/maximum-product-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 153, "Title": "Find Minimum in Rotated Sorted Array", "TitleCn": "\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 154, "Title": "Find Minimum in Rotated Sorted Array II", "TitleCn": "\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c II", "Url": "https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 6, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 155, "Title": "Min Stack", "TitleCn": "\u6700\u5c0f\u6808", "Url": "https://leetcode.cn/problems/min-stack/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 156, "Title": "Binary Tree Upside Down", "TitleCn": "\u4e0a\u4e0b\u7ffb\u8f6c\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/binary-tree-upside-down/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 157, "Title": "Read N Characters Given Read4", "TitleCn": "\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26", "Url": "https://leetcode.cn/problems/read-n-characters-given-read4/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 158, "Title": "Read N Characters Given read4 II - Call Multiple Times", "TitleCn": "\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26 II - \u591a\u6b21\u8c03\u7528", "Url": "https://leetcode.cn/problems/read-n-characters-given-read4-ii-call-multiple-times/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 159, "Title": "Longest Substring with At Most Two Distinct Characters", "TitleCn": "\u81f3\u591a\u5305\u542b\u4e24\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32", "Url": "https://leetcode.cn/problems/longest-substring-with-at-most-two-distinct-characters/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 160, "Title": "Intersection of Two Linked Lists", "TitleCn": "\u76f8\u4ea4\u94fe\u8868", "Url": "https://leetcode.cn/problems/intersection-of-two-linked-lists/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 161, "Title": "One Edit Distance", "TitleCn": "\u76f8\u9694\u4e3a 1 \u7684\u7f16\u8f91\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/one-edit-distance/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 162, "Title": "Find Peak Element", "TitleCn": "\u5bfb\u627e\u5cf0\u503c", "Url": "https://leetcode.cn/problems/find-peak-element/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 163, "Title": "Missing Ranges", "TitleCn": "\u7f3a\u5931\u7684\u533a\u95f4", "Url": "https://leetcode.cn/problems/missing-ranges/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 164, "Title": "Maximum Gap", "TitleCn": "\u6700\u5927\u95f4\u8ddd", "Url": "https://leetcode.cn/problems/maximum-gap/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 165, "Title": "Compare Version Numbers", "TitleCn": "\u6bd4\u8f83\u7248\u672c\u53f7", "Url": "https://leetcode.cn/problems/compare-version-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 166, "Title": "Fraction to Recurring Decimal", "TitleCn": "\u5206\u6570\u5230\u5c0f\u6570", "Url": "https://leetcode.cn/problems/fraction-to-recurring-decimal/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 167, "Title": "Two Sum II - Input Array Is Sorted", "TitleCn": "\u4e24\u6570\u4e4b\u548c II - \u8f93\u5165\u6709\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 168, "Title": "Excel Sheet Column Title", "TitleCn": "Excel\u8868\u5217\u540d\u79f0", "Url": "https://leetcode.cn/problems/excel-sheet-column-title/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 169, "Title": "Majority Element", "TitleCn": "\u591a\u6570\u5143\u7d20", "Url": "https://leetcode.cn/problems/majority-element/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 170, "Title": "Two Sum III - Data structure design", "TitleCn": "\u4e24\u6570\u4e4b\u548c III - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1", "Url": "https://leetcode.cn/problems/two-sum-iii-data-structure-design/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 171, "Title": "Excel Sheet Column Number", "TitleCn": "Excel\u8868\u5217\u5e8f\u53f7", "Url": "https://leetcode.cn/problems/excel-sheet-column-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 172, "Title": "Factorial Trailing Zeroes", "TitleCn": "\u9636\u4e58\u540e\u7684\u96f6", "Url": "https://leetcode.cn/problems/factorial-trailing-zeroes/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 173, "Title": "Binary Search Tree Iterator", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668", "Url": "https://leetcode.cn/problems/binary-search-tree-iterator/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 174, "Title": "Dungeon Game", "TitleCn": "\u5730\u4e0b\u57ce\u6e38\u620f", "Url": "https://leetcode.cn/problems/dungeon-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 175, "Title": "Combine Two Tables", "TitleCn": "\u7ec4\u5408\u4e24\u4e2a\u8868", "Url": "https://leetcode.cn/problems/combine-two-tables/", "Ispaid": 0, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 176, "Title": "Second Highest Salary", "TitleCn": "\u7b2c\u4e8c\u9ad8\u7684\u85aa\u6c34", "Url": "https://leetcode.cn/problems/second-highest-salary/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 177, "Title": "Nth Highest Salary", "TitleCn": "\u7b2cN\u9ad8\u7684\u85aa\u6c34", "Url": "https://leetcode.cn/problems/nth-highest-salary/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 178, "Title": "Rank Scores", "TitleCn": "\u5206\u6570\u6392\u540d", "Url": "https://leetcode.cn/problems/rank-scores/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 179, "Title": "Largest Number", "TitleCn": "\u6700\u5927\u6570", "Url": "https://leetcode.cn/problems/largest-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 180, "Title": "Consecutive Numbers", "TitleCn": "\u8fde\u7eed\u51fa\u73b0\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/consecutive-numbers/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 181, "Title": "Employees Earning More Than Their Managers", "TitleCn": "\u8d85\u8fc7\u7ecf\u7406\u6536\u5165\u7684\u5458\u5de5", "Url": "https://leetcode.cn/problems/employees-earning-more-than-their-managers/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 182, "Title": "Duplicate Emails", "TitleCn": "\u67e5\u627e\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1", "Url": "https://leetcode.cn/problems/duplicate-emails/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 183, "Title": "Customers Who Never Order", "TitleCn": "\u4ece\u4e0d\u8ba2\u8d2d\u7684\u5ba2\u6237", "Url": "https://leetcode.cn/problems/customers-who-never-order/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 184, "Title": "Department Highest Salary", "TitleCn": "\u90e8\u95e8\u5de5\u8d44\u6700\u9ad8\u7684\u5458\u5de5", "Url": "https://leetcode.cn/problems/department-highest-salary/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 185, "Title": "Department Top Three Salaries", "TitleCn": "\u90e8\u95e8\u5de5\u8d44\u524d\u4e09\u9ad8\u7684\u6240\u6709\u5458\u5de5", "Url": "https://leetcode.cn/problems/department-top-three-salaries/", "Ispaid": 0, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 186, "Title": "Reverse Words in a String II", "TitleCn": "\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd II", "Url": "https://leetcode.cn/problems/reverse-words-in-a-string-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 187, "Title": "Repeated DNA Sequences", "TitleCn": "\u91cd\u590d\u7684DNA\u5e8f\u5217", "Url": "https://leetcode.cn/problems/repeated-dna-sequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 188, "Title": "Best Time to Buy and Sell Stock IV", "TitleCn": "\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a IV", "Url": "https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 189, "Title": "Rotate Array", "TitleCn": "\u8f6e\u8f6c\u6570\u7ec4", "Url": "https://leetcode.cn/problems/rotate-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 190, "Title": "Reverse Bits", "TitleCn": "\u98a0\u5012\u4e8c\u8fdb\u5236\u4f4d", "Url": "https://leetcode.cn/problems/reverse-bits/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 191, "Title": "Number of 1 Bits", "TitleCn": "\u4f4d1\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/number-of-1-bits/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 192, "Title": "Word Frequency", "TitleCn": "\u7edf\u8ba1\u8bcd\u9891", "Url": "https://leetcode.cn/problems/word-frequency/", "Ispaid": 0, "Type": "Shell", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 193, "Title": "Valid Phone Numbers", "TitleCn": "\u6709\u6548\u7535\u8bdd\u53f7\u7801", "Url": "https://leetcode.cn/problems/valid-phone-numbers/", "Ispaid": 0, "Type": "Shell", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 194, "Title": "Transpose File", "TitleCn": "\u8f6c\u7f6e\u6587\u4ef6", "Url": "https://leetcode.cn/problems/transpose-file/", "Ispaid": 0, "Type": "Shell", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 195, "Title": "Tenth Line", "TitleCn": "\u7b2c\u5341\u884c", "Url": "https://leetcode.cn/problems/tenth-line/", "Ispaid": 0, "Type": "Shell", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 196, "Title": "Delete Duplicate Emails", "TitleCn": "\u5220\u9664\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1", "Url": "https://leetcode.cn/problems/delete-duplicate-emails/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 197, "Title": "Rising Temperature", "TitleCn": "\u4e0a\u5347\u7684\u6e29\u5ea6", "Url": "https://leetcode.cn/problems/rising-temperature/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 198, "Title": "House Robber", "TitleCn": "\u6253\u5bb6\u52ab\u820d", "Url": "https://leetcode.cn/problems/house-robber/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 199, "Title": "Binary Tree Right Side View", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u53f3\u89c6\u56fe", "Url": "https://leetcode.cn/problems/binary-tree-right-side-view/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 200, "Title": "Number of Islands", "TitleCn": "\u5c9b\u5c7f\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-islands/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 201, "Title": "Bitwise AND of Numbers Range", "TitleCn": "\u6570\u5b57\u8303\u56f4\u6309\u4f4d\u4e0e", "Url": "https://leetcode.cn/problems/bitwise-and-of-numbers-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 202, "Title": "Happy Number", "TitleCn": "\u5feb\u4e50\u6570", "Url": "https://leetcode.cn/problems/happy-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 203, "Title": "Remove Linked List Elements", "TitleCn": "\u79fb\u9664\u94fe\u8868\u5143\u7d20", "Url": "https://leetcode.cn/problems/remove-linked-list-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 204, "Title": "Count Primes", "TitleCn": "\u8ba1\u6570\u8d28\u6570", "Url": "https://leetcode.cn/problems/count-primes/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 205, "Title": "Isomorphic Strings", "TitleCn": "\u540c\u6784\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/isomorphic-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 206, "Title": "Reverse Linked List", "TitleCn": "\u53cd\u8f6c\u94fe\u8868", "Url": "https://leetcode.cn/problems/reverse-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 207, "Title": "Course Schedule", "TitleCn": "\u8bfe\u7a0b\u8868", "Url": "https://leetcode.cn/problems/course-schedule/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 208, "Title": "Implement Trie (Prefix Tree)", "TitleCn": "\u5b9e\u73b0 Trie (\u524d\u7f00\u6811)", "Url": "https://leetcode.cn/problems/implement-trie-prefix-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 209, "Title": "Minimum Size Subarray Sum", "TitleCn": "\u957f\u5ea6\u6700\u5c0f\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/minimum-size-subarray-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 210, "Title": "Course Schedule II", "TitleCn": "\u8bfe\u7a0b\u8868 II", "Url": "https://leetcode.cn/problems/course-schedule-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 211, "Title": "Design Add and Search Words Data Structure", "TitleCn": "\u6dfb\u52a0\u4e0e\u641c\u7d22\u5355\u8bcd - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1", "Url": "https://leetcode.cn/problems/design-add-and-search-words-data-structure/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 212, "Title": "Word Search II", "TitleCn": "\u5355\u8bcd\u641c\u7d22 II", "Url": "https://leetcode.cn/problems/word-search-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 213, "Title": "House Robber II", "TitleCn": "\u6253\u5bb6\u52ab\u820d II", "Url": "https://leetcode.cn/problems/house-robber-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 214, "Title": "Shortest Palindrome", "TitleCn": "\u6700\u77ed\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/shortest-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 215, "Title": "Kth Largest Element in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684\u7b2cK\u4e2a\u6700\u5927\u5143\u7d20", "Url": "https://leetcode.cn/problems/kth-largest-element-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 216, "Title": "Combination Sum III", "TitleCn": "\u7ec4\u5408\u603b\u548c III", "Url": "https://leetcode.cn/problems/combination-sum-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 217, "Title": "Contains Duplicate", "TitleCn": "\u5b58\u5728\u91cd\u590d\u5143\u7d20", "Url": "https://leetcode.cn/problems/contains-duplicate/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 218, "Title": "The Skyline Problem", "TitleCn": "\u5929\u9645\u7ebf\u95ee\u9898", "Url": "https://leetcode.cn/problems/the-skyline-problem/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 219, "Title": "Contains Duplicate II", "TitleCn": "\u5b58\u5728\u91cd\u590d\u5143\u7d20 II", "Url": "https://leetcode.cn/problems/contains-duplicate-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 220, "Title": "Contains Duplicate III", "TitleCn": "\u5b58\u5728\u91cd\u590d\u5143\u7d20 III", "Url": "https://leetcode.cn/problems/contains-duplicate-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 221, "Title": "Maximal Square", "TitleCn": "\u6700\u5927\u6b63\u65b9\u5f62", "Url": "https://leetcode.cn/problems/maximal-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 222, "Title": "Count Complete Tree Nodes", "TitleCn": "\u5b8c\u5168\u4e8c\u53c9\u6811\u7684\u8282\u70b9\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-complete-tree-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 223, "Title": "Rectangle Area", "TitleCn": "\u77e9\u5f62\u9762\u79ef", "Url": "https://leetcode.cn/problems/rectangle-area/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 224, "Title": "Basic Calculator", "TitleCn": "\u57fa\u672c\u8ba1\u7b97\u5668", "Url": "https://leetcode.cn/problems/basic-calculator/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 225, "Title": "Implement Stack using Queues", "TitleCn": "\u7528\u961f\u5217\u5b9e\u73b0\u6808", "Url": "https://leetcode.cn/problems/implement-stack-using-queues/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 226, "Title": "Invert Binary Tree", "TitleCn": "\u7ffb\u8f6c\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/invert-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 227, "Title": "Basic Calculator II", "TitleCn": "\u57fa\u672c\u8ba1\u7b97\u5668 II", "Url": "https://leetcode.cn/problems/basic-calculator-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 228, "Title": "Summary Ranges", "TitleCn": "\u6c47\u603b\u533a\u95f4", "Url": "https://leetcode.cn/problems/summary-ranges/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 229, "Title": "Majority Element II", "TitleCn": "\u591a\u6570\u5143\u7d20 II", "Url": "https://leetcode.cn/problems/majority-element-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 230, "Title": "Kth Smallest Element in a BST", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7b2cK\u5c0f\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/kth-smallest-element-in-a-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 231, "Title": "Power of Two", "TitleCn": "2\u7684\u5e42", "Url": "https://leetcode.cn/problems/power-of-two/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 232, "Title": "Implement Queue using Stacks", "TitleCn": "\u7528\u6808\u5b9e\u73b0\u961f\u5217", "Url": "https://leetcode.cn/problems/implement-queue-using-stacks/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 233, "Title": "Number of Digit One", "TitleCn": "\u6570\u5b57 1 \u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/number-of-digit-one/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 234, "Title": "Palindrome Linked List", "TitleCn": "\u56de\u6587\u94fe\u8868", "Url": "https://leetcode.cn/problems/palindrome-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 235, "Title": "Lowest Common Ancestor of a Binary Search Tree", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148", "Url": "https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 236, "Title": "Lowest Common Ancestor of a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148", "Url": "https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 237, "Title": "Delete Node in a Linked List", "TitleCn": "\u5220\u9664\u94fe\u8868\u4e2d\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/delete-node-in-a-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 238, "Title": "Product of Array Except Self", "TitleCn": "\u9664\u81ea\u8eab\u4ee5\u5916\u6570\u7ec4\u7684\u4e58\u79ef", "Url": "https://leetcode.cn/problems/product-of-array-except-self/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 239, "Title": "Sliding Window Maximum", "TitleCn": "\u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/sliding-window-maximum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 240, "Title": "Search a 2D Matrix II", "TitleCn": "\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635 II", "Url": "https://leetcode.cn/problems/search-a-2d-matrix-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 241, "Title": "Different Ways to Add Parentheses", "TitleCn": "\u4e3a\u8fd0\u7b97\u8868\u8fbe\u5f0f\u8bbe\u8ba1\u4f18\u5148\u7ea7", "Url": "https://leetcode.cn/problems/different-ways-to-add-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 242, "Title": "Valid Anagram", "TitleCn": "\u6709\u6548\u7684\u5b57\u6bcd\u5f02\u4f4d\u8bcd", "Url": "https://leetcode.cn/problems/valid-anagram/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 243, "Title": "Shortest Word Distance", "TitleCn": "\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/shortest-word-distance/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 244, "Title": "Shortest Word Distance II", "TitleCn": "\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb II", "Url": "https://leetcode.cn/problems/shortest-word-distance-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 245, "Title": "Shortest Word Distance III", "TitleCn": "\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb III", "Url": "https://leetcode.cn/problems/shortest-word-distance-iii/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 246, "Title": "Strobogrammatic Number", "TitleCn": "\u4e2d\u5fc3\u5bf9\u79f0\u6570", "Url": "https://leetcode.cn/problems/strobogrammatic-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 247, "Title": "Strobogrammatic Number II", "TitleCn": "\u4e2d\u5fc3\u5bf9\u79f0\u6570 II", "Url": "https://leetcode.cn/problems/strobogrammatic-number-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 248, "Title": "Strobogrammatic Number III", "TitleCn": "\u4e2d\u5fc3\u5bf9\u79f0\u6570 III", "Url": "https://leetcode.cn/problems/strobogrammatic-number-iii/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 249, "Title": "Group Shifted Strings", "TitleCn": "\u79fb\u4f4d\u5b57\u7b26\u4e32\u5206\u7ec4", "Url": "https://leetcode.cn/problems/group-shifted-strings/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 250, "Title": "Count Univalue Subtrees", "TitleCn": "\u7edf\u8ba1\u540c\u503c\u5b50\u6811", "Url": "https://leetcode.cn/problems/count-univalue-subtrees/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 251, "Title": "Flatten 2D Vector", "TitleCn": "\u5c55\u5f00\u4e8c\u7ef4\u5411\u91cf", "Url": "https://leetcode.cn/problems/flatten-2d-vector/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 252, "Title": "Meeting Rooms", "TitleCn": "\u4f1a\u8bae\u5ba4", "Url": "https://leetcode.cn/problems/meeting-rooms/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 253, "Title": "Meeting Rooms II", "TitleCn": "\u4f1a\u8bae\u5ba4 II", "Url": "https://leetcode.cn/problems/meeting-rooms-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 254, "Title": "Factor Combinations", "TitleCn": "\u56e0\u5b50\u7684\u7ec4\u5408", "Url": "https://leetcode.cn/problems/factor-combinations/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 255, "Title": "Verify Preorder Sequence in Binary Search Tree", "TitleCn": "\u9a8c\u8bc1\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u524d\u5e8f\u904d\u5386\u5e8f\u5217", "Url": "https://leetcode.cn/problems/verify-preorder-sequence-in-binary-search-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 256, "Title": "Paint House", "TitleCn": "\u7c89\u5237\u623f\u5b50", "Url": "https://leetcode.cn/problems/paint-house/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 257, "Title": "Binary Tree Paths", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u6240\u6709\u8def\u5f84", "Url": "https://leetcode.cn/problems/binary-tree-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 258, "Title": "Add Digits", "TitleCn": "\u5404\u4f4d\u76f8\u52a0", "Url": "https://leetcode.cn/problems/add-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 259, "Title": "3Sum Smaller", "TitleCn": "\u8f83\u5c0f\u7684\u4e09\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/3sum-smaller/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 260, "Title": "Single Number III", "TitleCn": "\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 III", "Url": "https://leetcode.cn/problems/single-number-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 261, "Title": "Graph Valid Tree", "TitleCn": "\u4ee5\u56fe\u5224\u6811", "Url": "https://leetcode.cn/problems/graph-valid-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 262, "Title": "Trips and Users", "TitleCn": "\u884c\u7a0b\u548c\u7528\u6237", "Url": "https://leetcode.cn/problems/trips-and-users/", "Ispaid": 0, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 263, "Title": "Ugly Number", "TitleCn": "\u4e11\u6570", "Url": "https://leetcode.cn/problems/ugly-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 264, "Title": "Ugly Number II", "TitleCn": "\u4e11\u6570 II", "Url": "https://leetcode.cn/problems/ugly-number-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 265, "Title": "Paint House II", "TitleCn": "\u7c89\u5237\u623f\u5b50 II", "Url": "https://leetcode.cn/problems/paint-house-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 6, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 266, "Title": "Palindrome Permutation", "TitleCn": "\u56de\u6587\u6392\u5217", "Url": "https://leetcode.cn/problems/palindrome-permutation/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 267, "Title": "Palindrome Permutation II", "TitleCn": "\u56de\u6587\u6392\u5217 II", "Url": "https://leetcode.cn/problems/palindrome-permutation-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 268, "Title": "Missing Number", "TitleCn": "\u4e22\u5931\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/missing-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 269, "Title": "Alien Dictionary", "TitleCn": "\u706b\u661f\u8bcd\u5178", "Url": "https://leetcode.cn/problems/alien-dictionary/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 270, "Title": "Closest Binary Search Tree Value", "TitleCn": "\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c", "Url": "https://leetcode.cn/problems/closest-binary-search-tree-value/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 271, "Title": "Encode and Decode Strings", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u7f16\u7801\u4e0e\u89e3\u7801", "Url": "https://leetcode.cn/problems/encode-and-decode-strings/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 272, "Title": "Closest Binary Search Tree Value II", "TitleCn": "\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c II", "Url": "https://leetcode.cn/problems/closest-binary-search-tree-value-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 8, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 273, "Title": "Integer to English Words", "TitleCn": "\u6574\u6570\u8f6c\u6362\u82f1\u6587\u8868\u793a", "Url": "https://leetcode.cn/problems/integer-to-english-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 274, "Title": "H-Index", "TitleCn": "H \u6307\u6570", "Url": "https://leetcode.cn/problems/h-index/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 275, "Title": "H-Index II", "TitleCn": "H \u6307\u6570 II", "Url": "https://leetcode.cn/problems/h-index-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 276, "Title": "Paint Fence", "TitleCn": "\u6805\u680f\u6d82\u8272", "Url": "https://leetcode.cn/problems/paint-fence/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 277, "Title": "Find the Celebrity", "TitleCn": "\u641c\u5bfb\u540d\u4eba", "Url": "https://leetcode.cn/problems/find-the-celebrity/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 278, "Title": "First Bad Version", "TitleCn": "\u7b2c\u4e00\u4e2a\u9519\u8bef\u7684\u7248\u672c", "Url": "https://leetcode.cn/problems/first-bad-version/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 279, "Title": "Perfect Squares", "TitleCn": "\u5b8c\u5168\u5e73\u65b9\u6570", "Url": "https://leetcode.cn/problems/perfect-squares/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 280, "Title": "Wiggle Sort", "TitleCn": "\u6446\u52a8\u6392\u5e8f", "Url": "https://leetcode.cn/problems/wiggle-sort/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 281, "Title": "Zigzag Iterator", "TitleCn": "\u952f\u9f7f\u8fed\u4ee3\u5668", "Url": "https://leetcode.cn/problems/zigzag-iterator/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 282, "Title": "Expression Add Operators", "TitleCn": "\u7ed9\u8868\u8fbe\u5f0f\u6dfb\u52a0\u8fd0\u7b97\u7b26", "Url": "https://leetcode.cn/problems/expression-add-operators/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 283, "Title": "Move Zeroes", "TitleCn": "\u79fb\u52a8\u96f6", "Url": "https://leetcode.cn/problems/move-zeroes/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 284, "Title": "Peeking Iterator", "TitleCn": "\u7aa5\u89c6\u8fed\u4ee3\u5668", "Url": "https://leetcode.cn/problems/peeking-iterator/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 285, "Title": "Inorder Successor in BST", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7", "Url": "https://leetcode.cn/problems/inorder-successor-in-bst/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 286, "Title": "Walls and Gates", "TitleCn": "\u5899\u4e0e\u95e8", "Url": "https://leetcode.cn/problems/walls-and-gates/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 287, "Title": "Find the Duplicate Number", "TitleCn": "\u5bfb\u627e\u91cd\u590d\u6570", "Url": "https://leetcode.cn/problems/find-the-duplicate-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 288, "Title": "Unique Word Abbreviation", "TitleCn": "\u5355\u8bcd\u7684\u552f\u4e00\u7f29\u5199", "Url": "https://leetcode.cn/problems/unique-word-abbreviation/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 289, "Title": "Game of Life", "TitleCn": "\u751f\u547d\u6e38\u620f", "Url": "https://leetcode.cn/problems/game-of-life/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 290, "Title": "Word Pattern", "TitleCn": "\u5355\u8bcd\u89c4\u5f8b", "Url": "https://leetcode.cn/problems/word-pattern/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 291, "Title": "Word Pattern II", "TitleCn": "\u5355\u8bcd\u89c4\u5f8b II", "Url": "https://leetcode.cn/problems/word-pattern-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 292, "Title": "Nim Game", "TitleCn": "Nim \u6e38\u620f", "Url": "https://leetcode.cn/problems/nim-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 293, "Title": "Flip Game", "TitleCn": "\u7ffb\u8f6c\u6e38\u620f", "Url": "https://leetcode.cn/problems/flip-game/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 294, "Title": "Flip Game II", "TitleCn": "\u7ffb\u8f6c\u6e38\u620f II", "Url": "https://leetcode.cn/problems/flip-game-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 295, "Title": "Find Median from Data Stream", "TitleCn": "\u6570\u636e\u6d41\u7684\u4e2d\u4f4d\u6570", "Url": "https://leetcode.cn/problems/find-median-from-data-stream/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 8, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 296, "Title": "Best Meeting Point", "TitleCn": "\u6700\u4f73\u7684\u78b0\u5934\u5730\u70b9", "Url": "https://leetcode.cn/problems/best-meeting-point/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 297, "Title": "Serialize and Deserialize Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5e8f\u5217\u5316\u4e0e\u53cd\u5e8f\u5217\u5316", "Url": "https://leetcode.cn/problems/serialize-and-deserialize-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 298, "Title": "Binary Tree Longest Consecutive Sequence", "TitleCn": "\u4e8c\u53c9\u6811\u6700\u957f\u8fde\u7eed\u5e8f\u5217", "Url": "https://leetcode.cn/problems/binary-tree-longest-consecutive-sequence/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 299, "Title": "Bulls and Cows", "TitleCn": "\u731c\u6570\u5b57\u6e38\u620f", "Url": "https://leetcode.cn/problems/bulls-and-cows/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 300, "Title": "Longest Increasing Subsequence", "TitleCn": "\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-increasing-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 301, "Title": "Remove Invalid Parentheses", "TitleCn": "\u5220\u9664\u65e0\u6548\u7684\u62ec\u53f7", "Url": "https://leetcode.cn/problems/remove-invalid-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 302, "Title": "Smallest Rectangle Enclosing Black Pixels", "TitleCn": "\u5305\u542b\u5168\u90e8\u9ed1\u8272\u50cf\u7d20\u7684\u6700\u5c0f\u77e9\u5f62", "Url": "https://leetcode.cn/problems/smallest-rectangle-enclosing-black-pixels/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 303, "Title": "Range Sum Query - Immutable", "TitleCn": "\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u4e0d\u53ef\u53d8", "Url": "https://leetcode.cn/problems/range-sum-query-immutable/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 304, "Title": "Range Sum Query 2D - Immutable", "TitleCn": "\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u77e9\u9635\u4e0d\u53ef\u53d8", "Url": "https://leetcode.cn/problems/range-sum-query-2d-immutable/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 305, "Title": "Number of Islands II", "TitleCn": "\u5c9b\u5c7f\u6570\u91cf II", "Url": "https://leetcode.cn/problems/number-of-islands-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 306, "Title": "Additive Number", "TitleCn": "\u7d2f\u52a0\u6570", "Url": "https://leetcode.cn/problems/additive-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 307, "Title": "Range Sum Query - Mutable", "TitleCn": "\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u53ef\u4fee\u6539", "Url": "https://leetcode.cn/problems/range-sum-query-mutable/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 308, "Title": "Range Sum Query 2D - Mutable", "TitleCn": "\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u77e9\u9635\u53ef\u4fee\u6539", "Url": "https://leetcode.cn/problems/range-sum-query-2d-mutable/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 309, "Title": "Best Time to Buy and Sell Stock with Cooldown", "TitleCn": "\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a\u542b\u51b7\u51bb\u671f", "Url": "https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 310, "Title": "Minimum Height Trees", "TitleCn": "\u6700\u5c0f\u9ad8\u5ea6\u6811", "Url": "https://leetcode.cn/problems/minimum-height-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 311, "Title": "Sparse Matrix Multiplication", "TitleCn": "\u7a00\u758f\u77e9\u9635\u7684\u4e58\u6cd5", "Url": "https://leetcode.cn/problems/sparse-matrix-multiplication/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 312, "Title": "Burst Balloons", "TitleCn": "\u6233\u6c14\u7403", "Url": "https://leetcode.cn/problems/burst-balloons/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 313, "Title": "Super Ugly Number", "TitleCn": "\u8d85\u7ea7\u4e11\u6570", "Url": "https://leetcode.cn/problems/super-ugly-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 314, "Title": "Binary Tree Vertical Order Traversal", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5782\u76f4\u904d\u5386", "Url": "https://leetcode.cn/problems/binary-tree-vertical-order-traversal/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 315, "Title": "Count of Smaller Numbers After Self", "TitleCn": "\u8ba1\u7b97\u53f3\u4fa7\u5c0f\u4e8e\u5f53\u524d\u5143\u7d20\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-of-smaller-numbers-after-self/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 316, "Title": "Remove Duplicate Letters", "TitleCn": "\u53bb\u9664\u91cd\u590d\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/remove-duplicate-letters/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 317, "Title": "Shortest Distance from All Buildings", "TitleCn": "\u79bb\u5efa\u7b51\u7269\u6700\u8fd1\u7684\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/shortest-distance-from-all-buildings/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 318, "Title": "Maximum Product of Word Lengths", "TitleCn": "\u6700\u5927\u5355\u8bcd\u957f\u5ea6\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-product-of-word-lengths/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 319, "Title": "Bulb Switcher", "TitleCn": "\u706f\u6ce1\u5f00\u5173", "Url": "https://leetcode.cn/problems/bulb-switcher/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 320, "Title": "Generalized Abbreviation", "TitleCn": "\u5217\u4e3e\u5355\u8bcd\u7684\u5168\u90e8\u7f29\u5199", "Url": "https://leetcode.cn/problems/generalized-abbreviation/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 321, "Title": "Create Maximum Number", "TitleCn": "\u62fc\u63a5\u6700\u5927\u6570", "Url": "https://leetcode.cn/problems/create-maximum-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 322, "Title": "Coin Change", "TitleCn": "\u96f6\u94b1\u5151\u6362", "Url": "https://leetcode.cn/problems/coin-change/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 323, "Title": "Number of Connected Components in an Undirected Graph", "TitleCn": "\u65e0\u5411\u56fe\u4e2d\u8fde\u901a\u5206\u91cf\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 324, "Title": "Wiggle Sort II", "TitleCn": "\u6446\u52a8\u6392\u5e8f II", "Url": "https://leetcode.cn/problems/wiggle-sort-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 325, "Title": "Maximum Size Subarray Sum Equals k", "TitleCn": "\u548c\u7b49\u4e8e k \u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6", "Url": "https://leetcode.cn/problems/maximum-size-subarray-sum-equals-k/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 326, "Title": "Power of Three", "TitleCn": "3\u7684\u5e42", "Url": "https://leetcode.cn/problems/power-of-three/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 327, "Title": "Count of Range Sum", "TitleCn": "\u533a\u95f4\u548c\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-of-range-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 328, "Title": "Odd Even Linked List", "TitleCn": "\u5947\u5076\u94fe\u8868", "Url": "https://leetcode.cn/problems/odd-even-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 329, "Title": "Longest Increasing Path in a Matrix", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u6700\u957f\u9012\u589e\u8def\u5f84", "Url": "https://leetcode.cn/problems/longest-increasing-path-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 330, "Title": "Patching Array", "TitleCn": "\u6309\u8981\u6c42\u8865\u9f50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/patching-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 331, "Title": "Verify Preorder Serialization of a Binary Tree", "TitleCn": "\u9a8c\u8bc1\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u5e8f\u5217\u5316", "Url": "https://leetcode.cn/problems/verify-preorder-serialization-of-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 332, "Title": "Reconstruct Itinerary", "TitleCn": "\u91cd\u65b0\u5b89\u6392\u884c\u7a0b", "Url": "https://leetcode.cn/problems/reconstruct-itinerary/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 333, "Title": "Largest BST Subtree", "TitleCn": "\u6700\u5927\u4e8c\u53c9\u641c\u7d22\u5b50\u6811", "Url": "https://leetcode.cn/problems/largest-bst-subtree/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 334, "Title": "Increasing Triplet Subsequence", "TitleCn": "\u9012\u589e\u7684\u4e09\u5143\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/increasing-triplet-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 335, "Title": "Self Crossing", "TitleCn": "\u8def\u5f84\u4ea4\u53c9", "Url": "https://leetcode.cn/problems/self-crossing/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 336, "Title": "Palindrome Pairs", "TitleCn": "\u56de\u6587\u5bf9", "Url": "https://leetcode.cn/problems/palindrome-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 337, "Title": "House Robber III", "TitleCn": "\u6253\u5bb6\u52ab\u820d III", "Url": "https://leetcode.cn/problems/house-robber-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 338, "Title": "Counting Bits", "TitleCn": "\u6bd4\u7279\u4f4d\u8ba1\u6570", "Url": "https://leetcode.cn/problems/counting-bits/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 339, "Title": "Nested List Weight Sum", "TitleCn": "\u5d4c\u5957\u5217\u8868\u52a0\u6743\u548c", "Url": "https://leetcode.cn/problems/nested-list-weight-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 340, "Title": "Longest Substring with At Most K Distinct Characters", "TitleCn": "\u81f3\u591a\u5305\u542b K \u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32", "Url": "https://leetcode.cn/problems/longest-substring-with-at-most-k-distinct-characters/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 341, "Title": "Flatten Nested List Iterator", "TitleCn": "\u6241\u5e73\u5316\u5d4c\u5957\u5217\u8868\u8fed\u4ee3\u5668", "Url": "https://leetcode.cn/problems/flatten-nested-list-iterator/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 342, "Title": "Power of Four", "TitleCn": "4\u7684\u5e42", "Url": "https://leetcode.cn/problems/power-of-four/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 343, "Title": "Integer Break", "TitleCn": "\u6574\u6570\u62c6\u5206", "Url": "https://leetcode.cn/problems/integer-break/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 344, "Title": "Reverse String", "TitleCn": "\u53cd\u8f6c\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/reverse-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 345, "Title": "Reverse Vowels of a String", "TitleCn": "\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/reverse-vowels-of-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 346, "Title": "Moving Average from Data Stream", "TitleCn": "\u6570\u636e\u6d41\u4e2d\u7684\u79fb\u52a8\u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/moving-average-from-data-stream/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 347, "Title": "Top K Frequent Elements", "TitleCn": "\u524d K \u4e2a\u9ad8\u9891\u5143\u7d20", "Url": "https://leetcode.cn/problems/top-k-frequent-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 348, "Title": "Design Tic-Tac-Toe", "TitleCn": "\u8bbe\u8ba1\u4e95\u5b57\u68cb", "Url": "https://leetcode.cn/problems/design-tic-tac-toe/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 349, "Title": "Intersection of Two Arrays", "TitleCn": "\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6", "Url": "https://leetcode.cn/problems/intersection-of-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 350, "Title": "Intersection of Two Arrays II", "TitleCn": "\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6 II", "Url": "https://leetcode.cn/problems/intersection-of-two-arrays-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 351, "Title": "Android Unlock Patterns", "TitleCn": "\u5b89\u5353\u7cfb\u7edf\u624b\u52bf\u89e3\u9501", "Url": "https://leetcode.cn/problems/android-unlock-patterns/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 352, "Title": "Data Stream as Disjoint Intervals", "TitleCn": "\u5c06\u6570\u636e\u6d41\u53d8\u4e3a\u591a\u4e2a\u4e0d\u76f8\u4ea4\u533a\u95f4", "Url": "https://leetcode.cn/problems/data-stream-as-disjoint-intervals/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 8, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 353, "Title": "Design Snake Game", "TitleCn": "\u8d2a\u5403\u86c7", "Url": "https://leetcode.cn/problems/design-snake-game/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 354, "Title": "Russian Doll Envelopes", "TitleCn": "\u4fc4\u7f57\u65af\u5957\u5a03\u4fe1\u5c01\u95ee\u9898", "Url": "https://leetcode.cn/problems/russian-doll-envelopes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 355, "Title": "Design Twitter", "TitleCn": "\u8bbe\u8ba1\u63a8\u7279", "Url": "https://leetcode.cn/problems/design-twitter/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 356, "Title": "Line Reflection", "TitleCn": "\u76f4\u7ebf\u955c\u50cf", "Url": "https://leetcode.cn/problems/line-reflection/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 357, "Title": "Count Numbers with Unique Digits", "TitleCn": "\u7edf\u8ba1\u5404\u4f4d\u6570\u5b57\u90fd\u4e0d\u540c\u7684\u6570\u5b57\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-numbers-with-unique-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 358, "Title": "Rearrange String k Distance Apart", "TitleCn": "K \u8ddd\u79bb\u95f4\u9694\u91cd\u6392\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/rearrange-string-k-distance-apart/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 359, "Title": "Logger Rate Limiter", "TitleCn": "\u65e5\u5fd7\u901f\u7387\u9650\u5236\u5668", "Url": "https://leetcode.cn/problems/logger-rate-limiter/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 360, "Title": "Sort Transformed Array", "TitleCn": "\u6709\u5e8f\u8f6c\u5316\u6570\u7ec4", "Url": "https://leetcode.cn/problems/sort-transformed-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 361, "Title": "Bomb Enemy", "TitleCn": "\u8f70\u70b8\u654c\u4eba", "Url": "https://leetcode.cn/problems/bomb-enemy/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 362, "Title": "Design Hit Counter", "TitleCn": "\u6572\u51fb\u8ba1\u6570\u5668", "Url": "https://leetcode.cn/problems/design-hit-counter/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 363, "Title": "Max Sum of Rectangle No Larger Than K", "TitleCn": "\u77e9\u5f62\u533a\u57df\u4e0d\u8d85\u8fc7 K \u7684\u6700\u5927\u6570\u503c\u548c", "Url": "https://leetcode.cn/problems/max-sum-of-rectangle-no-larger-than-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 8, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 364, "Title": "Nested List Weight Sum II", "TitleCn": "\u5d4c\u5957\u5217\u8868\u52a0\u6743\u548c II", "Url": "https://leetcode.cn/problems/nested-list-weight-sum-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 365, "Title": "Water and Jug Problem", "TitleCn": "\u6c34\u58f6\u95ee\u9898", "Url": "https://leetcode.cn/problems/water-and-jug-problem/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 366, "Title": "Find Leaves of Binary Tree", "TitleCn": "\u5bfb\u627e\u4e8c\u53c9\u6811\u7684\u53f6\u5b50\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-leaves-of-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 367, "Title": "Valid Perfect Square", "TitleCn": "\u6709\u6548\u7684\u5b8c\u5168\u5e73\u65b9\u6570", "Url": "https://leetcode.cn/problems/valid-perfect-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 368, "Title": "Largest Divisible Subset", "TitleCn": "\u6700\u5927\u6574\u9664\u5b50\u96c6", "Url": "https://leetcode.cn/problems/largest-divisible-subset/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 369, "Title": "Plus One Linked List", "TitleCn": "\u7ed9\u5355\u94fe\u8868\u52a0\u4e00", "Url": "https://leetcode.cn/problems/plus-one-linked-list/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 370, "Title": "Range Addition", "TitleCn": "\u533a\u95f4\u52a0\u6cd5", "Url": "https://leetcode.cn/problems/range-addition/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 371, "Title": "Sum of Two Integers", "TitleCn": "\u4e24\u6574\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-two-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 372, "Title": "Super Pow", "TitleCn": "\u8d85\u7ea7\u6b21\u65b9", "Url": "https://leetcode.cn/problems/super-pow/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 373, "Title": "Find K Pairs with Smallest Sums", "TitleCn": "\u67e5\u627e\u548c\u6700\u5c0f\u7684K\u5bf9\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-k-pairs-with-smallest-sums/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 374, "Title": "Guess Number Higher or Lower", "TitleCn": "\u731c\u6570\u5b57\u5927\u5c0f", "Url": "https://leetcode.cn/problems/guess-number-higher-or-lower/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 375, "Title": "Guess Number Higher or Lower II", "TitleCn": "\u731c\u6570\u5b57\u5927\u5c0f II", "Url": "https://leetcode.cn/problems/guess-number-higher-or-lower-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 376, "Title": "Wiggle Subsequence", "TitleCn": "\u6446\u52a8\u5e8f\u5217", "Url": "https://leetcode.cn/problems/wiggle-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 377, "Title": "Combination Sum IV", "TitleCn": "\u7ec4\u5408\u603b\u548c \u2163", "Url": "https://leetcode.cn/problems/combination-sum-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 378, "Title": "Kth Smallest Element in a Sorted Matrix", "TitleCn": "\u6709\u5e8f\u77e9\u9635\u4e2d\u7b2cK\u5c0f\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/kth-smallest-element-in-a-sorted-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 11, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 379, "Title": "Design Phone Directory", "TitleCn": "\u7535\u8bdd\u76ee\u5f55\u7ba1\u7406\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-phone-directory/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 380, "Title": "Insert Delete GetRandom O(1)", "TitleCn": "\u5e38\u6570\u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20", "Url": "https://leetcode.cn/problems/insert-delete-getrandom-o1/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 381, "Title": "Insert Delete GetRandom O(1) - Duplicates allowed", "TitleCn": "O(1) \u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20 - \u5141\u8bb8\u91cd\u590d", "Url": "https://leetcode.cn/problems/insert-delete-getrandom-o1-duplicates-allowed/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 382, "Title": "Linked List Random Node", "TitleCn": "\u94fe\u8868\u968f\u673a\u8282\u70b9", "Url": "https://leetcode.cn/problems/linked-list-random-node/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 383, "Title": "Ransom Note", "TitleCn": "\u8d4e\u91d1\u4fe1", "Url": "https://leetcode.cn/problems/ransom-note/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 384, "Title": "Shuffle an Array", "TitleCn": "\u6253\u4e71\u6570\u7ec4", "Url": "https://leetcode.cn/problems/shuffle-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 385, "Title": "Mini Parser", "TitleCn": "\u8ff7\u4f60\u8bed\u6cd5\u5206\u6790\u5668", "Url": "https://leetcode.cn/problems/mini-parser/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 386, "Title": "Lexicographical Numbers", "TitleCn": "\u5b57\u5178\u5e8f\u6392\u6570", "Url": "https://leetcode.cn/problems/lexicographical-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Warm Up Contest 1 Problem 1"}, {"ID": 387, "Title": "First Unique Character in a String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c\u4e00\u4e2a\u552f\u4e00\u5b57\u7b26", "Url": "https://leetcode.cn/problems/first-unique-character-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Warm Up Contest 1 Problem 2"}, {"ID": 388, "Title": "Longest Absolute File Path", "TitleCn": "\u6587\u4ef6\u7684\u6700\u957f\u7edd\u5bf9\u8def\u5f84", "Url": "https://leetcode.cn/problems/longest-absolute-file-path/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Warm Up Contest 1 Problem 3"}, {"ID": 389, "Title": "Find the Difference", "TitleCn": "\u627e\u4e0d\u540c", "Url": "https://leetcode.cn/problems/find-the-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 2 Problem 1"}, {"ID": 390, "Title": "Elimination Game", "TitleCn": "\u6d88\u9664\u6e38\u620f", "Url": "https://leetcode.cn/problems/elimination-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 2 Problem 2"}, {"ID": 391, "Title": "Perfect Rectangle", "TitleCn": "\u5b8c\u7f8e\u77e9\u5f62", "Url": "https://leetcode.cn/problems/perfect-rectangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 2 Problem 3"}, {"ID": 392, "Title": "Is Subsequence", "TitleCn": "\u5224\u65ad\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/is-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 3 Problem 1"}, {"ID": 393, "Title": "UTF-8 Validation", "TitleCn": "UTF-8 \u7f16\u7801\u9a8c\u8bc1", "Url": "https://leetcode.cn/problems/utf-8-validation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 3 Problem 2"}, {"ID": 394, "Title": "Decode String", "TitleCn": "\u5b57\u7b26\u4e32\u89e3\u7801", "Url": "https://leetcode.cn/problems/decode-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 3 Problem 3"}, {"ID": 395, "Title": "Longest Substring with At Least K Repeating Characters", "TitleCn": "\u81f3\u5c11\u6709K\u4e2a\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32", "Url": "https://leetcode.cn/problems/longest-substring-with-at-least-k-repeating-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 3 Problem 4"}, {"ID": 396, "Title": "Rotate Function", "TitleCn": "\u65cb\u8f6c\u51fd\u6570", "Url": "https://leetcode.cn/problems/rotate-function/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 4 Problem 1"}, {"ID": 397, "Title": "Integer Replacement", "TitleCn": "\u6574\u6570\u66ff\u6362", "Url": "https://leetcode.cn/problems/integer-replacement/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 4 Problem 2"}, {"ID": 398, "Title": "Random Pick Index", "TitleCn": "\u968f\u673a\u6570\u7d22\u5f15", "Url": "https://leetcode.cn/problems/random-pick-index/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 4 Problem 3"}, {"ID": 399, "Title": "Evaluate Division", "TitleCn": "\u9664\u6cd5\u6c42\u503c", "Url": "https://leetcode.cn/problems/evaluate-division/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 4 Problem 4"}, {"ID": 400, "Title": "Nth Digit", "TitleCn": "\u7b2c N \u4f4d\u6570\u5b57", "Url": "https://leetcode.cn/problems/nth-digit/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 5 Problem 1"}, {"ID": 401, "Title": "Binary Watch", "TitleCn": "\u4e8c\u8fdb\u5236\u624b\u8868", "Url": "https://leetcode.cn/problems/binary-watch/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 5 Problem 2"}, {"ID": 402, "Title": "Remove K Digits", "TitleCn": "\u79fb\u6389K\u4f4d\u6570\u5b57", "Url": "https://leetcode.cn/problems/remove-k-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 5 Problem 3"}, {"ID": 403, "Title": "Frog Jump", "TitleCn": "\u9752\u86d9\u8fc7\u6cb3", "Url": "https://leetcode.cn/problems/frog-jump/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 5 Problem 4"}, {"ID": 404, "Title": "Sum of Left Leaves", "TitleCn": "\u5de6\u53f6\u5b50\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-left-leaves/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 6 Problem 1"}, {"ID": 405, "Title": "Convert a Number to Hexadecimal", "TitleCn": "\u6570\u5b57\u8f6c\u6362\u4e3a\u5341\u516d\u8fdb\u5236\u6570", "Url": "https://leetcode.cn/problems/convert-a-number-to-hexadecimal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 6 Problem 2"}, {"ID": 406, "Title": "Queue Reconstruction by Height", "TitleCn": "\u6839\u636e\u8eab\u9ad8\u91cd\u5efa\u961f\u5217", "Url": "https://leetcode.cn/problems/queue-reconstruction-by-height/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 6 Problem 3"}, {"ID": 407, "Title": "Trapping Rain Water II", "TitleCn": "\u63a5\u96e8\u6c34 II", "Url": "https://leetcode.cn/problems/trapping-rain-water-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 6 Problem 4"}, {"ID": 408, "Title": "Valid Word Abbreviation", "TitleCn": "\u6709\u6548\u5355\u8bcd\u7f29\u5199", "Url": "https://leetcode.cn/problems/valid-word-abbreviation/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 7 Problem 1"}, {"ID": 409, "Title": "Longest Palindrome", "TitleCn": "\u6700\u957f\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/longest-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 7 Problem 2"}, {"ID": 410, "Title": "Split Array Largest Sum", "TitleCn": "\u5206\u5272\u6570\u7ec4\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/split-array-largest-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 7 Problem 3"}, {"ID": 411, "Title": "Minimum Unique Word Abbreviation", "TitleCn": "\u6700\u77ed\u72ec\u5360\u5355\u8bcd\u7f29\u5199", "Url": "https://leetcode.cn/problems/minimum-unique-word-abbreviation/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 7 Problem 4"}, {"ID": 412, "Title": "Fizz Buzz", "TitleCn": "Fizz Buzz", "Url": "https://leetcode.cn/problems/fizz-buzz/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 413, "Title": "Arithmetic Slices", "TitleCn": "\u7b49\u5dee\u6570\u5217\u5212\u5206", "Url": "https://leetcode.cn/problems/arithmetic-slices/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 414, "Title": "Third Maximum Number", "TitleCn": "\u7b2c\u4e09\u5927\u7684\u6570", "Url": "https://leetcode.cn/problems/third-maximum-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 415, "Title": "Add Strings", "TitleCn": "\u5b57\u7b26\u4e32\u76f8\u52a0", "Url": "https://leetcode.cn/problems/add-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 8 Problem 1"}, {"ID": 416, "Title": "Partition Equal Subset Sum", "TitleCn": "\u5206\u5272\u7b49\u548c\u5b50\u96c6", "Url": "https://leetcode.cn/problems/partition-equal-subset-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 8 Problem 2"}, {"ID": 417, "Title": "Pacific Atlantic Water Flow", "TitleCn": "\u592a\u5e73\u6d0b\u5927\u897f\u6d0b\u6c34\u6d41\u95ee\u9898", "Url": "https://leetcode.cn/problems/pacific-atlantic-water-flow/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 8 Problem 3"}, {"ID": 418, "Title": "Sentence Screen Fitting", "TitleCn": "\u5c4f\u5e55\u53ef\u663e\u793a\u53e5\u5b50\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/sentence-screen-fitting/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 8 Problem 4"}, {"ID": 419, "Title": "Battleships in a Board", "TitleCn": "\u7532\u677f\u4e0a\u7684\u6218\u8230", "Url": "https://leetcode.cn/problems/battleships-in-a-board/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 420, "Title": "Strong Password Checker", "TitleCn": "\u5f3a\u5bc6\u7801\u68c0\u9a8c\u5668", "Url": "https://leetcode.cn/problems/strong-password-checker/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 421, "Title": "Maximum XOR of Two Numbers in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u4e24\u4e2a\u6570\u7684\u6700\u5927\u5f02\u6216\u503c", "Url": "https://leetcode.cn/problems/maximum-xor-of-two-numbers-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 422, "Title": "Valid Word Square", "TitleCn": "\u6709\u6548\u7684\u5355\u8bcd\u65b9\u5757", "Url": "https://leetcode.cn/problems/valid-word-square/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 9 Problem 1"}, {"ID": 423, "Title": "Reconstruct Original Digits from English", "TitleCn": "\u4ece\u82f1\u6587\u4e2d\u91cd\u5efa\u6570\u5b57", "Url": "https://leetcode.cn/problems/reconstruct-original-digits-from-english/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 9 Problem 2"}, {"ID": 424, "Title": "Longest Repeating Character Replacement", "TitleCn": "\u66ff\u6362\u540e\u7684\u6700\u957f\u91cd\u590d\u5b57\u7b26", "Url": "https://leetcode.cn/problems/longest-repeating-character-replacement/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 9 Problem 3"}, {"ID": 425, "Title": "Word Squares", "TitleCn": "\u5355\u8bcd\u65b9\u5757", "Url": "https://leetcode.cn/problems/word-squares/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 9 Problem 4"}, {"ID": 426, "Title": "Convert Binary Search Tree to Sorted Doubly Linked List", "TitleCn": "\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u5316\u4e3a\u6392\u5e8f\u7684\u53cc\u5411\u94fe\u8868", "Url": "https://leetcode.cn/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 427, "Title": "Construct Quad Tree", "TitleCn": "\u5efa\u7acb\u56db\u53c9\u6811", "Url": "https://leetcode.cn/problems/construct-quad-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 428, "Title": "Serialize and Deserialize N-ary Tree", "TitleCn": "\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316 N \u53c9\u6811", "Url": "https://leetcode.cn/problems/serialize-and-deserialize-n-ary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 429, "Title": "N-ary Tree Level Order Traversal", "TitleCn": "N\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/n-ary-tree-level-order-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 430, "Title": "Flatten a Multilevel Doubly Linked List", "TitleCn": "\u6241\u5e73\u5316\u591a\u7ea7\u53cc\u5411\u94fe\u8868", "Url": "https://leetcode.cn/problems/flatten-a-multilevel-doubly-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 431, "Title": "Encode N-ary Tree to Binary Tree", "TitleCn": "\u5c06 N \u53c9\u6811\u7f16\u7801\u4e3a\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/encode-n-ary-tree-to-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 432, "Title": "All O`one Data Structure", "TitleCn": "\u5168 O(1) \u7684\u6570\u636e\u7ed3\u6784", "Url": "https://leetcode.cn/problems/all-oone-data-structure/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 433, "Title": "Minimum Genetic Mutation", "TitleCn": "\u6700\u5c0f\u57fa\u56e0\u53d8\u5316", "Url": "https://leetcode.cn/problems/minimum-genetic-mutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 434, "Title": "Number of Segments in a String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd\u6570", "Url": "https://leetcode.cn/problems/number-of-segments-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 11 Problem 1"}, {"ID": 435, "Title": "Non-overlapping Intervals", "TitleCn": "\u65e0\u91cd\u53e0\u533a\u95f4", "Url": "https://leetcode.cn/problems/non-overlapping-intervals/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 2 Problem 1"}, {"ID": 436, "Title": "Find Right Interval", "TitleCn": "\u5bfb\u627e\u53f3\u533a\u95f4", "Url": "https://leetcode.cn/problems/find-right-interval/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 2 Problem 2"}, {"ID": 437, "Title": "Path Sum III", "TitleCn": "\u8def\u5f84\u603b\u548c III", "Url": "https://leetcode.cn/problems/path-sum-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest Problem 1"}, {"ID": 438, "Title": "Find All Anagrams in a String", "TitleCn": "\u627e\u5230\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u5b57\u6bcd\u5f02\u4f4d\u8bcd", "Url": "https://leetcode.cn/problems/find-all-anagrams-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest Problem 2"}, {"ID": 439, "Title": "Ternary Expression Parser", "TitleCn": "\u4e09\u5143\u8868\u8fbe\u5f0f\u89e3\u6790\u5668", "Url": "https://leetcode.cn/problems/ternary-expression-parser/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest Problem 3"}, {"ID": 440, "Title": "K-th Smallest in Lexicographical Order", "TitleCn": "\u5b57\u5178\u5e8f\u7684\u7b2cK\u5c0f\u6570\u5b57", "Url": "https://leetcode.cn/problems/k-th-smallest-in-lexicographical-order/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Smarking Algorithm Contest Problem 4"}, {"ID": 441, "Title": "Arranging Coins", "TitleCn": "\u6392\u5217\u786c\u5e01", "Url": "https://leetcode.cn/problems/arranging-coins/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Smarking Algorithm Contest 2 Problem 3"}, {"ID": 442, "Title": "Find All Duplicates in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u91cd\u590d\u7684\u6570\u636e", "Url": "https://leetcode.cn/problems/find-all-duplicates-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 443, "Title": "String Compression", "TitleCn": "\u538b\u7f29\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/string-compression/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 56 Problem 2"}, {"ID": 444, "Title": "Sequence Reconstruction", "TitleCn": "\u5e8f\u5217\u91cd\u5efa", "Url": "https://leetcode.cn/problems/sequence-reconstruction/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 2 Problem 4"}, {"ID": 445, "Title": "Add Two Numbers II", "TitleCn": "\u4e24\u6570\u76f8\u52a0 II", "Url": "https://leetcode.cn/problems/add-two-numbers-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 446, "Title": "Arithmetic Slices II - Subsequence", "TitleCn": "\u7b49\u5dee\u6570\u5217\u5212\u5206 II - \u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/arithmetic-slices-ii-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Smarking Algorithm Contest 3 Problem 4"}, {"ID": 447, "Title": "Number of Boomerangs", "TitleCn": "\u56de\u65cb\u9556\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-boomerangs/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 3 Problem 2"}, {"ID": 448, "Title": "Find All Numbers Disappeared in an Array", "TitleCn": "\u627e\u5230\u6240\u6709\u6570\u7ec4\u4e2d\u6d88\u5931\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-all-numbers-disappeared-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 449, "Title": "Serialize and Deserialize BST", "TitleCn": "\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/serialize-and-deserialize-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 450, "Title": "Delete Node in a BST", "TitleCn": "\u5220\u9664\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/delete-node-in-a-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 451, "Title": "Sort Characters By Frequency", "TitleCn": "\u6839\u636e\u5b57\u7b26\u51fa\u73b0\u9891\u7387\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-characters-by-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 452, "Title": "Minimum Number of Arrows to Burst Balloons", "TitleCn": "\u7528\u6700\u5c11\u6570\u91cf\u7684\u7bad\u5f15\u7206\u6c14\u7403", "Url": "https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 3 Problem 3"}, {"ID": 453, "Title": "Minimum Moves to Equal Array Elements", "TitleCn": "\u6700\u5c0f\u79fb\u52a8\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49", "Url": "https://leetcode.cn/problems/minimum-moves-to-equal-array-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 3 Problem 1"}, {"ID": 454, "Title": "4Sum II", "TitleCn": "\u56db\u6570\u76f8\u52a0 II", "Url": "https://leetcode.cn/problems/4sum-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 4 Problem 3"}, {"ID": 455, "Title": "Assign Cookies", "TitleCn": "\u5206\u53d1\u997c\u5e72", "Url": "https://leetcode.cn/problems/assign-cookies/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Smarking Algorithm Contest 4 Problem 1"}, {"ID": 456, "Title": "132 Pattern", "TitleCn": "132\u6a21\u5f0f", "Url": "https://leetcode.cn/problems/132-pattern/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Smarking Algorithm Contest 4 Problem 4"}, {"ID": 457, "Title": "Circular Array Loop", "TitleCn": "\u73af\u5f62\u6570\u7ec4\u662f\u5426\u5b58\u5728\u5faa\u73af", "Url": "https://leetcode.cn/problems/circular-array-loop/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 458, "Title": "Poor Pigs", "TitleCn": "\u53ef\u601c\u7684\u5c0f\u732a", "Url": "https://leetcode.cn/problems/poor-pigs/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 459, "Title": "Repeated Substring Pattern", "TitleCn": "\u91cd\u590d\u7684\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/repeated-substring-pattern/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Smarking Algorithm Contest 4 Problem 2"}, {"ID": 460, "Title": "LFU Cache", "TitleCn": "LFU \u7f13\u5b58", "Url": "https://leetcode.cn/problems/lfu-cache/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 461, "Title": "Hamming Distance", "TitleCn": "\u6c49\u660e\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/hamming-distance/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 13 Problem 1"}, {"ID": 462, "Title": "Minimum Moves to Equal Array Elements II", "TitleCn": "\u6700\u5c0f\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49 II", "Url": "https://leetcode.cn/problems/minimum-moves-to-equal-array-elements-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 10 Problem 3"}, {"ID": 463, "Title": "Island Perimeter", "TitleCn": "\u5c9b\u5c7f\u7684\u5468\u957f", "Url": "https://leetcode.cn/problems/island-perimeter/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 10 Problem 1"}, {"ID": 464, "Title": "Can I Win", "TitleCn": "\u6211\u80fd\u8d62\u5417", "Url": "https://leetcode.cn/problems/can-i-win/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 10 Problem 2"}, {"ID": 465, "Title": "Optimal Account Balancing", "TitleCn": "\u6700\u4f18\u8d26\u5355\u5e73\u8861", "Url": "https://leetcode.cn/problems/optimal-account-balancing/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 10 Problem 4"}, {"ID": 466, "Title": "Count The Repetitions", "TitleCn": "\u7edf\u8ba1\u91cd\u590d\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-the-repetitions/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 11 Problem 4"}, {"ID": 467, "Title": "Unique Substrings in Wraparound String", "TitleCn": "\u73af\u7ed5\u5b57\u7b26\u4e32\u4e2d\u552f\u4e00\u7684\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/unique-substrings-in-wraparound-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 11 Problem 3"}, {"ID": 468, "Title": "Validate IP Address", "TitleCn": "\u9a8c\u8bc1IP\u5730\u5740", "Url": "https://leetcode.cn/problems/validate-ip-address/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 12 Problem 2"}, {"ID": 469, "Title": "Convex Polygon", "TitleCn": "\u51f8\u591a\u8fb9\u5f62", "Url": "https://leetcode.cn/problems/convex-polygon/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 11 Problem 2"}, {"ID": 470, "Title": "Implement Rand10() Using Rand7()", "TitleCn": "\u7528 Rand7() \u5b9e\u73b0 Rand10()", "Url": "https://leetcode.cn/problems/implement-rand10-using-rand7/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 471, "Title": "Encode String with Shortest Length", "TitleCn": "\u7f16\u7801\u6700\u77ed\u957f\u5ea6\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/encode-string-with-shortest-length/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 12 Problem 4"}, {"ID": 472, "Title": "Concatenated Words", "TitleCn": "\u8fde\u63a5\u8bcd", "Url": "https://leetcode.cn/problems/concatenated-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 13 Problem 4"}, {"ID": 473, "Title": "Matchsticks to Square", "TitleCn": "\u706b\u67f4\u62fc\u6b63\u65b9\u5f62", "Url": "https://leetcode.cn/problems/matchsticks-to-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 13 Problem 3"}, {"ID": 474, "Title": "Ones and Zeroes", "TitleCn": "\u4e00\u548c\u96f6", "Url": "https://leetcode.cn/problems/ones-and-zeroes/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 12 Problem 3"}, {"ID": 475, "Title": "Heaters", "TitleCn": "\u4f9b\u6696\u5668", "Url": "https://leetcode.cn/problems/heaters/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 12 Problem 1"}, {"ID": 476, "Title": "Number Complement", "TitleCn": "\u6570\u5b57\u7684\u8865\u6570", "Url": "https://leetcode.cn/problems/number-complement/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 14 Problem 1"}, {"ID": 477, "Title": "Total Hamming Distance", "TitleCn": "\u6c49\u660e\u8ddd\u79bb\u603b\u548c", "Url": "https://leetcode.cn/problems/total-hamming-distance/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 13 Problem 2"}, {"ID": 478, "Title": "Generate Random Point in a Circle", "TitleCn": "\u5728\u5706\u5185\u968f\u673a\u751f\u6210\u70b9", "Url": "https://leetcode.cn/problems/generate-random-point-in-a-circle/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 479, "Title": "Largest Palindrome Product", "TitleCn": "\u6700\u5927\u56de\u6587\u6570\u4e58\u79ef", "Url": "https://leetcode.cn/problems/largest-palindrome-product/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 480, "Title": "Sliding Window Median", "TitleCn": "\u6ed1\u52a8\u7a97\u53e3\u4e2d\u4f4d\u6570", "Url": "https://leetcode.cn/problems/sliding-window-median/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 14 Problem 4"}, {"ID": 481, "Title": "Magical String", "TitleCn": "\u795e\u5947\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/magical-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 14 Problem 2"}, {"ID": 482, "Title": "License Key Formatting", "TitleCn": "\u5bc6\u94a5\u683c\u5f0f\u5316", "Url": "https://leetcode.cn/problems/license-key-formatting/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 14 Problem 3"}, {"ID": 483, "Title": "Smallest Good Base", "TitleCn": "\u6700\u5c0f\u597d\u8fdb\u5236", "Url": "https://leetcode.cn/problems/smallest-good-base/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 16B Problem 3"}, {"ID": 484, "Title": "Find Permutation", "TitleCn": "\u5bfb\u627e\u6392\u5217", "Url": "https://leetcode.cn/problems/find-permutation/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 16A Problem 1"}, {"ID": 485, "Title": "Max Consecutive Ones", "TitleCn": "\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/max-consecutive-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 15 Problem 1"}, {"ID": 486, "Title": "Predict the Winner", "TitleCn": "\u9884\u6d4b\u8d62\u5bb6", "Url": "https://leetcode.cn/problems/predict-the-winner/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 16B Problem 2"}, {"ID": 487, "Title": "Max Consecutive Ones II", "TitleCn": "\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 II", "Url": "https://leetcode.cn/problems/max-consecutive-ones-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 15 Problem 2"}, {"ID": 488, "Title": "Zuma Game", "TitleCn": "\u7956\u739b\u6e38\u620f", "Url": "https://leetcode.cn/problems/zuma-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 15 Problem 3"}, {"ID": 489, "Title": "Robot Room Cleaner", "TitleCn": "\u626b\u5730\u673a\u5668\u4eba", "Url": "https://leetcode.cn/problems/robot-room-cleaner/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 490, "Title": "The Maze", "TitleCn": "\u8ff7\u5bab", "Url": "https://leetcode.cn/problems/the-maze/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 491, "Title": "Non-decreasing Subsequences", "TitleCn": "\u975e\u9012\u51cf\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/non-decreasing-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 16A Problem 3"}, {"ID": 492, "Title": "Construct the Rectangle", "TitleCn": "\u6784\u9020\u77e9\u5f62", "Url": "https://leetcode.cn/problems/construct-the-rectangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 16B Problem 1"}, {"ID": 493, "Title": "Reverse Pairs", "TitleCn": "\u7ffb\u8f6c\u5bf9", "Url": "https://leetcode.cn/problems/reverse-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 19 Problem 4"}, {"ID": 494, "Title": "Target Sum", "TitleCn": "\u76ee\u6807\u548c", "Url": "https://leetcode.cn/problems/target-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 16A Problem 2"}, {"ID": 495, "Title": "Teemo Attacking", "TitleCn": "\u63d0\u83ab\u653b\u51fb", "Url": "https://leetcode.cn/problems/teemo-attacking/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 17 Problem 2"}, {"ID": 496, "Title": "Next Greater Element I", "TitleCn": "\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 I", "Url": "https://leetcode.cn/problems/next-greater-element-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 18B Problem 1"}, {"ID": 497, "Title": "Random Point in Non-overlapping Rectangles", "TitleCn": "\u975e\u91cd\u53e0\u77e9\u5f62\u4e2d\u7684\u968f\u673a\u70b9", "Url": "https://leetcode.cn/problems/random-point-in-non-overlapping-rectangles/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 498, "Title": "Diagonal Traverse", "TitleCn": "\u5bf9\u89d2\u7ebf\u904d\u5386", "Url": "https://leetcode.cn/problems/diagonal-traverse/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 18B Problem 4"}, {"ID": 499, "Title": "The Maze III", "TitleCn": "\u8ff7\u5bab III", "Url": "https://leetcode.cn/problems/the-maze-iii/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 17 Problem 3"}, {"ID": 500, "Title": "Keyboard Row", "TitleCn": "\u952e\u76d8\u884c", "Url": "https://leetcode.cn/problems/keyboard-row/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 18A Problem 1"}, {"ID": 501, "Title": "Find Mode in Binary Search Tree", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4f17\u6570", "Url": "https://leetcode.cn/problems/find-mode-in-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 8, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 17 Problem 1"}, {"ID": 502, "Title": "IPO", "TitleCn": "IPO", "Url": "https://leetcode.cn/problems/ipo/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 18A Problem 3"}, {"ID": 503, "Title": "Next Greater Element II", "TitleCn": "\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 II", "Url": "https://leetcode.cn/problems/next-greater-element-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 18B Problem 3"}, {"ID": 504, "Title": "Base 7", "TitleCn": "\u4e03\u8fdb\u5236\u6570", "Url": "https://leetcode.cn/problems/base-7/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 19 Problem 1"}, {"ID": 505, "Title": "The Maze II", "TitleCn": "\u8ff7\u5bab II", "Url": "https://leetcode.cn/problems/the-maze-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 506, "Title": "Relative Ranks", "TitleCn": "\u76f8\u5bf9\u540d\u6b21", "Url": "https://leetcode.cn/problems/relative-ranks/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 18B Problem 2"}, {"ID": 507, "Title": "Perfect Number", "TitleCn": "\u5b8c\u7f8e\u6570", "Url": "https://leetcode.cn/problems/perfect-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 25 Problem 1"}, {"ID": 508, "Title": "Most Frequent Subtree Sum", "TitleCn": "\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5b50\u6811\u5143\u7d20\u548c", "Url": "https://leetcode.cn/problems/most-frequent-subtree-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 18A Problem 2"}, {"ID": 509, "Title": "Fibonacci Number", "TitleCn": "\u6590\u6ce2\u90a3\u5951\u6570", "Url": "https://leetcode.cn/problems/fibonacci-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 510, "Title": "Inorder Successor in BST II", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7 II", "Url": "https://leetcode.cn/problems/inorder-successor-in-bst-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 511, "Title": "Game Play Analysis I", "TitleCn": "\u6e38\u620f\u73a9\u6cd5\u5206\u6790 I", "Url": "https://leetcode.cn/problems/game-play-analysis-i/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 512, "Title": "Game Play Analysis II", "TitleCn": "\u6e38\u620f\u73a9\u6cd5\u5206\u6790 II", "Url": "https://leetcode.cn/problems/game-play-analysis-ii/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 513, "Title": "Find Bottom Left Tree Value", "TitleCn": "\u627e\u6811\u5de6\u4e0b\u89d2\u7684\u503c", "Url": "https://leetcode.cn/problems/find-bottom-left-tree-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 19 Problem 2"}, {"ID": 514, "Title": "Freedom Trail", "TitleCn": "\u81ea\u7531\u4e4b\u8def", "Url": "https://leetcode.cn/problems/freedom-trail/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 22 Problem 4"}, {"ID": 515, "Title": "Find Largest Value in Each Tree Row", "TitleCn": "\u5728\u6bcf\u4e2a\u6811\u884c\u4e2d\u627e\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/find-largest-value-in-each-tree-row/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 19 Problem 3"}, {"ID": 516, "Title": "Longest Palindromic Subsequence", "TitleCn": "\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-palindromic-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 517, "Title": "Super Washing Machines", "TitleCn": "\u8d85\u7ea7\u6d17\u8863\u673a", "Url": "https://leetcode.cn/problems/super-washing-machines/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 20 Problem 4"}, {"ID": 518, "Title": "Coin Change II", "TitleCn": "\u96f6\u94b1\u5151\u6362 II", "Url": "https://leetcode.cn/problems/coin-change-2/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 519, "Title": "Random Flip Matrix", "TitleCn": "\u968f\u673a\u7ffb\u8f6c\u77e9\u9635", "Url": "https://leetcode.cn/problems/random-flip-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 520, "Title": "Detect Capital", "TitleCn": "\u68c0\u6d4b\u5927\u5199\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/detect-capital/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 20 Problem 1"}, {"ID": 521, "Title": "Longest Uncommon Subsequence I", "TitleCn": "\u6700\u957f\u7279\u6b8a\u5e8f\u5217 \u2160", "Url": "https://leetcode.cn/problems/longest-uncommon-subsequence-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 26 Problem 1"}, {"ID": 522, "Title": "Longest Uncommon Subsequence II", "TitleCn": "\u6700\u957f\u7279\u6b8a\u5e8f\u5217 II", "Url": "https://leetcode.cn/problems/longest-uncommon-subsequence-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 26 Problem 2"}, {"ID": 523, "Title": "Continuous Subarray Sum", "TitleCn": "\u8fde\u7eed\u7684\u5b50\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/continuous-subarray-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 21 Problem 2"}, {"ID": 524, "Title": "Longest Word in Dictionary through Deleting", "TitleCn": "\u901a\u8fc7\u5220\u9664\u5b57\u6bcd\u5339\u914d\u5230\u5b57\u5178\u91cc\u6700\u957f\u5355\u8bcd", "Url": "https://leetcode.cn/problems/longest-word-in-dictionary-through-deleting/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 21 Problem 3"}, {"ID": 525, "Title": "Contiguous Array", "TitleCn": "\u8fde\u7eed\u6570\u7ec4", "Url": "https://leetcode.cn/problems/contiguous-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 20 Problem 3"}, {"ID": 526, "Title": "Beautiful Arrangement", "TitleCn": "\u4f18\u7f8e\u7684\u6392\u5217", "Url": "https://leetcode.cn/problems/beautiful-arrangement/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 20 Problem 2"}, {"ID": 527, "Title": "Word Abbreviation", "TitleCn": "\u5355\u8bcd\u7f29\u5199", "Url": "https://leetcode.cn/problems/word-abbreviation/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 23 Problem 4"}, {"ID": 528, "Title": "Random Pick with Weight", "TitleCn": "\u6309\u6743\u91cd\u968f\u673a\u9009\u62e9", "Url": "https://leetcode.cn/problems/random-pick-with-weight/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 529, "Title": "Minesweeper", "TitleCn": "\u626b\u96f7\u6e38\u620f", "Url": "https://leetcode.cn/problems/minesweeper/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 21 Problem 4"}, {"ID": 530, "Title": "Minimum Absolute Difference in BST", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u5c0f\u7edd\u5bf9\u5dee", "Url": "https://leetcode.cn/problems/minimum-absolute-difference-in-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 21 Problem 1"}, {"ID": 531, "Title": "Lonely Pixel I", "TitleCn": "\u5b64\u72ec\u50cf\u7d20 I", "Url": "https://leetcode.cn/problems/lonely-pixel-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 22 Problem 2"}, {"ID": 532, "Title": "K-diff Pairs in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684 k-diff \u6570\u5bf9", "Url": "https://leetcode.cn/problems/k-diff-pairs-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 22 Problem 1"}, {"ID": 533, "Title": "Lonely Pixel II", "TitleCn": "\u5b64\u72ec\u50cf\u7d20 II", "Url": "https://leetcode.cn/problems/lonely-pixel-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 22 Problem 3"}, {"ID": 534, "Title": "Game Play Analysis III", "TitleCn": "\u6e38\u620f\u73a9\u6cd5\u5206\u6790 III", "Url": "https://leetcode.cn/problems/game-play-analysis-iii/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 535, "Title": "Encode and Decode TinyURL", "TitleCn": "TinyURL \u7684\u52a0\u5bc6\u4e0e\u89e3\u5bc6", "Url": "https://leetcode.cn/problems/encode-and-decode-tinyurl/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 536, "Title": "Construct Binary Tree from String", "TitleCn": "\u4ece\u5b57\u7b26\u4e32\u751f\u6210\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/construct-binary-tree-from-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 23 Problem 3"}, {"ID": 537, "Title": "Complex Number Multiplication", "TitleCn": "\u590d\u6570\u4e58\u6cd5", "Url": "https://leetcode.cn/problems/complex-number-multiplication/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 25 Problem 2"}, {"ID": 538, "Title": "Convert BST to Greater Tree", "TitleCn": "\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811", "Url": "https://leetcode.cn/problems/convert-bst-to-greater-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 24 Problem 2"}, {"ID": 539, "Title": "Minimum Time Difference", "TitleCn": "\u6700\u5c0f\u65f6\u95f4\u5dee", "Url": "https://leetcode.cn/problems/minimum-time-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 23 Problem 2"}, {"ID": 540, "Title": "Single Element in a Sorted Array", "TitleCn": "\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u5355\u4e00\u5143\u7d20", "Url": "https://leetcode.cn/problems/single-element-in-a-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 541, "Title": "Reverse String II", "TitleCn": "\u53cd\u8f6c\u5b57\u7b26\u4e32 II", "Url": "https://leetcode.cn/problems/reverse-string-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 23 Problem 1"}, {"ID": 542, "Title": "01 Matrix", "TitleCn": "01 \u77e9\u9635", "Url": "https://leetcode.cn/problems/01-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 24 Problem 3"}, {"ID": 543, "Title": "Diameter of Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u76f4\u5f84", "Url": "https://leetcode.cn/problems/diameter-of-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 24 Problem 1"}, {"ID": 544, "Title": "Output Contest Matches", "TitleCn": "\u8f93\u51fa\u6bd4\u8d5b\u5339\u914d\u5bf9", "Url": "https://leetcode.cn/problems/output-contest-matches/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 24 Problem 4"}, {"ID": 545, "Title": "Boundary of Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u8fb9\u754c", "Url": "https://leetcode.cn/problems/boundary-of-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 25 Problem 3"}, {"ID": 546, "Title": "Remove Boxes", "TitleCn": "\u79fb\u9664\u76d2\u5b50", "Url": "https://leetcode.cn/problems/remove-boxes/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 25 Problem 4"}, {"ID": 547, "Title": "Number of Provinces", "TitleCn": "\u7701\u4efd\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-provinces/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 26 Problem 3"}, {"ID": 548, "Title": "Split Array with Equal Sum", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u5272\u6210\u548c\u76f8\u7b49\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/split-array-with-equal-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 26 Problem 4"}, {"ID": 549, "Title": "Binary Tree Longest Consecutive Sequence II", "TitleCn": "\u4e8c\u53c9\u6811\u6700\u957f\u8fde\u7eed\u5e8f\u5217 II", "Url": "https://leetcode.cn/problems/binary-tree-longest-consecutive-sequence-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 27 Problem 4"}, {"ID": 550, "Title": "Game Play Analysis IV", "TitleCn": "\u6e38\u620f\u73a9\u6cd5\u5206\u6790 IV", "Url": "https://leetcode.cn/problems/game-play-analysis-iv/", "Ispaid": 0, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 551, "Title": "Student Attendance Record I", "TitleCn": "\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 I", "Url": "https://leetcode.cn/problems/student-attendance-record-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 28 Problem 1"}, {"ID": 552, "Title": "Student Attendance Record II", "TitleCn": "\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 II", "Url": "https://leetcode.cn/problems/student-attendance-record-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 28 Problem 4"}, {"ID": 553, "Title": "Optimal Division", "TitleCn": "\u6700\u4f18\u9664\u6cd5", "Url": "https://leetcode.cn/problems/optimal-division/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 28 Problem 2"}, {"ID": 554, "Title": "Brick Wall", "TitleCn": "\u7816\u5899", "Url": "https://leetcode.cn/problems/brick-wall/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 27 Problem 2"}, {"ID": 555, "Title": "Split Concatenated Strings", "TitleCn": "\u5206\u5272\u8fde\u63a5\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/split-concatenated-strings/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 28 Problem 3"}, {"ID": 556, "Title": "Next Greater Element III", "TitleCn": "\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 III", "Url": "https://leetcode.cn/problems/next-greater-element-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 27 Problem 3"}, {"ID": 557, "Title": "Reverse Words in a String III", "TitleCn": "\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd III", "Url": "https://leetcode.cn/problems/reverse-words-in-a-string-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 27 Problem 1"}, {"ID": 558, "Title": "Logical OR of Two Binary Grids Represented as Quad-Trees", "TitleCn": "\u56db\u53c9\u6811\u4ea4\u96c6", "Url": "https://leetcode.cn/problems/logical-or-of-two-binary-grids-represented-as-quad-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 559, "Title": "Maximum Depth of N-ary Tree", "TitleCn": "N\u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6", "Url": "https://leetcode.cn/problems/maximum-depth-of-n-ary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 560, "Title": "Subarray Sum Equals K", "TitleCn": "\u548c\u4e3aK\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/subarray-sum-equals-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 30 Problem 2"}, {"ID": 561, "Title": "Array Partition", "TitleCn": "\u6570\u7ec4\u62c6\u5206", "Url": "https://leetcode.cn/problems/array-partition/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 29 Problem 2"}, {"ID": 562, "Title": "Longest Line of Consecutive One in Matrix", "TitleCn": "\u77e9\u9635\u4e2d\u6700\u957f\u7684\u8fde\u7eed1\u7ebf\u6bb5", "Url": "https://leetcode.cn/problems/longest-line-of-consecutive-one-in-matrix/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 29 Problem 3"}, {"ID": 563, "Title": "Binary Tree Tilt", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5761\u5ea6", "Url": "https://leetcode.cn/problems/binary-tree-tilt/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 29 Problem 1"}, {"ID": 564, "Title": "Find the Closest Palindrome", "TitleCn": "\u5bfb\u627e\u6700\u8fd1\u7684\u56de\u6587\u6570", "Url": "https://leetcode.cn/problems/find-the-closest-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 29 Problem 4"}, {"ID": 565, "Title": "Array Nesting", "TitleCn": "\u6570\u7ec4\u5d4c\u5957", "Url": "https://leetcode.cn/problems/array-nesting/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 34 Problem 3"}, {"ID": 566, "Title": "Reshape the Matrix", "TitleCn": "\u91cd\u5851\u77e9\u9635", "Url": "https://leetcode.cn/problems/reshape-the-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 30 Problem 1"}, {"ID": 567, "Title": "Permutation in String", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u6392\u5217", "Url": "https://leetcode.cn/problems/permutation-in-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 30 Problem 3"}, {"ID": 568, "Title": "Maximum Vacation Days", "TitleCn": "\u6700\u5927\u4f11\u5047\u5929\u6570", "Url": "https://leetcode.cn/problems/maximum-vacation-days/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 30 Problem 4"}, {"ID": 569, "Title": "Median Employee Salary", "TitleCn": "\u5458\u5de5\u85aa\u6c34\u4e2d\u4f4d\u6570", "Url": "https://leetcode.cn/problems/median-employee-salary/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 570, "Title": "Managers with at Least 5 Direct Reports", "TitleCn": "\u81f3\u5c11\u67095\u540d\u76f4\u63a5\u4e0b\u5c5e\u7684\u7ecf\u7406", "Url": "https://leetcode.cn/problems/managers-with-at-least-5-direct-reports/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 571, "Title": "Find Median Given Frequency of Numbers", "TitleCn": "\u7ed9\u5b9a\u6570\u5b57\u7684\u9891\u7387\u67e5\u8be2\u4e2d\u4f4d\u6570", "Url": "https://leetcode.cn/problems/find-median-given-frequency-of-numbers/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 572, "Title": "Subtree of Another Tree", "TitleCn": "\u53e6\u4e00\u4e2a\u6811\u7684\u5b50\u6811", "Url": "https://leetcode.cn/problems/subtree-of-another-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 31 Problem 2"}, {"ID": 573, "Title": "Squirrel Simulation", "TitleCn": "\u677e\u9f20\u6a21\u62df", "Url": "https://leetcode.cn/problems/squirrel-simulation/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 31 Problem 3"}, {"ID": 574, "Title": "Winning Candidate", "TitleCn": "\u5f53\u9009\u8005", "Url": "https://leetcode.cn/problems/winning-candidate/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 575, "Title": "Distribute Candies", "TitleCn": "\u5206\u7cd6\u679c", "Url": "https://leetcode.cn/problems/distribute-candies/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 31 Problem 1"}, {"ID": 576, "Title": "Out of Boundary Paths", "TitleCn": "\u51fa\u754c\u7684\u8def\u5f84\u6570", "Url": "https://leetcode.cn/problems/out-of-boundary-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 31 Problem 4"}, {"ID": 577, "Title": "Employee Bonus", "TitleCn": "\u5458\u5de5\u5956\u91d1", "Url": "https://leetcode.cn/problems/employee-bonus/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 578, "Title": "Get Highest Answer Rate Question", "TitleCn": "\u67e5\u8be2\u56de\u7b54\u7387\u6700\u9ad8\u7684\u95ee\u9898", "Url": "https://leetcode.cn/problems/get-highest-answer-rate-question/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 579, "Title": "Find Cumulative Salary of an Employee", "TitleCn": "\u67e5\u8be2\u5458\u5de5\u7684\u7d2f\u8ba1\u85aa\u6c34", "Url": "https://leetcode.cn/problems/find-cumulative-salary-of-an-employee/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 580, "Title": "Count Student Number in Departments", "TitleCn": "\u7edf\u8ba1\u5404\u4e13\u4e1a\u5b66\u751f\u4eba\u6570", "Url": "https://leetcode.cn/problems/count-student-number-in-departments/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 581, "Title": "Shortest Unsorted Continuous Subarray", "TitleCn": "\u6700\u77ed\u65e0\u5e8f\u8fde\u7eed\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/shortest-unsorted-continuous-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 32 Problem 1"}, {"ID": 582, "Title": "Kill Process", "TitleCn": "\u6740\u6389\u8fdb\u7a0b", "Url": "https://leetcode.cn/problems/kill-process/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 32 Problem 2"}, {"ID": 583, "Title": "Delete Operation for Two Strings", "TitleCn": "\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u5220\u9664\u64cd\u4f5c", "Url": "https://leetcode.cn/problems/delete-operation-for-two-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 32 Problem 3"}, {"ID": 584, "Title": "Find Customer Referee", "TitleCn": "\u5bfb\u627e\u7528\u6237\u63a8\u8350\u4eba", "Url": "https://leetcode.cn/problems/find-customer-referee/", "Ispaid": 0, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 585, "Title": "Investments in 2016", "TitleCn": "2016\u5e74\u7684\u6295\u8d44", "Url": "https://leetcode.cn/problems/investments-in-2016/", "Ispaid": 0, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 586, "Title": "Customer Placing the Largest Number of Orders", "TitleCn": "\u8ba2\u5355\u6700\u591a\u7684\u5ba2\u6237", "Url": "https://leetcode.cn/problems/customer-placing-the-largest-number-of-orders/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 587, "Title": "Erect the Fence", "TitleCn": "\u5b89\u88c5\u6805\u680f", "Url": "https://leetcode.cn/problems/erect-the-fence/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 32 Problem 4"}, {"ID": 588, "Title": "Design In-Memory File System", "TitleCn": "\u8bbe\u8ba1\u5185\u5b58\u6587\u4ef6\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-in-memory-file-system/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 33 Problem 4"}, {"ID": 589, "Title": "N-ary Tree Preorder Traversal", "TitleCn": "N\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/n-ary-tree-preorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 590, "Title": "N-ary Tree Postorder Traversal", "TitleCn": "N\u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/n-ary-tree-postorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 591, "Title": "Tag Validator", "TitleCn": "\u6807\u7b7e\u9a8c\u8bc1\u5668", "Url": "https://leetcode.cn/problems/tag-validator/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 35 Problem 4"}, {"ID": 592, "Title": "Fraction Addition and Subtraction", "TitleCn": "\u5206\u6570\u52a0\u51cf\u8fd0\u7b97", "Url": "https://leetcode.cn/problems/fraction-addition-and-subtraction/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 33 Problem 3"}, {"ID": 593, "Title": "Valid Square", "TitleCn": "\u6709\u6548\u7684\u6b63\u65b9\u5f62", "Url": "https://leetcode.cn/problems/valid-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 33 Problem 2"}, {"ID": 594, "Title": "Longest Harmonious Subsequence", "TitleCn": "\u6700\u957f\u548c\u8c10\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-harmonious-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 33 Problem 1"}, {"ID": 595, "Title": "Big Countries", "TitleCn": "\u5927\u7684\u56fd\u5bb6", "Url": "https://leetcode.cn/problems/big-countries/", "Ispaid": 0, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 596, "Title": "Classes More Than 5 Students", "TitleCn": "\u8d85\u8fc75\u540d\u5b66\u751f\u7684\u8bfe", "Url": "https://leetcode.cn/problems/classes-more-than-5-students/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 597, "Title": "Friend Requests I: Overall Acceptance Rate", "TitleCn": "\u597d\u53cb\u7533\u8bf7 I \uff1a\u603b\u4f53\u901a\u8fc7\u7387", "Url": "https://leetcode.cn/problems/friend-requests-i-overall-acceptance-rate/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 598, "Title": "Range Addition II", "TitleCn": "\u533a\u95f4\u52a0\u6cd5 II", "Url": "https://leetcode.cn/problems/range-addition-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 34 Problem 1"}, {"ID": 599, "Title": "Minimum Index Sum of Two Lists", "TitleCn": "\u4e24\u4e2a\u5217\u8868\u7684\u6700\u5c0f\u7d22\u5f15\u603b\u548c", "Url": "https://leetcode.cn/problems/minimum-index-sum-of-two-lists/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 34 Problem 2"}, {"ID": 600, "Title": "Non-negative Integers without Consecutive Ones", "TitleCn": "\u4e0d\u542b\u8fde\u7eed1\u7684\u975e\u8d1f\u6574\u6570", "Url": "https://leetcode.cn/problems/non-negative-integers-without-consecutive-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 34 Problem 4"}, {"ID": 601, "Title": "Human Traffic of Stadium", "TitleCn": "\u4f53\u80b2\u9986\u7684\u4eba\u6d41\u91cf", "Url": "https://leetcode.cn/problems/human-traffic-of-stadium/", "Ispaid": 0, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 602, "Title": "Friend Requests II: Who Has the Most Friends", "TitleCn": "\u597d\u53cb\u7533\u8bf7 II \uff1a\u8c01\u6709\u6700\u591a\u7684\u597d\u53cb", "Url": "https://leetcode.cn/problems/friend-requests-ii-who-has-the-most-friends/", "Ispaid": 0, "Type": "Database", "Level": 6, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 603, "Title": "Consecutive Available Seats", "TitleCn": "\u8fde\u7eed\u7a7a\u4f59\u5ea7\u4f4d", "Url": "https://leetcode.cn/problems/consecutive-available-seats/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 604, "Title": "Design Compressed String Iterator", "TitleCn": "\u8fed\u4ee3\u538b\u7f29\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/design-compressed-string-iterator/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 36 Problem 2"}, {"ID": 605, "Title": "Can Place Flowers", "TitleCn": "\u79cd\u82b1\u95ee\u9898", "Url": "https://leetcode.cn/problems/can-place-flowers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 35 Problem 1"}, {"ID": 606, "Title": "Construct String from Binary Tree", "TitleCn": "\u6839\u636e\u4e8c\u53c9\u6811\u521b\u5efa\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/construct-string-from-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 35 Problem 2"}, {"ID": 607, "Title": "Sales Person", "TitleCn": "\u9500\u552e\u5458", "Url": "https://leetcode.cn/problems/sales-person/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 608, "Title": "Tree Node", "TitleCn": "\u6811\u8282\u70b9", "Url": "https://leetcode.cn/problems/tree-node/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 609, "Title": "Find Duplicate File in System", "TitleCn": "\u5728\u7cfb\u7edf\u4e2d\u67e5\u627e\u91cd\u590d\u6587\u4ef6", "Url": "https://leetcode.cn/problems/find-duplicate-file-in-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 35 Problem 3"}, {"ID": 610, "Title": "Triangle Judgement", "TitleCn": "\u5224\u65ad\u4e09\u89d2\u5f62", "Url": "https://leetcode.cn/problems/triangle-judgement/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 611, "Title": "Valid Triangle Number", "TitleCn": "\u6709\u6548\u4e09\u89d2\u5f62\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/valid-triangle-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 36 Problem 3"}, {"ID": 612, "Title": "Shortest Distance in a Plane", "TitleCn": "\u5e73\u9762\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/shortest-distance-in-a-plane/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 613, "Title": "Shortest Distance in a Line", "TitleCn": "\u76f4\u7ebf\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/shortest-distance-in-a-line/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 614, "Title": "Second Degree Follower", "TitleCn": "\u4e8c\u7ea7\u5173\u6ce8\u8005", "Url": "https://leetcode.cn/problems/second-degree-follower/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 615, "Title": "Average Salary: Departments VS Company", "TitleCn": "\u5e73\u5747\u5de5\u8d44\uff1a\u90e8\u95e8\u4e0e\u516c\u53f8\u6bd4\u8f83", "Url": "https://leetcode.cn/problems/average-salary-departments-vs-company/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 616, "Title": "Add Bold Tag in String", "TitleCn": "\u7ed9\u5b57\u7b26\u4e32\u6dfb\u52a0\u52a0\u7c97\u6807\u7b7e", "Url": "https://leetcode.cn/problems/add-bold-tag-in-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 36 Problem 4"}, {"ID": 617, "Title": "Merge Two Binary Trees", "TitleCn": "\u5408\u5e76\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/merge-two-binary-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 36 Problem 1"}, {"ID": 618, "Title": "Students Report By Geography", "TitleCn": "\u5b66\u751f\u5730\u7406\u4fe1\u606f\u62a5\u544a", "Url": "https://leetcode.cn/problems/students-report-by-geography/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 10, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 619, "Title": "Biggest Single Number", "TitleCn": "\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6700\u5927\u6570\u5b57", "Url": "https://leetcode.cn/problems/biggest-single-number/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 620, "Title": "Not Boring Movies", "TitleCn": "\u6709\u8da3\u7684\u7535\u5f71", "Url": "https://leetcode.cn/problems/not-boring-movies/", "Ispaid": 0, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 621, "Title": "Task Scheduler", "TitleCn": "\u4efb\u52a1\u8c03\u5ea6\u5668", "Url": "https://leetcode.cn/problems/task-scheduler/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 37 Problem 4"}, {"ID": 622, "Title": "Design Circular Queue", "TitleCn": "\u8bbe\u8ba1\u5faa\u73af\u961f\u5217", "Url": "https://leetcode.cn/problems/design-circular-queue/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 623, "Title": "Add One Row to Tree", "TitleCn": "\u5728\u4e8c\u53c9\u6811\u4e2d\u589e\u52a0\u4e00\u884c", "Url": "https://leetcode.cn/problems/add-one-row-to-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 37 Problem 2"}, {"ID": 624, "Title": "Maximum Distance in Arrays", "TitleCn": "\u6570\u7ec4\u5217\u8868\u4e2d\u7684\u6700\u5927\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/maximum-distance-in-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 37 Problem 1"}, {"ID": 625, "Title": "Minimum Factorization", "TitleCn": "\u6700\u5c0f\u56e0\u5f0f\u5206\u89e3", "Url": "https://leetcode.cn/problems/minimum-factorization/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 37 Problem 3"}, {"ID": 626, "Title": "Exchange Seats", "TitleCn": "\u6362\u5ea7\u4f4d", "Url": "https://leetcode.cn/problems/exchange-seats/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 627, "Title": "Swap Salary", "TitleCn": "\u4ea4\u6362\u5de5\u8d44", "Url": "https://leetcode.cn/problems/swap-salary/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 628, "Title": "Maximum Product of Three Numbers", "TitleCn": "\u4e09\u4e2a\u6570\u7684\u6700\u5927\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-product-of-three-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 38 Problem 1"}, {"ID": 629, "Title": "K Inverse Pairs Array", "TitleCn": "K\u4e2a\u9006\u5e8f\u5bf9\u6570\u7ec4", "Url": "https://leetcode.cn/problems/k-inverse-pairs-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 38 Problem 3"}, {"ID": 630, "Title": "Course Schedule III", "TitleCn": "\u8bfe\u7a0b\u8868 III", "Url": "https://leetcode.cn/problems/course-schedule-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 38 Problem 2"}, {"ID": 631, "Title": "Design Excel Sum Formula", "TitleCn": "\u8bbe\u8ba1 Excel \u6c42\u548c\u516c\u5f0f", "Url": "https://leetcode.cn/problems/design-excel-sum-formula/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 38 Problem 4"}, {"ID": 632, "Title": "Smallest Range Covering Elements from K Lists", "TitleCn": "\u6700\u5c0f\u533a\u95f4", "Url": "https://leetcode.cn/problems/smallest-range-covering-elements-from-k-lists/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 39 Problem 4"}, {"ID": 633, "Title": "Sum of Square Numbers", "TitleCn": "\u5e73\u65b9\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-square-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 39 Problem 1"}, {"ID": 634, "Title": "Find the Derangement of An Array", "TitleCn": "\u5bfb\u627e\u6570\u7ec4\u7684\u9519\u4f4d\u6392\u5217", "Url": "https://leetcode.cn/problems/find-the-derangement-of-an-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 39 Problem 3"}, {"ID": 635, "Title": "Design Log Storage System", "TitleCn": "\u8bbe\u8ba1\u65e5\u5fd7\u5b58\u50a8\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-log-storage-system/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 39 Problem 2"}, {"ID": 636, "Title": "Exclusive Time of Functions", "TitleCn": "\u51fd\u6570\u7684\u72ec\u5360\u65f6\u95f4", "Url": "https://leetcode.cn/problems/exclusive-time-of-functions/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 41 Problem 2"}, {"ID": 637, "Title": "Average of Levels in Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5c42\u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/average-of-levels-in-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 40 Problem 1"}, {"ID": 638, "Title": "Shopping Offers", "TitleCn": "\u5927\u793c\u5305", "Url": "https://leetcode.cn/problems/shopping-offers/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 40 Problem 3"}, {"ID": 639, "Title": "Decode Ways II", "TitleCn": "\u89e3\u7801\u65b9\u6cd5 II", "Url": "https://leetcode.cn/problems/decode-ways-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 40 Problem 4"}, {"ID": 640, "Title": "Solve the Equation", "TitleCn": "\u6c42\u89e3\u65b9\u7a0b", "Url": "https://leetcode.cn/problems/solve-the-equation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 40 Problem 2"}, {"ID": 641, "Title": "Design Circular Deque", "TitleCn": "\u8bbe\u8ba1\u5faa\u73af\u53cc\u7aef\u961f\u5217", "Url": "https://leetcode.cn/problems/design-circular-deque/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 642, "Title": "Design Search Autocomplete System", "TitleCn": "\u8bbe\u8ba1\u641c\u7d22\u81ea\u52a8\u8865\u5168\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-search-autocomplete-system/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 41 Problem 4"}, {"ID": 643, "Title": "Maximum Average Subarray I", "TitleCn": "\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 I", "Url": "https://leetcode.cn/problems/maximum-average-subarray-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 41 Problem 1"}, {"ID": 644, "Title": "Maximum Average Subarray II", "TitleCn": "\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 II", "Url": "https://leetcode.cn/problems/maximum-average-subarray-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 41 Problem 3"}, {"ID": 645, "Title": "Set Mismatch", "TitleCn": "\u9519\u8bef\u7684\u96c6\u5408", "Url": "https://leetcode.cn/problems/set-mismatch/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 42 Problem 4"}, {"ID": 646, "Title": "Maximum Length of Pair Chain", "TitleCn": "\u6700\u957f\u6570\u5bf9\u94fe", "Url": "https://leetcode.cn/problems/maximum-length-of-pair-chain/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 42 Problem 3"}, {"ID": 647, "Title": "Palindromic Substrings", "TitleCn": "\u56de\u6587\u5b50\u4e32", "Url": "https://leetcode.cn/problems/palindromic-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 42 Problem 2"}, {"ID": 648, "Title": "Replace Words", "TitleCn": "\u5355\u8bcd\u66ff\u6362", "Url": "https://leetcode.cn/problems/replace-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 42 Problem 1"}, {"ID": 649, "Title": "Dota2 Senate", "TitleCn": "Dota2 \u53c2\u8bae\u9662", "Url": "https://leetcode.cn/problems/dota2-senate/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 43 Problem 3"}, {"ID": 650, "Title": "2 Keys Keyboard", "TitleCn": "\u4e24\u4e2a\u952e\u7684\u952e\u76d8", "Url": "https://leetcode.cn/problems/2-keys-keyboard/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 43 Problem 2"}, {"ID": 651, "Title": "4 Keys Keyboard", "TitleCn": "\u56db\u4e2a\u952e\u7684\u952e\u76d8", "Url": "https://leetcode.cn/problems/4-keys-keyboard/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 43 Problem 4"}, {"ID": 652, "Title": "Find Duplicate Subtrees", "TitleCn": "\u5bfb\u627e\u91cd\u590d\u7684\u5b50\u6811", "Url": "https://leetcode.cn/problems/find-duplicate-subtrees/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 43 Problem 1"}, {"ID": 653, "Title": "Two Sum IV - Input is a BST", "TitleCn": "\u4e24\u6570\u4e4b\u548c IV - \u8f93\u5165 BST", "Url": "https://leetcode.cn/problems/two-sum-iv-input-is-a-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 44 Problem 1"}, {"ID": 654, "Title": "Maximum Binary Tree", "TitleCn": "\u6700\u5927\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/maximum-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 44 Problem 2"}, {"ID": 655, "Title": "Print Binary Tree", "TitleCn": "\u8f93\u51fa\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/print-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 44 Problem 3"}, {"ID": 656, "Title": "Coin Path", "TitleCn": "\u91d1\u5e01\u8def\u5f84", "Url": "https://leetcode.cn/problems/coin-path/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 44 Problem 4"}, {"ID": 657, "Title": "Robot Return to Origin", "TitleCn": "\u673a\u5668\u4eba\u80fd\u5426\u8fd4\u56de\u539f\u70b9", "Url": "https://leetcode.cn/problems/robot-return-to-origin/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 45 Problem 1"}, {"ID": 658, "Title": "Find K Closest Elements", "TitleCn": "\u627e\u5230 K \u4e2a\u6700\u63a5\u8fd1\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/find-k-closest-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 45 Problem 2"}, {"ID": 659, "Title": "Split Array into Consecutive Subsequences", "TitleCn": "\u5206\u5272\u6570\u7ec4\u4e3a\u8fde\u7eed\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/split-array-into-consecutive-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 45 Problem 3"}, {"ID": 660, "Title": "Remove 9", "TitleCn": "\u79fb\u9664 9", "Url": "https://leetcode.cn/problems/remove-9/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 45 Problem 4"}, {"ID": 661, "Title": "Image Smoother", "TitleCn": "\u56fe\u7247\u5e73\u6ed1\u5668", "Url": "https://leetcode.cn/problems/image-smoother/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 46 Problem 1"}, {"ID": 662, "Title": "Maximum Width of Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u6700\u5927\u5bbd\u5ea6", "Url": "https://leetcode.cn/problems/maximum-width-of-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 46 Problem 2"}, {"ID": 663, "Title": "Equal Tree Partition", "TitleCn": "\u5747\u5300\u6811\u5212\u5206", "Url": "https://leetcode.cn/problems/equal-tree-partition/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 46 Problem 3"}, {"ID": 664, "Title": "Strange Printer", "TitleCn": "\u5947\u602a\u7684\u6253\u5370\u673a", "Url": "https://leetcode.cn/problems/strange-printer/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 46 Problem 4"}, {"ID": 665, "Title": "Non-decreasing Array", "TitleCn": "\u975e\u9012\u51cf\u6570\u5217", "Url": "https://leetcode.cn/problems/non-decreasing-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 47 Problem 1"}, {"ID": 666, "Title": "Path Sum IV", "TitleCn": "\u8def\u5f84\u603b\u548c IV", "Url": "https://leetcode.cn/problems/path-sum-iv/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 47 Problem 2"}, {"ID": 667, "Title": "Beautiful Arrangement II", "TitleCn": "\u4f18\u7f8e\u7684\u6392\u5217 II", "Url": "https://leetcode.cn/problems/beautiful-arrangement-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 47 Problem 3"}, {"ID": 668, "Title": "Kth Smallest Number in Multiplication Table", "TitleCn": "\u4e58\u6cd5\u8868\u4e2d\u7b2ck\u5c0f\u7684\u6570", "Url": "https://leetcode.cn/problems/kth-smallest-number-in-multiplication-table/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 47 Problem 4"}, {"ID": 669, "Title": "Trim a Binary Search Tree", "TitleCn": "\u4fee\u526a\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/trim-a-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 48 Problem 2"}, {"ID": 670, "Title": "Maximum Swap", "TitleCn": "\u6700\u5927\u4ea4\u6362", "Url": "https://leetcode.cn/problems/maximum-swap/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 48 Problem 3"}, {"ID": 671, "Title": "Second Minimum Node In a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u7b2c\u4e8c\u5c0f\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/second-minimum-node-in-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 48 Problem 1"}, {"ID": 672, "Title": "Bulb Switcher II", "TitleCn": "\u706f\u6ce1\u5f00\u5173 \u2161", "Url": "https://leetcode.cn/problems/bulb-switcher-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 48 Problem 4"}, {"ID": 673, "Title": "Number of Longest Increasing Subsequence", "TitleCn": "\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/number-of-longest-increasing-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 49 Problem 4"}, {"ID": 674, "Title": "Longest Continuous Increasing Subsequence", "TitleCn": "\u6700\u957f\u8fde\u7eed\u9012\u589e\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-continuous-increasing-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 49 Problem 1"}, {"ID": 675, "Title": "Cut Off Trees for Golf Event", "TitleCn": "\u4e3a\u9ad8\u5c14\u592b\u6bd4\u8d5b\u780d\u6811", "Url": "https://leetcode.cn/problems/cut-off-trees-for-golf-event/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 49 Problem 3"}, {"ID": 676, "Title": "Implement Magic Dictionary", "TitleCn": "\u5b9e\u73b0\u4e00\u4e2a\u9b54\u6cd5\u5b57\u5178", "Url": "https://leetcode.cn/problems/implement-magic-dictionary/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 49 Problem 2"}, {"ID": 677, "Title": "Map Sum Pairs", "TitleCn": "\u952e\u503c\u6620\u5c04", "Url": "https://leetcode.cn/problems/map-sum-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 50 Problem 2"}, {"ID": 678, "Title": "Valid Parenthesis String", "TitleCn": "\u6709\u6548\u7684\u62ec\u53f7\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/valid-parenthesis-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 50 Problem 3"}, {"ID": 679, "Title": "24 Game", "TitleCn": "24 \u70b9\u6e38\u620f", "Url": "https://leetcode.cn/problems/24-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 50 Problem 4"}, {"ID": 680, "Title": "Valid Palindrome II", "TitleCn": "\u9a8c\u8bc1\u56de\u6587\u5b57\u7b26\u4e32 \u2161", "Url": "https://leetcode.cn/problems/valid-palindrome-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 50 Problem 1"}, {"ID": 681, "Title": "Next Closest Time", "TitleCn": "\u6700\u8fd1\u65f6\u523b", "Url": "https://leetcode.cn/problems/next-closest-time/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 51 Problem 2"}, {"ID": 682, "Title": "Baseball Game", "TitleCn": "\u68d2\u7403\u6bd4\u8d5b", "Url": "https://leetcode.cn/problems/baseball-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 51 Problem 1"}, {"ID": 683, "Title": "K Empty Slots", "TitleCn": "K \u4e2a\u5173\u95ed\u7684\u706f\u6ce1", "Url": "https://leetcode.cn/problems/k-empty-slots/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 51 Problem 4"}, {"ID": 684, "Title": "Redundant Connection", "TitleCn": "\u5197\u4f59\u8fde\u63a5", "Url": "https://leetcode.cn/problems/redundant-connection/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 51 Problem 3"}, {"ID": 685, "Title": "Redundant Connection II", "TitleCn": "\u5197\u4f59\u8fde\u63a5 II", "Url": "https://leetcode.cn/problems/redundant-connection-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 686, "Title": "Repeated String Match", "TitleCn": "\u91cd\u590d\u53e0\u52a0\u5b57\u7b26\u4e32\u5339\u914d", "Url": "https://leetcode.cn/problems/repeated-string-match/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 52 Problem 1"}, {"ID": 687, "Title": "Longest Univalue Path", "TitleCn": "\u6700\u957f\u540c\u503c\u8def\u5f84", "Url": "https://leetcode.cn/problems/longest-univalue-path/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 52 Problem 2"}, {"ID": 688, "Title": "Knight Probability in Chessboard", "TitleCn": "\u9a91\u58eb\u5728\u68cb\u76d8\u4e0a\u7684\u6982\u7387", "Url": "https://leetcode.cn/problems/knight-probability-in-chessboard/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 52 Problem 3"}, {"ID": 689, "Title": "Maximum Sum of 3 Non-Overlapping Subarrays", "TitleCn": "\u4e09\u4e2a\u65e0\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-of-3-non-overlapping-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 52 Problem 4"}, {"ID": 690, "Title": "Employee Importance", "TitleCn": "\u5458\u5de5\u7684\u91cd\u8981\u6027", "Url": "https://leetcode.cn/problems/employee-importance/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 691, "Title": "Stickers to Spell Word", "TitleCn": "\u8d34\u7eb8\u62fc\u8bcd", "Url": "https://leetcode.cn/problems/stickers-to-spell-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 53 Problem 4"}, {"ID": 692, "Title": "Top K Frequent Words", "TitleCn": "\u524dK\u4e2a\u9ad8\u9891\u5355\u8bcd", "Url": "https://leetcode.cn/problems/top-k-frequent-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 4, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 693, "Title": "Binary Number with Alternating Bits", "TitleCn": "\u4ea4\u66ff\u4f4d\u4e8c\u8fdb\u5236\u6570", "Url": "https://leetcode.cn/problems/binary-number-with-alternating-bits/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 53 Problem 1"}, {"ID": 694, "Title": "Number of Distinct Islands", "TitleCn": "\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-distinct-islands/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 53 Problem 3"}, {"ID": 695, "Title": "Max Area of Island", "TitleCn": "\u5c9b\u5c7f\u7684\u6700\u5927\u9762\u79ef", "Url": "https://leetcode.cn/problems/max-area-of-island/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 53 Problem 2"}, {"ID": 696, "Title": "Count Binary Substrings", "TitleCn": "\u8ba1\u6570\u4e8c\u8fdb\u5236\u5b50\u4e32", "Url": "https://leetcode.cn/problems/count-binary-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 54 Problem 2"}, {"ID": 697, "Title": "Degree of an Array", "TitleCn": "\u6570\u7ec4\u7684\u5ea6", "Url": "https://leetcode.cn/problems/degree-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 54 Problem 1"}, {"ID": 698, "Title": "Partition to K Equal Sum Subsets", "TitleCn": "\u5212\u5206\u4e3ak\u4e2a\u76f8\u7b49\u7684\u5b50\u96c6", "Url": "https://leetcode.cn/problems/partition-to-k-equal-sum-subsets/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 54 Problem 3"}, {"ID": 699, "Title": "Falling Squares", "TitleCn": "\u6389\u843d\u7684\u65b9\u5757", "Url": "https://leetcode.cn/problems/falling-squares/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 54 Problem 4"}, {"ID": 700, "Title": "Search in a Binary Search Tree", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u641c\u7d22", "Url": "https://leetcode.cn/problems/search-in-a-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 701, "Title": "Insert into a Binary Search Tree", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u63d2\u5165\u64cd\u4f5c", "Url": "https://leetcode.cn/problems/insert-into-a-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 702, "Title": "Search in a Sorted Array of Unknown Size", "TitleCn": "\u641c\u7d22\u957f\u5ea6\u672a\u77e5\u7684\u6709\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/search-in-a-sorted-array-of-unknown-size/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 703, "Title": "Kth Largest Element in a Stream", "TitleCn": "\u6570\u636e\u6d41\u4e2d\u7684\u7b2cK\u5927\u5143\u7d20", "Url": "https://leetcode.cn/problems/kth-largest-element-in-a-stream/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 704, "Title": "Binary Search", "TitleCn": "\u4e8c\u5206\u67e5\u627e", "Url": "https://leetcode.cn/problems/binary-search/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 705, "Title": "Design HashSet", "TitleCn": "\u8bbe\u8ba1\u54c8\u5e0c\u96c6\u5408", "Url": "https://leetcode.cn/problems/design-hashset/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 706, "Title": "Design HashMap", "TitleCn": "\u8bbe\u8ba1\u54c8\u5e0c\u6620\u5c04", "Url": "https://leetcode.cn/problems/design-hashmap/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 707, "Title": "Design Linked List", "TitleCn": "\u8bbe\u8ba1\u94fe\u8868", "Url": "https://leetcode.cn/problems/design-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 708, "Title": "Insert into a Sorted Circular Linked List", "TitleCn": "\u5faa\u73af\u6709\u5e8f\u5217\u8868\u7684\u63d2\u5165", "Url": "https://leetcode.cn/problems/insert-into-a-sorted-circular-linked-list/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 709, "Title": "To Lower Case", "TitleCn": "\u8f6c\u6362\u6210\u5c0f\u5199\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/to-lower-case/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 710, "Title": "Random Pick with Blacklist", "TitleCn": "\u9ed1\u540d\u5355\u4e2d\u7684\u968f\u673a\u6570", "Url": "https://leetcode.cn/problems/random-pick-with-blacklist/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 711, "Title": "Number of Distinct Islands II", "TitleCn": "\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf II", "Url": "https://leetcode.cn/problems/number-of-distinct-islands-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 712, "Title": "Minimum ASCII Delete Sum for Two Strings", "TitleCn": "\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u6700\u5c0fASCII\u5220\u9664\u548c", "Url": "https://leetcode.cn/problems/minimum-ascii-delete-sum-for-two-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 55 Problem 2"}, {"ID": 713, "Title": "Subarray Product Less Than K", "TitleCn": "\u4e58\u79ef\u5c0f\u4e8eK\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/subarray-product-less-than-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 55 Problem 3"}, {"ID": 714, "Title": "Best Time to Buy and Sell Stock with Transaction Fee", "TitleCn": "\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a\u542b\u624b\u7eed\u8d39", "Url": "https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 55 Problem 1"}, {"ID": 715, "Title": "Range Module", "TitleCn": "Range \u6a21\u5757", "Url": "https://leetcode.cn/problems/range-module/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 55 Problem 4"}, {"ID": 716, "Title": "Max Stack", "TitleCn": "\u6700\u5927\u6808", "Url": "https://leetcode.cn/problems/max-stack/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 717, "Title": "1-bit and 2-bit Characters", "TitleCn": "1 \u6bd4\u7279\u4e0e 2 \u6bd4\u7279\u5b57\u7b26", "Url": "https://leetcode.cn/problems/1-bit-and-2-bit-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 56 Problem 1"}, {"ID": 718, "Title": "Maximum Length of Repeated Subarray", "TitleCn": "\u6700\u957f\u91cd\u590d\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/maximum-length-of-repeated-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 56 Problem 3"}, {"ID": 719, "Title": "Find K-th Smallest Pair Distance", "TitleCn": "\u627e\u51fa\u7b2c k \u5c0f\u7684\u8ddd\u79bb\u5bf9", "Url": "https://leetcode.cn/problems/find-k-th-smallest-pair-distance/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 56 Problem 4"}, {"ID": 720, "Title": "Longest Word in Dictionary", "TitleCn": "\u8bcd\u5178\u4e2d\u6700\u957f\u7684\u5355\u8bcd", "Url": "https://leetcode.cn/problems/longest-word-in-dictionary/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 57 Problem 1"}, {"ID": 721, "Title": "Accounts Merge", "TitleCn": "\u8d26\u6237\u5408\u5e76", "Url": "https://leetcode.cn/problems/accounts-merge/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 57 Problem 2"}, {"ID": 722, "Title": "Remove Comments", "TitleCn": "\u5220\u9664\u6ce8\u91ca", "Url": "https://leetcode.cn/problems/remove-comments/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 57 Problem 3"}, {"ID": 723, "Title": "Candy Crush", "TitleCn": "\u7c89\u788e\u7cd6\u679c", "Url": "https://leetcode.cn/problems/candy-crush/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 57 Problem 4"}, {"ID": 724, "Title": "Find Pivot Index", "TitleCn": "\u5bfb\u627e\u6570\u7ec4\u7684\u4e2d\u5fc3\u7d22\u5f15", "Url": "https://leetcode.cn/problems/find-pivot-index/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 58 Problem 1"}, {"ID": 725, "Title": "Split Linked List in Parts", "TitleCn": "\u5206\u9694\u94fe\u8868", "Url": "https://leetcode.cn/problems/split-linked-list-in-parts/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 58 Problem 2"}, {"ID": 726, "Title": "Number of Atoms", "TitleCn": "\u539f\u5b50\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-atoms/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 58 Problem 3"}, {"ID": 727, "Title": "Minimum Window Subsequence", "TitleCn": "\u6700\u5c0f\u7a97\u53e3\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/minimum-window-subsequence/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 58 Problem 4"}, {"ID": 728, "Title": "Self Dividing Numbers", "TitleCn": "\u81ea\u9664\u6570", "Url": "https://leetcode.cn/problems/self-dividing-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 59 Problem 1"}, {"ID": 729, "Title": "My Calendar I", "TitleCn": "\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 I", "Url": "https://leetcode.cn/problems/my-calendar-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 59 Problem 2"}, {"ID": 730, "Title": "Count Different Palindromic Subsequences", "TitleCn": "\u7edf\u8ba1\u4e0d\u540c\u56de\u6587\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/count-different-palindromic-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 59 Problem 3"}, {"ID": 731, "Title": "My Calendar II", "TitleCn": "\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 II", "Url": "https://leetcode.cn/problems/my-calendar-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 59 Problem 4"}, {"ID": 732, "Title": "My Calendar III", "TitleCn": "\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 III", "Url": "https://leetcode.cn/problems/my-calendar-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 733, "Title": "Flood Fill", "TitleCn": "\u56fe\u50cf\u6e32\u67d3", "Url": "https://leetcode.cn/problems/flood-fill/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 60 Problem 1"}, {"ID": 734, "Title": "Sentence Similarity", "TitleCn": "\u53e5\u5b50\u76f8\u4f3c\u6027", "Url": "https://leetcode.cn/problems/sentence-similarity/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 60 Problem 2"}, {"ID": 735, "Title": "Asteroid Collision", "TitleCn": "\u884c\u661f\u78b0\u649e", "Url": "https://leetcode.cn/problems/asteroid-collision/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 60 Problem 3"}, {"ID": 736, "Title": "Parse Lisp Expression", "TitleCn": "Lisp \u8bed\u6cd5\u89e3\u6790", "Url": "https://leetcode.cn/problems/parse-lisp-expression/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 60 Problem 4"}, {"ID": 737, "Title": "Sentence Similarity II", "TitleCn": "\u53e5\u5b50\u76f8\u4f3c\u6027 II", "Url": "https://leetcode.cn/problems/sentence-similarity-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 738, "Title": "Monotone Increasing Digits", "TitleCn": "\u5355\u8c03\u9012\u589e\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/monotone-increasing-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 61 Problem 2"}, {"ID": 739, "Title": "Daily Temperatures", "TitleCn": "\u6bcf\u65e5\u6e29\u5ea6", "Url": "https://leetcode.cn/problems/daily-temperatures/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 61 Problem 1"}, {"ID": 740, "Title": "Delete and Earn", "TitleCn": "\u5220\u9664\u4e0e\u83b7\u5f97\u70b9\u6570", "Url": "https://leetcode.cn/problems/delete-and-earn/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 61 Problem 3"}, {"ID": 741, "Title": "Cherry Pickup", "TitleCn": "\u6458\u6a31\u6843", "Url": "https://leetcode.cn/problems/cherry-pickup/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 61 Problem 4"}, {"ID": 742, "Title": "Closest Leaf in a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u6700\u8fd1\u7684\u53f6\u8282\u70b9", "Url": "https://leetcode.cn/problems/closest-leaf-in-a-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 62 Problem 3"}, {"ID": 743, "Title": "Network Delay Time", "TitleCn": "\u7f51\u7edc\u5ef6\u8fdf\u65f6\u95f4", "Url": "https://leetcode.cn/problems/network-delay-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 62 Problem 2"}, {"ID": 744, "Title": "Find Smallest Letter Greater Than Target", "TitleCn": "\u5bfb\u627e\u6bd4\u76ee\u6807\u5b57\u6bcd\u5927\u7684\u6700\u5c0f\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/find-smallest-letter-greater-than-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 62 Problem 1"}, {"ID": 745, "Title": "Prefix and Suffix Search", "TitleCn": "\u524d\u7f00\u548c\u540e\u7f00\u641c\u7d22", "Url": "https://leetcode.cn/problems/prefix-and-suffix-search/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 62 Problem 4"}, {"ID": 746, "Title": "Min Cost Climbing Stairs", "TitleCn": "\u4f7f\u7528\u6700\u5c0f\u82b1\u8d39\u722c\u697c\u68af", "Url": "https://leetcode.cn/problems/min-cost-climbing-stairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 63 Problem 1"}, {"ID": 747, "Title": "Largest Number At Least Twice of Others", "TitleCn": "\u81f3\u5c11\u662f\u5176\u4ed6\u6570\u5b57\u4e24\u500d\u7684\u6700\u5927\u6570", "Url": "https://leetcode.cn/problems/largest-number-at-least-twice-of-others/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 64 Problem 1"}, {"ID": 748, "Title": "Shortest Completing Word", "TitleCn": "\u6700\u77ed\u8865\u5168\u8bcd", "Url": "https://leetcode.cn/problems/shortest-completing-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 63 Problem 2"}, {"ID": 749, "Title": "Contain Virus", "TitleCn": "\u9694\u79bb\u75c5\u6bd2", "Url": "https://leetcode.cn/problems/contain-virus/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 63 Problem 4"}, {"ID": 750, "Title": "Number Of Corner Rectangles", "TitleCn": "\u89d2\u77e9\u5f62\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-corner-rectangles/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 63 Problem 3"}, {"ID": 751, "Title": "IP to CIDR", "TitleCn": "IP \u5230 CIDR", "Url": "https://leetcode.cn/problems/ip-to-cidr/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 64 Problem 2"}, {"ID": 752, "Title": "Open the Lock", "TitleCn": "\u6253\u5f00\u8f6c\u76d8\u9501", "Url": "https://leetcode.cn/problems/open-the-lock/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 64 Problem 3"}, {"ID": 753, "Title": "Cracking the Safe", "TitleCn": "\u7834\u89e3\u4fdd\u9669\u7bb1", "Url": "https://leetcode.cn/problems/cracking-the-safe/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 64 Problem 4"}, {"ID": 754, "Title": "Reach a Number", "TitleCn": "\u5230\u8fbe\u7ec8\u70b9\u6570\u5b57", "Url": "https://leetcode.cn/problems/reach-a-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 65 Problem 1"}, {"ID": 755, "Title": "Pour Water", "TitleCn": "\u5012\u6c34", "Url": "https://leetcode.cn/problems/pour-water/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 65 Problem 2"}, {"ID": 756, "Title": "Pyramid Transition Matrix", "TitleCn": "\u91d1\u5b57\u5854\u8f6c\u6362\u77e9\u9635", "Url": "https://leetcode.cn/problems/pyramid-transition-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 65 Problem 3"}, {"ID": 757, "Title": "Set Intersection Size At Least Two", "TitleCn": "\u8bbe\u7f6e\u4ea4\u96c6\u5927\u5c0f\u81f3\u5c11\u4e3a2", "Url": "https://leetcode.cn/problems/set-intersection-size-at-least-two/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 65 Problem 4"}, {"ID": 758, "Title": "Bold Words in String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u7684\u52a0\u7c97\u5355\u8bcd", "Url": "https://leetcode.cn/problems/bold-words-in-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 66 Problem 2"}, {"ID": 759, "Title": "Employee Free Time", "TitleCn": "\u5458\u5de5\u7a7a\u95f2\u65f6\u95f4", "Url": "https://leetcode.cn/problems/employee-free-time/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 66 Problem 3"}, {"ID": 760, "Title": "Find Anagram Mappings", "TitleCn": "\u627e\u51fa\u53d8\u4f4d\u6620\u5c04", "Url": "https://leetcode.cn/problems/find-anagram-mappings/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 66 Problem 1"}, {"ID": 761, "Title": "Special Binary String", "TitleCn": "\u7279\u6b8a\u7684\u4e8c\u8fdb\u5236\u5e8f\u5217", "Url": "https://leetcode.cn/problems/special-binary-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 66 Problem 4"}, {"ID": 762, "Title": "Prime Number of Set Bits in Binary Representation", "TitleCn": "\u4e8c\u8fdb\u5236\u8868\u793a\u4e2d\u8d28\u6570\u4e2a\u8ba1\u7b97\u7f6e\u4f4d", "Url": "https://leetcode.cn/problems/prime-number-of-set-bits-in-binary-representation/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 67 Problem 1"}, {"ID": 763, "Title": "Partition Labels", "TitleCn": "\u5212\u5206\u5b57\u6bcd\u533a\u95f4", "Url": "https://leetcode.cn/problems/partition-labels/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 67 Problem 2"}, {"ID": 764, "Title": "Largest Plus Sign", "TitleCn": "\u6700\u5927\u52a0\u53f7\u6807\u5fd7", "Url": "https://leetcode.cn/problems/largest-plus-sign/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 67 Problem 3"}, {"ID": 765, "Title": "Couples Holding Hands", "TitleCn": "\u60c5\u4fa3\u7275\u624b", "Url": "https://leetcode.cn/problems/couples-holding-hands/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 67 Problem 4"}, {"ID": 766, "Title": "Toeplitz Matrix", "TitleCn": "\u6258\u666e\u5229\u8328\u77e9\u9635", "Url": "https://leetcode.cn/problems/toeplitz-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 68 Problem 1"}, {"ID": 767, "Title": "Reorganize String", "TitleCn": "\u91cd\u6784\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/reorganize-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 68 Problem 2"}, {"ID": 768, "Title": "Max Chunks To Make Sorted II", "TitleCn": "\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757 II", "Url": "https://leetcode.cn/problems/max-chunks-to-make-sorted-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 68 Problem 4"}, {"ID": 769, "Title": "Max Chunks To Make Sorted", "TitleCn": "\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757", "Url": "https://leetcode.cn/problems/max-chunks-to-make-sorted/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 68 Problem 3"}, {"ID": 770, "Title": "Basic Calculator IV", "TitleCn": "\u57fa\u672c\u8ba1\u7b97\u5668 IV", "Url": "https://leetcode.cn/problems/basic-calculator-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 68 Problem 5"}, {"ID": 771, "Title": "Jewels and Stones", "TitleCn": "\u5b9d\u77f3\u4e0e\u77f3\u5934", "Url": "https://leetcode.cn/problems/jewels-and-stones/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 69 Problem 1"}, {"ID": 772, "Title": "Basic Calculator III", "TitleCn": "\u57fa\u672c\u8ba1\u7b97\u5668 III", "Url": "https://leetcode.cn/problems/basic-calculator-iii/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 773, "Title": "Sliding Puzzle", "TitleCn": "\u6ed1\u52a8\u8c1c\u9898", "Url": "https://leetcode.cn/problems/sliding-puzzle/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 69 Problem 3"}, {"ID": 774, "Title": "Minimize Max Distance to Gas Station", "TitleCn": "\u6700\u5c0f\u5316\u53bb\u52a0\u6cb9\u7ad9\u7684\u6700\u5927\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/minimize-max-distance-to-gas-station/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 69 Problem 4"}, {"ID": 775, "Title": "Global and Local Inversions", "TitleCn": "\u5168\u5c40\u5012\u7f6e\u4e0e\u5c40\u90e8\u5012\u7f6e", "Url": "https://leetcode.cn/problems/global-and-local-inversions/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 69 Problem 2"}, {"ID": 776, "Title": "Split BST", "TitleCn": "\u62c6\u5206\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/split-bst/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 70 Problem 2"}, {"ID": 777, "Title": "Swap Adjacent in LR String", "TitleCn": "\u5728LR\u5b57\u7b26\u4e32\u4e2d\u4ea4\u6362\u76f8\u90bb\u5b57\u7b26", "Url": "https://leetcode.cn/problems/swap-adjacent-in-lr-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 70 Problem 3"}, {"ID": 778, "Title": "Swim in Rising Water", "TitleCn": "\u6c34\u4f4d\u4e0a\u5347\u7684\u6cf3\u6c60\u4e2d\u6e38\u6cf3", "Url": "https://leetcode.cn/problems/swim-in-rising-water/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 70 Problem 4"}, {"ID": 779, "Title": "K-th Symbol in Grammar", "TitleCn": "\u7b2cK\u4e2a\u8bed\u6cd5\u7b26\u53f7", "Url": "https://leetcode.cn/problems/k-th-symbol-in-grammar/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 70 Problem 1"}, {"ID": 780, "Title": "Reaching Points", "TitleCn": "\u5230\u8fbe\u7ec8\u70b9", "Url": "https://leetcode.cn/problems/reaching-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 71 Problem 3"}, {"ID": 781, "Title": "Rabbits in Forest", "TitleCn": "\u68ee\u6797\u4e2d\u7684\u5154\u5b50", "Url": "https://leetcode.cn/problems/rabbits-in-forest/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 71 Problem 2"}, {"ID": 782, "Title": "Transform to Chessboard", "TitleCn": "\u53d8\u4e3a\u68cb\u76d8", "Url": "https://leetcode.cn/problems/transform-to-chessboard/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 71 Problem 4"}, {"ID": 783, "Title": "Minimum Distance Between BST Nodes", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u8282\u70b9\u6700\u5c0f\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/minimum-distance-between-bst-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 71 Problem 1"}, {"ID": 784, "Title": "Letter Case Permutation", "TitleCn": "\u5b57\u6bcd\u5927\u5c0f\u5199\u5168\u6392\u5217", "Url": "https://leetcode.cn/problems/letter-case-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 72 Problem 1"}, {"ID": 785, "Title": "Is Graph Bipartite?", "TitleCn": "\u5224\u65ad\u4e8c\u5206\u56fe", "Url": "https://leetcode.cn/problems/is-graph-bipartite/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 72 Problem 2"}, {"ID": 786, "Title": "K-th Smallest Prime Fraction", "TitleCn": "\u7b2c K \u4e2a\u6700\u5c0f\u7684\u8d28\u6570\u5206\u6570", "Url": "https://leetcode.cn/problems/k-th-smallest-prime-fraction/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 72 Problem 4"}, {"ID": 787, "Title": "Cheapest Flights Within K Stops", "TitleCn": "K \u7ad9\u4e2d\u8f6c\u5185\u6700\u4fbf\u5b9c\u7684\u822a\u73ed", "Url": "https://leetcode.cn/problems/cheapest-flights-within-k-stops/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 72 Problem 3"}, {"ID": 788, "Title": "Rotated Digits", "TitleCn": "\u65cb\u8f6c\u6570\u5b57", "Url": "https://leetcode.cn/problems/rotated-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 73 Problem 1"}, {"ID": 789, "Title": "Escape The Ghosts", "TitleCn": "\u9003\u8131\u963b\u788d\u8005", "Url": "https://leetcode.cn/problems/escape-the-ghosts/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 73 Problem 2"}, {"ID": 790, "Title": "Domino and Tromino Tiling", "TitleCn": "\u591a\u7c73\u8bfa\u548c\u6258\u7c73\u8bfa\u5e73\u94fa", "Url": "https://leetcode.cn/problems/domino-and-tromino-tiling/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 73 Problem 4"}, {"ID": 791, "Title": "Custom Sort String", "TitleCn": "\u81ea\u5b9a\u4e49\u5b57\u7b26\u4e32\u6392\u5e8f", "Url": "https://leetcode.cn/problems/custom-sort-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 73 Problem 3"}, {"ID": 792, "Title": "Number of Matching Subsequences", "TitleCn": "\u5339\u914d\u5b50\u5e8f\u5217\u7684\u5355\u8bcd\u6570", "Url": "https://leetcode.cn/problems/number-of-matching-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 74 Problem 2"}, {"ID": 793, "Title": "Preimage Size of Factorial Zeroes Function", "TitleCn": "\u9636\u4e58\u51fd\u6570\u540eK\u4e2a\u96f6", "Url": "https://leetcode.cn/problems/preimage-size-of-factorial-zeroes-function/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 74 Problem 4"}, {"ID": 794, "Title": "Valid Tic-Tac-Toe State", "TitleCn": "\u6709\u6548\u7684\u4e95\u5b57\u6e38\u620f", "Url": "https://leetcode.cn/problems/valid-tic-tac-toe-state/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 74 Problem 1"}, {"ID": 795, "Title": "Number of Subarrays with Bounded Maximum", "TitleCn": "\u533a\u95f4\u5b50\u6570\u7ec4\u4e2a\u6570", "Url": "https://leetcode.cn/problems/number-of-subarrays-with-bounded-maximum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 74 Problem 3"}, {"ID": 796, "Title": "Rotate String", "TitleCn": "\u65cb\u8f6c\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/rotate-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 75 Problem 1"}, {"ID": 797, "Title": "All Paths From Source to Target", "TitleCn": "\u6240\u6709\u53ef\u80fd\u7684\u8def\u5f84", "Url": "https://leetcode.cn/problems/all-paths-from-source-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 75 Problem 2"}, {"ID": 798, "Title": "Smallest Rotation with Highest Score", "TitleCn": "\u5f97\u5206\u6700\u9ad8\u7684\u6700\u5c0f\u8f6e\u8c03", "Url": "https://leetcode.cn/problems/smallest-rotation-with-highest-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 75 Problem 4"}, {"ID": 799, "Title": "Champagne Tower", "TitleCn": "\u9999\u69df\u5854", "Url": "https://leetcode.cn/problems/champagne-tower/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 75 Problem 3"}, {"ID": 800, "Title": "Similar RGB Color", "TitleCn": "\u76f8\u4f3c RGB \u989c\u8272", "Url": "https://leetcode.cn/problems/similar-rgb-color/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 76 Problem 1"}, {"ID": 801, "Title": "Minimum Swaps To Make Sequences Increasing", "TitleCn": "\u4f7f\u5e8f\u5217\u9012\u589e\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-swaps-to-make-sequences-increasing/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 76 Problem 2"}, {"ID": 802, "Title": "Find Eventual Safe States", "TitleCn": "\u627e\u5230\u6700\u7ec8\u7684\u5b89\u5168\u72b6\u6001", "Url": "https://leetcode.cn/problems/find-eventual-safe-states/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 76 Problem 3"}, {"ID": 803, "Title": "Bricks Falling When Hit", "TitleCn": "\u6253\u7816\u5757", "Url": "https://leetcode.cn/problems/bricks-falling-when-hit/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 76 Problem 4"}, {"ID": 804, "Title": "Unique Morse Code Words", "TitleCn": "\u552f\u4e00\u6469\u5c14\u65af\u5bc6\u7801\u8bcd", "Url": "https://leetcode.cn/problems/unique-morse-code-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 77 Problem 2"}, {"ID": 805, "Title": "Split Array With Same Average", "TitleCn": "\u6570\u7ec4\u7684\u5747\u503c\u5206\u5272", "Url": "https://leetcode.cn/problems/split-array-with-same-average/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 77 Problem 4"}, {"ID": 806, "Title": "Number of Lines To Write String", "TitleCn": "\u5199\u5b57\u7b26\u4e32\u9700\u8981\u7684\u884c\u6570", "Url": "https://leetcode.cn/problems/number-of-lines-to-write-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 77 Problem 1"}, {"ID": 807, "Title": "Max Increase to Keep City Skyline", "TitleCn": "\u4fdd\u6301\u57ce\u5e02\u5929\u9645\u7ebf", "Url": "https://leetcode.cn/problems/max-increase-to-keep-city-skyline/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 77 Problem 3"}, {"ID": 808, "Title": "Soup Servings", "TitleCn": "\u5206\u6c64", "Url": "https://leetcode.cn/problems/soup-servings/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 78 Problem 3"}, {"ID": 809, "Title": "Expressive Words", "TitleCn": "\u60c5\u611f\u4e30\u5bcc\u7684\u6587\u5b57", "Url": "https://leetcode.cn/problems/expressive-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 78 Problem 2"}, {"ID": 810, "Title": "Chalkboard XOR Game", "TitleCn": "\u9ed1\u677f\u5f02\u6216\u6e38\u620f", "Url": "https://leetcode.cn/problems/chalkboard-xor-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 78 Problem 4"}, {"ID": 811, "Title": "Subdomain Visit Count", "TitleCn": "\u5b50\u57df\u540d\u8bbf\u95ee\u8ba1\u6570", "Url": "https://leetcode.cn/problems/subdomain-visit-count/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 78 Problem 1"}, {"ID": 812, "Title": "Largest Triangle Area", "TitleCn": "\u6700\u5927\u4e09\u89d2\u5f62\u9762\u79ef", "Url": "https://leetcode.cn/problems/largest-triangle-area/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 79 Problem 1"}, {"ID": 813, "Title": "Largest Sum of Averages", "TitleCn": "\u6700\u5927\u5e73\u5747\u503c\u548c\u7684\u5206\u7ec4", "Url": "https://leetcode.cn/problems/largest-sum-of-averages/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 79 Problem 3"}, {"ID": 814, "Title": "Binary Tree Pruning", "TitleCn": "\u4e8c\u53c9\u6811\u526a\u679d", "Url": "https://leetcode.cn/problems/binary-tree-pruning/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 79 Problem 2"}, {"ID": 815, "Title": "Bus Routes", "TitleCn": "\u516c\u4ea4\u8def\u7ebf", "Url": "https://leetcode.cn/problems/bus-routes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 79 Problem 4"}, {"ID": 816, "Title": "Ambiguous Coordinates", "TitleCn": "\u6a21\u7cca\u5750\u6807", "Url": "https://leetcode.cn/problems/ambiguous-coordinates/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 80 Problem 3"}, {"ID": 817, "Title": "Linked List Components", "TitleCn": "\u94fe\u8868\u7ec4\u4ef6", "Url": "https://leetcode.cn/problems/linked-list-components/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 80 Problem 2"}, {"ID": 818, "Title": "Race Car", "TitleCn": "\u8d5b\u8f66", "Url": "https://leetcode.cn/problems/race-car/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 80 Problem 4"}, {"ID": 819, "Title": "Most Common Word", "TitleCn": "\u6700\u5e38\u89c1\u7684\u5355\u8bcd", "Url": "https://leetcode.cn/problems/most-common-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 80 Problem 1"}, {"ID": 820, "Title": "Short Encoding of Words", "TitleCn": "\u5355\u8bcd\u7684\u538b\u7f29\u7f16\u7801", "Url": "https://leetcode.cn/problems/short-encoding-of-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 81 Problem 3"}, {"ID": 821, "Title": "Shortest Distance to a Character", "TitleCn": "\u5b57\u7b26\u7684\u6700\u77ed\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/shortest-distance-to-a-character/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 81 Problem 1"}, {"ID": 822, "Title": "Card Flipping Game", "TitleCn": "\u7ffb\u8f6c\u5361\u7247\u6e38\u620f", "Url": "https://leetcode.cn/problems/card-flipping-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 81 Problem 2"}, {"ID": 823, "Title": "Binary Trees With Factors", "TitleCn": "\u5e26\u56e0\u5b50\u7684\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/binary-trees-with-factors/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 81 Problem 4"}, {"ID": 824, "Title": "Goat Latin", "TitleCn": "\u5c71\u7f8a\u62c9\u4e01\u6587", "Url": "https://leetcode.cn/problems/goat-latin/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 82 Problem 1"}, {"ID": 825, "Title": "Friends Of Appropriate Ages", "TitleCn": "\u9002\u9f84\u7684\u670b\u53cb", "Url": "https://leetcode.cn/problems/friends-of-appropriate-ages/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 82 Problem 2"}, {"ID": 826, "Title": "Most Profit Assigning Work", "TitleCn": "\u5b89\u6392\u5de5\u4f5c\u4ee5\u8fbe\u5230\u6700\u5927\u6536\u76ca", "Url": "https://leetcode.cn/problems/most-profit-assigning-work/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 82 Problem 3"}, {"ID": 827, "Title": "Making A Large Island", "TitleCn": "\u6700\u5927\u4eba\u5de5\u5c9b", "Url": "https://leetcode.cn/problems/making-a-large-island/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 82 Problem 4"}, {"ID": 828, "Title": "Count Unique Characters of All Substrings of a Given String", "TitleCn": "\u7edf\u8ba1\u5b50\u4e32\u4e2d\u7684\u552f\u4e00\u5b57\u7b26", "Url": "https://leetcode.cn/problems/count-unique-characters-of-all-substrings-of-a-given-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 83 Problem 4"}, {"ID": 829, "Title": "Consecutive Numbers Sum", "TitleCn": "\u8fde\u7eed\u6574\u6570\u6c42\u548c", "Url": "https://leetcode.cn/problems/consecutive-numbers-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 83 Problem 3"}, {"ID": 830, "Title": "Positions of Large Groups", "TitleCn": "\u8f83\u5927\u5206\u7ec4\u7684\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/positions-of-large-groups/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 83 Problem 1"}, {"ID": 831, "Title": "Masking Personal Information", "TitleCn": "\u9690\u85cf\u4e2a\u4eba\u4fe1\u606f", "Url": "https://leetcode.cn/problems/masking-personal-information/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 83 Problem 2"}, {"ID": 832, "Title": "Flipping an Image", "TitleCn": "\u7ffb\u8f6c\u56fe\u50cf", "Url": "https://leetcode.cn/problems/flipping-an-image/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 84 Problem 1"}, {"ID": 833, "Title": "Find And Replace in String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u7684\u67e5\u627e\u4e0e\u66ff\u6362", "Url": "https://leetcode.cn/problems/find-and-replace-in-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 84 Problem 2"}, {"ID": 834, "Title": "Sum of Distances in Tree", "TitleCn": "\u6811\u4e2d\u8ddd\u79bb\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-distances-in-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 84 Problem 4"}, {"ID": 835, "Title": "Image Overlap", "TitleCn": "\u56fe\u50cf\u91cd\u53e0", "Url": "https://leetcode.cn/problems/image-overlap/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 84 Problem 3"}, {"ID": 836, "Title": "Rectangle Overlap", "TitleCn": "\u77e9\u5f62\u91cd\u53e0", "Url": "https://leetcode.cn/problems/rectangle-overlap/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 85 Problem 1"}, {"ID": 837, "Title": "New 21 Game", "TitleCn": "\u65b021\u70b9", "Url": "https://leetcode.cn/problems/new-21-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 85 Problem 3"}, {"ID": 838, "Title": "Push Dominoes", "TitleCn": "\u63a8\u591a\u7c73\u8bfa", "Url": "https://leetcode.cn/problems/push-dominoes/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 85 Problem 2"}, {"ID": 839, "Title": "Similar String Groups", "TitleCn": "\u76f8\u4f3c\u5b57\u7b26\u4e32\u7ec4", "Url": "https://leetcode.cn/problems/similar-string-groups/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 85 Problem 4"}, {"ID": 840, "Title": "Magic Squares In Grid", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u5e7b\u65b9", "Url": "https://leetcode.cn/problems/magic-squares-in-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 86 Problem 1"}, {"ID": 841, "Title": "Keys and Rooms", "TitleCn": "\u94a5\u5319\u548c\u623f\u95f4", "Url": "https://leetcode.cn/problems/keys-and-rooms/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 86 Problem 2"}, {"ID": 842, "Title": "Split Array into Fibonacci Sequence", "TitleCn": "\u5c06\u6570\u7ec4\u62c6\u5206\u6210\u6590\u6ce2\u90a3\u5951\u5e8f\u5217", "Url": "https://leetcode.cn/problems/split-array-into-fibonacci-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 86 Problem 3"}, {"ID": 843, "Title": "Guess the Word", "TitleCn": "\u731c\u731c\u8fd9\u4e2a\u5355\u8bcd", "Url": "https://leetcode.cn/problems/guess-the-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 86 Problem 4"}, {"ID": 844, "Title": "Backspace String Compare", "TitleCn": "\u6bd4\u8f83\u542b\u9000\u683c\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/backspace-string-compare/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 87 Problem 1"}, {"ID": 845, "Title": "Longest Mountain in Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684\u6700\u957f\u5c71\u8109", "Url": "https://leetcode.cn/problems/longest-mountain-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 87 Problem 2"}, {"ID": 846, "Title": "Hand of Straights", "TitleCn": "\u4e00\u624b\u987a\u5b50", "Url": "https://leetcode.cn/problems/hand-of-straights/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 87 Problem 3"}, {"ID": 847, "Title": "Shortest Path Visiting All Nodes", "TitleCn": "\u8bbf\u95ee\u6240\u6709\u8282\u70b9\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-path-visiting-all-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 87 Problem 4"}, {"ID": 848, "Title": "Shifting Letters", "TitleCn": "\u5b57\u6bcd\u79fb\u4f4d", "Url": "https://leetcode.cn/problems/shifting-letters/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 88 Problem 1"}, {"ID": 849, "Title": "Maximize Distance to Closest Person", "TitleCn": "\u5230\u6700\u8fd1\u7684\u4eba\u7684\u6700\u5927\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/maximize-distance-to-closest-person/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 88 Problem 2"}, {"ID": 850, "Title": "Rectangle Area II", "TitleCn": "\u77e9\u5f62\u9762\u79ef II", "Url": "https://leetcode.cn/problems/rectangle-area-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 88 Problem 4"}, {"ID": 851, "Title": "Loud and Rich", "TitleCn": "\u55a7\u95f9\u548c\u5bcc\u6709", "Url": "https://leetcode.cn/problems/loud-and-rich/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 88 Problem 3"}, {"ID": 852, "Title": "Peak Index in a Mountain Array", "TitleCn": "\u5c71\u8109\u6570\u7ec4\u7684\u5cf0\u9876\u7d22\u5f15", "Url": "https://leetcode.cn/problems/peak-index-in-a-mountain-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 89 Problem 1"}, {"ID": 853, "Title": "Car Fleet", "TitleCn": "\u8f66\u961f", "Url": "https://leetcode.cn/problems/car-fleet/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 89 Problem 2"}, {"ID": 854, "Title": "K-Similar Strings", "TitleCn": "\u76f8\u4f3c\u5ea6\u4e3a K \u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/k-similar-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 89 Problem 4"}, {"ID": 855, "Title": "Exam Room", "TitleCn": "\u8003\u573a\u5c31\u5ea7", "Url": "https://leetcode.cn/problems/exam-room/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 89 Problem 3"}, {"ID": 856, "Title": "Score of Parentheses", "TitleCn": "\u62ec\u53f7\u7684\u5206\u6570", "Url": "https://leetcode.cn/problems/score-of-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 90 Problem 2"}, {"ID": 857, "Title": "Minimum Cost to Hire K Workers", "TitleCn": "\u96c7\u4f63 K \u540d\u5de5\u4eba\u7684\u6700\u4f4e\u6210\u672c", "Url": "https://leetcode.cn/problems/minimum-cost-to-hire-k-workers/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 90 Problem 4"}, {"ID": 858, "Title": "Mirror Reflection", "TitleCn": "\u955c\u9762\u53cd\u5c04", "Url": "https://leetcode.cn/problems/mirror-reflection/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 90 Problem 3"}, {"ID": 859, "Title": "Buddy Strings", "TitleCn": "\u4eb2\u5bc6\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/buddy-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 90 Problem 1"}, {"ID": 860, "Title": "Lemonade Change", "TitleCn": "\u67e0\u6aac\u6c34\u627e\u96f6", "Url": "https://leetcode.cn/problems/lemonade-change/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 91 Problem 1"}, {"ID": 861, "Title": "Score After Flipping Matrix", "TitleCn": "\u7ffb\u8f6c\u77e9\u9635\u540e\u7684\u5f97\u5206", "Url": "https://leetcode.cn/problems/score-after-flipping-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 91 Problem 3"}, {"ID": 862, "Title": "Shortest Subarray with Sum at Least K", "TitleCn": "\u548c\u81f3\u5c11\u4e3a K \u7684\u6700\u77ed\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 91 Problem 4"}, {"ID": 863, "Title": "All Nodes Distance K in Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u6240\u6709\u8ddd\u79bb\u4e3a K \u7684\u7ed3\u70b9", "Url": "https://leetcode.cn/problems/all-nodes-distance-k-in-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 91 Problem 2"}, {"ID": 864, "Title": "Shortest Path to Get All Keys", "TitleCn": "\u83b7\u53d6\u6240\u6709\u94a5\u5319\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-path-to-get-all-keys/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 92 Problem 4"}, {"ID": 865, "Title": "Smallest Subtree with all the Deepest Nodes", "TitleCn": "\u5177\u6709\u6240\u6709\u6700\u6df1\u7ed3\u70b9\u7684\u6700\u5c0f\u5b50\u6811", "Url": "https://leetcode.cn/problems/smallest-subtree-with-all-the-deepest-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 92 Problem 2"}, {"ID": 866, "Title": "Prime Palindrome", "TitleCn": "\u56de\u6587\u8d28\u6570", "Url": "https://leetcode.cn/problems/prime-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 92 Problem 3"}, {"ID": 867, "Title": "Transpose Matrix", "TitleCn": "\u8f6c\u7f6e\u77e9\u9635", "Url": "https://leetcode.cn/problems/transpose-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 92 Problem 1"}, {"ID": 868, "Title": "Binary Gap", "TitleCn": "\u4e8c\u8fdb\u5236\u95f4\u8ddd", "Url": "https://leetcode.cn/problems/binary-gap/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 93 Problem 1"}, {"ID": 869, "Title": "Reordered Power of 2", "TitleCn": "\u91cd\u65b0\u6392\u5e8f\u5f97\u5230 2 \u7684\u5e42", "Url": "https://leetcode.cn/problems/reordered-power-of-2/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 93 Problem 2"}, {"ID": 870, "Title": "Advantage Shuffle", "TitleCn": "\u4f18\u52bf\u6d17\u724c", "Url": "https://leetcode.cn/problems/advantage-shuffle/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 93 Problem 3"}, {"ID": 871, "Title": "Minimum Number of Refueling Stops", "TitleCn": "\u6700\u4f4e\u52a0\u6cb9\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-refueling-stops/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 93 Problem 4"}, {"ID": 872, "Title": "Leaf-Similar Trees", "TitleCn": "\u53f6\u5b50\u76f8\u4f3c\u7684\u6811", "Url": "https://leetcode.cn/problems/leaf-similar-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 94 Problem 1"}, {"ID": 873, "Title": "Length of Longest Fibonacci Subsequence", "TitleCn": "\u6700\u957f\u7684\u6590\u6ce2\u90a3\u5951\u5b50\u5e8f\u5217\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/length-of-longest-fibonacci-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 94 Problem 4"}, {"ID": 874, "Title": "Walking Robot Simulation", "TitleCn": "\u6a21\u62df\u884c\u8d70\u673a\u5668\u4eba", "Url": "https://leetcode.cn/problems/walking-robot-simulation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 94 Problem 2"}, {"ID": 875, "Title": "Koko Eating Bananas", "TitleCn": "\u7231\u5403\u9999\u8549\u7684\u73c2\u73c2", "Url": "https://leetcode.cn/problems/koko-eating-bananas/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 94 Problem 3"}, {"ID": 876, "Title": "Middle of the Linked List", "TitleCn": "\u94fe\u8868\u7684\u4e2d\u95f4\u7ed3\u70b9", "Url": "https://leetcode.cn/problems/middle-of-the-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 95 Problem 1"}, {"ID": 877, "Title": "Stone Game", "TitleCn": "\u77f3\u5b50\u6e38\u620f", "Url": "https://leetcode.cn/problems/stone-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 95 Problem 2"}, {"ID": 878, "Title": "Nth Magical Number", "TitleCn": "\u7b2c N \u4e2a\u795e\u5947\u6570\u5b57", "Url": "https://leetcode.cn/problems/nth-magical-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 95 Problem 3"}, {"ID": 879, "Title": "Profitable Schemes", "TitleCn": "\u76c8\u5229\u8ba1\u5212", "Url": "https://leetcode.cn/problems/profitable-schemes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 95 Problem 4"}, {"ID": 880, "Title": "Decoded String at Index", "TitleCn": "\u7d22\u5f15\u5904\u7684\u89e3\u7801\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/decoded-string-at-index/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 96 Problem 3"}, {"ID": 881, "Title": "Boats to Save People", "TitleCn": "\u6551\u751f\u8247", "Url": "https://leetcode.cn/problems/boats-to-save-people/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 96 Problem 2"}, {"ID": 882, "Title": "Reachable Nodes In Subdivided Graph", "TitleCn": "\u7ec6\u5206\u56fe\u4e2d\u7684\u53ef\u5230\u8fbe\u7ed3\u70b9", "Url": "https://leetcode.cn/problems/reachable-nodes-in-subdivided-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 96 Problem 4"}, {"ID": 883, "Title": "Projection Area of 3D Shapes", "TitleCn": "\u4e09\u7ef4\u5f62\u4f53\u6295\u5f71\u9762\u79ef", "Url": "https://leetcode.cn/problems/projection-area-of-3d-shapes/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 96 Problem 1"}, {"ID": 884, "Title": "Uncommon Words from Two Sentences", "TitleCn": "\u4e24\u53e5\u8bdd\u4e2d\u7684\u4e0d\u5e38\u89c1\u5355\u8bcd", "Url": "https://leetcode.cn/problems/uncommon-words-from-two-sentences/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 97 Problem 1"}, {"ID": 885, "Title": "Spiral Matrix III", "TitleCn": "\u87ba\u65cb\u77e9\u9635 III", "Url": "https://leetcode.cn/problems/spiral-matrix-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 97 Problem 2"}, {"ID": 886, "Title": "Possible Bipartition", "TitleCn": "\u53ef\u80fd\u7684\u4e8c\u5206\u6cd5", "Url": "https://leetcode.cn/problems/possible-bipartition/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 97 Problem 3"}, {"ID": 887, "Title": "Super Egg Drop", "TitleCn": "\u9e21\u86cb\u6389\u843d", "Url": "https://leetcode.cn/problems/super-egg-drop/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 97 Problem 4"}, {"ID": 888, "Title": "Fair Candy Swap", "TitleCn": "\u516c\u5e73\u7684\u7cd6\u679c\u4ea4\u6362", "Url": "https://leetcode.cn/problems/fair-candy-swap/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 98 Problem 1"}, {"ID": 889, "Title": "Construct Binary Tree from Preorder and Postorder Traversal", "TitleCn": "\u6839\u636e\u524d\u5e8f\u548c\u540e\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-postorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 98 Problem 3"}, {"ID": 890, "Title": "Find and Replace Pattern", "TitleCn": "\u67e5\u627e\u548c\u66ff\u6362\u6a21\u5f0f", "Url": "https://leetcode.cn/problems/find-and-replace-pattern/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 98 Problem 2"}, {"ID": 891, "Title": "Sum of Subsequence Widths", "TitleCn": "\u5b50\u5e8f\u5217\u5bbd\u5ea6\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-subsequence-widths/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 98 Problem 4"}, {"ID": 892, "Title": "Surface Area of 3D Shapes", "TitleCn": "\u4e09\u7ef4\u5f62\u4f53\u7684\u8868\u9762\u79ef", "Url": "https://leetcode.cn/problems/surface-area-of-3d-shapes/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 99 Problem 1"}, {"ID": 893, "Title": "Groups of Special-Equivalent Strings", "TitleCn": "\u7279\u6b8a\u7b49\u4ef7\u5b57\u7b26\u4e32\u7ec4", "Url": "https://leetcode.cn/problems/groups-of-special-equivalent-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 99 Problem 3"}, {"ID": 894, "Title": "All Possible Full Binary Trees", "TitleCn": "\u6240\u6709\u53ef\u80fd\u7684\u771f\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/all-possible-full-binary-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 99 Problem 2"}, {"ID": 895, "Title": "Maximum Frequency Stack", "TitleCn": "\u6700\u5927\u9891\u7387\u6808", "Url": "https://leetcode.cn/problems/maximum-frequency-stack/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 99 Problem 4"}, {"ID": 896, "Title": "Monotonic Array", "TitleCn": "\u5355\u8c03\u6570\u5217", "Url": "https://leetcode.cn/problems/monotonic-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 100 Problem 1"}, {"ID": 897, "Title": "Increasing Order Search Tree", "TitleCn": "\u9012\u589e\u987a\u5e8f\u67e5\u627e\u6811", "Url": "https://leetcode.cn/problems/increasing-order-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 100 Problem 3"}, {"ID": 898, "Title": "Bitwise ORs of Subarrays", "TitleCn": "\u5b50\u6570\u7ec4\u6309\u4f4d\u6216\u64cd\u4f5c", "Url": "https://leetcode.cn/problems/bitwise-ors-of-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 100 Problem 2"}, {"ID": 899, "Title": "Orderly Queue", "TitleCn": "\u6709\u5e8f\u961f\u5217", "Url": "https://leetcode.cn/problems/orderly-queue/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 100 Problem 4"}, {"ID": 900, "Title": "RLE Iterator", "TitleCn": "RLE \u8fed\u4ee3\u5668", "Url": "https://leetcode.cn/problems/rle-iterator/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 101 Problem 1"}, {"ID": 901, "Title": "Online Stock Span", "TitleCn": "\u80a1\u7968\u4ef7\u683c\u8de8\u5ea6", "Url": "https://leetcode.cn/problems/online-stock-span/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 101 Problem 2"}, {"ID": 902, "Title": "Numbers At Most N Given Digit Set", "TitleCn": "\u6700\u5927\u4e3a N \u7684\u6570\u5b57\u7ec4\u5408", "Url": "https://leetcode.cn/problems/numbers-at-most-n-given-digit-set/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 101 Problem 3"}, {"ID": 903, "Title": "Valid Permutations for DI Sequence", "TitleCn": "DI \u5e8f\u5217\u7684\u6709\u6548\u6392\u5217", "Url": "https://leetcode.cn/problems/valid-permutations-for-di-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 101 Problem 4"}, {"ID": 904, "Title": "Fruit Into Baskets", "TitleCn": "\u6c34\u679c\u6210\u7bee", "Url": "https://leetcode.cn/problems/fruit-into-baskets/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 102 Problem 2"}, {"ID": 905, "Title": "Sort Array By Parity", "TitleCn": "\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/sort-array-by-parity/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 102 Problem 1"}, {"ID": 906, "Title": "Super Palindromes", "TitleCn": "\u8d85\u7ea7\u56de\u6587\u6570", "Url": "https://leetcode.cn/problems/super-palindromes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 102 Problem 4"}, {"ID": 907, "Title": "Sum of Subarray Minimums", "TitleCn": "\u5b50\u6570\u7ec4\u7684\u6700\u5c0f\u503c\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-subarray-minimums/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 102 Problem 3"}, {"ID": 908, "Title": "Smallest Range I", "TitleCn": "\u6700\u5c0f\u5dee\u503c I", "Url": "https://leetcode.cn/problems/smallest-range-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 103 Problem 1"}, {"ID": 909, "Title": "Snakes and Ladders", "TitleCn": "\u86c7\u68af\u68cb", "Url": "https://leetcode.cn/problems/snakes-and-ladders/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 103 Problem 2"}, {"ID": 910, "Title": "Smallest Range II", "TitleCn": "\u6700\u5c0f\u5dee\u503c II", "Url": "https://leetcode.cn/problems/smallest-range-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 103 Problem 3"}, {"ID": 911, "Title": "Online Election", "TitleCn": "\u5728\u7ebf\u9009\u4e3e", "Url": "https://leetcode.cn/problems/online-election/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 103 Problem 4"}, {"ID": 912, "Title": "Sort an Array", "TitleCn": "\u6392\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/sort-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 913, "Title": "Cat and Mouse", "TitleCn": "\u732b\u548c\u8001\u9f20", "Url": "https://leetcode.cn/problems/cat-and-mouse/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 104 Problem 4"}, {"ID": 914, "Title": "X of a Kind in a Deck of Cards", "TitleCn": "\u5361\u724c\u5206\u7ec4", "Url": "https://leetcode.cn/problems/x-of-a-kind-in-a-deck-of-cards/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 104 Problem 1"}, {"ID": 915, "Title": "Partition Array into Disjoint Intervals", "TitleCn": "\u5206\u5272\u6570\u7ec4", "Url": "https://leetcode.cn/problems/partition-array-into-disjoint-intervals/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 104 Problem 2"}, {"ID": 916, "Title": "Word Subsets", "TitleCn": "\u5355\u8bcd\u5b50\u96c6", "Url": "https://leetcode.cn/problems/word-subsets/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 104 Problem 3"}, {"ID": 917, "Title": "Reverse Only Letters", "TitleCn": "\u4ec5\u4ec5\u53cd\u8f6c\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/reverse-only-letters/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 105 Problem 1"}, {"ID": 918, "Title": "Maximum Sum Circular Subarray", "TitleCn": "\u73af\u5f62\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-circular-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 105 Problem 2"}, {"ID": 919, "Title": "Complete Binary Tree Inserter", "TitleCn": "\u5b8c\u5168\u4e8c\u53c9\u6811\u63d2\u5165\u5668", "Url": "https://leetcode.cn/problems/complete-binary-tree-inserter/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 105 Problem 3"}, {"ID": 920, "Title": "Number of Music Playlists", "TitleCn": "\u64ad\u653e\u5217\u8868\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-music-playlists/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 105 Problem 4"}, {"ID": 921, "Title": "Minimum Add to Make Parentheses Valid", "TitleCn": "\u4f7f\u62ec\u53f7\u6709\u6548\u7684\u6700\u5c11\u6dfb\u52a0", "Url": "https://leetcode.cn/problems/minimum-add-to-make-parentheses-valid/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 106 Problem 2"}, {"ID": 922, "Title": "Sort Array By Parity II", "TitleCn": "\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/sort-array-by-parity-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 106 Problem 1"}, {"ID": 923, "Title": "3Sum With Multiplicity", "TitleCn": "\u4e09\u6570\u4e4b\u548c\u7684\u591a\u79cd\u53ef\u80fd", "Url": "https://leetcode.cn/problems/3sum-with-multiplicity/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 106 Problem 3"}, {"ID": 924, "Title": "Minimize Malware Spread", "TitleCn": "\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad", "Url": "https://leetcode.cn/problems/minimize-malware-spread/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 106 Problem 4"}, {"ID": 925, "Title": "Long Pressed Name", "TitleCn": "\u957f\u6309\u952e\u5165", "Url": "https://leetcode.cn/problems/long-pressed-name/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 107 Problem 1"}, {"ID": 926, "Title": "Flip String to Monotone Increasing", "TitleCn": "\u5c06\u5b57\u7b26\u4e32\u7ffb\u8f6c\u5230\u5355\u8c03\u9012\u589e", "Url": "https://leetcode.cn/problems/flip-string-to-monotone-increasing/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 107 Problem 2"}, {"ID": 927, "Title": "Three Equal Parts", "TitleCn": "\u4e09\u7b49\u5206", "Url": "https://leetcode.cn/problems/three-equal-parts/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 107 Problem 3"}, {"ID": 928, "Title": "Minimize Malware Spread II", "TitleCn": "\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad II", "Url": "https://leetcode.cn/problems/minimize-malware-spread-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 107 Problem 4"}, {"ID": 929, "Title": "Unique Email Addresses", "TitleCn": "\u72ec\u7279\u7684\u7535\u5b50\u90ae\u4ef6\u5730\u5740", "Url": "https://leetcode.cn/problems/unique-email-addresses/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 108 Problem 1"}, {"ID": 930, "Title": "Binary Subarrays With Sum", "TitleCn": "\u548c\u76f8\u540c\u7684\u4e8c\u5143\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/binary-subarrays-with-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 108 Problem 2"}, {"ID": 931, "Title": "Minimum Falling Path Sum", "TitleCn": "\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c", "Url": "https://leetcode.cn/problems/minimum-falling-path-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 108 Problem 3"}, {"ID": 932, "Title": "Beautiful Array", "TitleCn": "\u6f02\u4eae\u6570\u7ec4", "Url": "https://leetcode.cn/problems/beautiful-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 108 Problem 4"}, {"ID": 933, "Title": "Number of Recent Calls", "TitleCn": "\u6700\u8fd1\u7684\u8bf7\u6c42\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-recent-calls/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 109 Problem 1"}, {"ID": 934, "Title": "Shortest Bridge", "TitleCn": "\u6700\u77ed\u7684\u6865", "Url": "https://leetcode.cn/problems/shortest-bridge/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 109 Problem 3"}, {"ID": 935, "Title": "Knight Dialer", "TitleCn": "\u9a91\u58eb\u62e8\u53f7\u5668", "Url": "https://leetcode.cn/problems/knight-dialer/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 109 Problem 2"}, {"ID": 936, "Title": "Stamping The Sequence", "TitleCn": "\u6233\u5370\u5e8f\u5217", "Url": "https://leetcode.cn/problems/stamping-the-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 109 Problem 4"}, {"ID": 937, "Title": "Reorder Data in Log Files", "TitleCn": "\u91cd\u65b0\u6392\u5217\u65e5\u5fd7\u6587\u4ef6", "Url": "https://leetcode.cn/problems/reorder-data-in-log-files/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 110 Problem 1"}, {"ID": 938, "Title": "Range Sum of BST", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u8303\u56f4\u548c", "Url": "https://leetcode.cn/problems/range-sum-of-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 110 Problem 2"}, {"ID": 939, "Title": "Minimum Area Rectangle", "TitleCn": "\u6700\u5c0f\u9762\u79ef\u77e9\u5f62", "Url": "https://leetcode.cn/problems/minimum-area-rectangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 110 Problem 3"}, {"ID": 940, "Title": "Distinct Subsequences II", "TitleCn": "\u4e0d\u540c\u7684\u5b50\u5e8f\u5217 II", "Url": "https://leetcode.cn/problems/distinct-subsequences-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 110 Problem 4"}, {"ID": 941, "Title": "Valid Mountain Array", "TitleCn": "\u6709\u6548\u7684\u5c71\u8109\u6570\u7ec4", "Url": "https://leetcode.cn/problems/valid-mountain-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 111 Problem 1"}, {"ID": 942, "Title": "DI String Match", "TitleCn": "\u589e\u51cf\u5b57\u7b26\u4e32\u5339\u914d", "Url": "https://leetcode.cn/problems/di-string-match/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 111 Problem 3"}, {"ID": 943, "Title": "Find the Shortest Superstring", "TitleCn": "\u6700\u77ed\u8d85\u7ea7\u4e32", "Url": "https://leetcode.cn/problems/find-the-shortest-superstring/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 111 Problem 4"}, {"ID": 944, "Title": "Delete Columns to Make Sorted", "TitleCn": "\u5220\u5217\u9020\u5e8f", "Url": "https://leetcode.cn/problems/delete-columns-to-make-sorted/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 111 Problem 2"}, {"ID": 945, "Title": "Minimum Increment to Make Array Unique", "TitleCn": "\u4f7f\u6570\u7ec4\u552f\u4e00\u7684\u6700\u5c0f\u589e\u91cf", "Url": "https://leetcode.cn/problems/minimum-increment-to-make-array-unique/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 112 Problem 1"}, {"ID": 946, "Title": "Validate Stack Sequences", "TitleCn": "\u9a8c\u8bc1\u6808\u5e8f\u5217", "Url": "https://leetcode.cn/problems/validate-stack-sequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 112 Problem 2"}, {"ID": 947, "Title": "Most Stones Removed with Same Row or Column", "TitleCn": "\u79fb\u9664\u6700\u591a\u7684\u540c\u884c\u6216\u540c\u5217\u77f3\u5934", "Url": "https://leetcode.cn/problems/most-stones-removed-with-same-row-or-column/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 112 Problem 3"}, {"ID": 948, "Title": "Bag of Tokens", "TitleCn": "\u4ee4\u724c\u653e\u7f6e", "Url": "https://leetcode.cn/problems/bag-of-tokens/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 112 Problem 4"}, {"ID": 949, "Title": "Largest Time for Given Digits", "TitleCn": "\u7ed9\u5b9a\u6570\u5b57\u80fd\u7ec4\u6210\u7684\u6700\u5927\u65f6\u95f4", "Url": "https://leetcode.cn/problems/largest-time-for-given-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 113 Problem 1"}, {"ID": 950, "Title": "Reveal Cards In Increasing Order", "TitleCn": "\u6309\u9012\u589e\u987a\u5e8f\u663e\u793a\u5361\u724c", "Url": "https://leetcode.cn/problems/reveal-cards-in-increasing-order/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 113 Problem 3"}, {"ID": 951, "Title": "Flip Equivalent Binary Trees", "TitleCn": "\u7ffb\u8f6c\u7b49\u4ef7\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/flip-equivalent-binary-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 113 Problem 2"}, {"ID": 952, "Title": "Largest Component Size by Common Factor", "TitleCn": "\u6309\u516c\u56e0\u6570\u8ba1\u7b97\u6700\u5927\u7ec4\u4ef6\u5927\u5c0f", "Url": "https://leetcode.cn/problems/largest-component-size-by-common-factor/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 113 Problem 4"}, {"ID": 953, "Title": "Verifying an Alien Dictionary", "TitleCn": "\u9a8c\u8bc1\u5916\u661f\u8bed\u8bcd\u5178", "Url": "https://leetcode.cn/problems/verifying-an-alien-dictionary/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 114 Problem 1"}, {"ID": 954, "Title": "Array of Doubled Pairs", "TitleCn": "\u4e8c\u500d\u6570\u5bf9\u6570\u7ec4", "Url": "https://leetcode.cn/problems/array-of-doubled-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 114 Problem 2"}, {"ID": 955, "Title": "Delete Columns to Make Sorted II", "TitleCn": "\u5220\u5217\u9020\u5e8f II", "Url": "https://leetcode.cn/problems/delete-columns-to-make-sorted-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 114 Problem 3"}, {"ID": 956, "Title": "Tallest Billboard", "TitleCn": "\u6700\u9ad8\u7684\u5e7f\u544a\u724c", "Url": "https://leetcode.cn/problems/tallest-billboard/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 114 Problem 4"}, {"ID": 957, "Title": "Prison Cells After N Days", "TitleCn": "N \u5929\u540e\u7684\u7262\u623f", "Url": "https://leetcode.cn/problems/prison-cells-after-n-days/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 115 Problem 1"}, {"ID": 958, "Title": "Check Completeness of a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5b8c\u5168\u6027\u68c0\u9a8c", "Url": "https://leetcode.cn/problems/check-completeness-of-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 115 Problem 2"}, {"ID": 959, "Title": "Regions Cut By Slashes", "TitleCn": "\u7531\u659c\u6760\u5212\u5206\u533a\u57df", "Url": "https://leetcode.cn/problems/regions-cut-by-slashes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 115 Problem 3"}, {"ID": 960, "Title": "Delete Columns to Make Sorted III", "TitleCn": "\u5220\u5217\u9020\u5e8f III", "Url": "https://leetcode.cn/problems/delete-columns-to-make-sorted-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 115 Problem 4"}, {"ID": 961, "Title": "N-Repeated Element in Size 2N Array", "TitleCn": "\u5728\u957f\u5ea6 2N \u7684\u6570\u7ec4\u4e2d\u627e\u51fa\u91cd\u590d N \u6b21\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/n-repeated-element-in-size-2n-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 116 Problem 1"}, {"ID": 962, "Title": "Maximum Width Ramp", "TitleCn": "\u6700\u5927\u5bbd\u5ea6\u5761", "Url": "https://leetcode.cn/problems/maximum-width-ramp/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 116 Problem 2"}, {"ID": 963, "Title": "Minimum Area Rectangle II", "TitleCn": "\u6700\u5c0f\u9762\u79ef\u77e9\u5f62 II", "Url": "https://leetcode.cn/problems/minimum-area-rectangle-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 116 Problem 3"}, {"ID": 964, "Title": "Least Operators to Express Number", "TitleCn": "\u8868\u793a\u6570\u5b57\u7684\u6700\u5c11\u8fd0\u7b97\u7b26", "Url": "https://leetcode.cn/problems/least-operators-to-express-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 116 Problem 4"}, {"ID": 965, "Title": "Univalued Binary Tree", "TitleCn": "\u5355\u503c\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/univalued-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 117 Problem 1"}, {"ID": 966, "Title": "Vowel Spellchecker", "TitleCn": "\u5143\u97f3\u62fc\u5199\u68c0\u67e5\u5668", "Url": "https://leetcode.cn/problems/vowel-spellchecker/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 117 Problem 3"}, {"ID": 967, "Title": "Numbers With Same Consecutive Differences", "TitleCn": "\u8fde\u7eed\u5dee\u76f8\u540c\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/numbers-with-same-consecutive-differences/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 117 Problem 2"}, {"ID": 968, "Title": "Binary Tree Cameras", "TitleCn": "\u76d1\u63a7\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/binary-tree-cameras/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 117 Problem 4"}, {"ID": 969, "Title": "Pancake Sorting", "TitleCn": "\u714e\u997c\u6392\u5e8f", "Url": "https://leetcode.cn/problems/pancake-sorting/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 118 Problem 2"}, {"ID": 970, "Title": "Powerful Integers", "TitleCn": "\u5f3a\u6574\u6570", "Url": "https://leetcode.cn/problems/powerful-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 118 Problem 1"}, {"ID": 971, "Title": "Flip Binary Tree To Match Preorder Traversal", "TitleCn": "\u7ffb\u8f6c\u4e8c\u53c9\u6811\u4ee5\u5339\u914d\u5148\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/flip-binary-tree-to-match-preorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 118 Problem 3"}, {"ID": 972, "Title": "Equal Rational Numbers", "TitleCn": "\u76f8\u7b49\u7684\u6709\u7406\u6570", "Url": "https://leetcode.cn/problems/equal-rational-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 118 Problem 4"}, {"ID": 973, "Title": "K Closest Points to Origin", "TitleCn": "\u6700\u63a5\u8fd1\u539f\u70b9\u7684 K \u4e2a\u70b9", "Url": "https://leetcode.cn/problems/k-closest-points-to-origin/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 119 Problem 1"}, {"ID": 974, "Title": "Subarray Sums Divisible by K", "TitleCn": "\u548c\u53ef\u88ab K \u6574\u9664\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/subarray-sums-divisible-by-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 119 Problem 3"}, {"ID": 975, "Title": "Odd Even Jump", "TitleCn": "\u5947\u5076\u8df3", "Url": "https://leetcode.cn/problems/odd-even-jump/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 119 Problem 4"}, {"ID": 976, "Title": "Largest Perimeter Triangle", "TitleCn": "\u4e09\u89d2\u5f62\u7684\u6700\u5927\u5468\u957f", "Url": "https://leetcode.cn/problems/largest-perimeter-triangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 119 Problem 2"}, {"ID": 977, "Title": "Squares of a Sorted Array", "TitleCn": "\u6709\u5e8f\u6570\u7ec4\u7684\u5e73\u65b9", "Url": "https://leetcode.cn/problems/squares-of-a-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 120 Problem 1"}, {"ID": 978, "Title": "Longest Turbulent Subarray", "TitleCn": "\u6700\u957f\u6e4d\u6d41\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-turbulent-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 120 Problem 2"}, {"ID": 979, "Title": "Distribute Coins in Binary Tree", "TitleCn": "\u5728\u4e8c\u53c9\u6811\u4e2d\u5206\u914d\u786c\u5e01", "Url": "https://leetcode.cn/problems/distribute-coins-in-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 120 Problem 3"}, {"ID": 980, "Title": "Unique Paths III", "TitleCn": "\u4e0d\u540c\u8def\u5f84 III", "Url": "https://leetcode.cn/problems/unique-paths-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 120 Problem 4"}, {"ID": 981, "Title": "Time Based Key-Value Store", "TitleCn": "\u57fa\u4e8e\u65f6\u95f4\u7684\u952e\u503c\u5b58\u50a8", "Url": "https://leetcode.cn/problems/time-based-key-value-store/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 121 Problem 2"}, {"ID": 982, "Title": "Triples with Bitwise AND Equal To Zero", "TitleCn": "\u6309\u4f4d\u4e0e\u4e3a\u96f6\u7684\u4e09\u5143\u7ec4", "Url": "https://leetcode.cn/problems/triples-with-bitwise-and-equal-to-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 121 Problem 4"}, {"ID": 983, "Title": "Minimum Cost For Tickets", "TitleCn": "\u6700\u4f4e\u7968\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-for-tickets/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 121 Problem 3"}, {"ID": 984, "Title": "String Without AAA or BBB", "TitleCn": "\u4e0d\u542b AAA \u6216 BBB \u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/string-without-aaa-or-bbb/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 121 Problem 1"}, {"ID": 985, "Title": "Sum of Even Numbers After Queries", "TitleCn": "\u67e5\u8be2\u540e\u7684\u5076\u6570\u548c", "Url": "https://leetcode.cn/problems/sum-of-even-numbers-after-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 122 Problem 1"}, {"ID": 986, "Title": "Interval List Intersections", "TitleCn": "\u533a\u95f4\u5217\u8868\u7684\u4ea4\u96c6", "Url": "https://leetcode.cn/problems/interval-list-intersections/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 122 Problem 3"}, {"ID": 987, "Title": "Vertical Order Traversal of a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5782\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/vertical-order-traversal-of-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 122 Problem 4"}, {"ID": 988, "Title": "Smallest String Starting From Leaf", "TitleCn": "\u4ece\u53f6\u7ed3\u70b9\u5f00\u59cb\u7684\u6700\u5c0f\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/smallest-string-starting-from-leaf/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 122 Problem 2"}, {"ID": 989, "Title": "Add to Array-Form of Integer", "TitleCn": "\u6570\u7ec4\u5f62\u5f0f\u7684\u6574\u6570\u52a0\u6cd5", "Url": "https://leetcode.cn/problems/add-to-array-form-of-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 123 Problem 1"}, {"ID": 990, "Title": "Satisfiability of Equality Equations", "TitleCn": "\u7b49\u5f0f\u65b9\u7a0b\u7684\u53ef\u6ee1\u8db3\u6027", "Url": "https://leetcode.cn/problems/satisfiability-of-equality-equations/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 123 Problem 2"}, {"ID": 991, "Title": "Broken Calculator", "TitleCn": "\u574f\u4e86\u7684\u8ba1\u7b97\u5668", "Url": "https://leetcode.cn/problems/broken-calculator/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 123 Problem 3"}, {"ID": 992, "Title": "Subarrays with K Different Integers", "TitleCn": "K \u4e2a\u4e0d\u540c\u6574\u6570\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/subarrays-with-k-different-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 123 Problem 4"}, {"ID": 993, "Title": "Cousins in Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5802\u5144\u5f1f\u8282\u70b9", "Url": "https://leetcode.cn/problems/cousins-in-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 124 Problem 1"}, {"ID": 994, "Title": "Rotting Oranges", "TitleCn": "\u8150\u70c2\u7684\u6a58\u5b50", "Url": "https://leetcode.cn/problems/rotting-oranges/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 124 Problem 2"}, {"ID": 995, "Title": "Minimum Number of K Consecutive Bit Flips", "TitleCn": "K \u8fde\u7eed\u4f4d\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-k-consecutive-bit-flips/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 124 Problem 3"}, {"ID": 996, "Title": "Number of Squareful Arrays", "TitleCn": "\u5e73\u65b9\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-squareful-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 124 Problem 4"}, {"ID": 997, "Title": "Find the Town Judge", "TitleCn": "\u627e\u5230\u5c0f\u9547\u7684\u6cd5\u5b98", "Url": "https://leetcode.cn/problems/find-the-town-judge/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 125 Problem 1"}, {"ID": 998, "Title": "Maximum Binary Tree II", "TitleCn": "\u6700\u5927\u4e8c\u53c9\u6811 II", "Url": "https://leetcode.cn/problems/maximum-binary-tree-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 125 Problem 3"}, {"ID": 999, "Title": "Available Captures for Rook", "TitleCn": "\u53ef\u4ee5\u88ab\u4e00\u6b65\u6355\u83b7\u7684\u68cb\u5b50\u6570", "Url": "https://leetcode.cn/problems/available-captures-for-rook/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 125 Problem 2"}, {"ID": 1000, "Title": "Minimum Cost to Merge Stones", "TitleCn": "\u5408\u5e76\u77f3\u5934\u7684\u6700\u4f4e\u6210\u672c", "Url": "https://leetcode.cn/problems/minimum-cost-to-merge-stones/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 126 Problem 4"}, {"ID": 1001, "Title": "Grid Illumination", "TitleCn": "\u7f51\u683c\u7167\u660e", "Url": "https://leetcode.cn/problems/grid-illumination/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 125 Problem 4"}, {"ID": 1002, "Title": "Find Common Characters", "TitleCn": "\u67e5\u627e\u5e38\u7528\u5b57\u7b26", "Url": "https://leetcode.cn/problems/find-common-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 126 Problem 1"}, {"ID": 1003, "Title": "Check If Word Is Valid After Substitutions", "TitleCn": "\u68c0\u67e5\u66ff\u6362\u540e\u7684\u8bcd\u662f\u5426\u6709\u6548", "Url": "https://leetcode.cn/problems/check-if-word-is-valid-after-substitutions/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 126 Problem 2"}, {"ID": 1004, "Title": "Max Consecutive Ones III", "TitleCn": "\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 III", "Url": "https://leetcode.cn/problems/max-consecutive-ones-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 126 Problem 3"}, {"ID": 1005, "Title": "Maximize Sum Of Array After K Negations", "TitleCn": "K \u6b21\u53d6\u53cd\u540e\u6700\u5927\u5316\u7684\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/maximize-sum-of-array-after-k-negations/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 127 Problem 1"}, {"ID": 1006, "Title": "Clumsy Factorial", "TitleCn": "\u7b28\u9636\u4e58", "Url": "https://leetcode.cn/problems/clumsy-factorial/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 127 Problem 2"}, {"ID": 1007, "Title": "Minimum Domino Rotations For Equal Row", "TitleCn": "\u884c\u76f8\u7b49\u7684\u6700\u5c11\u591a\u7c73\u8bfa\u65cb\u8f6c", "Url": "https://leetcode.cn/problems/minimum-domino-rotations-for-equal-row/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 127 Problem 3"}, {"ID": 1008, "Title": "Construct Binary Search Tree from Preorder Traversal", "TitleCn": "\u524d\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/construct-binary-search-tree-from-preorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 127 Problem 4"}, {"ID": 1009, "Title": "Complement of Base 10 Integer", "TitleCn": "\u5341\u8fdb\u5236\u6574\u6570\u7684\u53cd\u7801", "Url": "https://leetcode.cn/problems/complement-of-base-10-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 128 Problem 1"}, {"ID": 1010, "Title": "Pairs of Songs With Total Durations Divisible by 60", "TitleCn": "\u603b\u6301\u7eed\u65f6\u95f4\u53ef\u88ab 60 \u6574\u9664\u7684\u6b4c\u66f2", "Url": "https://leetcode.cn/problems/pairs-of-songs-with-total-durations-divisible-by-60/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 128 Problem 2"}, {"ID": 1011, "Title": "Capacity To Ship Packages Within D Days", "TitleCn": "\u5728 D \u5929\u5185\u9001\u8fbe\u5305\u88f9\u7684\u80fd\u529b", "Url": "https://leetcode.cn/problems/capacity-to-ship-packages-within-d-days/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 128 Problem 3"}, {"ID": 1012, "Title": "Numbers With Repeated Digits", "TitleCn": "\u81f3\u5c11\u6709 1 \u4f4d\u91cd\u590d\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/numbers-with-repeated-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 128 Problem 4"}, {"ID": 1013, "Title": "Partition Array Into Three Parts With Equal Sum", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u6210\u548c\u76f8\u7b49\u7684\u4e09\u4e2a\u90e8\u5206", "Url": "https://leetcode.cn/problems/partition-array-into-three-parts-with-equal-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 129 Problem 1"}, {"ID": 1014, "Title": "Best Sightseeing Pair", "TitleCn": "\u6700\u4f73\u89c2\u5149\u7ec4\u5408", "Url": "https://leetcode.cn/problems/best-sightseeing-pair/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 129 Problem 3"}, {"ID": 1015, "Title": "Smallest Integer Divisible by K", "TitleCn": "\u53ef\u88ab K \u6574\u9664\u7684\u6700\u5c0f\u6574\u6570", "Url": "https://leetcode.cn/problems/smallest-integer-divisible-by-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 129 Problem 2"}, {"ID": 1016, "Title": "Binary String With Substrings Representing 1 To N", "TitleCn": "\u5b50\u4e32\u80fd\u8868\u793a\u4ece 1 \u5230 N \u6570\u5b57\u7684\u4e8c\u8fdb\u5236\u4e32", "Url": "https://leetcode.cn/problems/binary-string-with-substrings-representing-1-to-n/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 129 Problem 4"}, {"ID": 1017, "Title": "Convert to Base -2", "TitleCn": "\u8d1f\u4e8c\u8fdb\u5236\u8f6c\u6362", "Url": "https://leetcode.cn/problems/convert-to-base-2/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 130 Problem 2"}, {"ID": 1018, "Title": "Binary Prefix Divisible By 5", "TitleCn": "\u53ef\u88ab 5 \u6574\u9664\u7684\u4e8c\u8fdb\u5236\u524d\u7f00", "Url": "https://leetcode.cn/problems/binary-prefix-divisible-by-5/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 130 Problem 1"}, {"ID": 1019, "Title": "Next Greater Node In Linked List", "TitleCn": "\u94fe\u8868\u4e2d\u7684\u4e0b\u4e00\u4e2a\u66f4\u5927\u8282\u70b9", "Url": "https://leetcode.cn/problems/next-greater-node-in-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 130 Problem 3"}, {"ID": 1020, "Title": "Number of Enclaves", "TitleCn": "\u98de\u5730\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-enclaves/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 130 Problem 4"}, {"ID": 1021, "Title": "Remove Outermost Parentheses", "TitleCn": "\u5220\u9664\u6700\u5916\u5c42\u7684\u62ec\u53f7", "Url": "https://leetcode.cn/problems/remove-outermost-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 131 Problem 1"}, {"ID": 1022, "Title": "Sum of Root To Leaf Binary Numbers", "TitleCn": "\u4ece\u6839\u5230\u53f6\u7684\u4e8c\u8fdb\u5236\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-root-to-leaf-binary-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 131 Problem 2"}, {"ID": 1023, "Title": "Camelcase Matching", "TitleCn": "\u9a7c\u5cf0\u5f0f\u5339\u914d", "Url": "https://leetcode.cn/problems/camelcase-matching/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 131 Problem 3"}, {"ID": 1024, "Title": "Video Stitching", "TitleCn": "\u89c6\u9891\u62fc\u63a5", "Url": "https://leetcode.cn/problems/video-stitching/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 131 Problem 4"}, {"ID": 1025, "Title": "Divisor Game", "TitleCn": "\u9664\u6570\u535a\u5f08", "Url": "https://leetcode.cn/problems/divisor-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 132 Problem 1"}, {"ID": 1026, "Title": "Maximum Difference Between Node and Ancestor", "TitleCn": "\u8282\u70b9\u4e0e\u5176\u7956\u5148\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c", "Url": "https://leetcode.cn/problems/maximum-difference-between-node-and-ancestor/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 132 Problem 2"}, {"ID": 1027, "Title": "Longest Arithmetic Subsequence", "TitleCn": "\u6700\u957f\u7b49\u5dee\u6570\u5217", "Url": "https://leetcode.cn/problems/longest-arithmetic-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 132 Problem 3"}, {"ID": 1028, "Title": "Recover a Tree From Preorder Traversal", "TitleCn": "\u4ece\u5148\u5e8f\u904d\u5386\u8fd8\u539f\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/recover-a-tree-from-preorder-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 132 Problem 4"}, {"ID": 1029, "Title": "Two City Scheduling", "TitleCn": "\u4e24\u5730\u8c03\u5ea6", "Url": "https://leetcode.cn/problems/two-city-scheduling/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 133 Problem 1"}, {"ID": 1030, "Title": "Matrix Cells in Distance Order", "TitleCn": "\u8ddd\u79bb\u987a\u5e8f\u6392\u5217\u77e9\u9635\u5355\u5143\u683c", "Url": "https://leetcode.cn/problems/matrix-cells-in-distance-order/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 133 Problem 2"}, {"ID": 1031, "Title": "Maximum Sum of Two Non-Overlapping Subarrays", "TitleCn": "\u4e24\u4e2a\u975e\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-of-two-non-overlapping-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 133 Problem 3"}, {"ID": 1032, "Title": "Stream of Characters", "TitleCn": "\u5b57\u7b26\u6d41", "Url": "https://leetcode.cn/problems/stream-of-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 133 Problem 4"}, {"ID": 1033, "Title": "Moving Stones Until Consecutive", "TitleCn": "\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed", "Url": "https://leetcode.cn/problems/moving-stones-until-consecutive/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 134 Problem 1"}, {"ID": 1034, "Title": "Coloring A Border", "TitleCn": "\u8fb9\u6846\u7740\u8272", "Url": "https://leetcode.cn/problems/coloring-a-border/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 134 Problem 2"}, {"ID": 1035, "Title": "Uncrossed Lines", "TitleCn": "\u4e0d\u76f8\u4ea4\u7684\u7ebf", "Url": "https://leetcode.cn/problems/uncrossed-lines/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 134 Problem 3"}, {"ID": 1036, "Title": "Escape a Large Maze", "TitleCn": "\u9003\u79bb\u5927\u8ff7\u5bab", "Url": "https://leetcode.cn/problems/escape-a-large-maze/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 134 Problem 4"}, {"ID": 1037, "Title": "Valid Boomerang", "TitleCn": "\u6709\u6548\u7684\u56de\u65cb\u9556", "Url": "https://leetcode.cn/problems/valid-boomerang/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 135 Problem 1"}, {"ID": 1038, "Title": "Binary Search Tree to Greater Sum Tree", "TitleCn": "\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811", "Url": "https://leetcode.cn/problems/binary-search-tree-to-greater-sum-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 135 Problem 2"}, {"ID": 1039, "Title": "Minimum Score Triangulation of Polygon", "TitleCn": "\u591a\u8fb9\u5f62\u4e09\u89d2\u5256\u5206\u7684\u6700\u4f4e\u5f97\u5206", "Url": "https://leetcode.cn/problems/minimum-score-triangulation-of-polygon/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 135 Problem 3"}, {"ID": 1040, "Title": "Moving Stones Until Consecutive II", "TitleCn": "\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed II", "Url": "https://leetcode.cn/problems/moving-stones-until-consecutive-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 135 Problem 4"}, {"ID": 1041, "Title": "Robot Bounded In Circle", "TitleCn": "\u56f0\u4e8e\u73af\u4e2d\u7684\u673a\u5668\u4eba", "Url": "https://leetcode.cn/problems/robot-bounded-in-circle/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 136 Problem 1"}, {"ID": 1042, "Title": "Flower Planting With No Adjacent", "TitleCn": "\u4e0d\u90bb\u63a5\u690d\u82b1", "Url": "https://leetcode.cn/problems/flower-planting-with-no-adjacent/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 136 Problem 2"}, {"ID": 1043, "Title": "Partition Array for Maximum Sum", "TitleCn": "\u5206\u9694\u6570\u7ec4\u4ee5\u5f97\u5230\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/partition-array-for-maximum-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 136 Problem 3"}, {"ID": 1044, "Title": "Longest Duplicate Substring", "TitleCn": "\u6700\u957f\u91cd\u590d\u5b50\u4e32", "Url": "https://leetcode.cn/problems/longest-duplicate-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 136 Problem 4"}, {"ID": 1045, "Title": "Customers Who Bought All Products", "TitleCn": "\u4e70\u4e0b\u6240\u6709\u4ea7\u54c1\u7684\u5ba2\u6237", "Url": "https://leetcode.cn/problems/customers-who-bought-all-products/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1046, "Title": "Last Stone Weight", "TitleCn": "\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf", "Url": "https://leetcode.cn/problems/last-stone-weight/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 137 Problem 1"}, {"ID": 1047, "Title": "Remove All Adjacent Duplicates In String", "TitleCn": "\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879", "Url": "https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 137 Problem 2"}, {"ID": 1048, "Title": "Longest String Chain", "TitleCn": "\u6700\u957f\u5b57\u7b26\u4e32\u94fe", "Url": "https://leetcode.cn/problems/longest-string-chain/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 137 Problem 3"}, {"ID": 1049, "Title": "Last Stone Weight II", "TitleCn": "\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf II", "Url": "https://leetcode.cn/problems/last-stone-weight-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 137 Problem 4"}, {"ID": 1050, "Title": "Actors and Directors Who Cooperated At Least Three Times", "TitleCn": "\u5408\u4f5c\u8fc7\u81f3\u5c11\u4e09\u6b21\u7684\u6f14\u5458\u548c\u5bfc\u6f14", "Url": "https://leetcode.cn/problems/actors-and-directors-who-cooperated-at-least-three-times/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1051, "Title": "Height Checker", "TitleCn": "\u9ad8\u5ea6\u68c0\u67e5\u5668", "Url": "https://leetcode.cn/problems/height-checker/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 138 Problem 1"}, {"ID": 1052, "Title": "Grumpy Bookstore Owner", "TitleCn": "\u7231\u751f\u6c14\u7684\u4e66\u5e97\u8001\u677f", "Url": "https://leetcode.cn/problems/grumpy-bookstore-owner/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 138 Problem 2"}, {"ID": 1053, "Title": "Previous Permutation With One Swap", "TitleCn": "\u4ea4\u6362\u4e00\u6b21\u7684\u5148\u524d\u6392\u5217", "Url": "https://leetcode.cn/problems/previous-permutation-with-one-swap/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 138 Problem 3"}, {"ID": 1054, "Title": "Distant Barcodes", "TitleCn": "\u8ddd\u79bb\u76f8\u7b49\u7684\u6761\u5f62\u7801", "Url": "https://leetcode.cn/problems/distant-barcodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 138 Problem 4"}, {"ID": 1055, "Title": "Shortest Way to Form String", "TitleCn": "\u5f62\u6210\u5b57\u7b26\u4e32\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-way-to-form-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1056, "Title": "Confusing Number", "TitleCn": "\u6613\u6df7\u6dc6\u6570", "Url": "https://leetcode.cn/problems/confusing-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "LCP 2019 Spring Preliminary Problem 1"}, {"ID": 1057, "Title": "Campus Bikes", "TitleCn": "\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d", "Url": "https://leetcode.cn/problems/campus-bikes/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "LCP 2019 Spring Preliminary Problem 2"}, {"ID": 1058, "Title": "Minimize Rounding Error to Meet Target", "TitleCn": "\u6700\u5c0f\u5316\u820d\u5165\u8bef\u5dee\u4ee5\u6ee1\u8db3\u76ee\u6807", "Url": "https://leetcode.cn/problems/minimize-rounding-error-to-meet-target/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "LCP 2019 Spring Preliminary Problem 3"}, {"ID": 1059, "Title": "All Paths from Source Lead to Destination", "TitleCn": "\u4ece\u59cb\u70b9\u5230\u7ec8\u70b9\u7684\u6240\u6709\u8def\u5f84", "Url": "https://leetcode.cn/problems/all-paths-from-source-lead-to-destination/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "LCP 2019 Spring Preliminary Problem 4"}, {"ID": 1060, "Title": "Missing Element in Sorted Array", "TitleCn": "\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u7f3a\u5931\u5143\u7d20", "Url": "https://leetcode.cn/problems/missing-element-in-sorted-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": "LCP 2019 Spring Final Problem 1"}, {"ID": 1061, "Title": "Lexicographically Smallest Equivalent String", "TitleCn": "\u6309\u5b57\u5178\u5e8f\u6392\u5217\u6700\u5c0f\u7684\u7b49\u6548\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-smallest-equivalent-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "LCP 2019 Spring Final Problem 2"}, {"ID": 1062, "Title": "Longest Repeating Substring", "TitleCn": "\u6700\u957f\u91cd\u590d\u5b50\u4e32", "Url": "https://leetcode.cn/problems/longest-repeating-substring/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "LCP 2019 Spring Final Problem 3"}, {"ID": 1063, "Title": "Number of Valid Subarrays", "TitleCn": "\u6709\u6548\u5b50\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-valid-subarrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "LCP 2019 Spring Final Problem 4"}, {"ID": 1064, "Title": "Fixed Point", "TitleCn": "\u4e0d\u52a8\u70b9", "Url": "https://leetcode.cn/problems/fixed-point/", "Ispaid": 1, "Type": "Algorithms", "Level": 1, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 1 Problem 1"}, {"ID": 1065, "Title": "Index Pairs of a String", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u7d22\u5f15\u5bf9", "Url": "https://leetcode.cn/problems/index-pairs-of-a-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 1 Problem 2"}, {"ID": 1066, "Title": "Campus Bikes II", "TitleCn": "\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d II", "Url": "https://leetcode.cn/problems/campus-bikes-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 1 Problem 3"}, {"ID": 1067, "Title": "Digit Count in Range", "TitleCn": "\u8303\u56f4\u5185\u7684\u6570\u5b57\u8ba1\u6570", "Url": "https://leetcode.cn/problems/digit-count-in-range/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 1 Problem 4"}, {"ID": 1068, "Title": "Product Sales Analysis I", "TitleCn": "\u4ea7\u54c1\u9500\u552e\u5206\u6790 I", "Url": "https://leetcode.cn/problems/product-sales-analysis-i/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1069, "Title": "Product Sales Analysis II", "TitleCn": "\u4ea7\u54c1\u9500\u552e\u5206\u6790 II", "Url": "https://leetcode.cn/problems/product-sales-analysis-ii/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1070, "Title": "Product Sales Analysis III", "TitleCn": "\u4ea7\u54c1\u9500\u552e\u5206\u6790 III", "Url": "https://leetcode.cn/problems/product-sales-analysis-iii/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1071, "Title": "Greatest Common Divisor of Strings", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u6700\u5927\u516c\u56e0\u5b50", "Url": "https://leetcode.cn/problems/greatest-common-divisor-of-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 139 Problem 1"}, {"ID": 1072, "Title": "Flip Columns For Maximum Number of Equal Rows", "TitleCn": "\u6309\u5217\u7ffb\u8f6c\u5f97\u5230\u6700\u5927\u503c\u7b49\u884c\u6570", "Url": "https://leetcode.cn/problems/flip-columns-for-maximum-number-of-equal-rows/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 139 Problem 2"}, {"ID": 1073, "Title": "Adding Two Negabinary Numbers", "TitleCn": "\u8d1f\u4e8c\u8fdb\u5236\u6570\u76f8\u52a0", "Url": "https://leetcode.cn/problems/adding-two-negabinary-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 139 Problem 3"}, {"ID": 1074, "Title": "Number of Submatrices That Sum to Target", "TitleCn": "\u5143\u7d20\u548c\u4e3a\u76ee\u6807\u503c\u7684\u5b50\u77e9\u9635\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-submatrices-that-sum-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 139 Problem 4"}, {"ID": 1075, "Title": "Project Employees I", "TitleCn": "\u9879\u76ee\u5458\u5de5 I", "Url": "https://leetcode.cn/problems/project-employees-i/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1076, "Title": "Project Employees II", "TitleCn": "\u9879\u76ee\u5458\u5de5II", "Url": "https://leetcode.cn/problems/project-employees-ii/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1077, "Title": "Project Employees III", "TitleCn": "\u9879\u76ee\u5458\u5de5 III", "Url": "https://leetcode.cn/problems/project-employees-iii/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1078, "Title": "Occurrences After Bigram", "TitleCn": "Bigram \u5206\u8bcd", "Url": "https://leetcode.cn/problems/occurrences-after-bigram/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 140 Problem 1"}, {"ID": 1079, "Title": "Letter Tile Possibilities", "TitleCn": "\u6d3b\u5b57\u5370\u5237", "Url": "https://leetcode.cn/problems/letter-tile-possibilities/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 140 Problem 2"}, {"ID": 1080, "Title": "Insufficient Nodes in Root to Leaf Paths", "TitleCn": "\u6839\u5230\u53f6\u8def\u5f84\u4e0a\u7684\u4e0d\u8db3\u8282\u70b9", "Url": "https://leetcode.cn/problems/insufficient-nodes-in-root-to-leaf-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 140 Problem 3"}, {"ID": 1081, "Title": "Smallest Subsequence of Distinct Characters", "TitleCn": "\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u5c0f\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/smallest-subsequence-of-distinct-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 140 Problem 4"}, {"ID": 1082, "Title": "Sales Analysis I", "TitleCn": "\u9500\u552e\u5206\u6790 I ", "Url": "https://leetcode.cn/problems/sales-analysis-i/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1083, "Title": "Sales Analysis II", "TitleCn": "\u9500\u552e\u5206\u6790 II", "Url": "https://leetcode.cn/problems/sales-analysis-ii/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1084, "Title": "Sales Analysis III", "TitleCn": "\u9500\u552e\u5206\u6790III", "Url": "https://leetcode.cn/problems/sales-analysis-iii/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1085, "Title": "Sum of Digits in the Minimum Number", "TitleCn": "\u6700\u5c0f\u5143\u7d20\u5404\u6570\u4f4d\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-digits-in-the-minimum-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 2 Problem 1"}, {"ID": 1086, "Title": "High Five", "TitleCn": "\u524d\u4e94\u79d1\u7684\u5747\u5206", "Url": "https://leetcode.cn/problems/high-five/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 2 Problem 2"}, {"ID": 1087, "Title": "Brace Expansion", "TitleCn": "\u82b1\u62ec\u53f7\u5c55\u5f00", "Url": "https://leetcode.cn/problems/brace-expansion/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 2 Problem 3"}, {"ID": 1088, "Title": "Confusing Number II", "TitleCn": "\u6613\u6df7\u6dc6\u6570 II", "Url": "https://leetcode.cn/problems/confusing-number-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 2 Problem 4"}, {"ID": 1089, "Title": "Duplicate Zeros", "TitleCn": "\u590d\u5199\u96f6", "Url": "https://leetcode.cn/problems/duplicate-zeros/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 141 Problem 1"}, {"ID": 1090, "Title": "Largest Values From Labels", "TitleCn": "\u53d7\u6807\u7b7e\u5f71\u54cd\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/largest-values-from-labels/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 141 Problem 2"}, {"ID": 1091, "Title": "Shortest Path in Binary Matrix", "TitleCn": "\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-path-in-binary-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 141 Problem 3"}, {"ID": 1092, "Title": "Shortest Common Supersequence", "TitleCn": "\u6700\u77ed\u516c\u5171\u8d85\u5e8f\u5217", "Url": "https://leetcode.cn/problems/shortest-common-supersequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 141 Problem 4"}, {"ID": 1093, "Title": "Statistics from a Large Sample", "TitleCn": "\u5927\u6837\u672c\u7edf\u8ba1", "Url": "https://leetcode.cn/problems/statistics-from-a-large-sample/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 142 Problem 1"}, {"ID": 1094, "Title": "Car Pooling", "TitleCn": "\u62fc\u8f66", "Url": "https://leetcode.cn/problems/car-pooling/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 142 Problem 2"}, {"ID": 1095, "Title": "Find in Mountain Array", "TitleCn": "\u5c71\u8109\u6570\u7ec4\u4e2d\u67e5\u627e\u76ee\u6807\u503c", "Url": "https://leetcode.cn/problems/find-in-mountain-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 142 Problem 3"}, {"ID": 1096, "Title": "Brace Expansion II", "TitleCn": "\u82b1\u62ec\u53f7\u5c55\u5f00 II", "Url": "https://leetcode.cn/problems/brace-expansion-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 142 Problem 4"}, {"ID": 1097, "Title": "Game Play Analysis V", "TitleCn": "\u6e38\u620f\u73a9\u6cd5\u5206\u6790 V", "Url": "https://leetcode.cn/problems/game-play-analysis-v/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1098, "Title": "Unpopular Books", "TitleCn": "\u5c0f\u4f17\u4e66\u7c4d", "Url": "https://leetcode.cn/problems/unpopular-books/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1099, "Title": "Two Sum Less Than K", "TitleCn": "\u5c0f\u4e8e K \u7684\u4e24\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/two-sum-less-than-k/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 3 Problem 1"}, {"ID": 1100, "Title": "Find K-Length Substrings With No Repeated Characters", "TitleCn": "\u957f\u5ea6\u4e3a K \u7684\u65e0\u91cd\u590d\u5b57\u7b26\u5b50\u4e32", "Url": "https://leetcode.cn/problems/find-k-length-substrings-with-no-repeated-characters/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 3 Problem 2"}, {"ID": 1101, "Title": "The Earliest Moment When Everyone Become Friends", "TitleCn": "\u5f7c\u6b64\u719f\u8bc6\u7684\u6700\u65e9\u65f6\u95f4", "Url": "https://leetcode.cn/problems/the-earliest-moment-when-everyone-become-friends/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 3 Problem 3"}, {"ID": 1102, "Title": "Path With Maximum Minimum Value", "TitleCn": "\u5f97\u5206\u6700\u9ad8\u7684\u8def\u5f84", "Url": "https://leetcode.cn/problems/path-with-maximum-minimum-value/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 3 Problem 4"}, {"ID": 1103, "Title": "Distribute Candies to People", "TitleCn": "\u5206\u7cd6\u679c II", "Url": "https://leetcode.cn/problems/distribute-candies-to-people/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 143 Problem 1"}, {"ID": 1104, "Title": "Path In Zigzag Labelled Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u5bfb\u8def", "Url": "https://leetcode.cn/problems/path-in-zigzag-labelled-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 143 Problem 2"}, {"ID": 1105, "Title": "Filling Bookcase Shelves", "TitleCn": "\u586b\u5145\u4e66\u67b6", "Url": "https://leetcode.cn/problems/filling-bookcase-shelves/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 143 Problem 3"}, {"ID": 1106, "Title": "Parsing A Boolean Expression", "TitleCn": "\u89e3\u6790\u5e03\u5c14\u8868\u8fbe\u5f0f", "Url": "https://leetcode.cn/problems/parsing-a-boolean-expression/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 143 Problem 4"}, {"ID": 1107, "Title": "New Users Daily Count", "TitleCn": "\u6bcf\u65e5\u65b0\u7528\u6237\u7edf\u8ba1", "Url": "https://leetcode.cn/problems/new-users-daily-count/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1108, "Title": "Defanging an IP Address", "TitleCn": "IP \u5730\u5740\u65e0\u6548\u5316", "Url": "https://leetcode.cn/problems/defanging-an-ip-address/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 144 Problem 1"}, {"ID": 1109, "Title": "Corporate Flight Bookings", "TitleCn": "\u822a\u73ed\u9884\u8ba2\u7edf\u8ba1", "Url": "https://leetcode.cn/problems/corporate-flight-bookings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 144 Problem 2"}, {"ID": 1110, "Title": "Delete Nodes And Return Forest", "TitleCn": "\u5220\u70b9\u6210\u6797", "Url": "https://leetcode.cn/problems/delete-nodes-and-return-forest/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 144 Problem 3"}, {"ID": 1111, "Title": "Maximum Nesting Depth of Two Valid Parentheses Strings", "TitleCn": "\u6709\u6548\u62ec\u53f7\u7684\u5d4c\u5957\u6df1\u5ea6", "Url": "https://leetcode.cn/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 144 Problem 4"}, {"ID": 1112, "Title": "Highest Grade For Each Student", "TitleCn": "\u6bcf\u4f4d\u5b66\u751f\u7684\u6700\u9ad8\u6210\u7ee9", "Url": "https://leetcode.cn/problems/highest-grade-for-each-student/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1113, "Title": "Reported Posts", "TitleCn": "\u62a5\u544a\u7684\u8bb0\u5f55", "Url": "https://leetcode.cn/problems/reported-posts/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1114, "Title": "Print in Order", "TitleCn": "\u6309\u5e8f\u6253\u5370", "Url": "https://leetcode.cn/problems/print-in-order/", "Ispaid": 0, "Type": "Concurrency", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1115, "Title": "Print FooBar Alternately", "TitleCn": "\u4ea4\u66ff\u6253\u5370FooBar", "Url": "https://leetcode.cn/problems/print-foobar-alternately/", "Ispaid": 0, "Type": "Concurrency", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1116, "Title": "Print Zero Even Odd", "TitleCn": "\u6253\u5370\u96f6\u4e0e\u5947\u5076\u6570", "Url": "https://leetcode.cn/problems/print-zero-even-odd/", "Ispaid": 0, "Type": "Concurrency", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1117, "Title": "Building H2O", "TitleCn": "H2O \u751f\u6210", "Url": "https://leetcode.cn/problems/building-h2o/", "Ispaid": 0, "Type": "Concurrency", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1118, "Title": "Number of Days in a Month", "TitleCn": "\u4e00\u6708\u6709\u591a\u5c11\u5929", "Url": "https://leetcode.cn/problems/number-of-days-in-a-month/", "Ispaid": 1, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 4 Problem 1"}, {"ID": 1119, "Title": "Remove Vowels from a String", "TitleCn": "\u5220\u53bb\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3", "Url": "https://leetcode.cn/problems/remove-vowels-from-a-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 4 Problem 2"}, {"ID": 1120, "Title": "Maximum Average Subtree", "TitleCn": "\u5b50\u6811\u7684\u6700\u5927\u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/maximum-average-subtree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 4 Problem 3"}, {"ID": 1121, "Title": "Divide Array Into Increasing Sequences", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u6210\u51e0\u4e2a\u9012\u589e\u5e8f\u5217", "Url": "https://leetcode.cn/problems/divide-array-into-increasing-sequences/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 4 Problem 4"}, {"ID": 1122, "Title": "Relative Sort Array", "TitleCn": "\u6570\u7ec4\u7684\u76f8\u5bf9\u6392\u5e8f", "Url": "https://leetcode.cn/problems/relative-sort-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 145 Problem 1"}, {"ID": 1123, "Title": "Lowest Common Ancestor of Deepest Leaves", "TitleCn": "\u6700\u6df1\u53f6\u8282\u70b9\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148", "Url": "https://leetcode.cn/problems/lowest-common-ancestor-of-deepest-leaves/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 145 Problem 2"}, {"ID": 1124, "Title": "Longest Well-Performing Interval", "TitleCn": "\u8868\u73b0\u826f\u597d\u7684\u6700\u957f\u65f6\u95f4\u6bb5", "Url": "https://leetcode.cn/problems/longest-well-performing-interval/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 145 Problem 3"}, {"ID": 1125, "Title": "Smallest Sufficient Team", "TitleCn": "\u6700\u5c0f\u7684\u5fc5\u8981\u56e2\u961f", "Url": "https://leetcode.cn/problems/smallest-sufficient-team/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 145 Problem 4"}, {"ID": 1126, "Title": "Active Businesses", "TitleCn": "\u67e5\u8be2\u6d3b\u8dc3\u4e1a\u52a1", "Url": "https://leetcode.cn/problems/active-businesses/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1127, "Title": "User Purchase Platform", "TitleCn": "\u7528\u6237\u8d2d\u4e70\u5e73\u53f0", "Url": "https://leetcode.cn/problems/user-purchase-platform/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1128, "Title": "Number of Equivalent Domino Pairs", "TitleCn": "\u7b49\u4ef7\u591a\u7c73\u8bfa\u9aa8\u724c\u5bf9\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-equivalent-domino-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 146 Problem 1"}, {"ID": 1129, "Title": "Shortest Path with Alternating Colors", "TitleCn": "\u989c\u8272\u4ea4\u66ff\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-path-with-alternating-colors/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 146 Problem 2"}, {"ID": 1130, "Title": "Minimum Cost Tree From Leaf Values", "TitleCn": "\u53f6\u503c\u7684\u6700\u5c0f\u4ee3\u4ef7\u751f\u6210\u6811", "Url": "https://leetcode.cn/problems/minimum-cost-tree-from-leaf-values/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 146 Problem 3"}, {"ID": 1131, "Title": "Maximum of Absolute Value Expression", "TitleCn": "\u7edd\u5bf9\u503c\u8868\u8fbe\u5f0f\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/maximum-of-absolute-value-expression/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 146 Problem 4"}, {"ID": 1132, "Title": "Reported Posts II", "TitleCn": "\u62a5\u544a\u7684\u8bb0\u5f55 II", "Url": "https://leetcode.cn/problems/reported-posts-ii/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1133, "Title": "Largest Unique Number", "TitleCn": "\u6700\u5927\u552f\u4e00\u6570", "Url": "https://leetcode.cn/problems/largest-unique-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 5 Problem 1"}, {"ID": 1134, "Title": "Armstrong Number", "TitleCn": "\u963f\u59c6\u65af\u7279\u6717\u6570", "Url": "https://leetcode.cn/problems/armstrong-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 5 Problem 2"}, {"ID": 1135, "Title": "Connecting Cities With Minimum Cost", "TitleCn": "\u6700\u4f4e\u6210\u672c\u8fde\u901a\u6240\u6709\u57ce\u5e02", "Url": "https://leetcode.cn/problems/connecting-cities-with-minimum-cost/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 5 Problem 3"}, {"ID": 1136, "Title": "Parallel Courses", "TitleCn": "\u5e76\u884c\u8bfe\u7a0b", "Url": "https://leetcode.cn/problems/parallel-courses/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 5 Problem 4"}, {"ID": 1137, "Title": "N-th Tribonacci Number", "TitleCn": "\u7b2c N \u4e2a\u6cf0\u6ce2\u90a3\u5951\u6570", "Url": "https://leetcode.cn/problems/n-th-tribonacci-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 147 Problem 1"}, {"ID": 1138, "Title": "Alphabet Board Path", "TitleCn": "\u5b57\u6bcd\u677f\u4e0a\u7684\u8def\u5f84", "Url": "https://leetcode.cn/problems/alphabet-board-path/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 147 Problem 2"}, {"ID": 1139, "Title": "Largest 1-Bordered Square", "TitleCn": "\u6700\u5927\u7684\u4ee5 1 \u4e3a\u8fb9\u754c\u7684\u6b63\u65b9\u5f62", "Url": "https://leetcode.cn/problems/largest-1-bordered-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 147 Problem 3"}, {"ID": 1140, "Title": "Stone Game II", "TitleCn": "\u77f3\u5b50\u6e38\u620f II", "Url": "https://leetcode.cn/problems/stone-game-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 147 Problem 4"}, {"ID": 1141, "Title": "User Activity for the Past 30 Days I", "TitleCn": "\u67e5\u8be2\u8fd130\u5929\u6d3b\u8dc3\u7528\u6237\u6570", "Url": "https://leetcode.cn/problems/user-activity-for-the-past-30-days-i/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1142, "Title": "User Activity for the Past 30 Days II", "TitleCn": "\u8fc7\u53bb30\u5929\u7684\u7528\u6237\u6d3b\u52a8 II", "Url": "https://leetcode.cn/problems/user-activity-for-the-past-30-days-ii/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1143, "Title": "Longest Common Subsequence", "TitleCn": "\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-common-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1144, "Title": "Decrease Elements To Make Array Zigzag", "TitleCn": "\u9012\u51cf\u5143\u7d20\u4f7f\u6570\u7ec4\u5448\u952f\u9f7f\u72b6", "Url": "https://leetcode.cn/problems/decrease-elements-to-make-array-zigzag/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 148 Problem 1"}, {"ID": 1145, "Title": "Binary Tree Coloring Game", "TitleCn": "\u4e8c\u53c9\u6811\u7740\u8272\u6e38\u620f", "Url": "https://leetcode.cn/problems/binary-tree-coloring-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 148 Problem 2"}, {"ID": 1146, "Title": "Snapshot Array", "TitleCn": "\u5feb\u7167\u6570\u7ec4", "Url": "https://leetcode.cn/problems/snapshot-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 148 Problem 3"}, {"ID": 1147, "Title": "Longest Chunked Palindrome Decomposition", "TitleCn": "\u6bb5\u5f0f\u56de\u6587", "Url": "https://leetcode.cn/problems/longest-chunked-palindrome-decomposition/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 148 Problem 4"}, {"ID": 1148, "Title": "Article Views I", "TitleCn": "\u6587\u7ae0\u6d4f\u89c8 I", "Url": "https://leetcode.cn/problems/article-views-i/", "Ispaid": 0, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1149, "Title": "Article Views II", "TitleCn": "\u6587\u7ae0\u6d4f\u89c8 II", "Url": "https://leetcode.cn/problems/article-views-ii/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1150, "Title": "Check If a Number Is Majority Element in a Sorted Array", "TitleCn": "\u68c0\u67e5\u4e00\u4e2a\u6570\u662f\u5426\u5728\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570", "Url": "https://leetcode.cn/problems/check-if-a-number-is-majority-element-in-a-sorted-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 6 Problem 1"}, {"ID": 1151, "Title": "Minimum Swaps to Group All 1's Together", "TitleCn": "\u6700\u5c11\u4ea4\u6362\u6b21\u6570\u6765\u7ec4\u5408\u6240\u6709\u7684 1", "Url": "https://leetcode.cn/problems/minimum-swaps-to-group-all-1s-together/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 6 Problem 2"}, {"ID": 1152, "Title": "Analyze User Website Visit Pattern", "TitleCn": "\u7528\u6237\u7f51\u7ad9\u8bbf\u95ee\u884c\u4e3a\u5206\u6790", "Url": "https://leetcode.cn/problems/analyze-user-website-visit-pattern/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 6 Problem 3"}, {"ID": 1153, "Title": "String Transforms Into Another String", "TitleCn": "\u5b57\u7b26\u4e32\u8f6c\u5316", "Url": "https://leetcode.cn/problems/string-transforms-into-another-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 6 Problem 4"}, {"ID": 1154, "Title": "Day of the Year", "TitleCn": "\u4e00\u5e74\u4e2d\u7684\u7b2c\u51e0\u5929", "Url": "https://leetcode.cn/problems/day-of-the-year/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 149 Problem 1"}, {"ID": 1155, "Title": "Number of Dice Rolls With Target Sum", "TitleCn": "\u63b7\u9ab0\u5b50\u7b49\u4e8e\u76ee\u6807\u548c\u7684\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/number-of-dice-rolls-with-target-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 149 Problem 2"}, {"ID": 1156, "Title": "Swap For Longest Repeated Character Substring", "TitleCn": "\u5355\u5b57\u7b26\u91cd\u590d\u5b50\u4e32\u7684\u6700\u5927\u957f\u5ea6", "Url": "https://leetcode.cn/problems/swap-for-longest-repeated-character-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 149 Problem 3"}, {"ID": 1157, "Title": "Online Majority Element In Subarray", "TitleCn": "\u5b50\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/online-majority-element-in-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 149 Problem 4"}, {"ID": 1158, "Title": "Market Analysis I", "TitleCn": "\u5e02\u573a\u5206\u6790 I", "Url": "https://leetcode.cn/problems/market-analysis-i/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1159, "Title": "Market Analysis II", "TitleCn": "\u5e02\u573a\u5206\u6790 II", "Url": "https://leetcode.cn/problems/market-analysis-ii/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1160, "Title": "Find Words That Can Be Formed by Characters", "TitleCn": "\u62fc\u5199\u5355\u8bcd", "Url": "https://leetcode.cn/problems/find-words-that-can-be-formed-by-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 150 Problem 1"}, {"ID": 1161, "Title": "Maximum Level Sum of a Binary Tree", "TitleCn": "\u6700\u5927\u5c42\u5185\u5143\u7d20\u548c", "Url": "https://leetcode.cn/problems/maximum-level-sum-of-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 150 Problem 2"}, {"ID": 1162, "Title": "As Far from Land as Possible", "TitleCn": "\u5730\u56fe\u5206\u6790", "Url": "https://leetcode.cn/problems/as-far-from-land-as-possible/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 150 Problem 3"}, {"ID": 1163, "Title": "Last Substring in Lexicographical Order", "TitleCn": "\u6309\u5b57\u5178\u5e8f\u6392\u5728\u6700\u540e\u7684\u5b50\u4e32", "Url": "https://leetcode.cn/problems/last-substring-in-lexicographical-order/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 150 Problem 4"}, {"ID": 1164, "Title": "Product Price at a Given Date", "TitleCn": "\u6307\u5b9a\u65e5\u671f\u7684\u4ea7\u54c1\u4ef7\u683c", "Url": "https://leetcode.cn/problems/product-price-at-a-given-date/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1165, "Title": "Single-Row Keyboard", "TitleCn": "\u5355\u884c\u952e\u76d8", "Url": "https://leetcode.cn/problems/single-row-keyboard/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 7 Problem 1"}, {"ID": 1166, "Title": "Design File System", "TitleCn": "\u8bbe\u8ba1\u6587\u4ef6\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-file-system/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 7 Problem 2"}, {"ID": 1167, "Title": "Minimum Cost to Connect Sticks", "TitleCn": "\u8fde\u63a5\u6728\u68cd\u7684\u6700\u4f4e\u8d39\u7528", "Url": "https://leetcode.cn/problems/minimum-cost-to-connect-sticks/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 7 Problem 3"}, {"ID": 1168, "Title": "Optimize Water Distribution in a Village", "TitleCn": "\u6c34\u8d44\u6e90\u5206\u914d\u4f18\u5316", "Url": "https://leetcode.cn/problems/optimize-water-distribution-in-a-village/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 7 Problem 4"}, {"ID": 1169, "Title": "Invalid Transactions", "TitleCn": "\u67e5\u8be2\u65e0\u6548\u4ea4\u6613", "Url": "https://leetcode.cn/problems/invalid-transactions/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 151 Problem 1"}, {"ID": 1170, "Title": "Compare Strings by Frequency of the Smallest Character", "TitleCn": "\u6bd4\u8f83\u5b57\u7b26\u4e32\u6700\u5c0f\u5b57\u6bcd\u51fa\u73b0\u9891\u6b21", "Url": "https://leetcode.cn/problems/compare-strings-by-frequency-of-the-smallest-character/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 151 Problem 2"}, {"ID": 1171, "Title": "Remove Zero Sum Consecutive Nodes from Linked List", "TitleCn": "\u4ece\u94fe\u8868\u4e2d\u5220\u53bb\u603b\u548c\u503c\u4e3a\u96f6\u7684\u8fde\u7eed\u8282\u70b9", "Url": "https://leetcode.cn/problems/remove-zero-sum-consecutive-nodes-from-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 151 Problem 3"}, {"ID": 1172, "Title": "Dinner Plate Stacks", "TitleCn": "\u9910\u76d8\u6808", "Url": "https://leetcode.cn/problems/dinner-plate-stacks/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 151 Problem 4"}, {"ID": 1173, "Title": "Immediate Food Delivery I", "TitleCn": "\u5373\u65f6\u98df\u7269\u914d\u9001 I", "Url": "https://leetcode.cn/problems/immediate-food-delivery-i/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1174, "Title": "Immediate Food Delivery II", "TitleCn": "\u5373\u65f6\u98df\u7269\u914d\u9001 II", "Url": "https://leetcode.cn/problems/immediate-food-delivery-ii/", "Ispaid": 0, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1175, "Title": "Prime Arrangements", "TitleCn": "\u8d28\u6570\u6392\u5217", "Url": "https://leetcode.cn/problems/prime-arrangements/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 152 Problem 1"}, {"ID": 1176, "Title": "Diet Plan Performance", "TitleCn": "\u5065\u8eab\u8ba1\u5212\u8bc4\u4f30", "Url": "https://leetcode.cn/problems/diet-plan-performance/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 152 Problem 2"}, {"ID": 1177, "Title": "Can Make Palindrome from Substring", "TitleCn": "\u6784\u5efa\u56de\u6587\u4e32\u68c0\u6d4b", "Url": "https://leetcode.cn/problems/can-make-palindrome-from-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 152 Problem 3"}, {"ID": 1178, "Title": "Number of Valid Words for Each Puzzle", "TitleCn": "\u731c\u5b57\u8c1c", "Url": "https://leetcode.cn/problems/number-of-valid-words-for-each-puzzle/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 152 Problem 4"}, {"ID": 1179, "Title": "Reformat Department Table", "TitleCn": "\u91cd\u65b0\u683c\u5f0f\u5316\u90e8\u95e8\u8868", "Url": "https://leetcode.cn/problems/reformat-department-table/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1180, "Title": "Count Substrings with Only One Distinct Letter", "TitleCn": "\u7edf\u8ba1\u53ea\u542b\u5355\u4e00\u5b57\u6bcd\u7684\u5b50\u4e32", "Url": "https://leetcode.cn/problems/count-substrings-with-only-one-distinct-letter/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 8 Problem 1"}, {"ID": 1181, "Title": "Before and After Puzzle", "TitleCn": "\u524d\u540e\u62fc\u63a5", "Url": "https://leetcode.cn/problems/before-and-after-puzzle/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 8 Problem 2"}, {"ID": 1182, "Title": "Shortest Distance to Target Color", "TitleCn": "\u4e0e\u76ee\u6807\u989c\u8272\u95f4\u7684\u6700\u77ed\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/shortest-distance-to-target-color/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 8 Problem 3"}, {"ID": 1183, "Title": "Maximum Number of Ones", "TitleCn": "\u77e9\u9635\u4e2d 1 \u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-ones/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 8 Problem 4"}, {"ID": 1184, "Title": "Distance Between Bus Stops", "TitleCn": "\u516c\u4ea4\u7ad9\u95f4\u7684\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/distance-between-bus-stops/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 153 Problem 1"}, {"ID": 1185, "Title": "Day of the Week", "TitleCn": "\u4e00\u5468\u4e2d\u7684\u7b2c\u51e0\u5929", "Url": "https://leetcode.cn/problems/day-of-the-week/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 153 Problem 2"}, {"ID": 1186, "Title": "Maximum Subarray Sum with One Deletion", "TitleCn": "\u5220\u9664\u4e00\u6b21\u5f97\u5230\u5b50\u6570\u7ec4\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-subarray-sum-with-one-deletion/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 153 Problem 3"}, {"ID": 1187, "Title": "Make Array Strictly Increasing", "TitleCn": "\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e", "Url": "https://leetcode.cn/problems/make-array-strictly-increasing/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 153 Problem 4"}, {"ID": 1188, "Title": "Design Bounded Blocking Queue", "TitleCn": "\u8bbe\u8ba1\u6709\u9650\u963b\u585e\u961f\u5217", "Url": "https://leetcode.cn/problems/design-bounded-blocking-queue/", "Ispaid": 1, "Type": "Concurrency", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1189, "Title": "Maximum Number of Balloons", "TitleCn": "\u201c\u6c14\u7403\u201d \u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-balloons/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 154 Problem 1"}, {"ID": 1190, "Title": "Reverse Substrings Between Each Pair of Parentheses", "TitleCn": "\u53cd\u8f6c\u6bcf\u5bf9\u62ec\u53f7\u95f4\u7684\u5b50\u4e32", "Url": "https://leetcode.cn/problems/reverse-substrings-between-each-pair-of-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 154 Problem 2"}, {"ID": 1191, "Title": "K-Concatenation Maximum Sum", "TitleCn": "K \u6b21\u4e32\u8054\u540e\u6700\u5927\u5b50\u6570\u7ec4\u4e4b\u548c", "Url": "https://leetcode.cn/problems/k-concatenation-maximum-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 154 Problem 3"}, {"ID": 1192, "Title": "Critical Connections in a Network", "TitleCn": "\u67e5\u627e\u96c6\u7fa4\u5185\u7684\u300c\u5173\u952e\u8fde\u63a5\u300d", "Url": "https://leetcode.cn/problems/critical-connections-in-a-network/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 154 Problem 4"}, {"ID": 1193, "Title": "Monthly Transactions I", "TitleCn": "\u6bcf\u6708\u4ea4\u6613 I", "Url": "https://leetcode.cn/problems/monthly-transactions-i/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1194, "Title": "Tournament Winners", "TitleCn": "\u9526\u6807\u8d5b\u4f18\u80dc\u8005", "Url": "https://leetcode.cn/problems/tournament-winners/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1195, "Title": "Fizz Buzz Multithreaded", "TitleCn": "\u4ea4\u66ff\u6253\u5370\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/fizz-buzz-multithreaded/", "Ispaid": 0, "Type": "Concurrency", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1196, "Title": "How Many Apples Can You Put into the Basket", "TitleCn": "\u6700\u591a\u53ef\u4ee5\u4e70\u5230\u7684\u82f9\u679c\u6570\u91cf", "Url": "https://leetcode.cn/problems/how-many-apples-can-you-put-into-the-basket/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 9 Problem 1"}, {"ID": 1197, "Title": "Minimum Knight Moves", "TitleCn": "\u8fdb\u51fb\u7684\u9a91\u58eb", "Url": "https://leetcode.cn/problems/minimum-knight-moves/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 9 Problem 2"}, {"ID": 1198, "Title": "Find Smallest Common Element in All Rows", "TitleCn": "\u627e\u51fa\u6240\u6709\u884c\u4e2d\u6700\u5c0f\u516c\u5171\u5143\u7d20", "Url": "https://leetcode.cn/problems/find-smallest-common-element-in-all-rows/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 9 Problem 3"}, {"ID": 1199, "Title": "Minimum Time to Build Blocks", "TitleCn": "\u5efa\u9020\u8857\u533a\u7684\u6700\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-build-blocks/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 9 Problem 4"}, {"ID": 1200, "Title": "Minimum Absolute Difference", "TitleCn": "\u6700\u5c0f\u7edd\u5bf9\u5dee", "Url": "https://leetcode.cn/problems/minimum-absolute-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 155 Problem 1"}, {"ID": 1201, "Title": "Ugly Number III", "TitleCn": "\u4e11\u6570 III", "Url": "https://leetcode.cn/problems/ugly-number-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 155 Problem 2"}, {"ID": 1202, "Title": "Smallest String With Swaps", "TitleCn": "\u4ea4\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/smallest-string-with-swaps/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 155 Problem 3"}, {"ID": 1203, "Title": "Sort Items by Groups Respecting Dependencies", "TitleCn": "\u9879\u76ee\u7ba1\u7406", "Url": "https://leetcode.cn/problems/sort-items-by-groups-respecting-dependencies/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 155 Problem 4"}, {"ID": 1204, "Title": "Last Person to Fit in the Bus", "TitleCn": "\u6700\u540e\u4e00\u4e2a\u80fd\u8fdb\u5165\u7535\u68af\u7684\u4eba", "Url": "https://leetcode.cn/problems/last-person-to-fit-in-the-elevator/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1205, "Title": "Monthly Transactions II", "TitleCn": "\u6bcf\u6708\u4ea4\u6613II", "Url": "https://leetcode.cn/problems/monthly-transactions-ii/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1206, "Title": "Design Skiplist", "TitleCn": "\u8bbe\u8ba1\u8df3\u8868", "Url": "https://leetcode.cn/problems/design-skiplist/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1207, "Title": "Unique Number of Occurrences", "TitleCn": "\u72ec\u4e00\u65e0\u4e8c\u7684\u51fa\u73b0\u6b21\u6570", "Url": "https://leetcode.cn/problems/unique-number-of-occurrences/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 156 Problem 1"}, {"ID": 1208, "Title": "Get Equal Substrings Within Budget", "TitleCn": "\u5c3d\u53ef\u80fd\u4f7f\u5b57\u7b26\u4e32\u76f8\u7b49", "Url": "https://leetcode.cn/problems/get-equal-substrings-within-budget/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 156 Problem 2"}, {"ID": 1209, "Title": "Remove All Adjacent Duplicates in String II", "TitleCn": "\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879 II", "Url": "https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 156 Problem 3"}, {"ID": 1210, "Title": "Minimum Moves to Reach Target with Rotations", "TitleCn": "\u7a7f\u8fc7\u8ff7\u5bab\u7684\u6700\u5c11\u79fb\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-moves-to-reach-target-with-rotations/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 156 Problem 4"}, {"ID": 1211, "Title": "Queries Quality and Percentage", "TitleCn": "\u67e5\u8be2\u7ed3\u679c\u7684\u8d28\u91cf\u548c\u5360\u6bd4", "Url": "https://leetcode.cn/problems/queries-quality-and-percentage/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1212, "Title": "Team Scores in Football Tournament", "TitleCn": "\u67e5\u8be2\u7403\u961f\u79ef\u5206", "Url": "https://leetcode.cn/problems/team-scores-in-football-tournament/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1213, "Title": "Intersection of Three Sorted Arrays", "TitleCn": "\u4e09\u4e2a\u6709\u5e8f\u6570\u7ec4\u7684\u4ea4\u96c6", "Url": "https://leetcode.cn/problems/intersection-of-three-sorted-arrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 10 Problem 1"}, {"ID": 1214, "Title": "Two Sum BSTs", "TitleCn": "\u67e5\u627e\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e4b\u548c", "Url": "https://leetcode.cn/problems/two-sum-bsts/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 10 Problem 2"}, {"ID": 1215, "Title": "Stepping Numbers", "TitleCn": "\u6b65\u8fdb\u6570", "Url": "https://leetcode.cn/problems/stepping-numbers/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 10 Problem 3"}, {"ID": 1216, "Title": "Valid Palindrome III", "TitleCn": "\u9a8c\u8bc1\u56de\u6587\u4e32 III", "Url": "https://leetcode.cn/problems/valid-palindrome-iii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 10 Problem 4"}, {"ID": 1217, "Title": "Minimum Cost to Move Chips to The Same Position", "TitleCn": "\u73a9\u7b79\u7801", "Url": "https://leetcode.cn/problems/minimum-cost-to-move-chips-to-the-same-position/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 157 Problem 1"}, {"ID": 1218, "Title": "Longest Arithmetic Subsequence of Given Difference", "TitleCn": "\u6700\u957f\u5b9a\u5dee\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-arithmetic-subsequence-of-given-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 157 Problem 2"}, {"ID": 1219, "Title": "Path with Maximum Gold", "TitleCn": "\u9ec4\u91d1\u77ff\u5de5", "Url": "https://leetcode.cn/problems/path-with-maximum-gold/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 157 Problem 3"}, {"ID": 1220, "Title": "Count Vowels Permutation", "TitleCn": "\u7edf\u8ba1\u5143\u97f3\u5b57\u6bcd\u5e8f\u5217\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-vowels-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 157 Problem 4"}, {"ID": 1221, "Title": "Split a String in Balanced Strings", "TitleCn": "\u5206\u5272\u5e73\u8861\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/split-a-string-in-balanced-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 158 Problem 1"}, {"ID": 1222, "Title": "Queens That Can Attack the King", "TitleCn": "\u53ef\u4ee5\u653b\u51fb\u56fd\u738b\u7684\u7687\u540e", "Url": "https://leetcode.cn/problems/queens-that-can-attack-the-king/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 158 Problem 2"}, {"ID": 1223, "Title": "Dice Roll Simulation", "TitleCn": "\u63b7\u9ab0\u5b50\u6a21\u62df", "Url": "https://leetcode.cn/problems/dice-roll-simulation/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 158 Problem 3"}, {"ID": 1224, "Title": "Maximum Equal Frequency", "TitleCn": "\u6700\u5927\u76f8\u7b49\u9891\u7387", "Url": "https://leetcode.cn/problems/maximum-equal-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 158 Problem 4"}, {"ID": 1225, "Title": "Report Contiguous Dates", "TitleCn": "\u62a5\u544a\u7cfb\u7edf\u72b6\u6001\u7684\u8fde\u7eed\u65e5\u671f", "Url": "https://leetcode.cn/problems/report-contiguous-dates/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1226, "Title": "The Dining Philosophers", "TitleCn": "\u54f2\u5b66\u5bb6\u8fdb\u9910", "Url": "https://leetcode.cn/problems/the-dining-philosophers/", "Ispaid": 0, "Type": "Concurrency", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1227, "Title": "Airplane Seat Assignment Probability", "TitleCn": "\u98de\u673a\u5ea7\u4f4d\u5206\u914d\u6982\u7387", "Url": "https://leetcode.cn/problems/airplane-seat-assignment-probability/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1228, "Title": "Missing Number In Arithmetic Progression", "TitleCn": "\u7b49\u5dee\u6570\u5217\u4e2d\u7f3a\u5931\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/missing-number-in-arithmetic-progression/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 11 Problem 1"}, {"ID": 1229, "Title": "Meeting Scheduler", "TitleCn": "\u5b89\u6392\u4f1a\u8bae\u65e5\u7a0b", "Url": "https://leetcode.cn/problems/meeting-scheduler/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 11 Problem 2"}, {"ID": 1230, "Title": "Toss Strange Coins", "TitleCn": "\u629b\u63b7\u786c\u5e01", "Url": "https://leetcode.cn/problems/toss-strange-coins/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 11 Problem 3"}, {"ID": 1231, "Title": "Divide Chocolate", "TitleCn": "\u5206\u4eab\u5de7\u514b\u529b", "Url": "https://leetcode.cn/problems/divide-chocolate/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 11 Problem 4"}, {"ID": 1232, "Title": "Check If It Is a Straight Line", "TitleCn": "\u7f00\u70b9\u6210\u7ebf", "Url": "https://leetcode.cn/problems/check-if-it-is-a-straight-line/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 159 Problem 1"}, {"ID": 1233, "Title": "Remove Sub-Folders from the Filesystem", "TitleCn": "\u5220\u9664\u5b50\u6587\u4ef6\u5939", "Url": "https://leetcode.cn/problems/remove-sub-folders-from-the-filesystem/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 159 Problem 2"}, {"ID": 1234, "Title": "Replace the Substring for Balanced String", "TitleCn": "\u66ff\u6362\u5b50\u4e32\u5f97\u5230\u5e73\u8861\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/replace-the-substring-for-balanced-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 159 Problem 3"}, {"ID": 1235, "Title": "Maximum Profit in Job Scheduling", "TitleCn": "\u89c4\u5212\u517c\u804c\u5de5\u4f5c", "Url": "https://leetcode.cn/problems/maximum-profit-in-job-scheduling/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 159 Problem 4"}, {"ID": 1236, "Title": "Web Crawler", "TitleCn": "\u7f51\u7edc\u722c\u866b", "Url": "https://leetcode.cn/problems/web-crawler/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1237, "Title": "Find Positive Integer Solution for a Given Equation", "TitleCn": "\u627e\u51fa\u7ed9\u5b9a\u65b9\u7a0b\u7684\u6b63\u6574\u6570\u89e3", "Url": "https://leetcode.cn/problems/find-positive-integer-solution-for-a-given-equation/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 160 Problem 1"}, {"ID": 1238, "Title": "Circular Permutation in Binary Representation", "TitleCn": "\u5faa\u73af\u7801\u6392\u5217", "Url": "https://leetcode.cn/problems/circular-permutation-in-binary-representation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 160 Problem 2"}, {"ID": 1239, "Title": "Maximum Length of a Concatenated String with Unique Characters", "TitleCn": "\u4e32\u8054\u5b57\u7b26\u4e32\u7684\u6700\u5927\u957f\u5ea6", "Url": "https://leetcode.cn/problems/maximum-length-of-a-concatenated-string-with-unique-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 160 Problem 3"}, {"ID": 1240, "Title": "Tiling a Rectangle with the Fewest Squares", "TitleCn": "\u94fa\u74f7\u7816", "Url": "https://leetcode.cn/problems/tiling-a-rectangle-with-the-fewest-squares/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 160 Problem 4"}, {"ID": 1241, "Title": "Number of Comments per Post", "TitleCn": "\u6bcf\u4e2a\u5e16\u5b50\u7684\u8bc4\u8bba\u6570", "Url": "https://leetcode.cn/problems/number-of-comments-per-post/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1242, "Title": "Web Crawler Multithreaded", "TitleCn": "\u591a\u7ebf\u7a0b\u7f51\u9875\u722c\u866b", "Url": "https://leetcode.cn/problems/web-crawler-multithreaded/", "Ispaid": 1, "Type": "Concurrency", "Level": 7, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1243, "Title": "Array Transformation", "TitleCn": "\u6570\u7ec4\u53d8\u6362", "Url": "https://leetcode.cn/problems/array-transformation/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 12 Problem 2"}, {"ID": 1244, "Title": "Design A Leaderboard", "TitleCn": "\u529b\u6263\u6392\u884c\u699c", "Url": "https://leetcode.cn/problems/design-a-leaderboard/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 12 Problem 1"}, {"ID": 1245, "Title": "Tree Diameter", "TitleCn": "\u6811\u7684\u76f4\u5f84", "Url": "https://leetcode.cn/problems/tree-diameter/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 12 Problem 3"}, {"ID": 1246, "Title": "Palindrome Removal", "TitleCn": "\u5220\u9664\u56de\u6587\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/palindrome-removal/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 12 Problem 4"}, {"ID": 1247, "Title": "Minimum Swaps to Make Strings Equal", "TitleCn": "\u4ea4\u6362\u5b57\u7b26\u4f7f\u5f97\u5b57\u7b26\u4e32\u76f8\u540c", "Url": "https://leetcode.cn/problems/minimum-swaps-to-make-strings-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 161 Problem 1"}, {"ID": 1248, "Title": "Count Number of Nice Subarrays", "TitleCn": "\u7edf\u8ba1\u300c\u4f18\u7f8e\u5b50\u6570\u7ec4\u300d", "Url": "https://leetcode.cn/problems/count-number-of-nice-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 161 Problem 2"}, {"ID": 1249, "Title": "Minimum Remove to Make Valid Parentheses", "TitleCn": "\u79fb\u9664\u65e0\u6548\u7684\u62ec\u53f7", "Url": "https://leetcode.cn/problems/minimum-remove-to-make-valid-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 161 Problem 3"}, {"ID": 1250, "Title": "Check If It Is a Good Array", "TitleCn": "\u68c0\u67e5\u300c\u597d\u6570\u7ec4\u300d", "Url": "https://leetcode.cn/problems/check-if-it-is-a-good-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 161 Problem 4"}, {"ID": 1251, "Title": "Average Selling Price", "TitleCn": "\u5e73\u5747\u552e\u4ef7", "Url": "https://leetcode.cn/problems/average-selling-price/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1252, "Title": "Cells with Odd Values in a Matrix", "TitleCn": "\u5947\u6570\u503c\u5355\u5143\u683c\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/cells-with-odd-values-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 162 Problem 1"}, {"ID": 1253, "Title": "Reconstruct a 2-Row Binary Matrix", "TitleCn": "\u91cd\u6784 2 \u884c\u4e8c\u8fdb\u5236\u77e9\u9635", "Url": "https://leetcode.cn/problems/reconstruct-a-2-row-binary-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 162 Problem 2"}, {"ID": 1254, "Title": "Number of Closed Islands", "TitleCn": "\u7edf\u8ba1\u5c01\u95ed\u5c9b\u5c7f\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-closed-islands/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 162 Problem 3"}, {"ID": 1255, "Title": "Maximum Score Words Formed by Letters", "TitleCn": "\u5f97\u5206\u6700\u9ad8\u7684\u5355\u8bcd\u96c6\u5408", "Url": "https://leetcode.cn/problems/maximum-score-words-formed-by-letters/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 162 Problem 4"}, {"ID": 1256, "Title": "Encode Number", "TitleCn": "\u52a0\u5bc6\u6570\u5b57", "Url": "https://leetcode.cn/problems/encode-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 13 Problem 1"}, {"ID": 1257, "Title": "Smallest Common Region", "TitleCn": "\u6700\u5c0f\u516c\u5171\u533a\u57df", "Url": "https://leetcode.cn/problems/smallest-common-region/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 13 Problem 2"}, {"ID": 1258, "Title": "Synonymous Sentences", "TitleCn": "\u8fd1\u4e49\u8bcd\u53e5\u5b50", "Url": "https://leetcode.cn/problems/synonymous-sentences/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 13 Problem 3"}, {"ID": 1259, "Title": "Handshakes That Don't Cross", "TitleCn": "\u4e0d\u76f8\u4ea4\u7684\u63e1\u624b", "Url": "https://leetcode.cn/problems/handshakes-that-dont-cross/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 13 Problem 4"}, {"ID": 1260, "Title": "Shift 2D Grid", "TitleCn": "\u4e8c\u7ef4\u7f51\u683c\u8fc1\u79fb", "Url": "https://leetcode.cn/problems/shift-2d-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 163 Problem 1"}, {"ID": 1261, "Title": "Find Elements in a Contaminated Binary Tree", "TitleCn": "\u5728\u53d7\u6c61\u67d3\u7684\u4e8c\u53c9\u6811\u4e2d\u67e5\u627e\u5143\u7d20", "Url": "https://leetcode.cn/problems/find-elements-in-a-contaminated-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 163 Problem 2"}, {"ID": 1262, "Title": "Greatest Sum Divisible by Three", "TitleCn": "\u53ef\u88ab\u4e09\u6574\u9664\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/greatest-sum-divisible-by-three/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 163 Problem 3"}, {"ID": 1263, "Title": "Minimum Moves to Move a Box to Their Target Location", "TitleCn": "\u63a8\u7bb1\u5b50", "Url": "https://leetcode.cn/problems/minimum-moves-to-move-a-box-to-their-target-location/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 163 Problem 4"}, {"ID": 1264, "Title": "Page Recommendations", "TitleCn": "\u9875\u9762\u63a8\u8350", "Url": "https://leetcode.cn/problems/page-recommendations/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1265, "Title": "Print Immutable Linked List in Reverse", "TitleCn": "\u9006\u5e8f\u6253\u5370\u4e0d\u53ef\u53d8\u94fe\u8868", "Url": "https://leetcode.cn/problems/print-immutable-linked-list-in-reverse/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1266, "Title": "Minimum Time Visiting All Points", "TitleCn": "\u8bbf\u95ee\u6240\u6709\u70b9\u7684\u6700\u5c0f\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-visiting-all-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 164 Problem 1"}, {"ID": 1267, "Title": "Count Servers that Communicate", "TitleCn": "\u7edf\u8ba1\u53c2\u4e0e\u901a\u4fe1\u7684\u670d\u52a1\u5668", "Url": "https://leetcode.cn/problems/count-servers-that-communicate/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 164 Problem 2"}, {"ID": 1268, "Title": "Search Suggestions System", "TitleCn": "\u641c\u7d22\u63a8\u8350\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/search-suggestions-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 164 Problem 3"}, {"ID": 1269, "Title": "Number of Ways to Stay in the Same Place After Some Steps", "TitleCn": "\u505c\u5728\u539f\u5730\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 164 Problem 4"}, {"ID": 1270, "Title": "All People Report to the Given Manager", "TitleCn": "\u5411\u516c\u53f8CEO\u6c47\u62a5\u5de5\u4f5c\u7684\u6240\u6709\u4eba", "Url": "https://leetcode.cn/problems/all-people-report-to-the-given-manager/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1271, "Title": "Hexspeak", "TitleCn": "\u5341\u516d\u8fdb\u5236\u9b54\u672f\u6570\u5b57", "Url": "https://leetcode.cn/problems/hexspeak/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 14 Problem 1"}, {"ID": 1272, "Title": "Remove Interval", "TitleCn": "\u5220\u9664\u533a\u95f4", "Url": "https://leetcode.cn/problems/remove-interval/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 14 Problem 2"}, {"ID": 1273, "Title": "Delete Tree Nodes", "TitleCn": "\u5220\u9664\u6811\u8282\u70b9", "Url": "https://leetcode.cn/problems/delete-tree-nodes/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 14 Problem 3"}, {"ID": 1274, "Title": "Number of Ships in a Rectangle", "TitleCn": "\u77e9\u5f62\u5185\u8239\u53ea\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-ships-in-a-rectangle/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 14 Problem 4"}, {"ID": 1275, "Title": "Find Winner on a Tic Tac Toe Game", "TitleCn": "\u627e\u51fa\u4e95\u5b57\u68cb\u7684\u83b7\u80dc\u8005", "Url": "https://leetcode.cn/problems/find-winner-on-a-tic-tac-toe-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 165 Problem 1"}, {"ID": 1276, "Title": "Number of Burgers with No Waste of Ingredients", "TitleCn": "\u4e0d\u6d6a\u8d39\u539f\u6599\u7684\u6c49\u5821\u5236\u4f5c\u65b9\u6848", "Url": "https://leetcode.cn/problems/number-of-burgers-with-no-waste-of-ingredients/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 165 Problem 2"}, {"ID": 1277, "Title": "Count Square Submatrices with All Ones", "TitleCn": "\u7edf\u8ba1\u5168\u4e3a 1 \u7684\u6b63\u65b9\u5f62\u5b50\u77e9\u9635", "Url": "https://leetcode.cn/problems/count-square-submatrices-with-all-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 165 Problem 3"}, {"ID": 1278, "Title": "Palindrome Partitioning III", "TitleCn": "\u5206\u5272\u56de\u6587\u4e32 III", "Url": "https://leetcode.cn/problems/palindrome-partitioning-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 165 Problem 4"}, {"ID": 1279, "Title": "Traffic Light Controlled Intersection", "TitleCn": "\u7ea2\u7eff\u706f\u8def\u53e3", "Url": "https://leetcode.cn/problems/traffic-light-controlled-intersection/", "Ispaid": 1, "Type": "Concurrency", "Level": 5, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1280, "Title": "Students and Examinations", "TitleCn": "\u5b66\u751f\u4eec\u53c2\u52a0\u5404\u79d1\u6d4b\u8bd5\u7684\u6b21\u6570", "Url": "https://leetcode.cn/problems/students-and-examinations/", "Ispaid": 0, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1281, "Title": "Subtract the Product and Sum of Digits of an Integer", "TitleCn": "\u6574\u6570\u7684\u5404\u4f4d\u79ef\u548c\u4e4b\u5dee", "Url": "https://leetcode.cn/problems/subtract-the-product-and-sum-of-digits-of-an-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 166 Problem 1"}, {"ID": 1282, "Title": "Group the People Given the Group Size They Belong To", "TitleCn": "\u7528\u6237\u5206\u7ec4", "Url": "https://leetcode.cn/problems/group-the-people-given-the-group-size-they-belong-to/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 166 Problem 2"}, {"ID": 1283, "Title": "Find the Smallest Divisor Given a Threshold", "TitleCn": "\u4f7f\u7ed3\u679c\u4e0d\u8d85\u8fc7\u9608\u503c\u7684\u6700\u5c0f\u9664\u6570", "Url": "https://leetcode.cn/problems/find-the-smallest-divisor-given-a-threshold/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 166 Problem 3"}, {"ID": 1284, "Title": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix", "TitleCn": "\u8f6c\u5316\u4e3a\u5168\u96f6\u77e9\u9635\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 166 Problem 4"}, {"ID": 1285, "Title": "Find the Start and End Number of Continuous Ranges", "TitleCn": "\u627e\u5230\u8fde\u7eed\u533a\u95f4\u7684\u5f00\u59cb\u548c\u7ed3\u675f\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-the-start-and-end-number-of-continuous-ranges/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1286, "Title": "Iterator for Combination", "TitleCn": "\u5b57\u6bcd\u7ec4\u5408\u8fed\u4ee3\u5668", "Url": "https://leetcode.cn/problems/iterator-for-combination/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 15 Problem 3"}, {"ID": 1287, "Title": "Element Appearing More Than 25% In Sorted Array", "TitleCn": "\u6709\u5e8f\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u8d85\u8fc725%\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/element-appearing-more-than-25-in-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 15 Problem 1"}, {"ID": 1288, "Title": "Remove Covered Intervals", "TitleCn": "\u5220\u9664\u88ab\u8986\u76d6\u533a\u95f4", "Url": "https://leetcode.cn/problems/remove-covered-intervals/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 15 Problem 2"}, {"ID": 1289, "Title": "Minimum Falling Path Sum II", "TitleCn": "\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c  II", "Url": "https://leetcode.cn/problems/minimum-falling-path-sum-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 15 Problem 4"}, {"ID": 1290, "Title": "Convert Binary Number in a Linked List to Integer", "TitleCn": "\u4e8c\u8fdb\u5236\u94fe\u8868\u8f6c\u6574\u6570", "Url": "https://leetcode.cn/problems/convert-binary-number-in-a-linked-list-to-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 167 Problem 1"}, {"ID": 1291, "Title": "Sequential Digits", "TitleCn": "\u987a\u6b21\u6570", "Url": "https://leetcode.cn/problems/sequential-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 167 Problem 2"}, {"ID": 1292, "Title": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold", "TitleCn": "\u5143\u7d20\u548c\u5c0f\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u6b63\u65b9\u5f62\u7684\u6700\u5927\u8fb9\u957f", "Url": "https://leetcode.cn/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 167 Problem 3"}, {"ID": 1293, "Title": "Shortest Path in a Grid with Obstacles Elimination", "TitleCn": "\u7f51\u683c\u4e2d\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-path-in-a-grid-with-obstacles-elimination/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 167 Problem 4"}, {"ID": 1294, "Title": "Weather Type in Each Country", "TitleCn": "\u4e0d\u540c\u56fd\u5bb6\u7684\u5929\u6c14\u7c7b\u578b", "Url": "https://leetcode.cn/problems/weather-type-in-each-country/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1295, "Title": "Find Numbers with Even Number of Digits", "TitleCn": "\u7edf\u8ba1\u4f4d\u6570\u4e3a\u5076\u6570\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-numbers-with-even-number-of-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 168 Problem 1"}, {"ID": 1296, "Title": "Divide Array in Sets of K Consecutive Numbers", "TitleCn": "\u5212\u5206\u6570\u7ec4\u4e3a\u8fde\u7eed\u6570\u5b57\u7684\u96c6\u5408", "Url": "https://leetcode.cn/problems/divide-array-in-sets-of-k-consecutive-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 168 Problem 2"}, {"ID": 1297, "Title": "Maximum Number of Occurrences of a Substring", "TitleCn": "\u5b50\u4e32\u7684\u6700\u5927\u51fa\u73b0\u6b21\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-occurrences-of-a-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 168 Problem 3"}, {"ID": 1298, "Title": "Maximum Candies You Can Get from Boxes", "TitleCn": "\u4f60\u80fd\u4ece\u76d2\u5b50\u91cc\u83b7\u5f97\u7684\u6700\u5927\u7cd6\u679c\u6570", "Url": "https://leetcode.cn/problems/maximum-candies-you-can-get-from-boxes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 168 Problem 4"}, {"ID": 1299, "Title": "Replace Elements with Greatest Element on Right Side", "TitleCn": "\u5c06\u6bcf\u4e2a\u5143\u7d20\u66ff\u6362\u4e3a\u53f3\u4fa7\u6700\u5927\u5143\u7d20", "Url": "https://leetcode.cn/problems/replace-elements-with-greatest-element-on-right-side/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 16 Problem 1"}, {"ID": 1300, "Title": "Sum of Mutated Array Closest to Target", "TitleCn": "\u8f6c\u53d8\u6570\u7ec4\u540e\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/sum-of-mutated-array-closest-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 16 Problem 2"}, {"ID": 1301, "Title": "Number of Paths with Max Score", "TitleCn": "\u6700\u5927\u5f97\u5206\u7684\u8def\u5f84\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-paths-with-max-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 16 Problem 4"}, {"ID": 1302, "Title": "Deepest Leaves Sum", "TitleCn": "\u5c42\u6570\u6700\u6df1\u53f6\u5b50\u8282\u70b9\u7684\u548c", "Url": "https://leetcode.cn/problems/deepest-leaves-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 16 Problem 3"}, {"ID": 1303, "Title": "Find the Team Size", "TitleCn": "\u6c42\u56e2\u961f\u4eba\u6570", "Url": "https://leetcode.cn/problems/find-the-team-size/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1304, "Title": "Find N Unique Integers Sum up to Zero", "TitleCn": "\u548c\u4e3a\u96f6\u7684 N \u4e2a\u4e0d\u540c\u6574\u6570", "Url": "https://leetcode.cn/problems/find-n-unique-integers-sum-up-to-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 169 Problem 1"}, {"ID": 1305, "Title": "All Elements in Two Binary Search Trees", "TitleCn": "\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u6240\u6709\u5143\u7d20", "Url": "https://leetcode.cn/problems/all-elements-in-two-binary-search-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 169 Problem 2"}, {"ID": 1306, "Title": "Jump Game III", "TitleCn": "\u8df3\u8dc3\u6e38\u620f III", "Url": "https://leetcode.cn/problems/jump-game-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 169 Problem 3"}, {"ID": 1307, "Title": "Verbal Arithmetic Puzzle", "TitleCn": "\u53e3\u7b97\u96be\u9898", "Url": "https://leetcode.cn/problems/verbal-arithmetic-puzzle/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 169 Problem 4"}, {"ID": 1308, "Title": "Running Total for Different Genders", "TitleCn": "\u4e0d\u540c\u6027\u522b\u6bcf\u65e5\u5206\u6570\u603b\u8ba1", "Url": "https://leetcode.cn/problems/running-total-for-different-genders/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1309, "Title": "Decrypt String from Alphabet to Integer Mapping", "TitleCn": "\u89e3\u7801\u5b57\u6bcd\u5230\u6574\u6570\u6620\u5c04", "Url": "https://leetcode.cn/problems/decrypt-string-from-alphabet-to-integer-mapping/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 170 Problem 1"}, {"ID": 1310, "Title": "XOR Queries of a Subarray", "TitleCn": "\u5b50\u6570\u7ec4\u5f02\u6216\u67e5\u8be2", "Url": "https://leetcode.cn/problems/xor-queries-of-a-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 170 Problem 2"}, {"ID": 1311, "Title": "Get Watched Videos by Your Friends", "TitleCn": "\u83b7\u53d6\u4f60\u597d\u53cb\u5df2\u89c2\u770b\u7684\u89c6\u9891", "Url": "https://leetcode.cn/problems/get-watched-videos-by-your-friends/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 170 Problem 3"}, {"ID": 1312, "Title": "Minimum Insertion Steps to Make a String Palindrome", "TitleCn": "\u8ba9\u5b57\u7b26\u4e32\u6210\u4e3a\u56de\u6587\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-insertion-steps-to-make-a-string-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 170 Problem 4"}, {"ID": 1313, "Title": "Decompress Run-Length Encoded List", "TitleCn": "\u89e3\u538b\u7f29\u7f16\u7801\u5217\u8868", "Url": "https://leetcode.cn/problems/decompress-run-length-encoded-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 17 Problem 1"}, {"ID": 1314, "Title": "Matrix Block Sum", "TitleCn": "\u77e9\u9635\u533a\u57df\u548c", "Url": "https://leetcode.cn/problems/matrix-block-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 17 Problem 2"}, {"ID": 1315, "Title": "Sum of Nodes with Even-Valued Grandparent", "TitleCn": "\u7956\u7236\u8282\u70b9\u503c\u4e3a\u5076\u6570\u7684\u8282\u70b9\u548c", "Url": "https://leetcode.cn/problems/sum-of-nodes-with-even-valued-grandparent/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 17 Problem 3"}, {"ID": 1316, "Title": "Distinct Echo Substrings", "TitleCn": "\u4e0d\u540c\u7684\u5faa\u73af\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/distinct-echo-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 17 Problem 4"}, {"ID": 1317, "Title": "Convert Integer to the Sum of Two No-Zero Integers", "TitleCn": "\u5c06\u6574\u6570\u8f6c\u6362\u4e3a\u4e24\u4e2a\u65e0\u96f6\u6574\u6570\u7684\u548c", "Url": "https://leetcode.cn/problems/convert-integer-to-the-sum-of-two-no-zero-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 171 Problem 1"}, {"ID": 1318, "Title": "Minimum Flips to Make a OR b Equal to c", "TitleCn": "\u6216\u8fd0\u7b97\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-flips-to-make-a-or-b-equal-to-c/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 171 Problem 2"}, {"ID": 1319, "Title": "Number of Operations to Make Network Connected", "TitleCn": "\u8fde\u901a\u7f51\u7edc\u7684\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-operations-to-make-network-connected/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 171 Problem 3"}, {"ID": 1320, "Title": "Minimum Distance to Type a Word Using Two Fingers", "TitleCn": "\u4e8c\u6307\u8f93\u5165\u7684\u7684\u6700\u5c0f\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/minimum-distance-to-type-a-word-using-two-fingers/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 171 Problem 4"}, {"ID": 1321, "Title": "Restaurant Growth", "TitleCn": "\u9910\u9986\u8425\u4e1a\u989d\u53d8\u5316\u589e\u957f", "Url": "https://leetcode.cn/problems/restaurant-growth/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1322, "Title": "Ads Performance", "TitleCn": "\u5e7f\u544a\u6548\u679c", "Url": "https://leetcode.cn/problems/ads-performance/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1323, "Title": " Maximum 69 Number", "TitleCn": "6 \u548c 9 \u7ec4\u6210\u7684\u6700\u5927\u6570\u5b57", "Url": "https://leetcode.cn/problems/maximum-69-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 172 Problem 1"}, {"ID": 1324, "Title": "Print Words Vertically", "TitleCn": "\u7ad6\u76f4\u6253\u5370\u5355\u8bcd", "Url": "https://leetcode.cn/problems/print-words-vertically/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 172 Problem 2"}, {"ID": 1325, "Title": "Delete Leaves With a Given Value", "TitleCn": "\u5220\u9664\u7ed9\u5b9a\u503c\u7684\u53f6\u5b50\u8282\u70b9", "Url": "https://leetcode.cn/problems/delete-leaves-with-a-given-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 172 Problem 3"}, {"ID": 1326, "Title": "Minimum Number of Taps to Open to Water a Garden", "TitleCn": "\u704c\u6e89\u82b1\u56ed\u7684\u6700\u5c11\u6c34\u9f99\u5934\u6570\u76ee", "Url": "https://leetcode.cn/problems/minimum-number-of-taps-to-open-to-water-a-garden/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 172 Problem 4"}, {"ID": 1327, "Title": "List the Products Ordered in a Period", "TitleCn": "\u5217\u51fa\u6307\u5b9a\u65f6\u95f4\u6bb5\u5185\u6240\u6709\u7684\u4e0b\u5355\u4ea7\u54c1", "Url": "https://leetcode.cn/problems/list-the-products-ordered-in-a-period/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1328, "Title": "Break a Palindrome", "TitleCn": "\u7834\u574f\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/break-a-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 18 Problem 2"}, {"ID": 1329, "Title": "Sort the Matrix Diagonally", "TitleCn": "\u5c06\u77e9\u9635\u6309\u5bf9\u89d2\u7ebf\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-the-matrix-diagonally/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 18 Problem 3"}, {"ID": 1330, "Title": "Reverse Subarray To Maximize Array Value", "TitleCn": "\u7ffb\u8f6c\u5b50\u6570\u7ec4\u5f97\u5230\u6700\u5927\u7684\u6570\u7ec4\u503c", "Url": "https://leetcode.cn/problems/reverse-subarray-to-maximize-array-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 18 Problem 4"}, {"ID": 1331, "Title": "Rank Transform of an Array", "TitleCn": "\u6570\u7ec4\u5e8f\u53f7\u8f6c\u6362", "Url": "https://leetcode.cn/problems/rank-transform-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 18 Problem 1"}, {"ID": 1332, "Title": "Remove Palindromic Subsequences", "TitleCn": "\u5220\u9664\u56de\u6587\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/remove-palindromic-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 173 Problem 1"}, {"ID": 1333, "Title": "Filter Restaurants by Vegan-Friendly, Price and Distance", "TitleCn": "\u9910\u5385\u8fc7\u6ee4\u5668", "Url": "https://leetcode.cn/problems/filter-restaurants-by-vegan-friendly-price-and-distance/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 173 Problem 2"}, {"ID": 1334, "Title": "Find the City With the Smallest Number of Neighbors at a Threshold Distance", "TitleCn": "\u9608\u503c\u8ddd\u79bb\u5185\u90bb\u5c45\u6700\u5c11\u7684\u57ce\u5e02", "Url": "https://leetcode.cn/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 173 Problem 3"}, {"ID": 1335, "Title": "Minimum Difficulty of a Job Schedule", "TitleCn": "\u5de5\u4f5c\u8ba1\u5212\u7684\u6700\u4f4e\u96be\u5ea6", "Url": "https://leetcode.cn/problems/minimum-difficulty-of-a-job-schedule/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 173 Problem 4"}, {"ID": 1336, "Title": "Number of Transactions per Visit", "TitleCn": "\u6bcf\u6b21\u8bbf\u95ee\u7684\u4ea4\u6613\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-transactions-per-visit/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1337, "Title": "The K Weakest Rows in a Matrix", "TitleCn": "\u65b9\u9635\u4e2d\u6218\u6597\u529b\u6700\u5f31\u7684 K \u884c", "Url": "https://leetcode.cn/problems/the-k-weakest-rows-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 174 Problem 1"}, {"ID": 1338, "Title": "Reduce Array Size to The Half", "TitleCn": "\u6570\u7ec4\u5927\u5c0f\u51cf\u534a", "Url": "https://leetcode.cn/problems/reduce-array-size-to-the-half/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 174 Problem 2"}, {"ID": 1339, "Title": "Maximum Product of Splitted Binary Tree", "TitleCn": "\u5206\u88c2\u4e8c\u53c9\u6811\u7684\u6700\u5927\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-product-of-splitted-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 174 Problem 3"}, {"ID": 1340, "Title": "Jump Game V", "TitleCn": "\u8df3\u8dc3\u6e38\u620f V", "Url": "https://leetcode.cn/problems/jump-game-v/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 174 Problem 4"}, {"ID": 1341, "Title": "Movie Rating", "TitleCn": "\u7535\u5f71\u8bc4\u5206", "Url": "https://leetcode.cn/problems/movie-rating/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1342, "Title": "Number of Steps to Reduce a Number to Zero", "TitleCn": "\u5c06\u6570\u5b57\u53d8\u6210 0 \u7684\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-steps-to-reduce-a-number-to-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 19 Problem 1"}, {"ID": 1343, "Title": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold", "TitleCn": "\u5927\u5c0f\u4e3a K \u4e14\u5e73\u5747\u503c\u5927\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 19 Problem 2"}, {"ID": 1344, "Title": "Angle Between Hands of a Clock", "TitleCn": "\u65f6\u949f\u6307\u9488\u7684\u5939\u89d2", "Url": "https://leetcode.cn/problems/angle-between-hands-of-a-clock/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 19 Problem 3"}, {"ID": 1345, "Title": "Jump Game IV", "TitleCn": "\u8df3\u8dc3\u6e38\u620f IV", "Url": "https://leetcode.cn/problems/jump-game-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 19 Problem 4"}, {"ID": 1346, "Title": "Check If N and Its Double Exist", "TitleCn": "\u68c0\u67e5\u6574\u6570\u53ca\u5176\u4e24\u500d\u6570\u662f\u5426\u5b58\u5728", "Url": "https://leetcode.cn/problems/check-if-n-and-its-double-exist/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 175 Problem 1"}, {"ID": 1347, "Title": "Minimum Number of Steps to Make Two Strings Anagram", "TitleCn": "\u5236\u9020\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u7684\u6700\u5c0f\u6b65\u9aa4\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-steps-to-make-two-strings-anagram/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 175 Problem 2"}, {"ID": 1348, "Title": "Tweet Counts Per Frequency", "TitleCn": "\u63a8\u6587\u8ba1\u6570", "Url": "https://leetcode.cn/problems/tweet-counts-per-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 175 Problem 3"}, {"ID": 1349, "Title": "Maximum Students Taking Exam", "TitleCn": "\u53c2\u52a0\u8003\u8bd5\u7684\u6700\u5927\u5b66\u751f\u6570", "Url": "https://leetcode.cn/problems/maximum-students-taking-exam/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 175 Problem 4"}, {"ID": 1350, "Title": "Students With Invalid Departments", "TitleCn": "\u9662\u7cfb\u65e0\u6548\u7684\u5b66\u751f", "Url": "https://leetcode.cn/problems/students-with-invalid-departments/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1351, "Title": "Count Negative Numbers in a Sorted Matrix", "TitleCn": "\u7edf\u8ba1\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u8d1f\u6570", "Url": "https://leetcode.cn/problems/count-negative-numbers-in-a-sorted-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 176 Problem 1"}, {"ID": 1352, "Title": "Product of the Last K Numbers", "TitleCn": "\u6700\u540e K \u4e2a\u6570\u7684\u4e58\u79ef", "Url": "https://leetcode.cn/problems/product-of-the-last-k-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 176 Problem 2"}, {"ID": 1353, "Title": "Maximum Number of Events That Can Be Attended", "TitleCn": "\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-events-that-can-be-attended/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 176 Problem 3"}, {"ID": 1354, "Title": "Construct Target Array With Multiple Sums", "TitleCn": "\u591a\u6b21\u6c42\u548c\u6784\u9020\u76ee\u6807\u6570\u7ec4", "Url": "https://leetcode.cn/problems/construct-target-array-with-multiple-sums/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 176 Problem 4"}, {"ID": 1355, "Title": "Activity Participants", "TitleCn": "\u6d3b\u52a8\u53c2\u4e0e\u8005", "Url": "https://leetcode.cn/problems/activity-participants/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1356, "Title": "Sort Integers by The Number of 1 Bits", "TitleCn": "\u6839\u636e\u6570\u5b57\u4e8c\u8fdb\u5236\u4e0b 1 \u7684\u6570\u76ee\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-integers-by-the-number-of-1-bits/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 20 Problem 1"}, {"ID": 1357, "Title": "Apply Discount Every n Orders", "TitleCn": "\u6bcf\u9694 n \u4e2a\u987e\u5ba2\u6253\u6298", "Url": "https://leetcode.cn/problems/apply-discount-every-n-orders/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 20 Problem 2"}, {"ID": 1358, "Title": "Number of Substrings Containing All Three Characters", "TitleCn": "\u5305\u542b\u6240\u6709\u4e09\u79cd\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 20 Problem 3"}, {"ID": 1359, "Title": "Count All Valid Pickup and Delivery Options", "TitleCn": "\u6709\u6548\u7684\u5feb\u9012\u5e8f\u5217\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-all-valid-pickup-and-delivery-options/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 20 Problem 4"}, {"ID": 1360, "Title": "Number of Days Between Two Dates", "TitleCn": "\u65e5\u671f\u4e4b\u95f4\u9694\u51e0\u5929", "Url": "https://leetcode.cn/problems/number-of-days-between-two-dates/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 177 Problem 1"}, {"ID": 1361, "Title": "Validate Binary Tree Nodes", "TitleCn": "\u9a8c\u8bc1\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/validate-binary-tree-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 177 Problem 2"}, {"ID": 1362, "Title": "Closest Divisors", "TitleCn": "\u6700\u63a5\u8fd1\u7684\u56e0\u6570", "Url": "https://leetcode.cn/problems/closest-divisors/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 177 Problem 3"}, {"ID": 1363, "Title": "Largest Multiple of Three", "TitleCn": "\u5f62\u6210\u4e09\u7684\u6700\u5927\u500d\u6570", "Url": "https://leetcode.cn/problems/largest-multiple-of-three/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 177 Problem 4"}, {"ID": 1364, "Title": "Number of Trusted Contacts of a Customer", "TitleCn": "\u987e\u5ba2\u7684\u53ef\u4fe1\u8054\u7cfb\u4eba\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-trusted-contacts-of-a-customer/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1365, "Title": "How Many Numbers Are Smaller Than the Current Number", "TitleCn": "\u6709\u591a\u5c11\u5c0f\u4e8e\u5f53\u524d\u6570\u5b57\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/how-many-numbers-are-smaller-than-the-current-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 178 Problem 1"}, {"ID": 1366, "Title": "Rank Teams by Votes", "TitleCn": "\u901a\u8fc7\u6295\u7968\u5bf9\u56e2\u961f\u6392\u540d", "Url": "https://leetcode.cn/problems/rank-teams-by-votes/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 178 Problem 2"}, {"ID": 1367, "Title": "Linked List in Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u7684\u5217\u8868", "Url": "https://leetcode.cn/problems/linked-list-in-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 178 Problem 3"}, {"ID": 1368, "Title": "Minimum Cost to Make at Least One Valid Path in a Grid", "TitleCn": "\u4f7f\u7f51\u683c\u56fe\u81f3\u5c11\u6709\u4e00\u6761\u6709\u6548\u8def\u5f84\u7684\u6700\u5c0f\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 178 Problem 4"}, {"ID": 1369, "Title": "Get the Second Most Recent Activity", "TitleCn": "\u83b7\u53d6\u6700\u8fd1\u7b2c\u4e8c\u6b21\u7684\u6d3b\u52a8", "Url": "https://leetcode.cn/problems/get-the-second-most-recent-activity/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1370, "Title": "Increasing Decreasing String", "TitleCn": "\u4e0a\u5347\u4e0b\u964d\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/increasing-decreasing-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 21 Problem 1"}, {"ID": 1371, "Title": "Find the Longest Substring Containing Vowels in Even Counts", "TitleCn": "\u6bcf\u4e2a\u5143\u97f3\u5305\u542b\u5076\u6570\u6b21\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-the-longest-substring-containing-vowels-in-even-counts/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 21 Problem 2"}, {"ID": 1372, "Title": "Longest ZigZag Path in a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u957f\u4ea4\u9519\u8def\u5f84", "Url": "https://leetcode.cn/problems/longest-zigzag-path-in-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 21 Problem 3"}, {"ID": 1373, "Title": "Maximum Sum BST in Binary Tree", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u5b50\u6811\u7684\u6700\u5927\u952e\u503c\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-bst-in-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 21 Problem 4"}, {"ID": 1374, "Title": "Generate a String With Characters That Have Odd Counts", "TitleCn": "\u751f\u6210\u6bcf\u79cd\u5b57\u7b26\u90fd\u662f\u5947\u6570\u4e2a\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/generate-a-string-with-characters-that-have-odd-counts/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 179 Problem 1"}, {"ID": 1375, "Title": "Number of Times Binary String Is Prefix-Aligned", "TitleCn": "\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u524d\u7f00\u4e00\u81f4\u7684\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-times-binary-string-is-prefix-aligned/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 179 Problem 2"}, {"ID": 1376, "Title": "Time Needed to Inform All Employees", "TitleCn": "\u901a\u77e5\u6240\u6709\u5458\u5de5\u6240\u9700\u7684\u65f6\u95f4", "Url": "https://leetcode.cn/problems/time-needed-to-inform-all-employees/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 179 Problem 3"}, {"ID": 1377, "Title": "Frog Position After T Seconds", "TitleCn": "T \u79d2\u540e\u9752\u86d9\u7684\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/frog-position-after-t-seconds/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 179 Problem 4"}, {"ID": 1378, "Title": "Replace Employee ID With The Unique Identifier", "TitleCn": "\u4f7f\u7528\u552f\u4e00\u6807\u8bc6\u7801\u66ff\u6362\u5458\u5de5ID", "Url": "https://leetcode.cn/problems/replace-employee-id-with-the-unique-identifier/", "Ispaid": 0, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1379, "Title": "Find a Corresponding Node of a Binary Tree in a Clone of That Tree", "TitleCn": "\u627e\u51fa\u514b\u9686\u4e8c\u53c9\u6811\u4e2d\u7684\u76f8\u540c\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1380, "Title": "Lucky Numbers in a Matrix", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u5e78\u8fd0\u6570", "Url": "https://leetcode.cn/problems/lucky-numbers-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 180 Problem 1"}, {"ID": 1381, "Title": "Design a Stack With Increment Operation", "TitleCn": "\u8bbe\u8ba1\u4e00\u4e2a\u652f\u6301\u589e\u91cf\u64cd\u4f5c\u7684\u6808", "Url": "https://leetcode.cn/problems/design-a-stack-with-increment-operation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 180 Problem 2"}, {"ID": 1382, "Title": "Balance a Binary Search Tree", "TitleCn": "\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u53d8\u5e73\u8861", "Url": "https://leetcode.cn/problems/balance-a-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 180 Problem 3"}, {"ID": 1383, "Title": "Maximum Performance of a Team", "TitleCn": "\u6700\u5927\u7684\u56e2\u961f\u8868\u73b0\u503c", "Url": "https://leetcode.cn/problems/maximum-performance-of-a-team/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 180 Problem 4"}, {"ID": 1384, "Title": "Total Sales Amount by Year", "TitleCn": "\u6309\u5e74\u5ea6\u5217\u51fa\u9500\u552e\u603b\u989d", "Url": "https://leetcode.cn/problems/total-sales-amount-by-year/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1385, "Title": "Find the Distance Value Between Two Arrays", "TitleCn": "\u4e24\u4e2a\u6570\u7ec4\u95f4\u7684\u8ddd\u79bb\u503c", "Url": "https://leetcode.cn/problems/find-the-distance-value-between-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 22 Problem 1"}, {"ID": 1386, "Title": "Cinema Seat Allocation", "TitleCn": "\u5b89\u6392\u7535\u5f71\u9662\u5ea7\u4f4d", "Url": "https://leetcode.cn/problems/cinema-seat-allocation/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 22 Problem 2"}, {"ID": 1387, "Title": "Sort Integers by The Power Value", "TitleCn": "\u5c06\u6574\u6570\u6309\u6743\u91cd\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-integers-by-the-power-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 22 Problem 3"}, {"ID": 1388, "Title": "Pizza With 3n Slices", "TitleCn": "3n \u5757\u62ab\u8428", "Url": "https://leetcode.cn/problems/pizza-with-3n-slices/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 22 Problem 4"}, {"ID": 1389, "Title": "Create Target Array in the Given Order", "TitleCn": "\u6309\u65e2\u5b9a\u987a\u5e8f\u521b\u5efa\u76ee\u6807\u6570\u7ec4", "Url": "https://leetcode.cn/problems/create-target-array-in-the-given-order/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 181 Problem 1"}, {"ID": 1390, "Title": "Four Divisors", "TitleCn": "\u56db\u56e0\u6570", "Url": "https://leetcode.cn/problems/four-divisors/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 181 Problem 2"}, {"ID": 1391, "Title": "Check if There is a Valid Path in a Grid", "TitleCn": "\u68c0\u67e5\u7f51\u683c\u4e2d\u662f\u5426\u5b58\u5728\u6709\u6548\u8def\u5f84", "Url": "https://leetcode.cn/problems/check-if-there-is-a-valid-path-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 181 Problem 3"}, {"ID": 1392, "Title": "Longest Happy Prefix", "TitleCn": "\u6700\u957f\u5feb\u4e50\u524d\u7f00", "Url": "https://leetcode.cn/problems/longest-happy-prefix/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 181 Problem 4"}, {"ID": 1393, "Title": "Capital Gain/Loss", "TitleCn": "\u80a1\u7968\u7684\u8d44\u672c\u635f\u76ca", "Url": "https://leetcode.cn/problems/capital-gainloss/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1394, "Title": "Find Lucky Integer in an Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u5e78\u8fd0\u6570", "Url": "https://leetcode.cn/problems/find-lucky-integer-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 182 Problem 1"}, {"ID": 1395, "Title": "Count Number of Teams", "TitleCn": "\u7edf\u8ba1\u4f5c\u6218\u5355\u4f4d\u6570", "Url": "https://leetcode.cn/problems/count-number-of-teams/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 182 Problem 2"}, {"ID": 1396, "Title": "Design Underground System", "TitleCn": "\u8bbe\u8ba1\u5730\u94c1\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-underground-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 182 Problem 3"}, {"ID": 1397, "Title": "Find All Good Strings", "TitleCn": "\u627e\u5230\u6240\u6709\u597d\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-all-good-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 182 Problem 4"}, {"ID": 1398, "Title": "Customers Who Bought Products A and B but Not C", "TitleCn": "\u8d2d\u4e70\u4e86\u4ea7\u54c1A\u548c\u4ea7\u54c1B\u5374\u6ca1\u6709\u8d2d\u4e70\u4ea7\u54c1C\u7684\u987e\u5ba2", "Url": "https://leetcode.cn/problems/customers-who-bought-products-a-and-b-but-not-c/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1399, "Title": "Count Largest Group", "TitleCn": "\u7edf\u8ba1\u6700\u5927\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-largest-group/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 23 Problem 1"}, {"ID": 1400, "Title": "Construct K Palindrome Strings", "TitleCn": "\u6784\u9020 K \u4e2a\u56de\u6587\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/construct-k-palindrome-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 23 Problem 2"}, {"ID": 1401, "Title": "Circle and Rectangle Overlapping", "TitleCn": "\u5706\u548c\u77e9\u5f62\u662f\u5426\u6709\u91cd\u53e0", "Url": "https://leetcode.cn/problems/circle-and-rectangle-overlapping/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 23 Problem 3"}, {"ID": 1402, "Title": "Reducing Dishes", "TitleCn": "\u505a\u83dc\u987a\u5e8f", "Url": "https://leetcode.cn/problems/reducing-dishes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 23 Problem 4"}, {"ID": 1403, "Title": "Minimum Subsequence in Non-Increasing Order", "TitleCn": "\u975e\u9012\u589e\u987a\u5e8f\u7684\u6700\u5c0f\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/minimum-subsequence-in-non-increasing-order/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 183 Problem 1"}, {"ID": 1404, "Title": "Number of Steps to Reduce a Number in Binary Representation to One", "TitleCn": "\u5c06\u4e8c\u8fdb\u5236\u8868\u793a\u51cf\u5230 1 \u7684\u6b65\u9aa4\u6570", "Url": "https://leetcode.cn/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 183 Problem 2"}, {"ID": 1405, "Title": "Longest Happy String", "TitleCn": "\u6700\u957f\u5feb\u4e50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/longest-happy-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 183 Problem 3"}, {"ID": 1406, "Title": "Stone Game III", "TitleCn": "\u77f3\u5b50\u6e38\u620f III", "Url": "https://leetcode.cn/problems/stone-game-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 183 Problem 4"}, {"ID": 1407, "Title": "Top Travellers", "TitleCn": "\u6392\u540d\u9760\u524d\u7684\u65c5\u884c\u8005", "Url": "https://leetcode.cn/problems/top-travellers/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1408, "Title": "String Matching in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684\u5b57\u7b26\u4e32\u5339\u914d", "Url": "https://leetcode.cn/problems/string-matching-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 184 Problem 1"}, {"ID": 1409, "Title": "Queries on a Permutation With Key", "TitleCn": "\u67e5\u8be2\u5e26\u952e\u7684\u6392\u5217", "Url": "https://leetcode.cn/problems/queries-on-a-permutation-with-key/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 184 Problem 2"}, {"ID": 1410, "Title": "HTML Entity Parser", "TitleCn": "HTML \u5b9e\u4f53\u89e3\u6790\u5668", "Url": "https://leetcode.cn/problems/html-entity-parser/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 184 Problem 3"}, {"ID": 1411, "Title": "Number of Ways to Paint N \u00d7 3 Grid", "TitleCn": "\u7ed9 N x 3 \u7f51\u683c\u56fe\u6d82\u8272\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-paint-n-3-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 184 Problem 4"}, {"ID": 1412, "Title": "Find the Quiet Students in All Exams", "TitleCn": "\u67e5\u627e\u6210\u7ee9\u5904\u4e8e\u4e2d\u6e38\u7684\u5b66\u751f", "Url": "https://leetcode.cn/problems/find-the-quiet-students-in-all-exams/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1413, "Title": "Minimum Value to Get Positive Step by Step Sum", "TitleCn": "\u9010\u6b65\u6c42\u548c\u5f97\u5230\u6b63\u6570\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/minimum-value-to-get-positive-step-by-step-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 24 Problem 1"}, {"ID": 1414, "Title": "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K", "TitleCn": "\u548c\u4e3a K \u7684\u6700\u5c11\u6590\u6ce2\u90a3\u5951\u6570\u5b57\u6570\u76ee", "Url": "https://leetcode.cn/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 24 Problem 2"}, {"ID": 1415, "Title": "The k-th Lexicographical String of All Happy Strings of Length n", "TitleCn": "\u957f\u5ea6\u4e3a n \u7684\u5f00\u5fc3\u5b57\u7b26\u4e32\u4e2d\u5b57\u5178\u5e8f\u7b2c k \u5c0f\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 24 Problem 3"}, {"ID": 1416, "Title": "Restore The Array", "TitleCn": "\u6062\u590d\u6570\u7ec4", "Url": "https://leetcode.cn/problems/restore-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 24 Problem 4"}, {"ID": 1417, "Title": "Reformat The String", "TitleCn": "\u91cd\u65b0\u683c\u5f0f\u5316\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/reformat-the-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 185 Problem 1"}, {"ID": 1418, "Title": "Display Table of Food Orders in a Restaurant", "TitleCn": "\u70b9\u83dc\u5c55\u793a\u8868", "Url": "https://leetcode.cn/problems/display-table-of-food-orders-in-a-restaurant/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 185 Problem 2"}, {"ID": 1419, "Title": "Minimum Number of Frogs Croaking", "TitleCn": "\u6570\u9752\u86d9", "Url": "https://leetcode.cn/problems/minimum-number-of-frogs-croaking/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 185 Problem 3"}, {"ID": 1420, "Title": "Build Array Where You Can Find The Maximum Exactly K Comparisons", "TitleCn": "\u751f\u6210\u6570\u7ec4", "Url": "https://leetcode.cn/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 185 Problem 4"}, {"ID": 1421, "Title": "NPV Queries", "TitleCn": "\u51c0\u73b0\u503c\u67e5\u8be2", "Url": "https://leetcode.cn/problems/npv-queries/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1422, "Title": "Maximum Score After Splitting a String", "TitleCn": "\u5206\u5272\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-score-after-splitting-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 186 Problem 1"}, {"ID": 1423, "Title": "Maximum Points You Can Obtain from Cards", "TitleCn": "\u53ef\u83b7\u5f97\u7684\u6700\u5927\u70b9\u6570", "Url": "https://leetcode.cn/problems/maximum-points-you-can-obtain-from-cards/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 186 Problem 2"}, {"ID": 1424, "Title": "Diagonal Traverse II", "TitleCn": "\u5bf9\u89d2\u7ebf\u904d\u5386 II", "Url": "https://leetcode.cn/problems/diagonal-traverse-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 186 Problem 3"}, {"ID": 1425, "Title": "Constrained Subsequence Sum", "TitleCn": "\u5e26\u9650\u5236\u7684\u5b50\u5e8f\u5217\u548c", "Url": "https://leetcode.cn/problems/constrained-subsequence-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 186 Problem 4"}, {"ID": 1426, "Title": "Counting Elements", "TitleCn": "\u6570\u5143\u7d20", "Url": "https://leetcode.cn/problems/counting-elements/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1427, "Title": "Perform String Shifts", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u5de6\u53f3\u79fb", "Url": "https://leetcode.cn/problems/perform-string-shifts/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1428, "Title": "Leftmost Column with at Least a One", "TitleCn": "\u81f3\u5c11\u6709\u4e00\u4e2a 1 \u7684\u6700\u5de6\u7aef\u5217", "Url": "https://leetcode.cn/problems/leftmost-column-with-at-least-a-one/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1429, "Title": "First Unique Number", "TitleCn": "\u7b2c\u4e00\u4e2a\u552f\u4e00\u6570\u5b57", "Url": "https://leetcode.cn/problems/first-unique-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1430, "Title": "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree", "TitleCn": "\u5224\u65ad\u7ed9\u5b9a\u7684\u5e8f\u5217\u662f\u5426\u662f\u4e8c\u53c9\u6811\u4ece\u6839\u5230\u53f6\u7684\u8def\u5f84", "Url": "https://leetcode.cn/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1431, "Title": "Kids With the Greatest Number of Candies", "TitleCn": "\u62e5\u6709\u6700\u591a\u7cd6\u679c\u7684\u5b69\u5b50", "Url": "https://leetcode.cn/problems/kids-with-the-greatest-number-of-candies/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 25 Problem 1"}, {"ID": 1432, "Title": "Max Difference You Can Get From Changing an Integer", "TitleCn": "\u6539\u53d8\u4e00\u4e2a\u6574\u6570\u80fd\u5f97\u5230\u7684\u6700\u5927\u5dee\u503c", "Url": "https://leetcode.cn/problems/max-difference-you-can-get-from-changing-an-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 25 Problem 2"}, {"ID": 1433, "Title": "Check If a String Can Break Another String", "TitleCn": "\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u6253\u7834\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/check-if-a-string-can-break-another-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 25 Problem 3"}, {"ID": 1434, "Title": "Number of Ways to Wear Different Hats to Each Other", "TitleCn": "\u6bcf\u4e2a\u4eba\u6234\u4e0d\u540c\u5e3d\u5b50\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-wear-different-hats-to-each-other/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 25 Problem 4"}, {"ID": 1435, "Title": "Create a Session Bar Chart", "TitleCn": "\u5236\u4f5c\u4f1a\u8bdd\u67f1\u72b6\u56fe", "Url": "https://leetcode.cn/problems/create-a-session-bar-chart/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1436, "Title": "Destination City", "TitleCn": "\u65c5\u884c\u7ec8\u70b9\u7ad9", "Url": "https://leetcode.cn/problems/destination-city/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 187 Problem 1"}, {"ID": 1437, "Title": "Check If All 1's Are at Least Length K Places Away", "TitleCn": "\u662f\u5426\u6240\u6709 1 \u90fd\u81f3\u5c11\u76f8\u9694 k \u4e2a\u5143\u7d20", "Url": "https://leetcode.cn/problems/check-if-all-1s-are-at-least-length-k-places-away/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 187 Problem 2"}, {"ID": 1438, "Title": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit", "TitleCn": "\u7edd\u5bf9\u5dee\u4e0d\u8d85\u8fc7\u9650\u5236\u7684\u6700\u957f\u8fde\u7eed\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 187 Problem 3"}, {"ID": 1439, "Title": "Find the Kth Smallest Sum of a Matrix With Sorted Rows", "TitleCn": "\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u7b2c k \u4e2a\u6700\u5c0f\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 187 Problem 4"}, {"ID": 1440, "Title": "Evaluate Boolean Expression", "TitleCn": "\u8ba1\u7b97\u5e03\u5c14\u8868\u8fbe\u5f0f\u7684\u503c", "Url": "https://leetcode.cn/problems/evaluate-boolean-expression/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1441, "Title": "Build an Array With Stack Operations", "TitleCn": "\u7528\u6808\u64cd\u4f5c\u6784\u5efa\u6570\u7ec4", "Url": "https://leetcode.cn/problems/build-an-array-with-stack-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 188 Problem 1"}, {"ID": 1442, "Title": "Count Triplets That Can Form Two Arrays of Equal XOR", "TitleCn": "\u5f62\u6210\u4e24\u4e2a\u5f02\u6216\u76f8\u7b49\u6570\u7ec4\u7684\u4e09\u5143\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 188 Problem 2"}, {"ID": 1443, "Title": "Minimum Time to Collect All Apples in a Tree", "TitleCn": "\u6536\u96c6\u6811\u4e0a\u6240\u6709\u82f9\u679c\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-collect-all-apples-in-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 188 Problem 3"}, {"ID": 1444, "Title": "Number of Ways of Cutting a Pizza", "TitleCn": "\u5207\u62ab\u8428\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-of-cutting-a-pizza/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 188 Problem 4"}, {"ID": 1445, "Title": "Apples & Oranges", "TitleCn": "\u82f9\u679c\u548c\u6854\u5b50", "Url": "https://leetcode.cn/problems/apples-oranges/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1446, "Title": "Consecutive Characters", "TitleCn": "\u8fde\u7eed\u5b57\u7b26", "Url": "https://leetcode.cn/problems/consecutive-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 26 Problem 1"}, {"ID": 1447, "Title": "Simplified Fractions", "TitleCn": "\u6700\u7b80\u5206\u6570", "Url": "https://leetcode.cn/problems/simplified-fractions/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 26 Problem 2"}, {"ID": 1448, "Title": "Count Good Nodes in Binary Tree", "TitleCn": "\u7edf\u8ba1\u4e8c\u53c9\u6811\u4e2d\u597d\u8282\u70b9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-good-nodes-in-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 26 Problem 3"}, {"ID": 1449, "Title": "Form Largest Integer With Digits That Add up to Target", "TitleCn": "\u6570\u4f4d\u6210\u672c\u548c\u4e3a\u76ee\u6807\u503c\u7684\u6700\u5927\u6570\u5b57", "Url": "https://leetcode.cn/problems/form-largest-integer-with-digits-that-add-up-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 26 Problem 4"}, {"ID": 1450, "Title": "Number of Students Doing Homework at a Given Time", "TitleCn": "\u5728\u65e2\u5b9a\u65f6\u95f4\u505a\u4f5c\u4e1a\u7684\u5b66\u751f\u4eba\u6570", "Url": "https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 189 Problem 1"}, {"ID": 1451, "Title": "Rearrange Words in a Sentence", "TitleCn": "\u91cd\u65b0\u6392\u5217\u53e5\u5b50\u4e2d\u7684\u5355\u8bcd", "Url": "https://leetcode.cn/problems/rearrange-words-in-a-sentence/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 189 Problem 2"}, {"ID": 1452, "Title": "People Whose List of Favorite Companies Is Not a Subset of Another List", "TitleCn": "\u6536\u85cf\u6e05\u5355", "Url": "https://leetcode.cn/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 189 Problem 3"}, {"ID": 1453, "Title": "Maximum Number of Darts Inside of a Circular Dartboard", "TitleCn": "\u5706\u5f62\u9776\u5185\u7684\u6700\u5927\u98de\u9556\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-darts-inside-of-a-circular-dartboard/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 189 Problem 4"}, {"ID": 1454, "Title": "Active Users", "TitleCn": "\u6d3b\u8dc3\u7528\u6237", "Url": "https://leetcode.cn/problems/active-users/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1455, "Title": "Check If a Word Occurs As a Prefix of Any Word in a Sentence", "TitleCn": "\u68c0\u67e5\u5355\u8bcd\u662f\u5426\u4e3a\u53e5\u4e2d\u5176\u4ed6\u5355\u8bcd\u7684\u524d\u7f00", "Url": "https://leetcode.cn/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 190 Problem 1"}, {"ID": 1456, "Title": "Maximum Number of Vowels in a Substring of Given Length", "TitleCn": "\u5b9a\u957f\u5b50\u4e32\u4e2d\u5143\u97f3\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-vowels-in-a-substring-of-given-length/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 190 Problem 2"}, {"ID": 1457, "Title": "Pseudo-Palindromic Paths in a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u7684\u4f2a\u56de\u6587\u8def\u5f84", "Url": "https://leetcode.cn/problems/pseudo-palindromic-paths-in-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 190 Problem 3"}, {"ID": 1458, "Title": "Max Dot Product of Two Subsequences", "TitleCn": "\u4e24\u4e2a\u5b50\u5e8f\u5217\u7684\u6700\u5927\u70b9\u79ef", "Url": "https://leetcode.cn/problems/max-dot-product-of-two-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 190 Problem 4"}, {"ID": 1459, "Title": "Rectangles Area", "TitleCn": "\u77e9\u5f62\u9762\u79ef", "Url": "https://leetcode.cn/problems/rectangles-area/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1460, "Title": "Make Two Arrays Equal by Reversing Subarrays", "TitleCn": "\u901a\u8fc7\u7ffb\u8f6c\u5b50\u6570\u7ec4\u4f7f\u4e24\u4e2a\u6570\u7ec4\u76f8\u7b49", "Url": "https://leetcode.cn/problems/make-two-arrays-equal-by-reversing-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 27 Problem 1"}, {"ID": 1461, "Title": "Check If a String Contains All Binary Codes of Size K", "TitleCn": "\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u5305\u542b\u6240\u6709\u957f\u5ea6\u4e3a K \u7684\u4e8c\u8fdb\u5236\u5b50\u4e32", "Url": "https://leetcode.cn/problems/check-if-a-string-contains-all-binary-codes-of-size-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 27 Problem 2"}, {"ID": 1462, "Title": "Course Schedule IV", "TitleCn": "\u8bfe\u7a0b\u8868 IV", "Url": "https://leetcode.cn/problems/course-schedule-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 27 Problem 3"}, {"ID": 1463, "Title": "Cherry Pickup II", "TitleCn": "\u6458\u6a31\u6843 II", "Url": "https://leetcode.cn/problems/cherry-pickup-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 27 Problem 4"}, {"ID": 1464, "Title": "Maximum Product of Two Elements in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u4e24\u5143\u7d20\u7684\u6700\u5927\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-product-of-two-elements-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 191 Problem 1"}, {"ID": 1465, "Title": "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts", "TitleCn": "\u5207\u5272\u540e\u9762\u79ef\u6700\u5927\u7684\u86cb\u7cd5", "Url": "https://leetcode.cn/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 191 Problem 2"}, {"ID": 1466, "Title": "Reorder Routes to Make All Paths Lead to the City Zero", "TitleCn": "\u91cd\u65b0\u89c4\u5212\u8def\u7ebf", "Url": "https://leetcode.cn/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 191 Problem 3"}, {"ID": 1467, "Title": "Probability of a Two Boxes Having The Same Number of Distinct Balls", "TitleCn": "\u4e24\u4e2a\u76d2\u5b50\u4e2d\u7403\u7684\u989c\u8272\u6570\u76f8\u540c\u7684\u6982\u7387", "Url": "https://leetcode.cn/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 191 Problem 4"}, {"ID": 1468, "Title": "Calculate Salaries", "TitleCn": "\u8ba1\u7b97\u7a0e\u540e\u5de5\u8d44", "Url": "https://leetcode.cn/problems/calculate-salaries/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1469, "Title": "Find All The Lonely Nodes", "TitleCn": "\u5bfb\u627e\u6240\u6709\u7684\u72ec\u751f\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-all-the-lonely-nodes/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1470, "Title": "Shuffle the Array", "TitleCn": "\u91cd\u65b0\u6392\u5217\u6570\u7ec4", "Url": "https://leetcode.cn/problems/shuffle-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 192 Problem 1"}, {"ID": 1471, "Title": "The k Strongest Values in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684 k \u4e2a\u6700\u5f3a\u503c", "Url": "https://leetcode.cn/problems/the-k-strongest-values-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 192 Problem 2"}, {"ID": 1472, "Title": "Design Browser History", "TitleCn": "\u8bbe\u8ba1\u6d4f\u89c8\u5668\u5386\u53f2\u8bb0\u5f55", "Url": "https://leetcode.cn/problems/design-browser-history/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 192 Problem 3"}, {"ID": 1473, "Title": "Paint House III", "TitleCn": "\u7c89\u5237\u623f\u5b50 III", "Url": "https://leetcode.cn/problems/paint-house-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 192 Problem 4"}, {"ID": 1474, "Title": "Delete N Nodes After M Nodes of a Linked List", "TitleCn": "\u5220\u9664\u94fe\u8868 M \u4e2a\u8282\u70b9\u4e4b\u540e\u7684 N \u4e2a\u8282\u70b9", "Url": "https://leetcode.cn/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 3, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1475, "Title": "Final Prices With a Special Discount in a Shop", "TitleCn": "\u5546\u54c1\u6298\u6263\u540e\u7684\u6700\u7ec8\u4ef7\u683c", "Url": "https://leetcode.cn/problems/final-prices-with-a-special-discount-in-a-shop/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 28 Problem 1"}, {"ID": 1476, "Title": "Subrectangle Queries", "TitleCn": "\u5b50\u77e9\u5f62\u67e5\u8be2", "Url": "https://leetcode.cn/problems/subrectangle-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 28 Problem 2"}, {"ID": 1477, "Title": "Find Two Non-overlapping Sub-arrays Each With Target Sum", "TitleCn": "\u627e\u4e24\u4e2a\u548c\u4e3a\u76ee\u6807\u503c\u4e14\u4e0d\u91cd\u53e0\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 28 Problem 3"}, {"ID": 1478, "Title": "Allocate Mailboxes", "TitleCn": "\u5b89\u6392\u90ae\u7b52", "Url": "https://leetcode.cn/problems/allocate-mailboxes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 28 Problem 4"}, {"ID": 1479, "Title": "Sales by Day of the Week", "TitleCn": "\u5468\u5185\u6bcf\u5929\u7684\u9500\u552e\u60c5\u51b5", "Url": "https://leetcode.cn/problems/sales-by-day-of-the-week/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1480, "Title": "Running Sum of 1d Array", "TitleCn": "\u4e00\u7ef4\u6570\u7ec4\u7684\u52a8\u6001\u548c", "Url": "https://leetcode.cn/problems/running-sum-of-1d-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 193 Problem 1"}, {"ID": 1481, "Title": "Least Number of Unique Integers after K Removals", "TitleCn": "\u4e0d\u540c\u6574\u6570\u7684\u6700\u5c11\u6570\u76ee", "Url": "https://leetcode.cn/problems/least-number-of-unique-integers-after-k-removals/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 193 Problem 2"}, {"ID": 1482, "Title": "Minimum Number of Days to Make m Bouquets", "TitleCn": "\u5236\u4f5c m \u675f\u82b1\u6240\u9700\u7684\u6700\u5c11\u5929\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-days-to-make-m-bouquets/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 193 Problem 3"}, {"ID": 1483, "Title": "Kth Ancestor of a Tree Node", "TitleCn": "\u6811\u8282\u70b9\u7684\u7b2c K \u4e2a\u7956\u5148", "Url": "https://leetcode.cn/problems/kth-ancestor-of-a-tree-node/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 193 Problem 4"}, {"ID": 1484, "Title": "Group Sold Products By The Date", "TitleCn": "\u6309\u65e5\u671f\u5206\u7ec4\u9500\u552e\u4ea7\u54c1", "Url": "https://leetcode.cn/problems/group-sold-products-by-the-date/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1485, "Title": "Clone Binary Tree With Random Pointer", "TitleCn": "\u514b\u9686\u542b\u968f\u673a\u6307\u9488\u7684\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/clone-binary-tree-with-random-pointer/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1486, "Title": "XOR Operation in an Array", "TitleCn": "\u6570\u7ec4\u5f02\u6216\u64cd\u4f5c", "Url": "https://leetcode.cn/problems/xor-operation-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 194 Problem 1"}, {"ID": 1487, "Title": "Making File Names Unique", "TitleCn": "\u4fdd\u8bc1\u6587\u4ef6\u540d\u552f\u4e00", "Url": "https://leetcode.cn/problems/making-file-names-unique/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 194 Problem 2"}, {"ID": 1488, "Title": "Avoid Flood in The City", "TitleCn": "\u907f\u514d\u6d2a\u6c34\u6cdb\u6ee5", "Url": "https://leetcode.cn/problems/avoid-flood-in-the-city/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 194 Problem 3"}, {"ID": 1489, "Title": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree", "TitleCn": "\u627e\u5230\u6700\u5c0f\u751f\u6210\u6811\u91cc\u7684\u5173\u952e\u8fb9\u548c\u4f2a\u5173\u952e\u8fb9", "Url": "https://leetcode.cn/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 194 Problem 4"}, {"ID": 1490, "Title": "Clone N-ary Tree", "TitleCn": "\u514b\u9686 N \u53c9\u6811", "Url": "https://leetcode.cn/problems/clone-n-ary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1491, "Title": "Average Salary Excluding the Minimum and Maximum Salary", "TitleCn": "\u53bb\u6389\u6700\u4f4e\u5de5\u8d44\u548c\u6700\u9ad8\u5de5\u8d44\u540e\u7684\u5de5\u8d44\u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/average-salary-excluding-the-minimum-and-maximum-salary/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 29 Problem 1"}, {"ID": 1492, "Title": "The kth Factor of n", "TitleCn": "n \u7684\u7b2c k \u4e2a\u56e0\u5b50", "Url": "https://leetcode.cn/problems/the-kth-factor-of-n/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 29 Problem 2"}, {"ID": 1493, "Title": "Longest Subarray of 1's After Deleting One Element", "TitleCn": "\u5220\u6389\u4e00\u4e2a\u5143\u7d20\u4ee5\u540e\u5168\u4e3a 1 \u7684\u6700\u957f\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-subarray-of-1s-after-deleting-one-element/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 29 Problem 3"}, {"ID": 1494, "Title": "Parallel Courses II", "TitleCn": "\u5e76\u884c\u8bfe\u7a0b II", "Url": "https://leetcode.cn/problems/parallel-courses-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 29 Problem 4"}, {"ID": 1495, "Title": "Friendly Movies Streamed Last Month", "TitleCn": "\u4e0a\u6708\u64ad\u653e\u7684\u513f\u7ae5\u9002\u5b9c\u7535\u5f71", "Url": "https://leetcode.cn/problems/friendly-movies-streamed-last-month/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1496, "Title": "Path Crossing", "TitleCn": "\u5224\u65ad\u8def\u5f84\u662f\u5426\u76f8\u4ea4", "Url": "https://leetcode.cn/problems/path-crossing/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 195 Problem 1"}, {"ID": 1497, "Title": "Check If Array Pairs Are Divisible by k", "TitleCn": "\u68c0\u67e5\u6570\u7ec4\u5bf9\u662f\u5426\u53ef\u4ee5\u88ab k \u6574\u9664", "Url": "https://leetcode.cn/problems/check-if-array-pairs-are-divisible-by-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 195 Problem 2"}, {"ID": 1498, "Title": "Number of Subsequences That Satisfy the Given Sum Condition", "TitleCn": "\u6ee1\u8db3\u6761\u4ef6\u7684\u5b50\u5e8f\u5217\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 195 Problem 3"}, {"ID": 1499, "Title": "Max Value of Equation", "TitleCn": "\u6ee1\u8db3\u4e0d\u7b49\u5f0f\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/max-value-of-equation/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 195 Problem 4"}, {"ID": 1500, "Title": "Design a File Sharing System", "TitleCn": "\u8bbe\u8ba1\u6587\u4ef6\u5206\u4eab\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-a-file-sharing-system/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1501, "Title": "Countries You Can Safely Invest In", "TitleCn": "\u53ef\u4ee5\u653e\u5fc3\u6295\u8d44\u7684\u56fd\u5bb6", "Url": "https://leetcode.cn/problems/countries-you-can-safely-invest-in/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1502, "Title": "Can Make Arithmetic Progression From Sequence", "TitleCn": "\u5224\u65ad\u80fd\u5426\u5f62\u6210\u7b49\u5dee\u6570\u5217", "Url": "https://leetcode.cn/problems/can-make-arithmetic-progression-from-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 196 Problem 1"}, {"ID": 1503, "Title": "Last Moment Before All Ants Fall Out of a Plank", "TitleCn": "\u6240\u6709\u8682\u8681\u6389\u4e0b\u6765\u524d\u7684\u6700\u540e\u4e00\u523b", "Url": "https://leetcode.cn/problems/last-moment-before-all-ants-fall-out-of-a-plank/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 196 Problem 2"}, {"ID": 1504, "Title": "Count Submatrices With All Ones", "TitleCn": "\u7edf\u8ba1\u5168 1 \u5b50\u77e9\u5f62", "Url": "https://leetcode.cn/problems/count-submatrices-with-all-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 196 Problem 3"}, {"ID": 1505, "Title": "Minimum Possible Integer After at Most K Adjacent Swaps On Digits", "TitleCn": "\u6700\u591a K \u6b21\u4ea4\u6362\u76f8\u90bb\u6570\u4f4d\u540e\u5f97\u5230\u7684\u6700\u5c0f\u6574\u6570", "Url": "https://leetcode.cn/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 196 Problem 4"}, {"ID": 1506, "Title": "Find Root of N-Ary Tree", "TitleCn": "\u627e\u5230 N \u53c9\u6811\u7684\u6839\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-root-of-n-ary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1507, "Title": "Reformat Date", "TitleCn": "\u8f6c\u53d8\u65e5\u671f\u683c\u5f0f", "Url": "https://leetcode.cn/problems/reformat-date/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 30 Problem 1"}, {"ID": 1508, "Title": "Range Sum of Sorted Subarray Sums", "TitleCn": "\u5b50\u6570\u7ec4\u548c\u6392\u5e8f\u540e\u7684\u533a\u95f4\u548c", "Url": "https://leetcode.cn/problems/range-sum-of-sorted-subarray-sums/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 30 Problem 2"}, {"ID": 1509, "Title": "Minimum Difference Between Largest and Smallest Value in Three Moves", "TitleCn": "\u4e09\u6b21\u64cd\u4f5c\u540e\u6700\u5927\u503c\u4e0e\u6700\u5c0f\u503c\u7684\u6700\u5c0f\u5dee", "Url": "https://leetcode.cn/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 30 Problem 3"}, {"ID": 1510, "Title": "Stone Game IV", "TitleCn": "\u77f3\u5b50\u6e38\u620f IV", "Url": "https://leetcode.cn/problems/stone-game-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 30 Problem 4"}, {"ID": 1511, "Title": "Customer Order Frequency", "TitleCn": "\u6d88\u8d39\u8005\u4e0b\u5355\u9891\u7387", "Url": "https://leetcode.cn/problems/customer-order-frequency/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1512, "Title": "Number of Good Pairs", "TitleCn": "\u597d\u6570\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-good-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 197 Problem 1"}, {"ID": 1513, "Title": "Number of Substrings With Only 1s", "TitleCn": "\u4ec5\u542b 1 \u7684\u5b50\u4e32\u6570", "Url": "https://leetcode.cn/problems/number-of-substrings-with-only-1s/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 197 Problem 2"}, {"ID": 1514, "Title": "Path with Maximum Probability", "TitleCn": "\u6982\u7387\u6700\u5927\u7684\u8def\u5f84", "Url": "https://leetcode.cn/problems/path-with-maximum-probability/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 197 Problem 3"}, {"ID": 1515, "Title": "Best Position for a Service Centre", "TitleCn": "\u670d\u52a1\u4e2d\u5fc3\u7684\u6700\u4f73\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/best-position-for-a-service-centre/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 197 Problem 4"}, {"ID": 1516, "Title": "Move Sub-Tree of N-Ary Tree", "TitleCn": "\u79fb\u52a8 N \u53c9\u6811\u7684\u5b50\u6811", "Url": "https://leetcode.cn/problems/move-sub-tree-of-n-ary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1517, "Title": "Find Users With Valid E-Mails", "TitleCn": "\u67e5\u627e\u62e5\u6709\u6709\u6548\u90ae\u7bb1\u7684\u7528\u6237", "Url": "https://leetcode.cn/problems/find-users-with-valid-e-mails/", "Ispaid": 0, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1518, "Title": "Water Bottles", "TitleCn": "\u6362\u6c34\u95ee\u9898", "Url": "https://leetcode.cn/problems/water-bottles/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 198 Problem 1"}, {"ID": 1519, "Title": "Number of Nodes in the Sub-Tree With the Same Label", "TitleCn": "\u5b50\u6811\u4e2d\u6807\u7b7e\u76f8\u540c\u7684\u8282\u70b9\u6570", "Url": "https://leetcode.cn/problems/number-of-nodes-in-the-sub-tree-with-the-same-label/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 198 Problem 2"}, {"ID": 1520, "Title": "Maximum Number of Non-Overlapping Substrings", "TitleCn": "\u6700\u591a\u7684\u4e0d\u91cd\u53e0\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/maximum-number-of-non-overlapping-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 198 Problem 3"}, {"ID": 1521, "Title": "Find a Value of a Mysterious Function Closest to Target", "TitleCn": "\u627e\u5230\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u51fd\u6570\u503c", "Url": "https://leetcode.cn/problems/find-a-value-of-a-mysterious-function-closest-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 198 Problem 4"}, {"ID": 1522, "Title": "Diameter of N-Ary Tree", "TitleCn": "N \u53c9\u6811\u7684\u76f4\u5f84", "Url": "https://leetcode.cn/problems/diameter-of-n-ary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1523, "Title": "Count Odd Numbers in an Interval Range", "TitleCn": "\u5728\u533a\u95f4\u8303\u56f4\u5185\u7edf\u8ba1\u5947\u6570\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-odd-numbers-in-an-interval-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 31 Problem 1"}, {"ID": 1524, "Title": "Number of Sub-arrays With Odd Sum", "TitleCn": "\u548c\u4e3a\u5947\u6570\u7684\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-sub-arrays-with-odd-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 31 Problem 2"}, {"ID": 1525, "Title": "Number of Good Ways to Split a String", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u597d\u5206\u5272\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-good-ways-to-split-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 31 Problem 3"}, {"ID": 1526, "Title": "Minimum Number of Increments on Subarrays to Form a Target Array", "TitleCn": "\u5f62\u6210\u76ee\u6807\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u6700\u5c11\u589e\u52a0\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 31 Problem 4"}, {"ID": 1527, "Title": "Patients With a Condition", "TitleCn": "\u60a3\u67d0\u79cd\u75be\u75c5\u7684\u60a3\u8005", "Url": "https://leetcode.cn/problems/patients-with-a-condition/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1528, "Title": "Shuffle String", "TitleCn": "\u91cd\u65b0\u6392\u5217\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/shuffle-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 199 Problem 1"}, {"ID": 1529, "Title": "Minimum Suffix Flips", "TitleCn": "\u6700\u5c11\u7684\u540e\u7f00\u7ffb\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-suffix-flips/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 199 Problem 2"}, {"ID": 1530, "Title": "Number of Good Leaf Nodes Pairs", "TitleCn": "\u597d\u53f6\u5b50\u8282\u70b9\u5bf9\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-good-leaf-nodes-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 199 Problem 3"}, {"ID": 1531, "Title": "String Compression II", "TitleCn": "\u538b\u7f29\u5b57\u7b26\u4e32 II", "Url": "https://leetcode.cn/problems/string-compression-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 199 Problem 4"}, {"ID": 1532, "Title": "The Most Recent Three Orders", "TitleCn": "\u6700\u8fd1\u7684\u4e09\u7b14\u8ba2\u5355", "Url": "https://leetcode.cn/problems/the-most-recent-three-orders/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1533, "Title": "Find the Index of the Large Integer", "TitleCn": "\u627e\u5230\u6700\u5927\u6574\u6570\u7684\u7d22\u5f15", "Url": "https://leetcode.cn/problems/find-the-index-of-the-large-integer/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1534, "Title": "Count Good Triplets", "TitleCn": "\u7edf\u8ba1\u597d\u4e09\u5143\u7ec4", "Url": "https://leetcode.cn/problems/count-good-triplets/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 200 Problem 1"}, {"ID": 1535, "Title": "Find the Winner of an Array Game", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u6e38\u620f\u7684\u8d62\u5bb6", "Url": "https://leetcode.cn/problems/find-the-winner-of-an-array-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 200 Problem 2"}, {"ID": 1536, "Title": "Minimum Swaps to Arrange a Binary Grid", "TitleCn": "\u6392\u5e03\u4e8c\u8fdb\u5236\u7f51\u683c\u7684\u6700\u5c11\u4ea4\u6362\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-swaps-to-arrange-a-binary-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 200 Problem 3"}, {"ID": 1537, "Title": "Get the Maximum Score", "TitleCn": "\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/get-the-maximum-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 200 Problem 4"}, {"ID": 1538, "Title": "Guess the Majority in a Hidden Array", "TitleCn": "\u627e\u51fa\u9690\u85cf\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/guess-the-majority-in-a-hidden-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1539, "Title": "Kth Missing Positive Number", "TitleCn": "\u7b2c k \u4e2a\u7f3a\u5931\u7684\u6b63\u6574\u6570", "Url": "https://leetcode.cn/problems/kth-missing-positive-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 6, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 32 Problem 1"}, {"ID": 1540, "Title": "Can Convert String in K Moves", "TitleCn": "K \u6b21\u64cd\u4f5c\u8f6c\u53d8\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/can-convert-string-in-k-moves/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 32 Problem 2"}, {"ID": 1541, "Title": "Minimum Insertions to Balance a Parentheses String", "TitleCn": "\u5e73\u8861\u62ec\u53f7\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-insertions-to-balance-a-parentheses-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 32 Problem 3"}, {"ID": 1542, "Title": "Find Longest Awesome Substring", "TitleCn": "\u627e\u51fa\u6700\u957f\u7684\u8d85\u8d5e\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-longest-awesome-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 32 Problem 4"}, {"ID": 1543, "Title": "Fix Product Name Format", "TitleCn": "\u4ea7\u54c1\u540d\u79f0\u683c\u5f0f\u4fee\u590d", "Url": "https://leetcode.cn/problems/fix-product-name-format/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1544, "Title": "Make The String Great", "TitleCn": "\u6574\u7406\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/make-the-string-great/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 201 Problem 1"}, {"ID": 1545, "Title": "Find Kth Bit in Nth Binary String", "TitleCn": "\u627e\u51fa\u7b2c N \u4e2a\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c K \u4f4d", "Url": "https://leetcode.cn/problems/find-kth-bit-in-nth-binary-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 201 Problem 2"}, {"ID": 1546, "Title": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target", "TitleCn": "\u548c\u4e3a\u76ee\u6807\u503c\u7684\u6700\u5927\u6570\u76ee\u4e0d\u91cd\u53e0\u975e\u7a7a\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 201 Problem 3"}, {"ID": 1547, "Title": "Minimum Cost to Cut a Stick", "TitleCn": "\u5207\u68cd\u5b50\u7684\u6700\u5c0f\u6210\u672c", "Url": "https://leetcode.cn/problems/minimum-cost-to-cut-a-stick/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 201 Problem 4"}, {"ID": 1548, "Title": "The Most Similar Path in a Graph", "TitleCn": "\u56fe\u4e2d\u6700\u76f8\u4f3c\u7684\u8def\u5f84", "Url": "https://leetcode.cn/problems/the-most-similar-path-in-a-graph/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 9, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1549, "Title": "The Most Recent Orders for Each Product", "TitleCn": "\u6bcf\u4ef6\u5546\u54c1\u7684\u6700\u65b0\u8ba2\u5355", "Url": "https://leetcode.cn/problems/the-most-recent-orders-for-each-product/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1550, "Title": "Three Consecutive Odds", "TitleCn": "\u5b58\u5728\u8fde\u7eed\u4e09\u4e2a\u5947\u6570\u7684\u6570\u7ec4", "Url": "https://leetcode.cn/problems/three-consecutive-odds/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 202 Problem 1"}, {"ID": 1551, "Title": "Minimum Operations to Make Array Equal", "TitleCn": "\u4f7f\u6570\u7ec4\u4e2d\u6240\u6709\u5143\u7d20\u76f8\u7b49\u7684\u6700\u5c0f\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-array-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 202 Problem 2"}, {"ID": 1552, "Title": "Magnetic Force Between Two Balls", "TitleCn": "\u4e24\u7403\u4e4b\u95f4\u7684\u78c1\u529b", "Url": "https://leetcode.cn/problems/magnetic-force-between-two-balls/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 202 Problem 3"}, {"ID": 1553, "Title": "Minimum Number of Days to Eat N Oranges", "TitleCn": "\u5403\u6389 N \u4e2a\u6a58\u5b50\u7684\u6700\u5c11\u5929\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-days-to-eat-n-oranges/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 202 Problem 4"}, {"ID": 1554, "Title": "Strings Differ by One Character", "TitleCn": "\u53ea\u6709\u4e00\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/strings-differ-by-one-character/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1555, "Title": "Bank Account Summary", "TitleCn": "\u94f6\u884c\u8d26\u6237\u6982\u8981", "Url": "https://leetcode.cn/problems/bank-account-summary/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1556, "Title": "Thousand Separator", "TitleCn": "\u5343\u4f4d\u5206\u9694\u6570", "Url": "https://leetcode.cn/problems/thousand-separator/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 33 Problem 1"}, {"ID": 1557, "Title": "Minimum Number of Vertices to Reach All Nodes", "TitleCn": "\u53ef\u4ee5\u5230\u8fbe\u6240\u6709\u70b9\u7684\u6700\u5c11\u70b9\u6570\u76ee", "Url": "https://leetcode.cn/problems/minimum-number-of-vertices-to-reach-all-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 33 Problem 2"}, {"ID": 1558, "Title": "Minimum Numbers of Function Calls to Make Target Array", "TitleCn": "\u5f97\u5230\u76ee\u6807\u6570\u7ec4\u7684\u6700\u5c11\u51fd\u6570\u8c03\u7528\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-numbers-of-function-calls-to-make-target-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 33 Problem 3"}, {"ID": 1559, "Title": "Detect Cycles in 2D Grid", "TitleCn": "\u4e8c\u7ef4\u7f51\u683c\u56fe\u4e2d\u63a2\u6d4b\u73af", "Url": "https://leetcode.cn/problems/detect-cycles-in-2d-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 33 Problem 4"}, {"ID": 1560, "Title": "Most Visited Sector in a Circular Track", "TitleCn": "\u5706\u5f62\u8d5b\u9053\u4e0a\u7ecf\u8fc7\u6b21\u6570\u6700\u591a\u7684\u6247\u533a", "Url": "https://leetcode.cn/problems/most-visited-sector-in-a-circular-track/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 203 Problem 1"}, {"ID": 1561, "Title": "Maximum Number of Coins You Can Get", "TitleCn": "\u4f60\u53ef\u4ee5\u83b7\u5f97\u7684\u6700\u5927\u786c\u5e01\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-coins-you-can-get/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 203 Problem 2"}, {"ID": 1562, "Title": "Find Latest Group of Size M", "TitleCn": "\u67e5\u627e\u5927\u5c0f\u4e3a M \u7684\u6700\u65b0\u5206\u7ec4", "Url": "https://leetcode.cn/problems/find-latest-group-of-size-m/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 203 Problem 3"}, {"ID": 1563, "Title": "Stone Game V", "TitleCn": "\u77f3\u5b50\u6e38\u620f V", "Url": "https://leetcode.cn/problems/stone-game-v/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 203 Problem 4"}, {"ID": 1564, "Title": "Put Boxes Into the Warehouse I", "TitleCn": "\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc I", "Url": "https://leetcode.cn/problems/put-boxes-into-the-warehouse-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1565, "Title": "Unique Orders and Customers Per Month", "TitleCn": "\u6309\u6708\u7edf\u8ba1\u8ba2\u5355\u6570\u4e0e\u987e\u5ba2\u6570", "Url": "https://leetcode.cn/problems/unique-orders-and-customers-per-month/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1566, "Title": "Detect Pattern of Length M Repeated K or More Times", "TitleCn": "\u91cd\u590d\u81f3\u5c11 K \u6b21\u4e14\u957f\u5ea6\u4e3a M \u7684\u6a21\u5f0f", "Url": "https://leetcode.cn/problems/detect-pattern-of-length-m-repeated-k-or-more-times/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 204 Problem 1"}, {"ID": 1567, "Title": "Maximum Length of Subarray With Positive Product", "TitleCn": "\u4e58\u79ef\u4e3a\u6b63\u6570\u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6", "Url": "https://leetcode.cn/problems/maximum-length-of-subarray-with-positive-product/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 204 Problem 2"}, {"ID": 1568, "Title": "Minimum Number of Days to Disconnect Island", "TitleCn": "\u4f7f\u9646\u5730\u5206\u79bb\u7684\u6700\u5c11\u5929\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-days-to-disconnect-island/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 204 Problem 3"}, {"ID": 1569, "Title": "Number of Ways to Reorder Array to Get Same BST", "TitleCn": "\u5c06\u5b50\u6570\u7ec4\u91cd\u65b0\u6392\u5e8f\u5f97\u5230\u540c\u4e00\u4e2a\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-reorder-array-to-get-same-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 204 Problem 4"}, {"ID": 1570, "Title": "Dot Product of Two Sparse Vectors", "TitleCn": "\u4e24\u4e2a\u7a00\u758f\u5411\u91cf\u7684\u70b9\u79ef", "Url": "https://leetcode.cn/problems/dot-product-of-two-sparse-vectors/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1571, "Title": "Warehouse Manager", "TitleCn": "\u4ed3\u5e93\u7ecf\u7406", "Url": "https://leetcode.cn/problems/warehouse-manager/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1572, "Title": "Matrix Diagonal Sum", "TitleCn": "\u77e9\u9635\u5bf9\u89d2\u7ebf\u5143\u7d20\u7684\u548c", "Url": "https://leetcode.cn/problems/matrix-diagonal-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 34 Problem 1"}, {"ID": 1573, "Title": "Number of Ways to Split a String", "TitleCn": "\u5206\u5272\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-split-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 34 Problem 2"}, {"ID": 1574, "Title": "Shortest Subarray to be Removed to Make Array Sorted", "TitleCn": "\u5220\u9664\u6700\u77ed\u7684\u5b50\u6570\u7ec4\u4f7f\u5269\u4f59\u6570\u7ec4\u6709\u5e8f", "Url": "https://leetcode.cn/problems/shortest-subarray-to-be-removed-to-make-array-sorted/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 34 Problem 3"}, {"ID": 1575, "Title": "Count All Possible Routes", "TitleCn": "\u7edf\u8ba1\u6240\u6709\u53ef\u884c\u8def\u5f84", "Url": "https://leetcode.cn/problems/count-all-possible-routes/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 34 Problem 4"}, {"ID": 1576, "Title": "Replace All ?'s to Avoid Consecutive Repeating Characters", "TitleCn": "\u66ff\u6362\u6240\u6709\u7684\u95ee\u53f7", "Url": "https://leetcode.cn/problems/replace-all-s-to-avoid-consecutive-repeating-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 205 Problem 1"}, {"ID": 1577, "Title": "Number of Ways Where Square of Number Is Equal to Product of Two Numbers", "TitleCn": "\u6570\u7684\u5e73\u65b9\u7b49\u4e8e\u4e24\u6570\u4e58\u79ef\u7684\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 205 Problem 2"}, {"ID": 1578, "Title": "Minimum Time to Make Rope Colorful", "TitleCn": "\u4f7f\u7ef3\u5b50\u53d8\u6210\u5f69\u8272\u7684\u6700\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-make-rope-colorful/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 205 Problem 3"}, {"ID": 1579, "Title": "Remove Max Number of Edges to Keep Graph Fully Traversable", "TitleCn": "\u4fdd\u8bc1\u56fe\u53ef\u5b8c\u5168\u904d\u5386", "Url": "https://leetcode.cn/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 205 Problem 4"}, {"ID": 1580, "Title": "Put Boxes Into the Warehouse II", "TitleCn": "\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc II", "Url": "https://leetcode.cn/problems/put-boxes-into-the-warehouse-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1581, "Title": "Customer Who Visited but Did Not Make Any Transactions", "TitleCn": "\u8fdb\u5e97\u5374\u672a\u8fdb\u884c\u8fc7\u4ea4\u6613\u7684\u5ba2\u6237", "Url": "https://leetcode.cn/problems/customer-who-visited-but-did-not-make-any-transactions/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1582, "Title": "Special Positions in a Binary Matrix", "TitleCn": "\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u7279\u6b8a\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/special-positions-in-a-binary-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 206 Problem 1"}, {"ID": 1583, "Title": "Count Unhappy Friends", "TitleCn": "\u7edf\u8ba1\u4e0d\u5f00\u5fc3\u7684\u670b\u53cb", "Url": "https://leetcode.cn/problems/count-unhappy-friends/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 206 Problem 2"}, {"ID": 1584, "Title": "Min Cost to Connect All Points", "TitleCn": "\u8fde\u63a5\u6240\u6709\u70b9\u7684\u6700\u5c0f\u8d39\u7528", "Url": "https://leetcode.cn/problems/min-cost-to-connect-all-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 206 Problem 3"}, {"ID": 1585, "Title": "Check If String Is Transformable With Substring Sort Operations", "TitleCn": "\u68c0\u67e5\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u901a\u8fc7\u6392\u5e8f\u5b50\u5b57\u7b26\u4e32\u5f97\u5230\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/check-if-string-is-transformable-with-substring-sort-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 206 Problem 4"}, {"ID": 1586, "Title": "Binary Search Tree Iterator II", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668 II", "Url": "https://leetcode.cn/problems/binary-search-tree-iterator-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1587, "Title": "Bank Account Summary II", "TitleCn": "\u94f6\u884c\u8d26\u6237\u6982\u8981 II", "Url": "https://leetcode.cn/problems/bank-account-summary-ii/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1588, "Title": "Sum of All Odd Length Subarrays", "TitleCn": "\u6240\u6709\u5947\u6570\u957f\u5ea6\u5b50\u6570\u7ec4\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-all-odd-length-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 35 Problem 1"}, {"ID": 1589, "Title": "Maximum Sum Obtained of Any Permutation", "TitleCn": "\u6240\u6709\u6392\u5217\u4e2d\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-obtained-of-any-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 35 Problem 2"}, {"ID": 1590, "Title": "Make Sum Divisible by P", "TitleCn": "\u4f7f\u6570\u7ec4\u548c\u80fd\u88ab P \u6574\u9664", "Url": "https://leetcode.cn/problems/make-sum-divisible-by-p/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 35 Problem 3"}, {"ID": 1591, "Title": "Strange Printer II", "TitleCn": "\u5947\u602a\u7684\u6253\u5370\u673a II", "Url": "https://leetcode.cn/problems/strange-printer-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 35 Problem 4"}, {"ID": 1592, "Title": "Rearrange Spaces Between Words", "TitleCn": "\u91cd\u65b0\u6392\u5217\u5355\u8bcd\u95f4\u7684\u7a7a\u683c", "Url": "https://leetcode.cn/problems/rearrange-spaces-between-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 207 Problem 1"}, {"ID": 1593, "Title": "Split a String Into the Max Number of Unique Substrings", "TitleCn": "\u62c6\u5206\u5b57\u7b26\u4e32\u4f7f\u552f\u4e00\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee\u6700\u5927", "Url": "https://leetcode.cn/problems/split-a-string-into-the-max-number-of-unique-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 207 Problem 2"}, {"ID": 1594, "Title": "Maximum Non Negative Product in a Matrix", "TitleCn": "\u77e9\u9635\u7684\u6700\u5927\u975e\u8d1f\u79ef", "Url": "https://leetcode.cn/problems/maximum-non-negative-product-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 207 Problem 3"}, {"ID": 1595, "Title": "Minimum Cost to Connect Two Groups of Points", "TitleCn": "\u8fde\u901a\u4e24\u7ec4\u70b9\u7684\u6700\u5c0f\u6210\u672c", "Url": "https://leetcode.cn/problems/minimum-cost-to-connect-two-groups-of-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 207 Problem 4"}, {"ID": 1596, "Title": "The Most Frequently Ordered Products for Each Customer", "TitleCn": "\u6bcf\u4f4d\u987e\u5ba2\u6700\u7ecf\u5e38\u8ba2\u8d2d\u7684\u5546\u54c1", "Url": "https://leetcode.cn/problems/the-most-frequently-ordered-products-for-each-customer/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1597, "Title": "Build Binary Expression Tree From Infix Expression", "TitleCn": "\u6839\u636e\u4e2d\u7f00\u8868\u8fbe\u5f0f\u6784\u9020\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811", "Url": "https://leetcode.cn/problems/build-binary-expression-tree-from-infix-expression/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1598, "Title": "Crawler Log Folder", "TitleCn": "\u6587\u4ef6\u5939\u64cd\u4f5c\u65e5\u5fd7\u641c\u96c6\u5668", "Url": "https://leetcode.cn/problems/crawler-log-folder/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 208 Problem 1"}, {"ID": 1599, "Title": "Maximum Profit of Operating a Centennial Wheel", "TitleCn": "\u7ecf\u8425\u6469\u5929\u8f6e\u7684\u6700\u5927\u5229\u6da6", "Url": "https://leetcode.cn/problems/maximum-profit-of-operating-a-centennial-wheel/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 208 Problem 2"}, {"ID": 1600, "Title": "Throne Inheritance", "TitleCn": "\u738b\u4f4d\u7ee7\u627f\u987a\u5e8f", "Url": "https://leetcode.cn/problems/throne-inheritance/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 208 Problem 3"}, {"ID": 1601, "Title": "Maximum Number of Achievable Transfer Requests", "TitleCn": "\u6700\u591a\u53ef\u8fbe\u6210\u7684\u6362\u697c\u8bf7\u6c42\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-achievable-transfer-requests/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 208 Problem 4"}, {"ID": 1602, "Title": "Find Nearest Right Node in Binary Tree", "TitleCn": "\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u6700\u8fd1\u7684\u53f3\u4fa7\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-nearest-right-node-in-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1603, "Title": "Design Parking System", "TitleCn": "\u8bbe\u8ba1\u505c\u8f66\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-parking-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 36 Problem 1"}, {"ID": 1604, "Title": "Alert Using Same Key-Card Three or More Times in a One Hour Period", "TitleCn": "\u8b66\u544a\u4e00\u5c0f\u65f6\u5185\u4f7f\u7528\u76f8\u540c\u5458\u5de5\u5361\u5927\u4e8e\u7b49\u4e8e\u4e09\u6b21\u7684\u4eba", "Url": "https://leetcode.cn/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 36 Problem 2"}, {"ID": 1605, "Title": "Find Valid Matrix Given Row and Column Sums", "TitleCn": "\u7ed9\u5b9a\u884c\u548c\u5217\u7684\u548c\u6c42\u53ef\u884c\u77e9\u9635", "Url": "https://leetcode.cn/problems/find-valid-matrix-given-row-and-column-sums/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 36 Problem 3"}, {"ID": 1606, "Title": "Find Servers That Handled Most Number of Requests", "TitleCn": "\u627e\u5230\u5904\u7406\u6700\u591a\u8bf7\u6c42\u7684\u670d\u52a1\u5668", "Url": "https://leetcode.cn/problems/find-servers-that-handled-most-number-of-requests/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 36 Problem 4"}, {"ID": 1607, "Title": "Sellers With No Sales", "TitleCn": "\u6ca1\u6709\u5356\u51fa\u7684\u5356\u5bb6", "Url": "https://leetcode.cn/problems/sellers-with-no-sales/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1608, "Title": "Special Array With X Elements Greater Than or Equal X", "TitleCn": "\u7279\u6b8a\u6570\u7ec4\u7684\u7279\u5f81\u503c", "Url": "https://leetcode.cn/problems/special-array-with-x-elements-greater-than-or-equal-x/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 209 Problem 1"}, {"ID": 1609, "Title": "Even Odd Tree", "TitleCn": "\u5947\u5076\u6811", "Url": "https://leetcode.cn/problems/even-odd-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 209 Problem 2"}, {"ID": 1610, "Title": "Maximum Number of Visible Points", "TitleCn": "\u53ef\u89c1\u70b9\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-visible-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 209 Problem 3"}, {"ID": 1611, "Title": "Minimum One Bit Operations to Make Integers Zero", "TitleCn": "\u4f7f\u6574\u6570\u53d8\u4e3a 0 \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-one-bit-operations-to-make-integers-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 209 Problem 4"}, {"ID": 1612, "Title": "Check If Two Expression Trees are Equivalent", "TitleCn": "\u68c0\u67e5\u4e24\u68f5\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811\u662f\u5426\u7b49\u4ef7", "Url": "https://leetcode.cn/problems/check-if-two-expression-trees-are-equivalent/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1613, "Title": "Find the Missing IDs", "TitleCn": "\u627e\u5230\u9057\u5931\u7684ID", "Url": "https://leetcode.cn/problems/find-the-missing-ids/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1614, "Title": "Maximum Nesting Depth of the Parentheses", "TitleCn": "\u62ec\u53f7\u7684\u6700\u5927\u5d4c\u5957\u6df1\u5ea6", "Url": "https://leetcode.cn/problems/maximum-nesting-depth-of-the-parentheses/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 210 Problem 1"}, {"ID": 1615, "Title": "Maximal Network Rank", "TitleCn": "\u6700\u5927\u7f51\u7edc\u79e9", "Url": "https://leetcode.cn/problems/maximal-network-rank/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 210 Problem 2"}, {"ID": 1616, "Title": "Split Two Strings to Make Palindrome", "TitleCn": "\u5206\u5272\u4e24\u4e2a\u5b57\u7b26\u4e32\u5f97\u5230\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/split-two-strings-to-make-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 210 Problem 3"}, {"ID": 1617, "Title": "Count Subtrees With Max Distance Between Cities", "TitleCn": "\u7edf\u8ba1\u5b50\u6811\u4e2d\u57ce\u5e02\u4e4b\u95f4\u6700\u5927\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/count-subtrees-with-max-distance-between-cities/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 210 Problem 4"}, {"ID": 1618, "Title": "Maximum Font to Fit a Sentence in a Screen", "TitleCn": "\u627e\u51fa\u9002\u5e94\u5c4f\u5e55\u7684\u6700\u5927\u5b57\u53f7", "Url": "https://leetcode.cn/problems/maximum-font-to-fit-a-sentence-in-a-screen/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1619, "Title": "Mean of Array After Removing Some Elements", "TitleCn": "\u5220\u9664\u67d0\u4e9b\u5143\u7d20\u540e\u7684\u6570\u7ec4\u5747\u503c", "Url": "https://leetcode.cn/problems/mean-of-array-after-removing-some-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 37 Problem 1"}, {"ID": 1620, "Title": "Coordinate With Maximum Network Quality", "TitleCn": "\u7f51\u7edc\u4fe1\u53f7\u6700\u597d\u7684\u5750\u6807", "Url": "https://leetcode.cn/problems/coordinate-with-maximum-network-quality/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 37 Problem 2"}, {"ID": 1621, "Title": "Number of Sets of K Non-Overlapping Line Segments", "TitleCn": "\u5927\u5c0f\u4e3a K \u7684\u4e0d\u91cd\u53e0\u7ebf\u6bb5\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-sets-of-k-non-overlapping-line-segments/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 37 Problem 3"}, {"ID": 1622, "Title": "Fancy Sequence", "TitleCn": "\u5947\u5999\u5e8f\u5217", "Url": "https://leetcode.cn/problems/fancy-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 37 Problem 4"}, {"ID": 1623, "Title": "All Valid Triplets That Can Represent a Country", "TitleCn": "\u4e09\u4eba\u56fd\u5bb6\u4ee3\u8868\u961f", "Url": "https://leetcode.cn/problems/all-valid-triplets-that-can-represent-a-country", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1624, "Title": "Largest Substring Between Two Equal Characters", "TitleCn": "\u4e24\u4e2a\u76f8\u540c\u5b57\u7b26\u4e4b\u95f4\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/largest-substring-between-two-equal-characters", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 211 Problem 1"}, {"ID": 1625, "Title": "Lexicographically Smallest String After Applying Operations", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u540e\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-smallest-string-after-applying-operations", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 211 Problem 2"}, {"ID": 1626, "Title": "Best Team With No Conflicts", "TitleCn": "\u65e0\u77db\u76fe\u7684\u6700\u4f73\u7403\u961f", "Url": "https://leetcode.cn/problems/best-team-with-no-conflicts", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 211 Problem 3"}, {"ID": 1627, "Title": "Graph Connectivity With Threshold", "TitleCn": "\u5e26\u9608\u503c\u7684\u56fe\u8fde\u901a\u6027", "Url": "https://leetcode.cn/problems/graph-connectivity-with-threshold", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 211 Problem 4"}, {"ID": 1628, "Title": "Design an Expression Tree With Evaluate Function", "TitleCn": "\u8bbe\u8ba1\u5e26\u89e3\u6790\u51fd\u6570\u7684\u8868\u8fbe\u5f0f\u6811", "Url": "https://leetcode.cn/problems/design-an-expression-tree-with-evaluate-function/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1629, "Title": "Slowest Key", "TitleCn": "\u6309\u952e\u6301\u7eed\u65f6\u95f4\u6700\u957f\u7684\u952e", "Url": "https://leetcode.cn/problems/slowest-key/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 212 Problem 1"}, {"ID": 1630, "Title": "Arithmetic Subarrays", "TitleCn": "\u7b49\u5dee\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/arithmetic-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 212 Problem 2"}, {"ID": 1631, "Title": "Path With Minimum Effort", "TitleCn": "\u6700\u5c0f\u4f53\u529b\u6d88\u8017\u8def\u5f84", "Url": "https://leetcode.cn/problems/path-with-minimum-effort/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 212 Problem 3"}, {"ID": 1632, "Title": "Rank Transform of a Matrix", "TitleCn": "\u77e9\u9635\u8f6c\u6362\u540e\u7684\u79e9", "Url": "https://leetcode.cn/problems/rank-transform-of-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 212 Problem 4"}, {"ID": 1633, "Title": "Percentage of Users Attended a Contest", "TitleCn": "\u5404\u8d5b\u4e8b\u7684\u7528\u6237\u6ce8\u518c\u7387", "Url": "https://leetcode.cn/problems/percentage-of-users-attended-a-contest/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1634, "Title": "Add Two Polynomials Represented as Linked Lists", "TitleCn": "\u6c42\u4e24\u4e2a\u591a\u9879\u5f0f\u94fe\u8868\u7684\u548c", "Url": "https://leetcode.cn/problems/add-two-polynomials-represented-as-linked-lists/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1635, "Title": "Hopper Company Queries I", "TitleCn": "Hopper \u516c\u53f8\u67e5\u8be2 I", "Url": "https://leetcode.cn/problems/hopper-company-queries-i/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1636, "Title": "Sort Array by Increasing Frequency", "TitleCn": "\u6309\u7167\u9891\u7387\u5c06\u6570\u7ec4\u5347\u5e8f\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-array-by-increasing-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 38 Problem 1"}, {"ID": 1637, "Title": "Widest Vertical Area Between Two Points Containing No Points", "TitleCn": "\u4e24\u70b9\u4e4b\u95f4\u4e0d\u5305\u542b\u4efb\u4f55\u70b9\u7684\u6700\u5bbd\u5782\u76f4\u9762\u79ef", "Url": "https://leetcode.cn/problems/widest-vertical-area-between-two-points-containing-no-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 38 Problem 2"}, {"ID": 1638, "Title": "Count Substrings That Differ by One Character", "TitleCn": "\u7edf\u8ba1\u53ea\u5dee\u4e00\u4e2a\u5b57\u7b26\u7684\u5b50\u4e32\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-substrings-that-differ-by-one-character/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 38 Problem 3"}, {"ID": 1639, "Title": "Number of Ways to Form a Target String Given a Dictionary", "TitleCn": "\u901a\u8fc7\u7ed9\u5b9a\u8bcd\u5178\u6784\u9020\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-form-a-target-string-given-a-dictionary/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 38 Problem 4"}, {"ID": 1640, "Title": "Check Array Formation Through Concatenation", "TitleCn": "\u80fd\u5426\u8fde\u63a5\u5f62\u6210\u6570\u7ec4", "Url": "https://leetcode.cn/problems/check-array-formation-through-concatenation/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 213 Problem 1"}, {"ID": 1641, "Title": "Count Sorted Vowel Strings", "TitleCn": "\u7edf\u8ba1\u5b57\u5178\u5e8f\u5143\u97f3\u5b57\u7b26\u4e32\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-sorted-vowel-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 213 Problem 2"}, {"ID": 1642, "Title": "Furthest Building You Can Reach", "TitleCn": "\u53ef\u4ee5\u5230\u8fbe\u7684\u6700\u8fdc\u5efa\u7b51", "Url": "https://leetcode.cn/problems/furthest-building-you-can-reach/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 213 Problem 3"}, {"ID": 1643, "Title": "Kth Smallest Instructions", "TitleCn": "\u7b2c K \u6761\u6700\u5c0f\u6307\u4ee4", "Url": "https://leetcode.cn/problems/kth-smallest-instructions/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 213 Problem 4"}, {"ID": 1644, "Title": "Lowest Common Ancestor of a Binary Tree II", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 II", "Url": "https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 5, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1645, "Title": "Hopper Company Queries II", "TitleCn": "Hopper \u516c\u53f8\u67e5\u8be2 II", "Url": "https://leetcode.cn/problems/hopper-company-queries-ii/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1646, "Title": "Get Maximum in Generated Array", "TitleCn": "\u83b7\u53d6\u751f\u6210\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/get-maximum-in-generated-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 214 Problem 1"}, {"ID": 1647, "Title": "Minimum Deletions to Make Character Frequencies Unique", "TitleCn": "\u5b57\u7b26\u9891\u6b21\u552f\u4e00\u7684\u6700\u5c0f\u5220\u9664\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-deletions-to-make-character-frequencies-unique/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 214 Problem 2"}, {"ID": 1648, "Title": "Sell Diminishing-Valued Colored Balls", "TitleCn": "\u9500\u552e\u4ef7\u503c\u51cf\u5c11\u7684\u989c\u8272\u7403", "Url": "https://leetcode.cn/problems/sell-diminishing-valued-colored-balls/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 214 Problem 3"}, {"ID": 1649, "Title": "Create Sorted Array through Instructions", "TitleCn": "\u901a\u8fc7\u6307\u4ee4\u521b\u5efa\u6709\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/create-sorted-array-through-instructions/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 214 Problem 4"}, {"ID": 1650, "Title": "Lowest Common Ancestor of a Binary Tree III", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 III", "Url": "https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree-iii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1651, "Title": "Hopper Company Queries III", "TitleCn": "Hopper \u516c\u53f8\u67e5\u8be2 III", "Url": "https://leetcode.cn/problems/hopper-company-queries-iii/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1652, "Title": "Defuse the Bomb", "TitleCn": "\u62c6\u70b8\u5f39", "Url": "https://leetcode.cn/problems/defuse-the-bomb/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 39 Problem 1"}, {"ID": 1653, "Title": "Minimum Deletions to Make String Balanced", "TitleCn": "\u4f7f\u5b57\u7b26\u4e32\u5e73\u8861\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-deletions-to-make-string-balanced/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 39 Problem 2"}, {"ID": 1654, "Title": "Minimum Jumps to Reach Home", "TitleCn": "\u5230\u5bb6\u7684\u6700\u5c11\u8df3\u8dc3\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-jumps-to-reach-home/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 39 Problem 3"}, {"ID": 1655, "Title": "Distribute Repeating Integers", "TitleCn": "\u5206\u914d\u91cd\u590d\u6574\u6570", "Url": "https://leetcode.cn/problems/distribute-repeating-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 39 Problem 4"}, {"ID": 1656, "Title": "Design an Ordered Stream", "TitleCn": "\u8bbe\u8ba1\u6709\u5e8f\u6d41", "Url": "https://leetcode.cn/problems/design-an-ordered-stream", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 215 Problem 1"}, {"ID": 1657, "Title": "Determine if Two Strings Are Close", "TitleCn": "\u786e\u5b9a\u4e24\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u63a5\u8fd1", "Url": "https://leetcode.cn/problems/determine-if-two-strings-are-close", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 215 Problem 2"}, {"ID": 1658, "Title": "Minimum Operations to Reduce X to Zero", "TitleCn": "\u5c06 x \u51cf\u5230 0 \u7684\u6700\u5c0f\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-reduce-x-to-zero", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 215 Problem 3"}, {"ID": 1659, "Title": "Maximize Grid Happiness", "TitleCn": "\u6700\u5927\u5316\u7f51\u683c\u5e78\u798f\u611f", "Url": "https://leetcode.cn/problems/maximize-grid-happiness", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 215 Problem 4"}, {"ID": 1660, "Title": "Correct a Binary Tree", "TitleCn": "\u7ea0\u6b63\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/correct-a-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1661, "Title": "Average Time of Process per Machine", "TitleCn": "\u6bcf\u53f0\u673a\u5668\u7684\u8fdb\u7a0b\u5e73\u5747\u8fd0\u884c\u65f6\u95f4", "Url": "https://leetcode.cn/problems/average-time-of-process-per-machine/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1662, "Title": "Check If Two String Arrays are Equivalent", "TitleCn": "\u68c0\u67e5\u4e24\u4e2a\u5b57\u7b26\u4e32\u6570\u7ec4\u662f\u5426\u76f8\u7b49", "Url": "https://leetcode.cn/problems/check-if-two-string-arrays-are-equivalent/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 216 Problem 1"}, {"ID": 1663, "Title": "Smallest String With A Given Numeric Value", "TitleCn": "\u5177\u6709\u7ed9\u5b9a\u6570\u503c\u7684\u6700\u5c0f\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/smallest-string-with-a-given-numeric-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 216 Problem 2"}, {"ID": 1664, "Title": "Ways to Make a Fair Array", "TitleCn": "\u751f\u6210\u5e73\u8861\u6570\u7ec4\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/ways-to-make-a-fair-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 216 Problem 3"}, {"ID": 1665, "Title": "Minimum Initial Energy to Finish Tasks", "TitleCn": "\u5b8c\u6210\u6240\u6709\u4efb\u52a1\u7684\u6700\u5c11\u521d\u59cb\u80fd\u91cf", "Url": "https://leetcode.cn/problems/minimum-initial-energy-to-finish-tasks/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 216 Problem 4"}, {"ID": 1666, "Title": "Change the Root of a Binary Tree", "TitleCn": "\u6539\u53d8\u4e8c\u53c9\u6811\u7684\u6839\u8282\u70b9", "Url": "https://leetcode.cn/problems/change-the-root-of-a-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1667, "Title": "Fix Names in a Table", "TitleCn": "\u4fee\u590d\u8868\u4e2d\u7684\u540d\u5b57", "Url": "https://leetcode.cn/problems/fix-names-in-a-table/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1668, "Title": "Maximum Repeating Substring", "TitleCn": "\u6700\u5927\u91cd\u590d\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/maximum-repeating-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 40 Problem 1"}, {"ID": 1669, "Title": "Merge In Between Linked Lists", "TitleCn": "\u5408\u5e76\u4e24\u4e2a\u94fe\u8868", "Url": "https://leetcode.cn/problems/merge-in-between-linked-lists/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 40 Problem 2"}, {"ID": 1670, "Title": "Design Front Middle Back Queue", "TitleCn": "\u8bbe\u8ba1\u524d\u4e2d\u540e\u961f\u5217", "Url": "https://leetcode.cn/problems/design-front-middle-back-queue/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 40 Problem 3"}, {"ID": 1671, "Title": "Minimum Number of Removals to Make Mountain Array", "TitleCn": "\u5f97\u5230\u5c71\u5f62\u6570\u7ec4\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-removals-to-make-mountain-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 40 Problem 4"}, {"ID": 1672, "Title": "Richest Customer Wealth", "TitleCn": "\u6700\u5bcc\u6709\u5ba2\u6237\u7684\u8d44\u4ea7\u603b\u91cf", "Url": "https://leetcode.cn/problems/richest-customer-wealth/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 217 Problem 1"}, {"ID": 1673, "Title": "Find the Most Competitive Subsequence", "TitleCn": "\u627e\u51fa\u6700\u5177\u7ade\u4e89\u529b\u7684\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/find-the-most-competitive-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 217 Problem 2"}, {"ID": 1674, "Title": "Minimum Moves to Make Array Complementary", "TitleCn": "\u4f7f\u6570\u7ec4\u4e92\u8865\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-moves-to-make-array-complementary/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 217 Problem 3"}, {"ID": 1675, "Title": "Minimize Deviation in Array", "TitleCn": "\u6570\u7ec4\u7684\u6700\u5c0f\u504f\u79fb\u91cf", "Url": "https://leetcode.cn/problems/minimize-deviation-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 217 Problem 4"}, {"ID": 1676, "Title": "Lowest Common Ancestor of a Binary Tree IV", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 IV", "Url": "https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree-iv/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1677, "Title": "Product's Worth Over Invoices", "TitleCn": "\u53d1\u7968\u4e2d\u7684\u4ea7\u54c1\u91d1\u989d", "Url": "https://leetcode.cn/problems/products-worth-over-invoices/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1678, "Title": "Goal Parser Interpretation", "TitleCn": "\u8bbe\u8ba1 Goal \u89e3\u6790\u5668", "Url": "https://leetcode.cn/problems/goal-parser-interpretation/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 218 Problem 1"}, {"ID": 1679, "Title": "Max Number of K-Sum Pairs", "TitleCn": "K \u548c\u6570\u5bf9\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/max-number-of-k-sum-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 218 Problem 2"}, {"ID": 1680, "Title": "Concatenation of Consecutive Binary Numbers", "TitleCn": "\u8fde\u63a5\u8fde\u7eed\u4e8c\u8fdb\u5236\u6570\u5b57", "Url": "https://leetcode.cn/problems/concatenation-of-consecutive-binary-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 218 Problem 3"}, {"ID": 1681, "Title": "Minimum Incompatibility", "TitleCn": "\u6700\u5c0f\u4e0d\u517c\u5bb9\u6027", "Url": "https://leetcode.cn/problems/minimum-incompatibility/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 218 Problem 4"}, {"ID": 1682, "Title": "Longest Palindromic Subsequence II", "TitleCn": "\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217 II", "Url": "https://leetcode.cn/problems/longest-palindromic-subsequence-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1683, "Title": "Invalid Tweets", "TitleCn": "\u65e0\u6548\u7684\u63a8\u6587", "Url": "https://leetcode.cn/problems/invalid-tweets/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1684, "Title": "Count the Number of Consistent Strings", "TitleCn": "\u7edf\u8ba1\u4e00\u81f4\u5b57\u7b26\u4e32\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-consistent-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 41 Problem 1"}, {"ID": 1685, "Title": "Sum of Absolute Differences in a Sorted Array", "TitleCn": "\u6709\u5e8f\u6570\u7ec4\u4e2d\u5dee\u7edd\u5bf9\u503c\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-absolute-differences-in-a-sorted-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 41 Problem 2"}, {"ID": 1686, "Title": "Stone Game VI", "TitleCn": "\u77f3\u5b50\u6e38\u620f VI", "Url": "https://leetcode.cn/problems/stone-game-vi/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 41 Problem 3"}, {"ID": 1687, "Title": "Delivering Boxes from Storage to Ports", "TitleCn": "\u4ece\u4ed3\u5e93\u5230\u7801\u5934\u8fd0\u8f93\u7bb1\u5b50", "Url": "https://leetcode.cn/problems/delivering-boxes-from-storage-to-ports/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 41 Problem 4"}, {"ID": 1688, "Title": "Count of Matches in Tournament", "TitleCn": "\u6bd4\u8d5b\u4e2d\u7684\u914d\u5bf9\u6b21\u6570", "Url": "https://leetcode.cn/problems/count-of-matches-in-tournament/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 219 Problem 1"}, {"ID": 1689, "Title": "Partitioning Into Minimum Number Of Deci-Binary Numbers", "TitleCn": "\u5341-\u4e8c\u8fdb\u5236\u6570\u7684\u6700\u5c11\u6570\u76ee", "Url": "https://leetcode.cn/problems/partitioning-into-minimum-number-of-deci-binary-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 219 Problem 2"}, {"ID": 1690, "Title": "Stone Game VII", "TitleCn": "\u77f3\u5b50\u6e38\u620f VII", "Url": "https://leetcode.cn/problems/stone-game-vii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 219 Problem 3"}, {"ID": 1691, "Title": "Maximum Height by Stacking Cuboids", "TitleCn": "\u5806\u53e0\u957f\u65b9\u4f53\u7684\u6700\u5927\u9ad8\u5ea6", "Url": "https://leetcode.cn/problems/maximum-height-by-stacking-cuboids/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 219 Problem 4"}, {"ID": 1692, "Title": "Count Ways to Distribute Candies", "TitleCn": "\u8ba1\u7b97\u5206\u914d\u7cd6\u679c\u7684\u4e0d\u540c\u65b9\u5f0f", "Url": "https://leetcode.cn/problems/count-ways-to-distribute-candies/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1693, "Title": "Daily Leads and Partners", "TitleCn": "\u6bcf\u5929\u7684\u9886\u5bfc\u548c\u5408\u4f19\u4eba", "Url": "https://leetcode.cn/problems/daily-leads-and-partners/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1694, "Title": "Reformat Phone Number", "TitleCn": "\u91cd\u65b0\u683c\u5f0f\u5316\u7535\u8bdd\u53f7\u7801", "Url": "https://leetcode.cn/problems/reformat-phone-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 220 Problem 1"}, {"ID": 1695, "Title": "Maximum Erasure Value", "TitleCn": "\u5220\u9664\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-erasure-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 220 Problem 2"}, {"ID": 1696, "Title": "Jump Game VI", "TitleCn": "\u8df3\u8dc3\u6e38\u620f VI", "Url": "https://leetcode.cn/problems/jump-game-vi/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 220 Problem 3"}, {"ID": 1697, "Title": "Checking Existence of Edge Length Limited Paths", "TitleCn": "\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728", "Url": "https://leetcode.cn/problems/checking-existence-of-edge-length-limited-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 220 Problem 4"}, {"ID": 1698, "Title": "Number of Distinct Substrings in a String", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u4e0d\u540c\u5b50\u5b57\u7b26\u4e32\u4e2a\u6570", "Url": "https://leetcode.cn/problems/number-of-distinct-substrings-in-a-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 11, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1699, "Title": "Number of Calls Between Two Persons", "TitleCn": "\u4e24\u4eba\u4e4b\u95f4\u7684\u901a\u8bdd\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-calls-between-two-persons/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1700, "Title": "Number of Students Unable to Eat Lunch", "TitleCn": "\u65e0\u6cd5\u5403\u5348\u9910\u7684\u5b66\u751f\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-students-unable-to-eat-lunch/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 42 Problem 1"}, {"ID": 1701, "Title": "Average Waiting Time", "TitleCn": "\u5e73\u5747\u7b49\u5f85\u65f6\u95f4", "Url": "https://leetcode.cn/problems/average-waiting-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 42 Problem 2"}, {"ID": 1702, "Title": "Maximum Binary String After Change", "TitleCn": "\u4fee\u6539\u540e\u7684\u6700\u5927\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/maximum-binary-string-after-change/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 42 Problem 3"}, {"ID": 1703, "Title": "Minimum Adjacent Swaps for K Consecutive Ones", "TitleCn": "\u5f97\u5230\u8fde\u7eed K \u4e2a 1 \u7684\u6700\u5c11\u76f8\u90bb\u4ea4\u6362\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-adjacent-swaps-for-k-consecutive-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 42 Problem 4"}, {"ID": 1704, "Title": "Determine if String Halves Are Alike", "TitleCn": "\u5224\u65ad\u5b57\u7b26\u4e32\u7684\u4e24\u534a\u662f\u5426\u76f8\u4f3c", "Url": "https://leetcode.cn/problems/determine-if-string-halves-are-alike/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 221 Problem 1"}, {"ID": 1705, "Title": "Maximum Number of Eaten Apples", "TitleCn": "\u5403\u82f9\u679c\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-eaten-apples/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 221 Problem 2"}, {"ID": 1706, "Title": "Where Will the Ball Fall", "TitleCn": "\u7403\u4f1a\u843d\u4f55\u5904", "Url": "https://leetcode.cn/problems/where-will-the-ball-fall/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 221 Problem 3"}, {"ID": 1707, "Title": "Maximum XOR With an Element From Array", "TitleCn": "\u4e0e\u6570\u7ec4\u4e2d\u5143\u7d20\u7684\u6700\u5927\u5f02\u6216\u503c", "Url": "https://leetcode.cn/problems/maximum-xor-with-an-element-from-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 221 Problem 4"}, {"ID": 1708, "Title": "Largest Subarray Length K", "TitleCn": "\u957f\u5ea6\u4e3a K \u7684\u6700\u5927\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/largest-subarray-length-k/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 9, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1709, "Title": "Biggest Window Between Visits", "TitleCn": "\u8bbf\u95ee\u65e5\u671f\u4e4b\u95f4\u6700\u5927\u7684\u7a7a\u6863\u671f", "Url": "https://leetcode.cn/problems/biggest-window-between-visits/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1710, "Title": "Maximum Units on a Truck", "TitleCn": "\u5361\u8f66\u4e0a\u7684\u6700\u5927\u5355\u5143\u6570", "Url": "https://leetcode.cn/problems/maximum-units-on-a-truck/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 222 Problem 1"}, {"ID": 1711, "Title": "Count Good Meals", "TitleCn": "\u5927\u9910\u8ba1\u6570", "Url": "https://leetcode.cn/problems/count-good-meals/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 222 Problem 2"}, {"ID": 1712, "Title": "Ways to Split Array Into Three Subarrays", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u6210\u4e09\u4e2a\u5b50\u6570\u7ec4\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/ways-to-split-array-into-three-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 222 Problem 3"}, {"ID": 1713, "Title": "Minimum Operations to Make a Subsequence", "TitleCn": "\u5f97\u5230\u5b50\u5e8f\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-a-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 222 Problem 4"}, {"ID": 1714, "Title": "Sum Of Special Evenly-Spaced Elements In Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7279\u6b8a\u7b49\u95f4\u8ddd\u5143\u7d20\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-special-evenly-spaced-elements-in-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1715, "Title": "Count Apples and Oranges", "TitleCn": "\u82f9\u679c\u548c\u6a58\u5b50\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-apples-and-oranges/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1716, "Title": "Calculate Money in Leetcode Bank", "TitleCn": "\u8ba1\u7b97\u529b\u6263\u94f6\u884c\u7684\u94b1", "Url": "https://leetcode.cn/problems/calculate-money-in-leetcode-bank/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 43 Problem 1"}, {"ID": 1717, "Title": "Maximum Score From Removing Substrings", "TitleCn": "\u5220\u9664\u5b50\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-score-from-removing-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 43 Problem 2"}, {"ID": 1718, "Title": "Construct the Lexicographically Largest Valid Sequence", "TitleCn": "\u6784\u5efa\u5b57\u5178\u5e8f\u6700\u5927\u7684\u53ef\u884c\u5e8f\u5217", "Url": "https://leetcode.cn/problems/construct-the-lexicographically-largest-valid-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 43 Problem 3"}, {"ID": 1719, "Title": "Number Of Ways To Reconstruct A Tree", "TitleCn": "\u91cd\u6784\u4e00\u68f5\u6811\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-reconstruct-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 43 Problem 4"}, {"ID": 1720, "Title": "Decode XORed Array", "TitleCn": "\u89e3\u7801\u5f02\u6216\u540e\u7684\u6570\u7ec4", "Url": "https://leetcode.cn/problems/decode-xored-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 223 Problem 1"}, {"ID": 1721, "Title": "Swapping Nodes in a Linked List", "TitleCn": "\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/swapping-nodes-in-a-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 223 Problem 2"}, {"ID": 1722, "Title": "Minimize Hamming Distance After Swap Operations", "TitleCn": "\u6267\u884c\u4ea4\u6362\u64cd\u4f5c\u540e\u7684\u6700\u5c0f\u6c49\u660e\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/minimize-hamming-distance-after-swap-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 223 Problem 3"}, {"ID": 1723, "Title": "Find Minimum Time to Finish All Jobs", "TitleCn": "\u5b8c\u6210\u6240\u6709\u5de5\u4f5c\u7684\u6700\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/find-minimum-time-to-finish-all-jobs/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 223 Problem 4"}, {"ID": 1724, "Title": "Checking Existence of Edge Length Limited Paths II", "TitleCn": "\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728 II", "Url": "https://leetcode.cn/problems/checking-existence-of-edge-length-limited-paths-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1725, "Title": "Number Of Rectangles That Can Form The Largest Square", "TitleCn": "\u53ef\u4ee5\u5f62\u6210\u6700\u5927\u6b63\u65b9\u5f62\u7684\u77e9\u5f62\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-rectangles-that-can-form-the-largest-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 224 Problem 1"}, {"ID": 1726, "Title": "Tuple with Same Product", "TitleCn": "\u540c\u79ef\u5143\u7ec4", "Url": "https://leetcode.cn/problems/tuple-with-same-product/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 224 Problem 2"}, {"ID": 1727, "Title": "Largest Submatrix With Rearrangements", "TitleCn": "\u91cd\u65b0\u6392\u5217\u540e\u7684\u6700\u5927\u5b50\u77e9\u9635", "Url": "https://leetcode.cn/problems/largest-submatrix-with-rearrangements/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 224 Problem 3"}, {"ID": 1728, "Title": "Cat and Mouse II", "TitleCn": "\u732b\u548c\u8001\u9f20 II", "Url": "https://leetcode.cn/problems/cat-and-mouse-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 224 Problem 4"}, {"ID": 1729, "Title": "Find Followers Count", "TitleCn": "\u6c42\u5173\u6ce8\u8005\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/find-followers-count/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1730, "Title": "Shortest Path to Get Food", "TitleCn": "\u83b7\u53d6\u98df\u7269\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-path-to-get-food/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1731, "Title": "The Number of Employees Which Report to Each Employee", "TitleCn": "\u6bcf\u4f4d\u7ecf\u7406\u7684\u4e0b\u5c5e\u5458\u5de5\u6570\u91cf", "Url": "https://leetcode.cn/problems/the-number-of-employees-which-report-to-each-employee/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1732, "Title": "Find the Highest Altitude", "TitleCn": "\u627e\u5230\u6700\u9ad8\u6d77\u62d4", "Url": "https://leetcode.cn/problems/find-the-highest-altitude/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 44 Problem 1"}, {"ID": 1733, "Title": "Minimum Number of People to Teach", "TitleCn": "\u9700\u8981\u6559\u8bed\u8a00\u7684\u6700\u5c11\u4eba\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-people-to-teach/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 44 Problem 2"}, {"ID": 1734, "Title": "Decode XORed Permutation", "TitleCn": "\u89e3\u7801\u5f02\u6216\u540e\u7684\u6392\u5217", "Url": "https://leetcode.cn/problems/decode-xored-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 44 Problem 3"}, {"ID": 1735, "Title": "Count Ways to Make Array With Product", "TitleCn": "\u751f\u6210\u4e58\u79ef\u6570\u7ec4\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/count-ways-to-make-array-with-product/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 44 Problem 4"}, {"ID": 1736, "Title": "Latest Time by Replacing Hidden Digits", "TitleCn": "\u66ff\u6362\u9690\u85cf\u6570\u5b57\u5f97\u5230\u7684\u6700\u665a\u65f6\u95f4", "Url": "https://leetcode.cn/problems/latest-time-by-replacing-hidden-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 225 Problem 1"}, {"ID": 1737, "Title": "Change Minimum Characters to Satisfy One of Three Conditions", "TitleCn": "\u6ee1\u8db3\u4e09\u6761\u4ef6\u4e4b\u4e00\u9700\u6539\u53d8\u7684\u6700\u5c11\u5b57\u7b26\u6570", "Url": "https://leetcode.cn/problems/change-minimum-characters-to-satisfy-one-of-three-conditions/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 225 Problem 2"}, {"ID": 1738, "Title": "Find Kth Largest XOR Coordinate Value", "TitleCn": "\u627e\u51fa\u7b2c K \u5927\u7684\u5f02\u6216\u5750\u6807\u503c", "Url": "https://leetcode.cn/problems/find-kth-largest-xor-coordinate-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 225 Problem 3"}, {"ID": 1739, "Title": "Building Boxes", "TitleCn": "\u653e\u7f6e\u76d2\u5b50", "Url": "https://leetcode.cn/problems/building-boxes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 225 Problem 4"}, {"ID": 1740, "Title": "Find Distance in a Binary Tree", "TitleCn": "\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u7684\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/find-distance-in-a-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1741, "Title": "Find Total Time Spent by Each Employee", "TitleCn": "\u67e5\u627e\u6bcf\u4e2a\u5458\u5de5\u82b1\u8d39\u7684\u603b\u65f6\u95f4", "Url": "https://leetcode.cn/problems/find-total-time-spent-by-each-employee/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1742, "Title": "Maximum Number of Balls in a Box", "TitleCn": "\u76d2\u5b50\u4e2d\u5c0f\u7403\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-balls-in-a-box/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 226 Problem 1"}, {"ID": 1743, "Title": "Restore the Array From Adjacent Pairs", "TitleCn": "\u4ece\u76f8\u90bb\u5143\u7d20\u5bf9\u8fd8\u539f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/restore-the-array-from-adjacent-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 226 Problem 2"}, {"ID": 1744, "Title": "Can You Eat Your Favorite Candy on Your Favorite Day?", "TitleCn": "\u4f60\u80fd\u5728\u4f60\u6700\u559c\u6b22\u7684\u90a3\u5929\u5403\u5230\u4f60\u6700\u559c\u6b22\u7684\u7cd6\u679c\u5417\uff1f", "Url": "https://leetcode.cn/problems/can-you-eat-your-favorite-candy-on-your-favorite-day/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 226 Problem 3"}, {"ID": 1745, "Title": "Palindrome Partitioning IV", "TitleCn": "\u5206\u5272\u56de\u6587\u4e32 IV", "Url": "https://leetcode.cn/problems/palindrome-partitioning-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 226 Problem 4"}, {"ID": 1746, "Title": "Maximum Subarray Sum After One Operation", "TitleCn": "\u7ecf\u8fc7\u4e00\u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5b50\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/maximum-subarray-sum-after-one-operation/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1747, "Title": "Leetflex Banned Accounts", "TitleCn": "\u5e94\u8be5\u88ab\u7981\u6b62\u7684Leetflex\u8d26\u6237", "Url": "https://leetcode.cn/problems/leetflex-banned-accounts/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1748, "Title": "Sum of Unique Elements", "TitleCn": "\u552f\u4e00\u5143\u7d20\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-unique-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 45 Problem 1"}, {"ID": 1749, "Title": "Maximum Absolute Sum of Any Subarray", "TitleCn": "\u4efb\u610f\u5b50\u6570\u7ec4\u548c\u7684\u7edd\u5bf9\u503c\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/maximum-absolute-sum-of-any-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 45 Problem 2"}, {"ID": 1750, "Title": "Minimum Length of String After Deleting Similar Ends", "TitleCn": "\u5220\u9664\u5b57\u7b26\u4e32\u4e24\u7aef\u76f8\u540c\u5b57\u7b26\u540e\u7684\u6700\u77ed\u957f\u5ea6", "Url": "https://leetcode.cn/problems/minimum-length-of-string-after-deleting-similar-ends/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 45 Problem 3"}, {"ID": 1751, "Title": "Maximum Number of Events That Can Be Attended II", "TitleCn": "\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee II", "Url": "https://leetcode.cn/problems/maximum-number-of-events-that-can-be-attended-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 45 Problem 4"}, {"ID": 1752, "Title": "Check if Array Is Sorted and Rotated", "TitleCn": "\u68c0\u67e5\u6570\u7ec4\u662f\u5426\u7ecf\u6392\u5e8f\u548c\u8f6e\u8f6c\u5f97\u5230", "Url": "https://leetcode.cn/problems/check-if-array-is-sorted-and-rotated/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 227 Problem 1"}, {"ID": 1753, "Title": "Maximum Score From Removing Stones", "TitleCn": "\u79fb\u9664\u77f3\u5b50\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-score-from-removing-stones/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 227 Problem 2"}, {"ID": 1754, "Title": "Largest Merge Of Two Strings", "TitleCn": "\u6784\u9020\u5b57\u5178\u5e8f\u6700\u5927\u7684\u5408\u5e76\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/largest-merge-of-two-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 227 Problem 3"}, {"ID": 1755, "Title": "Closest Subsequence Sum", "TitleCn": "\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u5b50\u5e8f\u5217\u548c", "Url": "https://leetcode.cn/problems/closest-subsequence-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 227 Problem 4"}, {"ID": 1756, "Title": "Design Most Recently Used Queue", "TitleCn": "\u8bbe\u8ba1\u6700\u8fd1\u4f7f\u7528\uff08MRU\uff09\u961f\u5217", "Url": "https://leetcode.cn/problems/design-most-recently-used-queue/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1757, "Title": "Recyclable and Low Fat Products", "TitleCn": "\u53ef\u56de\u6536\u4e14\u4f4e\u8102\u7684\u4ea7\u54c1", "Url": "https://leetcode.cn/problems/recyclable-and-low-fat-products/", "Ispaid": 0, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1758, "Title": "Minimum Changes To Make Alternating Binary String", "TitleCn": "\u751f\u6210\u4ea4\u66ff\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-changes-to-make-alternating-binary-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 228 Problem 1"}, {"ID": 1759, "Title": "Count Number of Homogenous Substrings", "TitleCn": "\u7edf\u8ba1\u540c\u8d28\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-homogenous-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 228 Problem 2"}, {"ID": 1760, "Title": "Minimum Limit of Balls in a Bag", "TitleCn": "\u888b\u5b50\u91cc\u6700\u5c11\u6570\u76ee\u7684\u7403", "Url": "https://leetcode.cn/problems/minimum-limit-of-balls-in-a-bag/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 228 Problem 3"}, {"ID": 1761, "Title": "Minimum Degree of a Connected Trio in a Graph", "TitleCn": "\u4e00\u4e2a\u56fe\u4e2d\u8fde\u901a\u4e09\u5143\u7ec4\u7684\u6700\u5c0f\u5ea6\u6570", "Url": "https://leetcode.cn/problems/minimum-degree-of-a-connected-trio-in-a-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 228 Problem 4"}, {"ID": 1762, "Title": "Buildings With an Ocean View", "TitleCn": "\u80fd\u770b\u5230\u6d77\u666f\u7684\u5efa\u7b51\u7269", "Url": "https://leetcode.cn/problems/buildings-with-an-ocean-view/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1763, "Title": "Longest Nice Substring", "TitleCn": "\u6700\u957f\u7684\u7f8e\u597d\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/longest-nice-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 46 Problem 1"}, {"ID": 1764, "Title": "Form Array by Concatenating Subarrays of Another Array", "TitleCn": "\u901a\u8fc7\u8fde\u63a5\u53e6\u4e00\u4e2a\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u5f97\u5230\u4e00\u4e2a\u6570\u7ec4", "Url": "https://leetcode.cn/problems/form-array-by-concatenating-subarrays-of-another-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 46 Problem 2"}, {"ID": 1765, "Title": "Map of Highest Peak", "TitleCn": "\u5730\u56fe\u4e2d\u7684\u6700\u9ad8\u70b9", "Url": "https://leetcode.cn/problems/map-of-highest-peak/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 46 Problem 3"}, {"ID": 1766, "Title": "Tree of Coprimes", "TitleCn": "\u4e92\u8d28\u6811", "Url": "https://leetcode.cn/problems/tree-of-coprimes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 46 Problem 4"}, {"ID": 1767, "Title": "Find the Subtasks That Did Not Execute", "TitleCn": "\u5bfb\u627e\u6ca1\u6709\u88ab\u6267\u884c\u7684\u4efb\u52a1\u5bf9", "Url": "https://leetcode.cn/problems/find-the-subtasks-that-did-not-execute/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1768, "Title": "Merge Strings Alternately", "TitleCn": "\u4ea4\u66ff\u5408\u5e76\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/merge-strings-alternately/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 229 Problem 1"}, {"ID": 1769, "Title": "Minimum Number of Operations to Move All Balls to Each Box", "TitleCn": "\u79fb\u52a8\u6240\u6709\u7403\u5230\u6bcf\u4e2a\u76d2\u5b50\u6240\u9700\u7684\u6700\u5c0f\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 229 Problem 2"}, {"ID": 1770, "Title": "Maximum Score from Performing Multiplication Operations", "TitleCn": "\u6267\u884c\u4e58\u6cd5\u8fd0\u7b97\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-score-from-performing-multiplication-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 229 Problem 3"}, {"ID": 1771, "Title": "Maximize Palindrome Length From Subsequences", "TitleCn": "\u7531\u5b50\u5e8f\u5217\u6784\u9020\u7684\u6700\u957f\u56de\u6587\u4e32\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/maximize-palindrome-length-from-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 229 Problem 4"}, {"ID": 1772, "Title": "Sort Features by Popularity", "TitleCn": "\u6309\u53d7\u6b22\u8fce\u7a0b\u5ea6\u6392\u5217\u529f\u80fd", "Url": "https://leetcode.cn/problems/sort-features-by-popularity/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1773, "Title": "Count Items Matching a Rule", "TitleCn": "\u7edf\u8ba1\u5339\u914d\u68c0\u7d22\u89c4\u5219\u7684\u7269\u54c1\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-items-matching-a-rule/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 230 Problem 1"}, {"ID": 1774, "Title": "Closest Dessert Cost", "TitleCn": "\u6700\u63a5\u8fd1\u76ee\u6807\u4ef7\u683c\u7684\u751c\u70b9\u6210\u672c", "Url": "https://leetcode.cn/problems/closest-dessert-cost/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 230 Problem 2"}, {"ID": 1775, "Title": "Equal Sum Arrays With Minimum Number of Operations", "TitleCn": "\u901a\u8fc7\u6700\u5c11\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u7684\u548c\u76f8\u7b49", "Url": "https://leetcode.cn/problems/equal-sum-arrays-with-minimum-number-of-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 230 Problem 3"}, {"ID": 1776, "Title": "Car Fleet II", "TitleCn": "\u8f66\u961f II", "Url": "https://leetcode.cn/problems/car-fleet-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 230 Problem 4"}, {"ID": 1777, "Title": "Product's Price for Each Store", "TitleCn": "\u6bcf\u5bb6\u5546\u5e97\u7684\u4ea7\u54c1\u4ef7\u683c", "Url": "https://leetcode.cn/problems/products-price-for-each-store/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1778, "Title": "Shortest Path in a Hidden Grid", "TitleCn": "\u672a\u77e5\u7f51\u683c\u4e2d\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/shortest-path-in-a-hidden-grid/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1779, "Title": "Find Nearest Point That Has the Same X or Y Coordinate", "TitleCn": "\u627e\u5230\u6700\u8fd1\u7684\u6709\u76f8\u540c X \u6216 Y \u5750\u6807\u7684\u70b9", "Url": "https://leetcode.cn/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 47 Problem 1"}, {"ID": 1780, "Title": "Check if Number is a Sum of Powers of Three", "TitleCn": "\u5224\u65ad\u4e00\u4e2a\u6570\u5b57\u662f\u5426\u53ef\u4ee5\u8868\u793a\u6210\u4e09\u7684\u5e42\u7684\u548c", "Url": "https://leetcode.cn/problems/check-if-number-is-a-sum-of-powers-of-three/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 47 Problem 2"}, {"ID": 1781, "Title": "Sum of Beauty of All Substrings", "TitleCn": "\u6240\u6709\u5b50\u5b57\u7b26\u4e32\u7f8e\u4e3d\u503c\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-beauty-of-all-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 47 Problem 3"}, {"ID": 1782, "Title": "Count Pairs Of Nodes", "TitleCn": "\u7edf\u8ba1\u70b9\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/contest/biweekly-contest-47/problems/count-pairs-of-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 47 Problem 4"}, {"ID": 1783, "Title": "Grand Slam Titles", "TitleCn": "\u5927\u6ee1\u8d2f\u6570\u91cf", "Url": "https://leetcode.cn/problems/grand-slam-titles/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1784, "Title": "Check if Binary String Has at Most One Segment of Ones", "TitleCn": "\u68c0\u67e5\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u6bb5", "Url": "https://leetcode.cn/problems/check-if-binary-string-has-at-most-one-segment-of-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 231 Problem 1"}, {"ID": 1785, "Title": "Minimum Elements to Add to Form a Given Sum", "TitleCn": "\u6784\u6210\u7279\u5b9a\u548c\u9700\u8981\u6dfb\u52a0\u7684\u6700\u5c11\u5143\u7d20", "Url": "https://leetcode.cn/problems/minimum-elements-to-add-to-form-a-given-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 231 Problem 2"}, {"ID": 1786, "Title": "Number of Restricted Paths From First to Last Node", "TitleCn": "\u4ece\u7b2c\u4e00\u4e2a\u8282\u70b9\u51fa\u53d1\u5230\u6700\u540e\u4e00\u4e2a\u8282\u70b9\u7684\u53d7\u9650\u8def\u5f84\u6570", "Url": "https://leetcode.cn/problems/number-of-restricted-paths-from-first-to-last-node/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 231 Problem 3"}, {"ID": 1787, "Title": "Make the XOR of All Segments Equal to Zero", "TitleCn": "\u4f7f\u6240\u6709\u533a\u95f4\u7684\u5f02\u6216\u7ed3\u679c\u4e3a\u96f6", "Url": "https://leetcode.cn/problems/make-the-xor-of-all-segments-equal-to-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 231 Problem 4"}, {"ID": 1788, "Title": "Maximize the Beauty of the Garden", "TitleCn": "\u6700\u5927\u5316\u82b1\u56ed\u7684\u7f8e\u89c2\u5ea6", "Url": "https://leetcode.cn/problems/maximize-the-beauty-of-the-garden/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1789, "Title": "Primary Department for Each Employee", "TitleCn": "\u5458\u5de5\u7684\u76f4\u5c5e\u90e8\u95e8", "Url": "https://leetcode.cn/problems/primary-department-for-each-employee/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1790, "Title": "Check if One String Swap Can Make Strings Equal", "TitleCn": "\u4ec5\u6267\u884c\u4e00\u6b21\u5b57\u7b26\u4e32\u4ea4\u6362\u80fd\u5426\u4f7f\u4e24\u4e2a\u5b57\u7b26\u4e32\u76f8\u7b49", "Url": "https://leetcode.cn/problems/check-if-one-string-swap-can-make-strings-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 232 Problem 1"}, {"ID": 1791, "Title": "Find Center of Star Graph", "TitleCn": "\u627e\u51fa\u661f\u578b\u56fe\u7684\u4e2d\u5fc3\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-center-of-star-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 232 Problem 2"}, {"ID": 1792, "Title": "Maximum Average Pass Ratio", "TitleCn": "\u6700\u5927\u5e73\u5747\u901a\u8fc7\u7387", "Url": "https://leetcode.cn/problems/maximum-average-pass-ratio/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 232 Problem 3"}, {"ID": 1793, "Title": "Maximum Score of a Good Subarray", "TitleCn": "\u597d\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-score-of-a-good-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 232 Problem 4"}, {"ID": 1794, "Title": "Count Pairs of Equal Substrings With Minimum Difference", "TitleCn": "\u7edf\u8ba1\u8ddd\u79bb\u6700\u5c0f\u7684\u5b50\u4e32\u5bf9\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-pairs-of-equal-substrings-with-minimum-difference/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1795, "Title": "Rearrange Products Table", "TitleCn": "\u6bcf\u4e2a\u4ea7\u54c1\u5728\u4e0d\u540c\u5546\u5e97\u7684\u4ef7\u683c", "Url": "https://leetcode.cn/problems/rearrange-products-table/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1796, "Title": "Second Largest Digit in a String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u7b2c\u4e8c\u5927\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/second-largest-digit-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 48 Problem 1"}, {"ID": 1797, "Title": "Design Authentication Manager", "TitleCn": "\u8bbe\u8ba1\u4e00\u4e2a\u9a8c\u8bc1\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-authentication-manager/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 48 Problem 2"}, {"ID": 1798, "Title": "Maximum Number of Consecutive Values You Can Make", "TitleCn": "\u4f60\u80fd\u6784\u9020\u51fa\u8fde\u7eed\u503c\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-consecutive-values-you-can-make/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 48 Problem 3"}, {"ID": 1799, "Title": "Maximize Score After N Operations", "TitleCn": "N \u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5206\u6570\u548c", "Url": "https://leetcode.cn/problems/maximize-score-after-n-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 48 Problem 4"}, {"ID": 1800, "Title": "Maximum Ascending Subarray Sum", "TitleCn": "\u6700\u5927\u5347\u5e8f\u5b50\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/maximum-ascending-subarray-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 233 Problem 1"}, {"ID": 1801, "Title": "Number of Orders in the Backlog", "TitleCn": "\u79ef\u538b\u8ba2\u5355\u4e2d\u7684\u8ba2\u5355\u603b\u6570", "Url": "https://leetcode.cn/problems/number-of-orders-in-the-backlog/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 233 Problem 2"}, {"ID": 1802, "Title": "Maximum Value at a Given Index in a Bounded Array", "TitleCn": "\u6709\u754c\u6570\u7ec4\u4e2d\u6307\u5b9a\u4e0b\u6807\u5904\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/maximum-value-at-a-given-index-in-a-bounded-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 233 Problem 3"}, {"ID": 1803, "Title": "Count Pairs With XOR in a Range", "TitleCn": "\u7edf\u8ba1\u5f02\u6216\u503c\u5728\u8303\u56f4\u5185\u7684\u6570\u5bf9\u6709\u591a\u5c11", "Url": "https://leetcode.cn/problems/count-pairs-with-xor-in-a-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 233 Problem 4"}, {"ID": 1804, "Title": "Implement Trie II (Prefix Tree)", "TitleCn": "\u5b9e\u73b0 Trie \uff08\u524d\u7f00\u6811\uff09 II", "Url": "https://leetcode.cn/problems/implement-trie-ii-prefix-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1805, "Title": "Number of Different Integers in a String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u4e0d\u540c\u6574\u6570\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-different-integers-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 234 Problem 1"}, {"ID": 1806, "Title": "Minimum Number of Operations to Reinitialize a Permutation", "TitleCn": "\u8fd8\u539f\u6392\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b65\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-reinitialize-a-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 234 Problem 2"}, {"ID": 1807, "Title": "Evaluate the Bracket Pairs of a String", "TitleCn": "\u66ff\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u62ec\u53f7\u5185\u5bb9", "Url": "https://leetcode.cn/problems/evaluate-the-bracket-pairs-of-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 234 Problem 3"}, {"ID": 1808, "Title": "Maximize Number of Nice Divisors", "TitleCn": "\u597d\u56e0\u5b50\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximize-number-of-nice-divisors/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 234 Problem 4"}, {"ID": 1809, "Title": "Ad-Free Sessions", "TitleCn": "\u6ca1\u6709\u5e7f\u544a\u7684\u5267\u96c6", "Url": "https://leetcode.cn/problems/ad-free-sessions/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1810, "Title": "Minimum Path Cost in a Hidden Grid", "TitleCn": "\u9690\u85cf\u7f51\u683c\u4e0b\u7684\u6700\u5c0f\u6d88\u8017\u8def\u5f84", "Url": "https://leetcode.cn/problems/minimum-path-cost-in-a-hidden-grid/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1811, "Title": "Find Interview Candidates", "TitleCn": "\u5bfb\u627e\u9762\u8bd5\u5019\u9009\u4eba", "Url": "https://leetcode.cn/problems/find-interview-candidates/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1812, "Title": "Determine Color of a Chessboard Square", "TitleCn": "\u5224\u65ad\u56fd\u9645\u8c61\u68cb\u68cb\u76d8\u4e2d\u4e00\u4e2a\u683c\u5b50\u7684\u989c\u8272", "Url": "https://leetcode.cn/problems/determine-color-of-a-chessboard-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 49 Problem 1"}, {"ID": 1813, "Title": "Sentence Similarity III", "TitleCn": "\u53e5\u5b50\u76f8\u4f3c\u6027 III", "Url": "https://leetcode.cn/problems/sentence-similarity-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 49 Problem 2"}, {"ID": 1814, "Title": "Count Nice Pairs in an Array", "TitleCn": "\u7edf\u8ba1\u4e00\u4e2a\u6570\u7ec4\u4e2d\u597d\u5bf9\u5b50\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-nice-pairs-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 49 Problem 3"}, {"ID": 1815, "Title": "Maximum Number of Groups Getting Fresh Donuts", "TitleCn": "\u5f97\u5230\u65b0\u9c9c\u751c\u751c\u5708\u7684\u6700\u591a\u7ec4\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-groups-getting-fresh-donuts/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 49 Problem 4"}, {"ID": 1816, "Title": "Truncate Sentence", "TitleCn": "\u622a\u65ad\u53e5\u5b50", "Url": "https://leetcode.cn/problems/truncate-sentence/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 235 Problem 1"}, {"ID": 1817, "Title": "Finding the Users Active Minutes", "TitleCn": "\u67e5\u627e\u7528\u6237\u6d3b\u8dc3\u5206\u949f\u6570", "Url": "https://leetcode.cn/problems/finding-the-users-active-minutes/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 235 Problem 2"}, {"ID": 1818, "Title": "Minimum Absolute Sum Difference", "TitleCn": "\u7edd\u5bf9\u5dee\u503c\u548c", "Url": "https://leetcode.cn/problems/minimum-absolute-sum-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 235 Problem 3"}, {"ID": 1819, "Title": "Number of Different Subsequences GCDs", "TitleCn": "\u5e8f\u5217\u4e2d\u4e0d\u540c\u6700\u5927\u516c\u7ea6\u6570\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-different-subsequences-gcds/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 235 Problem 4"}, {"ID": 1820, "Title": "Maximum Number of Accepted Invitations", "TitleCn": "\u6700\u591a\u9080\u8bf7\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-accepted-invitations/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1821, "Title": "Find Customers With Positive Revenue this Year", "TitleCn": "\u5bfb\u627e\u4eca\u5e74\u5177\u6709\u6b63\u6536\u5165\u7684\u5ba2\u6237", "Url": "https://leetcode.cn/problems/find-customers-with-positive-revenue-this-year/", "Ispaid": 1, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1822, "Title": "Sign of the Product of an Array", "TitleCn": "\u6570\u7ec4\u5143\u7d20\u79ef\u7684\u7b26\u53f7", "Url": "https://leetcode.cn/problems/sign-of-the-product-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 236 Problem 1"}, {"ID": 1823, "Title": "Find the Winner of the Circular Game", "TitleCn": "\u627e\u51fa\u6e38\u620f\u7684\u83b7\u80dc\u8005", "Url": "https://leetcode.cn/problems/find-the-winner-of-the-circular-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 236 Problem 2"}, {"ID": 1824, "Title": "Minimum Sideway Jumps", "TitleCn": "\u6700\u5c11\u4fa7\u8df3\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-sideway-jumps/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 236 Problem 3"}, {"ID": 1825, "Title": "Finding MK Average", "TitleCn": "\u6c42\u51fa MK \u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/finding-mk-average/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 236 Problem 4"}, {"ID": 1826, "Title": "Faulty Sensor", "TitleCn": "\u6709\u7f3a\u9677\u7684\u4f20\u611f\u5668", "Url": "https://leetcode.cn/problems/faulty-sensor/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1827, "Title": "Minimum Operations to Make the Array Increasing", "TitleCn": "\u6700\u5c11\u64cd\u4f5c\u4f7f\u6570\u7ec4\u9012\u589e", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-the-array-increasing/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 50 Problem 1"}, {"ID": 1828, "Title": "Queries on Number of Points Inside a Circle", "TitleCn": "\u7edf\u8ba1\u4e00\u4e2a\u5706\u4e2d\u70b9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/queries-on-number-of-points-inside-a-circle/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 11, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 50 Problem 2"}, {"ID": 1829, "Title": "Maximum XOR for Each Query", "TitleCn": "\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5927\u5f02\u6216\u503c", "Url": "https://leetcode.cn/problems/maximum-xor-for-each-query/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 50 Problem 3"}, {"ID": 1830, "Title": "Minimum Number of Operations to Make String Sorted", "TitleCn": "\u4f7f\u5b57\u7b26\u4e32\u6709\u5e8f\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-string-sorted/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 50 Problem 4"}, {"ID": 1831, "Title": "Maximum Transaction Each Day", "TitleCn": "\u6bcf\u5929\u7684\u6700\u5927\u4ea4\u6613", "Url": "https://leetcode.cn/problems/maximum-transaction-each-day/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1832, "Title": "Check if the Sentence Is Pangram", "TitleCn": "\u5224\u65ad\u53e5\u5b50\u662f\u5426\u4e3a\u5168\u5b57\u6bcd\u53e5", "Url": "https://leetcode.cn/problems/check-if-the-sentence-is-pangram/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 237 Problem 1"}, {"ID": 1833, "Title": "Maximum Ice Cream Bars", "TitleCn": "\u96ea\u7cd5\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-ice-cream-bars/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 237 Problem 2"}, {"ID": 1834, "Title": "Single-Threaded CPU", "TitleCn": "\u5355\u7ebf\u7a0b CPU", "Url": "https://leetcode.cn/problems/single-threaded-cpu/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 237 Problem 3"}, {"ID": 1835, "Title": "Find XOR Sum of All Pairs Bitwise AND", "TitleCn": "\u6240\u6709\u6570\u5bf9\u6309\u4f4d\u4e0e\u7ed3\u679c\u7684\u5f02\u6216\u548c", "Url": "https://leetcode.cn/problems/find-xor-sum-of-all-pairs-bitwise-and/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 237 Problem 4"}, {"ID": 1836, "Title": "Remove Duplicates From an Unsorted Linked List", "TitleCn": "\u4ece\u672a\u6392\u5e8f\u7684\u94fe\u8868\u4e2d\u79fb\u9664\u91cd\u590d\u5143\u7d20", "Url": "https://leetcode.cn/problems/remove-duplicates-from-an-unsorted-linked-list/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1837, "Title": "Sum of Digits in Base K", "TitleCn": "K \u8fdb\u5236\u8868\u793a\u4e0b\u7684\u5404\u4f4d\u6570\u5b57\u603b\u548c", "Url": "https://leetcode.cn/problems/sum-of-digits-in-base-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 238 Problem 1"}, {"ID": 1838, "Title": "Frequency of the Most Frequent Element", "TitleCn": "\u6700\u9ad8\u9891\u5143\u7d20\u7684\u9891\u6570", "Url": "https://leetcode.cn/problems/frequency-of-the-most-frequent-element/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 238 Problem 2"}, {"ID": 1839, "Title": "Longest Substring Of All Vowels in Order", "TitleCn": "\u6240\u6709\u5143\u97f3\u6309\u987a\u5e8f\u6392\u5e03\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/longest-substring-of-all-vowels-in-order/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 238 Problem 3"}, {"ID": 1840, "Title": "Maximum Building Height", "TitleCn": "\u6700\u9ad8\u5efa\u7b51\u9ad8\u5ea6", "Url": "https://leetcode.cn/problems/maximum-building-height/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 238 Problem 4"}, {"ID": 1841, "Title": "League Statistics", "TitleCn": "\u8054\u8d5b\u4fe1\u606f\u7edf\u8ba1", "Url": "https://leetcode.cn/problems/league-statistics/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1842, "Title": "Next Palindrome Using Same Digits", "TitleCn": "\u4e0b\u4e2a\u7531\u76f8\u540c\u6570\u5b57\u6784\u6210\u7684\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/next-palindrome-using-same-digits/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1843, "Title": "Suspicious Bank Accounts", "TitleCn": "\u53ef\u7591\u94f6\u884c\u8d26\u6237", "Url": "https://leetcode.cn/problems/suspicious-bank-accounts/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1844, "Title": "Replace All Digits with Characters", "TitleCn": "\u5c06\u6240\u6709\u6570\u5b57\u7528\u5b57\u7b26\u66ff\u6362", "Url": "https://leetcode.cn/problems/replace-all-digits-with-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 51 Problem 1"}, {"ID": 1845, "Title": "Seat Reservation Manager", "TitleCn": "\u5ea7\u4f4d\u9884\u7ea6\u7ba1\u7406\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/seat-reservation-manager/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 51 Problem 2"}, {"ID": 1846, "Title": "Maximum Element After Decreasing and Rearranging", "TitleCn": "\u51cf\u5c0f\u548c\u91cd\u65b0\u6392\u5217\u6570\u7ec4\u540e\u7684\u6700\u5927\u5143\u7d20", "Url": "https://leetcode.cn/problems/maximum-element-after-decreasing-and-rearranging/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 51 Problem 3"}, {"ID": 1847, "Title": "Closest Room", "TitleCn": "\u6700\u8fd1\u7684\u623f\u95f4", "Url": "https://leetcode.cn/problems/closest-room/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 51 Problem 4"}, {"ID": 1848, "Title": "Minimum Distance to the Target Element", "TitleCn": "\u5230\u76ee\u6807\u5143\u7d20\u7684\u6700\u5c0f\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/minimum-distance-to-the-target-element/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 239 Problem 1"}, {"ID": 1849, "Title": "Splitting a String Into Descending Consecutive Values", "TitleCn": "\u5c06\u5b57\u7b26\u4e32\u62c6\u5206\u4e3a\u9012\u51cf\u7684\u8fde\u7eed\u503c", "Url": "https://leetcode.cn/problems/splitting-a-string-into-descending-consecutive-values/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 239 Problem 2"}, {"ID": 1850, "Title": "Minimum Adjacent Swaps to Reach the Kth Smallest Number", "TitleCn": "\u90bb\u4f4d\u4ea4\u6362\u7684\u6700\u5c0f\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 239 Problem 3"}, {"ID": 1851, "Title": "Minimum Interval to Include Each Query", "TitleCn": "\u5305\u542b\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5c0f\u533a\u95f4", "Url": "https://leetcode.cn/problems/minimum-interval-to-include-each-query/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 239 Problem 4"}, {"ID": 1852, "Title": "Distinct Numbers in Each Subarray", "TitleCn": "\u6bcf\u4e2a\u5b50\u6570\u7ec4\u7684\u6570\u5b57\u79cd\u7c7b\u6570", "Url": "https://leetcode.cn/problems/distinct-numbers-in-each-subarray/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1853, "Title": "Convert Date Format", "TitleCn": "\u8f6c\u6362\u65e5\u671f\u683c\u5f0f", "Url": "https://leetcode.cn/problems/convert-date-format/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1854, "Title": "Maximum Population Year", "TitleCn": "\u4eba\u53e3\u6700\u591a\u7684\u5e74\u4efd", "Url": "https://leetcode.cn/problems/maximum-population-year/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 240 Problem 1"}, {"ID": 1855, "Title": "Maximum Distance Between a Pair of Values", "TitleCn": "\u4e0b\u6807\u5bf9\u4e2d\u7684\u6700\u5927\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/maximum-distance-between-a-pair-of-values/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 240 Problem 2"}, {"ID": 1856, "Title": "Maximum Subarray Min-Product", "TitleCn": "\u5b50\u6570\u7ec4\u6700\u5c0f\u4e58\u79ef\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/maximum-subarray-min-product/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 240 Problem 3"}, {"ID": 1857, "Title": "Largest Color Value in a Directed Graph", "TitleCn": "\u6709\u5411\u56fe\u4e2d\u6700\u5927\u989c\u8272\u503c", "Url": "https://leetcode.cn/problems/largest-color-value-in-a-directed-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 240 Problem 4"}, {"ID": 1858, "Title": "Longest Word With All Prefixes", "TitleCn": "\u5305\u542b\u6240\u6709\u524d\u7f00\u7684\u6700\u957f\u5355\u8bcd", "Url": "https://leetcode.cn/problems/longest-word-with-all-prefixes/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1859, "Title": "Sorting the Sentence", "TitleCn": "\u5c06\u53e5\u5b50\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sorting-the-sentence/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 52 Problem 1"}, {"ID": 1860, "Title": "Incremental Memory Leak", "TitleCn": "\u589e\u957f\u7684\u5185\u5b58\u6cc4\u9732", "Url": "https://leetcode.cn/problems/incremental-memory-leak/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 52 Problem 2"}, {"ID": 1861, "Title": "Rotating the Box", "TitleCn": "\u65cb\u8f6c\u76d2\u5b50", "Url": "https://leetcode.cn/problems/rotating-the-box/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 52 Problem 3"}, {"ID": 1862, "Title": "Sum of Floored Pairs", "TitleCn": "\u5411\u4e0b\u53d6\u6574\u6570\u5bf9\u548c", "Url": "https://leetcode.cn/problems/sum-of-floored-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 52 Problem 4"}, {"ID": 1863, "Title": "Sum of All Subset XOR Totals", "TitleCn": "\u627e\u51fa\u6240\u6709\u5b50\u96c6\u7684\u5f02\u6216\u603b\u548c\u518d\u6c42\u548c", "Url": "https://leetcode.cn/problems/sum-of-all-subset-xor-totals/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 241 Problem 1"}, {"ID": 1864, "Title": "Minimum Number of Swaps to Make the Binary String Alternating", "TitleCn": "\u6784\u6210\u4ea4\u66ff\u5b57\u7b26\u4e32\u9700\u8981\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-swaps-to-make-the-binary-string-alternating/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 241 Problem 2"}, {"ID": 1865, "Title": "Finding Pairs With a Certain Sum", "TitleCn": "\u627e\u51fa\u548c\u4e3a\u6307\u5b9a\u503c\u7684\u4e0b\u6807\u5bf9", "Url": "https://leetcode.cn/problems/finding-pairs-with-a-certain-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 241 Problem 3"}, {"ID": 1866, "Title": "Number of Ways to Rearrange Sticks With K Sticks Visible", "TitleCn": "\u6070\u6709 K \u6839\u6728\u68cd\u53ef\u4ee5\u770b\u5230\u7684\u6392\u5217\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-ways-to-rearrange-sticks-with-k-sticks-visible/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 241 Problem 4"}, {"ID": 1867, "Title": "Orders With Maximum Quantity Above Average", "TitleCn": "\u6700\u5927\u6570\u91cf\u9ad8\u4e8e\u5e73\u5747\u6c34\u5e73\u7684\u8ba2\u5355", "Url": "https://leetcode.cn/problems/orders-with-maximum-quantity-above-average/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1868, "Title": "Product of Two Run-Length Encoded Arrays", "TitleCn": "\u4e24\u4e2a\u884c\u7a0b\u7f16\u7801\u6570\u7ec4\u7684\u79ef", "Url": "https://leetcode.cn/problems/product-of-two-run-length-encoded-arrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1869, "Title": "Longer Contiguous Segments of Ones than Zeros", "TitleCn": "\u54ea\u79cd\u8fde\u7eed\u5b50\u5b57\u7b26\u4e32\u66f4\u957f", "Url": "https://leetcode.cn/problems/longer-contiguous-segments-of-ones-than-zeros/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 242 Problem 1"}, {"ID": 1870, "Title": "Minimum Speed to Arrive on Time", "TitleCn": "\u51c6\u65f6\u5230\u8fbe\u7684\u5217\u8f66\u6700\u5c0f\u65f6\u901f", "Url": "https://leetcode.cn/problems/minimum-speed-to-arrive-on-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 242 Problem 2"}, {"ID": 1871, "Title": "Jump Game VII", "TitleCn": "\u8df3\u8dc3\u6e38\u620f VII", "Url": "https://leetcode.cn/problems/jump-game-vii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 242 Problem 3"}, {"ID": 1872, "Title": "Stone Game VIII", "TitleCn": "\u77f3\u5b50\u6e38\u620f VIII", "Url": "https://leetcode.cn/problems/stone-game-viii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 242 Problem 4"}, {"ID": 1873, "Title": "Calculate Special Bonus", "TitleCn": "\u8ba1\u7b97\u7279\u6b8a\u5956\u91d1", "Url": "https://leetcode.cn/problems/calculate-special-bonus/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1874, "Title": "Minimize Product Sum of Two Arrays", "TitleCn": "\u4e24\u4e2a\u6570\u7ec4\u7684\u6700\u5c0f\u4e58\u79ef\u548c", "Url": "https://leetcode.cn/problems/minimize-product-sum-of-two-arrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1875, "Title": "Group Employees of the Same Salary", "TitleCn": "\u5c06\u5de5\u8d44\u76f8\u540c\u7684\u96c7\u5458\u5206\u7ec4", "Url": "https://leetcode.cn/problems/group-employees-of-the-same-salary/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1876, "Title": "Substrings of Size Three with Distinct Characters", "TitleCn": "\u957f\u5ea6\u4e3a\u4e09\u4e14\u5404\u5b57\u7b26\u4e0d\u540c\u7684\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/substrings-of-size-three-with-distinct-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 53 Problem 1"}, {"ID": 1877, "Title": "Minimize Maximum Pair Sum in Array", "TitleCn": "\u6570\u7ec4\u4e2d\u6700\u5927\u6570\u5bf9\u548c\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/minimize-maximum-pair-sum-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 53 Problem 2"}, {"ID": 1878, "Title": "Get Biggest Three Rhombus Sums in a Grid", "TitleCn": "\u77e9\u9635\u4e2d\u6700\u5927\u7684\u4e09\u4e2a\u83f1\u5f62\u548c", "Url": "https://leetcode.cn/problems/get-biggest-three-rhombus-sums-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 53 Problem 3"}, {"ID": 1879, "Title": "Minimum XOR Sum of Two Arrays", "TitleCn": "\u4e24\u4e2a\u6570\u7ec4\u6700\u5c0f\u7684\u5f02\u6216\u503c\u4e4b\u548c", "Url": "https://leetcode.cn/problems/minimum-xor-sum-of-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 53 Problem 4"}, {"ID": 1880, "Title": "Check if Word Equals Summation of Two Words", "TitleCn": "\u68c0\u67e5\u67d0\u5355\u8bcd\u662f\u5426\u7b49\u4e8e\u4e24\u5355\u8bcd\u4e4b\u548c", "Url": "https://leetcode.cn/problems/check-if-word-equals-summation-of-two-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 243 Problem 1"}, {"ID": 1881, "Title": "Maximum Value after Insertion", "TitleCn": "\u63d2\u5165\u540e\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/maximum-value-after-insertion/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 243 Problem 2"}, {"ID": 1882, "Title": "Process Tasks Using Servers", "TitleCn": "\u4f7f\u7528\u670d\u52a1\u5668\u5904\u7406\u4efb\u52a1", "Url": "https://leetcode.cn/problems/process-tasks-using-servers/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 243 Problem 3"}, {"ID": 1883, "Title": "Minimum Skips to Arrive at Meeting On Time", "TitleCn": "\u51c6\u65f6\u62b5\u8fbe\u4f1a\u8bae\u73b0\u573a\u7684\u6700\u5c0f\u8df3\u8fc7\u4f11\u606f\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-skips-to-arrive-at-meeting-on-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 243 Problem 4"}, {"ID": 1884, "Title": "Egg Drop With 2 Eggs and N Floors", "TitleCn": "\u9e21\u86cb\u6389\u843d-\u4e24\u679a\u9e21\u86cb", "Url": "https://leetcode.cn/problems/egg-drop-with-2-eggs-and-n-floors/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1885, "Title": "Count Pairs in Two Arrays", "TitleCn": "\u7edf\u8ba1\u6570\u5bf9", "Url": "https://leetcode.cn/problems/count-pairs-in-two-arrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1886, "Title": "Determine Whether Matrix Can Be Obtained By Rotation", "TitleCn": "\u5224\u65ad\u77e9\u9635\u7ecf\u8f6e\u8f6c\u540e\u662f\u5426\u4e00\u81f4", "Url": "https://leetcode.cn/problems/determine-whether-matrix-can-be-obtained-by-rotation/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 244 Problem 1"}, {"ID": 1887, "Title": "Reduction Operations to Make the Array Elements Equal", "TitleCn": "\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49\u7684\u51cf\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/reduction-operations-to-make-the-array-elements-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 244 Problem 2"}, {"ID": 1888, "Title": "Minimum Number of Flips to Make the Binary String Alternating", "TitleCn": "\u4f7f\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u7b26\u4ea4\u66ff\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-flips-to-make-the-binary-string-alternating/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 244 Problem 3"}, {"ID": 1889, "Title": "Minimum Space Wasted From Packaging", "TitleCn": "\u88c5\u5305\u88f9\u7684\u6700\u5c0f\u6d6a\u8d39\u7a7a\u95f4", "Url": "https://leetcode.cn/problems/minimum-space-wasted-from-packaging/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 244 Problem 4"}, {"ID": 1890, "Title": "The Latest Login in 2020", "TitleCn": "2020\u5e74\u6700\u540e\u4e00\u6b21\u767b\u5f55", "Url": "https://leetcode.cn/problems/the-latest-login-in-2020/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1891, "Title": "Cutting Ribbons", "TitleCn": "\u5272\u7ef3\u5b50", "Url": "https://leetcode.cn/problems/cutting-ribbons/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1892, "Title": "Page Recommendations II", "TitleCn": "\u9875\u9762\u63a8\u8350\u2161", "Url": "https://leetcode.cn/problems/page-recommendations-ii/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1893, "Title": "Check if All the Integers in a Range Are Covered", "TitleCn": "\u68c0\u67e5\u662f\u5426\u533a\u57df\u5185\u6240\u6709\u6574\u6570\u90fd\u88ab\u8986\u76d6", "Url": "https://leetcode.cn/problems/check-if-all-the-integers-in-a-range-are-covered/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 54 Problem 1"}, {"ID": 1894, "Title": "Find the Student that Will Replace the Chalk", "TitleCn": "\u627e\u5230\u9700\u8981\u8865\u5145\u7c89\u7b14\u7684\u5b66\u751f\u7f16\u53f7", "Url": "https://leetcode.cn/problems/find-the-student-that-will-replace-the-chalk/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 54 Problem 2"}, {"ID": 1895, "Title": "Largest Magic Square", "TitleCn": "\u6700\u5927\u7684\u5e7b\u65b9", "Url": "https://leetcode.cn/problems/largest-magic-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 54 Problem 3"}, {"ID": 1896, "Title": "Minimum Cost to Change the Final Value of Expression", "TitleCn": "\u53cd\u8f6c\u8868\u8fbe\u5f0f\u503c\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-cost-to-change-the-final-value-of-expression/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 54 Problem 4"}, {"ID": 1897, "Title": "Redistribute Characters to Make All Strings Equal", "TitleCn": "\u91cd\u65b0\u5206\u914d\u5b57\u7b26\u4f7f\u6240\u6709\u5b57\u7b26\u4e32\u90fd\u76f8\u7b49", "Url": "https://leetcode.cn/problems/redistribute-characters-to-make-all-strings-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 245 Problem 1"}, {"ID": 1898, "Title": "Maximum Number of Removable Characters", "TitleCn": "\u53ef\u79fb\u9664\u5b57\u7b26\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-removable-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 245 Problem 2"}, {"ID": 1899, "Title": "Merge Triplets to Form Target Triplet", "TitleCn": "\u5408\u5e76\u82e5\u5e72\u4e09\u5143\u7ec4\u4ee5\u5f62\u6210\u76ee\u6807\u4e09\u5143\u7ec4", "Url": "https://leetcode.cn/problems/merge-triplets-to-form-target-triplet/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 245 Problem 3"}, {"ID": 1900, "Title": "The Earliest and Latest Rounds Where Players Compete", "TitleCn": "\u6700\u4f73\u8fd0\u52a8\u5458\u7684\u6bd4\u62fc\u56de\u5408", "Url": "https://leetcode.cn/problems/the-earliest-and-latest-rounds-where-players-compete/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 245 Problem 4"}, {"ID": 1901, "Title": "Find a Peak Element II", "TitleCn": "\u5bfb\u627e\u5cf0\u503c II", "Url": "https://leetcode.cn/problems/find-a-peak-element-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1902, "Title": "Depth of BST Given Insertion Order", "TitleCn": "\u7ed9\u5b9a\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u63d2\u5165\u987a\u5e8f\u6c42\u6df1\u5ea6", "Url": "https://leetcode.cn/problems/depth-of-bst-given-insertion-order/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1903, "Title": "Largest Odd Number in String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u7684\u6700\u5927\u5947\u6570", "Url": "https://leetcode.cn/problems/largest-odd-number-in-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 246 Problem 1"}, {"ID": 1904, "Title": "The Number of Full Rounds You Have Played", "TitleCn": "\u4f60\u5b8c\u6210\u7684\u5b8c\u6574\u5bf9\u5c40\u6570", "Url": "https://leetcode.cn/problems/the-number-of-full-rounds-you-have-played/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 246 Problem 2"}, {"ID": 1905, "Title": "Count Sub Islands", "TitleCn": "\u7edf\u8ba1\u5b50\u5c9b\u5c7f", "Url": "https://leetcode.cn/problems/count-sub-islands/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 246 Problem 3"}, {"ID": 1906, "Title": "Minimum Absolute Difference Queries", "TitleCn": "\u67e5\u8be2\u5dee\u7edd\u5bf9\u503c\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/minimum-absolute-difference-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 246 Problem 4"}, {"ID": 1907, "Title": "Count Salary Categories", "TitleCn": "\u6309\u5206\u7c7b\u7edf\u8ba1\u85aa\u6c34", "Url": "https://leetcode.cn/problems/count-salary-categories/", "Ispaid": 0, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1908, "Title": "Game of Nim", "TitleCn": "Nim \u6e38\u620f II", "Url": "https://leetcode.cn/problems/game-of-nim/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 10, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1909, "Title": "Remove One Element to Make the Array Strictly Increasing", "TitleCn": "\u5220\u9664\u4e00\u4e2a\u5143\u7d20\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e", "Url": "https://leetcode.cn/problems/remove-one-element-to-make-the-array-strictly-increasing/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 55 Problem 1"}, {"ID": 1910, "Title": "Remove All Occurrences of a Substring", "TitleCn": "\u5220\u9664\u4e00\u4e2a\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u51fa\u73b0\u7684\u7ed9\u5b9a\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/remove-all-occurrences-of-a-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 55 Problem 2"}, {"ID": 1911, "Title": "Maximum Alternating Subsequence Sum", "TitleCn": "\u6700\u5927\u5b50\u5e8f\u5217\u4ea4\u66ff\u548c", "Url": "https://leetcode.cn/problems/maximum-alternating-subsequence-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 55 Problem 3"}, {"ID": 1912, "Title": "Design Movie Rental System", "TitleCn": "\u8bbe\u8ba1\u7535\u5f71\u79df\u501f\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-movie-rental-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 55 Problem 4"}, {"ID": 1913, "Title": "Maximum Product Difference Between Two Pairs", "TitleCn": "\u4e24\u4e2a\u6570\u5bf9\u4e4b\u95f4\u7684\u6700\u5927\u4e58\u79ef\u5dee", "Url": "https://leetcode.cn/problems/maximum-product-difference-between-two-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 247 Problem 1"}, {"ID": 1914, "Title": "Cyclically Rotating a Grid", "TitleCn": "\u5faa\u73af\u8f6e\u8f6c\u77e9\u9635", "Url": "https://leetcode.cn/problems/cyclically-rotating-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 247 Problem 2"}, {"ID": 1915, "Title": "Number of Wonderful Substrings", "TitleCn": "\u6700\u7f8e\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-wonderful-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 247 Problem 3"}, {"ID": 1916, "Title": "Count Ways to Build Rooms in an Ant Colony", "TitleCn": "\u7edf\u8ba1\u4e3a\u8681\u7fa4\u6784\u7b51\u623f\u95f4\u7684\u4e0d\u540c\u987a\u5e8f", "Url": "https://leetcode.cn/problems/count-ways-to-build-rooms-in-an-ant-colony/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 247 Problem 4"}, {"ID": 1917, "Title": "Leetcodify Friends Recommendations", "TitleCn": "Leetcodify \u597d\u53cb\u63a8\u8350", "Url": "https://leetcode.cn/problems/leetcodify-friends-recommendations/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1918, "Title": "Kth Smallest Subarray Sum", "TitleCn": "\u7b2c K \u5c0f\u7684\u5b50\u5e8f\u5217\u548c", "Url": "https://leetcode.cn/problems/kth-smallest-subarray-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1919, "Title": "Leetcodify Similar Friends", "TitleCn": "\u5174\u8da3\u76f8\u540c\u7684\u670b\u53cb", "Url": "https://leetcode.cn/problems/leetcodify-similar-friends/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1920, "Title": "Build Array from Permutation", "TitleCn": "\u57fa\u4e8e\u6392\u5217\u6784\u5efa\u6570\u7ec4", "Url": "https://leetcode.cn/problems/build-array-from-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 5, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 248 Problem 1"}, {"ID": 1921, "Title": "Eliminate Maximum Number of Monsters", "TitleCn": "\u6d88\u706d\u602a\u7269\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/eliminate-maximum-number-of-monsters/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 248 Problem 2"}, {"ID": 1922, "Title": "Count Good Numbers", "TitleCn": "\u7edf\u8ba1\u597d\u6570\u5b57\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-good-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 248 Problem 3"}, {"ID": 1923, "Title": "Longest Common Subpath", "TitleCn": "\u6700\u957f\u516c\u5171\u5b50\u8def\u5f84", "Url": "https://leetcode.cn/problems/longest-common-subpath/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 248 Problem 4"}, {"ID": 1924, "Title": "Erect the Fence II", "TitleCn": "\u5b89\u88c5\u6805\u680f II", "Url": "https://leetcode.cn/problems/erect-the-fence-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1925, "Title": "Count Square Sum Triples", "TitleCn": "\u7edf\u8ba1\u5e73\u65b9\u548c\u4e09\u5143\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-square-sum-triples/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 56 Problem 1"}, {"ID": 1926, "Title": "Nearest Exit from Entrance in Maze", "TitleCn": "\u8ff7\u5bab\u4e2d\u79bb\u5165\u53e3\u6700\u8fd1\u7684\u51fa\u53e3", "Url": "https://leetcode.cn/problems/nearest-exit-from-entrance-in-maze/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 56 Problem 2"}, {"ID": 1927, "Title": "Sum Game", "TitleCn": "\u6c42\u548c\u6e38\u620f", "Url": "https://leetcode.cn/problems/sum-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 56 Problem 3"}, {"ID": 1928, "Title": "Minimum Cost to Reach Destination in Time", "TitleCn": "\u89c4\u5b9a\u65f6\u95f4\u5185\u5230\u8fbe\u7ec8\u70b9\u7684\u6700\u5c0f\u82b1\u8d39", "Url": "https://leetcode.cn/problems/minimum-cost-to-reach-destination-in-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 56 Problem 4"}, {"ID": 1929, "Title": "Concatenation of Array", "TitleCn": "\u6570\u7ec4\u4e32\u8054", "Url": "https://leetcode.cn/problems/concatenation-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 249 Problem 1"}, {"ID": 1930, "Title": "Unique Length-3 Palindromic Subsequences", "TitleCn": "\u957f\u5ea6\u4e3a 3 \u7684\u4e0d\u540c\u56de\u6587\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/unique-length-3-palindromic-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 249 Problem 2"}, {"ID": 1931, "Title": "Painting a Grid With Three Different Colors", "TitleCn": "\u7528\u4e09\u79cd\u4e0d\u540c\u989c\u8272\u4e3a\u7f51\u683c\u6d82\u8272", "Url": "https://leetcode.cn/problems/painting-a-grid-with-three-different-colors/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 249 Problem 3"}, {"ID": 1932, "Title": "Merge BSTs to Create Single BST", "TitleCn": "\u5408\u5e76\u591a\u68f5\u4e8c\u53c9\u641c\u7d22\u6811", "Url": "https://leetcode.cn/problems/merge-bsts-to-create-single-bst/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 249 Problem 4"}, {"ID": 1933, "Title": "Check if String Is Decomposable Into Value-Equal Substrings", "TitleCn": "\u5224\u65ad\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u5206\u89e3\u4e3a\u503c\u5747\u7b49\u7684\u5b50\u4e32", "Url": "https://leetcode.cn/problems/check-if-string-is-decomposable-into-value-equal-substrings/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1934, "Title": "Confirmation Rate", "TitleCn": "\u786e\u8ba4\u7387", "Url": "https://leetcode.cn/problems/confirmation-rate/", "Ispaid": 0, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1935, "Title": "Maximum Number of Words You Can Type", "TitleCn": "\u53ef\u4ee5\u8f93\u5165\u7684\u6700\u5927\u5355\u8bcd\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-words-you-can-type/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 250 Problem 1"}, {"ID": 1936, "Title": "Add Minimum Number of Rungs", "TitleCn": "\u65b0\u589e\u7684\u6700\u5c11\u53f0\u9636\u6570", "Url": "https://leetcode.cn/problems/add-minimum-number-of-rungs/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 250 Problem 2"}, {"ID": 1937, "Title": "Maximum Number of Points with Cost", "TitleCn": "\u6263\u5206\u540e\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-number-of-points-with-cost/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 250 Problem 3"}, {"ID": 1938, "Title": "Maximum Genetic Difference Query", "TitleCn": "\u67e5\u8be2\u6700\u5927\u57fa\u56e0\u5dee", "Url": "https://leetcode.cn/problems/maximum-genetic-difference-query/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 250 Problem 4"}, {"ID": 1939, "Title": "Users That Actively Request Confirmation Messages", "TitleCn": "\u4e3b\u52a8\u8bf7\u6c42\u786e\u8ba4\u6d88\u606f\u7684\u7528\u6237", "Url": "https://leetcode.cn/problems/users-that-actively-request-confirmation-messages/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1940, "Title": "Longest Common Subsequence Between Sorted Arrays", "TitleCn": "\u6392\u5e8f\u6570\u7ec4\u4e4b\u95f4\u7684\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-common-subsequence-between-sorted-arrays", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1941, "Title": "Check if All Characters Have Equal Number of Occurrences", "TitleCn": "\u68c0\u67e5\u662f\u5426\u6240\u6709\u5b57\u7b26\u51fa\u73b0\u6b21\u6570\u76f8\u540c", "Url": "https://leetcode.cn/problems/check-if-all-characters-have-equal-number-of-occurrences/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 57 Problem 1"}, {"ID": 1942, "Title": "The Number of the Smallest Unoccupied Chair", "TitleCn": "\u6700\u5c0f\u672a\u88ab\u5360\u636e\u6905\u5b50\u7684\u7f16\u53f7", "Url": "https://leetcode.cn/problems/the-number-of-the-smallest-unoccupied-chair/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 57 Problem 2"}, {"ID": 1943, "Title": "Describe the Painting", "TitleCn": "\u63cf\u8ff0\u7ed8\u753b\u7ed3\u679c", "Url": "https://leetcode.cn/problems/describe-the-painting/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 57 Problem 3"}, {"ID": 1944, "Title": "Number of Visible People in a Queue", "TitleCn": "\u961f\u5217\u4e2d\u53ef\u4ee5\u770b\u5230\u7684\u4eba\u6570", "Url": "https://leetcode.cn/problems/number-of-visible-people-in-a-queue/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 57 Problem 4"}, {"ID": 1945, "Title": "Sum of Digits of String After Convert", "TitleCn": "\u5b57\u7b26\u4e32\u8f6c\u5316\u540e\u7684\u5404\u4f4d\u6570\u5b57\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-digits-of-string-after-convert/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 251 Problem 1"}, {"ID": 1946, "Title": "Largest Number After Mutating Substring", "TitleCn": "\u5b50\u5b57\u7b26\u4e32\u7a81\u53d8\u540e\u53ef\u80fd\u5f97\u5230\u7684\u6700\u5927\u6574\u6570", "Url": "https://leetcode.cn/problems/largest-number-after-mutating-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 251 Problem 2"}, {"ID": 1947, "Title": "Maximum Compatibility Score Sum", "TitleCn": "\u6700\u5927\u517c\u5bb9\u6027\u8bc4\u5206\u548c", "Url": "https://leetcode.cn/problems/maximum-compatibility-score-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 251 Problem 3"}, {"ID": 1948, "Title": "Delete Duplicate Folders in System", "TitleCn": "\u5220\u9664\u7cfb\u7edf\u4e2d\u7684\u91cd\u590d\u6587\u4ef6\u5939", "Url": "https://leetcode.cn/problems/delete-duplicate-folders-in-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 251 Problem 4"}, {"ID": 1949, "Title": "Strong Friendship", "TitleCn": "\u575a\u5b9a\u7684\u53cb\u8c0a", "Url": "https://leetcode.cn/problems/strong-friendship/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1950, "Title": "Maximum of Minimum Values in All Subarrays", "TitleCn": "\u6240\u6709\u5b50\u6570\u7ec4\u6700\u5c0f\u503c\u4e2d\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/maximum-of-minimum-values-in-all-subarrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1951, "Title": "All the Pairs With the Maximum Number of Common Followers", "TitleCn": "\u67e5\u8be2\u5177\u6709\u6700\u591a\u5171\u540c\u5173\u6ce8\u8005\u7684\u6240\u6709\u4e24\u4e24\u7ed3\u5bf9\u7ec4", "Url": "https://leetcode.cn/problems/all-the-pairs-with-the-maximum-number-of-common-followers/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1952, "Title": "Three Divisors", "TitleCn": "\u4e09\u9664\u6570", "Url": "https://leetcode.cn/problems/three-divisors/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 252 Problem 1"}, {"ID": 1953, "Title": "Maximum Number of Weeks for Which You Can Work", "TitleCn": "\u4f60\u53ef\u4ee5\u5de5\u4f5c\u7684\u6700\u5927\u5468\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-weeks-for-which-you-can-work/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 252 Problem 2"}, {"ID": 1954, "Title": "Minimum Garden Perimeter to Collect Enough Apples", "TitleCn": "\u6536\u96c6\u8db3\u591f\u82f9\u679c\u7684\u6700\u5c0f\u82b1\u56ed\u5468\u957f", "Url": "https://leetcode.cn/problems/minimum-garden-perimeter-to-collect-enough-apples/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 252 Problem 3"}, {"ID": 1955, "Title": "Count Number of Special Subsequences", "TitleCn": "\u7edf\u8ba1\u7279\u6b8a\u5b50\u5e8f\u5217\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-special-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 252 Problem 4"}, {"ID": 1956, "Title": "Minimum Time For K Virus Variants to Spread", "TitleCn": "\u611f\u67d3 K \u79cd\u75c5\u6bd2\u6240\u9700\u7684\u6700\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-for-k-virus-variants-to-spread/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1957, "Title": "Delete Characters to Make Fancy String", "TitleCn": "\u5220\u9664\u5b57\u7b26\u4f7f\u5b57\u7b26\u4e32\u53d8\u597d", "Url": "https://leetcode.cn/problems/delete-characters-to-make-fancy-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 58 Problem 1"}, {"ID": 1958, "Title": "Check if Move is Legal", "TitleCn": "\u68c0\u67e5\u64cd\u4f5c\u662f\u5426\u5408\u6cd5", "Url": "https://leetcode.cn/problems/check-if-move-is-legal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 58 Problem 2"}, {"ID": 1959, "Title": "Minimum Total Space Wasted With K Resizing Operations", "TitleCn": "K \u6b21\u8c03\u6574\u6570\u7ec4\u5927\u5c0f\u6d6a\u8d39\u7684\u6700\u5c0f\u603b\u7a7a\u95f4", "Url": "https://leetcode.cn/problems/minimum-total-space-wasted-with-k-resizing-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 58 Problem 3"}, {"ID": 1960, "Title": "Maximum Product of the Length of Two Palindromic Substrings", "TitleCn": "\u4e24\u4e2a\u56de\u6587\u5b50\u5b57\u7b26\u4e32\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-product-of-the-length-of-two-palindromic-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 58 Problem 4"}, {"ID": 1961, "Title": "Check If String Is a Prefix of Array", "TitleCn": "\u68c0\u67e5\u5b57\u7b26\u4e32\u662f\u5426\u4e3a\u6570\u7ec4\u524d\u7f00", "Url": "https://leetcode.cn/problems/check-if-string-is-a-prefix-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 253 Problem 1"}, {"ID": 1962, "Title": "Remove Stones to Minimize the Total", "TitleCn": "\u79fb\u9664\u77f3\u5b50\u4f7f\u603b\u6570\u6700\u5c0f", "Url": "https://leetcode.cn/problems/remove-stones-to-minimize-the-total/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 253 Problem 2"}, {"ID": 1963, "Title": "Minimum Number of Swaps to Make the String Balanced", "TitleCn": "\u4f7f\u5b57\u7b26\u4e32\u5e73\u8861\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-swaps-to-make-the-string-balanced/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 253 Problem 3"}, {"ID": 1964, "Title": "Find the Longest Valid Obstacle Course at Each Position", "TitleCn": "\u627e\u51fa\u5230\u6bcf\u4e2a\u4f4d\u7f6e\u4e3a\u6b62\u6700\u957f\u7684\u6709\u6548\u969c\u788d\u8d5b\u8dd1\u8def\u7ebf", "Url": "https://leetcode.cn/problems/find-the-longest-valid-obstacle-course-at-each-position/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 253 Problem 4"}, {"ID": 1965, "Title": "Employees With Missing Information", "TitleCn": "\u4e22\u5931\u4fe1\u606f\u7684\u96c7\u5458", "Url": "https://leetcode.cn/problems/employees-with-missing-information/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1966, "Title": "Binary Searchable Numbers in an Unsorted Array", "TitleCn": "\u672a\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u53ef\u88ab\u4e8c\u5206\u641c\u7d22\u7684\u6570", "Url": "https://leetcode.cn/problems/binary-searchable-numbers-in-an-unsorted-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1967, "Title": "Number of Strings That Appear as Substrings in Word", "TitleCn": "\u4f5c\u4e3a\u5b50\u5b57\u7b26\u4e32\u51fa\u73b0\u5728\u5355\u8bcd\u4e2d\u7684\u5b57\u7b26\u4e32\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-strings-that-appear-as-substrings-in-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 254 Problem 1"}, {"ID": 1968, "Title": "Array With Elements Not Equal to Average of Neighbors", "TitleCn": "\u6784\u9020\u5143\u7d20\u4e0d\u7b49\u4e8e\u4e24\u76f8\u90bb\u5143\u7d20\u5e73\u5747\u503c\u7684\u6570\u7ec4", "Url": "https://leetcode.cn/problems/array-with-elements-not-equal-to-average-of-neighbors/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 254 Problem 2"}, {"ID": 1969, "Title": "Minimum Non-Zero Product of the Array Elements", "TitleCn": "\u6570\u7ec4\u5143\u7d20\u7684\u6700\u5c0f\u975e\u96f6\u4e58\u79ef", "Url": "https://leetcode.cn/problems/minimum-non-zero-product-of-the-array-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 254 Problem 3"}, {"ID": 1970, "Title": "Last Day Where You Can Still Cross", "TitleCn": "\u4f60\u80fd\u7a7f\u8fc7\u77e9\u9635\u7684\u6700\u540e\u4e00\u5929", "Url": "https://leetcode.cn/problems/last-day-where-you-can-still-cross/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 254 Problem 4"}, {"ID": 1971, "Title": "Find if Path Exists in Graph", "TitleCn": "\u5bfb\u627e\u56fe\u4e2d\u662f\u5426\u5b58\u5728\u8def\u5f84", "Url": "https://leetcode.cn/problems/find-if-path-exists-in-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1972, "Title": "First and Last Call On the Same Day", "TitleCn": "\u540c\u4e00\u5929\u7684\u7b2c\u4e00\u4e2a\u7535\u8bdd\u548c\u6700\u540e\u4e00\u4e2a\u7535\u8bdd", "Url": "https://leetcode.cn/problems/first-and-last-call-on-the-same-day/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 1973, "Title": "Count Nodes Equal to Sum of Descendants", "TitleCn": "\u503c\u7b49\u4e8e\u5b50\u8282\u70b9\u503c\u4e4b\u548c\u7684\u8282\u70b9\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-nodes-equal-to-sum-of-descendants/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1974, "Title": "Minimum Time to Type Word Using Special Typewriter", "TitleCn": "\u4f7f\u7528\u7279\u6b8a\u6253\u5b57\u673a\u952e\u5165\u5355\u8bcd\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-type-word-using-special-typewriter/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 59 Problem 1"}, {"ID": 1975, "Title": "Maximum Matrix Sum", "TitleCn": "\u6700\u5927\u65b9\u9635\u548c", "Url": "https://leetcode.cn/problems/maximum-matrix-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 59 Problem 2"}, {"ID": 1976, "Title": "Number of Ways to Arrive at Destination", "TitleCn": "\u5230\u8fbe\u76ee\u7684\u5730\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-arrive-at-destination/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 59 Problem 3"}, {"ID": 1977, "Title": "Number of Ways to Separate Numbers", "TitleCn": "\u5212\u5206\u6570\u5b57\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-separate-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 59 Problem 4"}, {"ID": 1978, "Title": "Employees Whose Manager Left the Company", "TitleCn": "\u4e0a\u7ea7\u7ecf\u7406\u5df2\u79bb\u804c\u7684\u516c\u53f8\u5458\u5de5", "Url": "https://leetcode.cn/problems/employees-whose-manager-left-the-company/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 1979, "Title": "Find Greatest Common Divisor of Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u7684\u6700\u5927\u516c\u7ea6\u6570", "Url": "https://leetcode.cn/problems/find-greatest-common-divisor-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 255 Problem 1"}, {"ID": 1980, "Title": "Find Unique Binary String", "TitleCn": "\u627e\u51fa\u4e0d\u540c\u7684\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-unique-binary-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 255 Problem 2"}, {"ID": 1981, "Title": "Minimize the Difference Between Target and Chosen Elements", "TitleCn": "\u6700\u5c0f\u5316\u76ee\u6807\u503c\u4e0e\u6240\u9009\u5143\u7d20\u7684\u5dee", "Url": "https://leetcode.cn/problems/minimize-the-difference-between-target-and-chosen-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 255 Problem 3"}, {"ID": 1982, "Title": "Find Array Given Subset Sums", "TitleCn": "\u4ece\u5b50\u96c6\u7684\u548c\u8fd8\u539f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-array-given-subset-sums/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 255 Problem 4"}, {"ID": 1983, "Title": "Widest Pair of Indices With Equal Range Sum", "TitleCn": "\u8303\u56f4\u548c\u76f8\u7b49\u7684\u6700\u5bbd\u7d22\u5f15\u5bf9", "Url": "https://leetcode.cn/problems/widest-pair-of-indices-with-equal-range-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1984, "Title": "Minimum Difference Between Highest and Lowest of K Scores", "TitleCn": "\u5b66\u751f\u5206\u6570\u7684\u6700\u5c0f\u5dee\u503c", "Url": "https://leetcode.cn/problems/minimum-difference-between-highest-and-lowest-of-k-scores/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 256 Problem 1"}, {"ID": 1985, "Title": "Find the Kth Largest Integer in the Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u7b2c K \u5927\u6574\u6570", "Url": "https://leetcode.cn/problems/find-the-kth-largest-integer-in-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 256 Problem 2"}, {"ID": 1986, "Title": "Minimum Number of Work Sessions to Finish the Tasks", "TitleCn": "\u5b8c\u6210\u4efb\u52a1\u7684\u6700\u5c11\u5de5\u4f5c\u65f6\u95f4\u6bb5", "Url": "https://leetcode.cn/problems/minimum-number-of-work-sessions-to-finish-the-tasks/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 256 Problem 3"}, {"ID": 1987, "Title": "Number of Unique Good Subsequences", "TitleCn": "\u4e0d\u540c\u7684\u597d\u5b50\u5e8f\u5217\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-unique-good-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 256 Problem 4"}, {"ID": 1988, "Title": "Find Cutoff Score for Each School", "TitleCn": "\u627e\u51fa\u6bcf\u6240\u5b66\u6821\u7684\u6700\u4f4e\u5206\u6570\u8981\u6c42", "Url": "https://leetcode.cn/problems/find-cutoff-score-for-each-school/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1989, "Title": "Maximum Number of People That Can Be Caught in Tag", "TitleCn": "\u6349\u8ff7\u85cf\u4e2d\u53ef\u6355\u83b7\u7684\u6700\u5927\u4eba\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-people-that-can-be-caught-in-tag/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1990, "Title": "Count the Number of Experiments", "TitleCn": "\u7edf\u8ba1\u5b9e\u9a8c\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-the-number-of-experiments/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 1991, "Title": "Find the Middle Index in Array", "TitleCn": "\u627e\u5230\u6570\u7ec4\u7684\u4e2d\u95f4\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/find-the-middle-index-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 60 Problem 1"}, {"ID": 1992, "Title": "Find All Groups of Farmland", "TitleCn": "\u627e\u5230\u6240\u6709\u7684\u519c\u573a\u7ec4", "Url": "https://leetcode.cn/problems/find-all-groups-of-farmland/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 60 Problem 2"}, {"ID": 1993, "Title": "Operations on Tree", "TitleCn": "\u6811\u4e0a\u7684\u64cd\u4f5c", "Url": "https://leetcode.cn/problems/operations-on-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 60 Problem 3"}, {"ID": 1994, "Title": "The Number of Good Subsets", "TitleCn": "\u597d\u5b50\u96c6\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/the-number-of-good-subsets/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 60 Problem 4"}, {"ID": 1995, "Title": "Count Special Quadruplets", "TitleCn": "\u7edf\u8ba1\u7279\u6b8a\u56db\u5143\u7ec4", "Url": "https://leetcode.cn/problems/count-special-quadruplets/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 257 Problem 1"}, {"ID": 1996, "Title": "The Number of Weak Characters in the Game", "TitleCn": "\u6e38\u620f\u4e2d\u5f31\u89d2\u8272\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/the-number-of-weak-characters-in-the-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 257 Problem 2"}, {"ID": 1997, "Title": "First Day Where You Have Been in All the Rooms", "TitleCn": "\u8bbf\u95ee\u5b8c\u6240\u6709\u623f\u95f4\u7684\u7b2c\u4e00\u5929", "Url": "https://leetcode.cn/problems/first-day-where-you-have-been-in-all-the-rooms/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 257 Problem 3"}, {"ID": 1998, "Title": "GCD Sort of an Array", "TitleCn": "\u6570\u7ec4\u7684\u6700\u5927\u516c\u56e0\u6570\u6392\u5e8f", "Url": "https://leetcode.cn/problems/gcd-sort-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 257 Problem 4"}, {"ID": 1999, "Title": "Smallest Greater Multiple Made of Two Digits", "TitleCn": "\u6700\u5c0f\u7684\u4ec5\u7531\u4e24\u4e2a\u6570\u7ec4\u6210\u7684\u500d\u6570", "Url": "https://leetcode.cn/problems/smallest-greater-multiple-made-of-two-digits/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2000, "Title": "Reverse Prefix of Word", "TitleCn": "\u53cd\u8f6c\u5355\u8bcd\u524d\u7f00", "Url": "https://leetcode.cn/problems/reverse-prefix-of-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 258 Problem 1"}, {"ID": 2001, "Title": "Number of Pairs of Interchangeable Rectangles", "TitleCn": "\u53ef\u4e92\u6362\u77e9\u5f62\u7684\u7ec4\u6570", "Url": "https://leetcode.cn/problems/number-of-pairs-of-interchangeable-rectangles/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 258 Problem 2"}, {"ID": 2002, "Title": "Maximum Product of the Length of Two Palindromic Subsequences", "TitleCn": "\u4e24\u4e2a\u56de\u6587\u5b50\u5e8f\u5217\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-product-of-the-length-of-two-palindromic-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 258 Problem 3"}, {"ID": 2003, "Title": "Smallest Missing Genetic Value in Each Subtree", "TitleCn": "\u6bcf\u68f5\u5b50\u6811\u5185\u7f3a\u5931\u7684\u6700\u5c0f\u57fa\u56e0\u503c", "Url": "https://leetcode.cn/problems/smallest-missing-genetic-value-in-each-subtree/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 258 Problem 4"}, {"ID": 2004, "Title": "The Number of Seniors and Juniors to Join the Company", "TitleCn": "\u804c\u5458\u62db\u8058\u4eba\u6570", "Url": "https://leetcode.cn/problems/the-number-of-seniors-and-juniors-to-join-the-company/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2005, "Title": "Subtree Removal Game with Fibonacci Tree", "TitleCn": "\u6590\u6ce2\u90a3\u5951\u6811\u7684\u79fb\u9664\u5b50\u6811\u6e38\u620f", "Url": "https://leetcode.cn/problems/subtree-removal-game-with-fibonacci-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2006, "Title": "Count Number of Pairs With Absolute Difference K", "TitleCn": "\u5dee\u7684\u7edd\u5bf9\u503c\u4e3a K \u7684\u6570\u5bf9\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-pairs-with-absolute-difference-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 61 Problem 1"}, {"ID": 2007, "Title": "Find Original Array From Doubled Array", "TitleCn": "\u4ece\u53cc\u500d\u6570\u7ec4\u4e2d\u8fd8\u539f\u539f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-original-array-from-doubled-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 61 Problem 2"}, {"ID": 2008, "Title": "Maximum Earnings From Taxi", "TitleCn": "\u51fa\u79df\u8f66\u7684\u6700\u5927\u76c8\u5229", "Url": "https://leetcode.cn/problems/maximum-earnings-from-taxi/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 61 Problem 3"}, {"ID": 2009, "Title": "Minimum Number of Operations to Make Array Continuous", "TitleCn": "\u4f7f\u6570\u7ec4\u8fde\u7eed\u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-array-continuous/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 61 Problem 4"}, {"ID": 2010, "Title": "The Number of Seniors and Juniors to Join the Company II", "TitleCn": "\u804c\u5458\u62db\u8058\u4eba\u6570 II", "Url": "https://leetcode.cn/problems/the-number-of-seniors-and-juniors-to-join-the-company-ii/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2011, "Title": "Final Value of Variable After Performing Operations", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u540e\u7684\u53d8\u91cf\u503c", "Url": "https://leetcode.cn/problems/final-value-of-variable-after-performing-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 259 Problem 1"}, {"ID": 2012, "Title": "Sum of Beauty in the Array", "TitleCn": "\u6570\u7ec4\u7f8e\u4e3d\u503c\u6c42\u548c", "Url": "https://leetcode.cn/problems/sum-of-beauty-in-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 259 Problem 2"}, {"ID": 2013, "Title": "Detect Squares", "TitleCn": "\u68c0\u6d4b\u6b63\u65b9\u5f62", "Url": "https://leetcode.cn/problems/detect-squares/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 259 Problem 3"}, {"ID": 2014, "Title": "Longest Subsequence Repeated k Times", "TitleCn": "\u91cd\u590d K \u6b21\u7684\u6700\u957f\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-subsequence-repeated-k-times/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 259 Problem 4"}, {"ID": 2015, "Title": "Average Height of Buildings in Each Segment", "TitleCn": "\u6bcf\u6bb5\u5efa\u7b51\u7269\u7684\u5e73\u5747\u9ad8\u5ea6", "Url": "https://leetcode.cn/problems/average-height-of-buildings-in-each-segment/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2016, "Title": "Maximum Difference Between Increasing Elements", "TitleCn": "\u589e\u91cf\u5143\u7d20\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c", "Url": "https://leetcode.cn/problems/maximum-difference-between-increasing-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 260 Problem 1"}, {"ID": 2017, "Title": "Grid Game", "TitleCn": "\u7f51\u683c\u6e38\u620f", "Url": "https://leetcode.cn/problems/grid-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 260 Problem 2"}, {"ID": 2018, "Title": "Check if Word Can Be Placed In Crossword", "TitleCn": "\u5224\u65ad\u5355\u8bcd\u662f\u5426\u80fd\u653e\u5165\u586b\u5b57\u6e38\u620f\u5185", "Url": "https://leetcode.cn/problems/check-if-word-can-be-placed-in-crossword/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 260 Problem 3"}, {"ID": 2019, "Title": "The Score of Students Solving Math Expression", "TitleCn": "\u89e3\u51fa\u6570\u5b66\u8868\u8fbe\u5f0f\u7684\u5b66\u751f\u5206\u6570", "Url": "https://leetcode.cn/problems/the-score-of-students-solving-math-expression/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 260 Problem 4"}, {"ID": 2020, "Title": "Number of Accounts That Did Not Stream", "TitleCn": "\u65e0\u6d41\u91cf\u7684\u5e10\u6237\u6570", "Url": "https://leetcode.cn/problems/number-of-accounts-that-did-not-stream/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2021, "Title": "Brightest Position on Street", "TitleCn": "\u8857\u4e0a\u6700\u4eae\u7684\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/brightest-position-on-street/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2022, "Title": "Convert 1D Array Into 2D Array", "TitleCn": "\u5c06\u4e00\u7ef4\u6570\u7ec4\u8f6c\u53d8\u6210\u4e8c\u7ef4\u6570\u7ec4", "Url": "https://leetcode.cn/problems/convert-1d-array-into-2d-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 62 Problem 1"}, {"ID": 2023, "Title": "Number of Pairs of Strings With Concatenation Equal to Target", "TitleCn": "\u8fde\u63a5\u540e\u7b49\u4e8e\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u5b57\u7b26\u4e32\u5bf9", "Url": "https://leetcode.cn/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 62 Problem 2"}, {"ID": 2024, "Title": "Maximize the Confusion of an Exam", "TitleCn": "\u8003\u8bd5\u7684\u6700\u5927\u56f0\u6270\u5ea6", "Url": "https://leetcode.cn/problems/maximize-the-confusion-of-an-exam/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 62 Problem 3"}, {"ID": 2025, "Title": "Maximum Number of Ways to Partition an Array", "TitleCn": "\u5206\u5272\u6570\u7ec4\u7684\u6700\u591a\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-ways-to-partition-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 62 Problem 4"}, {"ID": 2026, "Title": "Low-Quality Problems", "TitleCn": "\u4f4e\u8d28\u91cf\u7684\u95ee\u9898", "Url": "https://leetcode.cn/problems/low-quality-problems/", "Ispaid": 1, "Type": "Database", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2027, "Title": "Minimum Moves to Convert String", "TitleCn": "\u8f6c\u6362\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-moves-to-convert-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 261 Problem 1"}, {"ID": 2028, "Title": "Find Missing Observations", "TitleCn": "\u627e\u51fa\u7f3a\u5931\u7684\u89c2\u6d4b\u6570\u636e", "Url": "https://leetcode.cn/problems/find-missing-observations/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 261 Problem 2"}, {"ID": 2029, "Title": "Stone Game IX", "TitleCn": "\u77f3\u5b50\u6e38\u620f IX", "Url": "https://leetcode.cn/problems/stone-game-ix/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 261 Problem 3"}, {"ID": 2030, "Title": "Smallest K-Length Subsequence With Occurrences of a Letter", "TitleCn": "\u542b\u7279\u5b9a\u5b57\u6bcd\u7684\u6700\u5c0f\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/smallest-k-length-subsequence-with-occurrences-of-a-letter/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 261 Problem 4"}, {"ID": 2031, "Title": "Count Subarrays With More Ones Than Zeros", "TitleCn": "1 \u6bd4 0 \u591a\u7684\u5b50\u6570\u7ec4\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-subarrays-with-more-ones-than-zeros/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2032, "Title": "Two Out of Three", "TitleCn": "\u81f3\u5c11\u5728\u4e24\u4e2a\u6570\u7ec4\u4e2d\u51fa\u73b0\u7684\u503c", "Url": "https://leetcode.cn/problems/two-out-of-three/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 262 Problem 1"}, {"ID": 2033, "Title": "Minimum Operations to Make a Uni-Value Grid", "TitleCn": "\u83b7\u53d6\u5355\u503c\u7f51\u683c\u7684\u6700\u5c0f\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-a-uni-value-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 262 Problem 2"}, {"ID": 2034, "Title": "Stock Price Fluctuation", "TitleCn": "\u80a1\u7968\u4ef7\u683c\u6ce2\u52a8", "Url": "https://leetcode.cn/problems/stock-price-fluctuation/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 262 Problem 3"}, {"ID": 2035, "Title": "Partition Array Into Two Arrays to Minimize Sum Difference", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u6210\u4e24\u4e2a\u6570\u7ec4\u5e76\u6700\u5c0f\u5316\u6570\u7ec4\u548c\u7684\u5dee", "Url": "https://leetcode.cn/problems/partition-array-into-two-arrays-to-minimize-sum-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 262 Problem 4"}, {"ID": 2036, "Title": "Maximum Alternating Subarray Sum", "TitleCn": "\u6700\u5927\u4ea4\u66ff\u5b50\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/maximum-alternating-subarray-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2037, "Title": "Minimum Number of Moves to Seat Everyone", "TitleCn": "\u4f7f\u6bcf\u4f4d\u5b66\u751f\u90fd\u6709\u5ea7\u4f4d\u7684\u6700\u5c11\u79fb\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-moves-to-seat-everyone/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 63 Problem 1"}, {"ID": 2038, "Title": "Remove Colored Pieces if Both Neighbors are the Same Color", "TitleCn": "\u5982\u679c\u76f8\u90bb\u4e24\u4e2a\u989c\u8272\u5747\u76f8\u540c\u5219\u5220\u9664\u5f53\u524d\u989c\u8272", "Url": "https://leetcode.cn/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 63 Problem 2"}, {"ID": 2039, "Title": "The Time When the Network Becomes Idle", "TitleCn": "\u7f51\u7edc\u7a7a\u95f2\u7684\u65f6\u523b", "Url": "https://leetcode.cn/problems/the-time-when-the-network-becomes-idle/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 63 Problem 3"}, {"ID": 2040, "Title": "Kth Smallest Product of Two Sorted Arrays", "TitleCn": "\u4e24\u4e2a\u6709\u5e8f\u6570\u7ec4\u7684\u7b2c K \u5c0f\u4e58\u79ef", "Url": "https://leetcode.cn/problems/kth-smallest-product-of-two-sorted-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 63 Problem 4"}, {"ID": 2041, "Title": "Accepted Candidates From the Interviews", "TitleCn": "\u9762\u8bd5\u4e2d\u88ab\u5f55\u53d6\u7684\u5019\u9009\u4eba", "Url": "https://leetcode.cn/problems/accepted-candidates-from-the-interviews/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2042, "Title": "Check if Numbers Are Ascending in a Sentence", "TitleCn": "\u68c0\u67e5\u53e5\u5b50\u4e2d\u7684\u6570\u5b57\u662f\u5426\u9012\u589e", "Url": "https://leetcode.cn/problems/check-if-numbers-are-ascending-in-a-sentence/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 263 Problem 1"}, {"ID": 2043, "Title": "Simple Bank System", "TitleCn": "\u7b80\u6613\u94f6\u884c\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/simple-bank-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 263 Problem 2"}, {"ID": 2044, "Title": "Count Number of Maximum Bitwise-OR Subsets", "TitleCn": "\u7edf\u8ba1\u6309\u4f4d\u6216\u80fd\u5f97\u5230\u6700\u5927\u503c\u7684\u5b50\u96c6\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-maximum-bitwise-or-subsets/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 263 Problem 3"}, {"ID": 2045, "Title": "Second Minimum Time to Reach Destination", "TitleCn": "\u5230\u8fbe\u76ee\u7684\u5730\u7684\u7b2c\u4e8c\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/second-minimum-time-to-reach-destination/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 263 Problem 4"}, {"ID": 2046, "Title": "Sort Linked List Already Sorted Using Absolute Values", "TitleCn": "\u7ed9\u6309\u7167\u7edd\u5bf9\u503c\u6392\u5e8f\u7684\u94fe\u8868\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-linked-list-already-sorted-using-absolute-values/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 6, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2047, "Title": "Number of Valid Words in a Sentence", "TitleCn": "\u53e5\u5b50\u4e2d\u7684\u6709\u6548\u5355\u8bcd\u6570", "Url": "https://leetcode.cn/problems/number-of-valid-words-in-a-sentence/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 264 Problem 1"}, {"ID": 2048, "Title": "Next Greater Numerically Balanced Number", "TitleCn": "\u4e0b\u4e00\u4e2a\u66f4\u5927\u7684\u6570\u503c\u5e73\u8861\u6570", "Url": "https://leetcode.cn/problems/next-greater-numerically-balanced-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 264 Problem 2"}, {"ID": 2049, "Title": "Count Nodes With the Highest Score", "TitleCn": "\u7edf\u8ba1\u6700\u9ad8\u5206\u7684\u8282\u70b9\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-nodes-with-the-highest-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 264 Problem 3"}, {"ID": 2050, "Title": "Parallel Courses III", "TitleCn": "\u5e76\u884c\u8bfe\u7a0b III", "Url": "https://leetcode.cn/problems/parallel-courses-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 264 Problem 4"}, {"ID": 2051, "Title": "The Category of Each Member in the Store", "TitleCn": "\u5546\u5e97\u4e2d\u6bcf\u4e2a\u6210\u5458\u7684\u7ea7\u522b", "Url": "https://leetcode.cn/problems/the-category-of-each-member-in-the-store/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2052, "Title": "Minimum Cost to Separate Sentence Into Rows", "TitleCn": "\u5c06\u53e5\u5b50\u5206\u9694\u6210\u884c\u7684\u6700\u4f4e\u6210\u672c", "Url": "https://leetcode.cn/problems/minimum-cost-to-separate-sentence-into-rows/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2053, "Title": "Kth Distinct String in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7b2c K \u4e2a\u72ec\u4e00\u65e0\u4e8c\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/kth-distinct-string-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 64 Problem 1"}, {"ID": 2054, "Title": "Two Best Non-Overlapping Events", "TitleCn": "\u4e24\u4e2a\u6700\u597d\u7684\u4e0d\u91cd\u53e0\u6d3b\u52a8", "Url": "https://leetcode.cn/problems/two-best-non-overlapping-events/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 64 Problem 2"}, {"ID": 2055, "Title": "Plates Between Candles", "TitleCn": "\u8721\u70db\u4e4b\u95f4\u7684\u76d8\u5b50", "Url": "https://leetcode.cn/problems/plates-between-candles/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 64 Problem 3"}, {"ID": 2056, "Title": "Number of Valid Move Combinations On Chessboard", "TitleCn": "\u68cb\u76d8\u4e0a\u6709\u6548\u79fb\u52a8\u7ec4\u5408\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-valid-move-combinations-on-chessboard/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 64 Problem 4"}, {"ID": 2057, "Title": "Smallest Index With Equal Value", "TitleCn": "\u503c\u76f8\u7b49\u7684\u6700\u5c0f\u7d22\u5f15", "Url": "https://leetcode.cn/problems/smallest-index-with-equal-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 265 Problem 1"}, {"ID": 2058, "Title": "Find the Minimum and Maximum Number of Nodes Between Critical Points", "TitleCn": "\u627e\u51fa\u4e34\u754c\u70b9\u4e4b\u95f4\u7684\u6700\u5c0f\u548c\u6700\u5927\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 265 Problem 2"}, {"ID": 2059, "Title": "Minimum Operations to Convert Number", "TitleCn": "\u8f6c\u5316\u6570\u5b57\u7684\u6700\u5c0f\u8fd0\u7b97\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-convert-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 265 Problem 3"}, {"ID": 2060, "Title": "Check if an Original String Exists Given Two Encoded Strings", "TitleCn": "\u540c\u6e90\u5b57\u7b26\u4e32\u68c0\u6d4b", "Url": "https://leetcode.cn/problems/check-if-an-original-string-exists-given-two-encoded-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 265 Problem 4"}, {"ID": 2061, "Title": "Number of Spaces Cleaning Robot Cleaned", "TitleCn": "\u626b\u5730\u673a\u5668\u4eba\u6e05\u626b\u8fc7\u7684\u7a7a\u95f4\u4e2a\u6570", "Url": "https://leetcode.cn/problems/number-of-spaces-cleaning-robot-cleaned/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2062, "Title": "Count Vowel Substrings of a String", "TitleCn": "\u7edf\u8ba1\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/count-vowel-substrings-of-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 266 Problem 1"}, {"ID": 2063, "Title": "Vowels of All Substrings", "TitleCn": "\u6240\u6709\u5b50\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3", "Url": "https://leetcode.cn/problems/vowels-of-all-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 266 Problem 2"}, {"ID": 2064, "Title": "Minimized Maximum of Products Distributed to Any Store", "TitleCn": "\u5206\u914d\u7ed9\u5546\u5e97\u7684\u6700\u591a\u5546\u54c1\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/minimized-maximum-of-products-distributed-to-any-store/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 266 Problem 3"}, {"ID": 2065, "Title": "Maximum Path Quality of a Graph", "TitleCn": "\u6700\u5927\u5316\u4e00\u5f20\u56fe\u4e2d\u7684\u8def\u5f84\u4ef7\u503c", "Url": "https://leetcode.cn/problems/maximum-path-quality-of-a-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 266 Problem 4"}, {"ID": 2066, "Title": "Account Balance", "TitleCn": "\u8d26\u6237\u4f59\u989d", "Url": "https://leetcode.cn/problems/account-balance/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2067, "Title": "Number of Equal Count Substrings", "TitleCn": "\u7b49\u8ba1\u6570\u5b50\u4e32\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-equal-count-substrings/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2068, "Title": "Check Whether Two Strings are Almost Equivalent", "TitleCn": "\u68c0\u67e5\u4e24\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u51e0\u4e4e\u76f8\u7b49", "Url": "https://leetcode.cn/problems/check-whether-two-strings-are-almost-equivalent/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 65 Problem 1"}, {"ID": 2069, "Title": "Walking Robot Simulation II", "TitleCn": "\u6a21\u62df\u884c\u8d70\u673a\u5668\u4eba II", "Url": "https://leetcode.cn/problems/walking-robot-simulation-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 65 Problem 2"}, {"ID": 2070, "Title": "Most Beautiful Item for Each Query", "TitleCn": "\u6bcf\u4e00\u4e2a\u67e5\u8be2\u7684\u6700\u5927\u7f8e\u4e3d\u503c", "Url": "https://leetcode.cn/problems/most-beautiful-item-for-each-query/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 65 Problem 3"}, {"ID": 2071, "Title": "Maximum Number of Tasks You Can Assign", "TitleCn": "\u4f60\u53ef\u4ee5\u5b89\u6392\u7684\u6700\u591a\u4efb\u52a1\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-tasks-you-can-assign/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 65 Problem 4"}, {"ID": 2072, "Title": "The Winner University", "TitleCn": "\u8d62\u5f97\u6bd4\u8d5b\u7684\u5927\u5b66", "Url": "https://leetcode.cn/problems/the-winner-university/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2073, "Title": "Time Needed to Buy Tickets", "TitleCn": "\u4e70\u7968\u9700\u8981\u7684\u65f6\u95f4", "Url": "https://leetcode.cn/problems/time-needed-to-buy-tickets/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 267 Problem 1"}, {"ID": 2074, "Title": "Reverse Nodes in Even Length Groups", "TitleCn": "\u53cd\u8f6c\u5076\u6570\u957f\u5ea6\u7ec4\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/reverse-nodes-in-even-length-groups/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 267 Problem 2"}, {"ID": 2075, "Title": "Decode the Slanted Ciphertext", "TitleCn": "\u89e3\u7801\u659c\u5411\u6362\u4f4d\u5bc6\u7801", "Url": "https://leetcode.cn/problems/decode-the-slanted-ciphertext/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 267 Problem 3"}, {"ID": 2076, "Title": "Process Restricted Friend Requests", "TitleCn": "\u5904\u7406\u542b\u9650\u5236\u6761\u4ef6\u7684\u597d\u53cb\u8bf7\u6c42", "Url": "https://leetcode.cn/problems/process-restricted-friend-requests/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 267 Problem 4"}, {"ID": 2077, "Title": "Paths in Maze That Lead to Same Room", "TitleCn": "\u6b8a\u9014\u540c\u5f52", "Url": "https://leetcode.cn/problems/paths-in-maze-that-lead-to-same-room/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2078, "Title": "Two Furthest Houses With Different Colors", "TitleCn": "\u4e24\u680b\u989c\u8272\u4e0d\u540c\u4e14\u8ddd\u79bb\u6700\u8fdc\u7684\u623f\u5b50", "Url": "https://leetcode.cn/problems/two-furthest-houses-with-different-colors/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 268 Problem 1"}, {"ID": 2079, "Title": "Watering Plants", "TitleCn": "\u7ed9\u690d\u7269\u6d47\u6c34", "Url": "https://leetcode.cn/problems/watering-plants/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 268 Problem 2"}, {"ID": 2080, "Title": "Range Frequency Queries", "TitleCn": "\u533a\u95f4\u5185\u67e5\u8be2\u6570\u5b57\u7684\u9891\u7387", "Url": "https://leetcode.cn/problems/range-frequency-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 268 Problem 3"}, {"ID": 2081, "Title": "Sum of k-Mirror Numbers", "TitleCn": "k \u955c\u50cf\u6570\u5b57\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-k-mirror-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 268 Problem 4"}, {"ID": 2082, "Title": "The Number of Rich Customers", "TitleCn": "\u5bcc\u6709\u5ba2\u6237\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/the-number-of-rich-customers/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2083, "Title": "Substrings That Begin and End With the Same Letter", "TitleCn": "\u6c42\u4ee5\u76f8\u540c\u5b57\u6bcd\u5f00\u5934\u548c\u7ed3\u5c3e\u7684\u5b50\u4e32\u603b\u6570", "Url": "https://leetcode.cn/problems/substrings-that-begin-and-end-with-the-same-letter/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2084, "Title": "Drop Type 1 Orders for Customers With Type 0 Orders", "TitleCn": "\u4e3a\u8ba2\u5355\u7c7b\u578b\u4e3a 0 \u7684\u5ba2\u6237\u5220\u9664\u7c7b\u578b\u4e3a 1 \u7684\u8ba2\u5355", "Url": "https://leetcode.cn/problems/drop-type-1-orders-for-customers-with-type-0-orders/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2085, "Title": "Count Common Words With One Occurrence", "TitleCn": "\u7edf\u8ba1\u51fa\u73b0\u8fc7\u4e00\u6b21\u7684\u516c\u5171\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/count-common-words-with-one-occurrence/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 66 Problem 1"}, {"ID": 2086, "Title": "Minimum Number of Food Buckets to Feed the Hamsters", "TitleCn": "\u5582\u98df\u4ed3\u9f20\u7684\u6700\u5c0f\u98df\u7269\u6876\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-food-buckets-to-feed-the-hamsters/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 66 Problem 2"}, {"ID": 2087, "Title": "Minimum Cost Homecoming of a Robot in a Grid", "TitleCn": "\u7f51\u683c\u56fe\u4e2d\u673a\u5668\u4eba\u56de\u5bb6\u7684\u6700\u5c0f\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-homecoming-of-a-robot-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 66 Problem 3"}, {"ID": 2088, "Title": "Count Fertile Pyramids in a Land", "TitleCn": "\u7edf\u8ba1\u519c\u573a\u4e2d\u80a5\u6c83\u91d1\u5b57\u5854\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-fertile-pyramids-in-a-land/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 66 Problem 4"}, {"ID": 2089, "Title": "Find Target Indices After Sorting Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u6392\u5e8f\u540e\u7684\u76ee\u6807\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-target-indices-after-sorting-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 269 Problem 1"}, {"ID": 2090, "Title": "K Radius Subarray Averages", "TitleCn": "\u534a\u5f84\u4e3a k \u7684\u5b50\u6570\u7ec4\u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/k-radius-subarray-averages/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 269 Problem 2"}, {"ID": 2091, "Title": "Removing Minimum and Maximum From Array", "TitleCn": "\u4ece\u6570\u7ec4\u4e2d\u79fb\u9664\u6700\u5927\u503c\u548c\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/removing-minimum-and-maximum-from-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 269 Problem 3"}, {"ID": 2092, "Title": "Find All People With Secret", "TitleCn": "\u627e\u51fa\u77e5\u6653\u79d8\u5bc6\u7684\u6240\u6709\u4e13\u5bb6", "Url": "https://leetcode.cn/problems/find-all-people-with-secret/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 269 Problem 4"}, {"ID": 2093, "Title": "Minimum Cost to Reach City With Discounts", "TitleCn": "\u524d\u5f80\u76ee\u6807\u57ce\u5e02\u7684\u6700\u5c0f\u8d39\u7528", "Url": "https://leetcode.cn/problems/minimum-cost-to-reach-city-with-discounts/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2094, "Title": "Finding 3-Digit Even Numbers", "TitleCn": "\u627e\u51fa 3 \u4f4d\u5076\u6570", "Url": "https://leetcode.cn/problems/finding-3-digit-even-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 270 Problem 1"}, {"ID": 2095, "Title": "Delete the Middle Node of a Linked List", "TitleCn": "\u5220\u9664\u94fe\u8868\u7684\u4e2d\u95f4\u8282\u70b9", "Url": "https://leetcode.cn/problems/delete-the-middle-node-of-a-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 270 Problem 2"}, {"ID": 2096, "Title": "Step-By-Step Directions From a Binary Tree Node to Another", "TitleCn": "\u4ece\u4e8c\u53c9\u6811\u4e00\u4e2a\u8282\u70b9\u5230\u53e6\u4e00\u4e2a\u8282\u70b9\u6bcf\u4e00\u6b65\u7684\u65b9\u5411", "Url": "https://leetcode.cn/problems/step-by-step-directions-from-a-binary-tree-node-to-another/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 270 Problem 3"}, {"ID": 2097, "Title": "Valid Arrangement of Pairs", "TitleCn": "\u5408\u6cd5\u91cd\u65b0\u6392\u5217\u6570\u5bf9", "Url": "https://leetcode.cn/problems/valid-arrangement-of-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 270 Problem 4"}, {"ID": 2098, "Title": "Subsequence of Size K With the Largest Even Sum", "TitleCn": "\u957f\u5ea6\u4e3a K \u7684\u6700\u5927\u5076\u6570\u548c\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/subsequence-of-size-k-with-the-largest-even-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2099, "Title": "Find Subsequence of Length K With the Largest Sum", "TitleCn": "\u627e\u5230\u548c\u6700\u5927\u7684\u957f\u5ea6\u4e3a K \u7684\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/find-subsequence-of-length-k-with-the-largest-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 67 Problem 1"}, {"ID": 2100, "Title": "Find Good Days to Rob the Bank", "TitleCn": "\u9002\u5408\u91ce\u708a\u7684\u65e5\u5b50", "Url": "https://leetcode.cn/problems/find-good-days-to-rob-the-bank/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 67 Problem 2"}, {"ID": 2101, "Title": "Detonate the Maximum Bombs", "TitleCn": "\u5f15\u7206\u6700\u591a\u7684\u70b8\u5f39", "Url": "https://leetcode.cn/problems/detonate-the-maximum-bombs/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 67 Problem 3"}, {"ID": 2102, "Title": "Sequentially Ordinal Rank Tracker", "TitleCn": "\u5e8f\u5217\u987a\u5e8f\u67e5\u8be2", "Url": "https://leetcode.cn/problems/sequentially-ordinal-rank-tracker/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 67 Problem 4"}, {"ID": 2103, "Title": "Rings and Rods", "TitleCn": "\u73af\u548c\u6746", "Url": "https://leetcode.cn/problems/rings-and-rods/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 271 Problem 1"}, {"ID": 2104, "Title": "Sum of Subarray Ranges", "TitleCn": "\u5b50\u6570\u7ec4\u8303\u56f4\u548c", "Url": "https://leetcode.cn/problems/sum-of-subarray-ranges/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 7, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 271 Problem 2"}, {"ID": 2105, "Title": "Watering Plants II", "TitleCn": "\u7ed9\u690d\u7269\u6d47\u6c34 II", "Url": "https://leetcode.cn/problems/watering-plants-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 271 Problem 3"}, {"ID": 2106, "Title": "Maximum Fruits Harvested After at Most K Steps", "TitleCn": "\u6458\u6c34\u679c", "Url": "https://leetcode.cn/problems/maximum-fruits-harvested-after-at-most-k-steps/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 271 Problem 4"}, {"ID": 2107, "Title": "Number of Unique Flavors After Sharing K Candies", "TitleCn": "\u5206\u4eab K \u4e2a\u7cd6\u679c\u540e\u72ec\u7279\u53e3\u5473\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-unique-flavors-after-sharing-k-candies/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2108, "Title": "Find First Palindromic String in the Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u7b2c\u4e00\u4e2a\u56de\u6587\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-first-palindromic-string-in-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 272 Problem 1"}, {"ID": 2109, "Title": "Adding Spaces to a String", "TitleCn": "\u5411\u5b57\u7b26\u4e32\u6dfb\u52a0\u7a7a\u683c", "Url": "https://leetcode.cn/problems/adding-spaces-to-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 272 Problem 2"}, {"ID": 2110, "Title": "Number of Smooth Descent Periods of a Stock", "TitleCn": "\u80a1\u7968\u5e73\u6ed1\u4e0b\u8dcc\u9636\u6bb5\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-smooth-descent-periods-of-a-stock/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 272 Problem 3"}, {"ID": 2111, "Title": "Minimum Operations to Make the Array K-Increasing", "TitleCn": "\u4f7f\u6570\u7ec4 K \u9012\u589e\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-the-array-k-increasing/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 272 Problem 4"}, {"ID": 2112, "Title": "The Airport With the Most Traffic", "TitleCn": "\u6700\u7e41\u5fd9\u7684\u673a\u573a", "Url": "https://leetcode.cn/problems/the-airport-with-the-most-traffic/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2113, "Title": "Elements in Array After Removing and Replacing Elements", "TitleCn": "\u67e5\u8be2\u5220\u9664\u548c\u6dfb\u52a0\u5143\u7d20\u540e\u7684\u6570\u7ec4", "Url": "https://leetcode.cn/problems/elements-in-array-after-removing-and-replacing-elements/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2114, "Title": "Maximum Number of Words Found in Sentences", "TitleCn": "\u53e5\u5b50\u4e2d\u7684\u6700\u591a\u5355\u8bcd\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-words-found-in-sentences/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 68 Problem 1"}, {"ID": 2115, "Title": "Find All Possible Recipes from Given Supplies", "TitleCn": "\u4ece\u7ed9\u5b9a\u539f\u6750\u6599\u4e2d\u627e\u5230\u6240\u6709\u53ef\u4ee5\u505a\u51fa\u7684\u83dc", "Url": "https://leetcode.cn/problems/find-all-possible-recipes-from-given-supplies/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 68 Problem 2"}, {"ID": 2116, "Title": "Check if a Parentheses String Can Be Valid", "TitleCn": "\u5224\u65ad\u4e00\u4e2a\u62ec\u53f7\u5b57\u7b26\u4e32\u662f\u5426\u6709\u6548", "Url": "https://leetcode.cn/problems/check-if-a-parentheses-string-can-be-valid/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 68 Problem 3"}, {"ID": 2117, "Title": "Abbreviating the Product of a Range", "TitleCn": "\u4e00\u4e2a\u533a\u95f4\u5185\u6240\u6709\u6570\u4e58\u79ef\u7684\u7f29\u5199", "Url": "https://leetcode.cn/problems/abbreviating-the-product-of-a-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 68 Problem 4"}, {"ID": 2118, "Title": "Build the Equation", "TitleCn": "\u5efa\u7acb\u65b9\u7a0b", "Url": "https://leetcode.cn/problems/build-the-equation/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 10, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2119, "Title": "A Number After a Double Reversal", "TitleCn": "\u53cd\u8f6c\u4e24\u6b21\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/a-number-after-a-double-reversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 273 Problem 1"}, {"ID": 2120, "Title": "Execution of All Suffix Instructions Staying in a Grid", "TitleCn": "\u6267\u884c\u6240\u6709\u540e\u7f00\u6307\u4ee4", "Url": "https://leetcode.cn/problems/execution-of-all-suffix-instructions-staying-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 273 Problem 2"}, {"ID": 2121, "Title": "Intervals Between Identical Elements", "TitleCn": "\u76f8\u540c\u5143\u7d20\u7684\u95f4\u9694\u4e4b\u548c", "Url": "https://leetcode.cn/problems/intervals-between-identical-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 273 Problem 3"}, {"ID": 2122, "Title": "Recover the Original Array", "TitleCn": "\u8fd8\u539f\u539f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/recover-the-original-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 273 Problem 4"}, {"ID": 2123, "Title": "Minimum Operations to Remove Adjacent Ones in Matrix", "TitleCn": "\u4f7f\u77e9\u9635\u4e2d\u7684 1 \u4e92\u4e0d\u76f8\u90bb\u7684\u6700\u5c0f\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-remove-adjacent-ones-in-matrix/", "Ispaid": 1, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2124, "Title": "Check if All A's Appears Before All B's", "TitleCn": "\u68c0\u67e5\u662f\u5426\u6240\u6709 A \u90fd\u5728 B \u4e4b\u524d", "Url": "https://leetcode.cn/problems/check-if-all-as-appears-before-all-bs/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 274 Problem 1"}, {"ID": 2125, "Title": "Number of Laser Beams in a Bank", "TitleCn": "\u94f6\u884c\u4e2d\u7684\u6fc0\u5149\u675f\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-laser-beams-in-a-bank/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 274 Problem 2"}, {"ID": 2126, "Title": "Destroying Asteroids", "TitleCn": "\u6467\u6bc1\u5c0f\u884c\u661f", "Url": "https://leetcode.cn/problems/destroying-asteroids/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 274 Problem 3"}, {"ID": 2127, "Title": "Maximum Employees to Be Invited to a Meeting", "TitleCn": "\u53c2\u52a0\u4f1a\u8bae\u7684\u6700\u591a\u5458\u5de5\u6570", "Url": "https://leetcode.cn/problems/maximum-employees-to-be-invited-to-a-meeting/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 274 Problem 4"}, {"ID": 2128, "Title": "Remove All Ones With Row and Column Flips", "TitleCn": "\u901a\u8fc7\u7ffb\u8f6c\u884c\u6216\u5217\u6765\u53bb\u9664\u6240\u6709\u7684 1", "Url": "https://leetcode.cn/problems/remove-all-ones-with-row-and-column-flips/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2129, "Title": "Capitalize the Title", "TitleCn": "\u5c06\u6807\u9898\u9996\u5b57\u6bcd\u5927\u5199", "Url": "https://leetcode.cn/problems/capitalize-the-title/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 69 Problem 1"}, {"ID": 2130, "Title": "Maximum Twin Sum of a Linked List", "TitleCn": "\u94fe\u8868\u6700\u5927\u5b6a\u751f\u548c", "Url": "https://leetcode.cn/problems/maximum-twin-sum-of-a-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 69 Problem 2"}, {"ID": 2131, "Title": "Longest Palindrome by Concatenating Two Letter Words", "TitleCn": "\u8fde\u63a5\u4e24\u5b57\u6bcd\u5355\u8bcd\u5f97\u5230\u7684\u6700\u957f\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/longest-palindrome-by-concatenating-two-letter-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 69 Problem 3"}, {"ID": 2132, "Title": "Stamping the Grid", "TitleCn": "\u7528\u90ae\u7968\u8d34\u6ee1\u7f51\u683c\u56fe", "Url": "https://leetcode.cn/problems/stamping-the-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 69 Problem 4"}, {"ID": 2133, "Title": "Check if Every Row and Column Contains All Numbers", "TitleCn": "\u68c0\u67e5\u662f\u5426\u6bcf\u4e00\u884c\u6bcf\u4e00\u5217\u90fd\u5305\u542b\u5168\u90e8\u6574\u6570", "Url": "https://leetcode.cn/problems/check-if-every-row-and-column-contains-all-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 275 Problem 1"}, {"ID": 2134, "Title": "Minimum Swaps to Group All 1's Together II", "TitleCn": "\u6700\u5c11\u4ea4\u6362\u6b21\u6570\u6765\u7ec4\u5408\u6240\u6709\u7684 1 II", "Url": "https://leetcode.cn/problems/minimum-swaps-to-group-all-1s-together-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 275 Problem 2"}, {"ID": 2135, "Title": "Count Words Obtained After Adding a Letter", "TitleCn": "\u7edf\u8ba1\u8ffd\u52a0\u5b57\u6bcd\u53ef\u4ee5\u83b7\u5f97\u7684\u5355\u8bcd\u6570", "Url": "https://leetcode.cn/problems/count-words-obtained-after-adding-a-letter/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 275 Problem 3"}, {"ID": 2136, "Title": "Earliest Possible Day of Full Bloom", "TitleCn": "\u5168\u90e8\u5f00\u82b1\u7684\u6700\u65e9\u4e00\u5929", "Url": "https://leetcode.cn/problems/earliest-possible-day-of-full-bloom/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 275 Problem 4"}, {"ID": 2137, "Title": "Pour Water Between Buckets to Make Water Levels Equal", "TitleCn": "\u901a\u8fc7\u5012\u6c34\u64cd\u4f5c\u8ba9\u6240\u6709\u7684\u6c34\u6876\u6240\u542b\u6c34\u91cf\u76f8\u7b49", "Url": "https://leetcode.cn/problems/pour-water-between-buckets-to-make-water-levels-equal/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2138, "Title": "Divide a String Into Groups of Size k", "TitleCn": "\u5c06\u5b57\u7b26\u4e32\u62c6\u5206\u4e3a\u82e5\u5e72\u957f\u5ea6\u4e3a k \u7684\u7ec4", "Url": "https://leetcode.cn/problems/divide-a-string-into-groups-of-size-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 276 Problem 1"}, {"ID": 2139, "Title": "Minimum Moves to Reach Target Score", "TitleCn": "\u5f97\u5230\u76ee\u6807\u503c\u7684\u6700\u5c11\u884c\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-moves-to-reach-target-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 276 Problem 2"}, {"ID": 2140, "Title": "Solving Questions With Brainpower", "TitleCn": "\u89e3\u51b3\u667a\u529b\u95ee\u9898", "Url": "https://leetcode.cn/problems/solving-questions-with-brainpower/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 276 Problem 3"}, {"ID": 2141, "Title": "Maximum Running Time of N Computers", "TitleCn": "\u540c\u65f6\u8fd0\u884c N \u53f0\u7535\u8111\u7684\u6700\u957f\u65f6\u95f4", "Url": "https://leetcode.cn/problems/maximum-running-time-of-n-computers/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 276 Problem 4"}, {"ID": 2142, "Title": "The Number of Passengers in Each Bus I", "TitleCn": "\u6bcf\u8f86\u8f66\u7684\u4e58\u5ba2\u4eba\u6570 I", "Url": "https://leetcode.cn/problems/the-number-of-passengers-in-each-bus-i/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2143, "Title": "Choose Numbers From Two Arrays in Range", "TitleCn": "\u5728\u4e24\u4e2a\u6570\u7ec4\u7684\u533a\u95f4\u4e2d\u9009\u53d6\u6570\u5b57", "Url": "https://leetcode.cn/problems/choose-numbers-from-two-arrays-in-range/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2144, "Title": "Minimum Cost of Buying Candies With Discount", "TitleCn": "\u6253\u6298\u8d2d\u4e70\u7cd6\u679c\u7684\u6700\u5c0f\u5f00\u9500", "Url": "https://leetcode.cn/problems/minimum-cost-of-buying-candies-with-discount/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 70 Problem 1"}, {"ID": 2145, "Title": "Count the Hidden Sequences", "TitleCn": "\u7edf\u8ba1\u9690\u85cf\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-hidden-sequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 70 Problem 2"}, {"ID": 2146, "Title": "K Highest Ranked Items Within a Price Range", "TitleCn": "\u4ef7\u683c\u8303\u56f4\u5185\u6700\u9ad8\u6392\u540d\u7684 K \u6837\u7269\u54c1", "Url": "https://leetcode.cn/problems/k-highest-ranked-items-within-a-price-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 70 Problem 3"}, {"ID": 2147, "Title": "Number of Ways to Divide a Long Corridor", "TitleCn": "\u5206\u9694\u957f\u5eca\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-divide-a-long-corridor/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 70 Problem 4"}, {"ID": 2148, "Title": "Count Elements With Strictly Smaller and Greater Elements", "TitleCn": "\u5143\u7d20\u8ba1\u6570", "Url": "https://leetcode.cn/problems/count-elements-with-strictly-smaller-and-greater-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 277 Problem 1"}, {"ID": 2149, "Title": "Rearrange Array Elements by Sign", "TitleCn": "\u6309\u7b26\u53f7\u91cd\u6392\u6570\u7ec4", "Url": "https://leetcode.cn/problems/rearrange-array-elements-by-sign/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 277 Problem 2"}, {"ID": 2150, "Title": "Find All Lonely Numbers in the Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u6240\u6709\u5b64\u72ec\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-all-lonely-numbers-in-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 277 Problem 3"}, {"ID": 2151, "Title": "Maximum Good People Based on Statements", "TitleCn": "\u57fa\u4e8e\u9648\u8ff0\u7edf\u8ba1\u6700\u591a\u597d\u4eba\u6570", "Url": "https://leetcode.cn/problems/maximum-good-people-based-on-statements/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 277 Problem 4"}, {"ID": 2152, "Title": "Minimum Number of Lines to Cover Points", "TitleCn": "\u7a7f\u8fc7\u6240\u6709\u70b9\u7684\u6240\u9700\u6700\u5c11\u76f4\u7ebf\u6570\u91cf", "Url": "https://leetcode.cn/problems/minimum-number-of-lines-to-cover-points/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2153, "Title": "The Number of Passengers in Each Bus II", "TitleCn": "\u6bcf\u8f86\u8f66\u7684\u4e58\u5ba2\u4eba\u6570 II", "Url": "https://leetcode.cn/problems/the-number-of-passengers-in-each-bus-ii/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2154, "Title": "Keep Multiplying Found Values by Two", "TitleCn": "\u5c06\u627e\u5230\u7684\u503c\u4e58\u4ee5 2", "Url": "https://leetcode.cn/problems/keep-multiplying-found-values-by-two/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 278 Problem 1"}, {"ID": 2155, "Title": "All Divisions With the Highest Score of a Binary Array", "TitleCn": "\u5206\u7ec4\u5f97\u5206\u6700\u9ad8\u7684\u6240\u6709\u4e0b\u6807", "Url": "https://leetcode.cn/problems/all-divisions-with-the-highest-score-of-a-binary-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 278 Problem 2"}, {"ID": 2156, "Title": "Find Substring With Given Hash Value", "TitleCn": "\u67e5\u627e\u7ed9\u5b9a\u54c8\u5e0c\u503c\u7684\u5b50\u4e32", "Url": "https://leetcode.cn/problems/find-substring-with-given-hash-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 278 Problem 3"}, {"ID": 2157, "Title": "Groups of Strings", "TitleCn": "\u5b57\u7b26\u4e32\u5206\u7ec4", "Url": "https://leetcode.cn/problems/groups-of-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 278 Problem 4"}, {"ID": 2158, "Title": "Amount of New Area Painted Each Day", "TitleCn": "\u6bcf\u5929\u7ed8\u5236\u65b0\u533a\u57df\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/amount-of-new-area-painted-each-day/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2159, "Title": "Order Two Columns Independently", "TitleCn": "\u5206\u522b\u6392\u5e8f\u4e24\u5217", "Url": "https://leetcode.cn/problems/order-two-columns-independently/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2160, "Title": "Minimum Sum of Four Digit Number After Splitting Digits", "TitleCn": "\u62c6\u5206\u6570\u4f4d\u540e\u56db\u4f4d\u6570\u5b57\u7684\u6700\u5c0f\u548c", "Url": "https://leetcode.cn/problems/minimum-sum-of-four-digit-number-after-splitting-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 71 Problem 1"}, {"ID": 2161, "Title": "Partition Array According to Given Pivot", "TitleCn": "\u6839\u636e\u7ed9\u5b9a\u6570\u5b57\u5212\u5206\u6570\u7ec4", "Url": "https://leetcode.cn/problems/partition-array-according-to-given-pivot/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 71 Problem 2"}, {"ID": 2162, "Title": "Minimum Cost to Set Cooking Time", "TitleCn": "\u8bbe\u7f6e\u65f6\u95f4\u7684\u6700\u5c11\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-to-set-cooking-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 71 Problem 3"}, {"ID": 2163, "Title": "Minimum Difference in Sums After Removal of Elements", "TitleCn": "\u5220\u9664\u5143\u7d20\u540e\u548c\u7684\u6700\u5c0f\u5dee\u503c", "Url": "https://leetcode.cn/problems/minimum-difference-in-sums-after-removal-of-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 71 Problem 4"}, {"ID": 2164, "Title": "Sort Even and Odd Indices Independently", "TitleCn": "\u5bf9\u5947\u5076\u4e0b\u6807\u5206\u522b\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-even-and-odd-indices-independently/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 279 Problem 1"}, {"ID": 2165, "Title": "Smallest Value of the Rearranged Number", "TitleCn": "\u91cd\u6392\u6570\u5b57\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/smallest-value-of-the-rearranged-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 279 Problem 2"}, {"ID": 2166, "Title": "Design Bitset", "TitleCn": "\u8bbe\u8ba1\u4f4d\u96c6", "Url": "https://leetcode.cn/problems/design-bitset/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 279 Problem 3"}, {"ID": 2167, "Title": "Minimum Time to Remove All Cars Containing Illegal Goods", "TitleCn": "\u79fb\u9664\u6240\u6709\u8f7d\u6709\u8fdd\u7981\u8d27\u7269\u8f66\u53a2\u6240\u9700\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-remove-all-cars-containing-illegal-goods/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 279 Problem 4"}, {"ID": 2168, "Title": "Unique Substrings With Equal Digit Frequency", "TitleCn": "\u6bcf\u4e2a\u6570\u5b57\u7684\u9891\u7387\u90fd\u76f8\u540c\u7684\u72ec\u7279\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/unique-substrings-with-equal-digit-frequency/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2169, "Title": "Count Operations to Obtain Zero", "TitleCn": "\u5f97\u5230 0 \u7684\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/count-operations-to-obtain-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 280 Problem 1"}, {"ID": 2170, "Title": "Minimum Operations to Make the Array Alternating", "TitleCn": "\u4f7f\u6570\u7ec4\u53d8\u6210\u4ea4\u66ff\u6570\u7ec4\u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-the-array-alternating/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 280 Problem 2"}, {"ID": 2171, "Title": "Removing Minimum Number of Magic Beans", "TitleCn": "\u62ff\u51fa\u6700\u5c11\u6570\u76ee\u7684\u9b54\u6cd5\u8c46", "Url": "https://leetcode.cn/problems/removing-minimum-number-of-magic-beans/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 280 Problem 3"}, {"ID": 2172, "Title": "Maximum AND Sum of Array", "TitleCn": "\u6570\u7ec4\u7684\u6700\u5927\u4e0e\u548c", "Url": "https://leetcode.cn/problems/maximum-and-sum-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 280 Problem 4"}, {"ID": 2173, "Title": "Longest Winning Streak", "TitleCn": "\u6700\u591a\u8fde\u80dc\u7684\u6b21\u6570", "Url": "https://leetcode.cn/problems/longest-winning-streak/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 10, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2174, "Title": "Remove All Ones With Row and Column Flips II", "TitleCn": "\u901a\u8fc7\u7ffb\u8f6c\u884c\u6216\u5217\u6765\u53bb\u9664\u6240\u6709\u7684 1 II", "Url": "https://leetcode.cn/problems/remove-all-ones-with-row-and-column-flips-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2175, "Title": "The Change in Global Rankings", "TitleCn": "\u4e16\u754c\u6392\u540d\u7684\u53d8\u5316", "Url": "https://leetcode.cn/problems/the-change-in-global-rankings/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2176, "Title": "Count Equal and Divisible Pairs in an Array", "TitleCn": "\u7edf\u8ba1\u6570\u7ec4\u4e2d\u76f8\u7b49\u4e14\u53ef\u4ee5\u88ab\u6574\u9664\u7684\u6570\u5bf9", "Url": "https://leetcode.cn/problems/count-equal-and-divisible-pairs-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 72 Problem 1"}, {"ID": 2177, "Title": "Find Three Consecutive Integers That Sum to a Given Number", "TitleCn": "\u627e\u5230\u548c\u4e3a\u7ed9\u5b9a\u6574\u6570\u7684\u4e09\u4e2a\u8fde\u7eed\u6574\u6570", "Url": "https://leetcode.cn/problems/find-three-consecutive-integers-that-sum-to-a-given-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 72 Problem 2"}, {"ID": 2178, "Title": "Maximum Split of Positive Even Integers", "TitleCn": "\u62c6\u5206\u6210\u6700\u591a\u6570\u76ee\u7684\u6b63\u5076\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/maximum-split-of-positive-even-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 72 Problem 3"}, {"ID": 2179, "Title": "Count Good Triplets in an Array", "TitleCn": "\u7edf\u8ba1\u6570\u7ec4\u4e2d\u597d\u4e09\u5143\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-good-triplets-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 72 Problem 4"}, {"ID": 2180, "Title": "Count Integers With Even Digit Sum", "TitleCn": "\u7edf\u8ba1\u5404\u4f4d\u6570\u5b57\u4e4b\u548c\u4e3a\u5076\u6570\u7684\u6574\u6570\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-integers-with-even-digit-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 281 Problem 1"}, {"ID": 2181, "Title": "Merge Nodes in Between Zeros", "TitleCn": "\u5408\u5e76\u96f6\u4e4b\u95f4\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/merge-nodes-in-between-zeros/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 281 Problem 2"}, {"ID": 2182, "Title": "Construct String With Repeat Limit", "TitleCn": "\u6784\u9020\u9650\u5236\u91cd\u590d\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/construct-string-with-repeat-limit/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 281 Problem 3"}, {"ID": 2183, "Title": "Count Array Pairs Divisible by K", "TitleCn": "\u7edf\u8ba1\u53ef\u4ee5\u88ab K \u6574\u9664\u7684\u4e0b\u6807\u5bf9\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-array-pairs-divisible-by-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 281 Problem 4"}, {"ID": 2184, "Title": "Number of Ways to Build Sturdy Brick Wall", "TitleCn": "\u5efa\u9020\u575a\u5b9e\u7684\u7816\u5899\u7684\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-build-sturdy-brick-wall/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2185, "Title": "Counting Words With a Given Prefix", "TitleCn": "\u7edf\u8ba1\u5305\u542b\u7ed9\u5b9a\u524d\u7f00\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/counting-words-with-a-given-prefix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 282 Problem 1"}, {"ID": 2186, "Title": "Minimum Number of Steps to Make Two Strings Anagram II", "TitleCn": "\u5236\u9020\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u7684\u6700\u5c0f\u6b65\u9aa4\u6570 II", "Url": "https://leetcode.cn/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 282 Problem 2"}, {"ID": 2187, "Title": "Minimum Time to Complete Trips", "TitleCn": "\u5b8c\u6210\u65c5\u9014\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-complete-trips/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 282 Problem 3"}, {"ID": 2188, "Title": "Minimum Time to Finish the Race", "TitleCn": "\u5b8c\u6210\u6bd4\u8d5b\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-finish-the-race/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 282 Problem 4"}, {"ID": 2189, "Title": "Number of Ways to Build House of Cards", "TitleCn": "\u5efa\u9020\u7eb8\u724c\u5c4b\u7684\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-build-house-of-cards/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2190, "Title": "Most Frequent Number Following Key In an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7d27\u8ddf key \u4e4b\u540e\u51fa\u73b0\u6700\u9891\u7e41\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/most-frequent-number-following-key-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 73 Problem 1"}, {"ID": 2191, "Title": "Sort the Jumbled Numbers", "TitleCn": "\u5c06\u6742\u4e71\u65e0\u7ae0\u7684\u6570\u5b57\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-the-jumbled-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 73 Problem 2"}, {"ID": 2192, "Title": "All Ancestors of a Node in a Directed Acyclic Graph", "TitleCn": "\u6709\u5411\u65e0\u73af\u56fe\u4e2d\u4e00\u4e2a\u8282\u70b9\u7684\u6240\u6709\u7956\u5148", "Url": "https://leetcode.cn/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 73 Problem 3"}, {"ID": 2193, "Title": "Minimum Number of Moves to Make Palindrome", "TitleCn": "\u5f97\u5230\u56de\u6587\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-moves-to-make-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 73 Problem 4"}, {"ID": 2194, "Title": "Cells in a Range on an Excel Sheet", "TitleCn": "Excel \u8868\u4e2d\u67d0\u4e2a\u8303\u56f4\u5185\u7684\u5355\u5143\u683c", "Url": "https://leetcode.cn/problems/cells-in-a-range-on-an-excel-sheet/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 283 Problem 1"}, {"ID": 2195, "Title": "Append K Integers With Minimal Sum", "TitleCn": "\u5411\u6570\u7ec4\u4e2d\u8ffd\u52a0 K \u4e2a\u6574\u6570", "Url": "https://leetcode.cn/problems/append-k-integers-with-minimal-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 283 Problem 2"}, {"ID": 2196, "Title": "Create Binary Tree From Descriptions", "TitleCn": "\u6839\u636e\u63cf\u8ff0\u521b\u5efa\u4e8c\u53c9\u6811", "Url": "https://leetcode.cn/problems/create-binary-tree-from-descriptions/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 283 Problem 3"}, {"ID": 2197, "Title": "Replace Non-Coprime Numbers in Array", "TitleCn": "\u66ff\u6362\u6570\u7ec4\u4e2d\u7684\u975e\u4e92\u8d28\u6570", "Url": "https://leetcode.cn/problems/replace-non-coprime-numbers-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 283 Problem 4"}, {"ID": 2198, "Title": "Number of Single Divisor Triplets", "TitleCn": "\u5355\u56e0\u6570\u4e09\u5143\u7ec4", "Url": "https://leetcode.cn/problems/number-of-single-divisor-triplets/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2199, "Title": "Finding the Topic of Each Post", "TitleCn": "\u627e\u5230\u6bcf\u7bc7\u6587\u7ae0\u7684\u4e3b\u9898", "Url": "https://leetcode.cn/problems/finding-the-topic-of-each-post/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2200, "Title": "Find All K-Distant Indices in an Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u6240\u6709 K \u8fd1\u90bb\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-all-k-distant-indices-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 284 Problem 1"}, {"ID": 2201, "Title": "Count Artifacts That Can Be Extracted", "TitleCn": "\u7edf\u8ba1\u53ef\u4ee5\u63d0\u53d6\u7684\u5de5\u4ef6", "Url": "https://leetcode.cn/problems/count-artifacts-that-can-be-extracted/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 284 Problem 2"}, {"ID": 2202, "Title": "Maximize the Topmost Element After K Moves", "TitleCn": "K \u6b21\u64cd\u4f5c\u540e\u6700\u5927\u5316\u9876\u7aef\u5143\u7d20", "Url": "https://leetcode.cn/problems/maximize-the-topmost-element-after-k-moves/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 284 Problem 3"}, {"ID": 2203, "Title": "Minimum Weighted Subgraph With the Required Paths", "TitleCn": "\u5f97\u5230\u8981\u6c42\u8def\u5f84\u7684\u6700\u5c0f\u5e26\u6743\u5b50\u56fe", "Url": "https://leetcode.cn/problems/minimum-weighted-subgraph-with-the-required-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 284 Problem 4"}, {"ID": 2204, "Title": "Distance to a Cycle in Undirected Graph", "TitleCn": "\u65e0\u5411\u56fe\u4e2d\u5230\u73af\u7684\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/distance-to-a-cycle-in-undirected-graph/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2205, "Title": "The Number of Users That Are Eligible for Discount", "TitleCn": "\u6709\u8d44\u683c\u4eab\u53d7\u6298\u6263\u7684\u7528\u6237\u6570\u91cf", "Url": "https://leetcode.cn/problems/the-number-of-users-that-are-eligible-for-discount/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2206, "Title": "Divide Array Into Equal Pairs", "TitleCn": "\u5c06\u6570\u7ec4\u5212\u5206\u6210\u76f8\u7b49\u6570\u5bf9", "Url": "https://leetcode.cn/problems/divide-array-into-equal-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 74 Problem 1"}, {"ID": 2207, "Title": "Maximize Number of Subsequences in a String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u6700\u591a\u6570\u76ee\u7684\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/maximize-number-of-subsequences-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 74 Problem 2"}, {"ID": 2208, "Title": "Minimum Operations to Halve Array Sum", "TitleCn": "\u5c06\u6570\u7ec4\u548c\u51cf\u534a\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-halve-array-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 74 Problem 3"}, {"ID": 2209, "Title": "Minimum White Tiles After Covering With Carpets", "TitleCn": "\u7528\u5730\u6bef\u8986\u76d6\u540e\u7684\u6700\u5c11\u767d\u8272\u7816\u5757", "Url": "https://leetcode.cn/problems/minimum-white-tiles-after-covering-with-carpets/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 74 Problem 4"}, {"ID": 2210, "Title": "Count Hills and Valleys in an Array", "TitleCn": "\u7edf\u8ba1\u6570\u7ec4\u4e2d\u5cf0\u548c\u8c37\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-hills-and-valleys-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 285 Problem 1"}, {"ID": 2211, "Title": "Count Collisions on a Road", "TitleCn": "\u7edf\u8ba1\u9053\u8def\u4e0a\u7684\u78b0\u649e\u6b21\u6570", "Url": "https://leetcode.cn/problems/count-collisions-on-a-road/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 285 Problem 2"}, {"ID": 2212, "Title": "Maximum Points in an Archery Competition", "TitleCn": "\u5c04\u7bad\u6bd4\u8d5b\u4e2d\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-points-in-an-archery-competition/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 285 Problem 3"}, {"ID": 2213, "Title": "Longest Substring of One Repeating Character", "TitleCn": "\u7531\u5355\u4e2a\u5b57\u7b26\u91cd\u590d\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/longest-substring-of-one-repeating-character/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 285 Problem 4"}, {"ID": 2214, "Title": "Minimum Health to Beat Game", "TitleCn": "\u901a\u5173\u6e38\u620f\u6240\u9700\u7684\u6700\u4f4e\u751f\u547d\u503c", "Url": "https://leetcode.cn/problems/minimum-health-to-beat-game/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2215, "Title": "Find the Difference of Two Arrays", "TitleCn": "\u627e\u51fa\u4e24\u6570\u7ec4\u7684\u4e0d\u540c", "Url": "https://leetcode.cn/problems/find-the-difference-of-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 286 Problem 1"}, {"ID": 2216, "Title": "Minimum Deletions to Make Array Beautiful", "TitleCn": "\u7f8e\u5316\u6570\u7ec4\u7684\u6700\u5c11\u5220\u9664\u6570", "Url": "https://leetcode.cn/problems/minimum-deletions-to-make-array-beautiful/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 286 Problem 2"}, {"ID": 2217, "Title": "Find Palindrome With Fixed Length", "TitleCn": "\u627e\u5230\u6307\u5b9a\u957f\u5ea6\u7684\u56de\u6587\u6570", "Url": "https://leetcode.cn/problems/find-palindrome-with-fixed-length/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 286 Problem 3"}, {"ID": 2218, "Title": "Maximum Value of K Coins From Piles", "TitleCn": "\u4ece\u6808\u4e2d\u53d6\u51fa K \u4e2a\u786c\u5e01\u7684\u6700\u5927\u9762\u503c\u548c", "Url": "https://leetcode.cn/problems/maximum-value-of-k-coins-from-piles/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 286 Problem 4"}, {"ID": 2219, "Title": "Maximum Sum Score of Array", "TitleCn": "\u6570\u7ec4\u7684\u6700\u5927\u603b\u5206", "Url": "https://leetcode.cn/problems/maximum-sum-score-of-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2220, "Title": "Minimum Bit Flips to Convert Number", "TitleCn": "\u8f6c\u6362\u6570\u5b57\u7684\u6700\u5c11\u4f4d\u7ffb\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-bit-flips-to-convert-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 75 Problem 1"}, {"ID": 2221, "Title": "Find Triangular Sum of an Array", "TitleCn": "\u6570\u7ec4\u7684\u4e09\u89d2\u548c", "Url": "https://leetcode.cn/problems/find-triangular-sum-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 75 Problem 2"}, {"ID": 2222, "Title": "Number of Ways to Select Buildings", "TitleCn": "\u9009\u62e9\u5efa\u7b51\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-select-buildings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 75 Problem 3"}, {"ID": 2223, "Title": "Sum of Scores of Built Strings", "TitleCn": "\u6784\u9020\u5b57\u7b26\u4e32\u7684\u603b\u5f97\u5206\u548c", "Url": "https://leetcode.cn/problems/sum-of-scores-of-built-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 75 Problem 4"}, {"ID": 2224, "Title": "Minimum Number of Operations to Convert Time", "TitleCn": "\u8f6c\u5316\u65f6\u95f4\u9700\u8981\u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-convert-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 287 Problem 1"}, {"ID": 2225, "Title": "Find Players With Zero or One Losses", "TitleCn": "\u627e\u51fa\u8f93\u6389\u96f6\u573a\u6216\u4e00\u573a\u6bd4\u8d5b\u7684\u73a9\u5bb6", "Url": "https://leetcode.cn/problems/find-players-with-zero-or-one-losses/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 287 Problem 2"}, {"ID": 2226, "Title": "Maximum Candies Allocated to K Children", "TitleCn": "\u6bcf\u4e2a\u5c0f\u5b69\u6700\u591a\u80fd\u5206\u5230\u591a\u5c11\u7cd6\u679c", "Url": "https://leetcode.cn/problems/maximum-candies-allocated-to-k-children/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 287 Problem 3"}, {"ID": 2227, "Title": "Encrypt and Decrypt Strings", "TitleCn": "\u52a0\u5bc6\u89e3\u5bc6\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/encrypt-and-decrypt-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 287 Problem 4"}, {"ID": 2228, "Title": "Users With Two Purchases Within Seven Days", "TitleCn": "7 \u5929\u5185\u4e24\u6b21\u8d2d\u4e70\u7684\u7528\u6237", "Url": "https://leetcode.cn/problems/users-with-two-purchases-within-seven-days/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2229, "Title": "Check if an Array Is Consecutive", "TitleCn": "\u68c0\u67e5\u6570\u7ec4\u662f\u5426\u8fde\u8d2f", "Url": "https://leetcode.cn/problems/check-if-an-array-is-consecutive/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2230, "Title": "The Users That Are Eligible for Discount", "TitleCn": "\u67e5\u627e\u53ef\u4eab\u53d7\u4f18\u60e0\u7684\u7528\u6237", "Url": "https://leetcode.cn/problems/the-users-that-are-eligible-for-discount/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2231, "Title": "Largest Number After Digit Swaps by Parity", "TitleCn": "\u6309\u5947\u5076\u6027\u4ea4\u6362\u540e\u7684\u6700\u5927\u6570\u5b57", "Url": "https://leetcode.cn/problems/largest-number-after-digit-swaps-by-parity/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 288 Problem 1"}, {"ID": 2232, "Title": "Minimize Result by Adding Parentheses to Expression", "TitleCn": "\u5411\u8868\u8fbe\u5f0f\u6dfb\u52a0\u62ec\u53f7\u540e\u7684\u6700\u5c0f\u7ed3\u679c", "Url": "https://leetcode.cn/problems/minimize-result-by-adding-parentheses-to-expression/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 288 Problem 2"}, {"ID": 2233, "Title": "Maximum Product After K Increments", "TitleCn": "K \u6b21\u589e\u52a0\u540e\u7684\u6700\u5927\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-product-after-k-increments/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 288 Problem 3"}, {"ID": 2234, "Title": "Maximum Total Beauty of the Gardens", "TitleCn": "\u82b1\u56ed\u7684\u6700\u5927\u603b\u7f8e\u4e3d\u503c", "Url": "https://leetcode.cn/problems/maximum-total-beauty-of-the-gardens/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 288 Problem 4"}, {"ID": 2235, "Title": "Add Two Integers", "TitleCn": "\u4e24\u6574\u6570\u76f8\u52a0", "Url": "https://leetcode.cn/problems/add-two-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2236, "Title": "Root Equals Sum of Children", "TitleCn": "\u5224\u65ad\u6839\u7ed3\u70b9\u662f\u5426\u7b49\u4e8e\u5b50\u7ed3\u70b9\u4e4b\u548c", "Url": "https://leetcode.cn/problems/root-equals-sum-of-children/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2237, "Title": "Count Positions on Street With Required Brightness", "TitleCn": "\u8ba1\u7b97\u8857\u9053\u4e0a\u6ee1\u8db3\u6240\u9700\u4eae\u5ea6\u7684\u4f4d\u7f6e\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-positions-on-street-with-required-brightness/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2238, "Title": "Number of Times a Driver Was a Passenger", "TitleCn": "\u53f8\u673a\u6210\u4e3a\u4e58\u5ba2\u7684\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-times-a-driver-was-a-passenger/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2239, "Title": "Find Closest Number to Zero", "TitleCn": "\u627e\u5230\u6700\u63a5\u8fd1 0 \u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-closest-number-to-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 76 Problem 1"}, {"ID": 2240, "Title": "Number of Ways to Buy Pens and Pencils", "TitleCn": "\u4e70\u94a2\u7b14\u548c\u94c5\u7b14\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-buy-pens-and-pencils/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 76 Problem 2"}, {"ID": 2241, "Title": "Design an ATM Machine", "TitleCn": "\u8bbe\u8ba1\u4e00\u4e2a ATM \u673a\u5668", "Url": "https://leetcode.cn/problems/design-an-atm-machine/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 76 Problem 3"}, {"ID": 2242, "Title": "Maximum Score of a Node Sequence", "TitleCn": "\u8282\u70b9\u5e8f\u5217\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-score-of-a-node-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 76 Problem 4"}, {"ID": 2243, "Title": "Calculate Digit Sum of a String", "TitleCn": "\u8ba1\u7b97\u5b57\u7b26\u4e32\u7684\u6570\u5b57\u548c", "Url": "https://leetcode.cn/problems/calculate-digit-sum-of-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 289 Problem 1"}, {"ID": 2244, "Title": "Minimum Rounds to Complete All Tasks", "TitleCn": "\u5b8c\u6210\u6240\u6709\u4efb\u52a1\u9700\u8981\u7684\u6700\u5c11\u8f6e\u6570", "Url": "https://leetcode.cn/problems/minimum-rounds-to-complete-all-tasks/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 289 Problem 2"}, {"ID": 2245, "Title": "Maximum Trailing Zeros in a Cornered Path", "TitleCn": "\u8f6c\u89d2\u8def\u5f84\u7684\u4e58\u79ef\u4e2d\u6700\u591a\u80fd\u6709\u51e0\u4e2a\u5c3e\u968f\u96f6", "Url": "https://leetcode.cn/problems/maximum-trailing-zeros-in-a-cornered-path/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 289 Problem 3"}, {"ID": 2246, "Title": "Longest Path With Different Adjacent Characters", "TitleCn": "\u76f8\u90bb\u5b57\u7b26\u4e0d\u540c\u7684\u6700\u957f\u8def\u5f84", "Url": "https://leetcode.cn/problems/longest-path-with-different-adjacent-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 289 Problem 4"}, {"ID": 2247, "Title": "Maximum Cost of Trip With K Highways", "TitleCn": "K \u6761\u9ad8\u901f\u516c\u8def\u7684\u6700\u5927\u65c5\u884c\u8d39\u7528", "Url": "https://leetcode.cn/problems/maximum-cost-of-trip-with-k-highways/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2248, "Title": "Intersection of Multiple Arrays", "TitleCn": "\u591a\u4e2a\u6570\u7ec4\u6c42\u4ea4\u96c6", "Url": "https://leetcode.cn/problems/intersection-of-multiple-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 290 Problem 1"}, {"ID": 2249, "Title": "Count Lattice Points Inside a Circle", "TitleCn": "\u7edf\u8ba1\u5706\u5185\u683c\u70b9\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-lattice-points-inside-a-circle/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 290 Problem 2"}, {"ID": 2250, "Title": "Count Number of Rectangles Containing Each Point", "TitleCn": "\u7edf\u8ba1\u5305\u542b\u6bcf\u4e2a\u70b9\u7684\u77e9\u5f62\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-rectangles-containing-each-point/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 290 Problem 3"}, {"ID": 2251, "Title": "Number of Flowers in Full Bloom", "TitleCn": "\u82b1\u671f\u5185\u82b1\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-flowers-in-full-bloom/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 290 Problem 4"}, {"ID": 2252, "Title": "Dynamic Pivoting of a Table", "TitleCn": "\u8868\u7684\u52a8\u6001\u65cb\u8f6c", "Url": "https://leetcode.cn/problems/dynamic-pivoting-of-a-table/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2253, "Title": "Dynamic Unpivoting of a Table", "TitleCn": "\u52a8\u6001\u53d6\u6d88\u8868\u7684\u65cb\u8f6c", "Url": "https://leetcode.cn/problems/dynamic-unpivoting-of-a-table/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2254, "Title": "Design Video Sharing Platform", "TitleCn": "\u8bbe\u8ba1\u89c6\u9891\u5171\u4eab\u5e73\u53f0", "Url": "https://leetcode.cn/problems/design-video-sharing-platform/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2255, "Title": "Count Prefixes of a Given String", "TitleCn": "\u7edf\u8ba1\u662f\u7ed9\u5b9a\u5b57\u7b26\u4e32\u524d\u7f00\u7684\u5b57\u7b26\u4e32\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-prefixes-of-a-given-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 77 Problem 1"}, {"ID": 2256, "Title": "Minimum Average Difference", "TitleCn": "\u6700\u5c0f\u5e73\u5747\u5dee", "Url": "https://leetcode.cn/problems/minimum-average-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 77 Problem 2"}, {"ID": 2257, "Title": "Count Unguarded Cells in the Grid", "TitleCn": "\u7edf\u8ba1\u7f51\u683c\u56fe\u4e2d\u6ca1\u6709\u88ab\u4fdd\u536b\u7684\u683c\u5b50\u6570", "Url": "https://leetcode.cn/problems/count-unguarded-cells-in-the-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 77 Problem 3"}, {"ID": 2258, "Title": "Escape the Spreading Fire", "TitleCn": "\u9003\u79bb\u706b\u707e", "Url": "https://leetcode.cn/problems/escape-the-spreading-fire/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 77 Problem 4"}, {"ID": 2259, "Title": "Remove Digit From Number to Maximize Result", "TitleCn": "\u79fb\u9664\u6307\u5b9a\u6570\u5b57\u5f97\u5230\u7684\u6700\u5927\u7ed3\u679c", "Url": "https://leetcode.cn/problems/remove-digit-from-number-to-maximize-result/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 291 Problem 1"}, {"ID": 2260, "Title": "Minimum Consecutive Cards to Pick Up", "TitleCn": "\u5fc5\u987b\u62ff\u8d77\u7684\u6700\u5c0f\u8fde\u7eed\u5361\u724c\u6570", "Url": "https://leetcode.cn/problems/minimum-consecutive-cards-to-pick-up/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 291 Problem 2"}, {"ID": 2261, "Title": "K Divisible Elements Subarrays", "TitleCn": "\u542b\u6700\u591a K \u4e2a\u53ef\u6574\u9664\u5143\u7d20\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/k-divisible-elements-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 9, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 291 Problem 3"}, {"ID": 2262, "Title": "Total Appeal of A String", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u603b\u5f15\u529b", "Url": "https://leetcode.cn/problems/total-appeal-of-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 291 Problem 4"}, {"ID": 2263, "Title": "Make Array Non-decreasing or Non-increasing", "TitleCn": "\u6570\u7ec4\u53d8\u4e3a\u6709\u5e8f\u7684\u6700\u5c0f\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/make-array-non-decreasing-or-non-increasing/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2264, "Title": "Largest 3-Same-Digit Number in String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u6700\u5927\u7684 3 \u4f4d\u76f8\u540c\u6570\u5b57", "Url": "https://leetcode.cn/problems/largest-3-same-digit-number-in-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 292 Problem 1"}, {"ID": 2265, "Title": "Count Nodes Equal to Average of Subtree", "TitleCn": "\u7edf\u8ba1\u503c\u7b49\u4e8e\u5b50\u6811\u5e73\u5747\u503c\u7684\u8282\u70b9\u6570", "Url": "https://leetcode.cn/problems/count-nodes-equal-to-average-of-subtree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 292 Problem 2"}, {"ID": 2266, "Title": "Count Number of Texts", "TitleCn": "\u7edf\u8ba1\u6253\u5b57\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/count-number-of-texts/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 292 Problem 3"}, {"ID": 2267, "Title": "Check if There Is a Valid Parentheses String Path", "TitleCn": "\u68c0\u67e5\u662f\u5426\u6709\u5408\u6cd5\u62ec\u53f7\u5b57\u7b26\u4e32\u8def\u5f84", "Url": "https://leetcode.cn/problems/check-if-there-is-a-valid-parentheses-string-path/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 292 Problem 4"}, {"ID": 2268, "Title": "Minimum Number of Keypresses", "TitleCn": "\u6700\u5c11\u6309\u952e\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-keypresses/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2269, "Title": "Find the K-Beauty of a Number", "TitleCn": "\u627e\u5230\u4e00\u4e2a\u6570\u5b57\u7684 K \u7f8e\u4e3d\u503c", "Url": "https://leetcode.cn/problems/find-the-k-beauty-of-a-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 78 Problem 1"}, {"ID": 2270, "Title": "Number of Ways to Split Array", "TitleCn": "\u5206\u5272\u6570\u7ec4\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-split-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 78 Problem 2"}, {"ID": 2271, "Title": "Maximum White Tiles Covered by a Carpet", "TitleCn": "\u6bef\u5b50\u8986\u76d6\u7684\u6700\u591a\u767d\u8272\u7816\u5757\u6570", "Url": "https://leetcode.cn/problems/maximum-white-tiles-covered-by-a-carpet/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 78 Problem 3"}, {"ID": 2272, "Title": "Substring With Largest Variance", "TitleCn": "\u6700\u5927\u6ce2\u52a8\u7684\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/substring-with-largest-variance/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 78 Problem 4"}, {"ID": 2273, "Title": "Find Resultant Array After Removing Anagrams", "TitleCn": "\u79fb\u9664\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u540e\u7684\u7ed3\u679c\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-resultant-array-after-removing-anagrams/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 293 Problem 1"}, {"ID": 2274, "Title": "Maximum Consecutive Floors Without Special Floors", "TitleCn": "\u4e0d\u542b\u7279\u6b8a\u697c\u5c42\u7684\u6700\u5927\u8fde\u7eed\u697c\u5c42\u6570", "Url": "https://leetcode.cn/problems/maximum-consecutive-floors-without-special-floors/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 293 Problem 2"}, {"ID": 2275, "Title": "Largest Combination With Bitwise AND Greater Than Zero", "TitleCn": "\u6309\u4f4d\u4e0e\u7ed3\u679c\u5927\u4e8e\u96f6\u7684\u6700\u957f\u7ec4\u5408", "Url": "https://leetcode.cn/problems/largest-combination-with-bitwise-and-greater-than-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 293 Problem 3"}, {"ID": 2276, "Title": "Count Integers in Intervals", "TitleCn": "\u7edf\u8ba1\u533a\u95f4\u4e2d\u7684\u6574\u6570\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-integers-in-intervals/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 293 Problem 4"}, {"ID": 2277, "Title": "Closest Node to Path in Tree", "TitleCn": "\u6811\u4e2d\u6700\u63a5\u8fd1\u8def\u5f84\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/closest-node-to-path-in-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2278, "Title": "Percentage of Letter in String", "TitleCn": "\u5b57\u6bcd\u5728\u5b57\u7b26\u4e32\u4e2d\u7684\u767e\u5206\u6bd4", "Url": "https://leetcode.cn/problems/percentage-of-letter-in-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 294 Problem 1"}, {"ID": 2279, "Title": "Maximum Bags With Full Capacity of Rocks", "TitleCn": "\u88c5\u6ee1\u77f3\u5934\u7684\u80cc\u5305\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-bags-with-full-capacity-of-rocks/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 294 Problem 2"}, {"ID": 2280, "Title": "Minimum Lines to Represent a Line Chart", "TitleCn": "\u8868\u793a\u4e00\u4e2a\u6298\u7ebf\u56fe\u7684\u6700\u5c11\u7ebf\u6bb5\u6570", "Url": "https://leetcode.cn/problems/minimum-lines-to-represent-a-line-chart/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 294 Problem 3"}, {"ID": 2281, "Title": "Sum of Total Strength of Wizards", "TitleCn": "\u5deb\u5e08\u7684\u603b\u529b\u91cf\u548c", "Url": "https://leetcode.cn/problems/sum-of-total-strength-of-wizards/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 294 Problem 4"}, {"ID": 2282, "Title": "Number of People That Can Be Seen in a Grid", "TitleCn": "\u5728\u4e00\u4e2a\u7f51\u683c\u4e2d\u53ef\u4ee5\u770b\u5230\u7684\u4eba\u6570", "Url": "https://leetcode.cn/problems/number-of-people-that-can-be-seen-in-a-grid/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2283, "Title": "Check if Number Has Equal Digit Count and Digit Value", "TitleCn": "\u5224\u65ad\u4e00\u4e2a\u6570\u7684\u6570\u5b57\u8ba1\u6570\u662f\u5426\u7b49\u4e8e\u6570\u4f4d\u7684\u503c", "Url": "https://leetcode.cn/problems/check-if-number-has-equal-digit-count-and-digit-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 79 Problem 1"}, {"ID": 2284, "Title": "Sender With Largest Word Count", "TitleCn": "\u6700\u591a\u5355\u8bcd\u6570\u7684\u53d1\u4ef6\u4eba", "Url": "https://leetcode.cn/problems/sender-with-largest-word-count/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 79 Problem 2"}, {"ID": 2285, "Title": "Maximum Total Importance of Roads", "TitleCn": "\u9053\u8def\u7684\u6700\u5927\u603b\u91cd\u8981\u6027", "Url": "https://leetcode.cn/problems/maximum-total-importance-of-roads/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 79 Problem 3"}, {"ID": 2286, "Title": "Booking Concert Tickets in Groups", "TitleCn": "\u4ee5\u7ec4\u4e3a\u5355\u4f4d\u8ba2\u97f3\u4e50\u4f1a\u7684\u95e8\u7968", "Url": "https://leetcode.cn/problems/booking-concert-tickets-in-groups/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 79 Problem 4"}, {"ID": 2287, "Title": "Rearrange Characters to Make Target String", "TitleCn": "\u91cd\u6392\u5b57\u7b26\u5f62\u6210\u76ee\u6807\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/rearrange-characters-to-make-target-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 295 Problem 1"}, {"ID": 2288, "Title": "Apply Discount to Prices", "TitleCn": "\u4ef7\u683c\u51cf\u514d", "Url": "https://leetcode.cn/problems/apply-discount-to-prices/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 295 Problem 2"}, {"ID": 2289, "Title": "Steps to Make Array Non-decreasing", "TitleCn": "\u4f7f\u6570\u7ec4\u6309\u975e\u9012\u51cf\u987a\u5e8f\u6392\u5217", "Url": "https://leetcode.cn/problems/steps-to-make-array-non-decreasing/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 295 Problem 3"}, {"ID": 2290, "Title": "Minimum Obstacle Removal to Reach Corner", "TitleCn": "\u5230\u8fbe\u89d2\u843d\u9700\u8981\u79fb\u9664\u969c\u788d\u7269\u7684\u6700\u5c0f\u6570\u76ee", "Url": "https://leetcode.cn/problems/minimum-obstacle-removal-to-reach-corner/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 295 Problem 4"}, {"ID": 2291, "Title": "Maximum Profit From Trading Stocks", "TitleCn": "\u6700\u5927\u80a1\u7968\u6536\u76ca", "Url": "https://leetcode.cn/problems/maximum-profit-from-trading-stocks/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2292, "Title": "Products With Three or More Orders in Two Consecutive Years", "TitleCn": "\u8fde\u7eed\u4e24\u5e74\u6709 3 \u4e2a\u53ca\u4ee5\u4e0a\u8ba2\u5355\u7684\u4ea7\u54c1", "Url": "https://leetcode.cn/problems/products-with-three-or-more-orders-in-two-consecutive-years/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2293, "Title": "Min Max Game", "TitleCn": "\u6781\u5927\u6781\u5c0f\u6e38\u620f", "Url": "https://leetcode.cn/problems/min-max-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 296 Problem 1"}, {"ID": 2294, "Title": "Partition Array Such That Maximum Difference Is K", "TitleCn": "\u5212\u5206\u6570\u7ec4\u4f7f\u6700\u5927\u5dee\u4e3a K", "Url": "https://leetcode.cn/problems/partition-array-such-that-maximum-difference-is-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 296 Problem 2"}, {"ID": 2295, "Title": "Replace Elements in an Array", "TitleCn": "\u66ff\u6362\u6570\u7ec4\u4e2d\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/replace-elements-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 296 Problem 3"}, {"ID": 2296, "Title": "Design a Text Editor", "TitleCn": "\u8bbe\u8ba1\u4e00\u4e2a\u6587\u672c\u7f16\u8f91\u5668", "Url": "https://leetcode.cn/problems/design-a-text-editor/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 6, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 296 Problem 4"}, {"ID": 2297, "Title": "Jump Game VIII", "TitleCn": "\u8df3\u8dc3\u6e38\u620f VIII", "Url": "https://leetcode.cn/problems/jump-game-viii/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2298, "Title": "Tasks Count in the Weekend", "TitleCn": "\u5468\u672b\u4efb\u52a1\u8ba1\u6570", "Url": "https://leetcode.cn/problems/tasks-count-in-the-weekend/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2299, "Title": "Strong Password Checker II", "TitleCn": "\u5f3a\u5bc6\u7801\u68c0\u9a8c\u5668 II", "Url": "https://leetcode.cn/problems/strong-password-checker-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 80 Problem 1"}, {"ID": 2300, "Title": "Successful Pairs of Spells and Potions", "TitleCn": "\u5492\u8bed\u548c\u836f\u6c34\u7684\u6210\u529f\u5bf9\u6570", "Url": "https://leetcode.cn/problems/successful-pairs-of-spells-and-potions/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 80 Problem 2"}, {"ID": 2301, "Title": "Match Substring After Replacement", "TitleCn": "\u66ff\u6362\u5b57\u7b26\u540e\u5339\u914d", "Url": "https://leetcode.cn/problems/match-substring-after-replacement/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 80 Problem 3"}, {"ID": 2302, "Title": "Count Subarrays With Score Less Than K", "TitleCn": "\u7edf\u8ba1\u5f97\u5206\u5c0f\u4e8e K \u7684\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-subarrays-with-score-less-than-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 80 Problem 4"}, {"ID": 2303, "Title": "Calculate Amount Paid in Taxes", "TitleCn": "\u8ba1\u7b97\u5e94\u7f34\u7a0e\u6b3e\u603b\u989d", "Url": "https://leetcode.cn/problems/calculate-amount-paid-in-taxes/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 297 Problem 1"}, {"ID": 2304, "Title": "Minimum Path Cost in a Grid", "TitleCn": "\u7f51\u683c\u4e2d\u7684\u6700\u5c0f\u8def\u5f84\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-path-cost-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 297 Problem 2"}, {"ID": 2305, "Title": "Fair Distribution of Cookies", "TitleCn": "\u516c\u5e73\u5206\u53d1\u997c\u5e72", "Url": "https://leetcode.cn/problems/fair-distribution-of-cookies/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 297 Problem 3"}, {"ID": 2306, "Title": "Naming a Company", "TitleCn": "\u516c\u53f8\u547d\u540d", "Url": "https://leetcode.cn/problems/naming-a-company/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 297 Problem 4"}, {"ID": 2307, "Title": "Check for Contradictions in Equations", "TitleCn": "\u68c0\u67e5\u65b9\u7a0b\u4e2d\u7684\u77db\u76fe\u4e4b\u5904", "Url": "https://leetcode.cn/problems/check-for-contradictions-in-equations/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2308, "Title": "Arrange Table by Gender", "TitleCn": "\u6309\u6027\u522b\u6392\u5217\u8868\u683c", "Url": "https://leetcode.cn/problems/arrange-table-by-gender/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2309, "Title": "Greatest English Letter in Upper and Lower Case", "TitleCn": "\u517c\u5177\u5927\u5c0f\u5199\u7684\u6700\u597d\u82f1\u6587\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/greatest-english-letter-in-upper-and-lower-case/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 298 Problem 1"}, {"ID": 2310, "Title": "Sum of Numbers With Units Digit K", "TitleCn": "\u4e2a\u4f4d\u6570\u5b57\u4e3a K \u7684\u6574\u6570\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-numbers-with-units-digit-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 298 Problem 2"}, {"ID": 2311, "Title": "Longest Binary Subsequence Less Than or Equal to K", "TitleCn": "\u5c0f\u4e8e\u7b49\u4e8e K \u7684\u6700\u957f\u4e8c\u8fdb\u5236\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-binary-subsequence-less-than-or-equal-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 298 Problem 3"}, {"ID": 2312, "Title": "Selling Pieces of Wood", "TitleCn": "\u5356\u6728\u5934\u5757", "Url": "https://leetcode.cn/problems/selling-pieces-of-wood/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 298 Problem 4"}, {"ID": 2313, "Title": "Minimum Flips in Binary Tree to Get Result", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u5f97\u5230\u7ed3\u679c\u6240\u9700\u7684\u6700\u5c11\u7ffb\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-flips-in-binary-tree-to-get-result/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2314, "Title": "The First Day of the Maximum Recorded Degree in Each City", "TitleCn": "\u6bcf\u4e2a\u57ce\u5e02\u6700\u9ad8\u6c14\u6e29\u7684\u7b2c\u4e00\u5929", "Url": "https://leetcode.cn/problems/the-first-day-of-the-maximum-recorded-degree-in-each-city/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2315, "Title": "Count Asterisks", "TitleCn": "\u7edf\u8ba1\u661f\u53f7", "Url": "https://leetcode.cn/problems/count-asterisks/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 81 Problem 1"}, {"ID": 2316, "Title": "Count Unreachable Pairs of Nodes in an Undirected Graph", "TitleCn": "\u7edf\u8ba1\u65e0\u5411\u56fe\u4e2d\u65e0\u6cd5\u4e92\u76f8\u5230\u8fbe\u70b9\u5bf9\u6570", "Url": "https://leetcode.cn/problems/count-unreachable-pairs-of-nodes-in-an-undirected-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 81 Problem 2"}, {"ID": 2317, "Title": "Maximum XOR After Operations", "TitleCn": "\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5f02\u6216\u548c", "Url": "https://leetcode.cn/problems/maximum-xor-after-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 81 Problem 3"}, {"ID": 2318, "Title": "Number of Distinct Roll Sequences", "TitleCn": "\u4e0d\u540c\u9ab0\u5b50\u5e8f\u5217\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-distinct-roll-sequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 81 Problem 4"}, {"ID": 2319, "Title": "Check if Matrix Is X-Matrix", "TitleCn": "\u5224\u65ad\u77e9\u9635\u662f\u5426\u662f\u4e00\u4e2a X \u77e9\u9635", "Url": "https://leetcode.cn/problems/check-if-matrix-is-x-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 299 Problem 1"}, {"ID": 2320, "Title": "Count Number of Ways to Place Houses", "TitleCn": "\u7edf\u8ba1\u653e\u7f6e\u623f\u5b50\u7684\u65b9\u5f0f\u6570", "Url": "https://leetcode.cn/problems/count-number-of-ways-to-place-houses/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 299 Problem 2"}, {"ID": 2321, "Title": "Maximum Score Of Spliced Array", "TitleCn": "\u62fc\u63a5\u6570\u7ec4\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-score-of-spliced-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 299 Problem 3"}, {"ID": 2322, "Title": "Minimum Score After Removals on a Tree", "TitleCn": "\u4ece\u6811\u4e2d\u5220\u9664\u8fb9\u7684\u6700\u5c0f\u5206\u6570", "Url": "https://leetcode.cn/problems/minimum-score-after-removals-on-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 299 Problem 4"}, {"ID": 2323, "Title": "Find Minimum Time to Finish All Jobs II", "TitleCn": "\u5b8c\u6210\u6240\u6709\u5de5\u4f5c\u7684\u6700\u77ed\u65f6\u95f4 II", "Url": "https://leetcode.cn/problems/find-minimum-time-to-finish-all-jobs-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2324, "Title": "Product Sales Analysis IV", "TitleCn": "\u4ea7\u54c1\u9500\u552e\u5206\u6790 IV", "Url": "https://leetcode.cn/problems/product-sales-analysis-iv/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2325, "Title": "Decode the Message", "TitleCn": "\u89e3\u5bc6\u6d88\u606f", "Url": "https://leetcode.cn/problems/decode-the-message/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 300 Problem 1"}, {"ID": 2326, "Title": "Spiral Matrix IV", "TitleCn": "\u87ba\u65cb\u77e9\u9635 IV", "Url": "https://leetcode.cn/problems/spiral-matrix-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 300 Problem 2"}, {"ID": 2327, "Title": "Number of People Aware of a Secret", "TitleCn": "\u77e5\u9053\u79d8\u5bc6\u7684\u4eba\u6570", "Url": "https://leetcode.cn/problems/number-of-people-aware-of-a-secret/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 300 Problem 3"}, {"ID": 2328, "Title": "Number of Increasing Paths in a Grid", "TitleCn": "\u7f51\u683c\u56fe\u4e2d\u9012\u589e\u8def\u5f84\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-increasing-paths-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 300 Problem 4"}, {"ID": 2329, "Title": "Product Sales Analysis V", "TitleCn": "\u4ea7\u54c1\u9500\u552e\u5206\u6790\u2164", "Url": "https://leetcode.cn/problems/product-sales-analysis-v/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2330, "Title": "Valid Palindrome IV", "TitleCn": "\u9a8c\u8bc1\u56de\u6587\u4e32 IV", "Url": "https://leetcode.cn/problems/valid-palindrome-iv/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2331, "Title": "Evaluate Boolean Binary Tree", "TitleCn": "\u8ba1\u7b97\u5e03\u5c14\u4e8c\u53c9\u6811\u7684\u503c", "Url": "https://leetcode.cn/problems/evaluate-boolean-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 82 Problem 1"}, {"ID": 2332, "Title": "The Latest Time to Catch a Bus", "TitleCn": "\u5750\u4e0a\u516c\u4ea4\u7684\u6700\u665a\u65f6\u95f4", "Url": "https://leetcode.cn/problems/the-latest-time-to-catch-a-bus/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 82 Problem 2"}, {"ID": 2333, "Title": "Minimum Sum of Squared Difference", "TitleCn": "\u6700\u5c0f\u5dee\u503c\u5e73\u65b9\u548c", "Url": "https://leetcode.cn/problems/minimum-sum-of-squared-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 82 Problem 3"}, {"ID": 2334, "Title": "Subarray With Elements Greater Than Varying Threshold", "TitleCn": "\u5143\u7d20\u503c\u5927\u4e8e\u53d8\u5316\u9608\u503c\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/subarray-with-elements-greater-than-varying-threshold/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 82 Problem 4"}, {"ID": 2335, "Title": "Minimum Amount of Time to Fill Cups", "TitleCn": "\u88c5\u6ee1\u676f\u5b50\u9700\u8981\u7684\u6700\u77ed\u603b\u65f6\u957f", "Url": "https://leetcode.cn/problems/minimum-amount-of-time-to-fill-cups/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 301 Problem 1"}, {"ID": 2336, "Title": "Smallest Number in Infinite Set", "TitleCn": "\u65e0\u9650\u96c6\u4e2d\u7684\u6700\u5c0f\u6570\u5b57", "Url": "https://leetcode.cn/problems/smallest-number-in-infinite-set/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 301 Problem 2"}, {"ID": 2337, "Title": "Move Pieces to Obtain a String", "TitleCn": "\u79fb\u52a8\u7247\u6bb5\u5f97\u5230\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/move-pieces-to-obtain-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 301 Problem 3"}, {"ID": 2338, "Title": "Count the Number of Ideal Arrays", "TitleCn": "\u7edf\u8ba1\u7406\u60f3\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-ideal-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 301 Problem 4"}, {"ID": 2339, "Title": "All the Matches of the League", "TitleCn": "\u8054\u8d5b\u7684\u6240\u6709\u6bd4\u8d5b", "Url": "https://leetcode.cn/problems/all-the-matches-of-the-league/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2340, "Title": "Minimum Adjacent Swaps to Make a Valid Array", "TitleCn": "\u751f\u6210\u6709\u6548\u6570\u7ec4\u7684\u6700\u5c11\u4ea4\u6362\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-adjacent-swaps-to-make-a-valid-array/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2341, "Title": "Maximum Number of Pairs in Array", "TitleCn": "\u6570\u7ec4\u80fd\u5f62\u6210\u591a\u5c11\u6570\u5bf9", "Url": "https://leetcode.cn/problems/maximum-number-of-pairs-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 302 Problem 1"}, {"ID": 2342, "Title": "Max Sum of a Pair With Equal Sum of Digits", "TitleCn": "\u6570\u4f4d\u548c\u76f8\u7b49\u6570\u5bf9\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/max-sum-of-a-pair-with-equal-sum-of-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 302 Problem 2"}, {"ID": 2343, "Title": "Query Kth Smallest Trimmed Number", "TitleCn": "\u88c1\u526a\u6570\u5b57\u540e\u67e5\u8be2\u7b2c K \u5c0f\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/query-kth-smallest-trimmed-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 8, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 302 Problem 3"}, {"ID": 2344, "Title": "Minimum Deletions to Make Array Divisible", "TitleCn": "\u4f7f\u6570\u7ec4\u53ef\u4ee5\u88ab\u6574\u9664\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-deletions-to-make-array-divisible/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 302 Problem 4"}, {"ID": 2345, "Title": "Finding the Number of Visible Mountains", "TitleCn": "\u5bfb\u627e\u53ef\u89c1\u5c71\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/finding-the-number-of-visible-mountains/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2346, "Title": "Compute the Rank as a Percentage", "TitleCn": "\u4ee5\u767e\u5206\u6bd4\u8ba1\u7b97\u6392\u540d", "Url": "https://leetcode.cn/problems/compute-the-rank-as-a-percentage/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2347, "Title": "Best Poker Hand", "TitleCn": "\u6700\u597d\u7684\u6251\u514b\u624b\u724c", "Url": "https://leetcode.cn/problems/best-poker-hand/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 83 Problem 1"}, {"ID": 2348, "Title": "Number of Zero-Filled Subarrays", "TitleCn": "\u5168 0 \u5b50\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-zero-filled-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 83 Problem 2"}, {"ID": 2349, "Title": "Design a Number Container System", "TitleCn": "\u8bbe\u8ba1\u6570\u5b57\u5bb9\u5668\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-a-number-container-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 83 Problem 3"}, {"ID": 2350, "Title": "Shortest Impossible Sequence of Rolls", "TitleCn": "\u4e0d\u53ef\u80fd\u5f97\u5230\u7684\u6700\u77ed\u9ab0\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/shortest-impossible-sequence-of-rolls/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 83 Problem 4"}, {"ID": 2351, "Title": "First Letter to Appear Twice", "TitleCn": "\u7b2c\u4e00\u4e2a\u51fa\u73b0\u4e24\u6b21\u7684\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/first-letter-to-appear-twice/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 303 Problem 1"}, {"ID": 2352, "Title": "Equal Row and Column Pairs", "TitleCn": "\u76f8\u7b49\u884c\u5217\u5bf9", "Url": "https://leetcode.cn/problems/equal-row-and-column-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 303 Problem 2"}, {"ID": 2353, "Title": "Design a Food Rating System", "TitleCn": "\u8bbe\u8ba1\u98df\u7269\u8bc4\u5206\u7cfb\u7edf", "Url": "https://leetcode.cn/problems/design-a-food-rating-system/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 303 Problem 3"}, {"ID": 2354, "Title": "Number of Excellent Pairs", "TitleCn": "\u4f18\u8d28\u6570\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-excellent-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 303 Problem 4"}, {"ID": 2355, "Title": "Maximum Number of Books You Can Take", "TitleCn": "\u4f60\u80fd\u62ff\u8d70\u7684\u6700\u5927\u56fe\u4e66\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-books-you-can-take/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2356, "Title": "Number of Unique Subjects Taught by Each Teacher", "TitleCn": "\u6bcf\u4f4d\u6559\u5e08\u6240\u6559\u6388\u7684\u79d1\u76ee\u79cd\u7c7b\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-unique-subjects-taught-by-each-teacher/", "Ispaid": 0, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2357, "Title": "Make Array Zero by Subtracting Equal Amounts", "TitleCn": "\u4f7f\u6570\u7ec4\u4e2d\u6240\u6709\u5143\u7d20\u90fd\u7b49\u4e8e\u96f6", "Url": "https://leetcode.cn/problems/make-array-zero-by-subtracting-equal-amounts/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 304 Problem 1"}, {"ID": 2358, "Title": "Maximum Number of Groups Entering a Competition", "TitleCn": "\u5206\u7ec4\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-groups-entering-a-competition/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 304 Problem 2"}, {"ID": 2359, "Title": "Find Closest Node to Given Two Nodes", "TitleCn": "\u627e\u5230\u79bb\u7ed9\u5b9a\u4e24\u4e2a\u8282\u70b9\u6700\u8fd1\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-closest-node-to-given-two-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 304 Problem 3"}, {"ID": 2360, "Title": "Longest Cycle in a Graph", "TitleCn": "\u56fe\u4e2d\u7684\u6700\u957f\u73af", "Url": "https://leetcode.cn/problems/longest-cycle-in-a-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 304 Problem 4"}, {"ID": 2361, "Title": "Minimum Costs Using the Train Line", "TitleCn": "\u4e58\u5750\u706b\u8f66\u8def\u7ebf\u7684\u6700\u5c11\u8d39\u7528", "Url": "https://leetcode.cn/problems/minimum-costs-using-the-train-line/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2362, "Title": "Generate the Invoice", "TitleCn": "\u751f\u6210\u53d1\u7968", "Url": "https://leetcode.cn/problems/generate-the-invoice/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2363, "Title": "Merge Similar Items", "TitleCn": "\u5408\u5e76\u76f8\u4f3c\u7684\u7269\u54c1", "Url": "https://leetcode.cn/problems/merge-similar-items/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 84 Problem 1"}, {"ID": 2364, "Title": "Count Number of Bad Pairs", "TitleCn": "\u7edf\u8ba1\u574f\u6570\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-bad-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 84 Problem 2"}, {"ID": 2365, "Title": "Task Scheduler II", "TitleCn": "\u4efb\u52a1\u8c03\u5ea6\u5668 II", "Url": "https://leetcode.cn/problems/task-scheduler-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 84 Problem 3"}, {"ID": 2366, "Title": "Minimum Replacements to Sort the Array", "TitleCn": "\u5c06\u6570\u7ec4\u6392\u5e8f\u7684\u6700\u5c11\u66ff\u6362\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-replacements-to-sort-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 84 Problem 4"}, {"ID": 2367, "Title": "Number of Arithmetic Triplets", "TitleCn": "\u7b97\u672f\u4e09\u5143\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-arithmetic-triplets/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 305 Problem 1"}, {"ID": 2368, "Title": "Reachable Nodes With Restrictions", "TitleCn": "\u53d7\u9650\u6761\u4ef6\u4e0b\u53ef\u5230\u8fbe\u8282\u70b9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/reachable-nodes-with-restrictions/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 305 Problem 2"}, {"ID": 2369, "Title": "Check if There is a Valid Partition For The Array", "TitleCn": "\u68c0\u67e5\u6570\u7ec4\u662f\u5426\u5b58\u5728\u6709\u6548\u5212\u5206", "Url": "https://leetcode.cn/problems/check-if-there-is-a-valid-partition-for-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 305 Problem 3"}, {"ID": 2370, "Title": "Longest Ideal Subsequence", "TitleCn": "\u6700\u957f\u7406\u60f3\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-ideal-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 305 Problem 4"}, {"ID": 2371, "Title": "Minimize Maximum Value in a Grid", "TitleCn": "\u6700\u5c0f\u5316\u7f51\u683c\u4e2d\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/minimize-maximum-value-in-a-grid/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2372, "Title": "Calculate the Influence of Each Salesperson", "TitleCn": "\u8ba1\u7b97\u6bcf\u4e2a\u9500\u552e\u4eba\u5458\u7684\u5f71\u54cd\u529b", "Url": "https://leetcode.cn/problems/calculate-the-influence-of-each-salesperson/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2373, "Title": "Largest Local Values in a Matrix", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u5c40\u90e8\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/largest-local-values-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 306 Problem 1"}, {"ID": 2374, "Title": "Node With Highest Edge Score", "TitleCn": "\u8fb9\u79ef\u5206\u6700\u9ad8\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/node-with-highest-edge-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 306 Problem 2"}, {"ID": 2375, "Title": "Construct Smallest Number From DI String", "TitleCn": "\u6839\u636e\u6a21\u5f0f\u4e32\u6784\u9020\u6700\u5c0f\u6570\u5b57", "Url": "https://leetcode.cn/problems/construct-smallest-number-from-di-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 306 Problem 3"}, {"ID": 2376, "Title": "Count Special Integers", "TitleCn": "\u7edf\u8ba1\u7279\u6b8a\u6574\u6570", "Url": "https://leetcode.cn/problems/count-special-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 306 Problem 4"}, {"ID": 2377, "Title": "Sort the Olympic Table", "TitleCn": "\u6574\u7406\u5965\u8fd0\u8868", "Url": "https://leetcode.cn/problems/sort-the-olympic-table/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2378, "Title": "Choose Edges to Maximize Score in a Tree", "TitleCn": "\u9009\u62e9\u8fb9\u6765\u6700\u5927\u5316\u6811\u7684\u5f97\u5206", "Url": "https://leetcode.cn/problems/choose-edges-to-maximize-score-in-a-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2379, "Title": "Minimum Recolors to Get K Consecutive Black Blocks", "TitleCn": "\u5f97\u5230 K \u4e2a\u9ed1\u5757\u7684\u6700\u5c11\u6d82\u8272\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-recolors-to-get-k-consecutive-black-blocks/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 85 Problem 1"}, {"ID": 2380, "Title": "Time Needed to Rearrange a Binary String", "TitleCn": "\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u91cd\u65b0\u5b89\u6392\u987a\u5e8f\u9700\u8981\u7684\u65f6\u95f4", "Url": "https://leetcode.cn/problems/time-needed-to-rearrange-a-binary-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 9, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 85 Problem 2"}, {"ID": 2381, "Title": "Shifting Letters II", "TitleCn": "\u5b57\u6bcd\u79fb\u4f4d II", "Url": "https://leetcode.cn/problems/shifting-letters-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 85 Problem 3"}, {"ID": 2382, "Title": "Maximum Segment Sum After Removals", "TitleCn": "\u5220\u9664\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5b50\u6bb5\u548c", "Url": "https://leetcode.cn/problems/maximum-segment-sum-after-removals/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 85 Problem 4"}, {"ID": 2383, "Title": "Minimum Hours of Training to Win a Competition", "TitleCn": "\u8d62\u5f97\u6bd4\u8d5b\u9700\u8981\u7684\u6700\u5c11\u8bad\u7ec3\u65f6\u957f", "Url": "https://leetcode.cn/problems/minimum-hours-of-training-to-win-a-competition/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 307 Problem 1"}, {"ID": 2384, "Title": "Largest Palindromic Number", "TitleCn": "\u6700\u5927\u56de\u6587\u6570\u5b57", "Url": "https://leetcode.cn/problems/largest-palindromic-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 307 Problem 2"}, {"ID": 2385, "Title": "Amount of Time for Binary Tree to Be Infected", "TitleCn": "\u611f\u67d3\u4e8c\u53c9\u6811\u9700\u8981\u7684\u603b\u65f6\u95f4", "Url": "https://leetcode.cn/problems/amount-of-time-for-binary-tree-to-be-infected/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 307 Problem 3"}, {"ID": 2386, "Title": "Find the K-Sum of an Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u7684\u7b2c K \u5927\u548c", "Url": "https://leetcode.cn/problems/find-the-k-sum-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 307 Problem 4"}, {"ID": 2387, "Title": "Median of a Row Wise Sorted Matrix", "TitleCn": "\u884c\u6392\u5e8f\u77e9\u9635\u7684\u4e2d\u4f4d\u6570", "Url": "https://leetcode.cn/problems/median-of-a-row-wise-sorted-matrix/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2388, "Title": "Change Null Values in a Table to the Previous Value", "TitleCn": "\u5c06\u8868\u4e2d\u7684\u7a7a\u503c\u66f4\u6539\u4e3a\u524d\u4e00\u4e2a\u503c", "Url": "https://leetcode.cn/problems/change-null-values-in-a-table-to-the-previous-value/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2389, "Title": "Longest Subsequence With Limited Sum", "TitleCn": "\u548c\u6709\u9650\u7684\u6700\u957f\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/longest-subsequence-with-limited-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 308 Problem 1"}, {"ID": 2390, "Title": "Removing Stars From a String", "TitleCn": "\u4ece\u5b57\u7b26\u4e32\u4e2d\u79fb\u9664\u661f\u53f7", "Url": "https://leetcode.cn/problems/removing-stars-from-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 308 Problem 2"}, {"ID": 2391, "Title": "Minimum Amount of Time to Collect Garbage", "TitleCn": "\u6536\u96c6\u5783\u573e\u7684\u6700\u5c11\u603b\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-amount-of-time-to-collect-garbage/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 308 Problem 3"}, {"ID": 2392, "Title": "Build a Matrix With Conditions", "TitleCn": "\u7ed9\u5b9a\u6761\u4ef6\u4e0b\u6784\u9020\u77e9\u9635", "Url": "https://leetcode.cn/problems/build-a-matrix-with-conditions/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 308 Problem 4"}, {"ID": 2393, "Title": "Count Strictly Increasing Subarrays", "TitleCn": "\u4e25\u683c\u9012\u589e\u7684\u5b50\u6570\u7ec4\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-strictly-increasing-subarrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2394, "Title": "Employees With Deductions", "TitleCn": "\u5f00\u9664\u5458\u5de5", "Url": "https://leetcode.cn/problems/employees-with-deductions/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2395, "Title": "Find Subarrays With Equal Sum", "TitleCn": "\u548c\u76f8\u7b49\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-subarrays-with-equal-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 86 Problem 1"}, {"ID": 2396, "Title": "Strictly Palindromic Number", "TitleCn": "\u4e25\u683c\u56de\u6587\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/strictly-palindromic-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 86 Problem 2"}, {"ID": 2397, "Title": "Maximum Rows Covered by Columns", "TitleCn": "\u88ab\u5217\u8986\u76d6\u7684\u6700\u591a\u884c\u6570", "Url": "https://leetcode.cn/problems/maximum-rows-covered-by-columns/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 86 Problem 3"}, {"ID": 2398, "Title": "Maximum Number of Robots Within Budget", "TitleCn": "\u9884\u7b97\u5185\u7684\u6700\u591a\u673a\u5668\u4eba\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-robots-within-budget/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 86 Problem 4"}, {"ID": 2399, "Title": "Check Distances Between Same Letters", "TitleCn": "\u68c0\u67e5\u76f8\u540c\u5b57\u6bcd\u95f4\u7684\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/check-distances-between-same-letters/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 309 Problem 1"}, {"ID": 2400, "Title": "Number of Ways to Reach a Position After Exactly k Steps", "TitleCn": "\u6070\u597d\u79fb\u52a8 k \u6b65\u5230\u8fbe\u67d0\u4e00\u4f4d\u7f6e\u7684\u65b9\u6cd5\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-ways-to-reach-a-position-after-exactly-k-steps/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 309 Problem 2"}, {"ID": 2401, "Title": "Longest Nice Subarray", "TitleCn": "\u6700\u957f\u4f18\u96c5\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-nice-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 309 Problem 3"}, {"ID": 2402, "Title": "Meeting Rooms III", "TitleCn": "\u4f1a\u8bae\u5ba4 III", "Url": "https://leetcode.cn/problems/meeting-rooms-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 309 Problem 4"}, {"ID": 2403, "Title": "Minimum Time to Kill All Monsters", "TitleCn": "\u6740\u6b7b\u6240\u6709\u602a\u7269\u7684\u6700\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-kill-all-monsters/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2404, "Title": "Most Frequent Even Element", "TitleCn": "\u51fa\u73b0\u6700\u9891\u7e41\u7684\u5076\u6570\u5143\u7d20", "Url": "https://leetcode.cn/problems/most-frequent-even-element/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 310 Problem 1"}, {"ID": 2405, "Title": "Optimal Partition of String", "TitleCn": "\u5b50\u5b57\u7b26\u4e32\u7684\u6700\u4f18\u5212\u5206", "Url": "https://leetcode.cn/problems/optimal-partition-of-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 310 Problem 2"}, {"ID": 2406, "Title": "Divide Intervals Into Minimum Number of Groups", "TitleCn": "\u5c06\u533a\u95f4\u5206\u4e3a\u6700\u5c11\u7ec4\u6570", "Url": "https://leetcode.cn/problems/divide-intervals-into-minimum-number-of-groups/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 310 Problem 3"}, {"ID": 2407, "Title": "Longest Increasing Subsequence II", "TitleCn": "\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217 II", "Url": "https://leetcode.cn/problems/longest-increasing-subsequence-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 310 Problem 4"}, {"ID": 2408, "Title": "Design SQL", "TitleCn": "\u8bbe\u8ba1 SQL", "Url": "https://leetcode.cn/problems/design-sql/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2409, "Title": "Count Days Spent Together", "TitleCn": "\u7edf\u8ba1\u5171\u540c\u5ea6\u8fc7\u7684\u65e5\u5b50\u6570", "Url": "https://leetcode.cn/problems/count-days-spent-together/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 87 Problem 1"}, {"ID": 2410, "Title": "Maximum Matching of Players With Trainers", "TitleCn": "\u8fd0\u52a8\u5458\u548c\u8bad\u7ec3\u5e08\u7684\u6700\u5927\u5339\u914d\u6570", "Url": "https://leetcode.cn/problems/maximum-matching-of-players-with-trainers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 87 Problem 2"}, {"ID": 2411, "Title": "Smallest Subarrays With Maximum Bitwise OR", "TitleCn": "\u6309\u4f4d\u6216\u6700\u5927\u7684\u6700\u5c0f\u5b50\u6570\u7ec4\u957f\u5ea6", "Url": "https://leetcode.cn/problems/smallest-subarrays-with-maximum-bitwise-or/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 87 Problem 3"}, {"ID": 2412, "Title": "Minimum Money Required Before Transactions", "TitleCn": "\u5b8c\u6210\u6240\u6709\u4ea4\u6613\u7684\u521d\u59cb\u6700\u5c11\u94b1\u6570", "Url": "https://leetcode.cn/problems/minimum-money-required-before-transactions/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 87 Problem 4"}, {"ID": 2413, "Title": "Smallest Even Multiple", "TitleCn": "\u6700\u5c0f\u5076\u500d\u6570", "Url": "https://leetcode.cn/problems/smallest-even-multiple/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 311 Problem 1"}, {"ID": 2414, "Title": "Length of the Longest Alphabetical Continuous Substring", "TitleCn": "\u6700\u957f\u7684\u5b57\u6bcd\u5e8f\u8fde\u7eed\u5b50\u5b57\u7b26\u4e32\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/length-of-the-longest-alphabetical-continuous-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 311 Problem 2"}, {"ID": 2415, "Title": "Reverse Odd Levels of Binary Tree", "TitleCn": "\u53cd\u8f6c\u4e8c\u53c9\u6811\u7684\u5947\u6570\u5c42", "Url": "https://leetcode.cn/problems/reverse-odd-levels-of-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 311 Problem 3"}, {"ID": 2416, "Title": "Sum of Prefix Scores of Strings", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u524d\u7f00\u5206\u6570\u548c", "Url": "https://leetcode.cn/problems/sum-of-prefix-scores-of-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 311 Problem 4"}, {"ID": 2417, "Title": "Closest Fair Integer", "TitleCn": "\u6700\u8fd1\u7684\u516c\u5e73\u6574\u6570", "Url": "https://leetcode.cn/problems/closest-fair-integer/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2418, "Title": "Sort the People", "TitleCn": "\u6309\u8eab\u9ad8\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-the-people/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 312 Problem 1"}, {"ID": 2419, "Title": "Longest Subarray With Maximum Bitwise AND", "TitleCn": "\u6309\u4f4d\u4e0e\u6700\u5927\u7684\u6700\u957f\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-subarray-with-maximum-bitwise-and/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 312 Problem 2"}, {"ID": 2420, "Title": "Find All Good Indices", "TitleCn": "\u627e\u5230\u6240\u6709\u597d\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-all-good-indices/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 312 Problem 3"}, {"ID": 2421, "Title": "Number of Good Paths", "TitleCn": "\u597d\u8def\u5f84\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-good-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 312 Problem 4"}, {"ID": 2422, "Title": "Merge Operations to Turn Array Into a Palindrome", "TitleCn": "\u4f7f\u7528\u5408\u5e76\u64cd\u4f5c\u5c06\u6570\u7ec4\u8f6c\u6362\u4e3a\u56de\u6587\u5e8f\u5217", "Url": "https://leetcode.cn/problems/merge-operations-to-turn-array-into-a-palindrome/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2423, "Title": "Remove Letter To Equalize Frequency", "TitleCn": "\u5220\u9664\u5b57\u7b26\u4f7f\u9891\u7387\u76f8\u540c", "Url": "https://leetcode.cn/problems/remove-letter-to-equalize-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 88 Problem 1"}, {"ID": 2424, "Title": "Longest Uploaded Prefix", "TitleCn": "\u6700\u957f\u4e0a\u4f20\u524d\u7f00", "Url": "https://leetcode.cn/problems/longest-uploaded-prefix/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 88 Problem 2"}, {"ID": 2425, "Title": "Bitwise XOR of All Pairings", "TitleCn": "\u6240\u6709\u6570\u5bf9\u7684\u5f02\u6216\u548c", "Url": "https://leetcode.cn/problems/bitwise-xor-of-all-pairings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 88 Problem 3"}, {"ID": 2426, "Title": "Number of Pairs Satisfying Inequality", "TitleCn": "\u6ee1\u8db3\u4e0d\u7b49\u5f0f\u7684\u6570\u5bf9\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-pairs-satisfying-inequality/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 88 Problem 4"}, {"ID": 2427, "Title": "Number of Common Factors", "TitleCn": "\u516c\u56e0\u5b50\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-common-factors/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 313 Problem 1"}, {"ID": 2428, "Title": "Maximum Sum of an Hourglass", "TitleCn": "\u6c99\u6f0f\u7684\u6700\u5927\u603b\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-of-an-hourglass/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 313 Problem 2"}, {"ID": 2429, "Title": "Minimize XOR", "TitleCn": "\u6700\u5c0f\u5f02\u6216", "Url": "https://leetcode.cn/problems/minimize-xor/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 313 Problem 3"}, {"ID": 2430, "Title": "Maximum Deletions on a String", "TitleCn": "\u5bf9\u5b57\u6bcd\u4e32\u53ef\u6267\u884c\u7684\u6700\u5927\u5220\u9664\u6570", "Url": "https://leetcode.cn/problems/maximum-deletions-on-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 313 Problem 4"}, {"ID": 2431, "Title": "Maximize Total Tastiness of Purchased Fruits", "TitleCn": "\u6700\u5927\u9650\u5ea6\u5730\u63d0\u9ad8\u8d2d\u4e70\u6c34\u679c\u7684\u53e3\u5473", "Url": "https://leetcode.cn/problems/maximize-total-tastiness-of-purchased-fruits/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2432, "Title": "The Employee That Worked on the Longest Task", "TitleCn": "\u5904\u7406\u7528\u65f6\u6700\u957f\u7684\u90a3\u4e2a\u4efb\u52a1\u7684\u5458\u5de5", "Url": "https://leetcode.cn/problems/the-employee-that-worked-on-the-longest-task/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 314 Problem 1"}, {"ID": 2433, "Title": "Find The Original Array of Prefix Xor", "TitleCn": "\u627e\u51fa\u524d\u7f00\u5f02\u6216\u7684\u539f\u59cb\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-the-original-array-of-prefix-xor/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 314 Problem 2"}, {"ID": 2434, "Title": "Using a Robot to Print the Lexicographically Smallest String", "TitleCn": "\u4f7f\u7528\u673a\u5668\u4eba\u6253\u5370\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/using-a-robot-to-print-the-lexicographically-smallest-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 314 Problem 3"}, {"ID": 2435, "Title": "Paths in Matrix Whose Sum Is Divisible by K", "TitleCn": "\u77e9\u9635\u4e2d\u548c\u80fd\u88ab K \u6574\u9664\u7684\u8def\u5f84", "Url": "https://leetcode.cn/problems/paths-in-matrix-whose-sum-is-divisible-by-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 314 Problem 4"}, {"ID": 2436, "Title": "Minimum Split Into Subarrays With GCD Greater Than One", "TitleCn": "\u4f7f\u5b50\u6570\u7ec4\u6700\u5927\u516c\u7ea6\u6570\u5927\u4e8e\u4e00\u7684\u6700\u5c0f\u5206\u5272\u6570", "Url": "https://leetcode.cn/problems/minimum-split-into-subarrays-with-gcd-greater-than-one/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2437, "Title": "Number of Valid Clock Times", "TitleCn": "\u6709\u6548\u65f6\u95f4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-valid-clock-times/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 89 Problem 1"}, {"ID": 2438, "Title": "Range Product Queries of Powers", "TitleCn": "\u4e8c\u7684\u5e42\u6570\u7ec4\u4e2d\u67e5\u8be2\u8303\u56f4\u5185\u7684\u4e58\u79ef", "Url": "https://leetcode.cn/problems/range-product-queries-of-powers/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 89 Problem 2"}, {"ID": 2439, "Title": "Minimize Maximum of Array", "TitleCn": "\u6700\u5c0f\u5316\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/minimize-maximum-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 89 Problem 3"}, {"ID": 2440, "Title": "Create Components With Same Value", "TitleCn": "\u521b\u5efa\u4ef7\u503c\u76f8\u540c\u7684\u8fde\u901a\u5757", "Url": "https://leetcode.cn/problems/create-components-with-same-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 89 Problem 4"}, {"ID": 2441, "Title": "Largest Positive Integer That Exists With Its Negative", "TitleCn": "\u4e0e\u5bf9\u5e94\u8d1f\u6570\u540c\u65f6\u5b58\u5728\u7684\u6700\u5927\u6b63\u6574\u6570", "Url": "https://leetcode.cn/problems/largest-positive-integer-that-exists-with-its-negative/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 315 Problem 1"}, {"ID": 2442, "Title": "Count Number of Distinct Integers After Reverse Operations", "TitleCn": "\u53cd\u8f6c\u4e4b\u540e\u4e0d\u540c\u6574\u6570\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-distinct-integers-after-reverse-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 315 Problem 2"}, {"ID": 2443, "Title": "Sum of Number and Its Reverse", "TitleCn": "\u53cd\u8f6c\u4e4b\u540e\u7684\u6570\u5b57\u548c", "Url": "https://leetcode.cn/problems/sum-of-number-and-its-reverse/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 315 Problem 3"}, {"ID": 2444, "Title": "Count Subarrays With Fixed Bounds", "TitleCn": "\u7edf\u8ba1\u5b9a\u754c\u5b50\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-subarrays-with-fixed-bounds/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 315 Problem 4"}, {"ID": 2445, "Title": "Number of Nodes With Value One", "TitleCn": "\u503c\u4e3a 1 \u7684\u8282\u70b9\u6570", "Url": "https://leetcode.cn/problems/number-of-nodes-with-value-one/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2446, "Title": "Determine if Two Events Have Conflict", "TitleCn": "\u5224\u65ad\u4e24\u4e2a\u4e8b\u4ef6\u662f\u5426\u5b58\u5728\u51b2\u7a81", "Url": "https://leetcode.cn/problems/determine-if-two-events-have-conflict/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 316 Problem 1"}, {"ID": 2447, "Title": "Number of Subarrays With GCD Equal to K", "TitleCn": "\u6700\u5927\u516c\u56e0\u6570\u7b49\u4e8e K \u7684\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-subarrays-with-gcd-equal-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 316 Problem 2"}, {"ID": 2448, "Title": "Minimum Cost to Make Array Equal", "TitleCn": "\u4f7f\u6570\u7ec4\u76f8\u7b49\u7684\u6700\u5c0f\u5f00\u9500", "Url": "https://leetcode.cn/problems/minimum-cost-to-make-array-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 316 Problem 3"}, {"ID": 2449, "Title": "Minimum Number of Operations to Make Arrays Similar", "TitleCn": "\u4f7f\u6570\u7ec4\u76f8\u4f3c\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-arrays-similar/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 316 Problem 4"}, {"ID": 2450, "Title": "Number of Distinct Binary Strings After Applying Operations", "TitleCn": "\u5e94\u7528\u64cd\u4f5c\u540e\u4e0d\u540c\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-distinct-binary-strings-after-applying-operations/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2451, "Title": "Odd String Difference", "TitleCn": "\u5dee\u503c\u6570\u7ec4\u4e0d\u540c\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/odd-string-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 90 Problem 1"}, {"ID": 2452, "Title": "Words Within Two Edits of Dictionary", "TitleCn": "\u8ddd\u79bb\u5b57\u5178\u4e24\u6b21\u7f16\u8f91\u4ee5\u5185\u7684\u5355\u8bcd", "Url": "https://leetcode.cn/problems/words-within-two-edits-of-dictionary/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 90 Problem 2"}, {"ID": 2453, "Title": "Destroy Sequential Targets", "TitleCn": "\u6467\u6bc1\u4e00\u7cfb\u5217\u76ee\u6807", "Url": "https://leetcode.cn/problems/destroy-sequential-targets/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 90 Problem 3"}, {"ID": 2454, "Title": "Next Greater Element IV", "TitleCn": "\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 IV", "Url": "https://leetcode.cn/problems/next-greater-element-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 90 Problem 4"}, {"ID": 2455, "Title": "Average Value of Even Numbers That Are Divisible by Three", "TitleCn": "\u53ef\u88ab\u4e09\u6574\u9664\u7684\u5076\u6570\u7684\u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/average-value-of-even-numbers-that-are-divisible-by-three/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 317 Problem 1"}, {"ID": 2456, "Title": "Most Popular Video Creator", "TitleCn": "\u6700\u6d41\u884c\u7684\u89c6\u9891\u521b\u4f5c\u8005", "Url": "https://leetcode.cn/problems/most-popular-video-creator/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 317 Problem 2"}, {"ID": 2457, "Title": "Minimum Addition to Make Integer Beautiful", "TitleCn": "\u7f8e\u4e3d\u6574\u6570\u7684\u6700\u5c0f\u589e\u91cf", "Url": "https://leetcode.cn/problems/minimum-addition-to-make-integer-beautiful/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 317 Problem 3"}, {"ID": 2458, "Title": "Height of Binary Tree After Subtree Removal Queries", "TitleCn": "\u79fb\u9664\u5b50\u6811\u540e\u7684\u4e8c\u53c9\u6811\u9ad8\u5ea6", "Url": "https://leetcode.cn/problems/height-of-binary-tree-after-subtree-removal-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 317 Problem 4"}, {"ID": 2459, "Title": "Sort Array by Moving Items to Empty Space", "TitleCn": "\u901a\u8fc7\u79fb\u52a8\u9879\u76ee\u5230\u7a7a\u767d\u533a\u57df\u6765\u6392\u5e8f\u6570\u7ec4", "Url": "https://leetcode.cn/problems/sort-array-by-moving-items-to-empty-space/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2460, "Title": "Apply Operations to an Array", "TitleCn": "\u5bf9\u6570\u7ec4\u6267\u884c\u64cd\u4f5c", "Url": "https://leetcode.cn/problems/apply-operations-to-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 318 Problem 1"}, {"ID": 2461, "Title": "Maximum Sum of Distinct Subarrays With Length K", "TitleCn": "\u957f\u5ea6\u4e3a K \u5b50\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-of-distinct-subarrays-with-length-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 318 Problem 2"}, {"ID": 2462, "Title": "Total Cost to Hire K Workers", "TitleCn": "\u96c7\u4f63 K \u4f4d\u5de5\u4eba\u7684\u603b\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/total-cost-to-hire-k-workers/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 318 Problem 3"}, {"ID": 2463, "Title": "Minimum Total Distance Traveled", "TitleCn": "\u6700\u5c0f\u79fb\u52a8\u603b\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/minimum-total-distance-traveled/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 318 Problem 4"}, {"ID": 2464, "Title": "Minimum Subarrays in a Valid Split", "TitleCn": "\u6709\u6548\u5206\u5272\u4e2d\u7684\u6700\u5c11\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/minimum-subarrays-in-a-valid-split/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2465, "Title": "Number of Distinct Averages", "TitleCn": "\u4e0d\u540c\u7684\u5e73\u5747\u503c\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-distinct-averages/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 91 Problem 1"}, {"ID": 2466, "Title": "Count Ways To Build Good Strings", "TitleCn": "\u7edf\u8ba1\u6784\u9020\u597d\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/count-ways-to-build-good-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 91 Problem 2"}, {"ID": 2467, "Title": "Most Profitable Path in a Tree", "TitleCn": "\u6811\u4e0a\u6700\u5927\u5f97\u5206\u548c\u8def\u5f84", "Url": "https://leetcode.cn/problems/most-profitable-path-in-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 91 Problem 3"}, {"ID": 2468, "Title": "Split Message Based on Limit", "TitleCn": "\u6839\u636e\u9650\u5236\u5206\u5272\u6d88\u606f", "Url": "https://leetcode.cn/problems/split-message-based-on-limit/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 91 Problem 4"}, {"ID": 2469, "Title": "Convert the Temperature", "TitleCn": "\u6e29\u5ea6\u8f6c\u6362", "Url": "https://leetcode.cn/problems/convert-the-temperature/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 319 Problem 1"}, {"ID": 2470, "Title": "Number of Subarrays With LCM Equal to K", "TitleCn": "\u6700\u5c0f\u516c\u500d\u6570\u7b49\u4e8e K \u7684\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-subarrays-with-lcm-equal-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 319 Problem 2"}, {"ID": 2471, "Title": "Minimum Number of Operations to Sort a Binary Tree by Level", "TitleCn": "\u9010\u5c42\u6392\u5e8f\u4e8c\u53c9\u6811\u6240\u9700\u7684\u6700\u5c11\u64cd\u4f5c\u6570\u76ee", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 319 Problem 3"}, {"ID": 2472, "Title": "Maximum Number of Non-overlapping Palindrome Substrings", "TitleCn": "\u4e0d\u91cd\u53e0\u56de\u6587\u5b50\u5b57\u7b26\u4e32\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-non-overlapping-palindrome-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 319 Problem 4"}, {"ID": 2473, "Title": "Minimum Cost to Buy Apples", "TitleCn": "\u8d2d\u4e70\u82f9\u679c\u7684\u6700\u4f4e\u6210\u672c", "Url": "https://leetcode.cn/problems/minimum-cost-to-buy-apples/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2474, "Title": "Customers With Strictly Increasing Purchases", "TitleCn": "\u8d2d\u4e70\u91cf\u4e25\u683c\u589e\u52a0\u7684\u5ba2\u6237", "Url": "https://leetcode.cn/problems/customers-with-strictly-increasing-purchases/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2475, "Title": "Number of Unequal Triplets in Array", "TitleCn": "\u6570\u7ec4\u4e2d\u4e0d\u7b49\u4e09\u5143\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-unequal-triplets-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 320 Problem 1"}, {"ID": 2476, "Title": "Closest Nodes Queries in a Binary Search Tree", "TitleCn": "\u4e8c\u53c9\u641c\u7d22\u6811\u6700\u8fd1\u8282\u70b9\u67e5\u8be2", "Url": "https://leetcode.cn/problems/closest-nodes-queries-in-a-binary-search-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 320 Problem 2"}, {"ID": 2477, "Title": "Minimum Fuel Cost to Report to the Capital", "TitleCn": "\u5230\u8fbe\u9996\u90fd\u7684\u6700\u5c11\u6cb9\u8017", "Url": "https://leetcode.cn/problems/minimum-fuel-cost-to-report-to-the-capital/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 320 Problem 3"}, {"ID": 2478, "Title": "Number of Beautiful Partitions", "TitleCn": "\u5b8c\u7f8e\u5206\u5272\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/number-of-beautiful-partitions/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 320 Problem 4"}, {"ID": 2479, "Title": "Maximum XOR of Two Non-Overlapping Subtrees", "TitleCn": "\u4e24\u4e2a\u4e0d\u91cd\u53e0\u5b50\u6811\u7684\u6700\u5927\u5f02\u6216\u503c", "Url": "https://leetcode.cn/problems/maximum-xor-of-two-non-overlapping-subtrees/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2480, "Title": "Form a Chemical Bond", "TitleCn": "\u5f62\u6210\u5316\u5b66\u952e", "Url": "https://leetcode.cn/problems/form-a-chemical-bond/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2481, "Title": "Minimum Cuts to Divide a Circle", "TitleCn": "\u5206\u5272\u5706\u7684\u6700\u5c11\u5207\u5272\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-cuts-to-divide-a-circle/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 92 Problem 1"}, {"ID": 2482, "Title": "Difference Between Ones and Zeros in Row and Column", "TitleCn": "\u884c\u548c\u5217\u4e2d\u4e00\u548c\u96f6\u7684\u5dee\u503c", "Url": "https://leetcode.cn/problems/difference-between-ones-and-zeros-in-row-and-column/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 92 Problem 2"}, {"ID": 2483, "Title": "Minimum Penalty for a Shop", "TitleCn": "\u5546\u5e97\u7684\u6700\u5c11\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-penalty-for-a-shop/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 92 Problem 3"}, {"ID": 2484, "Title": "Count Palindromic Subsequences", "TitleCn": "\u7edf\u8ba1\u56de\u6587\u5b50\u5e8f\u5217\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-palindromic-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 92 Problem 4"}, {"ID": 2485, "Title": "Find the Pivot Integer", "TitleCn": "\u627e\u51fa\u4e2d\u67a2\u6574\u6570", "Url": "https://leetcode.cn/problems/find-the-pivot-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 321 Problem 1"}, {"ID": 2486, "Title": "Append Characters to String to Make Subsequence", "TitleCn": "\u8ffd\u52a0\u5b57\u7b26\u4ee5\u83b7\u5f97\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/append-characters-to-string-to-make-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 321 Problem 2"}, {"ID": 2487, "Title": "Remove Nodes From Linked List", "TitleCn": "\u4ece\u94fe\u8868\u4e2d\u79fb\u9664\u8282\u70b9", "Url": "https://leetcode.cn/problems/remove-nodes-from-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 321 Problem 3"}, {"ID": 2488, "Title": "Count Subarrays With Median K", "TitleCn": "\u7edf\u8ba1\u4e2d\u4f4d\u6570\u4e3a K \u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/count-subarrays-with-median-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 321 Problem 4"}, {"ID": 2489, "Title": "Number of Substrings With Fixed Ratio", "TitleCn": "\u56fa\u5b9a\u6bd4\u7387\u7684\u5b50\u5b57\u7b26\u4e32\u6570", "Url": "https://leetcode.cn/problems/number-of-substrings-with-fixed-ratio/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2490, "Title": "Circular Sentence", "TitleCn": "\u56de\u73af\u53e5", "Url": "https://leetcode.cn/problems/circular-sentence/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 322 Problem 1"}, {"ID": 2491, "Title": "Divide Players Into Teams of Equal Skill", "TitleCn": "\u5212\u5206\u6280\u80fd\u70b9\u76f8\u7b49\u7684\u56e2\u961f", "Url": "https://leetcode.cn/problems/divide-players-into-teams-of-equal-skill/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 322 Problem 2"}, {"ID": 2492, "Title": "Minimum Score of a Path Between Two Cities", "TitleCn": "\u4e24\u4e2a\u57ce\u5e02\u95f4\u8def\u5f84\u7684\u6700\u5c0f\u5206\u6570", "Url": "https://leetcode.cn/problems/minimum-score-of-a-path-between-two-cities/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 322 Problem 3"}, {"ID": 2493, "Title": "Divide Nodes Into the Maximum Number of Groups", "TitleCn": "\u5c06\u8282\u70b9\u5206\u6210\u5c3d\u53ef\u80fd\u591a\u7684\u7ec4", "Url": "https://leetcode.cn/problems/divide-nodes-into-the-maximum-number-of-groups/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 322 Problem 4"}, {"ID": 2494, "Title": "Merge Overlapping Events in the Same Hall", "TitleCn": "\u5408\u5e76\u5728\u540c\u4e00\u4e2a\u5927\u5385\u91cd\u53e0\u7684\u6d3b\u52a8", "Url": "https://leetcode.cn/problems/merge-overlapping-events-in-the-same-hall/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2495, "Title": "Number of Subarrays Having Even Product", "TitleCn": "\u79ef\u662f\u5076\u6570\u7684\u5b50\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-subarrays-having-even-product/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2496, "Title": "Maximum Value of a String in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u5b57\u7b26\u4e32\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/maximum-value-of-a-string-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 93 Problem 1"}, {"ID": 2497, "Title": "Maximum Star Sum of a Graph", "TitleCn": "\u56fe\u4e2d\u6700\u5927\u661f\u548c", "Url": "https://leetcode.cn/problems/maximum-star-sum-of-a-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 93 Problem 2"}, {"ID": 2498, "Title": "Frog Jump II", "TitleCn": "\u9752\u86d9\u8fc7\u6cb3 II", "Url": "https://leetcode.cn/problems/frog-jump-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 93 Problem 3"}, {"ID": 2499, "Title": "Minimum Total Cost to Make Arrays Unequal", "TitleCn": "\u8ba9\u6570\u7ec4\u4e0d\u76f8\u7b49\u7684\u6700\u5c0f\u603b\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-total-cost-to-make-arrays-unequal/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 93 Problem 4"}, {"ID": 2500, "Title": "Delete Greatest Value in Each Row", "TitleCn": "\u5220\u9664\u6bcf\u884c\u4e2d\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/delete-greatest-value-in-each-row/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 323 Problem 1"}, {"ID": 2501, "Title": "Longest Square Streak in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u6700\u957f\u7684\u65b9\u6ce2", "Url": "https://leetcode.cn/problems/longest-square-streak-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 323 Problem 2"}, {"ID": 2502, "Title": "Design Memory Allocator", "TitleCn": "\u8bbe\u8ba1\u5185\u5b58\u5206\u914d\u5668", "Url": "https://leetcode.cn/problems/design-memory-allocator/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 323 Problem 3"}, {"ID": 2503, "Title": "Maximum Number of Points From Grid Queries", "TitleCn": "\u77e9\u9635\u67e5\u8be2\u53ef\u83b7\u5f97\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-points-from-grid-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 323 Problem 4"}, {"ID": 2504, "Title": "Concatenate the Name and the Profession", "TitleCn": "\u628a\u540d\u5b57\u548c\u804c\u4e1a\u8054\u7cfb\u8d77\u6765", "Url": "https://leetcode.cn/problems/concatenate-the-name-and-the-profession/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2505, "Title": "Bitwise OR of All Subsequence Sums", "TitleCn": "\u6240\u6709\u5b50\u5e8f\u5217\u548c\u7684\u6309\u4f4d\u6216", "Url": "https://leetcode.cn/problems/bitwise-or-of-all-subsequence-sums/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2506, "Title": "Count Pairs Of Similar Strings", "TitleCn": "\u7edf\u8ba1\u76f8\u4f3c\u5b57\u7b26\u4e32\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-pairs-of-similar-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 324 Problem 1"}, {"ID": 2507, "Title": "Smallest Value After Replacing With Sum of Prime Factors", "TitleCn": "\u4f7f\u7528\u8d28\u56e0\u6570\u4e4b\u548c\u66ff\u6362\u540e\u53ef\u4ee5\u53d6\u5230\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/smallest-value-after-replacing-with-sum-of-prime-factors/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 324 Problem 2"}, {"ID": 2508, "Title": "Add Edges to Make Degrees of All Nodes Even", "TitleCn": "\u6dfb\u52a0\u8fb9\u4f7f\u6240\u6709\u8282\u70b9\u5ea6\u6570\u90fd\u4e3a\u5076\u6570", "Url": "https://leetcode.cn/problems/add-edges-to-make-degrees-of-all-nodes-even/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 324 Problem 3"}, {"ID": 2509, "Title": "Cycle Length Queries in a Tree", "TitleCn": "\u67e5\u8be2\u6811\u4e2d\u73af\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/cycle-length-queries-in-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 324 Problem 4"}, {"ID": 2510, "Title": "Check if There is a Path With Equal Number of 0's And 1's", "TitleCn": "\u68c0\u67e5\u662f\u5426\u6709\u8def\u5f84\u7ecf\u8fc7\u76f8\u540c\u6570\u91cf\u7684 0 \u548c 1", "Url": "https://leetcode.cn/problems/check-if-there-is-a-path-with-equal-number-of-0s-and-1s/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2511, "Title": "Maximum Enemy Forts That Can Be Captured", "TitleCn": "\u6700\u591a\u53ef\u4ee5\u6467\u6bc1\u7684\u654c\u4eba\u57ce\u5821\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-enemy-forts-that-can-be-captured/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 94 Problem 1"}, {"ID": 2512, "Title": "Reward Top K Students", "TitleCn": "\u5956\u52b1\u6700\u9876\u5c16\u7684 K \u540d\u5b66\u751f", "Url": "https://leetcode.cn/problems/reward-top-k-students/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 94 Problem 2"}, {"ID": 2513, "Title": "Minimize the Maximum of Two Arrays", "TitleCn": "\u6700\u5c0f\u5316\u4e24\u4e2a\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/minimize-the-maximum-of-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 94 Problem 3"}, {"ID": 2514, "Title": "Count Anagrams", "TitleCn": "\u7edf\u8ba1\u540c\u4f4d\u5f02\u6784\u5b57\u7b26\u4e32\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-anagrams/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 94 Problem 4"}, {"ID": 2515, "Title": "Shortest Distance to Target String in a Circular Array", "TitleCn": "\u5230\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u6700\u77ed\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/shortest-distance-to-target-string-in-a-circular-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 325 Problem 1"}, {"ID": 2516, "Title": "Take K of Each Character From Left and Right", "TitleCn": "\u6bcf\u79cd\u5b57\u7b26\u81f3\u5c11\u53d6 K \u4e2a", "Url": "https://leetcode.cn/problems/take-k-of-each-character-from-left-and-right/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 325 Problem 2"}, {"ID": 2517, "Title": "Maximum Tastiness of Candy Basket", "TitleCn": "\u793c\u76d2\u7684\u6700\u5927\u751c\u871c\u5ea6", "Url": "https://leetcode.cn/problems/maximum-tastiness-of-candy-basket/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 325 Problem 3"}, {"ID": 2518, "Title": "Number of Great Partitions", "TitleCn": "\u597d\u5206\u533a\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-great-partitions/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 325 Problem 4"}, {"ID": 2519, "Title": "Count the Number of K-Big Indices", "TitleCn": "\u7edf\u8ba1 K-Big \u7d22\u5f15\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-the-number-of-k-big-indices/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2520, "Title": "Count the Digits That Divide a Number", "TitleCn": "\u7edf\u8ba1\u80fd\u6574\u9664\u6570\u5b57\u7684\u4f4d\u6570", "Url": "https://leetcode.cn/problems/count-the-digits-that-divide-a-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 326 Problem 1"}, {"ID": 2521, "Title": "Distinct Prime Factors of Product of Array", "TitleCn": "\u6570\u7ec4\u4e58\u79ef\u4e2d\u7684\u4e0d\u540c\u8d28\u56e0\u6570\u6570\u76ee", "Url": "https://leetcode.cn/problems/distinct-prime-factors-of-product-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 326 Problem 2"}, {"ID": 2522, "Title": "Partition String Into Substrings With Values at Most K", "TitleCn": "\u5c06\u5b57\u7b26\u4e32\u5206\u5272\u6210\u503c\u4e0d\u8d85\u8fc7 K \u7684\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/partition-string-into-substrings-with-values-at-most-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 326 Problem 3"}, {"ID": 2523, "Title": "Closest Prime Numbers in Range", "TitleCn": "\u8303\u56f4\u5185\u6700\u63a5\u8fd1\u7684\u4e24\u4e2a\u8d28\u6570", "Url": "https://leetcode.cn/problems/closest-prime-numbers-in-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 326 Problem 4"}, {"ID": 2524, "Title": "Maximum Frequency Score of a Subarray", "TitleCn": "\u5b50\u6570\u7ec4\u7684\u6700\u5927\u9891\u7387\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-frequency-score-of-a-subarray/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2525, "Title": "Categorize Box According to Criteria", "TitleCn": "\u6839\u636e\u89c4\u5219\u5c06\u7bb1\u5b50\u5206\u7c7b", "Url": "https://leetcode.cn/problems/categorize-box-according-to-criteria/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 95 Problem 1"}, {"ID": 2526, "Title": "Find Consecutive Integers from a Data Stream", "TitleCn": "\u627e\u5230\u6570\u636e\u6d41\u4e2d\u7684\u8fde\u7eed\u6574\u6570", "Url": "https://leetcode.cn/problems/find-consecutive-integers-from-a-data-stream/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 95 Problem 2"}, {"ID": 2527, "Title": "Find Xor-Beauty of Array", "TitleCn": "\u67e5\u8be2\u6570\u7ec4\u5f02\u6216\u7f8e\u4e3d\u503c", "Url": "https://leetcode.cn/problems/find-xor-beauty-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 95 Problem 3"}, {"ID": 2528, "Title": "Maximize the Minimum Powered City", "TitleCn": "\u6700\u5927\u5316\u57ce\u5e02\u7684\u6700\u5c0f\u4f9b\u7535\u7ad9\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximize-the-minimum-powered-city/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 95 Problem 4"}, {"ID": 2529, "Title": "Maximum Count of Positive Integer and Negative Integer", "TitleCn": "\u6b63\u6574\u6570\u548c\u8d1f\u6574\u6570\u7684\u6700\u5927\u8ba1\u6570", "Url": "https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 4, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 327 Problem 1"}, {"ID": 2530, "Title": "Maximal Score After Applying K Operations", "TitleCn": "\u6267\u884c K \u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximal-score-after-applying-k-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 327 Problem 2"}, {"ID": 2531, "Title": "Make Number of Distinct Characters Equal", "TitleCn": "\u4f7f\u5b57\u7b26\u4e32\u4e2d\u4e0d\u540c\u5b57\u7b26\u7684\u6570\u76ee\u76f8\u7b49", "Url": "https://leetcode.cn/problems/make-number-of-distinct-characters-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 327 Problem 3"}, {"ID": 2532, "Title": "Time to Cross a Bridge", "TitleCn": "\u8fc7\u6865\u7684\u65f6\u95f4", "Url": "https://leetcode.cn/problems/time-to-cross-a-bridge/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 327 Problem 4"}, {"ID": 2533, "Title": "Number of Good Binary Strings", "TitleCn": "\u597d\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-good-binary-strings/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2534, "Title": "Time Taken to Cross the Door", "TitleCn": "\u901a\u8fc7\u95e8\u7684\u65f6\u95f4", "Url": "https://leetcode.cn/problems/time-taken-to-cross-the-door/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2535, "Title": "Difference Between Element Sum and Digit Sum of an Array", "TitleCn": "\u6570\u7ec4\u5143\u7d20\u548c\u4e0e\u6570\u5b57\u548c\u7684\u7edd\u5bf9\u5dee", "Url": "https://leetcode.cn/problems/difference-between-element-sum-and-digit-sum-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 328 Problem 1"}, {"ID": 2536, "Title": "Increment Submatrices by One", "TitleCn": "\u5b50\u77e9\u9635\u5143\u7d20\u52a0 1", "Url": "https://leetcode.cn/problems/increment-submatrices-by-one/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 328 Problem 2"}, {"ID": 2537, "Title": "Count the Number of Good Subarrays", "TitleCn": "\u7edf\u8ba1\u597d\u5b50\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-good-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 328 Problem 3"}, {"ID": 2538, "Title": "Difference Between Maximum and Minimum Price Sum", "TitleCn": "\u6700\u5927\u4ef7\u503c\u548c\u4e0e\u6700\u5c0f\u4ef7\u503c\u548c\u7684\u5dee\u503c", "Url": "https://leetcode.cn/problems/difference-between-maximum-and-minimum-price-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 328 Problem 4"}, {"ID": 2539, "Title": "Count the Number of Good Subsequences", "TitleCn": "\u597d\u5b50\u5e8f\u5217\u7684\u4e2a\u6570", "Url": "https://leetcode.cn/problems/count-the-number-of-good-subsequences/", "Ispaid": 1, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2540, "Title": "Minimum Common Value", "TitleCn": "\u6700\u5c0f\u516c\u5171\u503c", "Url": "https://leetcode.cn/problems/minimum-common-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 96 Problem 1"}, {"ID": 2541, "Title": "Minimum Operations to Make Array Equal II", "TitleCn": "\u4f7f\u6570\u7ec4\u4e2d\u6240\u6709\u5143\u7d20\u76f8\u7b49\u7684\u6700\u5c0f\u64cd\u4f5c\u6570 II", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-array-equal-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 96 Problem 2"}, {"ID": 2542, "Title": "Maximum Subsequence Score", "TitleCn": "\u6700\u5927\u5b50\u5e8f\u5217\u7684\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-subsequence-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 96 Problem 3"}, {"ID": 2543, "Title": "Check if Point Is Reachable", "TitleCn": "\u5224\u65ad\u4e00\u4e2a\u70b9\u662f\u5426\u53ef\u4ee5\u5230\u8fbe", "Url": "https://leetcode.cn/problems/check-if-point-is-reachable/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 96 Problem 4"}, {"ID": 2544, "Title": "Alternating Digit Sum", "TitleCn": "\u4ea4\u66ff\u6570\u5b57\u548c", "Url": "https://leetcode.cn/problems/alternating-digit-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 329 Problem 1"}, {"ID": 2545, "Title": "Sort the Students by Their Kth Score", "TitleCn": "\u6839\u636e\u7b2c K \u573a\u8003\u8bd5\u7684\u5206\u6570\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-the-students-by-their-kth-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 329 Problem 2"}, {"ID": 2546, "Title": "Apply Bitwise Operations to Make Strings Equal", "TitleCn": "\u6267\u884c\u9010\u4f4d\u8fd0\u7b97\u4f7f\u5b57\u7b26\u4e32\u76f8\u7b49", "Url": "https://leetcode.cn/problems/apply-bitwise-operations-to-make-strings-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 329 Problem 3"}, {"ID": 2547, "Title": "Minimum Cost to Split an Array", "TitleCn": "\u62c6\u5206\u6570\u7ec4\u7684\u6700\u5c0f\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-to-split-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 329 Problem 4"}, {"ID": 2548, "Title": "Maximum Price to Fill a Bag", "TitleCn": "\u586b\u6ee1\u80cc\u5305\u7684\u6700\u5927\u4ef7\u683c", "Url": "https://leetcode.cn/problems/maximum-price-to-fill-a-bag/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2549, "Title": "Count Distinct Numbers on Board", "TitleCn": "\u7edf\u8ba1\u684c\u9762\u4e0a\u7684\u4e0d\u540c\u6570\u5b57", "Url": "https://leetcode.cn/problems/count-distinct-numbers-on-board/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 330 Problem 1"}, {"ID": 2550, "Title": "Count Collisions of Monkeys on a Polygon", "TitleCn": "\u7334\u5b50\u78b0\u649e\u7684\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/count-collisions-of-monkeys-on-a-polygon/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 330 Problem 2"}, {"ID": 2551, "Title": "Put Marbles in Bags", "TitleCn": "\u5c06\u73e0\u5b50\u653e\u5165\u80cc\u5305\u4e2d", "Url": "https://leetcode.cn/problems/put-marbles-in-bags/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 330 Problem 3"}, {"ID": 2552, "Title": "Count Increasing Quadruplets", "TitleCn": "\u7edf\u8ba1\u4e0a\u5347\u56db\u5143\u7ec4", "Url": "https://leetcode.cn/problems/count-increasing-quadruplets/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 330 Problem 4"}, {"ID": 2553, "Title": "Separate the Digits in an Array", "TitleCn": "\u5206\u5272\u6570\u7ec4\u4e2d\u6570\u5b57\u7684\u6570\u4f4d", "Url": "https://leetcode.cn/problems/separate-the-digits-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 97 Problem 1"}, {"ID": 2554, "Title": "Maximum Number of Integers to Choose From a Range I", "TitleCn": "\u4ece\u4e00\u4e2a\u8303\u56f4\u5185\u9009\u62e9\u6700\u591a\u6574\u6570 I", "Url": "https://leetcode.cn/problems/maximum-number-of-integers-to-choose-from-a-range-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 97 Problem 2"}, {"ID": 2555, "Title": "Maximize Win From Two Segments", "TitleCn": "\u4e24\u4e2a\u7ebf\u6bb5\u83b7\u5f97\u7684\u6700\u591a\u5956\u54c1", "Url": "https://leetcode.cn/problems/maximize-win-from-two-segments/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 97 Problem 3"}, {"ID": 2556, "Title": "Disconnect Path in a Binary Matrix by at Most One Flip", "TitleCn": "\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7ffb\u8f6c\u6700\u591a\u4e00\u6b21\u4f7f\u8def\u5f84\u4e0d\u8fde\u901a", "Url": "https://leetcode.cn/problems/disconnect-path-in-a-binary-matrix-by-at-most-one-flip/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 97 Problem 4"}, {"ID": 2557, "Title": "Maximum Number of Integers to Choose From a Range II", "TitleCn": "\u4ece\u4e00\u4e2a\u8303\u56f4\u5185\u9009\u62e9\u6700\u591a\u6574\u6570 II", "Url": "https://leetcode.cn/problems/maximum-number-of-integers-to-choose-from-a-range-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2558, "Title": "Take Gifts From the Richest Pile", "TitleCn": "\u4ece\u6570\u91cf\u6700\u591a\u7684\u5806\u53d6\u8d70\u793c\u7269", "Url": "https://leetcode.cn/problems/take-gifts-from-the-richest-pile/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 331 Problem 1"}, {"ID": 2559, "Title": "Count Vowel Strings in Ranges", "TitleCn": "\u7edf\u8ba1\u8303\u56f4\u5185\u7684\u5143\u97f3\u5b57\u7b26\u4e32\u6570", "Url": "https://leetcode.cn/problems/count-vowel-strings-in-ranges/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 331 Problem 2"}, {"ID": 2560, "Title": "House Robber IV", "TitleCn": "\u6253\u5bb6\u52ab\u820d IV", "Url": "https://leetcode.cn/problems/house-robber-iv/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 331 Problem 3"}, {"ID": 2561, "Title": "Rearranging Fruits", "TitleCn": "\u91cd\u6392\u6c34\u679c", "Url": "https://leetcode.cn/problems/rearranging-fruits/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 331 Problem 4"}, {"ID": 2562, "Title": "Find the Array Concatenation Value", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u7684\u4e32\u8054\u503c", "Url": "https://leetcode.cn/problems/find-the-array-concatenation-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 332 Problem 1"}, {"ID": 2563, "Title": "Count the Number of Fair Pairs", "TitleCn": "\u7edf\u8ba1\u516c\u5e73\u6570\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-fair-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 332 Problem 2"}, {"ID": 2564, "Title": "Substring XOR Queries", "TitleCn": "\u5b50\u5b57\u7b26\u4e32\u5f02\u6216\u67e5\u8be2", "Url": "https://leetcode.cn/problems/substring-xor-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 332 Problem 3"}, {"ID": 2565, "Title": "Subsequence With the Minimum Score", "TitleCn": "\u6700\u5c11\u5f97\u5206\u5b50\u5e8f\u5217", "Url": "https://leetcode.cn/problems/subsequence-with-the-minimum-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 332 Problem 4"}, {"ID": 2566, "Title": "Maximum Difference by Remapping a Digit", "TitleCn": "\u66ff\u6362\u4e00\u4e2a\u6570\u5b57\u540e\u7684\u6700\u5927\u5dee\u503c", "Url": "https://leetcode.cn/problems/maximum-difference-by-remapping-a-digit/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 98 Problem 1"}, {"ID": 2567, "Title": "Minimum Score by Changing Two Elements", "TitleCn": "\u4fee\u6539\u4e24\u4e2a\u5143\u7d20\u7684\u6700\u5c0f\u5206\u6570", "Url": "https://leetcode.cn/problems/minimum-score-by-changing-two-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 98 Problem 2"}, {"ID": 2568, "Title": "Minimum Impossible OR", "TitleCn": "\u6700\u5c0f\u65e0\u6cd5\u5f97\u5230\u7684\u6216\u503c", "Url": "https://leetcode.cn/problems/minimum-impossible-or/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 98 Problem 3"}, {"ID": 2569, "Title": "Handling Sum Queries After Update", "TitleCn": "\u66f4\u65b0\u6570\u7ec4\u540e\u5904\u7406\u6c42\u548c\u67e5\u8be2", "Url": "https://leetcode.cn/problems/handling-sum-queries-after-update/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 98 Problem 4"}, {"ID": 2570, "Title": "Merge Two 2D Arrays by Summing Values", "TitleCn": "\u5408\u5e76\u4e24\u4e2a\u4e8c\u7ef4\u6570\u7ec4 - \u6c42\u548c\u6cd5", "Url": "https://leetcode.cn/problems/merge-two-2d-arrays-by-summing-values/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 333 Problem 1"}, {"ID": 2571, "Title": "Minimum Operations to Reduce an Integer to 0", "TitleCn": "\u5c06\u6574\u6570\u51cf\u5c11\u5230\u96f6\u9700\u8981\u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-reduce-an-integer-to-0/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 333 Problem 2"}, {"ID": 2572, "Title": "Count the Number of Square-Free Subsets", "TitleCn": "\u65e0\u5e73\u65b9\u5b50\u96c6\u8ba1\u6570", "Url": "https://leetcode.cn/problems/count-the-number-of-square-free-subsets/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 333 Problem 3"}, {"ID": 2573, "Title": "Find the String with LCP", "TitleCn": "\u627e\u51fa\u5bf9\u5e94 LCP \u77e9\u9635\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-the-string-with-lcp/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 333 Problem 4"}, {"ID": 2574, "Title": "Left and Right Sum Differences", "TitleCn": "\u5de6\u53f3\u5143\u7d20\u548c\u7684\u5dee\u503c", "Url": "https://leetcode.cn/problems/left-and-right-sum-differences/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 334 Problem 1"}, {"ID": 2575, "Title": "Find the Divisibility Array of a String", "TitleCn": "\u627e\u51fa\u5b57\u7b26\u4e32\u7684\u53ef\u6574\u9664\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-the-divisibility-array-of-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 334 Problem 2"}, {"ID": 2576, "Title": "Find the Maximum Number of Marked Indices", "TitleCn": "\u6c42\u51fa\u6700\u591a\u6807\u8bb0\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-the-maximum-number-of-marked-indices/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 334 Problem 3"}, {"ID": 2577, "Title": "Minimum Time to Visit a Cell In a Grid", "TitleCn": "\u5728\u7f51\u683c\u56fe\u4e2d\u8bbf\u95ee\u4e00\u4e2a\u683c\u5b50\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-visit-a-cell-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 334 Problem 4"}, {"ID": 2578, "Title": "Split With Minimum Sum", "TitleCn": "\u6700\u5c0f\u548c\u5206\u5272", "Url": "https://leetcode.cn/problems/split-with-minimum-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 99 Problem 1"}, {"ID": 2579, "Title": "Count Total Number of Colored Cells", "TitleCn": "\u7edf\u8ba1\u67d3\u8272\u683c\u5b50\u6570", "Url": "https://leetcode.cn/problems/count-total-number-of-colored-cells/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 99 Problem 2"}, {"ID": 2580, "Title": "Count Ways to Group Overlapping Ranges", "TitleCn": "\u7edf\u8ba1\u5c06\u91cd\u53e0\u533a\u95f4\u5408\u5e76\u6210\u7ec4\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/count-ways-to-group-overlapping-ranges/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 99 Problem 3"}, {"ID": 2581, "Title": "Count Number of Possible Root Nodes", "TitleCn": "\u7edf\u8ba1\u53ef\u80fd\u7684\u6811\u6839\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-number-of-possible-root-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 99 Problem 4"}, {"ID": 2582, "Title": "Pass the Pillow", "TitleCn": "\u9012\u6795\u5934", "Url": "https://leetcode.cn/problems/pass-the-pillow/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 335 Problem 1"}, {"ID": 2583, "Title": "Kth Largest Sum in a Binary Tree", "TitleCn": "\u4e8c\u53c9\u6811\u4e2d\u7684\u7b2c K \u5927\u5c42\u548c", "Url": "https://leetcode.cn/problems/kth-largest-sum-in-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 335 Problem 2"}, {"ID": 2584, "Title": "Split the Array to Make Coprime Products", "TitleCn": "\u5206\u5272\u6570\u7ec4\u4f7f\u4e58\u79ef\u4e92\u8d28", "Url": "https://leetcode.cn/problems/split-the-array-to-make-coprime-products/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 335 Problem 3"}, {"ID": 2585, "Title": "Number of Ways to Earn Points", "TitleCn": "\u83b7\u5f97\u5206\u6570\u7684\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-earn-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 335 Problem 4"}, {"ID": 2586, "Title": "Count the Number of Vowel Strings in Range", "TitleCn": "\u7edf\u8ba1\u8303\u56f4\u5185\u7684\u5143\u97f3\u5b57\u7b26\u4e32\u6570", "Url": "https://leetcode.cn/problems/count-the-number-of-vowel-strings-in-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 336 Problem 1"}, {"ID": 2587, "Title": "Rearrange Array to Maximize Prefix Score", "TitleCn": "\u91cd\u6392\u6570\u7ec4\u4ee5\u5f97\u5230\u6700\u5927\u524d\u7f00\u5206\u6570", "Url": "https://leetcode.cn/problems/rearrange-array-to-maximize-prefix-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 336 Problem 2"}, {"ID": 2588, "Title": "Count the Number of Beautiful Subarrays", "TitleCn": "\u7edf\u8ba1\u7f8e\u4e3d\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-beautiful-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 336 Problem 3"}, {"ID": 2589, "Title": "Minimum Time to Complete All Tasks", "TitleCn": "\u5b8c\u6210\u6240\u6709\u4efb\u52a1\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-complete-all-tasks/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 336 Problem 4"}, {"ID": 2590, "Title": "Design a Todo List", "TitleCn": "\u8bbe\u8ba1\u4e00\u4e2a\u5f85\u529e\u4e8b\u9879\u6e05\u5355", "Url": "https://leetcode.cn/problems/design-a-todo-list/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2591, "Title": "Distribute Money to Maximum Children", "TitleCn": "\u5c06\u94b1\u5206\u7ed9\u6700\u591a\u7684\u513f\u7ae5", "Url": "https://leetcode.cn/problems/distribute-money-to-maximum-children/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 100 Problem 1"}, {"ID": 2592, "Title": "Maximize Greatness of an Array", "TitleCn": "\u6700\u5927\u5316\u6570\u7ec4\u7684\u4f1f\u5927\u503c", "Url": "https://leetcode.cn/problems/maximize-greatness-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 100 Problem 2"}, {"ID": 2593, "Title": "Find Score of an Array After Marking All Elements", "TitleCn": "\u6807\u8bb0\u6240\u6709\u5143\u7d20\u540e\u6570\u7ec4\u7684\u5206\u6570", "Url": "https://leetcode.cn/problems/find-score-of-an-array-after-marking-all-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 100 Problem 3"}, {"ID": 2594, "Title": "Minimum Time to Repair Cars", "TitleCn": "\u4fee\u8f66\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-repair-cars/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 100 Problem 4"}, {"ID": 2595, "Title": "Number of Even and Odd Bits", "TitleCn": "\u5947\u5076\u4f4d\u6570", "Url": "https://leetcode.cn/problems/number-of-even-and-odd-bits/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 337 Problem 1"}, {"ID": 2596, "Title": "Check Knight Tour Configuration", "TitleCn": "\u68c0\u67e5\u9a91\u58eb\u5de1\u89c6\u65b9\u6848", "Url": "https://leetcode.cn/problems/check-knight-tour-configuration/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 337 Problem 2"}, {"ID": 2597, "Title": "The Number of Beautiful Subsets", "TitleCn": "\u7f8e\u4e3d\u5b50\u96c6\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/the-number-of-beautiful-subsets/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 337 Problem 3"}, {"ID": 2598, "Title": "Smallest Missing Non-negative Integer After Operations", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u540e\u7684\u6700\u5927 MEX", "Url": "https://leetcode.cn/problems/smallest-missing-non-negative-integer-after-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 337 Problem 4"}, {"ID": 2599, "Title": "Make the Prefix Sum Non-negative", "TitleCn": "\u4f7f\u524d\u7f00\u548c\u6570\u7ec4\u975e\u8d1f", "Url": "https://leetcode.cn/problems/make-the-prefix-sum-non-negative/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2600, "Title": "K Items With the Maximum Sum", "TitleCn": "K \u4ef6\u7269\u54c1\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/k-items-with-the-maximum-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 338 Problem 1"}, {"ID": 2601, "Title": "Prime Subtraction Operation", "TitleCn": "\u8d28\u6570\u51cf\u6cd5\u8fd0\u7b97", "Url": "https://leetcode.cn/problems/prime-subtraction-operation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 338 Problem 2"}, {"ID": 2602, "Title": "Minimum Operations to Make All Array Elements Equal", "TitleCn": "\u4f7f\u6570\u7ec4\u5143\u7d20\u5168\u90e8\u76f8\u7b49\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-all-array-elements-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 338 Problem 3"}, {"ID": 2603, "Title": "Collect Coins in a Tree", "TitleCn": "\u6536\u96c6\u6811\u4e2d\u91d1\u5e01", "Url": "https://leetcode.cn/problems/collect-coins-in-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 338 Problem 4"}, {"ID": 2604, "Title": "Minimum Time to Eat All Grains", "TitleCn": "\u5403\u6389\u6240\u6709\u8c37\u5b50\u7684\u6700\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-eat-all-grains/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2605, "Title": "Form Smallest Number From Two Digit Arrays", "TitleCn": "\u4ece\u4e24\u4e2a\u6570\u5b57\u6570\u7ec4\u91cc\u751f\u6210\u6700\u5c0f\u6570\u5b57", "Url": "https://leetcode.cn/problems/form-smallest-number-from-two-digit-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 101 Problem 1"}, {"ID": 2606, "Title": "Find the Substring With Maximum Cost", "TitleCn": "\u627e\u5230\u6700\u5927\u5f00\u9500\u7684\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-the-substring-with-maximum-cost/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 101 Problem 2"}, {"ID": 2607, "Title": "Make K-Subarray Sums Equal", "TitleCn": "\u4f7f\u5b50\u6570\u7ec4\u5143\u7d20\u548c\u76f8\u7b49", "Url": "https://leetcode.cn/problems/make-k-subarray-sums-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 101 Problem 3"}, {"ID": 2608, "Title": "Shortest Cycle in a Graph", "TitleCn": "\u56fe\u4e2d\u7684\u6700\u77ed\u73af", "Url": "https://leetcode.cn/problems/shortest-cycle-in-a-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 101 Problem 4"}, {"ID": 2609, "Title": "Find the Longest Balanced Substring of a Binary String", "TitleCn": "\u6700\u957f\u5e73\u8861\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-the-longest-balanced-substring-of-a-binary-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 339 Problem 1"}, {"ID": 2610, "Title": "Convert an Array Into a 2D Array With Conditions", "TitleCn": "\u8f6c\u6362\u4e8c\u7ef4\u6570\u7ec4", "Url": "https://leetcode.cn/problems/convert-an-array-into-a-2d-array-with-conditions/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 339 Problem 2"}, {"ID": 2611, "Title": "Mice and Cheese", "TitleCn": "\u8001\u9f20\u548c\u5976\u916a", "Url": "https://leetcode.cn/problems/mice-and-cheese/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 339 Problem 3"}, {"ID": 2612, "Title": "Minimum Reverse Operations", "TitleCn": "\u6700\u5c11\u7ffb\u8f6c\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-reverse-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 339 Problem 4"}, {"ID": 2613, "Title": "Beautiful Pairs", "TitleCn": "\u7f8e\u6570\u5bf9", "Url": "https://leetcode.cn/problems/beautiful-pairs/", "Ispaid": 1, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2614, "Title": "Prime In Diagonal", "TitleCn": "\u5bf9\u89d2\u7ebf\u4e0a\u7684\u8d28\u6570", "Url": "https://leetcode.cn/problems/prime-in-diagonal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 340 Problem 1"}, {"ID": 2615, "Title": "Sum of Distances", "TitleCn": "\u7b49\u503c\u8ddd\u79bb\u548c", "Url": "https://leetcode.cn/problems/sum-of-distances/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 340 Problem 2"}, {"ID": 2616, "Title": "Minimize the Maximum Difference of Pairs", "TitleCn": "\u6700\u5c0f\u5316\u6570\u5bf9\u7684\u6700\u5927\u5dee\u503c", "Url": "https://leetcode.cn/problems/minimize-the-maximum-difference-of-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 340 Problem 3"}, {"ID": 2617, "Title": "Minimum Number of Visited Cells in a Grid", "TitleCn": "\u7f51\u683c\u56fe\u4e2d\u6700\u5c11\u8bbf\u95ee\u7684\u683c\u5b50\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-visited-cells-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 340 Problem 4"}, {"ID": 2618, "Title": "Check if Object Instance of Class", "TitleCn": "\u68c0\u67e5\u662f\u5426\u662f\u7c7b\u7684\u5bf9\u8c61\u5b9e\u4f8b", "Url": "https://leetcode.cn/problems/check-if-object-instance-of-class/", "Ispaid": 0, "Type": "JavaScript", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2619, "Title": "Array Prototype Last", "TitleCn": "\u6570\u7ec4\u539f\u578b\u5bf9\u8c61\u7684\u6700\u540e\u4e00\u4e2a\u5143\u7d20", "Url": "https://leetcode.cn/problems/array-prototype-last/", "Ispaid": 0, "Type": "JavaScript", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2620, "Title": "Counter", "TitleCn": "\u8ba1\u6570\u5668", "Url": "https://leetcode.cn/problems/counter/", "Ispaid": 0, "Type": "JavaScript", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2621, "Title": "Sleep", "TitleCn": "\u7761\u7720\u51fd\u6570", "Url": "https://leetcode.cn/problems/sleep/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2622, "Title": "Cache With Time Limit", "TitleCn": "\u6709\u65f6\u95f4\u9650\u5236\u7684\u7f13\u5b58", "Url": "https://leetcode.cn/problems/cache-with-time-limit/", "Ispaid": 0, "Type": "JavaScript", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2623, "Title": "Memoize", "TitleCn": "\u8bb0\u5fc6\u51fd\u6570", "Url": "https://leetcode.cn/problems/memoize/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2624, "Title": "Snail Traversal", "TitleCn": "\u8717\u725b\u6392\u5e8f", "Url": "https://leetcode.cn/problems/snail-traversal/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2625, "Title": "Flatten Deeply Nested Array", "TitleCn": "\u6241\u5e73\u5316\u5d4c\u5957\u6570\u7ec4", "Url": "https://leetcode.cn/problems/flatten-deeply-nested-array/", "Ispaid": 0, "Type": "JavaScript", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2626, "Title": "Array Reduce Transformation", "TitleCn": "\u6570\u7ec4\u5f52\u7ea6\u8fd0\u7b97", "Url": "https://leetcode.cn/problems/array-reduce-transformation/", "Ispaid": 0, "Type": "JavaScript", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2627, "Title": "Debounce", "TitleCn": "\u51fd\u6570\u9632\u6296", "Url": "https://leetcode.cn/problems/debounce/", "Ispaid": 0, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2628, "Title": "SON Deep Equal", "TitleCn": "\u5b8c\u5168\u76f8\u7b49\u7684 JSON \u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/json-deep-equal/", "Ispaid": 1, "Type": "JavaScript", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2629, "Title": "Function Composition", "TitleCn": "\u590d\u5408\u51fd\u6570", "Url": "https://leetcode.cn/problems/function-composition/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2630, "Title": "Memoize II", "TitleCn": "\u8bb0\u5fc6\u51fd\u6570 II", "Url": "https://leetcode.cn/problems/memoize-ii/", "Ispaid": 0, "Type": "JavaScript", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2631, "Title": "Group By", "TitleCn": "\u5206\u7ec4", "Url": "https://leetcode.cn/problems/group-by/", "Ispaid": 0, "Type": "JavaScript", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2632, "Title": "Curry", "TitleCn": "\u67ef\u91cc\u5316", "Url": "https://leetcode.cn/problems/curry/", "Ispaid": 1, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2633, "Title": "Convert Object to JSON String", "TitleCn": "\u5c06\u5bf9\u8c61\u8f6c\u6362\u4e3a JSON \u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/convert-object-to-json-string/", "Ispaid": 1, "Type": "JavaScript", "Level": 9, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2634, "Title": "Filter Elements from Array", "TitleCn": "\u8fc7\u6ee4\u6570\u7ec4\u4e2d\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/filter-elements-from-array/", "Ispaid": 0, "Type": "JavaScript", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2635, "Title": "Apply Transform Over Each Element in Array", "TitleCn": "\u8f6c\u6362\u6570\u7ec4\u4e2d\u7684\u6bcf\u4e2a\u5143\u7d20", "Url": "https://leetcode.cn/problems/apply-transform-over-each-element-in-array/", "Ispaid": 0, "Type": "JavaScript", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2636, "Title": "Promise Pool", "TitleCn": "Promice \u5bf9\u8c61\u6c60", "Url": "https://leetcode.cn/problems/promise-pool/", "Ispaid": 1, "Type": "JavaScript", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2637, "Title": "Promise Time Limit", "TitleCn": "\u6709\u65f6\u95f4\u9650\u5236\u7684 Promise \u5bf9\u8c61", "Url": "https://leetcode.cn/problems/promise-time-limit/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2638, "Title": "Count the Number of K-Free Subsets", "TitleCn": "\u7edf\u8ba1 K-Free \u5b50\u96c6\u7684\u603b\u6570", "Url": "https://leetcode.cn/problems/count-the-number-of-k-free-subsets/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2639, "Title": "Find the Width of Columns of a Grid", "TitleCn": "\u67e5\u8be2\u7f51\u683c\u56fe\u4e2d\u6bcf\u4e00\u5217\u7684\u5bbd\u5ea6", "Url": "https://leetcode.cn/problems/find-the-width-of-columns-of-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 102 Problem 1"}, {"ID": 2640, "Title": "Find the Score of All Prefixes of an Array", "TitleCn": "\u4e00\u4e2a\u6570\u7ec4\u6240\u6709\u524d\u7f00\u7684\u5206\u6570", "Url": "https://leetcode.cn/problems/find-the-score-of-all-prefixes-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 102 Problem 2"}, {"ID": 2641, "Title": "Cousins in Binary Tree II", "TitleCn": "\u4e8c\u53c9\u6811\u7684\u5802\u5144\u5f1f\u8282\u70b9 II", "Url": "https://leetcode.cn/problems/cousins-in-binary-tree-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 102 Problem 3"}, {"ID": 2642, "Title": "Design Graph With Shortest Path Calculator", "TitleCn": "\u8bbe\u8ba1\u53ef\u4ee5\u6c42\u6700\u77ed\u8def\u5f84\u7684\u56fe\u7c7b", "Url": "https://leetcode.cn/problems/design-graph-with-shortest-path-calculator/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 102 Problem 4"}, {"ID": 2643, "Title": "Row With Maximum Ones", "TitleCn": "\u4e00\u6700\u591a\u7684\u884c", "Url": "https://leetcode.cn/problems/row-with-maximum-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 341 Problem 1"}, {"ID": 2644, "Title": "Find the Maximum Divisibility Score", "TitleCn": "\u627e\u51fa\u53ef\u6574\u9664\u6027\u5f97\u5206\u6700\u5927\u7684\u6574\u6570", "Url": "https://leetcode.cn/problems/find-the-maximum-divisibility-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 341 Problem 2"}, {"ID": 2645, "Title": "Minimum Additions to Make Valid String", "TitleCn": "\u6784\u9020\u6709\u6548\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6570", "Url": "https://leetcode.cn/problems/minimum-additions-to-make-valid-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 341 Problem 3"}, {"ID": 2646, "Title": "Minimize the Total Price of the Trips", "TitleCn": "\u6700\u5c0f\u5316\u65c5\u884c\u7684\u4ef7\u683c\u603b\u548c", "Url": "https://leetcode.cn/problems/minimize-the-total-price-of-the-trips/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 341 Problem 4"}, {"ID": 2647, "Title": "Color the Triangle Red", "TitleCn": "\u628a\u4e09\u89d2\u5f62\u67d3\u6210\u7ea2\u8272", "Url": "https://leetcode.cn/problems/color-the-triangle-red/", "Ispaid": 1, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2648, "Title": "Generate Fibonacci Sequence", "TitleCn": "\u751f\u6210\u6590\u6ce2\u90a3\u5951\u6570\u5217", "Url": "https://leetcode.cn/problems/generate-fibonacci-sequence/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2649, "Title": "Nested Array Generator", "TitleCn": "\u5d4c\u5957\u6570\u7ec4\u751f\u6210\u5668", "Url": "https://leetcode.cn/problems/nested-array-generator/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2650, "Title": "Design Cancellable Function", "TitleCn": "\u8bbe\u8ba1\u53ef\u53d6\u6d88\u51fd\u6570", "Url": "https://leetcode.cn/problems/design-cancellable-function/", "Ispaid": 0, "Type": "JavaScript", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2651, "Title": "Calculate Delayed Arrival Time", "TitleCn": "\u8ba1\u7b97\u5217\u8f66\u5230\u7ad9\u65f6\u95f4", "Url": "https://leetcode.cn/problems/calculate-delayed-arrival-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 342 Problem 1"}, {"ID": 2652, "Title": "Sum Multiples", "TitleCn": "\u500d\u6570\u6c42\u548c", "Url": "https://leetcode.cn/problems/sum-multiples/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 342 Problem 2"}, {"ID": 2653, "Title": "Sliding Subarray Beauty", "TitleCn": "\u6ed1\u52a8\u5b50\u6570\u7ec4\u7684\u7f8e\u4e3d\u503c", "Url": "https://leetcode.cn/problems/sliding-subarray-beauty/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 342 Problem 3"}, {"ID": 2654, "Title": "Minimum Number of Operations to Make All Array Elements Equal to 1", "TitleCn": "\u4f7f\u6570\u7ec4\u6240\u6709\u5143\u7d20\u53d8\u6210 1 \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-all-array-elements-equal-to-1/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 342 Problem 4"}, {"ID": 2655, "Title": "Find Maximal Uncovered Ranges", "TitleCn": "\u5bfb\u627e\u6700\u5927\u957f\u5ea6\u7684\u672a\u8986\u76d6\u533a\u95f4", "Url": "https://leetcode.cn/problems/find-maximal-uncovered-ranges/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2656, "Title": "Maximum Sum With Exactly K Elements", "TitleCn": "K \u4e2a\u5143\u7d20\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-with-exactly-k-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 103 Problem 1"}, {"ID": 2657, "Title": "Find the Prefix Common Array of Two Arrays", "TitleCn": "\u627e\u5230\u4e24\u4e2a\u6570\u7ec4\u7684\u524d\u7f00\u516c\u5171\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-the-prefix-common-array-of-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 103 Problem 2"}, {"ID": 2658, "Title": "Maximum Number of Fish in a Grid", "TitleCn": "\u7f51\u683c\u56fe\u4e2d\u9c7c\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-fish-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 103 Problem 3"}, {"ID": 2659, "Title": "Make Array Empty", "TitleCn": "\u5c06\u6570\u7ec4\u6e05\u7a7a", "Url": "https://leetcode.cn/problems/make-array-empty/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 103 Problem 4"}, {"ID": 2660, "Title": "Determine the Winner of a Bowling Game", "TitleCn": "\u4fdd\u9f84\u7403\u6e38\u620f\u7684\u83b7\u80dc\u8005", "Url": "https://leetcode.cn/problems/determine-the-winner-of-a-bowling-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 343 Problem 1"}, {"ID": 2661, "Title": "First Completely Painted Row or Column", "TitleCn": "\u627e\u51fa\u53e0\u6d82\u5143\u7d20", "Url": "https://leetcode.cn/problems/first-completely-painted-row-or-column/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 343 Problem 2"}, {"ID": 2662, "Title": "Minimum Cost of a Path With Special Roads", "TitleCn": "\u524d\u5f80\u76ee\u6807\u7684\u6700\u5c0f\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-of-a-path-with-special-roads/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 343 Problem 3"}, {"ID": 2663, "Title": "Lexicographically Smallest Beautiful String", "TitleCn": "\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u7f8e\u4e3d\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-smallest-beautiful-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 343 Problem 4"}, {"ID": 2664, "Title": "The Knight\u2019s Tour", "TitleCn": "\u5de1\u903b\u7684\u9a91\u58eb", "Url": "https://leetcode.cn/problems/the-knights-tour/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2665, "Title": "Counter II", "TitleCn": "\u8ba1\u6570\u5668 II", "Url": "https://leetcode.cn/problems/counter-ii/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2666, "Title": "Allow One Function Call", "TitleCn": "\u53ea\u5141\u8bb8\u4e00\u6b21\u51fd\u6570\u8c03\u7528", "Url": "https://leetcode.cn/problems/allow-one-function-call/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2667, "Title": "Create Hello World Function", "TitleCn": "\u521b\u5efa Hello World \u51fd\u6570", "Url": "https://leetcode.cn/problems/create-hello-world-function/", "Ispaid": 0, "Type": "JavaScript", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2668, "Title": "Find Latest Salaries", "TitleCn": "\u67e5\u8be2\u5458\u5de5\u5f53\u524d\u85aa\u6c34", "Url": "https://leetcode.cn/problems/find-latest-salaries/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2669, "Title": "Count Artist Occurrences On Spotify Ranking List", "TitleCn": "\u7edf\u8ba1 Spotify \u6392\u884c\u699c\u4e0a\u827a\u672f\u5bb6\u51fa\u73b0\u6b21\u6570", "Url": "https://leetcode.cn/problems/count-artist-occurrences-on-spotify-ranking-list/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2670, "Title": "Find the Distinct Difference Array", "TitleCn": "\u627e\u51fa\u4e0d\u540c\u5143\u7d20\u6570\u76ee\u5dee\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-the-distinct-difference-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 344 Problem 1"}, {"ID": 2671, "Title": "Frequency Tracker", "TitleCn": "\u9891\u7387\u8ddf\u8e2a\u5668", "Url": "https://leetcode.cn/problems/frequency-tracker/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 344 Problem 2"}, {"ID": 2672, "Title": "Number of Adjacent Elements With the Same Color", "TitleCn": "\u6709\u76f8\u540c\u989c\u8272\u7684\u76f8\u90bb\u5143\u7d20\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-adjacent-elements-with-the-same-color/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 344 Problem 3"}, {"ID": 2673, "Title": "Make Costs of Paths Equal in a Binary Tree", "TitleCn": "\u4f7f\u4e8c\u53c9\u6811\u6240\u6709\u8def\u5f84\u503c\u76f8\u7b49\u7684\u6700\u5c0f\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/make-costs-of-paths-equal-in-a-binary-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 344 Problem 4"}, {"ID": 2674, "Title": "Split a Circular Linked List", "TitleCn": "\u62c6\u5206\u5faa\u73af\u94fe\u8868", "Url": "https://leetcode.cn/problems/split-a-circular-linked-list/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2675, "Title": "Array of Objects to Matrix", "TitleCn": "\u5c06\u5bf9\u8c61\u6570\u7ec4\u8f6c\u6362\u4e3a\u77e9\u9635", "Url": "https://leetcode.cn/problems/array-of-objects-to-matrix/", "Ispaid": 1, "Type": "JavaScript", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2676, "Title": "Throttle", "TitleCn": "\u8282\u6d41", "Url": "https://leetcode.cn/problems/throttle/", "Ispaid": 1, "Type": "JavaScript", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2677, "Title": "Chunk Array", "TitleCn": "\u5206\u5757\u6570\u7ec4", "Url": "https://leetcode.cn/problems/chunk-array/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2678, "Title": "Number of Senior Citizens", "TitleCn": "\u8001\u4eba\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-senior-citizens/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 104 Problem 1"}, {"ID": 2679, "Title": "Sum in a Matrix", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 104 Problem 2"}, {"ID": 2680, "Title": "Maximum OR", "TitleCn": "\u6700\u5927\u6216\u503c", "Url": "https://leetcode.cn/problems/maximum-or/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 104 Problem 3"}, {"ID": 2681, "Title": "Power of Heroes", "TitleCn": "\u82f1\u96c4\u7684\u529b\u91cf", "Url": "https://leetcode.cn/problems/power-of-heroes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 104 Problem 4"}, {"ID": 2682, "Title": "Find the Losers of the Circular Game", "TitleCn": "\u627e\u51fa\u8f6c\u5708\u6e38\u620f\u8f93\u5bb6", "Url": "https://leetcode.cn/problems/find-the-losers-of-the-circular-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 345 Problem 1"}, {"ID": 2683, "Title": "Neighboring Bitwise XOR", "TitleCn": "\u76f8\u90bb\u503c\u7684\u6309\u4f4d\u5f02\u6216", "Url": "https://leetcode.cn/problems/neighboring-bitwise-xor/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 345 Problem 2"}, {"ID": 2684, "Title": "Maximum Number of Moves in a Grid", "TitleCn": "\u77e9\u9635\u4e2d\u79fb\u52a8\u7684\u6700\u5927\u6b21\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-moves-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 345 Problem 3"}, {"ID": 2685, "Title": "Count the Number of Complete Components", "TitleCn": "\u7edf\u8ba1\u5b8c\u5168\u8fde\u901a\u5206\u91cf\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-the-number-of-complete-components/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 345 Problem 4"}, {"ID": 2686, "Title": "Immediate Food Delivery III", "TitleCn": "\u5373\u65f6\u98df\u7269\u914d\u9001 III", "Url": "https://leetcode.cn/problems/immediate-food-delivery-iii/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2687, "Title": "Bikes Last Time Used", "TitleCn": "\u81ea\u884c\u8f66\u7684\u6700\u540e\u4f7f\u7528\u65f6\u95f4", "Url": "https://leetcode.cn/problems/bikes-last-time-used/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2688, "Title": "Find Active Users", "TitleCn": "\u67e5\u627e\u6d3b\u8dc3\u7528\u6237", "Url": "https://leetcode.cn/problems/find-active-users/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2689, "Title": "Extract Kth Character From The Rope Tree", "TitleCn": "\u4ece Rope \u6811\u4e2d\u63d0\u53d6\u7b2c K \u4e2a\u5b57\u7b26", "Url": "https://leetcode.cn/problems/extract-kth-character-from-the-rope-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2690, "Title": "Infinite Method Object", "TitleCn": "\u65e0\u7a77\u65b9\u6cd5\u5bf9\u8c61", "Url": "https://leetcode.cn/problems/infinite-method-object/", "Ispaid": 1, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2691, "Title": "Immutability Helper", "TitleCn": "\u4e0d\u53ef\u53d8\u8f85\u52a9\u5de5\u5177", "Url": "https://leetcode.cn/problems/immutability-helper/", "Ispaid": 1, "Type": "JavaScript", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2692, "Title": "Make Object Immutable", "TitleCn": "\u4f7f\u5bf9\u8c61\u4e0d\u53ef\u53d8", "Url": "https://leetcode.cn/problems/make-object-immutable/", "Ispaid": 1, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2693, "Title": "Call Function with Custom Context", "TitleCn": "\u4f7f\u7528\u81ea\u5b9a\u4e49\u4e0a\u4e0b\u6587\u8c03\u7528\u51fd\u6570", "Url": "https://leetcode.cn/problems/call-function-with-custom-context/", "Ispaid": 0, "Type": "JavaScript", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2694, "Title": "Event Emitter", "TitleCn": "\u4e8b\u4ef6\u53d1\u5c04\u5668", "Url": "https://leetcode.cn/problems/event-emitter/", "Ispaid": 0, "Type": "JavaScript", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2695, "Title": "Array Wrapper", "TitleCn": "\u5305\u88c5\u6570\u7ec4", "Url": "https://leetcode.cn/problems/array-wrapper/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2696, "Title": "Minimum String Length After Removing Substrings", "TitleCn": "\u5220\u9664\u5b50\u4e32\u540e\u7684\u5b57\u7b26\u4e32\u6700\u5c0f\u957f\u5ea6", "Url": "https://leetcode.cn/problems/minimum-string-length-after-removing-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 346 Problem 1"}, {"ID": 2697, "Title": "Lexicographically Smallest Palindrome", "TitleCn": "\u5b57\u5178\u5e8f\u6700\u5c0f\u56de\u6587\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-smallest-palindrome/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 346 Problem 2"}, {"ID": 2698, "Title": "Find the Punishment Number of an Integer", "TitleCn": "\u6c42\u4e00\u4e2a\u6574\u6570\u7684\u60e9\u7f5a\u6570", "Url": "https://leetcode.cn/problems/find-the-punishment-number-of-an-integer/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 346 Problem 3"}, {"ID": 2699, "Title": "Modify Graph Edge Weights", "TitleCn": "\u4fee\u6539\u56fe\u4e2d\u7684\u8fb9\u6743", "Url": "https://leetcode.cn/problems/modify-graph-edge-weights/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 346 Problem 4"}, {"ID": 2700, "Title": "Differences Between Two Objects", "TitleCn": "\u4e24\u4e2a\u5bf9\u8c61\u4e4b\u95f4\u7684\u5dee\u5f02", "Url": "https://leetcode.cn/problems/differences-between-two-objects/", "Ispaid": 1, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2701, "Title": "Consecutive Transactions with Increasing Amounts", "TitleCn": "\u8fde\u7eed\u9012\u589e\u4ea4\u6613", "Url": "https://leetcode.cn/problems/consecutive-transactions-with-increasing-amounts/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2702, "Title": "Minimum Operations to Make Numbers Non-positive", "TitleCn": "\u4f7f\u6570\u5b57\u53d8\u4e3a\u975e\u6b63\u6570\u7684\u6700\u5c0f\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-numbers-non-positive/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2703, "Title": "Return Length of Arguments Passed", "TitleCn": "\u8fd4\u56de\u4f20\u9012\u7684\u53c2\u6570\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/return-length-of-arguments-passed/", "Ispaid": 0, "Type": "JavaScript", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2704, "Title": "To Be Or Not To Be", "TitleCn": "\u76f8\u7b49\u8fd8\u662f\u4e0d\u76f8\u7b49", "Url": "https://leetcode.cn/problems/to-be-or-not-to-be/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2705, "Title": "Compact Object", "TitleCn": "\u7cbe\u7b80\u5bf9\u8c61", "Url": "https://leetcode.cn/problems/compact-object/", "Ispaid": 0, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2706, "Title": "Buy Two Chocolates", "TitleCn": "\u8d2d\u4e70\u4e24\u5757\u5de7\u514b\u529b", "Url": "https://leetcode.cn/problems/buy-two-chocolates/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 105 Problem 1"}, {"ID": 2707, "Title": "Extra Characters in a String", "TitleCn": "\u5b57\u7b26\u4e32\u4e2d\u7684\u989d\u5916\u5b57\u7b26", "Url": "https://leetcode.cn/problems/extra-characters-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 105 Problem 2"}, {"ID": 2708, "Title": "Maximum Strength of a Group", "TitleCn": "\u4e00\u4e2a\u5c0f\u7ec4\u7684\u6700\u5927\u5b9e\u529b\u503c", "Url": "https://leetcode.cn/problems/maximum-strength-of-a-group/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 105 Problem 3"}, {"ID": 2709, "Title": "Greatest Common Divisor Traversal", "TitleCn": "\u6700\u5927\u516c\u7ea6\u6570\u904d\u5386", "Url": "https://leetcode.cn/problems/greatest-common-divisor-traversal/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 105 Problem 4"}, {"ID": 2710, "Title": "Remove Trailing Zeros From a String", "TitleCn": "\u79fb\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u5c3e\u968f\u96f6", "Url": "https://leetcode.cn/problems/remove-trailing-zeros-from-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 347 Problem 1"}, {"ID": 2711, "Title": "Difference of Number of Distinct Values on Diagonals", "TitleCn": "\u5bf9\u89d2\u7ebf\u4e0a\u4e0d\u540c\u503c\u7684\u6570\u91cf\u5dee", "Url": "https://leetcode.cn/problems/difference-of-number-of-distinct-values-on-diagonals/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 347 Problem 2"}, {"ID": 2712, "Title": "Minimum Cost to Make All Characters Equal", "TitleCn": "\u4f7f\u6240\u6709\u5b57\u7b26\u76f8\u7b49\u7684\u6700\u5c0f\u6210\u672c", "Url": "https://leetcode.cn/problems/minimum-cost-to-make-all-characters-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 347 Problem 3"}, {"ID": 2713, "Title": "Maximum Strictly Increasing Cells in a Matrix", "TitleCn": "\u77e9\u9635\u4e2d\u4e25\u683c\u9012\u589e\u7684\u5355\u5143\u683c\u6570", "Url": "https://leetcode.cn/problems/maximum-strictly-increasing-cells-in-a-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 347 Problem 4"}, {"ID": 2714, "Title": "Find Shortest Path with K Hops", "TitleCn": "\u627e\u5230 K \u6b21\u8de8\u8d8a\u7684\u6700\u77ed\u8def\u5f84", "Url": "https://leetcode.cn/problems/find-shortest-path-with-k-hops/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2715, "Title": "Timeout Cancellation", "TitleCn": "\u6267\u884c\u53ef\u53d6\u6d88\u7684\u5ef6\u8fdf\u51fd\u6570", "Url": "https://leetcode.cn/problems/execute-cancellable-function-with-delay/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2716, "Title": "Minimize String Length", "TitleCn": "\u6700\u5c0f\u5316\u5b57\u7b26\u4e32\u957f\u5ea6", "Url": "https://leetcode.cn/problems/minimize-string-length/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 348 Problem 1"}, {"ID": 2717, "Title": "Semi-Ordered Permutation", "TitleCn": "\u534a\u6709\u5e8f\u6392\u5217", "Url": "https://leetcode.cn/problems/semi-ordered-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 348 Problem 2"}, {"ID": 2718, "Title": "Sum of Matrix After Queries", "TitleCn": "\u67e5\u8be2\u540e\u77e9\u9635\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-matrix-after-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 348 Problem 3"}, {"ID": 2719, "Title": "Count of Integers", "TitleCn": "\u7edf\u8ba1\u6574\u6570\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-of-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 348 Problem 4"}, {"ID": 2720, "Title": "Popularity Percentage", "TitleCn": "\u53d7\u6b22\u8fce\u5ea6\u767e\u5206\u6bd4", "Url": "https://leetcode.cn/problems/popularity-percentage/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2721, "Title": "Execute Asynchronous Functions in Parallel", "TitleCn": "\u5e76\u884c\u6267\u884c\u5f02\u6b65\u51fd\u6570", "Url": "https://leetcode.cn/problems/execute-asynchronous-functions-in-parallel/", "Ispaid": 0, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2722, "Title": "Join Two Arrays by ID", "TitleCn": "\u6839\u636e ID \u5408\u5e76\u4e24\u4e2a\u6570\u7ec4", "Url": "https://leetcode.cn/problems/join-two-arrays-by-id/", "Ispaid": 0, "Type": "JavaScript", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2723, "Title": "Add Two Promises", "TitleCn": "\u6dfb\u52a0\u4e24\u4e2a Promise \u5bf9\u8c61", "Url": "https://leetcode.cn/problems/add-two-promises/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2724, "Title": "Sort By", "TitleCn": "\u6392\u5e8f\u65b9\u5f0f", "Url": "https://leetcode.cn/problems/sort-by/", "Ispaid": 0, "Type": "JavaScript", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2725, "Title": "Interval Cancellation", "TitleCn": "\u95f4\u9694\u53d6\u6d88", "Url": "https://leetcode.cn/problems/interval-cancellation/", "Ispaid": 0, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2726, "Title": "Calculator with Method Chaining", "TitleCn": "\u4f7f\u7528\u65b9\u6cd5\u94fe\u7684\u8ba1\u7b97\u5668", "Url": "https://leetcode.cn/problems/calculator-with-method-chaining/", "Ispaid": 0, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2727, "Title": "Is Object Empty", "TitleCn": "\u5224\u65ad\u5bf9\u8c61\u662f\u5426\u4e3a\u7a7a", "Url": "https://leetcode.cn/problems/is-object-empty/", "Ispaid": 0, "Type": "JavaScript", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2728, "Title": "Count Houses in a Circular Street", "TitleCn": "\u8ba1\u7b97\u4e00\u4e2a\u73af\u5f62\u8857\u9053\u4e0a\u7684\u623f\u5c4b\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-houses-in-a-circular-street/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2729, "Title": "Check if The Number is Fascinating", "TitleCn": "\u5224\u65ad\u4e00\u4e2a\u6570\u662f\u5426\u8ff7\u4eba", "Url": "https://leetcode.cn/problems/check-if-the-number-is-fascinating/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 106 Problem 1"}, {"ID": 2730, "Title": "Find the Longest Semi-Repetitive Substring", "TitleCn": "\u627e\u5230\u6700\u957f\u7684\u534a\u91cd\u590d\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-the-longest-semi-repetitive-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 106 Problem 2"}, {"ID": 2731, "Title": "Movement of Robots", "TitleCn": "\u79fb\u52a8\u673a\u5668\u4eba", "Url": "https://leetcode.cn/problems/movement-of-robots/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 106 Problem 3"}, {"ID": 2732, "Title": "Find a Good Subset of the Matrix", "TitleCn": "\u627e\u5230\u77e9\u9635\u4e2d\u7684\u597d\u5b50\u96c6", "Url": "https://leetcode.cn/problems/find-a-good-subset-of-the-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 106 Problem 4"}, {"ID": 2733, "Title": "Neither Minimum nor Maximum", "TitleCn": "\u65e2\u4e0d\u662f\u6700\u5c0f\u503c\u4e5f\u4e0d\u662f\u6700\u5927\u503c", "Url": "https://leetcode.cn/problems/neither-minimum-nor-maximum/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 349 Problem 1"}, {"ID": 2734, "Title": "Lexicographically Smallest String After Substring Operation", "TitleCn": "\u6267\u884c\u5b50\u4e32\u64cd\u4f5c\u540e\u7684\u5b57\u5178\u5e8f\u6700\u5c0f\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-smallest-string-after-substring-operation/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 349 Problem 2"}, {"ID": 2735, "Title": "Collecting Chocolates", "TitleCn": "\u6536\u96c6\u5de7\u514b\u529b", "Url": "https://leetcode.cn/problems/collecting-chocolates/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 349 Problem 3"}, {"ID": 2736, "Title": "Maximum Sum Queries", "TitleCn": "\u6700\u5927\u548c\u67e5\u8be2", "Url": "https://leetcode.cn/problems/maximum-sum-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 349 Problem 4"}, {"ID": 2737, "Title": "Find the Closest Marked Node", "TitleCn": "\u627e\u5230\u6700\u8fd1\u7684\u6807\u8bb0\u8282\u70b9", "Url": "https://leetcode.cn/problems/find-the-closest-marked-node/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2738, "Title": "Count Occurrences in Text", "TitleCn": "\u7edf\u8ba1\u6587\u672c\u4e2d\u5355\u8bcd\u7684\u51fa\u73b0\u6b21\u6570", "Url": "https://leetcode.cn/problems/count-occurrences-in-text/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2739, "Title": "Total Distance Traveled", "TitleCn": "\u603b\u884c\u9a76\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/total-distance-traveled/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 350 Problem 1"}, {"ID": 2740, "Title": "Find the Value of the Partition", "TitleCn": "\u627e\u51fa\u5206\u533a\u503c", "Url": "https://leetcode.cn/problems/find-the-value-of-the-partition/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 350 Problem 2"}, {"ID": 2741, "Title": "Special Permutations", "TitleCn": "\u7279\u522b\u7684\u6392\u5217", "Url": "https://leetcode.cn/problems/special-permutations/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 350 Problem 3"}, {"ID": 2742, "Title": "Painting the Walls", "TitleCn": "\u7ed9\u5899\u58c1\u5237\u6cb9\u6f06", "Url": "https://leetcode.cn/problems/painting-the-walls/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 350 Problem 4"}, {"ID": 2743, "Title": "Count Substrings Without Repeating Character", "TitleCn": "\u8ba1\u7b97\u6ca1\u6709\u91cd\u590d\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-substrings-without-repeating-character/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2744, "Title": "Find Maximum Number of String Pairs", "TitleCn": "\u6700\u5927\u5b57\u7b26\u4e32\u914d\u5bf9\u6570\u76ee", "Url": "https://leetcode.cn/problems/find-maximum-number-of-string-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 107 Problem 1"}, {"ID": 2745, "Title": "Construct the Longest New String", "TitleCn": "\u6784\u9020\u6700\u957f\u7684\u65b0\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/construct-the-longest-new-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 107 Problem 2"}, {"ID": 2746, "Title": "Decremental String Concatenation", "TitleCn": "\u5b57\u7b26\u4e32\u8fde\u63a5\u5220\u51cf\u5b57\u6bcd", "Url": "https://leetcode.cn/problems/decremental-string-concatenation/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 107 Problem 3"}, {"ID": 2747, "Title": "Count Zero Request Servers", "TitleCn": "\u7edf\u8ba1\u6ca1\u6709\u6536\u5230\u8bf7\u6c42\u7684\u670d\u52a1\u5668\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-zero-request-servers/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 107 Problem 4"}, {"ID": 2748, "Title": "Number of Beautiful Pairs", "TitleCn": "\u7f8e\u4e3d\u4e0b\u6807\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-beautiful-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 351 Problem 1"}, {"ID": 2749, "Title": "Minimum Operations to Make the Integer Zero", "TitleCn": "\u5f97\u5230\u6574\u6570\u96f6\u9700\u8981\u6267\u884c\u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-the-integer-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 351 Problem 2"}, {"ID": 2750, "Title": "Ways to Split Array Into Good Subarrays", "TitleCn": "\u5c06\u6570\u7ec4\u5212\u5206\u6210\u82e5\u5e72\u597d\u5b50\u6570\u7ec4\u7684\u65b9\u5f0f", "Url": "https://leetcode.cn/problems/ways-to-split-array-into-good-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 351 Problem 3"}, {"ID": 2751, "Title": "Robot Collisions", "TitleCn": "\u673a\u5668\u4eba\u78b0\u649e", "Url": "https://leetcode.cn/problems/robot-collisions/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 351 Problem 4"}, {"ID": 2752, "Title": "Customers with Maximum Number of Transactions on Consecutive Days", "TitleCn": "\u5728\u8fde\u7eed\u5929\u6570\u4e0a\u8fdb\u884c\u4e86\u6700\u591a\u4ea4\u6613\u6b21\u6570\u7684\u987e\u5ba2", "Url": "https://leetcode.cn/problems/customers-with-maximum-number-of-transactions-on-consecutive-days/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2753, "Title": "Count Houses in a Circular Street II", "TitleCn": "\u8ba1\u7b97\u4e00\u4e2a\u73af\u5f62\u8857\u9053\u4e0a\u7684\u623f\u5c4b\u6570\u91cf II", "Url": "https://leetcode.cn/problems/count-houses-in-a-circular-street-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2754, "Title": "Bind Function to Context", "TitleCn": "\u5c06\u51fd\u6570\u7ed1\u5b9a\u5230\u4e0a\u4e0b\u6587", "Url": "https://leetcode.cn/problems/bind-function-to-context/", "Ispaid": 1, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2755, "Title": "Deep Merge of Two Objects", "TitleCn": "\u6df1\u5ea6\u5408\u5e76\u4e24\u4e2a\u5bf9\u8c61", "Url": "https://leetcode.cn/problems/deep-merge-of-two-objects/", "Ispaid": 1, "Type": "JavaScript", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2756, "Title": "Query Batching", "TitleCn": "\u6279\u5904\u7406\u67e5\u8be2", "Url": "https://leetcode.cn/problems/query-batching/", "Ispaid": 1, "Type": "JavaScript", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2757, "Title": "Generate Circular Array Values", "TitleCn": "\u751f\u6210\u5faa\u73af\u6570\u7ec4\u7684\u503c", "Url": "https://leetcode.cn/problems/generate-circular-array-values/", "Ispaid": 1, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2758, "Title": "Next Day", "TitleCn": "\u4e0b\u4e00\u5929", "Url": "https://leetcode.cn/problems/next-day/", "Ispaid": 1, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2759, "Title": "Convert JSON String to Object", "TitleCn": "\u5c06 JSON \u5b57\u7b26\u4e32\u8f6c\u6362\u4e3a\u5bf9\u8c61", "Url": "https://leetcode.cn/problems/convert-json-string-to-object/", "Ispaid": 1, "Type": "JavaScript", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2760, "Title": "Longest Even Odd Subarray With Threshold", "TitleCn": "\u6700\u957f\u5947\u5076\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-even-odd-subarray-with-threshold/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 352 Problem 1"}, {"ID": 2761, "Title": "Prime Pairs With Target Sum", "TitleCn": "\u548c\u7b49\u4e8e\u76ee\u6807\u503c\u7684\u8d28\u6570\u5bf9", "Url": "https://leetcode.cn/problems/prime-pairs-with-target-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 352 Problem 2"}, {"ID": 2762, "Title": "Continuous Subarrays", "TitleCn": "\u4e0d\u95f4\u65ad\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/continuous-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 352 Problem 3"}, {"ID": 2763, "Title": "Sum of Imbalance Numbers of All Subarrays", "TitleCn": "\u6240\u6709\u5b50\u6570\u7ec4\u4e2d\u4e0d\u5e73\u8861\u6570\u5b57\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-imbalance-numbers-of-all-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 352 Problem 4"}, {"ID": 2764, "Title": "Is Array a Preorder of Some \u200cBinary Tree", "TitleCn": "\u6570\u7ec4\u662f\u5426\u8868\u793a\u67d0\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386", "Url": "https://leetcode.cn/problems/is-array-a-preorder-of-some-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2765, "Title": "Longest Alternating Subarray", "TitleCn": "\u6700\u957f\u4ea4\u66ff\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-alternating-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 108 Problem 1"}, {"ID": 2766, "Title": "Relocate Marbles", "TitleCn": "\u91cd\u65b0\u653e\u7f6e\u77f3\u5757", "Url": "https://leetcode.cn/problems/relocate-marbles/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 108 Problem 2"}, {"ID": 2767, "Title": "Partition String Into Minimum Beautiful Substrings", "TitleCn": "\u5c06\u5b57\u7b26\u4e32\u5206\u5272\u4e3a\u6700\u5c11\u7684\u7f8e\u4e3d\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/partition-string-into-minimum-beautiful-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 108 Problem 3"}, {"ID": 2768, "Title": "Number of Black Blocks", "TitleCn": "\u9ed1\u683c\u5b50\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-black-blocks/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 108 Problem 4"}, {"ID": 2769, "Title": "Find the Maximum Achievable Number", "TitleCn": "\u627e\u51fa\u6700\u5927\u7684\u53ef\u8fbe\u6210\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-the-maximum-achievable-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 353 Problem 1"}, {"ID": 2770, "Title": "Maximum Number of Jumps to Reach the Last Index", "TitleCn": "\u8fbe\u5230\u672b\u5c3e\u4e0b\u6807\u6240\u9700\u7684\u6700\u5927\u8df3\u8dc3\u6b21\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-jumps-to-reach-the-last-index/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 353 Problem 2"}, {"ID": 2771, "Title": "Longest Non-decreasing Subarray From Two Arrays", "TitleCn": "\u6784\u9020\u6700\u957f\u975e\u9012\u51cf\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-non-decreasing-subarray-from-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 353 Problem 3"}, {"ID": 2772, "Title": "Apply Operations to Make All Array Elements Equal to Zero", "TitleCn": "\u4f7f\u6570\u7ec4\u4e2d\u7684\u6240\u6709\u5143\u7d20\u90fd\u7b49\u4e8e\u96f6", "Url": "https://leetcode.cn/problems/apply-operations-to-make-all-array-elements-equal-to-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 353 Problem 4"}, {"ID": 2773, "Title": "Height of Special Binary Tree", "TitleCn": "\u7279\u6b8a\u4e8c\u53c9\u6811\u7684\u9ad8\u5ea6", "Url": "https://leetcode.cn/problems/height-of-special-binary-tree/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2774, "Title": "Array Upper Bound", "TitleCn": "\u6570\u7ec4\u7684\u4e0a\u754c", "Url": "https://leetcode.cn/problems/array-upper-bound/", "Ispaid": 1, "Type": "JavaScript", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2775, "Title": "Undefined to Null", "TitleCn": "\u5c06 undefined \u8f6c\u4e3a null", "Url": "https://leetcode.cn/problems/undefined-to-null/", "Ispaid": 1, "Type": "JavaScript", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2776, "Title": "Convert Callback Based Function to Promise Based Function", "TitleCn": "\u8f6c\u6362\u56de\u8c03\u51fd\u6570\u4e3a Promise \u51fd\u6570", "Url": "https://leetcode.cn/problems/convert-callback-based-function-to-promise-based-function/", "Ispaid": 1, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2777, "Title": "Date Range Generator", "TitleCn": "\u65e5\u671f\u8303\u56f4\u751f\u6210\u5668", "Url": "https://leetcode.cn/problems/date-range-generator/", "Ispaid": 1, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2778, "Title": "Sum of Squares of Special Elements", "TitleCn": "\u7279\u6b8a\u5143\u7d20\u5e73\u65b9\u548c", "Url": "https://leetcode.cn/problems/sum-of-squares-of-special-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 354 Problem 1"}, {"ID": 2779, "Title": "Maximum Beauty of an Array After Applying Operation", "TitleCn": "\u6570\u7ec4\u7684\u6700\u5927\u7f8e\u4e3d\u503c", "Url": "https://leetcode.cn/problems/maximum-beauty-of-an-array-after-applying-operation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 354 Problem 2"}, {"ID": 2780, "Title": "Minimum Index of a Valid Split", "TitleCn": "\u5408\u6cd5\u5206\u5272\u7684\u6700\u5c0f\u4e0b\u6807", "Url": "https://leetcode.cn/problems/minimum-index-of-a-valid-split/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 354 Problem 3"}, {"ID": 2781, "Title": "Length of the Longest Valid Substring", "TitleCn": "\u6700\u957f\u5408\u6cd5\u5b50\u5b57\u7b26\u4e32\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/length-of-the-longest-valid-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 354 Problem 4"}, {"ID": 2782, "Title": "Number of Unique Categories", "TitleCn": "\u552f\u4e00\u7c7b\u522b\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-unique-categories/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2783, "Title": "Flight Occupancy and Waitlist Analysis", "TitleCn": "\u822a\u73ed\u5165\u5ea7\u7387\u548c\u7b49\u5f85\u540d\u5355\u5206\u6790", "Url": "https://leetcode.cn/problems/flight-occupancy-and-waitlist-analysis/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2784, "Title": "Check if Array is Good", "TitleCn": "\u68c0\u67e5\u6570\u7ec4\u662f\u5426\u662f\u597d\u7684", "Url": "https://leetcode.cn/problems/check-if-array-is-good/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 109 Problem 1"}, {"ID": 2785, "Title": "Sort Vowels in a String", "TitleCn": "\u5c06\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3\u5b57\u6bcd\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sort-vowels-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 109 Problem 2"}, {"ID": 2786, "Title": "Visit Array Positions to Maximize Score", "TitleCn": "\u8bbf\u95ee\u6570\u7ec4\u4e2d\u7684\u4f4d\u7f6e\u4f7f\u5206\u6570\u6700\u5927", "Url": "https://leetcode.cn/problems/visit-array-positions-to-maximize-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 109 Problem 3"}, {"ID": 2787, "Title": "Ways to Express an Integer as Sum of Powers", "TitleCn": "\u5c06\u4e00\u4e2a\u6570\u5b57\u8868\u793a\u6210\u5e42\u7684\u548c\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/ways-to-express-an-integer-as-sum-of-powers/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 109 Problem 4"}, {"ID": 2788, "Title": "Split Strings by Separator", "TitleCn": "\u6309\u5206\u9694\u7b26\u62c6\u5206\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/split-strings-by-separator/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 355 Problem 1"}, {"ID": 2789, "Title": "Largest Element in an Array after Merge Operations", "TitleCn": "\u5408\u5e76\u540e\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u5143\u7d20", "Url": "https://leetcode.cn/problems/largest-element-in-an-array-after-merge-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 355 Problem 2"}, {"ID": 2790, "Title": "Maximum Number of Groups With Increasing Length", "TitleCn": "\u957f\u5ea6\u9012\u589e\u7ec4\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-groups-with-increasing-length/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 355 Problem 3"}, {"ID": 2791, "Title": "Count Paths That Can Form a Palindrome in a Tree", "TitleCn": "\u6811\u4e2d\u53ef\u4ee5\u5f62\u6210\u56de\u6587\u7684\u8def\u5f84\u6570", "Url": "https://leetcode.cn/problems/count-paths-that-can-form-a-palindrome-in-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 355 Problem 4"}, {"ID": 2792, "Title": "Count Nodes That Are Great Enough", "TitleCn": "\u8ba1\u7b97\u8db3\u591f\u5927\u7684\u8282\u70b9\u6570", "Url": "https://leetcode.cn/problems/count-nodes-that-are-great-enough/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2793, "Title": "Status of Flight Tickets", "TitleCn": "\u822a\u73ed\u673a\u7968\u72b6\u6001", "Url": "https://leetcode.cn/problems/status-of-flight-tickets/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2794, "Title": "Create Object from Two Arrays", "TitleCn": "\u4ece\u4e24\u4e2a\u6570\u7ec4\u4e2d\u521b\u5efa\u5bf9\u8c61", "Url": "https://leetcode.cn/problems/create-object-from-two-arrays/", "Ispaid": 1, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2795, "Title": "Parallel Execution of Promises for Individual Results Retrieval", "TitleCn": "\u5e76\u884c\u6267\u884c Promise \u4ee5\u83b7\u53d6\u72ec\u6709\u7684\u7ed3\u679c", "Url": "https://leetcode.cn/problems/parallel-execution-of-promises-for-individual-results-retrieval/", "Ispaid": 1, "Type": "JavaScript", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2796, "Title": "Repeat String", "TitleCn": "\u91cd\u590d\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/repeat-string/", "Ispaid": 1, "Type": "JavaScript", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2797, "Title": "Partial Function with Placeholders", "TitleCn": "\u5e26\u6709\u5360\u4f4d\u7b26\u7684\u90e8\u5206\u51fd\u6570", "Url": "https://leetcode.cn/problems/partial-function-with-placeholders/", "Ispaid": 1, "Type": "JavaScript", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2798, "Title": "Number of Employees Who Met the Target", "TitleCn": "\u6ee1\u8db3\u76ee\u6807\u5de5\u4f5c\u65f6\u957f\u7684\u5458\u5de5\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-employees-who-met-the-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 356 Problem 1"}, {"ID": 2799, "Title": "Count Complete Subarrays in an Array", "TitleCn": "\u7edf\u8ba1\u5b8c\u5168\u5b50\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-complete-subarrays-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 356 Problem 2"}, {"ID": 2800, "Title": "Shortest String That Contains Three Strings", "TitleCn": "\u5305\u542b\u4e09\u4e2a\u5b57\u7b26\u4e32\u7684\u6700\u77ed\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/shortest-string-that-contains-three-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 356 Problem 3"}, {"ID": 2801, "Title": "Count Stepping Numbers in Range", "TitleCn": "\u7edf\u8ba1\u8303\u56f4\u5185\u7684\u6b65\u8fdb\u6570\u5b57\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-stepping-numbers-in-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 356 Problem 4"}, {"ID": 2802, "Title": "Find The K-th Lucky Number", "TitleCn": "\u627e\u51fa\u7b2c K \u4e2a\u5e78\u8fd0\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-the-k-th-lucky-number/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2803, "Title": "Factorial Generator", "TitleCn": "\u9636\u4e58\u751f\u6210\u5668", "Url": "https://leetcode.cn/problems/factorial-generator/", "Ispaid": 1, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2804, "Title": "Array Prototype ForEach", "TitleCn": "\u6570\u7ec4\u539f\u578b\u7684 forEach \u65b9\u6cd5", "Url": "https://leetcode.cn/problems/array-prototype-foreach/", "Ispaid": 1, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2805, "Title": "Custom Interval", "TitleCn": "\u81ea\u5b9a\u4e49\u95f4\u9694", "Url": "https://leetcode.cn/problems/custom-interval/", "Ispaid": 1, "Type": "JavaScript", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2806, "Title": "Account Balance After Rounded Purchase", "TitleCn": "\u53d6\u6574\u8d2d\u4e70\u540e\u7684\u8d26\u6237\u4f59\u989d", "Url": "https://leetcode.cn/problems/account-balance-after-rounded-purchase/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 110 Problem 1"}, {"ID": 2807, "Title": "Insert Greatest Common Divisors in Linked List", "TitleCn": "\u5728\u94fe\u8868\u4e2d\u63d2\u5165\u6700\u5927\u516c\u7ea6\u6570", "Url": "https://leetcode.cn/problems/insert-greatest-common-divisors-in-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 110 Problem 2"}, {"ID": 2808, "Title": "Minimum Seconds to Equalize a Circular Array", "TitleCn": "\u4f7f\u5faa\u73af\u6570\u7ec4\u6240\u6709\u5143\u7d20\u76f8\u7b49\u7684\u6700\u5c11\u79d2\u6570", "Url": "https://leetcode.cn/problems/minimum-seconds-to-equalize-a-circular-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 110 Problem 3"}, {"ID": 2809, "Title": "Minimum Time to Make Array Sum At Most x", "TitleCn": "\u4f7f\u6570\u7ec4\u548c\u5c0f\u4e8e\u7b49\u4e8e x \u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-make-array-sum-at-most-x/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 110 Problem 4"}, {"ID": 2810, "Title": "Faulty Keyboard", "TitleCn": "\u6545\u969c\u952e\u76d8", "Url": "https://leetcode.cn/problems/faulty-keyboard/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 357 Problem 1"}, {"ID": 2811, "Title": "Check if it is Possible to Split Array", "TitleCn": "\u5224\u65ad\u662f\u5426\u80fd\u62c6\u5206\u6570\u7ec4", "Url": "https://leetcode.cn/problems/check-if-it-is-possible-to-split-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 357 Problem 2"}, {"ID": 2812, "Title": "Find the Safest Path in a Grid", "TitleCn": "\u627e\u51fa\u6700\u5b89\u5168\u8def\u5f84", "Url": "https://leetcode.cn/problems/find-the-safest-path-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 357 Problem 3"}, {"ID": 2813, "Title": "Maximum Elegance of a K-Length Subsequence", "TitleCn": "\u5b50\u5e8f\u5217\u6700\u5927\u4f18\u96c5\u5ea6", "Url": "https://leetcode.cn/problems/maximum-elegance-of-a-k-length-subsequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 357 Problem 4"}, {"ID": 2814, "Title": "Minimum Time Takes to Reach Destination Without Drowning", "TitleCn": "\u907f\u514d\u6df9\u6b7b\u5e76\u5230\u8fbe\u76ee\u7684\u5730\u7684\u6700\u77ed\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-takes-to-reach-destination-without-drowning/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2815, "Title": "Max Pair Sum in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u6570\u5bf9\u548c", "Url": "https://leetcode.cn/problems/max-pair-sum-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 358 Problem 1"}, {"ID": 2816, "Title": "Double a Number Represented as a Linked List", "TitleCn": "\u7ffb\u500d\u4ee5\u94fe\u8868\u5f62\u5f0f\u8868\u793a\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/double-a-number-represented-as-a-linked-list/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 358 Problem 2"}, {"ID": 2817, "Title": "Minimum Absolute Difference Between Elements With Constraint", "TitleCn": "\u9650\u5236\u6761\u4ef6\u4e0b\u5143\u7d20\u4e4b\u95f4\u7684\u6700\u5c0f\u7edd\u5bf9\u5dee", "Url": "https://leetcode.cn/problems/minimum-absolute-difference-between-elements-with-constraint/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 358 Problem 3"}, {"ID": 2818, "Title": "Apply Operations to Maximize Score", "TitleCn": "\u64cd\u4f5c\u4f7f\u5f97\u5206\u6700\u5927", "Url": "https://leetcode.cn/problems/apply-operations-to-maximize-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 358 Problem 4"}, {"ID": 2819, "Title": "Minimum Relative Loss After Buying Chocolates", "TitleCn": "\u8d2d\u4e70\u5de7\u514b\u529b\u540e\u7684\u6700\u5c0f\u76f8\u5bf9\u635f\u5931", "Url": "https://leetcode.cn/problems/minimum-relative-loss-after-buying-chocolates/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2820, "Title": "Election Results", "TitleCn": "\u9009\u4e3e\u7ed3\u679c", "Url": "https://leetcode.cn/problems/election-results/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2821, "Title": "Delay the Resolution of Each Promise", "TitleCn": "\u5ef6\u8fdf\u6bcf\u4e2a Promise \u5bf9\u8c61\u7684\u89e3\u6790", "Url": "https://leetcode.cn/problems/delay-the-resolution-of-each-promise/", "Ispaid": 1, "Type": "JavaScript", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2822, "Title": "Inversion of Object", "TitleCn": "\u5bf9\u8c61\u53cd\u8f6c", "Url": "https://leetcode.cn/problems/inversion-of-object/", "Ispaid": 1, "Type": "JavaScript", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2823, "Title": "Deep Object Filter", "TitleCn": "\u6df1\u5ea6\u5bf9\u8c61\u7b5b\u9009", "Url": "https://leetcode.cn/problems/deep-object-filter/", "Ispaid": 1, "Type": "JavaScript", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2824, "Title": "Count Pairs Whose Sum is Less than Target", "TitleCn": "\u7edf\u8ba1\u548c\u5c0f\u4e8e\u76ee\u6807\u7684\u4e0b\u6807\u5bf9\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-pairs-whose-sum-is-less-than-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 111 Problem 1"}, {"ID": 2825, "Title": "Make String a Subsequence Using Cyclic Increments", "TitleCn": "\u5faa\u73af\u589e\u957f\u4f7f\u5b57\u7b26\u4e32\u5b50\u5e8f\u5217\u7b49\u4e8e\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/make-string-a-subsequence-using-cyclic-increments/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 111 Problem 2"}, {"ID": 2826, "Title": "Sorting Three Groups", "TitleCn": "\u5c06\u4e09\u4e2a\u7ec4\u6392\u5e8f", "Url": "https://leetcode.cn/problems/sorting-three-groups/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 111 Problem 3"}, {"ID": 2827, "Title": "Number of Beautiful Integers in the Range", "TitleCn": "\u8303\u56f4\u4e2d\u7f8e\u4e3d\u6574\u6570\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-beautiful-integers-in-the-range/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 111 Problem 4"}, {"ID": 2828, "Title": "Check if a String Is an Acronym of Words", "TitleCn": "\u5224\u522b\u9996\u5b57\u6bcd\u7f29\u7565\u8bcd", "Url": "https://leetcode.cn/problems/check-if-a-string-is-an-acronym-of-words/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 359 Problem 1"}, {"ID": 2829, "Title": "Determine the Minimum Sum of a k-avoiding Array", "TitleCn": "k-avoiding \u6570\u7ec4\u7684\u6700\u5c0f\u603b\u548c", "Url": "https://leetcode.cn/problems/determine-the-minimum-sum-of-a-k-avoiding-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 359 Problem 2"}, {"ID": 2830, "Title": "Maximize the Profit as the Salesman", "TitleCn": "\u9500\u552e\u5229\u6da6\u6700\u5927\u5316", "Url": "https://leetcode.cn/problems/maximize-the-profit-as-the-salesman/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 359 Problem 3"}, {"ID": 2831, "Title": "Find the Longest Equal Subarray", "TitleCn": "\u627e\u51fa\u6700\u957f\u7b49\u503c\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-the-longest-equal-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 359 Problem 4"}, {"ID": 2832, "Title": "Maximal Range That Each Element Is Maximum in It", "TitleCn": "\u6bcf\u4e2a\u5143\u7d20\u4e3a\u6700\u5927\u503c\u7684\u6700\u5927\u8303\u56f4", "Url": "https://leetcode.cn/problems/maximal-range-that-each-element-is-maximum-in-it/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2833, "Title": "Furthest Point From Origin", "TitleCn": "\u8ddd\u79bb\u539f\u70b9\u6700\u8fdc\u7684\u70b9", "Url": "https://leetcode.cn/problems/furthest-point-from-origin/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 360 Problem 1"}, {"ID": 2834, "Title": "Find the Minimum Possible Sum of a Beautiful Array", "TitleCn": "\u627e\u51fa\u7f8e\u4e3d\u6570\u7ec4\u7684\u6700\u5c0f\u548c", "Url": "https://leetcode.cn/problems/find-the-minimum-possible-sum-of-a-beautiful-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 360 Problem 2"}, {"ID": 2835, "Title": "Minimum Operations to Form Subsequence With Target Sum", "TitleCn": "\u4f7f\u5b50\u5e8f\u5217\u7684\u548c\u7b49\u4e8e\u76ee\u6807\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-form-subsequence-with-target-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 360 Problem 3"}, {"ID": 2836, "Title": "Maximize Value of Function in a Ball Passing Game", "TitleCn": "\u5728\u4f20\u7403\u6e38\u620f\u4e2d\u6700\u5927\u5316\u51fd\u6570\u503c", "Url": "https://leetcode.cn/problems/maximize-value-of-function-in-a-ball-passing-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 360 Problem 4"}, {"ID": 2837, "Title": "Total Traveled Distance", "TitleCn": "\u603b\u65c5\u884c\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/total-traveled-distance/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2838, "Title": "Maximum Coins Heroes Can Collect", "TitleCn": "\u82f1\u96c4\u53ef\u4ee5\u83b7\u5f97\u7684\u6700\u5927\u91d1\u5e01\u6570", "Url": "https://leetcode.cn/problems/maximum-coins-heroes-can-collect/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2839, "Title": "Check if Strings Can be Made Equal With Operations I", "TitleCn": "\u5224\u65ad\u901a\u8fc7\u64cd\u4f5c\u80fd\u5426\u8ba9\u5b57\u7b26\u4e32\u76f8\u7b49 I", "Url": "https://leetcode.cn/problems/check-if-strings-can-be-made-equal-with-operations-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 112 Problem 1"}, {"ID": 2840, "Title": "Check if Strings Can be Made Equal With Operations II", "TitleCn": "\u5224\u65ad\u901a\u8fc7\u64cd\u4f5c\u80fd\u5426\u8ba9\u5b57\u7b26\u4e32\u76f8\u7b49 II", "Url": "https://leetcode.cn/problems/check-if-strings-can-be-made-equal-with-operations-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 112 Problem 2"}, {"ID": 2841, "Title": "Maximum Sum of Almost Unique Subarray", "TitleCn": "\u51e0\u4e4e\u552f\u4e00\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-of-almost-unique-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 112 Problem 3"}, {"ID": 2842, "Title": "Count K-Subsequences of a String With Maximum Beauty", "TitleCn": "\u7edf\u8ba1\u4e00\u4e2a\u5b57\u7b26\u4e32\u7684 k \u5b50\u5e8f\u5217\u7f8e\u4e3d\u503c\u6700\u5927\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-k-subsequences-of-a-string-with-maximum-beauty/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 112 Problem 4"}, {"ID": 2843, "Title": "Count Symmetric Integers", "TitleCn": "\u7edf\u8ba1\u5bf9\u79f0\u6574\u6570\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-symmetric-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 361 Problem 1"}, {"ID": 2844, "Title": "Minimum Operations to Make a Special Number", "TitleCn": "\u751f\u6210\u7279\u6b8a\u6570\u5b57\u7684\u6700\u5c11\u64cd\u4f5c", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-a-special-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 361 Problem 2"}, {"ID": 2845, "Title": "Count of Interesting Subarrays", "TitleCn": "\u7edf\u8ba1\u8da3\u5473\u5b50\u6570\u7ec4\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-of-interesting-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 361 Problem 3"}, {"ID": 2846, "Title": "Minimum Edge Weight Equilibrium Queries in a Tree", "TitleCn": "\u8fb9\u6743\u91cd\u5747\u7b49\u67e5\u8be2", "Url": "https://leetcode.cn/problems/minimum-edge-weight-equilibrium-queries-in-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 361 Problem 4"}, {"ID": 2847, "Title": "Smallest Number With Given Digit Product", "TitleCn": "\u7ed9\u5b9a\u6570\u5b57\u4e58\u79ef\u7684\u6700\u5c0f\u6570\u5b57", "Url": "https://leetcode.cn/problems/smallest-number-with-given-digit-product/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2848, "Title": "Points That Intersect With Cars", "TitleCn": "\u4e0e\u8f66\u76f8\u4ea4\u7684\u70b9", "Url": "https://leetcode.cn/problems/points-that-intersect-with-cars/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 362 Problem 1"}, {"ID": 2849, "Title": "Determine if a Cell Is Reachable at a Given Time", "TitleCn": "\u5224\u65ad\u80fd\u5426\u5728\u7ed9\u5b9a\u65f6\u95f4\u5230\u8fbe\u5355\u5143\u683c", "Url": "https://leetcode.cn/problems/determine-if-a-cell-is-reachable-at-a-given-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 362 Problem 2"}, {"ID": 2850, "Title": "Minimum Moves to Spread Stones Over Grid", "TitleCn": "\u5c06\u77f3\u5934\u5206\u6563\u5230\u7f51\u683c\u56fe\u7684\u6700\u5c11\u79fb\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-moves-to-spread-stones-over-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 362 Problem 3"}, {"ID": 2851, "Title": "String Transformation", "TitleCn": "\u5b57\u7b26\u4e32\u8f6c\u6362", "Url": "https://leetcode.cn/problems/string-transformation/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 362 Problem 4"}, {"ID": 2852, "Title": "Sum of Remoteness of All Cells", "TitleCn": "\u6240\u6709\u5355\u5143\u683c\u7684\u8fdc\u79bb\u7a0b\u5ea6\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-remoteness-of-all-cells/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2853, "Title": "Highest Salaries Difference", "TitleCn": "\u6700\u9ad8\u85aa\u6c34\u5dee\u5f02", "Url": "https://leetcode.cn/problems/highest-salaries-difference/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2854, "Title": "Rolling Average Steps", "TitleCn": "\u6eda\u52a8\u5e73\u5747\u6b65\u6570", "Url": "https://leetcode.cn/problems/rolling-average-steps/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2855, "Title": "Minimum Right Shifts to Sort the Array", "TitleCn": "\u4f7f\u6570\u7ec4\u6210\u4e3a\u9012\u589e\u6570\u7ec4\u7684\u6700\u5c11\u53f3\u79fb\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-right-shifts-to-sort-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 113 Problem 1"}, {"ID": 2856, "Title": "Minimum Array Length After Pair Removals", "TitleCn": "\u5220\u9664\u6570\u5bf9\u540e\u7684\u6700\u5c0f\u6570\u7ec4\u957f\u5ea6", "Url": "https://leetcode.cn/problems/minimum-array-length-after-pair-removals/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 113 Problem 2"}, {"ID": 2857, "Title": "Count Pairs of Points With Distance k", "TitleCn": "\u7edf\u8ba1\u8ddd\u79bb\u4e3a k \u7684\u70b9\u5bf9", "Url": "https://leetcode.cn/problems/count-pairs-of-points-with-distance-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 113 Problem 3"}, {"ID": 2858, "Title": "Minimum Edge Reversals So Every Node Is Reachable", "TitleCn": "\u53ef\u4ee5\u5230\u8fbe\u6bcf\u4e00\u4e2a\u8282\u70b9\u7684\u6700\u5c11\u8fb9\u53cd\u8f6c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-edge-reversals-so-every-node-is-reachable/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 113 Problem 4"}, {"ID": 2859, "Title": "Sum of Values at Indices With K Set Bits", "TitleCn": "\u8ba1\u7b97 K \u7f6e\u4f4d\u4e0b\u6807\u5bf9\u5e94\u5143\u7d20\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-values-at-indices-with-k-set-bits/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 363 Problem 1"}, {"ID": 2860, "Title": "Happy Students", "TitleCn": "\u8ba9\u6240\u6709\u5b66\u751f\u4fdd\u6301\u5f00\u5fc3\u7684\u5206\u7ec4\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/happy-students/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 363 Problem 2"}, {"ID": 2861, "Title": "Maximum Number of Alloys", "TitleCn": "\u6700\u5927\u5408\u91d1\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-alloys/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 363 Problem 3"}, {"ID": 2862, "Title": "Maximum Element-Sum of a Complete Subset of Indices", "TitleCn": "\u5b8c\u5168\u5b50\u96c6\u7684\u6700\u5927\u5143\u7d20\u548c", "Url": "https://leetcode.cn/problems/maximum-element-sum-of-a-complete-subset-of-indices/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 363 Problem 4"}, {"ID": 2863, "Title": "Maximum Length of Semi-Decreasing Subarrays", "TitleCn": "\u6700\u957f\u534a\u9012\u51cf\u5b50\u6570\u7ec4\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/maximum-length-of-semi-decreasing-subarrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2864, "Title": "Maximum Odd Binary Number", "TitleCn": "\u6700\u5927\u4e8c\u8fdb\u5236\u5947\u6570", "Url": "https://leetcode.cn/problems/maximum-odd-binary-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 364 Problem 1"}, {"ID": 2865, "Title": "Beautiful Towers I", "TitleCn": "\u7f8e\u4e3d\u5854 I", "Url": "https://leetcode.cn/problems/beautiful-towers-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 364 Problem 2"}, {"ID": 2866, "Title": "Beautiful Towers II", "TitleCn": "\u7f8e\u4e3d\u5854 II", "Url": "https://leetcode.cn/problems/beautiful-towers-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 364 Problem 3"}, {"ID": 2867, "Title": "Count Valid Paths in a Tree", "TitleCn": "\u7edf\u8ba1\u6811\u4e2d\u7684\u5408\u6cd5\u8def\u5f84\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-valid-paths-in-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 364 Problem 4"}, {"ID": 2868, "Title": "The Wording Game", "TitleCn": "\u5355\u8bcd\u6e38\u620f", "Url": "https://leetcode.cn/problems/the-wording-game/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2869, "Title": "Minimum Operations to Collect Elements", "TitleCn": "\u6536\u96c6\u5143\u7d20\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-collect-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 114 Problem 1"}, {"ID": 2870, "Title": "Minimum Number of Operations to Make Array Empty", "TitleCn": "\u4f7f\u6570\u7ec4\u4e3a\u7a7a\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-array-empty/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 114 Problem 2"}, {"ID": 2871, "Title": "Split Array Into Maximum Number of Subarrays", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u5272\u6210\u6700\u591a\u6570\u76ee\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/split-array-into-maximum-number-of-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 114 Problem 3"}, {"ID": 2872, "Title": "Maximum Number of K-Divisible Components", "TitleCn": "\u53ef\u4ee5\u88ab K \u6574\u9664\u8fde\u901a\u5757\u7684\u6700\u5927\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximum-number-of-k-divisible-components/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 114 Problem 4"}, {"ID": 2873, "Title": "Maximum Value of an Ordered Triplet I", "TitleCn": "\u6709\u5e8f\u4e09\u5143\u7ec4\u4e2d\u7684\u6700\u5927\u503c I", "Url": "https://leetcode.cn/problems/maximum-value-of-an-ordered-triplet-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 365 Problem 1"}, {"ID": 2874, "Title": "Maximum Value of an Ordered Triplet II", "TitleCn": "\u6709\u5e8f\u4e09\u5143\u7ec4\u4e2d\u7684\u6700\u5927\u503c II", "Url": "https://leetcode.cn/problems/maximum-value-of-an-ordered-triplet-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 365 Problem 2"}, {"ID": 2875, "Title": "Minimum Size Subarray in Infinite Array", "TitleCn": "\u65e0\u9650\u6570\u7ec4\u7684\u6700\u77ed\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/minimum-size-subarray-in-infinite-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 365 Problem 3"}, {"ID": 2876, "Title": "Count Visited Nodes in a Directed Graph", "TitleCn": "\u6709\u5411\u56fe\u8bbf\u95ee\u8ba1\u6570", "Url": "https://leetcode.cn/problems/count-visited-nodes-in-a-directed-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 365 Problem 4"}, {"ID": 2877, "Title": "Create a DataFrame from List", "TitleCn": "\u4ece\u8868\u4e2d\u521b\u5efa DataFrame", "Url": "https://leetcode.cn/problems/create-a-dataframe-from-list/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2878, "Title": "Get the Size of a DataFrame", "TitleCn": "\u83b7\u53d6 DataFrame \u7684\u5927\u5c0f", "Url": "https://leetcode.cn/problems/get-the-size-of-a-dataframe/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2879, "Title": "Display the First Three Rows", "TitleCn": "\u663e\u793a\u524d\u4e09\u884c", "Url": "https://leetcode.cn/problems/display-the-first-three-rows/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2880, "Title": "Select Data", "TitleCn": "\u6570\u636e\u9009\u53d6", "Url": "https://leetcode.cn/problems/select-data/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2881, "Title": "Create a New Column", "TitleCn": "\u521b\u5efa\u65b0\u5217", "Url": "https://leetcode.cn/problems/create-a-new-column/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2882, "Title": "Drop Duplicate Rows", "TitleCn": "\u5220\u53bb\u91cd\u590d\u7684\u884c", "Url": "https://leetcode.cn/problems/drop-duplicate-rows/", "Ispaid": 0, "Type": "pandas", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2883, "Title": "Drop Missing Data", "TitleCn": "\u5220\u53bb\u4e22\u5931\u7684\u6570\u636e", "Url": "https://leetcode.cn/problems/drop-missing-data/", "Ispaid": 0, "Type": "pandas", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2884, "Title": "Modify Columns", "TitleCn": "\u4fee\u6539\u5217", "Url": "https://leetcode.cn/problems/modify-columns/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2885, "Title": "Rename Columns", "TitleCn": "\u91cd\u547d\u540d\u5217", "Url": "https://leetcode.cn/problems/rename-columns/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2886, "Title": "Change Data Type", "TitleCn": "\u6539\u53d8\u6570\u636e\u7c7b\u578b", "Url": "https://leetcode.cn/problems/change-data-type/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2887, "Title": "Fill Missing Data", "TitleCn": "\u586b\u5145\u7f3a\u5931\u503c", "Url": "https://leetcode.cn/problems/fill-missing-data/", "Ispaid": 0, "Type": "pandas", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2888, "Title": "Reshape Data: Concatenate", "TitleCn": "\u91cd\u5851\u6570\u636e\uff1a\u8fde\u7ed3", "Url": "https://leetcode.cn/problems/reshape-data-concatenate/", "Ispaid": 0, "Type": "pandas", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2889, "Title": "Reshape Data: Pivot", "TitleCn": "\u6570\u636e\u91cd\u5851\uff1a\u900f\u89c6", "Url": "https://leetcode.cn/problems/reshape-data-pivot/", "Ispaid": 0, "Type": "pandas", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2890, "Title": "Reshape Data: Melt", "TitleCn": "\u91cd\u5851\u6570\u636e\uff1a\u878d\u5408", "Url": "https://leetcode.cn/problems/reshape-data-melt/", "Ispaid": 0, "Type": "pandas", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2891, "Title": "Method Chaining", "TitleCn": "\u65b9\u6cd5\u94fe", "Url": "https://leetcode.cn/problems/method-chaining/", "Ispaid": 0, "Type": "pandas", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2892, "Title": "Minimizing Array After Replacing Pairs With Their Product", "TitleCn": "\u5c06\u76f8\u90bb\u5143\u7d20\u76f8\u4e58\u540e\u5f97\u5230\u6700\u5c0f\u5316\u6570\u7ec4", "Url": "https://leetcode.cn/problems/minimizing-array-after-replacing-pairs-with-their-product/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2893, "Title": "Calculate Orders Within Each Interval", "TitleCn": "\u8ba1\u7b97\u6bcf\u4e2a\u533a\u95f4\u5185\u7684\u8ba2\u5355", "Url": "https://leetcode.cn/problems/calculate-orders-within-each-interval/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2894, "Title": "Divisible and Non-divisible Sums Difference", "TitleCn": "\u5206\u7c7b\u6c42\u548c\u5e76\u4f5c\u5dee", "Url": "https://leetcode.cn/problems/divisible-and-non-divisible-sums-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 366 Problem 1"}, {"ID": 2895, "Title": "Minimum Processing Time", "TitleCn": "\u6700\u5c0f\u5904\u7406\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-processing-time/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 366 Problem 2"}, {"ID": 2896, "Title": "Apply Operations to Make Two Strings Equal", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u4f7f\u4e24\u4e2a\u5b57\u7b26\u4e32\u76f8\u7b49", "Url": "https://leetcode.cn/problems/apply-operations-to-make-two-strings-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 366 Problem 3"}, {"ID": 2897, "Title": "Apply Operations on Array to Maximize Sum of Squares", "TitleCn": "\u5bf9\u6570\u7ec4\u6267\u884c\u64cd\u4f5c\u4f7f\u5e73\u65b9\u548c\u6700\u5927", "Url": "https://leetcode.cn/problems/apply-operations-on-array-to-maximize-sum-of-squares/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 366 Problem 4"}, {"ID": 2898, "Title": "Maximum Linear Stock Score", "TitleCn": "\u6700\u5927\u7ebf\u6027\u80a1\u7968\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-linear-stock-score/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2899, "Title": "Last Visited Integers", "TitleCn": "\u4e0a\u4e00\u4e2a\u904d\u5386\u7684\u6574\u6570", "Url": "https://leetcode.cn/problems/last-visited-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 115 Problem 1"}, {"ID": 2900, "Title": "Longest Unequal Adjacent Groups Subsequence I", "TitleCn": "\u6700\u957f\u76f8\u90bb\u4e0d\u76f8\u7b49\u5b50\u5e8f\u5217 I", "Url": "https://leetcode.cn/problems/longest-unequal-adjacent-groups-subsequence-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 115 Problem 2"}, {"ID": 2901, "Title": "Longest Unequal Adjacent Groups Subsequence II", "TitleCn": "\u6700\u957f\u76f8\u90bb\u4e0d\u76f8\u7b49\u5b50\u5e8f\u5217 II", "Url": "https://leetcode.cn/problems/longest-unequal-adjacent-groups-subsequence-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 115 Problem 3"}, {"ID": 2902, "Title": "Count of Sub-Multisets With Bounded Sum", "TitleCn": "\u548c\u5e26\u9650\u5236\u7684\u5b50\u591a\u91cd\u96c6\u5408\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-of-sub-multisets-with-bounded-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 115 Problem 4"}, {"ID": 2903, "Title": "Find Indices With Index and Value Difference I", "TitleCn": "\u627e\u51fa\u6ee1\u8db3\u5dee\u503c\u6761\u4ef6\u7684\u4e0b\u6807 I", "Url": "https://leetcode.cn/problems/find-indices-with-index-and-value-difference-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 367 Problem 1"}, {"ID": 2904, "Title": "Shortest and Lexicographically Smallest Beautiful String", "TitleCn": "\u6700\u77ed\u4e14\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u7f8e\u4e3d\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/shortest-and-lexicographically-smallest-beautiful-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 367 Problem 2"}, {"ID": 2905, "Title": "Find Indices With Index and Value Difference II", "TitleCn": "\u627e\u51fa\u6ee1\u8db3\u5dee\u503c\u6761\u4ef6\u7684\u4e0b\u6807 II", "Url": "https://leetcode.cn/problems/find-indices-with-index-and-value-difference-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 367 Problem 3"}, {"ID": 2906, "Title": "Construct Product Matrix", "TitleCn": "\u6784\u9020\u4e58\u79ef\u77e9\u9635", "Url": "https://leetcode.cn/problems/construct-product-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 367 Problem 4"}, {"ID": 2907, "Title": "Maximum Profitable Triplets With Increasing Prices I", "TitleCn": "\u4ef7\u683c\u9012\u589e\u7684\u6700\u5927\u5229\u6da6\u4e09\u5143\u7ec4 I", "Url": "https://leetcode.cn/problems/maximum-profitable-triplets-with-increasing-prices-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2908, "Title": "Minimum Sum of Mountain Triplets I", "TitleCn": "\u5143\u7d20\u548c\u6700\u5c0f\u7684\u5c71\u5f62\u4e09\u5143\u7ec4 I", "Url": "https://leetcode.cn/problems/minimum-sum-of-mountain-triplets-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 368 Problem 1"}, {"ID": 2909, "Title": "Minimum Sum of Mountain Triplets II", "TitleCn": "\u5143\u7d20\u548c\u6700\u5c0f\u7684\u5c71\u5f62\u4e09\u5143\u7ec4 II", "Url": "https://leetcode.cn/problems/minimum-sum-of-mountain-triplets-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 368 Problem 2"}, {"ID": 2910, "Title": "Minimum Number of Groups to Create a Valid Assignment", "TitleCn": "\u5408\u6cd5\u5206\u7ec4\u7684\u6700\u5c11\u7ec4\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-groups-to-create-a-valid-assignment/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 368 Problem 3"}, {"ID": 2911, "Title": "Minimum Changes to Make K Semi-palindromes", "TitleCn": "\u5f97\u5230 K \u4e2a\u534a\u56de\u6587\u4e32\u7684\u6700\u5c11\u4fee\u6539\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-changes-to-make-k-semi-palindromes/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 368 Problem 4"}, {"ID": 2912, "Title": "Number of Ways to Reach Destination in the Grid", "TitleCn": "\u5728\u7f51\u683c\u4e0a\u79fb\u52a8\u5230\u76ee\u7684\u5730\u7684\u65b9\u6cd5\u6570", "Url": "https://leetcode.cn/problems/number-of-ways-to-reach-destination-in-the-grid/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2913, "Title": "Subarrays Distinct Element Sum of Squares I", "TitleCn": "\u5b50\u6570\u7ec4\u4e0d\u540c\u5143\u7d20\u6570\u76ee\u7684\u5e73\u65b9\u548c I", "Url": "https://leetcode.cn/problems/subarrays-distinct-element-sum-of-squares-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 116 Problem 1"}, {"ID": 2914, "Title": "Minimum Number of Changes to Make Binary String Beautiful", "TitleCn": "\u4f7f\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u53d8\u7f8e\u4e3d\u7684\u6700\u5c11\u4fee\u6539\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-changes-to-make-binary-string-beautiful/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 116 Problem 2"}, {"ID": 2915, "Title": "Length of the Longest Subsequence That Sums to Target", "TitleCn": "\u548c\u4e3a\u76ee\u6807\u503c\u7684\u6700\u957f\u5b50\u5e8f\u5217\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/length-of-the-longest-subsequence-that-sums-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 116 Problem 3"}, {"ID": 2916, "Title": "Subarrays Distinct Element Sum of Squares II", "TitleCn": "\u5b50\u6570\u7ec4\u4e0d\u540c\u5143\u7d20\u6570\u76ee\u7684\u5e73\u65b9\u548c II", "Url": "https://leetcode.cn/problems/subarrays-distinct-element-sum-of-squares-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 116 Problem 4"}, {"ID": 2917, "Title": "Find the K-or of an Array", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684 K-or \u503c", "Url": "https://leetcode.cn/problems/find-the-k-or-of-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 369 Problem 1"}, {"ID": 2918, "Title": "Minimum Equal Sum of Two Arrays After Replacing Zeros", "TitleCn": "\u6570\u7ec4\u7684\u6700\u5c0f\u76f8\u7b49\u548c", "Url": "https://leetcode.cn/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 369 Problem 2"}, {"ID": 2919, "Title": "Minimum Increment Operations to Make Array Beautiful", "TitleCn": "\u4f7f\u6570\u7ec4\u53d8\u7f8e\u7684\u6700\u5c0f\u589e\u91cf\u8fd0\u7b97\u6570", "Url": "https://leetcode.cn/problems/minimum-increment-operations-to-make-array-beautiful/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 369 Problem 3"}, {"ID": 2920, "Title": "Maximum Points After Collecting Coins From All Nodes", "TitleCn": "\u6536\u96c6\u6240\u6709\u91d1\u5e01\u53ef\u83b7\u5f97\u7684\u6700\u5927\u79ef\u5206", "Url": "https://leetcode.cn/problems/maximum-points-after-collecting-coins-from-all-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 369 Problem 4"}, {"ID": 2921, "Title": "Maximum Profitable Triplets With Increasing Prices II", "TitleCn": "\u4ef7\u683c\u9012\u589e\u7684\u6700\u5927\u5229\u6da6\u4e09\u5143\u7ec4 II", "Url": "https://leetcode.cn/problems/maximum-profitable-triplets-with-increasing-prices-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2922, "Title": "Market Analysis III", "TitleCn": "\u5e02\u573a\u5206\u6790 III", "Url": "https://leetcode.cn/problems/market-analysis-iii/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2923, "Title": "Find Champion I", "TitleCn": "\u627e\u5230\u51a0\u519b I", "Url": "https://leetcode.cn/problems/find-champion-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 370 Problem 1"}, {"ID": 2924, "Title": "Find Champion II", "TitleCn": "\u627e\u5230\u51a0\u519b II", "Url": "https://leetcode.cn/problems/find-champion-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 370 Problem 2"}, {"ID": 2925, "Title": "Maximum Score After Applying Operations on a Tree", "TitleCn": "\u5728\u6811\u4e0a\u6267\u884c\u64cd\u4f5c\u4ee5\u540e\u5f97\u5230\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-score-after-applying-operations-on-a-tree/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 370 Problem 3"}, {"ID": 2926, "Title": "Maximum Balanced Subsequence Sum", "TitleCn": "\u5e73\u8861\u5b50\u5e8f\u5217\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-balanced-subsequence-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 370 Problem 4"}, {"ID": 2927, "Title": "Distribute Candies Among Children III", "TitleCn": "\u7ed9\u5c0f\u670b\u53cb\u4eec\u5206\u7cd6\u679c III", "Url": "https://leetcode.cn/problems/distribute-candies-among-children-iii/", "Ispaid": 1, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2928, "Title": "Distribute Candies Among Children I", "TitleCn": "\u7ed9\u5c0f\u670b\u53cb\u4eec\u5206\u7cd6\u679c I", "Url": "https://leetcode.cn/problems/distribute-candies-among-children-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 117 Problem 1"}, {"ID": 2929, "Title": "Distribute Candies Among Children II", "TitleCn": "\u7ed9\u5c0f\u670b\u53cb\u4eec\u5206\u7cd6\u679c II", "Url": "https://leetcode.cn/problems/distribute-candies-among-children-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 117 Problem 2"}, {"ID": 2930, "Title": "Number of Strings Which Can Be Rearranged to Contain Substring", "TitleCn": "\u91cd\u65b0\u6392\u5217\u540e\u5305\u542b\u6307\u5b9a\u5b50\u5b57\u7b26\u4e32\u7684\u5b57\u7b26\u4e32\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-strings-which-can-be-rearranged-to-contain-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 117 Problem 3"}, {"ID": 2931, "Title": "Maximum Spending After Buying Items", "TitleCn": "\u8d2d\u4e70\u7269\u54c1\u7684\u6700\u5927\u5f00\u9500", "Url": "https://leetcode.cn/problems/maximum-spending-after-buying-items/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 117 Problem 4"}, {"ID": 2932, "Title": "Maximum Strong Pair XOR I", "TitleCn": "\u627e\u51fa\u5f3a\u6570\u5bf9\u7684\u6700\u5927\u5f02\u6216\u503c I", "Url": "https://leetcode.cn/problems/maximum-strong-pair-xor-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 371 Problem 1"}, {"ID": 2933, "Title": "High-Access Employees", "TitleCn": "\u9ad8\u8bbf\u95ee\u5458\u5de5", "Url": "https://leetcode.cn/problems/high-access-employees/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 371 Problem 2"}, {"ID": 2934, "Title": "Minimum Operations to Maximize Last Elements in Arrays", "TitleCn": "\u6700\u5927\u5316\u6570\u7ec4\u672b\u4f4d\u5143\u7d20\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-maximize-last-elements-in-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 371 Problem 3"}, {"ID": 2935, "Title": "Maximum Strong Pair XOR II", "TitleCn": "\u627e\u51fa\u5f3a\u6570\u5bf9\u7684\u6700\u5927\u5f02\u6216\u503c II", "Url": "https://leetcode.cn/problems/maximum-strong-pair-xor-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 371 Problem 4"}, {"ID": 2936, "Title": "Number of Equal Numbers Blocks", "TitleCn": "\u5305\u542b\u76f8\u7b49\u503c\u6570\u5b57\u5757\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-equal-numbers-blocks/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2937, "Title": "Make Three Strings Equal", "TitleCn": "\u4f7f\u4e09\u4e2a\u5b57\u7b26\u4e32\u76f8\u7b49", "Url": "https://leetcode.cn/problems/make-three-strings-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 372 Problem 1"}, {"ID": 2938, "Title": "Separate Black and White Balls", "TitleCn": "\u533a\u5206\u9ed1\u7403\u4e0e\u767d\u7403", "Url": "https://leetcode.cn/problems/separate-black-and-white-balls/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 372 Problem 2"}, {"ID": 2939, "Title": "Maximum Xor Product", "TitleCn": "\u6700\u5927\u5f02\u6216\u4e58\u79ef", "Url": "https://leetcode.cn/problems/maximum-xor-product/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 372 Problem 3"}, {"ID": 2940, "Title": "Find Building Where Alice and Bob Can Meet", "TitleCn": "\u627e\u5230 Alice \u548c Bob \u53ef\u4ee5\u76f8\u9047\u7684\u5efa\u7b51", "Url": "https://leetcode.cn/problems/find-building-where-alice-and-bob-can-meet/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 372 Problem 4"}, {"ID": 2941, "Title": "Maximum GCD-Sum of a Subarray", "TitleCn": "\u5b50\u6570\u7ec4\u7684\u6700\u5927 GCD-Sum", "Url": "https://leetcode.cn/problems/maximum-gcd-sum-of-a-subarray/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2942, "Title": "Find Words Containing Character", "TitleCn": "\u67e5\u627e\u5305\u542b\u7ed9\u5b9a\u5b57\u7b26\u7684\u5355\u8bcd", "Url": "https://leetcode.cn/problems/find-words-containing-character/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 118 Problem 1"}, {"ID": 2943, "Title": "Maximize Area of Square Hole in Grid", "TitleCn": "\u6700\u5927\u5316\u7f51\u683c\u56fe\u4e2d\u6b63\u65b9\u5f62\u7a7a\u6d1e\u7684\u9762\u79ef", "Url": "https://leetcode.cn/problems/maximize-area-of-square-hole-in-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 118 Problem 2"}, {"ID": 2944, "Title": "Minimum Number of Coins for Fruits", "TitleCn": "\u8d2d\u4e70\u6c34\u679c\u9700\u8981\u7684\u6700\u5c11\u91d1\u5e01\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-coins-for-fruits/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 118 Problem 3"}, {"ID": 2945, "Title": "Find Maximum Non-decreasing Array Length", "TitleCn": "\u627e\u5230\u6700\u5927\u975e\u9012\u51cf\u6570\u7ec4\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/find-maximum-non-decreasing-array-length/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 118 Problem 4"}, {"ID": 2946, "Title": "Matrix Similarity After Cyclic Shifts", "TitleCn": "\u5faa\u73af\u79fb\u4f4d\u540e\u7684\u77e9\u9635\u76f8\u4f3c\u68c0\u67e5", "Url": "https://leetcode.cn/problems/matrix-similarity-after-cyclic-shifts/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 373 Problem 1"}, {"ID": 2947, "Title": "Count Beautiful Substrings I", "TitleCn": "\u7edf\u8ba1\u7f8e\u4e3d\u5b50\u5b57\u7b26\u4e32 I", "Url": "https://leetcode.cn/problems/count-beautiful-substrings-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 373 Problem 2"}, {"ID": 2948, "Title": "Make Lexicographically Smallest Array by Swapping Elements", "TitleCn": "\u4ea4\u6362\u5f97\u5230\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u6570\u7ec4", "Url": "https://leetcode.cn/problems/make-lexicographically-smallest-array-by-swapping-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 373 Problem 3"}, {"ID": 2949, "Title": "Count Beautiful Substrings II", "TitleCn": "\u7edf\u8ba1\u7f8e\u4e3d\u5b50\u5b57\u7b26\u4e32 II", "Url": "https://leetcode.cn/problems/count-beautiful-substrings-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 373 Problem 4"}, {"ID": 2950, "Title": "Number of Divisible Substrings", "TitleCn": "\u53ef\u6574\u9664\u5b50\u4e32\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-divisible-substrings/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2951, "Title": "Find the Peaks", "TitleCn": "\u627e\u51fa\u5cf0\u503c", "Url": "https://leetcode.cn/problems/find-the-peaks/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 374 Problem 1"}, {"ID": 2952, "Title": "Minimum Number of Coins to be Added", "TitleCn": "\u9700\u8981\u6dfb\u52a0\u7684\u786c\u5e01\u7684\u6700\u5c0f\u6570\u91cf", "Url": "https://leetcode.cn/problems/minimum-number-of-coins-to-be-added/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 374 Problem 2"}, {"ID": 2953, "Title": "Count Complete Substrings", "TitleCn": "\u7edf\u8ba1\u5b8c\u5168\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/count-complete-substrings/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 374 Problem 3"}, {"ID": 2954, "Title": "Count the Number of Infection Sequences", "TitleCn": "\u7edf\u8ba1\u611f\u5192\u5e8f\u5217\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-infection-sequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 374 Problem 4"}, {"ID": 2955, "Title": "Number of Same-End Substrings", "TitleCn": "\u540c\u7aef\u5b50\u4e32\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-same-end-substrings/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2956, "Title": "Find Common Elements Between Two Arrays", "TitleCn": "\u627e\u5230\u4e24\u4e2a\u6570\u7ec4\u4e2d\u7684\u516c\u5171\u5143\u7d20", "Url": "https://leetcode.cn/problems/find-common-elements-between-two-arrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 119 Problem 1"}, {"ID": 2957, "Title": "Remove Adjacent Almost-Equal Characters", "TitleCn": "\u6d88\u9664\u76f8\u90bb\u8fd1\u4f3c\u76f8\u7b49\u5b57\u7b26", "Url": "https://leetcode.cn/problems/remove-adjacent-almost-equal-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 119 Problem 2"}, {"ID": 2958, "Title": "Length of Longest Subarray With at Most K Frequency", "TitleCn": "\u6700\u591a K \u4e2a\u91cd\u590d\u5143\u7d20\u7684\u6700\u957f\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/length-of-longest-subarray-with-at-most-k-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 119 Problem 3"}, {"ID": 2959, "Title": "Number of Possible Sets of Closing Branches", "TitleCn": "\u5173\u95ed\u5206\u90e8\u7684\u53ef\u884c\u96c6\u5408\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-possible-sets-of-closing-branches/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 119 Problem 4"}, {"ID": 2960, "Title": "Count Tested Devices After Test Operations", "TitleCn": "\u7edf\u8ba1\u5df2\u6d4b\u8bd5\u8bbe\u5907", "Url": "https://leetcode.cn/problems/count-tested-devices-after-test-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 375 Problem 1"}, {"ID": 2961, "Title": "Double Modular Exponentiation", "TitleCn": "\u53cc\u6a21\u5e42\u8fd0\u7b97", "Url": "https://leetcode.cn/problems/double-modular-exponentiation/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 375 Problem 2"}, {"ID": 2962, "Title": "Count Subarrays Where Max Element Appears at Least K Times", "TitleCn": "\u7edf\u8ba1\u6700\u5927\u5143\u7d20\u51fa\u73b0\u81f3\u5c11 K \u6b21\u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/count-subarrays-where-max-element-appears-at-least-k-times/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 375 Problem 3"}, {"ID": 2963, "Title": "Count the Number of Good Partitions", "TitleCn": "\u7edf\u8ba1\u597d\u5206\u5272\u65b9\u6848\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-good-partitions/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 375 Problem 4"}, {"ID": 2964, "Title": "Number of Divisible Triplet Sums", "TitleCn": "\u53ef\u88ab\u6574\u9664\u7684\u4e09\u5143\u7ec4\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-divisible-triplet-sums/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2965, "Title": "Find Missing and Repeated Values", "TitleCn": "\u627e\u51fa\u7f3a\u5931\u548c\u91cd\u590d\u7684\u6570\u5b57", "Url": "https://leetcode.cn/problems/find-missing-and-repeated-values/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 376 Problem 1"}, {"ID": 2966, "Title": "Divide Array Into Arrays With Max Difference", "TitleCn": "\u5212\u5206\u6570\u7ec4\u5e76\u6ee1\u8db3\u6700\u5927\u5dee\u9650\u5236", "Url": "https://leetcode.cn/problems/divide-array-into-arrays-with-max-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 376 Problem 2"}, {"ID": 2967, "Title": "Minimum Cost to Make Array Equalindromic", "TitleCn": "\u4f7f\u6570\u7ec4\u6210\u4e3a\u7b49\u6570\u6570\u7ec4\u7684\u6700\u5c0f\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-to-make-array-equalindromic/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 376 Problem 3"}, {"ID": 2968, "Title": "Apply Operations to Maximize Frequency Score", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u4f7f\u9891\u7387\u5206\u6570\u6700\u5927", "Url": "https://leetcode.cn/problems/apply-operations-to-maximize-frequency-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 376 Problem 4"}, {"ID": 2969, "Title": "Minimum Number of Coins for Fruits II", "TitleCn": "\u8d2d\u4e70\u6c34\u679c\u9700\u8981\u7684\u6700\u5c11\u91d1\u5e01\u6570 II", "Url": "https://leetcode.cn/problems/minimum-number-of-coins-for-fruits-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2970, "Title": "Count the Number of Incremovable Subarrays I", "TitleCn": "\u7edf\u8ba1\u79fb\u9664\u9012\u589e\u5b50\u6570\u7ec4\u7684\u6570\u76ee I", "Url": "https://leetcode.cn/problems/count-the-number-of-incremovable-subarrays-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 120 Problem 1"}, {"ID": 2971, "Title": "Find Polygon With the Largest Perimeter", "TitleCn": "\u627e\u5230\u6700\u5927\u5468\u957f\u7684\u591a\u8fb9\u5f62", "Url": "https://leetcode.cn/problems/find-polygon-with-the-largest-perimeter/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 120 Problem 2"}, {"ID": 2972, "Title": "Count the Number of Incremovable Subarrays II", "TitleCn": "\u7edf\u8ba1\u79fb\u9664\u9012\u589e\u5b50\u6570\u7ec4\u7684\u6570\u76ee II", "Url": "https://leetcode.cn/problems/count-the-number-of-incremovable-subarrays-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 120 Problem 3"}, {"ID": 2973, "Title": "Find Number of Coins to Place in Tree Nodes", "TitleCn": "\u6811\u4e2d\u6bcf\u4e2a\u8282\u70b9\u653e\u7f6e\u7684\u91d1\u5e01\u6570\u76ee", "Url": "https://leetcode.cn/problems/find-number-of-coins-to-place-in-tree-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 120 Problem 4"}, {"ID": 2974, "Title": "Minimum Number Game", "TitleCn": "\u6700\u5c0f\u6570\u5b57\u6e38\u620f", "Url": "https://leetcode.cn/problems/minimum-number-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 377 Problem 1"}, {"ID": 2975, "Title": "Maximum Square Area by Removing Fences From a Field", "TitleCn": "\u79fb\u9664\u6805\u680f\u5f97\u5230\u7684\u6b63\u65b9\u5f62\u7530\u5730\u7684\u6700\u5927\u9762\u79ef", "Url": "https://leetcode.cn/problems/maximum-square-area-by-removing-fences-from-a-field/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 377 Problem 2"}, {"ID": 2976, "Title": "Minimum Cost to Convert String I", "TitleCn": "\u8f6c\u6362\u5b57\u7b26\u4e32\u7684\u6700\u5c0f\u6210\u672c I", "Url": "https://leetcode.cn/problems/minimum-cost-to-convert-string-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 377 Problem 3"}, {"ID": 2977, "Title": "Minimum Cost to Convert String II", "TitleCn": "\u8f6c\u6362\u5b57\u7b26\u4e32\u7684\u6700\u5c0f\u6210\u672c II", "Url": "https://leetcode.cn/problems/minimum-cost-to-convert-string-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 377 Problem 4"}, {"ID": 2978, "Title": "Symmetric Coordinates", "TitleCn": "\u5bf9\u79f0\u5750\u6807", "Url": "https://leetcode.cn/problems/symmetric-coordinates/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2979, "Title": "Most Expensive Item That Can Not Be Bought", "TitleCn": "\u6700\u8d35\u7684\u65e0\u6cd5\u8d2d\u4e70\u7684\u5546\u54c1", "Url": "https://leetcode.cn/problems/most-expensive-item-that-can-not-be-bought/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2980, "Title": "Check if Bitwise OR Has Trailing Zeros", "TitleCn": "\u68c0\u67e5\u6309\u4f4d\u6216\u662f\u5426\u5b58\u5728\u5c3e\u968f\u96f6", "Url": "https://leetcode.cn/problems/check-if-bitwise-or-has-trailing-zeros/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 378 Problem 1"}, {"ID": 2981, "Title": "Find Longest Special Substring That Occurs Thrice I", "TitleCn": "\u627e\u51fa\u51fa\u73b0\u81f3\u5c11\u4e09\u6b21\u7684\u6700\u957f\u7279\u6b8a\u5b50\u5b57\u7b26\u4e32 I", "Url": "https://leetcode.cn/problems/find-longest-special-substring-that-occurs-thrice-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 378 Problem 2"}, {"ID": 2982, "Title": "Find Longest Special Substring That Occurs Thrice II", "TitleCn": "\u627e\u51fa\u51fa\u73b0\u81f3\u5c11\u4e09\u6b21\u7684\u6700\u957f\u7279\u6b8a\u5b50\u5b57\u7b26\u4e32 II", "Url": "https://leetcode.cn/problems/find-longest-special-substring-that-occurs-thrice-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 378 Problem 3"}, {"ID": 2983, "Title": "Palindrome Rearrangement Queries", "TitleCn": "\u56de\u6587\u4e32\u91cd\u65b0\u6392\u5217\u67e5\u8be2", "Url": "https://leetcode.cn/problems/palindrome-rearrangement-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 378 Problem 4"}, {"ID": 2984, "Title": "Find Peak Calling Hours for Each City", "TitleCn": "\u627e\u5230\u6bcf\u5ea7\u57ce\u5e02\u7684\u9ad8\u5cf0\u901a\u8bdd\u65f6\u95f4", "Url": "https://leetcode.cn/problems/find-peak-calling-hours-for-each-city/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2985, "Title": "Calculate Compressed Mean", "TitleCn": "\u8ba1\u7b97\u8ba2\u5355\u5e73\u5747\u5546\u54c1\u6570\u91cf", "Url": "https://leetcode.cn/problems/calculate-compressed-mean/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2986, "Title": "Find Third Transaction", "TitleCn": "\u627e\u5230\u7b2c\u4e09\u7b14\u4ea4\u6613", "Url": "https://leetcode.cn/problems/find-third-transaction/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2987, "Title": "Find Expensive Cities", "TitleCn": "\u5bfb\u627e\u623f\u4ef7\u6700\u8d35\u7684\u57ce\u5e02", "Url": "https://leetcode.cn/problems/find-expensive-cities/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2988, "Title": "Manager of the Largest Department", "TitleCn": "\u6700\u5927\u90e8\u95e8\u7684\u7ecf\u7406", "Url": "https://leetcode.cn/problems/manager-of-the-largest-department/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2989, "Title": "Class Performance", "TitleCn": "\u73ed\u7ea7\u8868\u73b0", "Url": "https://leetcode.cn/problems/class-performance/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2990, "Title": "Loan Types", "TitleCn": "\u8d37\u6b3e\u7c7b\u578b", "Url": "https://leetcode.cn/problems/loan-types/", "Ispaid": 1, "Type": "Database", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 2991, "Title": "Top Three Wineries", "TitleCn": "\u6700\u597d\u7684\u4e09\u5bb6\u9152\u5e84", "Url": "https://leetcode.cn/problems/top-three-wineries/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2992, "Title": "Number of Self-Divisible Permutations", "TitleCn": "\u81ea\u6574\u9664\u6392\u5217\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-self-divisible-permutations/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2993, "Title": "Friday Purchases I", "TitleCn": "\u53d1\u751f\u5728\u5468\u4e94\u7684\u4ea4\u6613 I", "Url": "https://leetcode.cn/problems/friday-purchases-i/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 2994, "Title": "Friday Purchases II", "TitleCn": "\u53d1\u751f\u5728\u5468\u4e94\u7684\u4ea4\u6613 II", "Url": "https://leetcode.cn/problems/friday-purchases-ii/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2995, "Title": "Viewers Turned Streamers", "TitleCn": "\u89c2\u4f17\u53d8\u4e3b\u64ad", "Url": "https://leetcode.cn/problems/viewers-turned-streamers/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 2996, "Title": "Smallest Missing Integer Greater Than Sequential Prefix Sum", "TitleCn": "\u5927\u4e8e\u7b49\u4e8e\u987a\u5e8f\u524d\u7f00\u548c\u7684\u6700\u5c0f\u7f3a\u5931\u6574\u6570", "Url": "https://leetcode.cn/problems/smallest-missing-integer-greater-than-sequential-prefix-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 121 Problem 1"}, {"ID": 2997, "Title": "Minimum Number of Operations to Make Array XOR Equal to K", "TitleCn": "\u4f7f\u6570\u7ec4\u5f02\u6216\u548c\u7b49\u4e8e K \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-array-xor-equal-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 121 Problem 2"}, {"ID": 2998, "Title": "Minimum Number of Operations to Make X and Y Equal", "TitleCn": "\u4f7f X \u548c Y \u76f8\u7b49\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-x-and-y-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 121 Problem 3"}, {"ID": 2999, "Title": "Count the Number of Powerful Integers", "TitleCn": "\u7edf\u8ba1\u5f3a\u5927\u6574\u6570\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-powerful-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 121 Problem 4"}, {"ID": 3000, "Title": "Maximum Area of Longest Diagonal Rectangle", "TitleCn": "\u5bf9\u89d2\u7ebf\u6700\u957f\u7684\u77e9\u5f62\u7684\u9762\u79ef", "Url": "https://leetcode.cn/problems/maximum-area-of-longest-diagonal-rectangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 379 Problem 1"}, {"ID": 3001, "Title": "Minimum Moves to Capture The Queen", "TitleCn": "\u6355\u83b7\u9ed1\u7687\u540e\u9700\u8981\u7684\u6700\u5c11\u79fb\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-moves-to-capture-the-queen/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 379 Problem 2"}, {"ID": 3002, "Title": "Maximum Size of a Set After Removals", "TitleCn": "\u79fb\u9664\u540e\u96c6\u5408\u7684\u6700\u591a\u5143\u7d20\u6570", "Url": "https://leetcode.cn/problems/maximum-size-of-a-set-after-removals/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 379 Problem 3"}, {"ID": 3003, "Title": "Maximize the Number of Partitions After Operations", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5206\u5272\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximize-the-number-of-partitions-after-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 379 Problem 4"}, {"ID": 3004, "Title": "Maximum Subtree of the Same Color", "TitleCn": "\u76f8\u540c\u989c\u8272\u7684\u6700\u5927\u5b50\u6811", "Url": "https://leetcode.cn/problems/maximum-subtree-of-the-same-color/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3005, "Title": "Count Elements With Maximum Frequency", "TitleCn": "\u6700\u5927\u9891\u7387\u5143\u7d20\u8ba1\u6570", "Url": "https://leetcode.cn/problems/count-elements-with-maximum-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 380 Problem 1"}, {"ID": 3006, "Title": "Find Beautiful Indices in the Given Array I", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u7f8e\u4e3d\u4e0b\u6807 I", "Url": "https://leetcode.cn/problems/find-beautiful-indices-in-the-given-array-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 380 Problem 2"}, {"ID": 3007, "Title": "Maximum Number That Sum of the Prices Is Less Than or Equal to K", "TitleCn": "\u4ef7\u503c\u548c\u5c0f\u4e8e\u7b49\u4e8e K \u7684\u6700\u5927\u6570\u5b57", "Url": "https://leetcode.cn/problems/maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 380 Problem 3"}, {"ID": 3008, "Title": "Find Beautiful Indices in the Given Array II", "TitleCn": "\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u7f8e\u4e3d\u4e0b\u6807 II", "Url": "https://leetcode.cn/problems/find-beautiful-indices-in-the-given-array-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 380 Problem 4"}, {"ID": 3009, "Title": "Maximum Number of Intersections on the Chart", "TitleCn": "\u6298\u7ebf\u56fe\u4e0a\u7684\u6700\u5927\u4ea4\u70b9\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-intersections-on-the-chart/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3010, "Title": "Divide an Array Into Subarrays With Minimum Cost I", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u6210\u6700\u5c0f\u603b\u4ee3\u4ef7\u7684\u5b50\u6570\u7ec4 I", "Url": "https://leetcode.cn/problems/divide-an-array-into-subarrays-with-minimum-cost-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 122 Problem 1"}, {"ID": 3011, "Title": "Find if Array Can Be Sorted", "TitleCn": "\u5224\u65ad\u4e00\u4e2a\u6570\u7ec4\u662f\u5426\u53ef\u4ee5\u53d8\u4e3a\u6709\u5e8f", "Url": "https://leetcode.cn/problems/find-if-array-can-be-sorted/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 122 Problem 2"}, {"ID": 3012, "Title": "Minimize Length of Array Using Operations", "TitleCn": "\u901a\u8fc7\u64cd\u4f5c\u4f7f\u6570\u7ec4\u957f\u5ea6\u6700\u5c0f", "Url": "https://leetcode.cn/problems/minimize-length-of-array-using-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 122 Problem 3"}, {"ID": 3013, "Title": "Divide an Array Into Subarrays With Minimum Cost II", "TitleCn": "\u5c06\u6570\u7ec4\u5206\u6210\u6700\u5c0f\u603b\u4ee3\u4ef7\u7684\u5b50\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/divide-an-array-into-subarrays-with-minimum-cost-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 122 Problem 4"}, {"ID": 3014, "Title": "Minimum Number of Pushes to Type Word I", "TitleCn": "\u8f93\u5165\u5355\u8bcd\u9700\u8981\u7684\u6700\u5c11\u6309\u952e\u6b21\u6570 I", "Url": "https://leetcode.cn/problems/minimum-number-of-pushes-to-type-word-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 381 Problem 1"}, {"ID": 3015, "Title": "Count the Number of Houses at a Certain Distance I", "TitleCn": "\u6309\u8ddd\u79bb\u7edf\u8ba1\u623f\u5c4b\u5bf9\u6570\u76ee I", "Url": "https://leetcode.cn/problems/count-the-number-of-houses-at-a-certain-distance-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 381 Problem 2"}, {"ID": 3016, "Title": "Minimum Number of Pushes to Type Word II", "TitleCn": "\u8f93\u5165\u5355\u8bcd\u9700\u8981\u7684\u6700\u5c11\u6309\u952e\u6b21\u6570 II", "Url": "https://leetcode.cn/problems/minimum-number-of-pushes-to-type-word-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 381 Problem 3"}, {"ID": 3017, "Title": "Count the Number of Houses at a Certain Distance II", "TitleCn": "\u6309\u8ddd\u79bb\u7edf\u8ba1\u623f\u5c4b\u5bf9\u6570\u76ee II", "Url": "https://leetcode.cn/problems/count-the-number-of-houses-at-a-certain-distance-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 381 Problem 4"}, {"ID": 3018, "Title": "Maximum Number of Removal Queries That Can Be Processed I", "TitleCn": "\u53ef\u5904\u7406\u7684\u6700\u5927\u5220\u9664\u64cd\u4f5c\u6570 I", "Url": "https://leetcode.cn/problems/maximum-number-of-removal-queries-that-can-be-processed-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3019, "Title": "Number of Changing Keys", "TitleCn": "\u6309\u952e\u53d8\u66f4\u7684\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-changing-keys/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 382 Problem 1"}, {"ID": 3020, "Title": "Find the Maximum Number of Elements in Subset", "TitleCn": "\u5b50\u96c6\u4e2d\u5143\u7d20\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/find-the-maximum-number-of-elements-in-subset/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 382 Problem 2"}, {"ID": 3021, "Title": "Alice and Bob Playing Flower Game", "TitleCn": "Alice \u548c Bob \u73a9\u9c9c\u82b1\u6e38\u620f", "Url": "https://leetcode.cn/problems/alice-and-bob-playing-flower-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 382 Problem 3"}, {"ID": 3022, "Title": "Minimize OR of Remaining Elements Using Operations", "TitleCn": "\u7ed9\u5b9a\u64cd\u4f5c\u6b21\u6570\u5185\u4f7f\u5269\u4f59\u5143\u7d20\u7684\u6216\u503c\u6700\u5c0f", "Url": "https://leetcode.cn/problems/minimize-or-of-remaining-elements-using-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 382 Problem 4"}, {"ID": 3023, "Title": "Find Pattern in Infinite Stream I", "TitleCn": "\u5728\u65e0\u9650\u6d41\u4e2d\u5bfb\u627e\u6a21\u5f0f I", "Url": "https://leetcode.cn/problems/find-pattern-in-infinite-stream-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3024, "Title": "Type of Triangle", "TitleCn": "\u4e09\u89d2\u5f62\u7c7b\u578b", "Url": "https://leetcode.cn/problems/type-of-triangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 123 Problem 1"}, {"ID": 3025, "Title": "Find the Number of Ways to Place People I", "TitleCn": "\u4eba\u5458\u7ad9\u4f4d\u7684\u65b9\u6848\u6570 I", "Url": "https://leetcode.cn/problems/find-the-number-of-ways-to-place-people-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 123 Problem 2"}, {"ID": 3026, "Title": "Maximum Good Subarray Sum", "TitleCn": "\u6700\u5927\u597d\u5b50\u6570\u7ec4\u548c", "Url": "https://leetcode.cn/problems/maximum-good-subarray-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 123 Problem 3"}, {"ID": 3027, "Title": "Find the Number of Ways to Place People II", "TitleCn": "\u4eba\u5458\u7ad9\u4f4d\u7684\u65b9\u6848\u6570 II", "Url": "https://leetcode.cn/problems/find-the-number-of-ways-to-place-people-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 123 Problem 4"}, {"ID": 3028, "Title": "Ant on the Boundary", "TitleCn": "\u8fb9\u754c\u4e0a\u7684\u8682\u8681", "Url": "https://leetcode.cn/problems/ant-on-the-boundary/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 383 Problem 1"}, {"ID": 3029, "Title": "Minimum Time to Revert Word to Initial State I", "TitleCn": "\u5c06\u5355\u8bcd\u6062\u590d\u521d\u59cb\u72b6\u6001\u6240\u9700\u7684\u6700\u77ed\u65f6\u95f4 I", "Url": "https://leetcode.cn/problems/minimum-time-to-revert-word-to-initial-state-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 383 Problem 2"}, {"ID": 3030, "Title": "Find the Grid of Region Average", "TitleCn": "\u627e\u51fa\u7f51\u683c\u7684\u533a\u57df\u5e73\u5747\u5f3a\u5ea6", "Url": "https://leetcode.cn/problems/find-the-grid-of-region-average/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 383 Problem 3"}, {"ID": 3031, "Title": "Minimum Time to Revert Word to Initial State II", "TitleCn": "\u5c06\u5355\u8bcd\u6062\u590d\u521d\u59cb\u72b6\u6001\u6240\u9700\u7684\u6700\u77ed\u65f6\u95f4 II", "Url": "https://leetcode.cn/problems/minimum-time-to-revert-word-to-initial-state-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 383 Problem 4"}, {"ID": 3032, "Title": "Count Numbers With Unique Digits II", "TitleCn": "\u7edf\u8ba1\u5404\u4f4d\u6570\u5b57\u90fd\u4e0d\u540c\u7684\u6570\u5b57\u4e2a\u6570 II", "Url": "https://leetcode.cn/problems/count-numbers-with-unique-digits-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3033, "Title": "Modify the Matrix", "TitleCn": "\u4fee\u6539\u77e9\u9635", "Url": "https://leetcode.cn/problems/modify-the-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 384 Problem 1"}, {"ID": 3034, "Title": "Number of Subarrays That Match a Pattern I", "TitleCn": "\u5339\u914d\u6a21\u5f0f\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u6570\u76ee I", "Url": "https://leetcode.cn/problems/number-of-subarrays-that-match-a-pattern-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 384 Problem 2"}, {"ID": 3035, "Title": "Maximum Palindromes After Operations", "TitleCn": "\u56de\u6587\u5b57\u7b26\u4e32\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-palindromes-after-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 384 Problem 3"}, {"ID": 3036, "Title": "Number of Subarrays That Match a Pattern II", "TitleCn": "\u5339\u914d\u6a21\u5f0f\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u6570\u76ee II", "Url": "https://leetcode.cn/problems/number-of-subarrays-that-match-a-pattern-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 384 Problem 4"}, {"ID": 3037, "Title": "Find Pattern in Infinite Stream II", "TitleCn": "\u5728\u65e0\u9650\u6d41\u4e2d\u5bfb\u627e\u6a21\u5f0f II", "Url": "https://leetcode.cn/problems/find-pattern-in-infinite-stream-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3038, "Title": "Maximum Number of Operations With the Same Score I", "TitleCn": "\u76f8\u540c\u5206\u6570\u7684\u6700\u5927\u64cd\u4f5c\u6570\u76ee I", "Url": "https://leetcode.cn/problems/maximum-number-of-operations-with-the-same-score-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 124 Problem 1"}, {"ID": 3039, "Title": "Apply Operations to Make String Empty", "TitleCn": "\u8fdb\u884c\u64cd\u4f5c\u4f7f\u5b57\u7b26\u4e32\u4e3a\u7a7a", "Url": "https://leetcode.cn/problems/apply-operations-to-make-string-empty/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 124 Problem 2"}, {"ID": 3040, "Title": "Maximum Number of Operations With the Same Score II", "TitleCn": "\u76f8\u540c\u5206\u6570\u7684\u6700\u5927\u64cd\u4f5c\u6570\u76ee II", "Url": "https://leetcode.cn/problems/maximum-number-of-operations-with-the-same-score-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 124 Problem 3"}, {"ID": 3041, "Title": "Maximize Consecutive Elements in an Array After Modification", "TitleCn": "\u4fee\u6539\u6570\u7ec4\u540e\u6700\u5927\u5316\u6570\u7ec4\u4e2d\u7684\u8fde\u7eed\u5143\u7d20\u6570\u76ee", "Url": "https://leetcode.cn/problems/maximize-consecutive-elements-in-an-array-after-modification/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 124 Problem 4"}, {"ID": 3042, "Title": "Count Prefix and Suffix Pairs I", "TitleCn": "\u7edf\u8ba1\u524d\u540e\u7f00\u4e0b\u6807\u5bf9 I", "Url": "https://leetcode.cn/problems/count-prefix-and-suffix-pairs-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 385 Problem 1"}, {"ID": 3043, "Title": "Find the Length of the Longest Common Prefix", "TitleCn": "\u6700\u957f\u516c\u5171\u524d\u7f00\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/find-the-length-of-the-longest-common-prefix/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 385 Problem 2"}, {"ID": 3044, "Title": "Most Frequent Prime", "TitleCn": "\u51fa\u73b0\u9891\u7387\u6700\u9ad8\u7684\u8d28\u6570", "Url": "https://leetcode.cn/problems/most-frequent-prime/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 385 Problem 3"}, {"ID": 3045, "Title": "Count Prefix and Suffix Pairs II", "TitleCn": "\u7edf\u8ba1\u524d\u540e\u7f00\u4e0b\u6807\u5bf9 II", "Url": "https://leetcode.cn/problems/count-prefix-and-suffix-pairs-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 385 Problem 4"}, {"ID": 3046, "Title": "Split the Array", "TitleCn": "\u5206\u5272\u6570\u7ec4", "Url": "https://leetcode.cn/problems/split-the-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 386 Problem 1"}, {"ID": 3047, "Title": "Find the Largest Area of Square Inside Two Rectangles", "TitleCn": "\u6c42\u4ea4\u96c6\u533a\u57df\u5185\u7684\u6700\u5927\u6b63\u65b9\u5f62\u9762\u79ef", "Url": "https://leetcode.cn/problems/find-the-largest-area-of-square-inside-two-rectangles/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 386 Problem 2"}, {"ID": 3048, "Title": "Earliest Second to Mark Indices I", "TitleCn": "\u6807\u8bb0\u6240\u6709\u4e0b\u6807\u7684\u6700\u65e9\u79d2\u6570 I", "Url": "https://leetcode.cn/problems/earliest-second-to-mark-indices-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 386 Problem 3"}, {"ID": 3049, "Title": "Earliest Second to Mark Indices II", "TitleCn": "\u6807\u8bb0\u6240\u6709\u4e0b\u6807\u7684\u6700\u65e9\u79d2\u6570 II", "Url": "https://leetcode.cn/problems/earliest-second-to-mark-indices-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 386 Problem 4"}, {"ID": 3050, "Title": "Pizza Toppings Cost Analysis", "TitleCn": "\u62ab\u8428\u914d\u6599\u6210\u672c\u5206\u6790", "Url": "https://leetcode.cn/problems/pizza-toppings-cost-analysis/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3051, "Title": "Find Candidates for Data Scientist Position", "TitleCn": "\u5bfb\u627e\u6570\u636e\u79d1\u5b66\u5bb6\u804c\u4f4d\u7684\u5019\u9009\u4eba", "Url": "https://leetcode.cn/problems/find-candidates-for-data-scientist-position/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3052, "Title": "Maximize Items", "TitleCn": "\u6700\u5927\u5316\u5546\u54c1", "Url": "https://leetcode.cn/problems/maximize-items/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3053, "Title": "Classifying Triangles by Lengths", "TitleCn": "\u6839\u636e\u957f\u5ea6\u5206\u7c7b\u4e09\u89d2\u5f62", "Url": "https://leetcode.cn/problems/classifying-triangles-by-lengths/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3054, "Title": "Binary Tree Nodes", "TitleCn": "\u4e8c\u53c9\u6811\u8282\u70b9", "Url": "https://leetcode.cn/problems/binary-tree-nodes/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3055, "Title": "Top Percentile Fraud", "TitleCn": "\u6700\u9ad8\u6b3a\u8bc8\u767e\u5206\u4f4d\u6570", "Url": "https://leetcode.cn/problems/top-percentile-fraud/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3056, "Title": "Snaps Analysis", "TitleCn": "\u5feb\u7167\u5206\u6790", "Url": "https://leetcode.cn/problems/snaps-analysis/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3057, "Title": "Employees Project Allocation", "TitleCn": "\u5458\u5de5\u9879\u76ee\u5206\u914d", "Url": "https://leetcode.cn/problems/employees-project-allocation/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3058, "Title": "Friends With No Mutual Friends", "TitleCn": "\u6ca1\u6709\u5171\u540c\u670b\u53cb\u7684\u670b\u53cb", "Url": "https://leetcode.cn/problems/friends-with-no-mutual-friends/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3059, "Title": "Find All Unique Email Domains", "TitleCn": "\u627e\u5230\u6240\u6709\u4e0d\u540c\u7684\u90ae\u4ef6\u57df\u540d", "Url": "https://leetcode.cn/problems/find-all-unique-email-domains/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3060, "Title": "User Activities within Time Bounds", "TitleCn": "\u65f6\u95f4\u8303\u56f4\u5185\u7684\u7528\u6237\u6d3b\u52a8", "Url": "https://leetcode.cn/problems/user-activities-within-time-bounds/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3061, "Title": "Calculate Trapping Rain Water", "TitleCn": "\u8ba1\u7b97\u6ede\u7559\u96e8\u6c34", "Url": "https://leetcode.cn/problems/calculate-trapping-rain-water/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3062, "Title": "Winner of the Linked List Game", "TitleCn": "\u94fe\u8868\u6e38\u620f\u7684\u83b7\u80dc\u8005", "Url": "https://leetcode.cn/problems/winner-of-the-linked-list-game/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3063, "Title": "Linked List Frequency", "TitleCn": "\u94fe\u8868\u9891\u7387", "Url": "https://leetcode.cn/problems/linked-list-frequency/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3064, "Title": "Guess the Number Using Bitwise Questions I", "TitleCn": "\u4f7f\u7528\u6309\u4f4d\u67e5\u8be2\u731c\u6d4b\u6570\u5b57 I", "Url": "https://leetcode.cn/problems/guess-the-number-using-bitwise-questions-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3065, "Title": "Minimum Operations to Exceed Threshold Value I", "TitleCn": "\u8d85\u8fc7\u9608\u503c\u7684\u6700\u5c11\u64cd\u4f5c\u6570 I", "Url": "https://leetcode.cn/problems/minimum-operations-to-exceed-threshold-value-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 125 Problem 1"}, {"ID": 3066, "Title": "Minimum Operations to Exceed Threshold Value II", "TitleCn": "\u8d85\u8fc7\u9608\u503c\u7684\u6700\u5c11\u64cd\u4f5c\u6570 II", "Url": "https://leetcode.cn/problems/minimum-operations-to-exceed-threshold-value-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 125 Problem 2"}, {"ID": 3067, "Title": "Count Pairs of Connectable Servers in a Weighted Tree Network", "TitleCn": "\u5728\u5e26\u6743\u6811\u7f51\u7edc\u4e2d\u7edf\u8ba1\u53ef\u8fde\u63a5\u670d\u52a1\u5668\u5bf9\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-pairs-of-connectable-servers-in-a-weighted-tree-network/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 125 Problem 3"}, {"ID": 3068, "Title": "Find the Maximum Sum of Node Values", "TitleCn": "\u6700\u5927\u8282\u70b9\u4ef7\u503c\u4e4b\u548c", "Url": "https://leetcode.cn/problems/find-the-maximum-sum-of-node-values/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 125 Problem 4"}, {"ID": 3069, "Title": "Distribute Elements Into Two Arrays I", "TitleCn": "\u5c06\u5143\u7d20\u5206\u914d\u5230\u4e24\u4e2a\u6570\u7ec4\u4e2d I", "Url": "https://leetcode.cn/problems/distribute-elements-into-two-arrays-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 387 Problem 1"}, {"ID": 3070, "Title": "Count Submatrices with Top-Left Element and Sum Less Than k", "TitleCn": "\u5143\u7d20\u548c\u5c0f\u4e8e\u7b49\u4e8e k \u7684\u5b50\u77e9\u9635\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-submatrices-with-top-left-element-and-sum-less-than-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 387 Problem 2"}, {"ID": 3071, "Title": "Minimum Operations to Write the Letter Y on a Grid", "TitleCn": "\u5728\u77e9\u9635\u4e0a\u5199\u51fa\u5b57\u6bcd Y \u6240\u9700\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-write-the-letter-y-on-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 387 Problem 3"}, {"ID": 3072, "Title": "Distribute Elements Into Two Arrays II", "TitleCn": "\u5c06\u5143\u7d20\u5206\u914d\u5230\u4e24\u4e2a\u6570\u7ec4\u4e2d II", "Url": "https://leetcode.cn/problems/distribute-elements-into-two-arrays-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 387 Problem 4"}, {"ID": 3073, "Title": "Maximum Increasing Triplet Value", "TitleCn": "\u6700\u5927\u9012\u589e\u4e09\u5143\u7ec4", "Url": "https://leetcode.cn/problems/maximum-increasing-triplet-value/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3074, "Title": "Apple Redistribution into Boxes", "TitleCn": "\u91cd\u65b0\u5206\u88c5\u82f9\u679c", "Url": "https://leetcode.cn/problems/apple-redistribution-into-boxes/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 388 Problem 1"}, {"ID": 3075, "Title": "Maximize Happiness of Selected Children", "TitleCn": "\u5e78\u798f\u503c\u6700\u5927\u5316\u7684\u9009\u62e9\u65b9\u6848", "Url": "https://leetcode.cn/problems/maximize-happiness-of-selected-children/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 388 Problem 2"}, {"ID": 3076, "Title": "Shortest Uncommon Substring in an Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684\u6700\u77ed\u975e\u516c\u5171\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/shortest-uncommon-substring-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 388 Problem 3"}, {"ID": 3077, "Title": "Maximum Strength of K Disjoint Subarrays", "TitleCn": "K \u4e2a\u4e0d\u76f8\u4ea4\u5b50\u6570\u7ec4\u7684\u6700\u5927\u80fd\u91cf\u503c", "Url": "https://leetcode.cn/problems/maximum-strength-of-k-disjoint-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 388 Problem 4"}, {"ID": 3078, "Title": "Match Alphanumerical Pattern in Matrix I", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u5b57\u6bcd\u6570\u5b57\u6a21\u5f0f\u5339\u914d I", "Url": "https://leetcode.cn/problems/match-alphanumerical-pattern-in-matrix-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3079, "Title": "Find the Sum of Encrypted Integers", "TitleCn": "\u6c42\u51fa\u52a0\u5bc6\u6574\u6570\u7684\u548c", "Url": "https://leetcode.cn/problems/find-the-sum-of-encrypted-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 126 Problem 1"}, {"ID": 3080, "Title": "Mark Elements on Array by Performing Queries", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u6807\u8bb0\u6570\u7ec4\u4e2d\u7684\u5143\u7d20", "Url": "https://leetcode.cn/problems/mark-elements-on-array-by-performing-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 126 Problem 2"}, {"ID": 3081, "Title": "Replace Question Marks in String to Minimize Its Value", "TitleCn": "\u66ff\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u95ee\u53f7\u4f7f\u5206\u6570\u6700\u5c0f", "Url": "https://leetcode.cn/problems/replace-question-marks-in-string-to-minimize-its-value/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 126 Problem 3"}, {"ID": 3082, "Title": "Find the Sum of the Power of All Subsequences", "TitleCn": "\u6c42\u51fa\u6240\u6709\u5b50\u5e8f\u5217\u7684\u80fd\u91cf\u548c", "Url": "https://leetcode.cn/problems/find-the-sum-of-the-power-of-all-subsequences/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 126 Problem 4"}, {"ID": 3083, "Title": "Existence of a Substring in a String and Its Reverse", "TitleCn": "\u5b57\u7b26\u4e32\u53ca\u5176\u53cd\u8f6c\u4e2d\u662f\u5426\u5b58\u5728\u540c\u4e00\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/existence-of-a-substring-in-a-string-and-its-reverse/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 389 Problem 1"}, {"ID": 3084, "Title": "Count Substrings Starting and Ending with Given Character", "TitleCn": "\u7edf\u8ba1\u4ee5\u7ed9\u5b9a\u5b57\u7b26\u5f00\u5934\u548c\u7ed3\u5c3e\u7684\u5b50\u5b57\u7b26\u4e32\u603b\u6570", "Url": "https://leetcode.cn/problems/count-substrings-starting-and-ending-with-given-character/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 389 Problem 2"}, {"ID": 3085, "Title": "Minimum Deletions to Make String K-Special", "TitleCn": "\u6210\u4e3a K \u7279\u6b8a\u5b57\u7b26\u4e32\u9700\u8981\u5220\u9664\u7684\u6700\u5c11\u5b57\u7b26\u6570", "Url": "https://leetcode.cn/problems/minimum-deletions-to-make-string-k-special/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 389 Problem 3"}, {"ID": 3086, "Title": "Minimum Moves to Pick K Ones", "TitleCn": "\u62fe\u8d77 K \u4e2a 1 \u9700\u8981\u7684\u6700\u5c11\u884c\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-moves-to-pick-k-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 389 Problem 4"}, {"ID": 3087, "Title": "Find Trending Hashtags", "TitleCn": "\u67e5\u627e\u70ed\u95e8\u8bdd\u9898\u6807\u7b7e", "Url": "https://leetcode.cn/problems/find-trending-hashtags/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3088, "Title": "Make String Anti-palindrome", "TitleCn": "\u4f7f\u5b57\u7b26\u4e32\u53cd\u56de\u6587", "Url": "https://leetcode.cn/problems/make-string-anti-palindrome/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3089, "Title": "Find Bursty Behavior", "TitleCn": "\u67e5\u627e\u7a81\u53d1\u884c\u4e3a", "Url": "https://leetcode.cn/problems/find-bursty-behavior/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3090, "Title": "Maximum Length Substring With Two Occurrences", "TitleCn": "\u6bcf\u4e2a\u5b57\u7b26\u6700\u591a\u51fa\u73b0\u4e24\u6b21\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/maximum-length-substring-with-two-occurrences/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 390 Problem 1"}, {"ID": 3091, "Title": "Apply Operations to Make Sum of Array Greater Than or Equal to k", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u4f7f\u6570\u636e\u5143\u7d20\u4e4b\u548c\u5927\u4e8e\u7b49\u4e8e K", "Url": "https://leetcode.cn/problems/apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 390 Problem 2"}, {"ID": 3092, "Title": "Most Frequent IDs", "TitleCn": "\u6700\u9ad8\u9891\u7387\u7684 ID", "Url": "https://leetcode.cn/problems/most-frequent-ids/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 390 Problem 3"}, {"ID": 3093, "Title": "Longest Common Suffix Queries", "TitleCn": "\u6700\u957f\u516c\u5171\u540e\u7f00\u67e5\u8be2", "Url": "https://leetcode.cn/problems/longest-common-suffix-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 390 Problem 4"}, {"ID": 3094, "Title": "Guess the Number Using Bitwise Questions II", "TitleCn": "\u4f7f\u7528\u6309\u4f4d\u67e5\u8be2\u731c\u6d4b\u6570\u5b57 II", "Url": "https://leetcode.cn/problems/guess-the-number-using-bitwise-questions-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3095, "Title": "Shortest Subarray With OR at Least K I", "TitleCn": "\u6216\u503c\u81f3\u5c11 K \u7684\u6700\u77ed\u5b50\u6570\u7ec4 I", "Url": "https://leetcode.cn/problems/shortest-subarray-with-or-at-least-k-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 127 Problem 1"}, {"ID": 3096, "Title": "Minimum Levels to Gain More Points", "TitleCn": "\u5f97\u5230\u66f4\u591a\u5206\u6570\u7684\u6700\u5c11\u5173\u5361\u6570\u76ee", "Url": "https://leetcode.cn/problems/minimum-levels-to-gain-more-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 127 Problem 2"}, {"ID": 3097, "Title": "Shortest Subarray With OR at Least K II", "TitleCn": "\u6216\u503c\u81f3\u5c11\u4e3a K \u7684\u6700\u77ed\u5b50\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/shortest-subarray-with-or-at-least-k-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 127 Problem 3"}, {"ID": 3098, "Title": "Find the Sum of Subsequence Powers", "TitleCn": "\u6c42\u51fa\u6240\u6709\u5b50\u5e8f\u5217\u7684\u80fd\u91cf\u548c", "Url": "https://leetcode.cn/problems/find-the-sum-of-subsequence-powers/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 127 Problem 4"}, {"ID": 3099, "Title": "Harshad Number", "TitleCn": "\u54c8\u6c99\u5fb7\u6570", "Url": "https://leetcode.cn/problems/harshad-number/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 391 Problem 1"}, {"ID": 3100, "Title": "Water Bottles II", "TitleCn": "\u6362\u6c34\u95ee\u9898 II", "Url": "https://leetcode.cn/problems/water-bottles-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 391 Problem 2"}, {"ID": 3101, "Title": "Count Alternating Subarrays", "TitleCn": "\u4ea4\u66ff\u5b50\u6570\u7ec4\u8ba1\u6570", "Url": "https://leetcode.cn/problems/count-alternating-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 391 Problem 3"}, {"ID": 3102, "Title": "Minimize Manhattan Distances", "TitleCn": "\u6700\u5c0f\u5316\u66fc\u54c8\u987f\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/minimize-manhattan-distances/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 391 Problem 4"}, {"ID": 3103, "Title": "Find Trending Hashtags II", "TitleCn": "\u67e5\u627e\u70ed\u95e8\u8bdd\u9898\u6807\u7b7e II", "Url": "https://leetcode.cn/problems/find-trending-hashtags-ii/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3104, "Title": "Find Longest Self-Contained Substring", "TitleCn": "\u67e5\u627e\u6700\u957f\u7684\u81ea\u5305\u542b\u5b50\u4e32", "Url": "https://leetcode.cn/problems/find-longest-self-contained-substring/", "Ispaid": 1, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3105, "Title": "Longest Strictly Increasing or Strictly Decreasing Subarray", "TitleCn": "\u6700\u957f\u7684\u4e25\u683c\u9012\u589e\u6216\u9012\u51cf\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/longest-strictly-increasing-or-strictly-decreasing-subarray/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 392 Problem 1"}, {"ID": 3106, "Title": "Lexicographically Smallest String After Operations With Constraint", "TitleCn": "\u6ee1\u8db3\u8ddd\u79bb\u7ea6\u675f\u4e14\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-smallest-string-after-operations-with-constraint/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 392 Problem 2"}, {"ID": 3107, "Title": "Minimum Operations to Make Median of Array Equal to K", "TitleCn": "\u4f7f\u6570\u7ec4\u4e2d\u4f4d\u6570\u7b49\u4e8e K \u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-median-of-array-equal-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 392 Problem 3"}, {"ID": 3108, "Title": "Minimum Cost Walk in Weighted Graph", "TitleCn": "\u5e26\u6743\u56fe\u91cc\u65c5\u9014\u7684\u6700\u5c0f\u4ee3\u4ef7", "Url": "https://leetcode.cn/problems/minimum-cost-walk-in-weighted-graph/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 392 Problem 4"}, {"ID": 3109, "Title": "Find the Index of Permutation", "TitleCn": "\u67e5\u627e\u6392\u5217\u7684\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-the-index-of-permutation/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3110, "Title": "Score of a String", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u5206\u6570", "Url": "https://leetcode.cn/problems/score-of-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 128 Problem 1"}, {"ID": 3111, "Title": "Minimum Rectangles to Cover Points", "TitleCn": "\u8986\u76d6\u6240\u6709\u70b9\u7684\u6700\u5c11\u77e9\u5f62\u6570\u76ee", "Url": "https://leetcode.cn/problems/minimum-rectangles-to-cover-points/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 128 Problem 2"}, {"ID": 3112, "Title": "Minimum Time to Visit Disappearing Nodes", "TitleCn": "\u8bbf\u95ee\u6d88\u5931\u8282\u70b9\u7684\u6700\u5c11\u65f6\u95f4", "Url": "https://leetcode.cn/problems/minimum-time-to-visit-disappearing-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 128 Problem 3"}, {"ID": 3113, "Title": "Find the Number of Subarrays Where Boundary Elements Are Maximum", "TitleCn": "\u8fb9\u754c\u5143\u7d20\u662f\u6700\u5927\u503c\u7684\u5b50\u6570\u7ec4\u6570\u76ee", "Url": "https://leetcode.cn/problems/find-the-number-of-subarrays-where-boundary-elements-are-maximum/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 128 Problem 4"}, {"ID": 3114, "Title": "Latest Time You Can Obtain After Replacing Characters", "TitleCn": "\u66ff\u6362\u5b57\u7b26\u53ef\u4ee5\u5f97\u5230\u7684\u6700\u665a\u65f6\u95f4", "Url": "https://leetcode.cn/problems/latest-time-you-can-obtain-after-replacing-characters/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 393 Problem 1"}, {"ID": 3115, "Title": "Maximum Prime Difference", "TitleCn": "\u8d28\u6570\u7684\u6700\u5927\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/maximum-prime-difference/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 393 Problem 2"}, {"ID": 3116, "Title": "Kth Smallest Amount With Single Denomination Combination", "TitleCn": "\u5355\u9762\u503c\u7ec4\u5408\u7684\u7b2c K \u5c0f\u91d1\u989d", "Url": "https://leetcode.cn/problems/kth-smallest-amount-with-single-denomination-combination/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 393 Problem 3"}, {"ID": 3117, "Title": "Minimum Sum of Values by Dividing Array", "TitleCn": "\u5212\u5206\u6570\u7ec4\u5f97\u5230\u6700\u5c0f\u7684\u503c\u4e4b\u548c", "Url": "https://leetcode.cn/problems/minimum-sum-of-values-by-dividing-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 393 Problem 4"}, {"ID": 3118, "Title": "Friday Purchase III ", "TitleCn": "\u53d1\u751f\u5728\u5468\u4e94\u7684\u4ea4\u6613 III", "Url": "https://leetcode.cn/problems/friday-purchase-iii/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3119, "Title": "Maximum Number of Potholes That Can Be Fixed", "TitleCn": "\u6700\u5927\u6570\u91cf\u7684\u53ef\u4fee\u590d\u5751\u6d3c", "Url": "https://leetcode.cn/problems/maximum-number-of-potholes-that-can-be-fixed/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3120, "Title": "Count the Number of Special Characters I", "TitleCn": "\u7edf\u8ba1\u7279\u6b8a\u5b57\u6bcd\u7684\u6570\u91cf I", "Url": "https://leetcode.cn/problems/count-the-number-of-special-characters-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 394 Problem 1"}, {"ID": 3121, "Title": "Count the Number of Special Characters II", "TitleCn": "\u7edf\u8ba1\u7279\u6b8a\u5b57\u6bcd\u7684\u6570\u91cf II", "Url": "https://leetcode.cn/problems/count-the-number-of-special-characters-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 394 Problem 2"}, {"ID": 3122, "Title": "Minimum Number of Operations to Satisfy Conditions", "TitleCn": "\u4f7f\u77e9\u9635\u6ee1\u8db3\u6761\u4ef6\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-satisfy-conditions/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 394 Problem 3"}, {"ID": 3123, "Title": "Find Edges in Shortest Paths", "TitleCn": "\u6700\u77ed\u8def\u5f84\u4e2d\u7684\u8fb9", "Url": "https://leetcode.cn/problems/find-edges-in-shortest-paths/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 394 Problem 4"}, {"ID": 3124, "Title": "Find Longest Calls", "TitleCn": "\u67e5\u627e\u6700\u957f\u7684\u7535\u8bdd", "Url": "https://leetcode.cn/problems/find-longest-calls/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3125, "Title": "Maximum Number That Makes Result of Bitwise AND Zero", "TitleCn": "\u4f7f\u5f97\u6309\u4f4d\u4e0e\u7ed3\u679c\u4e3a 0 \u7684\u6700\u5927\u6570\u5b57", "Url": "https://leetcode.cn/problems/maximum-number-that-makes-result-of-bitwise-and-zero/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3126, "Title": "Server Utilization Time", "TitleCn": "\u670d\u52a1\u5668\u5229\u7528\u65f6\u95f4", "Url": "https://leetcode.cn/problems/server-utilization-time/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3127, "Title": "Make a Square with the Same Color", "TitleCn": "\u6784\u9020\u76f8\u540c\u989c\u8272\u7684\u6b63\u65b9\u5f62", "Url": "https://leetcode.cn/problems/make-a-square-with-the-same-color/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 129 Problem 1"}, {"ID": 3128, "Title": "Right Triangles", "TitleCn": "\u76f4\u89d2\u4e09\u89d2\u5f62", "Url": "https://leetcode.cn/problems/right-triangles/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 129 Problem 2"}, {"ID": 3129, "Title": "Find All Possible Stable Binary Arrays I", "TitleCn": "\u627e\u51fa\u6240\u6709\u7a33\u5b9a\u7684\u4e8c\u8fdb\u5236\u6570\u7ec4 I", "Url": "https://leetcode.cn/problems/find-all-possible-stable-binary-arrays-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 129 Problem 3"}, {"ID": 3130, "Title": "Find All Possible Stable Binary Arrays II", "TitleCn": "\u627e\u51fa\u6240\u6709\u7a33\u5b9a\u7684\u4e8c\u8fdb\u5236\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/find-all-possible-stable-binary-arrays-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 129 Problem 4"}, {"ID": 3131, "Title": "Find the Integer Added to Array I", "TitleCn": "\u627e\u51fa\u4e0e\u6570\u7ec4\u76f8\u52a0\u7684\u6574\u6570 I", "Url": "https://leetcode.cn/problems/find-the-integer-added-to-array-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 395 Problem 1"}, {"ID": 3132, "Title": "Find the Integer Added to Array II", "TitleCn": "\u627e\u51fa\u4e0e\u6570\u7ec4\u76f8\u52a0\u7684\u6574\u6570 II", "Url": "https://leetcode.cn/problems/find-the-integer-added-to-array-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 395 Problem 2"}, {"ID": 3133, "Title": "Minimum Array End", "TitleCn": "\u6570\u7ec4\u6700\u540e\u4e00\u4e2a\u5143\u7d20\u7684\u6700\u5c0f\u503c", "Url": "https://leetcode.cn/problems/minimum-array-end/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 395 Problem 3"}, {"ID": 3134, "Title": "Find the Median of the Uniqueness Array", "TitleCn": "\u627e\u51fa\u552f\u4e00\u6027\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570", "Url": "https://leetcode.cn/problems/find-the-median-of-the-uniqueness-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 395 Problem 4"}, {"ID": 3135, "Title": "Equalize Strings by Adding or Removing Characters at Ends", "TitleCn": "\u901a\u8fc7\u6dfb\u52a0\u6216\u5220\u9664\u7ed3\u5c3e\u5b57\u7b26\u6765\u540c\u5316\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/equalize-strings-by-adding-or-removing-characters-at-ends/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3136, "Title": "Valid Word", "TitleCn": "\u6709\u6548\u5355\u8bcd", "Url": "https://leetcode.cn/problems/valid-word/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 396 Problem 1"}, {"ID": 3137, "Title": "Minimum Number of Operations to Make Word K-Periodic", "TitleCn": "K \u5468\u671f\u5b57\u7b26\u4e32\u9700\u8981\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-operations-to-make-word-k-periodic/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 396 Problem 2"}, {"ID": 3138, "Title": "Minimum Length of Anagram Concatenation", "TitleCn": "\u540c\u4f4d\u5b57\u7b26\u4e32\u8fde\u63a5\u7684\u6700\u5c0f\u957f\u5ea6", "Url": "https://leetcode.cn/problems/minimum-length-of-anagram-concatenation/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 396 Problem 3"}, {"ID": 3139, "Title": "Minimum Cost to Equalize Array", "TitleCn": "\u4f7f\u6570\u7ec4\u4e2d\u6240\u6709\u5143\u7d20\u76f8\u7b49\u7684\u6700\u5c0f\u5f00\u9500", "Url": "https://leetcode.cn/problems/minimum-cost-to-equalize-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 396 Problem 4"}, {"ID": 3140, "Title": "Consecutive Available Seats II", "TitleCn": "\u8fde\u7eed\u7a7a\u4f59\u5ea7\u4f4d II", "Url": "https://leetcode.cn/problems/consecutive-available-seats-ii/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3141, "Title": "Maximum Hamming Distances", "TitleCn": "\u6700\u5927\u6c49\u660e\u8ddd\u79bb", "Url": "https://leetcode.cn/problems/maximum-hamming-distances/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3142, "Title": "Check if Grid Satisfies Conditions", "TitleCn": "\u5224\u65ad\u77e9\u9635\u662f\u5426\u6ee1\u8db3\u6761\u4ef6", "Url": "https://leetcode.cn/problems/check-if-grid-satisfies-conditions/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 130 Problem 1"}, {"ID": 3143, "Title": "Maximum Points Inside the Square", "TitleCn": "\u6b63\u65b9\u5f62\u4e2d\u7684\u6700\u591a\u70b9\u6570", "Url": "https://leetcode.cn/problems/maximum-points-inside-the-square/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 130 Problem 2"}, {"ID": 3144, "Title": "Minimum Substring Partition of Equal Character Frequency", "TitleCn": "\u5206\u5272\u5b57\u7b26\u9891\u7387\u76f8\u7b49\u7684\u6700\u5c11\u5b50\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/minimum-substring-partition-of-equal-character-frequency/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 130 Problem 3"}, {"ID": 3145, "Title": "Find Products of Elements of Big Array", "TitleCn": "\u5927\u6570\u7ec4\u5143\u7d20\u7684\u4e58\u79ef", "Url": "https://leetcode.cn/problems/find-products-of-elements-of-big-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 130 Problem 4"}, {"ID": 3146, "Title": "Permutation Difference between Two Strings", "TitleCn": "\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u6392\u5217\u5dee", "Url": "https://leetcode.cn/problems/permutation-difference-between-two-strings/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 397 Problem 1"}, {"ID": 3147, "Title": "Taking Maximum Energy From the Mystic Dungeon", "TitleCn": "\u4ece\u9b54\u6cd5\u5e08\u8eab\u4e0a\u5438\u53d6\u7684\u6700\u5927\u80fd\u91cf", "Url": "https://leetcode.cn/problems/taking-maximum-energy-from-the-mystic-dungeon/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 397 Problem 2"}, {"ID": 3148, "Title": "Maximum Difference Score in a Grid", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-difference-score-in-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 397 Problem 3"}, {"ID": 3149, "Title": "Find the Minimum Cost Array Permutation", "TitleCn": "\u627e\u51fa\u5206\u6570\u6700\u4f4e\u7684\u6392\u5217", "Url": "https://leetcode.cn/problems/find-the-minimum-cost-array-permutation/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 397 Problem 4"}, {"ID": 3150, "Title": "Invalid Tweets II", "TitleCn": "\u65e0\u6548\u7684\u63a8\u6587 II", "Url": "https://leetcode.cn/problems/invalid-tweets-ii/", "Ispaid": 0, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3151, "Title": "Special Array I", "TitleCn": "\u7279\u6b8a\u6570\u7ec4 I", "Url": "https://leetcode.cn/problems/special-array-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 398 Problem 1"}, {"ID": 3152, "Title": "Special Array II", "TitleCn": "\u7279\u6b8a\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/special-array-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 398 Problem 2"}, {"ID": 3153, "Title": "Sum of Digit Differences of All Pairs", "TitleCn": "\u6240\u6709\u6570\u5bf9\u4e2d\u6570\u4f4d\u4e0d\u540c\u4e4b\u548c", "Url": "https://leetcode.cn/problems/sum-of-digit-differences-of-all-pairs/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 398 Problem 3"}, {"ID": 3154, "Title": "Find Number of Ways to Reach the K-th Stair", "TitleCn": "\u5230\u8fbe\u7b2c K \u7ea7\u53f0\u9636\u7684\u65b9\u6848\u6570", "Url": "https://leetcode.cn/problems/find-number-of-ways-to-reach-the-k-th-stair/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 398 Problem 4"}, {"ID": 3155, "Title": "Maximum Number of Upgradable Servers", "TitleCn": "\u53ef\u5347\u7ea7\u670d\u52a1\u5668\u7684\u6700\u5927\u6570\u91cf", "Url": "https://leetcode.cn/problems/maximum-number-of-upgradable-servers/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3156, "Title": "Employee Task Duration and Concurrent Tasks", "TitleCn": "\u5458\u5de5\u4efb\u52a1\u6301\u7eed\u65f6\u95f4\u548c\u5e76\u53d1\u4efb\u52a1", "Url": "https://leetcode.cn/problems/employee-task-duration-and-concurrent-tasks/", "Ispaid": 1, "Type": "Database", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3157, "Title": "Find the Level of Tree with Minimum Sum", "TitleCn": "\u627e\u5230\u5177\u6709\u6700\u5c0f\u548c\u7684\u6811\u7684\u5c42\u6570", "Url": "https://leetcode.cn/problems/find-the-level-of-tree-with-minimum-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3158, "Title": "Find the XOR of Numbers Which Appear Twice", "TitleCn": "\u6c42\u51fa\u51fa\u73b0\u4e24\u6b21\u6570\u5b57\u7684 XOR \u503c", "Url": "https://leetcode.cn/problems/find-the-xor-of-numbers-which-appear-twice/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 131 Problem 1"}, {"ID": 3159, "Title": "Find Occurrences of an Element in an Array", "TitleCn": "\u67e5\u8be2\u6570\u7ec4\u4e2d\u5143\u7d20\u7684\u51fa\u73b0\u4f4d\u7f6e", "Url": "https://leetcode.cn/problems/find-occurrences-of-an-element-in-an-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 131 Problem 2"}, {"ID": 3160, "Title": "Find the Number of Distinct Colors Among the Balls", "TitleCn": "\u6240\u6709\u7403\u91cc\u9762\u4e0d\u540c\u989c\u8272\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/find-the-number-of-distinct-colors-among-the-balls/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 131 Problem 3"}, {"ID": 3161, "Title": "Block Placement Queries", "TitleCn": "\u7269\u5757\u653e\u7f6e\u67e5\u8be2", "Url": "https://leetcode.cn/problems/block-placement-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 131 Problem 4"}, {"ID": 3162, "Title": "Find the Number of Good Pairs I", "TitleCn": "\u4f18\u8d28\u6570\u5bf9\u7684\u603b\u6570 I", "Url": "https://leetcode.cn/problems/find-the-number-of-good-pairs-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 399 Problem 1"}, {"ID": 3163, "Title": "String Compression III", "TitleCn": "\u538b\u7f29\u5b57\u7b26\u4e32 III", "Url": "https://leetcode.cn/problems/string-compression-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 399 Problem 2"}, {"ID": 3164, "Title": "Find the Number of Good Pairs II", "TitleCn": "\u4f18\u8d28\u6570\u5bf9\u7684\u603b\u6570 II", "Url": "https://leetcode.cn/problems/find-the-number-of-good-pairs-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 399 Problem 3"}, {"ID": 3165, "Title": "Maximum Sum of Subsequence With Non-adjacent Elements", "TitleCn": "\u4e0d\u5305\u542b\u76f8\u90bb\u5143\u7d20\u7684\u5b50\u5e8f\u5217\u7684\u6700\u5927\u548c", "Url": "https://leetcode.cn/problems/maximum-sum-of-subsequence-with-non-adjacent-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 399 Problem 4"}, {"ID": 3166, "Title": "Calculate Parking Fees and Duration", "TitleCn": "\u8ba1\u7b97\u505c\u8f66\u8d39\u4e0e\u65f6\u957f", "Url": "https://leetcode.cn/problems/calculate-parking-fees-and-duration/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3167, "Title": "Better Compression of String", "TitleCn": "\u5b57\u7b26\u4e32\u7684\u66f4\u597d\u538b\u7f29", "Url": "https://leetcode.cn/problems/better-compression-of-string/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3168, "Title": "Minimum Number of Chairs in a Waiting Room", "TitleCn": "\u5019\u8bca\u5ba4\u4e2d\u7684\u6700\u5c11\u6905\u5b50\u6570", "Url": "https://leetcode.cn/minimum-number-of-chairs-in-a-waiting-room/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 400 Problem 1"}, {"ID": 3169, "Title": "Count Days Without Meetings", "TitleCn": "\u65e0\u9700\u5f00\u4f1a\u7684\u5de5\u4f5c\u65e5", "Url": "https://leetcode.cn/problems/count-days-without-meetings/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 400 Problem 2"}, {"ID": 3170, "Title": "Lexicographically Minimum String After Removing Stars", "TitleCn": "\u5220\u9664\u661f\u53f7\u4ee5\u540e\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-minimum-string-after-removing-stars/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 400 Problem 3"}, {"ID": 3171, "Title": "Find Subarray With Bitwise OR Closest to K", "TitleCn": "\u627e\u5230\u6309\u4f4d\u6216\u6700\u63a5\u8fd1 K \u7684\u5b50\u6570\u7ec4", "Url": "https://leetcode.cn/problems/find-subarray-with-bitwise-or-closest-to-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 400 Problem 4"}, {"ID": 3172, "Title": "Second Day Verification", "TitleCn": "\u7b2c\u4e8c\u5929\u9a8c\u8bc1", "Url": "https://leetcode.cn/problems/second-day-verification/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3173, "Title": "Bitwise OR of Adjacent Elements", "TitleCn": "\u76f8\u90bb\u5143\u7d20\u7684\u6309\u4f4d\u6216", "Url": "https://leetcode.cn/problems/bitwise-or-of-adjacent-elements/", "Ispaid": 1, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3174, "Title": "Clear Digits", "TitleCn": "\u6e05\u9664\u6570\u5b57", "Url": "https://leetcode.cn/problems/clear-digits/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 132 Problem 1"}, {"ID": 3175, "Title": "Find The First Player to win K Games in a Row", "TitleCn": "\u627e\u5230\u8fde\u7eed\u8d62 K \u573a\u6bd4\u8d5b\u7684\u7b2c\u4e00\u4f4d\u73a9\u5bb6", "Url": "https://leetcode.cn/problems/find-the-first-player-to-win-k-games-in-a-row/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 132 Problem 2"}, {"ID": 3176, "Title": "Find the Maximum Length of a Good Subsequence I", "TitleCn": "\u6c42\u51fa\u6700\u957f\u597d\u5b50\u5e8f\u5217 I", "Url": "https://leetcode.cn/problems/find-the-maximum-length-of-a-good-subsequence-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 132 Problem 3"}, {"ID": 3177, "Title": "Find the Maximum Length of a Good Subsequence II", "TitleCn": "\u6c42\u51fa\u6700\u957f\u597d\u5b50\u5e8f\u5217 II", "Url": "https://leetcode.cn/problems/find-the-maximum-length-of-a-good-subsequence-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 132 Problem 4"}, {"ID": 3178, "Title": "Find the Child Who Has the Ball After K Seconds", "TitleCn": "\u627e\u51fa K \u79d2\u540e\u62ff\u7740\u7403\u7684\u5b69\u5b50", "Url": "https://leetcode.cn/problems/find-the-child-who-has-the-ball-after-k-seconds/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 401 Problem 1"}, {"ID": 3179, "Title": "Find the N-th Value After K Seconds", "TitleCn": "K \u79d2\u540e\u7b2c N \u4e2a\u5143\u7d20\u7684\u503c", "Url": "https://leetcode.cn/problems/find-the-n-th-value-after-k-seconds/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 401 Problem 2"}, {"ID": 3180, "Title": "Maximum Total Reward Using Operations I", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u53ef\u83b7\u5f97\u7684\u6700\u5927\u603b\u5956\u52b1 I", "Url": "https://leetcode.cn/problems/maximum-total-reward-using-operations-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 401 Problem 3"}, {"ID": 3181, "Title": "Maximum Total Reward Using Operations II", "TitleCn": "\u6267\u884c\u64cd\u4f5c\u53ef\u83b7\u5f97\u7684\u6700\u5927\u603b\u5956\u52b1 II", "Url": "https://leetcode.cn/problems/maximum-total-reward-using-operations-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 401 Problem 4"}, {"ID": 3182, "Title": "Find Top Scoring Students", "TitleCn": "\u67e5\u627e\u5f97\u5206\u6700\u9ad8\u7684\u5b66\u751f", "Url": "https://leetcode.cn/problems/find-top-scoring-students/", "Ispaid": 1, "Type": "Database", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3183, "Title": "The Number of Ways to Make the Sum", "TitleCn": "\u8fbe\u5230\u603b\u548c\u7684\u65b9\u6cd5\u6570\u91cf", "Url": "https://leetcode.cn/problems/the-number-of-ways-to-make-the-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3184, "Title": "Count Pairs That Form a Complete Day I", "TitleCn": "\u6784\u6210\u6574\u5929\u7684\u4e0b\u6807\u5bf9\u6570\u76ee I", "Url": "https://leetcode.cn/problems/count-pairs-that-form-a-complete-day-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 402 Problem 1"}, {"ID": 3185, "Title": "Count Pairs That Form a Complete Day II", "TitleCn": "\u6784\u6210\u6574\u5929\u7684\u4e0b\u6807\u5bf9\u6570\u76ee II", "Url": "https://leetcode.cn/problems/count-pairs-that-form-a-complete-day-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 402 Problem 2"}, {"ID": 3186, "Title": "Maximum Total Damage With Spell Casting", "TitleCn": "\u65bd\u5492\u7684\u6700\u5927\u603b\u4f24\u5bb3", "Url": "https://leetcode.cn/problems/maximum-total-damage-with-spell-casting/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 402 Problem 3"}, {"ID": 3187, "Title": "Peaks in Array", "TitleCn": "\u6570\u7ec4\u4e2d\u7684\u5cf0\u503c", "Url": "https://leetcode.cn/problems/peaks-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 402 Problem 4"}, {"ID": 3188, "Title": "Find Top Scoring Students II", "TitleCn": "\u67e5\u627e\u5f97\u5206\u6700\u9ad8\u7684\u5b66\u751f II", "Url": "https://leetcode.cn/problems/find-top-scoring-students-ii/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3189, "Title": "Minimum Moves to Get a Peaceful Board", "TitleCn": "\u5f97\u5230\u4e00\u4e2a\u548c\u5e73\u68cb\u76d8\u7684\u6700\u5c11\u6b65\u9aa4", "Url": "https://leetcode.cn/problems/minimum-moves-to-get-a-peaceful-board/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3190, "Title": "Find Minimum Operations to Make All Elements Divisible by Three", "TitleCn": "\u4f7f\u6240\u6709\u5143\u7d20\u90fd\u53ef\u4ee5\u88ab 3 \u6574\u9664\u7684\u6700\u5c11\u64cd\u4f5c\u6570", "Url": "https://leetcode.cn/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 133 Problem 1"}, {"ID": 3191, "Title": "Minimum Operations to Make Binary Array Elements Equal to One I", "TitleCn": "\u4f7f\u4e8c\u8fdb\u5236\u6570\u7ec4\u5168\u90e8\u7b49\u4e8e 1 \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570 I", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 133 Problem 2"}, {"ID": 3192, "Title": "Minimum Operations to Make Binary Array Elements Equal to One II", "TitleCn": "\u4f7f\u4e8c\u8fdb\u5236\u6570\u7ec4\u5168\u90e8\u7b49\u4e8e 1 \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570 II", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 133 Problem 3"}, {"ID": 3193, "Title": "Count the Number of Inversions", "TitleCn": "\u7edf\u8ba1\u9006\u5e8f\u5bf9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-inversions/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 133 Problem 4"}, {"ID": 3194, "Title": "Minimum Average of Smallest and Largest Elements", "TitleCn": "\u6700\u5c0f\u5143\u7d20\u548c\u6700\u5927\u5143\u7d20\u7684\u6700\u5c0f\u5e73\u5747\u503c", "Url": "https://leetcode.cn/problems/minimum-average-of-smallest-and-largest-elements/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 403 Problem 1"}, {"ID": 3195, "Title": "Find the Minimum Area to Cover All Ones I", "TitleCn": "\u5305\u542b\u6240\u6709 1 \u7684\u6700\u5c0f\u77e9\u5f62\u9762\u79ef I", "Url": "https://leetcode.cn/problems/find-the-minimum-area-to-cover-all-ones-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 403 Problem 2"}, {"ID": 3196, "Title": "Maximize Total Cost of Alternating Subarrays", "TitleCn": "\u6700\u5927\u5316\u5b50\u6570\u7ec4\u7684\u603b\u6210\u672c", "Url": "https://leetcode.cn/problems/maximize-total-cost-of-alternating-subarrays/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 403 Problem 3"}, {"ID": 3197, "Title": "Find the Minimum Area to Cover All Ones II", "TitleCn": "\u5305\u542b\u6240\u6709 1 \u7684\u6700\u5c0f\u77e9\u5f62\u9762\u79ef II", "Url": "https://leetcode.cn/problems/find-the-minimum-area-to-cover-all-ones-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 403 Problem 4"}, {"ID": 3198, "Title": "Find Cities in Each State", "TitleCn": "\u67e5\u627e\u6bcf\u4e2a\u5dde\u7684\u57ce\u5e02", "Url": "https://leetcode.cn/problems/find-cities-in-each-state/", "Ispaid": 1, "Type": "Database", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3199, "Title": "Count Triplets with Even XOR Set Bits I", "TitleCn": "\u7528\u5076\u6570\u5f02\u6216\u8bbe\u7f6e\u4f4d\u8ba1\u6570\u4e09\u5143\u7ec4 I", "Url": "https://leetcode.cn/problems/count-triplets-with-even-xor-set-bits-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3200, "Title": "Maximum Height of a Triangle", "TitleCn": "\u4e09\u89d2\u5f62\u7684\u6700\u5927\u9ad8\u5ea6", "Url": "https://leetcode.cn/problems/maximum-height-of-a-triangle/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 404 Problem 1"}, {"ID": 3201, "Title": "Find the Maximum Length of Valid Subsequence I", "TitleCn": "\u627e\u51fa\u6709\u6548\u5b50\u5e8f\u5217\u7684\u6700\u5927\u957f\u5ea6 I", "Url": "https://leetcode.cn/problems/find-the-maximum-length-of-valid-subsequence-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 404 Problem 2"}, {"ID": 3202, "Title": "Find the Maximum Length of Valid Subsequence II", "TitleCn": "\u627e\u51fa\u6709\u6548\u5b50\u5e8f\u5217\u7684\u6700\u5927\u957f\u5ea6 II", "Url": "https://leetcode.cn/problems/find-the-maximum-length-of-valid-subsequence-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 404 Problem 3"}, {"ID": 3203, "Title": "Find Minimum Diameter After Merging Two Trees", "TitleCn": "\u5408\u5e76\u4e24\u68f5\u6811\u540e\u7684\u6700\u5c0f\u76f4\u5f84", "Url": "https://leetcode.cn/problems/find-minimum-diameter-after-merging-two-trees/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 404 Problem 4"}, {"ID": 3204, "Title": "Bitwise User Permissions Analysis", "TitleCn": "\u6309\u4f4d\u7528\u6237\u6743\u9650\u5206\u6790", "Url": "https://leetcode.cn/problems/bitwise-user-permissions-analysis/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3205, "Title": "Maximum Array Hopping Score I", "TitleCn": "\u6700\u5927\u6570\u7ec4\u8df3\u8dc3\u5f97\u5206 I", "Url": "https://leetcode.cn/problems/maximum-array-hopping-score-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3206, "Title": "Alternating Groups I", "TitleCn": "\u4ea4\u66ff\u7ec4 I", "Url": "https://leetcode.cn/problems/alternating-groups-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 134 Problem 1"}, {"ID": 3207, "Title": "Maximum Points After Enemy Battles", "TitleCn": "\u4e0e\u654c\u4eba\u6218\u6597\u540e\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-points-after-enemy-battles/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 134 Problem 2"}, {"ID": 3208, "Title": "Alternating Groups II", "TitleCn": "\u4ea4\u66ff\u7ec4 II", "Url": "https://leetcode.cn/problems/alternating-groups-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 134 Problem 3"}, {"ID": 3209, "Title": "Number of Subarrays With AND Value of K", "TitleCn": "\u5b50\u6570\u7ec4\u6309\u4f4d\u4e0e\u503c\u4e3a K \u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/number-of-subarrays-with-and-value-of-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 134 Problem 4"}, {"ID": 3210, "Title": "Find the Encrypted String", "TitleCn": "\u627e\u51fa\u52a0\u5bc6\u540e\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/find-the-encrypted-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 405 Problem 1"}, {"ID": 3211, "Title": "Generate Binary Strings Without Adjacent Zeros", "TitleCn": "\u751f\u6210\u4e0d\u542b\u76f8\u90bb\u96f6\u7684\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/generate-binary-strings-without-adjacent-zeros/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 405 Problem 2"}, {"ID": 3212, "Title": "Count Submatrices With Equal Frequency of X and Y", "TitleCn": "\u7edf\u8ba1 X \u548c Y \u9891\u6570\u76f8\u7b49\u7684\u5b50\u77e9\u9635\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-submatrices-with-equal-frequency-of-x-and-y/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 405 Problem 3"}, {"ID": 3213, "Title": "Construct String with Minimum Cost", "TitleCn": "\u6700\u5c0f\u4ee3\u4ef7\u6784\u9020\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/construct-string-with-minimum-cost/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 405 Problem 4"}, {"ID": 3214, "Title": "Year on Year Growth Rate", "TitleCn": "\u540c\u6bd4\u589e\u957f\u7387", "Url": "https://leetcode.cn/problems/year-on-year-growth-rate/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3215, "Title": "Count Triplets with Even XOR Set Bits II", "TitleCn": "\u7528\u5076\u6570\u5f02\u6216\u8bbe\u7f6e\u4f4d\u8ba1\u6570\u4e09\u5143\u7ec4 II", "Url": "https://leetcode.cn/problems/count-triplets-with-even-xor-set-bits-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3216, "Title": "Lexicographically Smallest String After a Swap", "TitleCn": "\u4ea4\u6362\u540e\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/lexicographically-smallest-string-after-a-swap/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 406 Problem 1"}, {"ID": 3217, "Title": "Delete Nodes From Linked List Present in Array", "TitleCn": "\u4ece\u94fe\u8868\u4e2d\u79fb\u9664\u5728\u6570\u7ec4\u4e2d\u5b58\u5728\u7684\u8282\u70b9", "Url": "https://leetcode.cn/problems/delete-nodes-from-linked-list-present-in-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 406 Problem 2"}, {"ID": 3218, "Title": "Minimum Cost for Cutting Cake I", "TitleCn": "\u5207\u86cb\u7cd5\u7684\u6700\u5c0f\u603b\u5f00\u9500 I", "Url": "https://leetcode.cn/problems/minimum-cost-for-cutting-cake-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 406 Problem 3"}, {"ID": 3219, "Title": "Minimum Cost for Cutting Cake II", "TitleCn": "\u5207\u86cb\u7cd5\u7684\u6700\u5c0f\u603b\u5f00\u9500 II", "Url": "https://leetcode.cn/problems/minimum-cost-for-cutting-cake-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 406 Problem 4"}, {"ID": 3220, "Title": "Odd and Even Transactions", "TitleCn": "\u5947\u6570\u548c\u5076\u6570\u4ea4\u6613", "Url": "https://leetcode.cn/problems/odd-and-even-transactions/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3221, "Title": "Maximum Array Hopping Score II", "TitleCn": "\u6700\u5927\u6570\u7ec4\u8df3\u8dc3\u5f97\u5206 II", "Url": "https://leetcode.cn/problems/maximum-array-hopping-score-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3222, "Title": "Find the Winning Player in Coin Game", "TitleCn": "\u6c42\u51fa\u786c\u5e01\u6e38\u620f\u7684\u8d62\u5bb6", "Url": "https://leetcode.cn/problems/find-the-winning-player-in-coin-game/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 135 Problem 1"}, {"ID": 3223, "Title": "Minimum Length of String After Operations", "TitleCn": "\u64cd\u4f5c\u540e\u5b57\u7b26\u4e32\u7684\u6700\u77ed\u957f\u5ea6", "Url": "https://leetcode.cn/problems/minimum-length-of-string-after-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 135 Problem 2"}, {"ID": 3224, "Title": "Minimum Array Changes to Make Differences Equal", "TitleCn": "\u4f7f\u5dee\u503c\u76f8\u7b49\u7684\u6700\u5c11\u6570\u7ec4\u6539\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-array-changes-to-make-differences-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 135 Problem 3"}, {"ID": 3225, "Title": "Maximum Score From Grid Operations", "TitleCn": "\u7f51\u683c\u56fe\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5206\u6570", "Url": "https://leetcode.cn/problems/maximum-score-from-grid-operations/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 135 Problem 4"}, {"ID": 3226, "Title": "Number of Bit Changes to Make Two Integers Equal", "TitleCn": "\u4f7f\u4e24\u4e2a\u6574\u6570\u76f8\u7b49\u7684\u4f4d\u66f4\u6539\u6b21\u6570", "Url": "https://leetcode.cn/problems/number-of-bit-changes-to-make-two-integers-equal/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 407 Problem 1"}, {"ID": 3227, "Title": "Vowels Game in a String", "TitleCn": "\u5b57\u7b26\u4e32\u5143\u97f3\u6e38\u620f", "Url": "https://leetcode.cn/problems/vowels-game-in-a-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 407 Problem 2"}, {"ID": 3228, "Title": "Maximum Number of Operations to Move Ones to the End", "TitleCn": "\u5c06 1 \u79fb\u52a8\u5230\u672b\u5c3e\u7684\u6700\u5927\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-operations-to-move-ones-to-the-end/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 407 Problem 3"}, {"ID": 3229, "Title": "Minimum Operations to Make Array Equal to Target", "TitleCn": "\u4f7f\u6570\u7ec4\u7b49\u4e8e\u76ee\u6807\u6570\u7ec4\u6240\u9700\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570", "Url": "https://leetcode.cn/problems/minimum-operations-to-make-array-equal-to-target/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 407 Problem 4"}, {"ID": 3230, "Title": "Customer Purchasing Behavior Analysis", "TitleCn": "\u5ba2\u6237\u8d2d\u4e70\u884c\u4e3a\u5206\u6790", "Url": "https://leetcode.cn/problems/customer-purchasing-behavior-analysis/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3231, "Title": "Minimum Number of Increasing Subsequence to Be Removed", "TitleCn": "\u8981\u5220\u9664\u7684\u9012\u589e\u5b50\u5e8f\u5217\u7684\u6700\u5c0f\u6570\u91cf", "Url": "https://leetcode.cn/problems/minimum-number-of-increasing-subsequence-to-be-removed/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3232, "Title": "Find if Digit Game Can Be Won", "TitleCn": "\u5224\u65ad\u662f\u5426\u53ef\u4ee5\u8d62\u5f97\u6570\u5b57\u6e38\u620f", "Url": "https://leetcode.cn/problems/find-if-digit-game-can-be-won/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 408 Problem 1"}, {"ID": 3233, "Title": "Find the Count of Numbers Which Are Not Special", "TitleCn": "\u7edf\u8ba1\u4e0d\u662f\u7279\u6b8a\u6570\u5b57\u7684\u6570\u5b57\u6570\u91cf", "Url": "https://leetcode.cn/problems/find-the-count-of-numbers-which-are-not-special/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 408 Problem 2"}, {"ID": 3234, "Title": "Count the Number of Substrings With Dominant Ones", "TitleCn": "\u7edf\u8ba1 1 \u663e\u8457\u7684\u5b57\u7b26\u4e32\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/count-the-number-of-substrings-with-dominant-ones/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 408 Problem 3"}, {"ID": 3235, "Title": "Check if the Rectangle Corner Is Reachable", "TitleCn": "\u5224\u65ad\u77e9\u5f62\u7684\u4e24\u4e2a\u89d2\u843d\u662f\u5426\u53ef\u8fbe", "Url": "https://leetcode.cn/problems/check-if-the-rectangle-corner-is-reachable/", "Ispaid": 0, "Type": "Algorithms", "Level": 11, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 408 Problem 4"}, {"ID": 3236, "Title": "CEO Subordinate Hierarchy", "TitleCn": "\u9996\u5e2d\u6267\u884c\u5b98\u4e0b\u5c5e\u5c42\u7ea7", "Url": "https://leetcode.cn/problems/ceo-subordinate-hierarchy/", "Ispaid": 1, "Type": "Database", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3237, "Title": "Alt and Tab Simulation", "TitleCn": "Alt \u548c Tab \u6a21\u62df", "Url": "https://leetcode.cn/problems/alt-and-tab-simulation/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3238, "Title": "Find the Number of Winning Players", "TitleCn": "\u6c42\u51fa\u80dc\u5229\u73a9\u5bb6\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/find-the-number-of-winning-players/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 136 Problem 1"}, {"ID": 3239, "Title": "Minimum Number of Flips to Make Binary Grid Palindromic I", "TitleCn": "\u6700\u5c11\u7ffb\u8f6c\u6b21\u6570\u4f7f\u4e8c\u8fdb\u5236\u77e9\u9635\u56de\u6587 I", "Url": "https://leetcode.cn/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 136 Problem 2"}, {"ID": 3240, "Title": "Minimum Number of Flips to Make Binary Grid Palindromic II", "TitleCn": "\u6700\u5c11\u7ffb\u8f6c\u6b21\u6570\u4f7f\u4e8c\u8fdb\u5236\u77e9\u9635\u56de\u6587 II", "Url": "https://leetcode.cn/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 136 Problem 3"}, {"ID": 3241, "Title": "Time Taken to Mark All Nodes", "TitleCn": "\u6807\u8bb0\u6240\u6709\u8282\u70b9\u9700\u8981\u7684\u65f6\u95f4", "Url": "https://leetcode.cn/problems/time-taken-to-mark-all-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 136 Problem 4"}, {"ID": 3242, "Title": "Design Neighbor Sum Service", "TitleCn": "\u8bbe\u8ba1\u76f8\u90bb\u5143\u7d20\u6c42\u548c\u670d\u52a1", "Url": "https://leetcode.cn/problems/design-neighbor-sum-service/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 409 Problem 1"}, {"ID": 3243, "Title": "Shortest Distance After Road Addition Queries I", "TitleCn": "\u65b0\u589e\u9053\u8def\u67e5\u8be2\u540e\u7684\u6700\u77ed\u8ddd\u79bb I", "Url": "https://leetcode.cn/problems/shortest-distance-after-road-addition-queries-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 409 Problem 2"}, {"ID": 3244, "Title": "Shortest Distance After Road Addition Queries II", "TitleCn": "\u65b0\u589e\u9053\u8def\u67e5\u8be2\u540e\u7684\u6700\u77ed\u8ddd\u79bb II", "Url": "https://leetcode.cn/problems/shortest-distance-after-road-addition-queries-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 409 Problem 3"}, {"ID": 3245, "Title": "Alternating Groups III", "TitleCn": "\u4ea4\u66ff\u7ec4 III", "Url": "https://leetcode.cn/problems/alternating-groups-iii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 409 Problem 4"}, {"ID": 3246, "Title": "Premier League Table Ranking", "TitleCn": "\u82f1\u8d85\u79ef\u5206\u699c\u6392\u540d", "Url": "https://leetcode.cn/problems/premier-league-table-ranking/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3247, "Title": "Number of Subsequences with Odd Sum", "TitleCn": "\u5947\u6570\u548c\u5b50\u5e8f\u5217\u7684\u6570\u91cf", "Url": "https://leetcode.cn/problems/number-of-subsequences-with-odd-sum/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3248, "Title": "Snake in Matrix", "TitleCn": "\u77e9\u9635\u4e2d\u7684\u86c7", "Url": "https://leetcode.cn/problems/snake-in-matrix/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 410 Problem 1"}, {"ID": 3249, "Title": "Count the Number of Good Nodes", "TitleCn": "\u7edf\u8ba1\u597d\u8282\u70b9\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/count-the-number-of-good-nodes/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 410 Problem 2"}, {"ID": 3250, "Title": "Find the Count of Monotonic Pairs I", "TitleCn": "\u5355\u8c03\u6570\u7ec4\u5bf9\u7684\u6570\u76ee I", "Url": "https://leetcode.cn/problems/find-the-count-of-monotonic-pairs-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 410 Problem 3"}, {"ID": 3251, "Title": "Find the Count of Monotonic Pairs II", "TitleCn": "\u5355\u8c03\u6570\u7ec4\u5bf9\u7684\u6570\u76ee II", "Url": "https://leetcode.cn/problems/find-the-count-of-monotonic-pairs-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 410 Problem 4"}, {"ID": 3252, "Title": "Premier League Table Ranking II", "TitleCn": "\u82f1\u8d85\u79ef\u5206\u699c\u6392\u540d II", "Url": "https://leetcode.cn/problems/premier-league-table-ranking-ii/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3253, "Title": "Construct String with Minimum Cost (Easy)", "TitleCn": "\u6700\u5c0f\u4ee3\u4ef7\u6784\u9020\u5b57\u7b26\u4e32\uff08\u7b80\u5355\uff09", "Url": "https://leetcode.cn/problems/construct-string-with-minimum-cost-easy/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3254, "Title": "Find the Power of K-Size Subarrays I", "TitleCn": "\u957f\u5ea6\u4e3a K \u7684\u5b50\u6570\u7ec4\u7684\u80fd\u91cf\u503c I", "Url": "https://leetcode.cn/problems/find-the-power-of-k-size-subarrays-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 137 Problem 1"}, {"ID": 3255, "Title": "Find the Power of K-Size Subarrays II", "TitleCn": "\u957f\u5ea6\u4e3a K \u7684\u5b50\u6570\u7ec4\u7684\u80fd\u91cf\u503c II", "Url": "https://leetcode.cn/problems/find-the-power-of-k-size-subarrays-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 137 Problem 2"}, {"ID": 3256, "Title": "Maximum Value Sum by Placing Three Rooks I", "TitleCn": "\u653e\u4e09\u4e2a\u8f66\u7684\u4ef7\u503c\u4e4b\u548c\u6700\u5927 I", "Url": "https://leetcode.cn/problems/maximum-value-sum-by-placing-three-rooks-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 137 Problem 3"}, {"ID": 3257, "Title": "Maximum Value Sum by Placing Three Rooks II", "TitleCn": "\u653e\u4e09\u4e2a\u8f66\u7684\u4ef7\u503c\u4e4b\u548c\u6700\u5927 II", "Url": "https://leetcode.cn/problems/maximum-value-sum-by-placing-three-rooks-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 137 Problem 4"}, {"ID": 3258, "Title": "Count Substrings That Satisfy K-Constraint I", "TitleCn": "\u7edf\u8ba1\u6ee1\u8db3 K \u7ea6\u675f\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u91cf I", "Url": "https://leetcode.cn/problems/count-substrings-that-satisfy-k-constraint-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 411 Problem 1"}, {"ID": 3259, "Title": "Maximum Energy Boost From Two Drinks", "TitleCn": "\u8d85\u7ea7\u996e\u6599\u7684\u6700\u5927\u5f3a\u5316\u80fd\u91cf", "Url": "https://leetcode.cn/problems/maximum-energy-boost-from-two-drinks/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 411 Problem 2"}, {"ID": 3260, "Title": "Find the Largest Palindrome Divisible by K", "TitleCn": "\u627e\u51fa\u6700\u5927\u7684 N \u4f4d K \u56de\u6587\u6570", "Url": "https://leetcode.cn/problems/find-the-largest-palindrome-divisible-by-k/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 411 Problem 3"}, {"ID": 3261, "Title": "Count Substrings That Satisfy K-Constraint II", "TitleCn": "\u7edf\u8ba1\u6ee1\u8db3 K \u7ea6\u675f\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u91cf II", "Url": "https://leetcode.cn/problems/count-substrings-that-satisfy-k-constraint-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 411 Problem 4"}, {"ID": 3262, "Title": "Find Overlapping Shifts", "TitleCn": "\u67e5\u627e\u91cd\u53e0\u7684\u73ed\u6b21", "Url": "https://leetcode.cn/problems/find-overlapping-shifts/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3263, "Title": "Convert Doubly Linked List to Array I", "TitleCn": "\u5c06\u53cc\u94fe\u8868\u8f6c\u6362\u4e3a\u6570\u7ec4 I", "Url": "https://leetcode.cn/problems/convert-doubly-linked-list-to-array-i/", "Ispaid": 1, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": ""}, {"ID": 3264, "Title": "Final Array State After K Multiplication Operations I", "TitleCn": "K \u6b21\u4e58\u8fd0\u7b97\u540e\u7684\u6700\u7ec8\u6570\u7ec4 I", "Url": "https://leetcode.cn/problems/final-array-state-after-k-multiplication-operations-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 412 Problem 1"}, {"ID": 3265, "Title": "Count Almost Equal Pairs I", "TitleCn": "\u7edf\u8ba1\u8fd1\u4f3c\u76f8\u7b49\u6570\u5bf9 I", "Url": "https://leetcode.cn/problems/count-almost-equal-pairs-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 412 Problem 2"}, {"ID": 3266, "Title": "Final Array State After K Multiplication Operations II", "TitleCn": "K \u6b21\u4e58\u8fd0\u7b97\u540e\u7684\u6700\u7ec8\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/final-array-state-after-k-multiplication-operations-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 412 Problem 3"}, {"ID": 3267, "Title": "Count Almost Equal Pairs II", "TitleCn": "\u7edf\u8ba1\u8fd1\u4f3c\u76f8\u7b49\u6570\u5bf9 II", "Url": "https://leetcode.cn/problems/count-almost-equal-pairs-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 412 Problem 4"}, {"ID": 3268, "Title": "Find Overlapping Shifts II", "TitleCn": "\u67e5\u627e\u91cd\u53e0\u7684\u73ed\u6b21 II", "Url": "https://leetcode.cn/problems/find-overlapping-shifts-ii/", "Ispaid": 1, "Type": "Database", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3269, "Title": "Constructing Two Increasing Arrays", "TitleCn": "\u6784\u5efa\u4e24\u4e2a\u9012\u589e\u6570\u7ec4", "Url": "https://leetcode.cn/problems/constructing-two-increasing-arrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3270, "Title": "Find the Key of the Numbers", "TitleCn": "\u6c42\u51fa\u6570\u5b57\u7b54\u6848", "Url": "https://leetcode.cn/problems/find-the-key-of-the-numbers/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 138 Problem 1"}, {"ID": 3271, "Title": "Hash Divided String", "TitleCn": "\u54c8\u5e0c\u5206\u5272\u5b57\u7b26\u4e32", "Url": "https://leetcode.cn/problems/hash-divided-string/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 138 Problem 2"}, {"ID": 3272, "Title": "Find the Count of Good Integers", "TitleCn": "\u7edf\u8ba1\u597d\u6574\u6570\u7684\u6570\u76ee", "Url": "https://leetcode.cn/problems/find-the-count-of-good-integers/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 138 Problem 3"}, {"ID": 3273, "Title": "Minimum Amount of Damage Dealt to Bob", "TitleCn": "\u5bf9 Bob \u9020\u6210\u7684\u6700\u5c11\u4f24\u5bb3", "Url": "https://leetcode.cn/problems/minimum-amount-of-damage-dealt-to-bob/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 138 Problem 4"}, {"ID": 3274, "Title": "Check if Two Chessboard Squares Have the Same Color", "TitleCn": "\u68c0\u67e5\u68cb\u76d8\u65b9\u683c\u989c\u8272\u662f\u5426\u76f8\u540c", "Url": "https://leetcode.cn/problems/check-if-two-chessboard-squares-have-the-same-color/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 413 Problem 1"}, {"ID": 3275, "Title": "K-th Nearest Obstacle Queries", "TitleCn": "\u7b2c K \u8fd1\u969c\u788d\u7269\u67e5\u8be2", "Url": "https://leetcode.cn/problems/k-th-nearest-obstacle-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 413 Problem 2"}, {"ID": 3276, "Title": "Select Cells in Grid With Maximum Score", "TitleCn": "\u9009\u62e9\u77e9\u9635\u4e2d\u5355\u5143\u683c\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/select-cells-in-grid-with-maximum-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 413 Problem 3"}, {"ID": 3277, "Title": "Maximum XOR Score Subarray Queries", "TitleCn": "\u67e5\u8be2\u5b50\u6570\u7ec4\u6700\u5927\u5f02\u6216\u503c", "Url": "https://leetcode.cn/problems/maximum-xor-score-subarray-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 413 Problem 4"}, {"ID": 3278, "Title": "Find Candidates for Data Scientist Position II", "TitleCn": "\u5bfb\u627e\u6570\u636e\u79d1\u5b66\u5bb6\u804c\u4f4d\u7684\u5019\u9009\u4eba II", "Url": "https://leetcode.cn/problems/find-candidates-for-data-scientist-position-ii/", "Ispaid": 1, "Type": "Database", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3279, "Title": "Maximum Total Area Occupied by Pistons", "TitleCn": "\u6d3b\u585e\u5360\u636e\u7684\u6700\u5927\u603b\u9762\u79ef", "Url": "https://leetcode.cn/problems/maximum-total-area-occupied-by-pistons/", "Ispaid": 1, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3280, "Title": "Convert Date to Binary", "TitleCn": "\u5c06\u65e5\u671f\u8f6c\u6362\u4e3a\u4e8c\u8fdb\u5236\u8868\u793a", "Url": "https://leetcode.cn/problems/convert-date-to-binary/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 414 Problem 1"}, {"ID": 3281, "Title": "Maximize Score of Numbers in Ranges", "TitleCn": "\u8303\u56f4\u5185\u6574\u6570\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximize-score-of-numbers-in-ranges/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 414 Problem 2"}, {"ID": 3282, "Title": "Reach End of Array With Max Score", "TitleCn": "\u5230\u8fbe\u6570\u7ec4\u672b\u5c3e\u7684\u6700\u5927\u5f97\u5206", "Url": "https://leetcode.cn/problems/reach-end-of-array-with-max-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 414 Problem 3"}, {"ID": 3283, "Title": "Maximum Number of Moves to Kill All Pawns", "TitleCn": "\u5403\u6389\u6240\u6709\u5175\u9700\u8981\u7684\u6700\u591a\u79fb\u52a8\u6b21\u6570", "Url": "https://leetcode.cn/problems/maximum-number-of-moves-to-kill-all-pawns/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 414 Problem 4"}, {"ID": 3284, "Title": "Sum of Consecutive Subarrays", "TitleCn": "\u8fde\u7eed\u5b50\u6570\u7ec4\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-consecutive-subarrays/", "Ispaid": 1, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3285, "Title": "Find Indices of Stable Mountains", "TitleCn": "\u627e\u5230\u7a33\u5b9a\u5c71\u7684\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-indices-of-stable-mountains/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 139 Problem 1"}, {"ID": 3286, "Title": "Find a Safe Walk Through a Grid", "TitleCn": "\u7a7f\u8d8a\u7f51\u683c\u56fe\u7684\u5b89\u5168\u8def\u5f84", "Url": "https://leetcode.cn/problems/find-a-safe-walk-through-a-grid/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 139 Problem 2"}, {"ID": 3287, "Title": "Find the Maximum Sequence Value of Array", "TitleCn": "\u6c42\u51fa\u6570\u7ec4\u4e2d\u6700\u5927\u5e8f\u5217\u503c", "Url": "https://leetcode.cn/problems/find-the-maximum-sequence-value-of-array/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 139 Problem 3"}, {"ID": 3288, "Title": "Length of the Longest Increasing Path", "TitleCn": "\u6700\u957f\u4e0a\u5347\u8def\u5f84\u7684\u957f\u5ea6", "Url": "https://leetcode.cn/problems/length-of-the-longest-increasing-path/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 139 Problem 4"}, {"ID": 3289, "Title": "The Two Sneaky Numbers of Digitville", "TitleCn": "\u6570\u5b57\u5c0f\u9547\u4e2d\u7684\u6363\u86cb\u9b3c", "Url": "https://leetcode.cn/problems/the-two-sneaky-numbers-of-digitville/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 415 Problem 1"}, {"ID": 3290, "Title": "Maximum Multiplication Score", "TitleCn": "\u6700\u9ad8\u4e58\u6cd5\u5f97\u5206", "Url": "https://leetcode.cn/problems/maximum-multiplication-score/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 415 Problem 2"}, {"ID": 3291, "Title": "Minimum Number of Valid Strings to Form Target I", "TitleCn": "\u5f62\u6210\u76ee\u6807\u5b57\u7b26\u4e32\u9700\u8981\u7684\u6700\u5c11\u5b57\u7b26\u4e32\u6570 I", "Url": "https://leetcode.cn/problems/minimum-number-of-valid-strings-to-form-target-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 415 Problem 3"}, {"ID": 3292, "Title": "Minimum Number of Valid Strings to Form Target II", "TitleCn": "\u5f62\u6210\u76ee\u6807\u5b57\u7b26\u4e32\u9700\u8981\u7684\u6700\u5c11\u5b57\u7b26\u4e32\u6570 II", "Url": "https://leetcode.cn/problems/minimum-number-of-valid-strings-to-form-target-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 415 Problem 4"}, {"ID": 3293, "Title": "Calculate Product Final Price", "TitleCn": "\u8ba1\u7b97\u4ea7\u54c1\u6700\u7ec8\u4ef7\u683c", "Url": "https://leetcode.cn/problems/calculate-product-final-price/", "Ispaid": 1, "Type": "Database", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3294, "Title": "Convert Doubly Linked List to Array II", "TitleCn": "\u5c06\u53cc\u94fe\u8868\u8f6c\u6362\u4e3a\u6570\u7ec4 II", "Url": "https://leetcode.cn/problems/convert-doubly-linked-list-to-array-ii/", "Ispaid": 1, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3295, "Title": "Report Spam Message", "TitleCn": "\u4e3e\u62a5\u5783\u573e\u4fe1\u606f", "Url": "https://leetcode.cn/problems/report-spam-message/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 416 Problem 1"}, {"ID": 3296, "Title": "Minimum Number of Seconds to Make Mountain Height Zero", "TitleCn": "\u79fb\u5c71\u6240\u9700\u7684\u6700\u5c11\u79d2\u6570", "Url": "https://leetcode.cn/problems/minimum-number-of-seconds-to-make-mountain-height-zero/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 416 Problem 2"}, {"ID": 3297, "Title": "Count Substrings That Can Be Rearranged to Contain a String I", "TitleCn": "\u7edf\u8ba1\u91cd\u65b0\u6392\u5217\u540e\u5305\u542b\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u76ee I", "Url": "https://leetcode.cn/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 416 Problem 3"}, {"ID": 3298, "Title": "Count Substrings That Can Be Rearranged to Contain a String II", "TitleCn": "\u7edf\u8ba1\u91cd\u65b0\u6392\u5217\u540e\u5305\u542b\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u76ee II", "Url": "https://leetcode.cn/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 6, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 416 Problem 4"}, {"ID": 3299, "Title": "Sum of Consecutive Subsequences", "TitleCn": "\u8fde\u7eed\u5b50\u5e8f\u5217\u7684\u548c", "Url": "https://leetcode.cn/problems/sum-of-consecutive-subsequences/", "Ispaid": 1, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": ""}, {"ID": 3300, "Title": "Minimum Element After Replacement With Digit Sum", "TitleCn": "\u66ff\u6362\u4e3a\u6570\u4f4d\u548c\u4ee5\u540e\u7684\u6700\u5c0f\u5143\u7d20", "Url": "https://leetcode.cn/problems/minimum-element-after-replacement-with-digit-sum/", "Ispaid": 0, "Type": "Algorithms", "Level": 1, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Biweekly Contest 140 Problem 1"}, {"ID": 3301, "Title": "Maximize the Total Height of Unique Towers", "TitleCn": "\u9ad8\u5ea6\u4e92\u4e0d\u76f8\u540c\u7684\u6700\u5927\u5854\u9ad8\u548c", "Url": "https://leetcode.cn/problems/maximize-the-total-height-of-unique-towers/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 140 Problem 2"}, {"ID": 3302, "Title": "Find the Lexicographically Smallest Valid Sequence", "TitleCn": "\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5408\u6cd5\u5e8f\u5217", "Url": "https://leetcode.cn/problems/find-the-lexicographically-smallest-valid-sequence/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Biweekly Contest 140 Problem 3"}, {"ID": 3303, "Title": "Find the Occurrence of First Almost Equal Substring", "TitleCn": "\u7b2c\u4e00\u4e2a\u51e0\u4e4e\u76f8\u7b49\u5b50\u5b57\u7b26\u4e32\u7684\u4e0b\u6807", "Url": "https://leetcode.cn/problems/find-the-occurrence-of-first-almost-equal-substring/", "Ispaid": 0, "Type": "Algorithms", "Level": 10, "NextLevel": 11, "Difficulty": "Hard", "ContestInfo": "Biweekly Contest 140 Problem 4"}, {"ID": 3304, "Title": "Find the K-th Character in String Game I", "TitleCn": "\u627e\u51fa\u7b2c K \u4e2a\u5b57\u7b26 I", "Url": "https://leetcode.cn/problems/find-the-k-th-character-in-string-game-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 2, "NextLevel": 0, "Difficulty": "Easy", "ContestInfo": "Weekly Contest 417 Problem 1"}, {"ID": 3305, "Title": "Count of Substrings Containing Every Vowel and K Consonants I", "TitleCn": "\u5143\u97f3\u8f85\u97f3\u5b57\u7b26\u4e32\u8ba1\u6570 I", "Url": "https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-i/", "Ispaid": 0, "Type": "Algorithms", "Level": 4, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 417 Problem 2"}, {"ID": 3306, "Title": "Count of Substrings Containing Every Vowel and K Consonants II", "TitleCn": "\u5143\u97f3\u8f85\u97f3\u5b57\u7b26\u4e32\u8ba1\u6570 II", "Url": "https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 417 Problem 3"}, {"ID": 3307, "Title": "Find the K-th Character in String Game II", "TitleCn": "\u627e\u51fa\u7b2c K \u4e2a\u5b57\u7b26 II", "Url": "https://leetcode.cn/problems/find-the-k-th-character-in-string-game-ii/", "Ispaid": 0, "Type": "Algorithms", "Level": 7, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 417 Problem 4"}, {"ID": 3308, "Title": "Find Top Performing Driver", "TitleCn": NaN, "Url": "https://leetcode.cn/problems/find-top-performing-driver/", "Ispaid": 1, "Type": "Database", "Level": 6, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": ""}, {"ID": 3309, "Title": "Maximum Possible Number by Binary Concatenation", "TitleCn": "\u8fde\u63a5\u4e8c\u8fdb\u5236\u8868\u793a\u53ef\u5f62\u6210\u7684\u6700\u5927\u6570\u503c", "Url": "https://leetcode.cn/problems/maximum-possible-number-by-binary-concatenation/", "Ispaid": 0, "Type": "Algorithms", "Level": 3, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 418 Problem 1"}, {"ID": 3310, "Title": "Remove Methods From Project", "TitleCn": "\u79fb\u9664\u53ef\u7591\u7684\u65b9\u6cd5", "Url": "https://leetcode.cn/problems/remove-methods-from-project/", "Ispaid": 0, "Type": "Algorithms", "Level": 5, "NextLevel": 0, "Difficulty": "Medium", "ContestInfo": "Weekly Contest 418 Problem 2"}, {"ID": 3311, "Title": "Construct 2D Grid Matching Graph Layout", "TitleCn": "\u6784\u9020\u7b26\u5408\u56fe\u7ed3\u6784\u7684\u4e8c\u7ef4\u77e9\u9635", "Url": "https://leetcode.cn/problems/construct-2d-grid-matching-graph-layout/", "Ispaid": 0, "Type": "Algorithms", "Level": 8, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 418 Problem 3"}, {"ID": 3312, "Title": "Sorted GCD Pair Queries", "TitleCn": "\u67e5\u8be2\u6392\u5e8f\u540e\u7684\u6700\u5927\u516c\u7ea6\u6570", "Url": "https://leetcode.cn/problems/sorted-gcd-pair-queries/", "Ispaid": 0, "Type": "Algorithms", "Level": 9, "NextLevel": 0, "Difficulty": "Hard", "ContestInfo": "Weekly Contest 418 Problem 4"}]
\ No newline at end of file
diff --git a/stormlevel/data.xlsx b/stormlevel/data.xlsx
index 3a1b53ce..75b247f4 100644
Binary files a/stormlevel/data.xlsx and b/stormlevel/data.xlsx differ
diff --git a/stormlevel/exist.txt b/stormlevel/exist.txt
index 8fce688f..8d01ac4f 100644
--- a/stormlevel/exist.txt
+++ b/stormlevel/exist.txt
@@ -1 +1 @@
-2024-09-30 01:22:01
\ No newline at end of file
+2024-10-07 01:44:47
\ No newline at end of file