result.json

[
    {
        "arg": "two-sum",
        "titleUS": "1 Two Sum",
        "titleCN": "1 两数之和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Two Sum"
    },
    {
        "arg": "add-two-numbers",
        "titleUS": "2 Add Two Numbers",
        "titleCN": "2 两数相加",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Add Two Numbers"
    },
    {
        "arg": "longest-substring-without-repeating-characters",
        "titleUS": "3 Longest Substring Without Repeating Characters",
        "titleCN": "3 无重复字符的最长子串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Substring Without Repeating Characters"
    },
    {
        "arg": "median-of-two-sorted-arrays",
        "titleUS": "4 Median of Two Sorted Arrays",
        "titleCN": "4 寻找两个正序数组的中位数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Median of Two Sorted Arrays"
    },
    {
        "arg": "longest-palindromic-substring",
        "titleUS": "5 Longest Palindromic Substring",
        "titleCN": "5 最长回文子串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Palindromic Substring"
    },
    {
        "arg": "zigzag-conversion",
        "titleUS": "6 Zigzag Conversion",
        "titleCN": "6 Z 字形变换",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Zigzag Conversion"
    },
    {
        "arg": "reverse-integer",
        "titleUS": "7 Reverse Integer",
        "titleCN": "7 整数反转",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reverse Integer"
    },
    {
        "arg": "string-to-integer-atoi",
        "titleUS": "8 String to Integer (atoi)",
        "titleCN": "8 字符串转换整数 (atoi)",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 String to Integer (atoi)"
    },
    {
        "arg": "palindrome-number",
        "titleUS": "9 Palindrome Number",
        "titleCN": "9 回文数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Palindrome Number"
    },
    {
        "arg": "regular-expression-matching",
        "titleUS": "10 Regular Expression Matching",
        "titleCN": "10 正则表达式匹配",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Regular Expression Matching"
    },
    {
        "arg": "container-with-most-water",
        "titleUS": "11 Container With Most Water",
        "titleCN": "11 盛最多水的容器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Container With Most Water"
    },
    {
        "arg": "integer-to-roman",
        "titleUS": "12 Integer to Roman",
        "titleCN": "12 整数转罗马数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Integer to Roman"
    },
    {
        "arg": "roman-to-integer",
        "titleUS": "13 Roman to Integer",
        "titleCN": "13 罗马数字转整数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Roman to Integer"
    },
    {
        "arg": "longest-common-prefix",
        "titleUS": "14 Longest Common Prefix",
        "titleCN": "14 最长公共前缀",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Longest Common Prefix"
    },
    {
        "arg": "3sum",
        "titleUS": "15 3Sum",
        "titleCN": "15 三数之和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 3Sum"
    },
    {
        "arg": "3sum-closest",
        "titleUS": "16 3Sum Closest",
        "titleCN": "16 最接近的三数之和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 3Sum Closest"
    },
    {
        "arg": "letter-combinations-of-a-phone-number",
        "titleUS": "17 Letter Combinations of a Phone Number",
        "titleCN": "17 电话号码的字母组合",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Letter Combinations of a Phone Number"
    },
    {
        "arg": "4sum",
        "titleUS": "18 4Sum",
        "titleCN": "18 四数之和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 4Sum"
    },
    {
        "arg": "remove-nth-node-from-end-of-list",
        "titleUS": "19 Remove Nth Node From End of List",
        "titleCN": "19 删除链表的倒数第 N 个结点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Remove Nth Node From End of List"
    },
    {
        "arg": "valid-parentheses",
        "titleUS": "20 Valid Parentheses",
        "titleCN": "20 有效的括号",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Valid Parentheses"
    },
    {
        "arg": "merge-two-sorted-lists",
        "titleUS": "21 Merge Two Sorted Lists",
        "titleCN": "21 合并两个有序链表",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Merge Two Sorted Lists"
    },
    {
        "arg": "generate-parentheses",
        "titleUS": "22 Generate Parentheses",
        "titleCN": "22 括号生成",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Generate Parentheses"
    },
    {
        "arg": "merge-k-sorted-lists",
        "titleUS": "23 Merge k Sorted Lists",
        "titleCN": "23 合并 K 个升序链表",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Merge k Sorted Lists"
    },
    {
        "arg": "swap-nodes-in-pairs",
        "titleUS": "24 Swap Nodes in Pairs",
        "titleCN": "24 两两交换链表中的节点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Swap Nodes in Pairs"
    },
    {
        "arg": "reverse-nodes-in-k-group",
        "titleUS": "25 Reverse Nodes in k-Group",
        "titleCN": "25 K 个一组翻转链表",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Reverse Nodes in k-Group"
    },
    {
        "arg": "remove-duplicates-from-sorted-array",
        "titleUS": "26 Remove Duplicates from Sorted Array",
        "titleCN": "26 删除有序数组中的重复项",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Remove Duplicates from Sorted Array"
    },
    {
        "arg": "remove-element",
        "titleUS": "27 Remove Element",
        "titleCN": "27 移除元素",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Remove Element"
    },
    {
        "arg": "find-the-index-of-the-first-occurrence-in-a-string",
        "titleUS": "28 Find the Index of the First Occurrence in a String",
        "titleCN": "28 找出字符串中第一个匹配项的下标",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Index of the First Occurrence in a String"
    },
    {
        "arg": "divide-two-integers",
        "titleUS": "29 Divide Two Integers",
        "titleCN": "29 两数相除",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Divide Two Integers"
    },
    {
        "arg": "substring-with-concatenation-of-all-words",
        "titleUS": "30 Substring with Concatenation of All Words",
        "titleCN": "30 串联所有单词的子串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Substring with Concatenation of All Words"
    },
    {
        "arg": "next-permutation",
        "titleUS": "31 Next Permutation",
        "titleCN": "31 下一个排列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Next Permutation"
    },
    {
        "arg": "longest-valid-parentheses",
        "titleUS": "32 Longest Valid Parentheses",
        "titleCN": "32 最长有效括号",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Longest Valid Parentheses"
    },
    {
        "arg": "search-in-rotated-sorted-array",
        "titleUS": "33 Search in Rotated Sorted Array",
        "titleCN": "33 搜索旋转排序数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Search in Rotated Sorted Array"
    },
    {
        "arg": "find-first-and-last-position-of-element-in-sorted-array",
        "titleUS": "34 Find First and Last Position of Element in Sorted Array",
        "titleCN": "34 在排序数组中查找元素的第一个和最后一个位置",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find First and Last Position of Element in Sorted Array"
    },
    {
        "arg": "search-insert-position",
        "titleUS": "35 Search Insert Position",
        "titleCN": "35 搜索插入位置",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Search Insert Position"
    },
    {
        "arg": "valid-sudoku",
        "titleUS": "36 Valid Sudoku",
        "titleCN": "36 有效的数独",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Valid Sudoku"
    },
    {
        "arg": "sudoku-solver",
        "titleUS": "37 Sudoku Solver",
        "titleCN": "37 解数独",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Sudoku Solver"
    },
    {
        "arg": "count-and-say",
        "titleUS": "38 Count and Say",
        "titleCN": "38 外观数列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count and Say"
    },
    {
        "arg": "combination-sum",
        "titleUS": "39 Combination Sum",
        "titleCN": "39 组合总和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Combination Sum"
    },
    {
        "arg": "combination-sum-ii",
        "titleUS": "40 Combination Sum II",
        "titleCN": "40 组合总和 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Combination Sum II"
    },
    {
        "arg": "first-missing-positive",
        "titleUS": "41 First Missing Positive",
        "titleCN": "41 缺失的第一个正数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 First Missing Positive"
    },
    {
        "arg": "trapping-rain-water",
        "titleUS": "42 Trapping Rain Water",
        "titleCN": "42 接雨水",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Trapping Rain Water"
    },
    {
        "arg": "multiply-strings",
        "titleUS": "43 Multiply Strings",
        "titleCN": "43 字符串相乘",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Multiply Strings"
    },
    {
        "arg": "wildcard-matching",
        "titleUS": "44 Wildcard Matching",
        "titleCN": "44 通配符匹配",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Wildcard Matching"
    },
    {
        "arg": "jump-game-ii",
        "titleUS": "45 Jump Game II",
        "titleCN": "45 跳跃游戏 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Jump Game II"
    },
    {
        "arg": "permutations",
        "titleUS": "46 Permutations",
        "titleCN": "46 全排列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Permutations"
    },
    {
        "arg": "permutations-ii",
        "titleUS": "47 Permutations II",
        "titleCN": "47 全排列 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Permutations II"
    },
    {
        "arg": "rotate-image",
        "titleUS": "48 Rotate Image",
        "titleCN": "48 旋转图像",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Rotate Image"
    },
    {
        "arg": "group-anagrams",
        "titleUS": "49 Group Anagrams",
        "titleCN": "49 字母异位词分组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Group Anagrams"
    },
    {
        "arg": "powx-n",
        "titleUS": "50 Pow(x, n)",
        "titleCN": "50 Pow(x, n)",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Pow(x, n)"
    },
    {
        "arg": "n-queens",
        "titleUS": "51 N-Queens",
        "titleCN": "51 N 皇后",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 N-Queens"
    },
    {
        "arg": "n-queens-ii",
        "titleUS": "52 N-Queens II",
        "titleCN": "52 N 皇后 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 N-Queens II"
    },
    {
        "arg": "maximum-subarray",
        "titleUS": "53 Maximum Subarray",
        "titleCN": "53 最大子数组和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Subarray"
    },
    {
        "arg": "spiral-matrix",
        "titleUS": "54 Spiral Matrix",
        "titleCN": "54 螺旋矩阵",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Spiral Matrix"
    },
    {
        "arg": "jump-game",
        "titleUS": "55 Jump Game",
        "titleCN": "55 跳跃游戏",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Jump Game"
    },
    {
        "arg": "merge-intervals",
        "titleUS": "56 Merge Intervals",
        "titleCN": "56 合并区间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Merge Intervals"
    },
    {
        "arg": "insert-interval",
        "titleUS": "57 Insert Interval",
        "titleCN": "57 插入区间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Insert Interval"
    },
    {
        "arg": "length-of-last-word",
        "titleUS": "58 Length of Last Word",
        "titleCN": "58 最后一个单词的长度",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Length of Last Word"
    },
    {
        "arg": "spiral-matrix-ii",
        "titleUS": "59 Spiral Matrix II",
        "titleCN": "59 螺旋矩阵 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Spiral Matrix II"
    },
    {
        "arg": "permutation-sequence",
        "titleUS": "60 Permutation Sequence",
        "titleCN": "60 排列序列",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Permutation Sequence"
    },
    {
        "arg": "rotate-list",
        "titleUS": "61 Rotate List",
        "titleCN": "61 旋转链表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Rotate List"
    },
    {
        "arg": "unique-paths",
        "titleUS": "62 Unique Paths",
        "titleCN": "62 不同路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Unique Paths"
    },
    {
        "arg": "unique-paths-ii",
        "titleUS": "63 Unique Paths II",
        "titleCN": "63 不同路径 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Unique Paths II"
    },
    {
        "arg": "minimum-path-sum",
        "titleUS": "64 Minimum Path Sum",
        "titleCN": "64 最小路径和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Path Sum"
    },
    {
        "arg": "valid-number",
        "titleUS": "65 Valid Number",
        "titleCN": "65 有效数字",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Valid Number"
    },
    {
        "arg": "plus-one",
        "titleUS": "66 Plus One",
        "titleCN": "66 加一",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Plus One"
    },
    {
        "arg": "add-binary",
        "titleUS": "67 Add Binary",
        "titleCN": "67 二进制求和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Add Binary"
    },
    {
        "arg": "text-justification",
        "titleUS": "68 Text Justification",
        "titleCN": "68 文本左右对齐",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Text Justification"
    },
    {
        "arg": "sqrtx",
        "titleUS": "69 Sqrt(x)",
        "titleCN": "69 x 的平方根 ",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sqrt(x)"
    },
    {
        "arg": "climbing-stairs",
        "titleUS": "70 Climbing Stairs",
        "titleCN": "70 爬楼梯",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Climbing Stairs"
    },
    {
        "arg": "simplify-path",
        "titleUS": "71 Simplify Path",
        "titleCN": "71 简化路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Simplify Path"
    },
    {
        "arg": "edit-distance",
        "titleUS": "72 Edit Distance",
        "titleCN": "72 编辑距离",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Edit Distance"
    },
    {
        "arg": "set-matrix-zeroes",
        "titleUS": "73 Set Matrix Zeroes",
        "titleCN": "73 矩阵置零",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Set Matrix Zeroes"
    },
    {
        "arg": "search-a-2d-matrix",
        "titleUS": "74 Search a 2D Matrix",
        "titleCN": "74 搜索二维矩阵",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Search a 2D Matrix"
    },
    {
        "arg": "sort-colors",
        "titleUS": "75 Sort Colors",
        "titleCN": "75 颜色分类",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sort Colors"
    },
    {
        "arg": "minimum-window-substring",
        "titleUS": "76 Minimum Window Substring",
        "titleCN": "76 最小覆盖子串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Window Substring"
    },
    {
        "arg": "combinations",
        "titleUS": "77 Combinations",
        "titleCN": "77 组合",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Combinations"
    },
    {
        "arg": "subsets",
        "titleUS": "78 Subsets",
        "titleCN": "78 子集",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Subsets"
    },
    {
        "arg": "word-search",
        "titleUS": "79 Word Search",
        "titleCN": "79 单词搜索",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Word Search"
    },
    {
        "arg": "remove-duplicates-from-sorted-array-ii",
        "titleUS": "80 Remove Duplicates from Sorted Array II",
        "titleCN": "80 删除有序数组中的重复项 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Remove Duplicates from Sorted Array II"
    },
    {
        "arg": "search-in-rotated-sorted-array-ii",
        "titleUS": "81 Search in Rotated Sorted Array II",
        "titleCN": "81 搜索旋转排序数组 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Search in Rotated Sorted Array II"
    },
    {
        "arg": "remove-duplicates-from-sorted-list-ii",
        "titleUS": "82 Remove Duplicates from Sorted List II",
        "titleCN": "82 删除排序链表中的重复元素 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Remove Duplicates from Sorted List II"
    },
    {
        "arg": "remove-duplicates-from-sorted-list",
        "titleUS": "83 Remove Duplicates from Sorted List",
        "titleCN": "83 删除排序链表中的重复元素",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Remove Duplicates from Sorted List"
    },
    {
        "arg": "largest-rectangle-in-histogram",
        "titleUS": "84 Largest Rectangle in Histogram",
        "titleCN": "84 柱状图中最大的矩形",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Largest Rectangle in Histogram"
    },
    {
        "arg": "maximal-rectangle",
        "titleUS": "85 Maximal Rectangle",
        "titleCN": "85 最大矩形",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximal Rectangle"
    },
    {
        "arg": "partition-list",
        "titleUS": "86 Partition List",
        "titleCN": "86 分隔链表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Partition List"
    },
    {
        "arg": "scramble-string",
        "titleUS": "87 Scramble String",
        "titleCN": "87 扰乱字符串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Scramble String"
    },
    {
        "arg": "merge-sorted-array",
        "titleUS": "88 Merge Sorted Array",
        "titleCN": "88 合并两个有序数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Merge Sorted Array"
    },
    {
        "arg": "gray-code",
        "titleUS": "89 Gray Code",
        "titleCN": "89 格雷编码",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Gray Code"
    },
    {
        "arg": "subsets-ii",
        "titleUS": "90 Subsets II",
        "titleCN": "90 子集 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Subsets II"
    },
    {
        "arg": "decode-ways",
        "titleUS": "91 Decode Ways",
        "titleCN": "91 解码方法",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Decode Ways"
    },
    {
        "arg": "reverse-linked-list-ii",
        "titleUS": "92 Reverse Linked List II",
        "titleCN": "92 反转链表 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reverse Linked List II"
    },
    {
        "arg": "restore-ip-addresses",
        "titleUS": "93 Restore IP Addresses",
        "titleCN": "93 复原 IP 地址",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Restore IP Addresses"
    },
    {
        "arg": "binary-tree-inorder-traversal",
        "titleUS": "94 Binary Tree Inorder Traversal",
        "titleCN": "94 二叉树的中序遍历",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Binary Tree Inorder Traversal"
    },
    {
        "arg": "unique-binary-search-trees-ii",
        "titleUS": "95 Unique Binary Search Trees II",
        "titleCN": "95 不同的二叉搜索树 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Unique Binary Search Trees II"
    },
    {
        "arg": "unique-binary-search-trees",
        "titleUS": "96 Unique Binary Search Trees",
        "titleCN": "96 不同的二叉搜索树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Unique Binary Search Trees"
    },
    {
        "arg": "interleaving-string",
        "titleUS": "97 Interleaving String",
        "titleCN": "97 交错字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Interleaving String"
    },
    {
        "arg": "validate-binary-search-tree",
        "titleUS": "98 Validate Binary Search Tree",
        "titleCN": "98 验证二叉搜索树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Validate Binary Search Tree"
    },
    {
        "arg": "recover-binary-search-tree",
        "titleUS": "99 Recover Binary Search Tree",
        "titleCN": "99 恢复二叉搜索树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Recover Binary Search Tree"
    },
    {
        "arg": "same-tree",
        "titleUS": "100 Same Tree",
        "titleCN": "100 相同的树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Same Tree"
    },
    {
        "arg": "symmetric-tree",
        "titleUS": "101 Symmetric Tree",
        "titleCN": "101 对称二叉树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Symmetric Tree"
    },
    {
        "arg": "binary-tree-level-order-traversal",
        "titleUS": "102 Binary Tree Level Order Traversal",
        "titleCN": "102 二叉树的层序遍历",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Binary Tree Level Order Traversal"
    },
    {
        "arg": "binary-tree-zigzag-level-order-traversal",
        "titleUS": "103 Binary Tree Zigzag Level Order Traversal",
        "titleCN": "103 二叉树的锯齿形层序遍历",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Binary Tree Zigzag Level Order Traversal"
    },
    {
        "arg": "maximum-depth-of-binary-tree",
        "titleUS": "104 Maximum Depth of Binary Tree",
        "titleCN": "104 二叉树的最大深度",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Depth of Binary Tree"
    },
    {
        "arg": "construct-binary-tree-from-preorder-and-inorder-traversal",
        "titleUS": "105 Construct Binary Tree from Preorder and Inorder Traversal",
        "titleCN": "105 从前序与中序遍历序列构造二叉树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Construct Binary Tree from Preorder and Inorder Traversal"
    },
    {
        "arg": "construct-binary-tree-from-inorder-and-postorder-traversal",
        "titleUS": "106 Construct Binary Tree from Inorder and Postorder Traversal",
        "titleCN": "106 从中序与后序遍历序列构造二叉树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Construct Binary Tree from Inorder and Postorder Traversal"
    },
    {
        "arg": "binary-tree-level-order-traversal-ii",
        "titleUS": "107 Binary Tree Level Order Traversal II",
        "titleCN": "107 二叉树的层序遍历 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Binary Tree Level Order Traversal II"
    },
    {
        "arg": "convert-sorted-array-to-binary-search-tree",
        "titleUS": "108 Convert Sorted Array to Binary Search Tree",
        "titleCN": "108 将有序数组转换为二叉搜索树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Convert Sorted Array to Binary Search Tree"
    },
    {
        "arg": "convert-sorted-list-to-binary-search-tree",
        "titleUS": "109 Convert Sorted List to Binary Search Tree",
        "titleCN": "109 有序链表转换二叉搜索树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Convert Sorted List to Binary Search Tree"
    },
    {
        "arg": "balanced-binary-tree",
        "titleUS": "110 Balanced Binary Tree",
        "titleCN": "110 平衡二叉树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Balanced Binary Tree"
    },
    {
        "arg": "minimum-depth-of-binary-tree",
        "titleUS": "111 Minimum Depth of Binary Tree",
        "titleCN": "111 二叉树的最小深度",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Depth of Binary Tree"
    },
    {
        "arg": "path-sum",
        "titleUS": "112 Path Sum",
        "titleCN": "112 路径总和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Path Sum"
    },
    {
        "arg": "path-sum-ii",
        "titleUS": "113 Path Sum II",
        "titleCN": "113 路径总和 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Path Sum II"
    },
    {
        "arg": "flatten-binary-tree-to-linked-list",
        "titleUS": "114 Flatten Binary Tree to Linked List",
        "titleCN": "114 二叉树展开为链表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Flatten Binary Tree to Linked List"
    },
    {
        "arg": "distinct-subsequences",
        "titleUS": "115 Distinct Subsequences",
        "titleCN": "115 不同的子序列",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Distinct Subsequences"
    },
    {
        "arg": "populating-next-right-pointers-in-each-node",
        "titleUS": "116 Populating Next Right Pointers in Each Node",
        "titleCN": "116 填充每个节点的下一个右侧节点指针",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Populating Next Right Pointers in Each Node"
    },
    {
        "arg": "populating-next-right-pointers-in-each-node-ii",
        "titleUS": "117 Populating Next Right Pointers in Each Node II",
        "titleCN": "117 填充每个节点的下一个右侧节点指针 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Populating Next Right Pointers in Each Node II"
    },
    {
        "arg": "pascals-triangle",
        "titleUS": "118 Pascal's Triangle",
        "titleCN": "118 杨辉三角",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Pascal's Triangle"
    },
    {
        "arg": "pascals-triangle-ii",
        "titleUS": "119 Pascal's Triangle II",
        "titleCN": "119 杨辉三角 II",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Pascal's Triangle II"
    },
    {
        "arg": "triangle",
        "titleUS": "120 Triangle",
        "titleCN": "120 三角形最小路径和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Triangle"
    },
    {
        "arg": "best-time-to-buy-and-sell-stock",
        "titleUS": "121 Best Time to Buy and Sell Stock",
        "titleCN": "121 买卖股票的最佳时机",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Best Time to Buy and Sell Stock"
    },
    {
        "arg": "best-time-to-buy-and-sell-stock-ii",
        "titleUS": "122 Best Time to Buy and Sell Stock II",
        "titleCN": "122 买卖股票的最佳时机 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Best Time to Buy and Sell Stock II"
    },
    {
        "arg": "best-time-to-buy-and-sell-stock-iii",
        "titleUS": "123 Best Time to Buy and Sell Stock III",
        "titleCN": "123 买卖股票的最佳时机 III",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Best Time to Buy and Sell Stock III"
    },
    {
        "arg": "binary-tree-maximum-path-sum",
        "titleUS": "124 Binary Tree Maximum Path Sum",
        "titleCN": "124 二叉树中的最大路径和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Binary Tree Maximum Path Sum"
    },
    {
        "arg": "valid-palindrome",
        "titleUS": "125 Valid Palindrome",
        "titleCN": "125 验证回文串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Valid Palindrome"
    },
    {
        "arg": "word-ladder-ii",
        "titleUS": "126 Word Ladder II",
        "titleCN": "126 单词接龙 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Word Ladder II"
    },
    {
        "arg": "word-ladder",
        "titleUS": "127 Word Ladder",
        "titleCN": "127 单词接龙",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Word Ladder"
    },
    {
        "arg": "longest-consecutive-sequence",
        "titleUS": "128 Longest Consecutive Sequence",
        "titleCN": "128 最长连续序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Consecutive Sequence"
    },
    {
        "arg": "sum-root-to-leaf-numbers",
        "titleUS": "129 Sum Root to Leaf Numbers",
        "titleCN": "129 求根节点到叶节点数字之和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum Root to Leaf Numbers"
    },
    {
        "arg": "surrounded-regions",
        "titleUS": "130 Surrounded Regions",
        "titleCN": "130 被围绕的区域",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Surrounded Regions"
    },
    {
        "arg": "palindrome-partitioning",
        "titleUS": "131 Palindrome Partitioning",
        "titleCN": "131 分割回文串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Palindrome Partitioning"
    },
    {
        "arg": "palindrome-partitioning-ii",
        "titleUS": "132 Palindrome Partitioning II",
        "titleCN": "132 分割回文串 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Palindrome Partitioning II"
    },
    {
        "arg": "clone-graph",
        "titleUS": "133 Clone Graph",
        "titleCN": "133 克隆图",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Clone Graph"
    },
    {
        "arg": "gas-station",
        "titleUS": "134 Gas Station",
        "titleCN": "134 加油站",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Gas Station"
    },
    {
        "arg": "candy",
        "titleUS": "135 Candy",
        "titleCN": "135 分发糖果",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Candy"
    },
    {
        "arg": "single-number",
        "titleUS": "136 Single Number",
        "titleCN": "136 只出现一次的数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Single Number"
    },
    {
        "arg": "single-number-ii",
        "titleUS": "137 Single Number II",
        "titleCN": "137 只出现一次的数字 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Single Number II"
    },
    {
        "arg": "copy-list-with-random-pointer",
        "titleUS": "138 Copy List with Random Pointer",
        "titleCN": "138 随机链表的复制",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Copy List with Random Pointer"
    },
    {
        "arg": "word-break",
        "titleUS": "139 Word Break",
        "titleCN": "139 单词拆分",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Word Break"
    },
    {
        "arg": "word-break-ii",
        "titleUS": "140 Word Break II",
        "titleCN": "140 单词拆分 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Word Break II"
    },
    {
        "arg": "linked-list-cycle",
        "titleUS": "141 Linked List Cycle",
        "titleCN": "141 环形链表",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Linked List Cycle"
    },
    {
        "arg": "linked-list-cycle-ii",
        "titleUS": "142 Linked List Cycle II",
        "titleCN": "142 环形链表 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Linked List Cycle II"
    },
    {
        "arg": "reorder-list",
        "titleUS": "143 Reorder List",
        "titleCN": "143 重排链表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reorder List"
    },
    {
        "arg": "binary-tree-preorder-traversal",
        "titleUS": "144 Binary Tree Preorder Traversal",
        "titleCN": "144 二叉树的前序遍历",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Binary Tree Preorder Traversal"
    },
    {
        "arg": "binary-tree-postorder-traversal",
        "titleUS": "145 Binary Tree Postorder Traversal",
        "titleCN": "145 二叉树的后序遍历",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Binary Tree Postorder Traversal"
    },
    {
        "arg": "lru-cache",
        "titleUS": "146 LRU Cache",
        "titleCN": "146 LRU 缓存",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 LRU Cache"
    },
    {
        "arg": "insertion-sort-list",
        "titleUS": "147 Insertion Sort List",
        "titleCN": "147 对链表进行插入排序",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Insertion Sort List"
    },
    {
        "arg": "sort-list",
        "titleUS": "148 Sort List",
        "titleCN": "148 排序链表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sort List"
    },
    {
        "arg": "max-points-on-a-line",
        "titleUS": "149 Max Points on a Line",
        "titleCN": "149 直线上最多的点数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Max Points on a Line"
    },
    {
        "arg": "evaluate-reverse-polish-notation",
        "titleUS": "150 Evaluate Reverse Polish Notation",
        "titleCN": "150 逆波兰表达式求值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Evaluate Reverse Polish Notation"
    },
    {
        "arg": "reverse-words-in-a-string",
        "titleUS": "151 Reverse Words in a String",
        "titleCN": "151 反转字符串中的单词",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reverse Words in a String"
    },
    {
        "arg": "maximum-product-subarray",
        "titleUS": "152 Maximum Product Subarray",
        "titleCN": "152 乘积最大子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Product Subarray"
    },
    {
        "arg": "find-minimum-in-rotated-sorted-array",
        "titleUS": "153 Find Minimum in Rotated Sorted Array",
        "titleCN": "153 寻找旋转排序数组中的最小值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Minimum in Rotated Sorted Array"
    },
    {
        "arg": "find-minimum-in-rotated-sorted-array-ii",
        "titleUS": "154 Find Minimum in Rotated Sorted Array II",
        "titleCN": "154 寻找旋转排序数组中的最小值 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find Minimum in Rotated Sorted Array II"
    },
    {
        "arg": "min-stack",
        "titleUS": "155 Min Stack",
        "titleCN": "155 最小栈",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Min Stack"
    },
    {
        "arg": "binary-tree-upside-down",
        "titleUS": "156 Binary Tree Upside Down",
        "titleCN": "156 上下翻转二叉树",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Binary Tree Upside Down"
    },
    {
        "arg": "read-n-characters-given-read4",
        "titleUS": "157 Read N Characters Given Read4",
        "titleCN": "157 用 Read4 读取 N 个字符",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Read N Characters Given Read4"
    },
    {
        "arg": "read-n-characters-given-read4-ii-call-multiple-times",
        "titleUS": "158 Read N Characters Given read4 II - Call Multiple Times",
        "titleCN": "158 用 Read4 读取 N 个字符 II - 多次调用",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Read N Characters Given read4 II - Call Multiple Times"
    },
    {
        "arg": "longest-substring-with-at-most-two-distinct-characters",
        "titleUS": "159 Longest Substring with At Most Two Distinct Characters",
        "titleCN": "159 至多包含两个不同字符的最长子串",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Longest Substring with At Most Two Distinct Characters"
    },
    {
        "arg": "intersection-of-two-linked-lists",
        "titleUS": "160 Intersection of Two Linked Lists",
        "titleCN": "160 相交链表",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Intersection of Two Linked Lists"
    },
    {
        "arg": "one-edit-distance",
        "titleUS": "161 One Edit Distance",
        "titleCN": "161 相隔为 1 的编辑距离",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 One Edit Distance"
    },
    {
        "arg": "find-peak-element",
        "titleUS": "162 Find Peak Element",
        "titleCN": "162 寻找峰值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Peak Element"
    },
    {
        "arg": "missing-ranges",
        "titleUS": "163 Missing Ranges",
        "titleCN": "163 缺失的区间",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Missing Ranges"
    },
    {
        "arg": "maximum-gap",
        "titleUS": "164 Maximum Gap",
        "titleCN": "164 最大间距",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Gap"
    },
    {
        "arg": "compare-version-numbers",
        "titleUS": "165 Compare Version Numbers",
        "titleCN": "165 比较版本号",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Compare Version Numbers"
    },
    {
        "arg": "fraction-to-recurring-decimal",
        "titleUS": "166 Fraction to Recurring Decimal",
        "titleCN": "166 分数到小数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Fraction to Recurring Decimal"
    },
    {
        "arg": "two-sum-ii-input-array-is-sorted",
        "titleUS": "167 Two Sum II - Input Array Is Sorted",
        "titleCN": "167 两数之和 II - 输入有序数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Two Sum II - Input Array Is Sorted"
    },
    {
        "arg": "excel-sheet-column-title",
        "titleUS": "168 Excel Sheet Column Title",
        "titleCN": "168 Excel表列名称",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Excel Sheet Column Title"
    },
    {
        "arg": "majority-element",
        "titleUS": "169 Majority Element",
        "titleCN": "169 多数元素",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Majority Element"
    },
    {
        "arg": "two-sum-iii-data-structure-design",
        "titleUS": "170 Two Sum III - Data structure design",
        "titleCN": "170 两数之和 III - 数据结构设计",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Two Sum III - Data structure design"
    },
    {
        "arg": "excel-sheet-column-number",
        "titleUS": "171 Excel Sheet Column Number",
        "titleCN": "171 Excel 表列序号",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Excel Sheet Column Number"
    },
    {
        "arg": "factorial-trailing-zeroes",
        "titleUS": "172 Factorial Trailing Zeroes",
        "titleCN": "172 阶乘后的零",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Factorial Trailing Zeroes"
    },
    {
        "arg": "binary-search-tree-iterator",
        "titleUS": "173 Binary Search Tree Iterator",
        "titleCN": "173 二叉搜索树迭代器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Binary Search Tree Iterator"
    },
    {
        "arg": "dungeon-game",
        "titleUS": "174 Dungeon Game",
        "titleCN": "174 地下城游戏",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Dungeon Game"
    },
    {
        "arg": "largest-number",
        "titleUS": "179 Largest Number",
        "titleCN": "179 最大数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Largest Number"
    },
    {
        "arg": "reverse-words-in-a-string-ii",
        "titleUS": "186 Reverse Words in a String II",
        "titleCN": "186 反转字符串中的单词 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Reverse Words in a String II"
    },
    {
        "arg": "repeated-dna-sequences",
        "titleUS": "187 Repeated DNA Sequences",
        "titleCN": "187 重复的DNA序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Repeated DNA Sequences"
    },
    {
        "arg": "best-time-to-buy-and-sell-stock-iv",
        "titleUS": "188 Best Time to Buy and Sell Stock IV",
        "titleCN": "188 买卖股票的最佳时机 IV",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Best Time to Buy and Sell Stock IV"
    },
    {
        "arg": "rotate-array",
        "titleUS": "189 Rotate Array",
        "titleCN": "189 轮转数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Rotate Array"
    },
    {
        "arg": "reverse-bits",
        "titleUS": "190 Reverse Bits",
        "titleCN": "190 颠倒二进制位",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Reverse Bits"
    },
    {
        "arg": "number-of-1-bits",
        "titleUS": "191 Number of 1 Bits",
        "titleCN": "191 位1的个数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of 1 Bits"
    },
    {
        "arg": "house-robber",
        "titleUS": "198 House Robber",
        "titleCN": "198 打家劫舍",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 House Robber"
    },
    {
        "arg": "binary-tree-right-side-view",
        "titleUS": "199 Binary Tree Right Side View",
        "titleCN": "199 二叉树的右视图",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Binary Tree Right Side View"
    },
    {
        "arg": "number-of-islands",
        "titleUS": "200 Number of Islands",
        "titleCN": "200 岛屿数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Islands"
    },
    {
        "arg": "bitwise-and-of-numbers-range",
        "titleUS": "201 Bitwise AND of Numbers Range",
        "titleCN": "201 数字范围按位与",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Bitwise AND of Numbers Range"
    },
    {
        "arg": "happy-number",
        "titleUS": "202 Happy Number",
        "titleCN": "202 快乐数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Happy Number"
    },
    {
        "arg": "remove-linked-list-elements",
        "titleUS": "203 Remove Linked List Elements",
        "titleCN": "203 移除链表元素",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Remove Linked List Elements"
    },
    {
        "arg": "count-primes",
        "titleUS": "204 Count Primes",
        "titleCN": "204 计数质数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Primes"
    },
    {
        "arg": "isomorphic-strings",
        "titleUS": "205 Isomorphic Strings",
        "titleCN": "205 同构字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Isomorphic Strings"
    },
    {
        "arg": "reverse-linked-list",
        "titleUS": "206 Reverse Linked List",
        "titleCN": "206 反转链表",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Reverse Linked List"
    },
    {
        "arg": "course-schedule",
        "titleUS": "207 Course Schedule",
        "titleCN": "207 课程表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Course Schedule"
    },
    {
        "arg": "implement-trie-prefix-tree",
        "titleUS": "208 Implement Trie (Prefix Tree)",
        "titleCN": "208 实现 Trie (前缀树)",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Implement Trie (Prefix Tree)"
    },
    {
        "arg": "minimum-size-subarray-sum",
        "titleUS": "209 Minimum Size Subarray Sum",
        "titleCN": "209 长度最小的子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Size Subarray Sum"
    },
    {
        "arg": "course-schedule-ii",
        "titleUS": "210 Course Schedule II",
        "titleCN": "210 课程表 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Course Schedule II"
    },
    {
        "arg": "design-add-and-search-words-data-structure",
        "titleUS": "211 Design Add and Search Words Data Structure",
        "titleCN": "211 添加与搜索单词 - 数据结构设计",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Design Add and Search Words Data Structure"
    },
    {
        "arg": "word-search-ii",
        "titleUS": "212 Word Search II",
        "titleCN": "212 单词搜索 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Word Search II"
    },
    {
        "arg": "house-robber-ii",
        "titleUS": "213 House Robber II",
        "titleCN": "213 打家劫舍 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 House Robber II"
    },
    {
        "arg": "shortest-palindrome",
        "titleUS": "214 Shortest Palindrome",
        "titleCN": "214 最短回文串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Shortest Palindrome"
    },
    {
        "arg": "kth-largest-element-in-an-array",
        "titleUS": "215 Kth Largest Element in an Array",
        "titleCN": "215 数组中的第K个最大元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Kth Largest Element in an Array"
    },
    {
        "arg": "combination-sum-iii",
        "titleUS": "216 Combination Sum III",
        "titleCN": "216 组合总和 III",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Combination Sum III"
    },
    {
        "arg": "contains-duplicate",
        "titleUS": "217 Contains Duplicate",
        "titleCN": "217 存在重复元素",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Contains Duplicate"
    },
    {
        "arg": "the-skyline-problem",
        "titleUS": "218 The Skyline Problem",
        "titleCN": "218 天际线问题",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 The Skyline Problem"
    },
    {
        "arg": "contains-duplicate-ii",
        "titleUS": "219 Contains Duplicate II",
        "titleCN": "219 存在重复元素 II",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Contains Duplicate II"
    },
    {
        "arg": "contains-duplicate-iii",
        "titleUS": "220 Contains Duplicate III",
        "titleCN": "220 存在重复元素 III",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Contains Duplicate III"
    },
    {
        "arg": "maximal-square",
        "titleUS": "221 Maximal Square",
        "titleCN": "221 最大正方形",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximal Square"
    },
    {
        "arg": "count-complete-tree-nodes",
        "titleUS": "222 Count Complete Tree Nodes",
        "titleCN": "222 完全二叉树的节点个数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Complete Tree Nodes"
    },
    {
        "arg": "rectangle-area",
        "titleUS": "223 Rectangle Area",
        "titleCN": "223 矩形面积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Rectangle Area"
    },
    {
        "arg": "basic-calculator",
        "titleUS": "224 Basic Calculator",
        "titleCN": "224 基本计算器",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Basic Calculator"
    },
    {
        "arg": "implement-stack-using-queues",
        "titleUS": "225 Implement Stack using Queues",
        "titleCN": "225 用队列实现栈",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Implement Stack using Queues"
    },
    {
        "arg": "invert-binary-tree",
        "titleUS": "226 Invert Binary Tree",
        "titleCN": "226 翻转二叉树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Invert Binary Tree"
    },
    {
        "arg": "basic-calculator-ii",
        "titleUS": "227 Basic Calculator II",
        "titleCN": "227 基本计算器 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Basic Calculator II"
    },
    {
        "arg": "summary-ranges",
        "titleUS": "228 Summary Ranges",
        "titleCN": "228 汇总区间",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Summary Ranges"
    },
    {
        "arg": "majority-element-ii",
        "titleUS": "229 Majority Element II",
        "titleCN": "229 多数元素 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Majority Element II"
    },
    {
        "arg": "kth-smallest-element-in-a-bst",
        "titleUS": "230 Kth Smallest Element in a BST",
        "titleCN": "230 二叉搜索树中第K小的元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Kth Smallest Element in a BST"
    },
    {
        "arg": "power-of-two",
        "titleUS": "231 Power of Two",
        "titleCN": "231 2 的幂",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Power of Two"
    },
    {
        "arg": "implement-queue-using-stacks",
        "titleUS": "232 Implement Queue using Stacks",
        "titleCN": "232 用栈实现队列",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Implement Queue using Stacks"
    },
    {
        "arg": "number-of-digit-one",
        "titleUS": "233 Number of Digit One",
        "titleCN": "233 数字 1 的个数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Digit One"
    },
    {
        "arg": "palindrome-linked-list",
        "titleUS": "234 Palindrome Linked List",
        "titleCN": "234 回文链表",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Palindrome Linked List"
    },
    {
        "arg": "lowest-common-ancestor-of-a-binary-search-tree",
        "titleUS": "235 Lowest Common Ancestor of a Binary Search Tree",
        "titleCN": "235 二叉搜索树的最近公共祖先",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Lowest Common Ancestor of a Binary Search Tree"
    },
    {
        "arg": "lowest-common-ancestor-of-a-binary-tree",
        "titleUS": "236 Lowest Common Ancestor of a Binary Tree",
        "titleCN": "236 二叉树的最近公共祖先",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Lowest Common Ancestor of a Binary Tree"
    },
    {
        "arg": "delete-node-in-a-linked-list",
        "titleUS": "237 Delete Node in a Linked List",
        "titleCN": "237 删除链表中的节点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Delete Node in a Linked List"
    },
    {
        "arg": "product-of-array-except-self",
        "titleUS": "238 Product of Array Except Self",
        "titleCN": "238 除自身以外数组的乘积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Product of Array Except Self"
    },
    {
        "arg": "sliding-window-maximum",
        "titleUS": "239 Sliding Window Maximum",
        "titleCN": "239 滑动窗口最大值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Sliding Window Maximum"
    },
    {
        "arg": "search-a-2d-matrix-ii",
        "titleUS": "240 Search a 2D Matrix II",
        "titleCN": "240 搜索二维矩阵 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Search a 2D Matrix II"
    },
    {
        "arg": "different-ways-to-add-parentheses",
        "titleUS": "241 Different Ways to Add Parentheses",
        "titleCN": "241 为运算表达式设计优先级",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Different Ways to Add Parentheses"
    },
    {
        "arg": "valid-anagram",
        "titleUS": "242 Valid Anagram",
        "titleCN": "242 有效的字母异位词",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Valid Anagram"
    },
    {
        "arg": "shortest-word-distance",
        "titleUS": "243 Shortest Word Distance",
        "titleCN": "243 最短单词距离",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Shortest Word Distance"
    },
    {
        "arg": "shortest-word-distance-ii",
        "titleUS": "244 Shortest Word Distance II",
        "titleCN": "244 最短单词距离 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Shortest Word Distance II"
    },
    {
        "arg": "shortest-word-distance-iii",
        "titleUS": "245 Shortest Word Distance III",
        "titleCN": "245 最短单词距离 III",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Shortest Word Distance III"
    },
    {
        "arg": "strobogrammatic-number",
        "titleUS": "246 Strobogrammatic Number",
        "titleCN": "246 中心对称数",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Strobogrammatic Number"
    },
    {
        "arg": "strobogrammatic-number-ii",
        "titleUS": "247 Strobogrammatic Number II",
        "titleCN": "247 中心对称数 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Strobogrammatic Number II"
    },
    {
        "arg": "strobogrammatic-number-iii",
        "titleUS": "248 Strobogrammatic Number III",
        "titleCN": "248 中心对称数 III",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Strobogrammatic Number III"
    },
    {
        "arg": "group-shifted-strings",
        "titleUS": "249 Group Shifted Strings",
        "titleCN": "249 移位字符串分组",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Group Shifted Strings"
    },
    {
        "arg": "count-univalue-subtrees",
        "titleUS": "250 Count Univalue Subtrees",
        "titleCN": "250 统计同值子树",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Count Univalue Subtrees"
    },
    {
        "arg": "flatten-2d-vector",
        "titleUS": "251 Flatten 2D Vector",
        "titleCN": "251 展开二维向量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Flatten 2D Vector"
    },
    {
        "arg": "meeting-rooms",
        "titleUS": "252 Meeting Rooms",
        "titleCN": "252 会议室",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Meeting Rooms"
    },
    {
        "arg": "meeting-rooms-ii",
        "titleUS": "253 Meeting Rooms II",
        "titleCN": "253 会议室 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Meeting Rooms II"
    },
    {
        "arg": "factor-combinations",
        "titleUS": "254 Factor Combinations",
        "titleCN": "254 因子的组合",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Factor Combinations"
    },
    {
        "arg": "verify-preorder-sequence-in-binary-search-tree",
        "titleUS": "255 Verify Preorder Sequence in Binary Search Tree",
        "titleCN": "255 验证二叉搜索树的前序遍历序列",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Verify Preorder Sequence in Binary Search Tree"
    },
    {
        "arg": "paint-house",
        "titleUS": "256 Paint House",
        "titleCN": "256 粉刷房子",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Paint House"
    },
    {
        "arg": "binary-tree-paths",
        "titleUS": "257 Binary Tree Paths",
        "titleCN": "257 二叉树的所有路径",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Binary Tree Paths"
    },
    {
        "arg": "add-digits",
        "titleUS": "258 Add Digits",
        "titleCN": "258 各位相加",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Add Digits"
    },
    {
        "arg": "3sum-smaller",
        "titleUS": "259 3Sum Smaller",
        "titleCN": "259 较小的三数之和",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 3Sum Smaller"
    },
    {
        "arg": "single-number-iii",
        "titleUS": "260 Single Number III",
        "titleCN": "260 只出现一次的数字 III",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Single Number III"
    },
    {
        "arg": "graph-valid-tree",
        "titleUS": "261 Graph Valid Tree",
        "titleCN": "261 以图判树",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Graph Valid Tree"
    },
    {
        "arg": "ugly-number",
        "titleUS": "263 Ugly Number",
        "titleCN": "263 丑数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Ugly Number"
    },
    {
        "arg": "ugly-number-ii",
        "titleUS": "264 Ugly Number II",
        "titleCN": "264 丑数 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Ugly Number II"
    },
    {
        "arg": "paint-house-ii",
        "titleUS": "265 Paint House II",
        "titleCN": "265 粉刷房子 II",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Paint House II"
    },
    {
        "arg": "palindrome-permutation",
        "titleUS": "266 Palindrome Permutation",
        "titleCN": "266 回文排列",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Palindrome Permutation"
    },
    {
        "arg": "palindrome-permutation-ii",
        "titleUS": "267 Palindrome Permutation II",
        "titleCN": "267 回文排列 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Palindrome Permutation II"
    },
    {
        "arg": "missing-number",
        "titleUS": "268 Missing Number",
        "titleCN": "268 丢失的数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Missing Number"
    },
    {
        "arg": "alien-dictionary",
        "titleUS": "269 Alien Dictionary",
        "titleCN": "269 火星词典",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Alien Dictionary"
    },
    {
        "arg": "closest-binary-search-tree-value",
        "titleUS": "270 Closest Binary Search Tree Value",
        "titleCN": "270 最接近的二叉搜索树值",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Closest Binary Search Tree Value"
    },
    {
        "arg": "encode-and-decode-strings",
        "titleUS": "271 Encode and Decode Strings",
        "titleCN": "271 字符串的编码与解码",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Encode and Decode Strings"
    },
    {
        "arg": "closest-binary-search-tree-value-ii",
        "titleUS": "272 Closest Binary Search Tree Value II",
        "titleCN": "272 最接近的二叉搜索树值 II",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Closest Binary Search Tree Value II"
    },
    {
        "arg": "integer-to-english-words",
        "titleUS": "273 Integer to English Words",
        "titleCN": "273 整数转换英文表示",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Integer to English Words"
    },
    {
        "arg": "h-index",
        "titleUS": "274 H-Index",
        "titleCN": "274 H 指数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 H-Index"
    },
    {
        "arg": "h-index-ii",
        "titleUS": "275 H-Index II",
        "titleCN": "275 H 指数 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 H-Index II"
    },
    {
        "arg": "paint-fence",
        "titleUS": "276 Paint Fence",
        "titleCN": "276 栅栏涂色",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Paint Fence"
    },
    {
        "arg": "find-the-celebrity",
        "titleUS": "277 Find the Celebrity",
        "titleCN": "277 搜寻名人",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Find the Celebrity"
    },
    {
        "arg": "first-bad-version",
        "titleUS": "278 First Bad Version",
        "titleCN": "278 第一个错误的版本",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 First Bad Version"
    },
    {
        "arg": "perfect-squares",
        "titleUS": "279 Perfect Squares",
        "titleCN": "279 完全平方数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Perfect Squares"
    },
    {
        "arg": "wiggle-sort",
        "titleUS": "280 Wiggle Sort",
        "titleCN": "280 摆动排序",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Wiggle Sort"
    },
    {
        "arg": "zigzag-iterator",
        "titleUS": "281 Zigzag Iterator",
        "titleCN": "281 锯齿迭代器",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Zigzag Iterator"
    },
    {
        "arg": "expression-add-operators",
        "titleUS": "282 Expression Add Operators",
        "titleCN": "282 给表达式添加运算符",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Expression Add Operators"
    },
    {
        "arg": "move-zeroes",
        "titleUS": "283 Move Zeroes",
        "titleCN": "283 移动零",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Move Zeroes"
    },
    {
        "arg": "peeking-iterator",
        "titleUS": "284 Peeking Iterator",
        "titleCN": "284 窥视迭代器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Peeking Iterator"
    },
    {
        "arg": "inorder-successor-in-bst",
        "titleUS": "285 Inorder Successor in BST",
        "titleCN": "285 二叉搜索树中的中序后继",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Inorder Successor in BST"
    },
    {
        "arg": "walls-and-gates",
        "titleUS": "286 Walls and Gates",
        "titleCN": "286 墙与门",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Walls and Gates"
    },
    {
        "arg": "find-the-duplicate-number",
        "titleUS": "287 Find the Duplicate Number",
        "titleCN": "287 寻找重复数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Duplicate Number"
    },
    {
        "arg": "unique-word-abbreviation",
        "titleUS": "288 Unique Word Abbreviation",
        "titleCN": "288 单词的唯一缩写",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Unique Word Abbreviation"
    },
    {
        "arg": "game-of-life",
        "titleUS": "289 Game of Life",
        "titleCN": "289 生命游戏",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Game of Life"
    },
    {
        "arg": "word-pattern",
        "titleUS": "290 Word Pattern",
        "titleCN": "290 单词规律",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Word Pattern"
    },
    {
        "arg": "word-pattern-ii",
        "titleUS": "291 Word Pattern II",
        "titleCN": "291 单词规律 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Word Pattern II"
    },
    {
        "arg": "nim-game",
        "titleUS": "292 Nim Game",
        "titleCN": "292 Nim 游戏",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Nim Game"
    },
    {
        "arg": "flip-game",
        "titleUS": "293 Flip Game",
        "titleCN": "293 翻转游戏",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Flip Game"
    },
    {
        "arg": "flip-game-ii",
        "titleUS": "294 Flip Game II",
        "titleCN": "294 翻转游戏 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Flip Game II"
    },
    {
        "arg": "find-median-from-data-stream",
        "titleUS": "295 Find Median from Data Stream",
        "titleCN": "295 数据流的中位数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find Median from Data Stream"
    },
    {
        "arg": "best-meeting-point",
        "titleUS": "296 Best Meeting Point",
        "titleCN": "296 最佳的碰头地点",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Best Meeting Point"
    },
    {
        "arg": "serialize-and-deserialize-binary-tree",
        "titleUS": "297 Serialize and Deserialize Binary Tree",
        "titleCN": "297 二叉树的序列化与反序列化",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Serialize and Deserialize Binary Tree"
    },
    {
        "arg": "binary-tree-longest-consecutive-sequence",
        "titleUS": "298 Binary Tree Longest Consecutive Sequence",
        "titleCN": "298 二叉树最长连续序列",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Binary Tree Longest Consecutive Sequence"
    },
    {
        "arg": "bulls-and-cows",
        "titleUS": "299 Bulls and Cows",
        "titleCN": "299 猜数字游戏",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Bulls and Cows"
    },
    {
        "arg": "longest-increasing-subsequence",
        "titleUS": "300 Longest Increasing Subsequence",
        "titleCN": "300 最长递增子序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Increasing Subsequence"
    },
    {
        "arg": "remove-invalid-parentheses",
        "titleUS": "301 Remove Invalid Parentheses",
        "titleCN": "301 删除无效的括号",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Remove Invalid Parentheses"
    },
    {
        "arg": "smallest-rectangle-enclosing-black-pixels",
        "titleUS": "302 Smallest Rectangle Enclosing Black Pixels",
        "titleCN": "302 包含全部黑色像素的最小矩形",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Smallest Rectangle Enclosing Black Pixels"
    },
    {
        "arg": "range-sum-query-immutable",
        "titleUS": "303 Range Sum Query - Immutable",
        "titleCN": "303 区域和检索 - 数组不可变",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Range Sum Query - Immutable"
    },
    {
        "arg": "range-sum-query-2d-immutable",
        "titleUS": "304 Range Sum Query 2D - Immutable",
        "titleCN": "304 二维区域和检索 - 矩阵不可变",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Range Sum Query 2D - Immutable"
    },
    {
        "arg": "number-of-islands-ii",
        "titleUS": "305 Number of Islands II",
        "titleCN": "305 岛屿数量 II",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Number of Islands II"
    },
    {
        "arg": "additive-number",
        "titleUS": "306 Additive Number",
        "titleCN": "306 累加数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Additive Number"
    },
    {
        "arg": "range-sum-query-mutable",
        "titleUS": "307 Range Sum Query - Mutable",
        "titleCN": "307 区域和检索 - 数组可修改",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Range Sum Query - Mutable"
    },
    {
        "arg": "range-sum-query-2d-mutable",
        "titleUS": "308 Range Sum Query 2D - Mutable",
        "titleCN": "308 二维区域和检索 - 可变",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Range Sum Query 2D - Mutable"
    },
    {
        "arg": "best-time-to-buy-and-sell-stock-with-cooldown",
        "titleUS": "309 Best Time to Buy and Sell Stock with Cooldown",
        "titleCN": "309 买卖股票的最佳时机含冷冻期",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Best Time to Buy and Sell Stock with Cooldown"
    },
    {
        "arg": "minimum-height-trees",
        "titleUS": "310 Minimum Height Trees",
        "titleCN": "310 最小高度树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Height Trees"
    },
    {
        "arg": "sparse-matrix-multiplication",
        "titleUS": "311 Sparse Matrix Multiplication",
        "titleCN": "311 稀疏矩阵的乘法",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Sparse Matrix Multiplication"
    },
    {
        "arg": "burst-balloons",
        "titleUS": "312 Burst Balloons",
        "titleCN": "312 戳气球",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Burst Balloons"
    },
    {
        "arg": "super-ugly-number",
        "titleUS": "313 Super Ugly Number",
        "titleCN": "313 超级丑数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Super Ugly Number"
    },
    {
        "arg": "binary-tree-vertical-order-traversal",
        "titleUS": "314 Binary Tree Vertical Order Traversal",
        "titleCN": "314 二叉树的垂直遍历",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Binary Tree Vertical Order Traversal"
    },
    {
        "arg": "count-of-smaller-numbers-after-self",
        "titleUS": "315 Count of Smaller Numbers After Self",
        "titleCN": "315 计算右侧小于当前元素的个数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count of Smaller Numbers After Self"
    },
    {
        "arg": "remove-duplicate-letters",
        "titleUS": "316 Remove Duplicate Letters",
        "titleCN": "316 去除重复字母",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Remove Duplicate Letters"
    },
    {
        "arg": "shortest-distance-from-all-buildings",
        "titleUS": "317 Shortest Distance from All Buildings",
        "titleCN": "317 离建筑物最近的距离",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Shortest Distance from All Buildings"
    },
    {
        "arg": "maximum-product-of-word-lengths",
        "titleUS": "318 Maximum Product of Word Lengths",
        "titleCN": "318 最大单词长度乘积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Product of Word Lengths"
    },
    {
        "arg": "bulb-switcher",
        "titleUS": "319 Bulb Switcher",
        "titleCN": "319 灯泡开关",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Bulb Switcher"
    },
    {
        "arg": "generalized-abbreviation",
        "titleUS": "320 Generalized Abbreviation",
        "titleCN": "320 列举单词的全部缩写",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Generalized Abbreviation"
    },
    {
        "arg": "create-maximum-number",
        "titleUS": "321 Create Maximum Number",
        "titleCN": "321 拼接最大数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Create Maximum Number"
    },
    {
        "arg": "coin-change",
        "titleUS": "322 Coin Change",
        "titleCN": "322 零钱兑换",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Coin Change"
    },
    {
        "arg": "number-of-connected-components-in-an-undirected-graph",
        "titleUS": "323 Number of Connected Components in an Undirected Graph",
        "titleCN": "323 无向图中连通分量的数目",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Connected Components in an Undirected Graph"
    },
    {
        "arg": "wiggle-sort-ii",
        "titleUS": "324 Wiggle Sort II",
        "titleCN": "324 摆动排序 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Wiggle Sort II"
    },
    {
        "arg": "maximum-size-subarray-sum-equals-k",
        "titleUS": "325 Maximum Size Subarray Sum Equals k",
        "titleCN": "325 和等于 k 的最长子数组长度",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Size Subarray Sum Equals k"
    },
    {
        "arg": "power-of-three",
        "titleUS": "326 Power of Three",
        "titleCN": "326 3 的幂",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Power of Three"
    },
    {
        "arg": "count-of-range-sum",
        "titleUS": "327 Count of Range Sum",
        "titleCN": "327 区间和的个数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count of Range Sum"
    },
    {
        "arg": "odd-even-linked-list",
        "titleUS": "328 Odd Even Linked List",
        "titleCN": "328 奇偶链表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Odd Even Linked List"
    },
    {
        "arg": "longest-increasing-path-in-a-matrix",
        "titleUS": "329 Longest Increasing Path in a Matrix",
        "titleCN": "329 矩阵中的最长递增路径",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Longest Increasing Path in a Matrix"
    },
    {
        "arg": "patching-array",
        "titleUS": "330 Patching Array",
        "titleCN": "330 按要求补齐数组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Patching Array"
    },
    {
        "arg": "verify-preorder-serialization-of-a-binary-tree",
        "titleUS": "331 Verify Preorder Serialization of a Binary Tree",
        "titleCN": "331 验证二叉树的前序序列化",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Verify Preorder Serialization of a Binary Tree"
    },
    {
        "arg": "reconstruct-itinerary",
        "titleUS": "332 Reconstruct Itinerary",
        "titleCN": "332 重新安排行程",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Reconstruct Itinerary"
    },
    {
        "arg": "largest-bst-subtree",
        "titleUS": "333 Largest BST Subtree",
        "titleCN": "333 最大二叉搜索子树",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Largest BST Subtree"
    },
    {
        "arg": "increasing-triplet-subsequence",
        "titleUS": "334 Increasing Triplet Subsequence",
        "titleCN": "334 递增的三元子序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Increasing Triplet Subsequence"
    },
    {
        "arg": "self-crossing",
        "titleUS": "335 Self Crossing",
        "titleCN": "335 路径交叉",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Self Crossing"
    },
    {
        "arg": "palindrome-pairs",
        "titleUS": "336 Palindrome Pairs",
        "titleCN": "336 回文对",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Palindrome Pairs"
    },
    {
        "arg": "house-robber-iii",
        "titleUS": "337 House Robber III",
        "titleCN": "337 打家劫舍 III",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 House Robber III"
    },
    {
        "arg": "counting-bits",
        "titleUS": "338 Counting Bits",
        "titleCN": "338 比特位计数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Counting Bits"
    },
    {
        "arg": "nested-list-weight-sum",
        "titleUS": "339 Nested List Weight Sum",
        "titleCN": "339 嵌套列表加权和",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Nested List Weight Sum"
    },
    {
        "arg": "longest-substring-with-at-most-k-distinct-characters",
        "titleUS": "340 Longest Substring with At Most K Distinct Characters",
        "titleCN": "340 至多包含 K 个不同字符的最长子串",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Longest Substring with At Most K Distinct Characters"
    },
    {
        "arg": "flatten-nested-list-iterator",
        "titleUS": "341 Flatten Nested List Iterator",
        "titleCN": "341 扁平化嵌套列表迭代器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Flatten Nested List Iterator"
    },
    {
        "arg": "power-of-four",
        "titleUS": "342 Power of Four",
        "titleCN": "342 4的幂",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Power of Four"
    },
    {
        "arg": "integer-break",
        "titleUS": "343 Integer Break",
        "titleCN": "343 整数拆分",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Integer Break"
    },
    {
        "arg": "reverse-string",
        "titleUS": "344 Reverse String",
        "titleCN": "344 反转字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Reverse String"
    },
    {
        "arg": "reverse-vowels-of-a-string",
        "titleUS": "345 Reverse Vowels of a String",
        "titleCN": "345 反转字符串中的元音字母",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Reverse Vowels of a String"
    },
    {
        "arg": "moving-average-from-data-stream",
        "titleUS": "346 Moving Average from Data Stream",
        "titleCN": "346 数据流中的移动平均值",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Moving Average from Data Stream"
    },
    {
        "arg": "top-k-frequent-elements",
        "titleUS": "347 Top K Frequent Elements",
        "titleCN": "347 前 K 个高频元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Top K Frequent Elements"
    },
    {
        "arg": "design-tic-tac-toe",
        "titleUS": "348 Design Tic-Tac-Toe",
        "titleCN": "348 设计井字棋",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Design Tic-Tac-Toe"
    },
    {
        "arg": "intersection-of-two-arrays",
        "titleUS": "349 Intersection of Two Arrays",
        "titleCN": "349 两个数组的交集",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Intersection of Two Arrays"
    },
    {
        "arg": "intersection-of-two-arrays-ii",
        "titleUS": "350 Intersection of Two Arrays II",
        "titleCN": "350 两个数组的交集 II",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Intersection of Two Arrays II"
    },
    {
        "arg": "android-unlock-patterns",
        "titleUS": "351 Android Unlock Patterns",
        "titleCN": "351 安卓系统手势解锁",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Android Unlock Patterns"
    },
    {
        "arg": "data-stream-as-disjoint-intervals",
        "titleUS": "352 Data Stream as Disjoint Intervals",
        "titleCN": "352 将数据流变为多个不相交区间",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Data Stream as Disjoint Intervals"
    },
    {
        "arg": "design-snake-game",
        "titleUS": "353 Design Snake Game",
        "titleCN": "353 贪吃蛇",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Design Snake Game"
    },
    {
        "arg": "russian-doll-envelopes",
        "titleUS": "354 Russian Doll Envelopes",
        "titleCN": "354 俄罗斯套娃信封问题",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Russian Doll Envelopes"
    },
    {
        "arg": "design-twitter",
        "titleUS": "355 Design Twitter",
        "titleCN": "355 设计推特",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Design Twitter"
    },
    {
        "arg": "line-reflection",
        "titleUS": "356 Line Reflection",
        "titleCN": "356 直线镜像",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Line Reflection"
    },
    {
        "arg": "count-numbers-with-unique-digits",
        "titleUS": "357 Count Numbers with Unique Digits",
        "titleCN": "357 统计各位数字都不同的数字个数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Numbers with Unique Digits"
    },
    {
        "arg": "rearrange-string-k-distance-apart",
        "titleUS": "358 Rearrange String k Distance Apart",
        "titleCN": "358 K 距离间隔重排字符串",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Rearrange String k Distance Apart"
    },
    {
        "arg": "logger-rate-limiter",
        "titleUS": "359 Logger Rate Limiter",
        "titleCN": "359 日志速率限制器",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Logger Rate Limiter"
    },
    {
        "arg": "sort-transformed-array",
        "titleUS": "360 Sort Transformed Array",
        "titleCN": "360 有序转化数组",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Sort Transformed Array"
    },
    {
        "arg": "bomb-enemy",
        "titleUS": "361 Bomb Enemy",
        "titleCN": "361 轰炸敌人",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Bomb Enemy"
    },
    {
        "arg": "design-hit-counter",
        "titleUS": "362 Design Hit Counter",
        "titleCN": "362 敲击计数器",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Design Hit Counter"
    },
    {
        "arg": "max-sum-of-rectangle-no-larger-than-k",
        "titleUS": "363 Max Sum of Rectangle No Larger Than K",
        "titleCN": "363 矩形区域不超过 K 的最大数值和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Max Sum of Rectangle No Larger Than K"
    },
    {
        "arg": "nested-list-weight-sum-ii",
        "titleUS": "364 Nested List Weight Sum II",
        "titleCN": "364 嵌套列表加权和 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Nested List Weight Sum II"
    },
    {
        "arg": "water-and-jug-problem",
        "titleUS": "365 Water and Jug Problem",
        "titleCN": "365 水壶问题",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Water and Jug Problem"
    },
    {
        "arg": "find-leaves-of-binary-tree",
        "titleUS": "366 Find Leaves of Binary Tree",
        "titleCN": "366 寻找二叉树的叶子节点",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Find Leaves of Binary Tree"
    },
    {
        "arg": "valid-perfect-square",
        "titleUS": "367 Valid Perfect Square",
        "titleCN": "367 有效的完全平方数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Valid Perfect Square"
    },
    {
        "arg": "largest-divisible-subset",
        "titleUS": "368 Largest Divisible Subset",
        "titleCN": "368 最大整除子集",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Largest Divisible Subset"
    },
    {
        "arg": "plus-one-linked-list",
        "titleUS": "369 Plus One Linked List",
        "titleCN": "369 给单链表加一",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Plus One Linked List"
    },
    {
        "arg": "range-addition",
        "titleUS": "370 Range Addition",
        "titleCN": "370 区间加法",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Range Addition"
    },
    {
        "arg": "sum-of-two-integers",
        "titleUS": "371 Sum of Two Integers",
        "titleCN": "371 两整数之和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum of Two Integers"
    },
    {
        "arg": "super-pow",
        "titleUS": "372 Super Pow",
        "titleCN": "372 超级次方",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Super Pow"
    },
    {
        "arg": "find-k-pairs-with-smallest-sums",
        "titleUS": "373 Find K Pairs with Smallest Sums",
        "titleCN": "373 查找和最小的 K 对数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find K Pairs with Smallest Sums"
    },
    {
        "arg": "guess-number-higher-or-lower",
        "titleUS": "374 Guess Number Higher or Lower",
        "titleCN": "374 猜数字大小",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Guess Number Higher or Lower"
    },
    {
        "arg": "guess-number-higher-or-lower-ii",
        "titleUS": "375 Guess Number Higher or Lower II",
        "titleCN": "375 猜数字大小 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Guess Number Higher or Lower II"
    },
    {
        "arg": "wiggle-subsequence",
        "titleUS": "376 Wiggle Subsequence",
        "titleCN": "376 摆动序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Wiggle Subsequence"
    },
    {
        "arg": "combination-sum-iv",
        "titleUS": "377 Combination Sum IV",
        "titleCN": "377 组合总和 Ⅳ",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Combination Sum IV"
    },
    {
        "arg": "kth-smallest-element-in-a-sorted-matrix",
        "titleUS": "378 Kth Smallest Element in a Sorted Matrix",
        "titleCN": "378 有序矩阵中第 K 小的元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Kth Smallest Element in a Sorted Matrix"
    },
    {
        "arg": "design-phone-directory",
        "titleUS": "379 Design Phone Directory",
        "titleCN": "379 电话目录管理系统",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Design Phone Directory"
    },
    {
        "arg": "insert-delete-getrandom-o1",
        "titleUS": "380 Insert Delete GetRandom O(1)",
        "titleCN": "380 O(1) 时间插入、删除和获取随机元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Insert Delete GetRandom O(1)"
    },
    {
        "arg": "insert-delete-getrandom-o1-duplicates-allowed",
        "titleUS": "381 Insert Delete GetRandom O(1) - Duplicates allowed",
        "titleCN": "381 O(1) 时间插入、删除和获取随机元素 - 允许重复",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Insert Delete GetRandom O(1) - Duplicates allowed"
    },
    {
        "arg": "linked-list-random-node",
        "titleUS": "382 Linked List Random Node",
        "titleCN": "382 链表随机节点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Linked List Random Node"
    },
    {
        "arg": "ransom-note",
        "titleUS": "383 Ransom Note",
        "titleCN": "383 赎金信",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Ransom Note"
    },
    {
        "arg": "shuffle-an-array",
        "titleUS": "384 Shuffle an Array",
        "titleCN": "384 打乱数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Shuffle an Array"
    },
    {
        "arg": "mini-parser",
        "titleUS": "385 Mini Parser",
        "titleCN": "385 迷你语法分析器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Mini Parser"
    },
    {
        "arg": "lexicographical-numbers",
        "titleUS": "386 Lexicographical Numbers",
        "titleCN": "386 字典序排数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Lexicographical Numbers"
    },
    {
        "arg": "first-unique-character-in-a-string",
        "titleUS": "387 First Unique Character in a String",
        "titleCN": "387 字符串中的第一个唯一字符",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 First Unique Character in a String"
    },
    {
        "arg": "longest-absolute-file-path",
        "titleUS": "388 Longest Absolute File Path",
        "titleCN": "388 文件的最长绝对路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Absolute File Path"
    },
    {
        "arg": "find-the-difference",
        "titleUS": "389 Find the Difference",
        "titleCN": "389 找不同",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Difference"
    },
    {
        "arg": "elimination-game",
        "titleUS": "390 Elimination Game",
        "titleCN": "390 消除游戏",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Elimination Game"
    },
    {
        "arg": "perfect-rectangle",
        "titleUS": "391 Perfect Rectangle",
        "titleCN": "391 完美矩形",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Perfect Rectangle"
    },
    {
        "arg": "is-subsequence",
        "titleUS": "392 Is Subsequence",
        "titleCN": "392 判断子序列",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Is Subsequence"
    },
    {
        "arg": "utf-8-validation",
        "titleUS": "393 UTF-8 Validation",
        "titleCN": "393 UTF-8 编码验证",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 UTF-8 Validation"
    },
    {
        "arg": "decode-string",
        "titleUS": "394 Decode String",
        "titleCN": "394 字符串解码",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Decode String"
    },
    {
        "arg": "longest-substring-with-at-least-k-repeating-characters",
        "titleUS": "395 Longest Substring with At Least K Repeating Characters",
        "titleCN": "395 至少有 K 个重复字符的最长子串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Substring with At Least K Repeating Characters"
    },
    {
        "arg": "rotate-function",
        "titleUS": "396 Rotate Function",
        "titleCN": "396 旋转函数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Rotate Function"
    },
    {
        "arg": "integer-replacement",
        "titleUS": "397 Integer Replacement",
        "titleCN": "397 整数替换",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Integer Replacement"
    },
    {
        "arg": "random-pick-index",
        "titleUS": "398 Random Pick Index",
        "titleCN": "398 随机数索引",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Random Pick Index"
    },
    {
        "arg": "evaluate-division",
        "titleUS": "399 Evaluate Division",
        "titleCN": "399 除法求值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Evaluate Division"
    },
    {
        "arg": "nth-digit",
        "titleUS": "400 Nth Digit",
        "titleCN": "400 第 N 位数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Nth Digit"
    },
    {
        "arg": "binary-watch",
        "titleUS": "401 Binary Watch",
        "titleCN": "401 二进制手表",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Binary Watch"
    },
    {
        "arg": "remove-k-digits",
        "titleUS": "402 Remove K Digits",
        "titleCN": "402 移掉 K 位数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Remove K Digits"
    },
    {
        "arg": "frog-jump",
        "titleUS": "403 Frog Jump",
        "titleCN": "403 青蛙过河",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Frog Jump"
    },
    {
        "arg": "sum-of-left-leaves",
        "titleUS": "404 Sum of Left Leaves",
        "titleCN": "404 左叶子之和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sum of Left Leaves"
    },
    {
        "arg": "convert-a-number-to-hexadecimal",
        "titleUS": "405 Convert a Number to Hexadecimal",
        "titleCN": "405 数字转换为十六进制数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Convert a Number to Hexadecimal"
    },
    {
        "arg": "queue-reconstruction-by-height",
        "titleUS": "406 Queue Reconstruction by Height",
        "titleCN": "406 根据身高重建队列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Queue Reconstruction by Height"
    },
    {
        "arg": "trapping-rain-water-ii",
        "titleUS": "407 Trapping Rain Water II",
        "titleCN": "407 接雨水 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Trapping Rain Water II"
    },
    {
        "arg": "valid-word-abbreviation",
        "titleUS": "408 Valid Word Abbreviation",
        "titleCN": "408 有效单词缩写",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Valid Word Abbreviation"
    },
    {
        "arg": "longest-palindrome",
        "titleUS": "409 Longest Palindrome",
        "titleCN": "409 最长回文串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Longest Palindrome"
    },
    {
        "arg": "split-array-largest-sum",
        "titleUS": "410 Split Array Largest Sum",
        "titleCN": "410 分割数组的最大值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Split Array Largest Sum"
    },
    {
        "arg": "minimum-unique-word-abbreviation",
        "titleUS": "411 Minimum Unique Word Abbreviation",
        "titleCN": "411 最短独占单词缩写",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Minimum Unique Word Abbreviation"
    },
    {
        "arg": "fizz-buzz",
        "titleUS": "412 Fizz Buzz",
        "titleCN": "412 Fizz Buzz",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Fizz Buzz"
    },
    {
        "arg": "arithmetic-slices",
        "titleUS": "413 Arithmetic Slices",
        "titleCN": "413 等差数列划分",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Arithmetic Slices"
    },
    {
        "arg": "third-maximum-number",
        "titleUS": "414 Third Maximum Number",
        "titleCN": "414 第三大的数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Third Maximum Number"
    },
    {
        "arg": "add-strings",
        "titleUS": "415 Add Strings",
        "titleCN": "415 字符串相加",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Add Strings"
    },
    {
        "arg": "partition-equal-subset-sum",
        "titleUS": "416 Partition Equal Subset Sum",
        "titleCN": "416 分割等和子集",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Partition Equal Subset Sum"
    },
    {
        "arg": "pacific-atlantic-water-flow",
        "titleUS": "417 Pacific Atlantic Water Flow",
        "titleCN": "417 太平洋大西洋水流问题",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Pacific Atlantic Water Flow"
    },
    {
        "arg": "sentence-screen-fitting",
        "titleUS": "418 Sentence Screen Fitting",
        "titleCN": "418 屏幕可显示句子的数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Sentence Screen Fitting"
    },
    {
        "arg": "battleships-in-a-board",
        "titleUS": "419 Battleships in a Board",
        "titleCN": "419 甲板上的战舰",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Battleships in a Board"
    },
    {
        "arg": "strong-password-checker",
        "titleUS": "420 Strong Password Checker",
        "titleCN": "420 强密码检验器",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Strong Password Checker"
    },
    {
        "arg": "maximum-xor-of-two-numbers-in-an-array",
        "titleUS": "421 Maximum XOR of Two Numbers in an Array",
        "titleCN": "421 数组中两个数的最大异或值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum XOR of Two Numbers in an Array"
    },
    {
        "arg": "valid-word-square",
        "titleUS": "422 Valid Word Square",
        "titleCN": "422 有效的单词方块",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Valid Word Square"
    },
    {
        "arg": "reconstruct-original-digits-from-english",
        "titleUS": "423 Reconstruct Original Digits from English",
        "titleCN": "423 从英文中重建数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reconstruct Original Digits from English"
    },
    {
        "arg": "longest-repeating-character-replacement",
        "titleUS": "424 Longest Repeating Character Replacement",
        "titleCN": "424 替换后的最长重复字符",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Repeating Character Replacement"
    },
    {
        "arg": "word-squares",
        "titleUS": "425 Word Squares",
        "titleCN": "425 单词方块",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Word Squares"
    },
    {
        "arg": "convert-binary-search-tree-to-sorted-doubly-linked-list",
        "titleUS": "426 Convert Binary Search Tree to Sorted Doubly Linked List",
        "titleCN": "426 将二叉搜索树转化为排序的双向链表",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Convert Binary Search Tree to Sorted Doubly Linked List"
    },
    {
        "arg": "construct-quad-tree",
        "titleUS": "427 Construct Quad Tree",
        "titleCN": "427 建立四叉树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Construct Quad Tree"
    },
    {
        "arg": "serialize-and-deserialize-n-ary-tree",
        "titleUS": "428 Serialize and Deserialize N-ary Tree",
        "titleCN": "428 序列化和反序列化 N 叉树",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Serialize and Deserialize N-ary Tree"
    },
    {
        "arg": "n-ary-tree-level-order-traversal",
        "titleUS": "429 N-ary Tree Level Order Traversal",
        "titleCN": "429 N 叉树的层序遍历",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 N-ary Tree Level Order Traversal"
    },
    {
        "arg": "flatten-a-multilevel-doubly-linked-list",
        "titleUS": "430 Flatten a Multilevel Doubly Linked List",
        "titleCN": "430 扁平化多级双向链表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Flatten a Multilevel Doubly Linked List"
    },
    {
        "arg": "encode-n-ary-tree-to-binary-tree",
        "titleUS": "431 Encode N-ary Tree to Binary Tree",
        "titleCN": "431 将 N 叉树编码为二叉树",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Encode N-ary Tree to Binary Tree"
    },
    {
        "arg": "all-oone-data-structure",
        "titleUS": "432 All O`one Data Structure",
        "titleCN": "432 全 O(1) 的数据结构",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 All O`one Data Structure"
    },
    {
        "arg": "minimum-genetic-mutation",
        "titleUS": "433 Minimum Genetic Mutation",
        "titleCN": "433 最小基因变化",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Genetic Mutation"
    },
    {
        "arg": "number-of-segments-in-a-string",
        "titleUS": "434 Number of Segments in a String",
        "titleCN": "434 字符串中的单词数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Segments in a String"
    },
    {
        "arg": "non-overlapping-intervals",
        "titleUS": "435 Non-overlapping Intervals",
        "titleCN": "435 无重叠区间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Non-overlapping Intervals"
    },
    {
        "arg": "find-right-interval",
        "titleUS": "436 Find Right Interval",
        "titleCN": "436 寻找右区间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Right Interval"
    },
    {
        "arg": "path-sum-iii",
        "titleUS": "437 Path Sum III",
        "titleCN": "437 路径总和 III",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Path Sum III"
    },
    {
        "arg": "find-all-anagrams-in-a-string",
        "titleUS": "438 Find All Anagrams in a String",
        "titleCN": "438 找到字符串中所有字母异位词",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find All Anagrams in a String"
    },
    {
        "arg": "ternary-expression-parser",
        "titleUS": "439 Ternary Expression Parser",
        "titleCN": "439 三元表达式解析器",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Ternary Expression Parser"
    },
    {
        "arg": "k-th-smallest-in-lexicographical-order",
        "titleUS": "440 K-th Smallest in Lexicographical Order",
        "titleCN": "440 字典序的第K小数字",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 K-th Smallest in Lexicographical Order"
    },
    {
        "arg": "arranging-coins",
        "titleUS": "441 Arranging Coins",
        "titleCN": "441 排列硬币",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Arranging Coins"
    },
    {
        "arg": "find-all-duplicates-in-an-array",
        "titleUS": "442 Find All Duplicates in an Array",
        "titleCN": "442 数组中重复的数据",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find All Duplicates in an Array"
    },
    {
        "arg": "string-compression",
        "titleUS": "443 String Compression",
        "titleCN": "443 压缩字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 String Compression"
    },
    {
        "arg": "sequence-reconstruction",
        "titleUS": "444 Sequence Reconstruction",
        "titleCN": "444 序列重建",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Sequence Reconstruction"
    },
    {
        "arg": "add-two-numbers-ii",
        "titleUS": "445 Add Two Numbers II",
        "titleCN": "445 两数相加 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Add Two Numbers II"
    },
    {
        "arg": "arithmetic-slices-ii-subsequence",
        "titleUS": "446 Arithmetic Slices II - Subsequence",
        "titleCN": "446 等差数列划分 II - 子序列",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Arithmetic Slices II - Subsequence"
    },
    {
        "arg": "number-of-boomerangs",
        "titleUS": "447 Number of Boomerangs",
        "titleCN": "447 回旋镖的数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Boomerangs"
    },
    {
        "arg": "find-all-numbers-disappeared-in-an-array",
        "titleUS": "448 Find All Numbers Disappeared in an Array",
        "titleCN": "448 找到所有数组中消失的数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find All Numbers Disappeared in an Array"
    },
    {
        "arg": "serialize-and-deserialize-bst",
        "titleUS": "449 Serialize and Deserialize BST",
        "titleCN": "449 序列化和反序列化二叉搜索树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Serialize and Deserialize BST"
    },
    {
        "arg": "delete-node-in-a-bst",
        "titleUS": "450 Delete Node in a BST",
        "titleCN": "450 删除二叉搜索树中的节点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Delete Node in a BST"
    },
    {
        "arg": "sort-characters-by-frequency",
        "titleUS": "451 Sort Characters By Frequency",
        "titleCN": "451 根据字符出现频率排序",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sort Characters By Frequency"
    },
    {
        "arg": "minimum-number-of-arrows-to-burst-balloons",
        "titleUS": "452 Minimum Number of Arrows to Burst Balloons",
        "titleCN": "452 用最少数量的箭引爆气球",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Arrows to Burst Balloons"
    },
    {
        "arg": "minimum-moves-to-equal-array-elements",
        "titleUS": "453 Minimum Moves to Equal Array Elements",
        "titleCN": "453 最小操作次数使数组元素相等",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Moves to Equal Array Elements"
    },
    {
        "arg": "4sum-ii",
        "titleUS": "454 4Sum II",
        "titleCN": "454 四数相加 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 4Sum II"
    },
    {
        "arg": "assign-cookies",
        "titleUS": "455 Assign Cookies",
        "titleCN": "455 分发饼干",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Assign Cookies"
    },
    {
        "arg": "132-pattern",
        "titleUS": "456 132 Pattern",
        "titleCN": "456 132 模式",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 132 Pattern"
    },
    {
        "arg": "circular-array-loop",
        "titleUS": "457 Circular Array Loop",
        "titleCN": "457 环形数组是否存在循环",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Circular Array Loop"
    },
    {
        "arg": "poor-pigs",
        "titleUS": "458 Poor Pigs",
        "titleCN": "458 可怜的小猪",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Poor Pigs"
    },
    {
        "arg": "repeated-substring-pattern",
        "titleUS": "459 Repeated Substring Pattern",
        "titleCN": "459 重复的子字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Repeated Substring Pattern"
    },
    {
        "arg": "lfu-cache",
        "titleUS": "460 LFU Cache",
        "titleCN": "460 LFU 缓存",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 LFU Cache"
    },
    {
        "arg": "hamming-distance",
        "titleUS": "461 Hamming Distance",
        "titleCN": "461 汉明距离",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Hamming Distance"
    },
    {
        "arg": "minimum-moves-to-equal-array-elements-ii",
        "titleUS": "462 Minimum Moves to Equal Array Elements II",
        "titleCN": "462 最小操作次数使数组元素相等 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Moves to Equal Array Elements II"
    },
    {
        "arg": "island-perimeter",
        "titleUS": "463 Island Perimeter",
        "titleCN": "463 岛屿的周长",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Island Perimeter"
    },
    {
        "arg": "can-i-win",
        "titleUS": "464 Can I Win",
        "titleCN": "464 我能赢吗",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Can I Win"
    },
    {
        "arg": "optimal-account-balancing",
        "titleUS": "465 Optimal Account Balancing",
        "titleCN": "465 最优账单平衡",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Optimal Account Balancing"
    },
    {
        "arg": "count-the-repetitions",
        "titleUS": "466 Count The Repetitions",
        "titleCN": "466 统计重复个数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count The Repetitions"
    },
    {
        "arg": "unique-substrings-in-wraparound-string",
        "titleUS": "467 Unique Substrings in Wraparound String",
        "titleCN": "467 环绕字符串中唯一的子字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Unique Substrings in Wraparound String"
    },
    {
        "arg": "validate-ip-address",
        "titleUS": "468 Validate IP Address",
        "titleCN": "468 验证IP地址",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Validate IP Address"
    },
    {
        "arg": "convex-polygon",
        "titleUS": "469 Convex Polygon",
        "titleCN": "469 凸多边形",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Convex Polygon"
    },
    {
        "arg": "implement-rand10-using-rand7",
        "titleUS": "470 Implement Rand10() Using Rand7()",
        "titleCN": "470 用 Rand7() 实现 Rand10()",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Implement Rand10() Using Rand7()"
    },
    {
        "arg": "encode-string-with-shortest-length",
        "titleUS": "471 Encode String with Shortest Length",
        "titleCN": "471 编码最短长度的字符串",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Encode String with Shortest Length"
    },
    {
        "arg": "concatenated-words",
        "titleUS": "472 Concatenated Words",
        "titleCN": "472 连接词",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Concatenated Words"
    },
    {
        "arg": "matchsticks-to-square",
        "titleUS": "473 Matchsticks to Square",
        "titleCN": "473 火柴拼正方形",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Matchsticks to Square"
    },
    {
        "arg": "ones-and-zeroes",
        "titleUS": "474 Ones and Zeroes",
        "titleCN": "474 一和零",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Ones and Zeroes"
    },
    {
        "arg": "heaters",
        "titleUS": "475 Heaters",
        "titleCN": "475 供暖器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Heaters"
    },
    {
        "arg": "number-complement",
        "titleUS": "476 Number Complement",
        "titleCN": "476 数字的补数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number Complement"
    },
    {
        "arg": "total-hamming-distance",
        "titleUS": "477 Total Hamming Distance",
        "titleCN": "477 汉明距离总和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Total Hamming Distance"
    },
    {
        "arg": "generate-random-point-in-a-circle",
        "titleUS": "478 Generate Random Point in a Circle",
        "titleCN": "478 在圆内随机生成点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Generate Random Point in a Circle"
    },
    {
        "arg": "largest-palindrome-product",
        "titleUS": "479 Largest Palindrome Product",
        "titleCN": "479 最大回文数乘积",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Largest Palindrome Product"
    },
    {
        "arg": "sliding-window-median",
        "titleUS": "480 Sliding Window Median",
        "titleCN": "480 滑动窗口中位数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Sliding Window Median"
    },
    {
        "arg": "magical-string",
        "titleUS": "481 Magical String",
        "titleCN": "481 神奇字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Magical String"
    },
    {
        "arg": "license-key-formatting",
        "titleUS": "482 License Key Formatting",
        "titleCN": "482 密钥格式化",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 License Key Formatting"
    },
    {
        "arg": "smallest-good-base",
        "titleUS": "483 Smallest Good Base",
        "titleCN": "483 最小好进制",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Smallest Good Base"
    },
    {
        "arg": "find-permutation",
        "titleUS": "484 Find Permutation",
        "titleCN": "484 寻找排列",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Find Permutation"
    },
    {
        "arg": "max-consecutive-ones",
        "titleUS": "485 Max Consecutive Ones",
        "titleCN": "485 最大连续 1 的个数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Max Consecutive Ones"
    },
    {
        "arg": "predict-the-winner",
        "titleUS": "486 Predict the Winner",
        "titleCN": "486 预测赢家",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Predict the Winner"
    },
    {
        "arg": "max-consecutive-ones-ii",
        "titleUS": "487 Max Consecutive Ones II",
        "titleCN": "487 最大连续1的个数 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Max Consecutive Ones II"
    },
    {
        "arg": "zuma-game",
        "titleUS": "488 Zuma Game",
        "titleCN": "488 祖玛游戏",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Zuma Game"
    },
    {
        "arg": "robot-room-cleaner",
        "titleUS": "489 Robot Room Cleaner",
        "titleCN": "489 扫地机器人",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Robot Room Cleaner"
    },
    {
        "arg": "the-maze",
        "titleUS": "490 The Maze",
        "titleCN": "490 迷宫",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 The Maze"
    },
    {
        "arg": "non-decreasing-subsequences",
        "titleUS": "491 Non-decreasing Subsequences",
        "titleCN": "491 非递减子序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Non-decreasing Subsequences"
    },
    {
        "arg": "construct-the-rectangle",
        "titleUS": "492 Construct the Rectangle",
        "titleCN": "492 构造矩形",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Construct the Rectangle"
    },
    {
        "arg": "reverse-pairs",
        "titleUS": "493 Reverse Pairs",
        "titleCN": "493 翻转对",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Reverse Pairs"
    },
    {
        "arg": "target-sum",
        "titleUS": "494 Target Sum",
        "titleCN": "494 目标和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Target Sum"
    },
    {
        "arg": "teemo-attacking",
        "titleUS": "495 Teemo Attacking",
        "titleCN": "495 提莫攻击",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Teemo Attacking"
    },
    {
        "arg": "next-greater-element-i",
        "titleUS": "496 Next Greater Element I",
        "titleCN": "496 下一个更大元素 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Next Greater Element I"
    },
    {
        "arg": "random-point-in-non-overlapping-rectangles",
        "titleUS": "497 Random Point in Non-overlapping Rectangles",
        "titleCN": "497 非重叠矩形中的随机点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Random Point in Non-overlapping Rectangles"
    },
    {
        "arg": "diagonal-traverse",
        "titleUS": "498 Diagonal Traverse",
        "titleCN": "498 对角线遍历",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Diagonal Traverse"
    },
    {
        "arg": "the-maze-iii",
        "titleUS": "499 The Maze III",
        "titleCN": "499 迷宫 III",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 The Maze III"
    },
    {
        "arg": "keyboard-row",
        "titleUS": "500 Keyboard Row",
        "titleCN": "500 键盘行",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Keyboard Row"
    },
    {
        "arg": "find-mode-in-binary-search-tree",
        "titleUS": "501 Find Mode in Binary Search Tree",
        "titleCN": "501 二叉搜索树中的众数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Mode in Binary Search Tree"
    },
    {
        "arg": "ipo",
        "titleUS": "502 IPO",
        "titleCN": "502 IPO",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 IPO"
    },
    {
        "arg": "next-greater-element-ii",
        "titleUS": "503 Next Greater Element II",
        "titleCN": "503 下一个更大元素 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Next Greater Element II"
    },
    {
        "arg": "base-7",
        "titleUS": "504 Base 7",
        "titleCN": "504 七进制数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Base 7"
    },
    {
        "arg": "the-maze-ii",
        "titleUS": "505 The Maze II",
        "titleCN": "505 迷宫 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 The Maze II"
    },
    {
        "arg": "relative-ranks",
        "titleUS": "506 Relative Ranks",
        "titleCN": "506 相对名次",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Relative Ranks"
    },
    {
        "arg": "perfect-number",
        "titleUS": "507 Perfect Number",
        "titleCN": "507 完美数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Perfect Number"
    },
    {
        "arg": "most-frequent-subtree-sum",
        "titleUS": "508 Most Frequent Subtree Sum",
        "titleCN": "508 出现次数最多的子树元素和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Most Frequent Subtree Sum"
    },
    {
        "arg": "fibonacci-number",
        "titleUS": "509 Fibonacci Number",
        "titleCN": "509 斐波那契数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Fibonacci Number"
    },
    {
        "arg": "inorder-successor-in-bst-ii",
        "titleUS": "510 Inorder Successor in BST II",
        "titleCN": "510 二叉搜索树中的中序后继 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Inorder Successor in BST II"
    },
    {
        "arg": "find-bottom-left-tree-value",
        "titleUS": "513 Find Bottom Left Tree Value",
        "titleCN": "513 找树左下角的值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Bottom Left Tree Value"
    },
    {
        "arg": "freedom-trail",
        "titleUS": "514 Freedom Trail",
        "titleCN": "514 自由之路",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Freedom Trail"
    },
    {
        "arg": "find-largest-value-in-each-tree-row",
        "titleUS": "515 Find Largest Value in Each Tree Row",
        "titleCN": "515 在每个树行中找最大值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Largest Value in Each Tree Row"
    },
    {
        "arg": "longest-palindromic-subsequence",
        "titleUS": "516 Longest Palindromic Subsequence",
        "titleCN": "516 最长回文子序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Palindromic Subsequence"
    },
    {
        "arg": "super-washing-machines",
        "titleUS": "517 Super Washing Machines",
        "titleCN": "517 超级洗衣机",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Super Washing Machines"
    },
    {
        "arg": "coin-change-ii",
        "titleUS": "518 Coin Change II",
        "titleCN": "518 零钱兑换 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Coin Change II"
    },
    {
        "arg": "random-flip-matrix",
        "titleUS": "519 Random Flip Matrix",
        "titleCN": "519 随机翻转矩阵",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Random Flip Matrix"
    },
    {
        "arg": "detect-capital",
        "titleUS": "520 Detect Capital",
        "titleCN": "520 检测大写字母",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Detect Capital"
    },
    {
        "arg": "longest-uncommon-subsequence-i",
        "titleUS": "521 Longest Uncommon Subsequence I",
        "titleCN": "521 最长特殊序列 Ⅰ",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Longest Uncommon Subsequence I"
    },
    {
        "arg": "longest-uncommon-subsequence-ii",
        "titleUS": "522 Longest Uncommon Subsequence II",
        "titleCN": "522 最长特殊序列 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Uncommon Subsequence II"
    },
    {
        "arg": "continuous-subarray-sum",
        "titleUS": "523 Continuous Subarray Sum",
        "titleCN": "523 连续的子数组和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Continuous Subarray Sum"
    },
    {
        "arg": "longest-word-in-dictionary-through-deleting",
        "titleUS": "524 Longest Word in Dictionary through Deleting",
        "titleCN": "524 通过删除字母匹配到字典里最长单词",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Word in Dictionary through Deleting"
    },
    {
        "arg": "contiguous-array",
        "titleUS": "525 Contiguous Array",
        "titleCN": "525 连续数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Contiguous Array"
    },
    {
        "arg": "beautiful-arrangement",
        "titleUS": "526 Beautiful Arrangement",
        "titleCN": "526 优美的排列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Beautiful Arrangement"
    },
    {
        "arg": "word-abbreviation",
        "titleUS": "527 Word Abbreviation",
        "titleCN": "527 单词缩写",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Word Abbreviation"
    },
    {
        "arg": "random-pick-with-weight",
        "titleUS": "528 Random Pick with Weight",
        "titleCN": "528 按权重随机选择",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Random Pick with Weight"
    },
    {
        "arg": "minesweeper",
        "titleUS": "529 Minesweeper",
        "titleCN": "529 扫雷游戏",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minesweeper"
    },
    {
        "arg": "minimum-absolute-difference-in-bst",
        "titleUS": "530 Minimum Absolute Difference in BST",
        "titleCN": "530 二叉搜索树的最小绝对差",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Absolute Difference in BST"
    },
    {
        "arg": "lonely-pixel-i",
        "titleUS": "531 Lonely Pixel I",
        "titleCN": "531 孤独像素 I",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Lonely Pixel I"
    },
    {
        "arg": "k-diff-pairs-in-an-array",
        "titleUS": "532 K-diff Pairs in an Array",
        "titleCN": "532 数组中的 k-diff 数对",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 K-diff Pairs in an Array"
    },
    {
        "arg": "lonely-pixel-ii",
        "titleUS": "533 Lonely Pixel II",
        "titleCN": "533 孤独像素 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Lonely Pixel II"
    },
    {
        "arg": "encode-and-decode-tinyurl",
        "titleUS": "535 Encode and Decode TinyURL",
        "titleCN": "535 TinyURL 的加密与解密",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Encode and Decode TinyURL"
    },
    {
        "arg": "construct-binary-tree-from-string",
        "titleUS": "536 Construct Binary Tree from String",
        "titleCN": "536 从字符串生成二叉树",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Construct Binary Tree from String"
    },
    {
        "arg": "complex-number-multiplication",
        "titleUS": "537 Complex Number Multiplication",
        "titleCN": "537 复数乘法",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Complex Number Multiplication"
    },
    {
        "arg": "convert-bst-to-greater-tree",
        "titleUS": "538 Convert BST to Greater Tree",
        "titleCN": "538 把二叉搜索树转换为累加树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Convert BST to Greater Tree"
    },
    {
        "arg": "minimum-time-difference",
        "titleUS": "539 Minimum Time Difference",
        "titleCN": "539 最小时间差",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Time Difference"
    },
    {
        "arg": "single-element-in-a-sorted-array",
        "titleUS": "540 Single Element in a Sorted Array",
        "titleCN": "540 有序数组中的单一元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Single Element in a Sorted Array"
    },
    {
        "arg": "reverse-string-ii",
        "titleUS": "541 Reverse String II",
        "titleCN": "541 反转字符串 II",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Reverse String II"
    },
    {
        "arg": "01-matrix",
        "titleUS": "542 01 Matrix",
        "titleCN": "542 01 矩阵",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 01 Matrix"
    },
    {
        "arg": "diameter-of-binary-tree",
        "titleUS": "543 Diameter of Binary Tree",
        "titleCN": "543 二叉树的直径",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Diameter of Binary Tree"
    },
    {
        "arg": "output-contest-matches",
        "titleUS": "544 Output Contest Matches",
        "titleCN": "544 输出比赛匹配对",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Output Contest Matches"
    },
    {
        "arg": "boundary-of-binary-tree",
        "titleUS": "545 Boundary of Binary Tree",
        "titleCN": "545 二叉树的边界",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Boundary of Binary Tree"
    },
    {
        "arg": "remove-boxes",
        "titleUS": "546 Remove Boxes",
        "titleCN": "546 移除盒子",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Remove Boxes"
    },
    {
        "arg": "number-of-provinces",
        "titleUS": "547 Number of Provinces",
        "titleCN": "547 省份数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Provinces"
    },
    {
        "arg": "split-array-with-equal-sum",
        "titleUS": "548 Split Array with Equal Sum",
        "titleCN": "548 将数组分割成和相等的子数组",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Split Array with Equal Sum"
    },
    {
        "arg": "binary-tree-longest-consecutive-sequence-ii",
        "titleUS": "549 Binary Tree Longest Consecutive Sequence II",
        "titleCN": "549 二叉树最长连续序列 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Binary Tree Longest Consecutive Sequence II"
    },
    {
        "arg": "student-attendance-record-i",
        "titleUS": "551 Student Attendance Record I",
        "titleCN": "551 学生出勤记录 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Student Attendance Record I"
    },
    {
        "arg": "student-attendance-record-ii",
        "titleUS": "552 Student Attendance Record II",
        "titleCN": "552 学生出勤记录 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Student Attendance Record II"
    },
    {
        "arg": "optimal-division",
        "titleUS": "553 Optimal Division",
        "titleCN": "553 最优除法",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Optimal Division"
    },
    {
        "arg": "brick-wall",
        "titleUS": "554 Brick Wall",
        "titleCN": "554 砖墙",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Brick Wall"
    },
    {
        "arg": "split-concatenated-strings",
        "titleUS": "555 Split Concatenated Strings",
        "titleCN": "555 分割连接字符串",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Split Concatenated Strings"
    },
    {
        "arg": "next-greater-element-iii",
        "titleUS": "556 Next Greater Element III",
        "titleCN": "556 下一个更大元素 III",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Next Greater Element III"
    },
    {
        "arg": "reverse-words-in-a-string-iii",
        "titleUS": "557 Reverse Words in a String III",
        "titleCN": "557 反转字符串中的单词 III",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Reverse Words in a String III"
    },
    {
        "arg": "logical-or-of-two-binary-grids-represented-as-quad-trees",
        "titleUS": "558 Logical OR of Two Binary Grids Represented as Quad-Trees",
        "titleCN": "558 四叉树交集",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Logical OR of Two Binary Grids Represented as Quad-Trees"
    },
    {
        "arg": "maximum-depth-of-n-ary-tree",
        "titleUS": "559 Maximum Depth of N-ary Tree",
        "titleCN": "559 N 叉树的最大深度",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Depth of N-ary Tree"
    },
    {
        "arg": "subarray-sum-equals-k",
        "titleUS": "560 Subarray Sum Equals K",
        "titleCN": "560 和为 K 的子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Subarray Sum Equals K"
    },
    {
        "arg": "array-partition",
        "titleUS": "561 Array Partition",
        "titleCN": "561 数组拆分",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Array Partition"
    },
    {
        "arg": "longest-line-of-consecutive-one-in-matrix",
        "titleUS": "562 Longest Line of Consecutive One in Matrix",
        "titleCN": "562 矩阵中最长的连续1线段",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Longest Line of Consecutive One in Matrix"
    },
    {
        "arg": "binary-tree-tilt",
        "titleUS": "563 Binary Tree Tilt",
        "titleCN": "563 二叉树的坡度",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Binary Tree Tilt"
    },
    {
        "arg": "find-the-closest-palindrome",
        "titleUS": "564 Find the Closest Palindrome",
        "titleCN": "564 寻找最近的回文数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find the Closest Palindrome"
    },
    {
        "arg": "array-nesting",
        "titleUS": "565 Array Nesting",
        "titleCN": "565 数组嵌套",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Array Nesting"
    },
    {
        "arg": "reshape-the-matrix",
        "titleUS": "566 Reshape the Matrix",
        "titleCN": "566 重塑矩阵",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Reshape the Matrix"
    },
    {
        "arg": "permutation-in-string",
        "titleUS": "567 Permutation in String",
        "titleCN": "567 字符串的排列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Permutation in String"
    },
    {
        "arg": "maximum-vacation-days",
        "titleUS": "568 Maximum Vacation Days",
        "titleCN": "568 最大休假天数",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Maximum Vacation Days"
    },
    {
        "arg": "subtree-of-another-tree",
        "titleUS": "572 Subtree of Another Tree",
        "titleCN": "572 另一棵树的子树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Subtree of Another Tree"
    },
    {
        "arg": "squirrel-simulation",
        "titleUS": "573 Squirrel Simulation",
        "titleCN": "573 松鼠模拟",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Squirrel Simulation"
    },
    {
        "arg": "distribute-candies",
        "titleUS": "575 Distribute Candies",
        "titleCN": "575 分糖果",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Distribute Candies"
    },
    {
        "arg": "out-of-boundary-paths",
        "titleUS": "576 Out of Boundary Paths",
        "titleCN": "576 出界的路径数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Out of Boundary Paths"
    },
    {
        "arg": "shortest-unsorted-continuous-subarray",
        "titleUS": "581 Shortest Unsorted Continuous Subarray",
        "titleCN": "581 最短无序连续子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Shortest Unsorted Continuous Subarray"
    },
    {
        "arg": "kill-process",
        "titleUS": "582 Kill Process",
        "titleCN": "582 杀掉进程",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Kill Process"
    },
    {
        "arg": "delete-operation-for-two-strings",
        "titleUS": "583 Delete Operation for Two Strings",
        "titleCN": "583 两个字符串的删除操作",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Delete Operation for Two Strings"
    },
    {
        "arg": "erect-the-fence",
        "titleUS": "587 Erect the Fence",
        "titleCN": "587 安装栅栏",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Erect the Fence"
    },
    {
        "arg": "design-in-memory-file-system",
        "titleUS": "588 Design In-Memory File System",
        "titleCN": "588 设计内存文件系统",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Design In-Memory File System"
    },
    {
        "arg": "n-ary-tree-preorder-traversal",
        "titleUS": "589 N-ary Tree Preorder Traversal",
        "titleCN": "589 N 叉树的前序遍历",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 N-ary Tree Preorder Traversal"
    },
    {
        "arg": "n-ary-tree-postorder-traversal",
        "titleUS": "590 N-ary Tree Postorder Traversal",
        "titleCN": "590 N 叉树的后序遍历",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 N-ary Tree Postorder Traversal"
    },
    {
        "arg": "tag-validator",
        "titleUS": "591 Tag Validator",
        "titleCN": "591 标签验证器",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Tag Validator"
    },
    {
        "arg": "fraction-addition-and-subtraction",
        "titleUS": "592 Fraction Addition and Subtraction",
        "titleCN": "592 分数加减运算",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Fraction Addition and Subtraction"
    },
    {
        "arg": "valid-square",
        "titleUS": "593 Valid Square",
        "titleCN": "593 有效的正方形",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Valid Square"
    },
    {
        "arg": "longest-harmonious-subsequence",
        "titleUS": "594 Longest Harmonious Subsequence",
        "titleCN": "594 最长和谐子序列",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Longest Harmonious Subsequence"
    },
    {
        "arg": "range-addition-ii",
        "titleUS": "598 Range Addition II",
        "titleCN": "598 区间加法 II",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Range Addition II"
    },
    {
        "arg": "minimum-index-sum-of-two-lists",
        "titleUS": "599 Minimum Index Sum of Two Lists",
        "titleCN": "599 两个列表的最小索引总和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Index Sum of Two Lists"
    },
    {
        "arg": "non-negative-integers-without-consecutive-ones",
        "titleUS": "600 Non-negative Integers without Consecutive Ones",
        "titleCN": "600 不含连续1的非负整数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Non-negative Integers without Consecutive Ones"
    },
    {
        "arg": "design-compressed-string-iterator",
        "titleUS": "604 Design Compressed String Iterator",
        "titleCN": "604 迭代压缩字符串",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Design Compressed String Iterator"
    },
    {
        "arg": "can-place-flowers",
        "titleUS": "605 Can Place Flowers",
        "titleCN": "605 种花问题",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Can Place Flowers"
    },
    {
        "arg": "construct-string-from-binary-tree",
        "titleUS": "606 Construct String from Binary Tree",
        "titleCN": "606 根据二叉树创建字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Construct String from Binary Tree"
    },
    {
        "arg": "find-duplicate-file-in-system",
        "titleUS": "609 Find Duplicate File in System",
        "titleCN": "609 在系统中查找重复文件",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Duplicate File in System"
    },
    {
        "arg": "valid-triangle-number",
        "titleUS": "611 Valid Triangle Number",
        "titleCN": "611 有效三角形的个数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Valid Triangle Number"
    },
    {
        "arg": "add-bold-tag-in-string",
        "titleUS": "616 Add Bold Tag in String",
        "titleCN": "616 给字符串添加加粗标签",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Add Bold Tag in String"
    },
    {
        "arg": "merge-two-binary-trees",
        "titleUS": "617 Merge Two Binary Trees",
        "titleCN": "617 合并二叉树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Merge Two Binary Trees"
    },
    {
        "arg": "task-scheduler",
        "titleUS": "621 Task Scheduler",
        "titleCN": "621 任务调度器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Task Scheduler"
    },
    {
        "arg": "design-circular-queue",
        "titleUS": "622 Design Circular Queue",
        "titleCN": "622 设计循环队列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Design Circular Queue"
    },
    {
        "arg": "add-one-row-to-tree",
        "titleUS": "623 Add One Row to Tree",
        "titleCN": "623 在二叉树中增加一行",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Add One Row to Tree"
    },
    {
        "arg": "maximum-distance-in-arrays",
        "titleUS": "624 Maximum Distance in Arrays",
        "titleCN": "624 数组列表中的最大距离",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Distance in Arrays"
    },
    {
        "arg": "minimum-factorization",
        "titleUS": "625 Minimum Factorization",
        "titleCN": "625 最小因式分解",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimum Factorization"
    },
    {
        "arg": "maximum-product-of-three-numbers",
        "titleUS": "628 Maximum Product of Three Numbers",
        "titleCN": "628 三个数的最大乘积",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Product of Three Numbers"
    },
    {
        "arg": "k-inverse-pairs-array",
        "titleUS": "629 K Inverse Pairs Array",
        "titleCN": "629 K 个逆序对数组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 K Inverse Pairs Array"
    },
    {
        "arg": "course-schedule-iii",
        "titleUS": "630 Course Schedule III",
        "titleCN": "630 课程表 III",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Course Schedule III"
    },
    {
        "arg": "design-excel-sum-formula",
        "titleUS": "631 Design Excel Sum Formula",
        "titleCN": "631 设计 Excel 求和公式",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Design Excel Sum Formula"
    },
    {
        "arg": "smallest-range-covering-elements-from-k-lists",
        "titleUS": "632 Smallest Range Covering Elements from K Lists",
        "titleCN": "632 最小区间",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Smallest Range Covering Elements from K Lists"
    },
    {
        "arg": "sum-of-square-numbers",
        "titleUS": "633 Sum of Square Numbers",
        "titleCN": "633 平方数之和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum of Square Numbers"
    },
    {
        "arg": "find-the-derangement-of-an-array",
        "titleUS": "634 Find the Derangement of An Array",
        "titleCN": "634 寻找数组的错位排列",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Find the Derangement of An Array"
    },
    {
        "arg": "design-log-storage-system",
        "titleUS": "635 Design Log Storage System",
        "titleCN": "635 设计日志存储系统",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Design Log Storage System"
    },
    {
        "arg": "exclusive-time-of-functions",
        "titleUS": "636 Exclusive Time of Functions",
        "titleCN": "636 函数的独占时间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Exclusive Time of Functions"
    },
    {
        "arg": "average-of-levels-in-binary-tree",
        "titleUS": "637 Average of Levels in Binary Tree",
        "titleCN": "637 二叉树的层平均值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Average of Levels in Binary Tree"
    },
    {
        "arg": "shopping-offers",
        "titleUS": "638 Shopping Offers",
        "titleCN": "638 大礼包",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Shopping Offers"
    },
    {
        "arg": "decode-ways-ii",
        "titleUS": "639 Decode Ways II",
        "titleCN": "639 解码方法 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Decode Ways II"
    },
    {
        "arg": "solve-the-equation",
        "titleUS": "640 Solve the Equation",
        "titleCN": "640 求解方程",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Solve the Equation"
    },
    {
        "arg": "design-circular-deque",
        "titleUS": "641 Design Circular Deque",
        "titleCN": "641 设计循环双端队列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Design Circular Deque"
    },
    {
        "arg": "design-search-autocomplete-system",
        "titleUS": "642 Design Search Autocomplete System",
        "titleCN": "642 设计搜索自动补全系统",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Design Search Autocomplete System"
    },
    {
        "arg": "maximum-average-subarray-i",
        "titleUS": "643 Maximum Average Subarray I",
        "titleCN": "643 子数组最大平均数 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Average Subarray I"
    },
    {
        "arg": "maximum-average-subarray-ii",
        "titleUS": "644 Maximum Average Subarray II",
        "titleCN": "644 子数组最大平均数 II",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Maximum Average Subarray II"
    },
    {
        "arg": "set-mismatch",
        "titleUS": "645 Set Mismatch",
        "titleCN": "645 错误的集合",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Set Mismatch"
    },
    {
        "arg": "maximum-length-of-pair-chain",
        "titleUS": "646 Maximum Length of Pair Chain",
        "titleCN": "646 最长数对链",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Length of Pair Chain"
    },
    {
        "arg": "palindromic-substrings",
        "titleUS": "647 Palindromic Substrings",
        "titleCN": "647 回文子串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Palindromic Substrings"
    },
    {
        "arg": "replace-words",
        "titleUS": "648 Replace Words",
        "titleCN": "648 单词替换",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Replace Words"
    },
    {
        "arg": "dota2-senate",
        "titleUS": "649 Dota2 Senate",
        "titleCN": "649 Dota2 参议院",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Dota2 Senate"
    },
    {
        "arg": "2-keys-keyboard",
        "titleUS": "650 2 Keys Keyboard",
        "titleCN": "650 两个键的键盘",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 2 Keys Keyboard"
    },
    {
        "arg": "4-keys-keyboard",
        "titleUS": "651 4 Keys Keyboard",
        "titleCN": "651 四个键的键盘",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 4 Keys Keyboard"
    },
    {
        "arg": "find-duplicate-subtrees",
        "titleUS": "652 Find Duplicate Subtrees",
        "titleCN": "652 寻找重复的子树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Duplicate Subtrees"
    },
    {
        "arg": "two-sum-iv-input-is-a-bst",
        "titleUS": "653 Two Sum IV - Input is a BST",
        "titleCN": "653 两数之和 IV - 输入二叉搜索树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Two Sum IV - Input is a BST"
    },
    {
        "arg": "maximum-binary-tree",
        "titleUS": "654 Maximum Binary Tree",
        "titleCN": "654 最大二叉树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Binary Tree"
    },
    {
        "arg": "print-binary-tree",
        "titleUS": "655 Print Binary Tree",
        "titleCN": "655 输出二叉树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Print Binary Tree"
    },
    {
        "arg": "coin-path",
        "titleUS": "656 Coin Path",
        "titleCN": "656 金币路径",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Coin Path"
    },
    {
        "arg": "robot-return-to-origin",
        "titleUS": "657 Robot Return to Origin",
        "titleCN": "657 机器人能否返回原点",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Robot Return to Origin"
    },
    {
        "arg": "find-k-closest-elements",
        "titleUS": "658 Find K Closest Elements",
        "titleCN": "658 找到 K 个最接近的元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find K Closest Elements"
    },
    {
        "arg": "split-array-into-consecutive-subsequences",
        "titleUS": "659 Split Array into Consecutive Subsequences",
        "titleCN": "659 分割数组为连续子序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Split Array into Consecutive Subsequences"
    },
    {
        "arg": "remove-9",
        "titleUS": "660 Remove 9",
        "titleCN": "660 移除 9",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Remove 9"
    },
    {
        "arg": "image-smoother",
        "titleUS": "661 Image Smoother",
        "titleCN": "661 图片平滑器",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Image Smoother"
    },
    {
        "arg": "maximum-width-of-binary-tree",
        "titleUS": "662 Maximum Width of Binary Tree",
        "titleCN": "662 二叉树最大宽度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Width of Binary Tree"
    },
    {
        "arg": "equal-tree-partition",
        "titleUS": "663 Equal Tree Partition",
        "titleCN": "663 均匀树划分",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Equal Tree Partition"
    },
    {
        "arg": "strange-printer",
        "titleUS": "664 Strange Printer",
        "titleCN": "664 奇怪的打印机",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Strange Printer"
    },
    {
        "arg": "non-decreasing-array",
        "titleUS": "665 Non-decreasing Array",
        "titleCN": "665 非递减数列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Non-decreasing Array"
    },
    {
        "arg": "path-sum-iv",
        "titleUS": "666 Path Sum IV",
        "titleCN": "666 路径总和 IV",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Path Sum IV"
    },
    {
        "arg": "beautiful-arrangement-ii",
        "titleUS": "667 Beautiful Arrangement II",
        "titleCN": "667 优美的排列 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Beautiful Arrangement II"
    },
    {
        "arg": "kth-smallest-number-in-multiplication-table",
        "titleUS": "668 Kth Smallest Number in Multiplication Table",
        "titleCN": "668 乘法表中第k小的数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Kth Smallest Number in Multiplication Table"
    },
    {
        "arg": "trim-a-binary-search-tree",
        "titleUS": "669 Trim a Binary Search Tree",
        "titleCN": "669 修剪二叉搜索树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Trim a Binary Search Tree"
    },
    {
        "arg": "maximum-swap",
        "titleUS": "670 Maximum Swap",
        "titleCN": "670 最大交换",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Swap"
    },
    {
        "arg": "second-minimum-node-in-a-binary-tree",
        "titleUS": "671 Second Minimum Node In a Binary Tree",
        "titleCN": "671 二叉树中第二小的节点",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Second Minimum Node In a Binary Tree"
    },
    {
        "arg": "bulb-switcher-ii",
        "titleUS": "672 Bulb Switcher II",
        "titleCN": "672 灯泡开关 Ⅱ",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Bulb Switcher II"
    },
    {
        "arg": "number-of-longest-increasing-subsequence",
        "titleUS": "673 Number of Longest Increasing Subsequence",
        "titleCN": "673 最长递增子序列的个数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Longest Increasing Subsequence"
    },
    {
        "arg": "longest-continuous-increasing-subsequence",
        "titleUS": "674 Longest Continuous Increasing Subsequence",
        "titleCN": "674 最长连续递增序列",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Longest Continuous Increasing Subsequence"
    },
    {
        "arg": "cut-off-trees-for-golf-event",
        "titleUS": "675 Cut Off Trees for Golf Event",
        "titleCN": "675 为高尔夫比赛砍树",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Cut Off Trees for Golf Event"
    },
    {
        "arg": "implement-magic-dictionary",
        "titleUS": "676 Implement Magic Dictionary",
        "titleCN": "676 实现一个魔法字典",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Implement Magic Dictionary"
    },
    {
        "arg": "map-sum-pairs",
        "titleUS": "677 Map Sum Pairs",
        "titleCN": "677 键值映射",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Map Sum Pairs"
    },
    {
        "arg": "valid-parenthesis-string",
        "titleUS": "678 Valid Parenthesis String",
        "titleCN": "678 有效的括号字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Valid Parenthesis String"
    },
    {
        "arg": "24-game",
        "titleUS": "679 24 Game",
        "titleCN": "679 24 点游戏",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 24 Game"
    },
    {
        "arg": "valid-palindrome-ii",
        "titleUS": "680 Valid Palindrome II",
        "titleCN": "680 验证回文串 II",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Valid Palindrome II"
    },
    {
        "arg": "next-closest-time",
        "titleUS": "681 Next Closest Time",
        "titleCN": "681 最近时刻",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Next Closest Time"
    },
    {
        "arg": "baseball-game",
        "titleUS": "682 Baseball Game",
        "titleCN": "682 棒球比赛",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Baseball Game"
    },
    {
        "arg": "k-empty-slots",
        "titleUS": "683 K Empty Slots",
        "titleCN": "683 K 个关闭的灯泡",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 K Empty Slots"
    },
    {
        "arg": "redundant-connection",
        "titleUS": "684 Redundant Connection",
        "titleCN": "684 冗余连接",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Redundant Connection"
    },
    {
        "arg": "redundant-connection-ii",
        "titleUS": "685 Redundant Connection II",
        "titleCN": "685 冗余连接 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Redundant Connection II"
    },
    {
        "arg": "repeated-string-match",
        "titleUS": "686 Repeated String Match",
        "titleCN": "686 重复叠加字符串匹配",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Repeated String Match"
    },
    {
        "arg": "longest-univalue-path",
        "titleUS": "687 Longest Univalue Path",
        "titleCN": "687 最长同值路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Univalue Path"
    },
    {
        "arg": "knight-probability-in-chessboard",
        "titleUS": "688 Knight Probability in Chessboard",
        "titleCN": "688 骑士在棋盘上的概率",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Knight Probability in Chessboard"
    },
    {
        "arg": "maximum-sum-of-3-non-overlapping-subarrays",
        "titleUS": "689 Maximum Sum of 3 Non-Overlapping Subarrays",
        "titleCN": "689 三个无重叠子数组的最大和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Sum of 3 Non-Overlapping Subarrays"
    },
    {
        "arg": "employee-importance",
        "titleUS": "690 Employee Importance",
        "titleCN": "690 员工的重要性",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Employee Importance"
    },
    {
        "arg": "stickers-to-spell-word",
        "titleUS": "691 Stickers to Spell Word",
        "titleCN": "691 贴纸拼词",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Stickers to Spell Word"
    },
    {
        "arg": "top-k-frequent-words",
        "titleUS": "692 Top K Frequent Words",
        "titleCN": "692 前K个高频单词",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Top K Frequent Words"
    },
    {
        "arg": "binary-number-with-alternating-bits",
        "titleUS": "693 Binary Number with Alternating Bits",
        "titleCN": "693 交替位二进制数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Binary Number with Alternating Bits"
    },
    {
        "arg": "number-of-distinct-islands",
        "titleUS": "694 Number of Distinct Islands",
        "titleCN": "694 不同岛屿的数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Distinct Islands"
    },
    {
        "arg": "max-area-of-island",
        "titleUS": "695 Max Area of Island",
        "titleCN": "695 岛屿的最大面积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Max Area of Island"
    },
    {
        "arg": "count-binary-substrings",
        "titleUS": "696 Count Binary Substrings",
        "titleCN": "696 计数二进制子串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Binary Substrings"
    },
    {
        "arg": "degree-of-an-array",
        "titleUS": "697 Degree of an Array",
        "titleCN": "697 数组的度",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Degree of an Array"
    },
    {
        "arg": "partition-to-k-equal-sum-subsets",
        "titleUS": "698 Partition to K Equal Sum Subsets",
        "titleCN": "698 划分为k个相等的子集",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Partition to K Equal Sum Subsets"
    },
    {
        "arg": "falling-squares",
        "titleUS": "699 Falling Squares",
        "titleCN": "699 掉落的方块",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Falling Squares"
    },
    {
        "arg": "search-in-a-binary-search-tree",
        "titleUS": "700 Search in a Binary Search Tree",
        "titleCN": "700 二叉搜索树中的搜索",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Search in a Binary Search Tree"
    },
    {
        "arg": "insert-into-a-binary-search-tree",
        "titleUS": "701 Insert into a Binary Search Tree",
        "titleCN": "701 二叉搜索树中的插入操作",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Insert into a Binary Search Tree"
    },
    {
        "arg": "search-in-a-sorted-array-of-unknown-size",
        "titleUS": "702 Search in a Sorted Array of Unknown Size",
        "titleCN": "702 搜索长度未知的有序数组",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Search in a Sorted Array of Unknown Size"
    },
    {
        "arg": "kth-largest-element-in-a-stream",
        "titleUS": "703 Kth Largest Element in a Stream",
        "titleCN": "703 数据流中的第 K 大元素",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Kth Largest Element in a Stream"
    },
    {
        "arg": "binary-search",
        "titleUS": "704 Binary Search",
        "titleCN": "704 二分查找",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Binary Search"
    },
    {
        "arg": "design-hashset",
        "titleUS": "705 Design HashSet",
        "titleCN": "705 设计哈希集合",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Design HashSet"
    },
    {
        "arg": "design-hashmap",
        "titleUS": "706 Design HashMap",
        "titleCN": "706 设计哈希映射",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Design HashMap"
    },
    {
        "arg": "design-linked-list",
        "titleUS": "707 Design Linked List",
        "titleCN": "707 设计链表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Design Linked List"
    },
    {
        "arg": "insert-into-a-sorted-circular-linked-list",
        "titleUS": "708 Insert into a Sorted Circular Linked List",
        "titleCN": "708 循环有序列表的插入",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Insert into a Sorted Circular Linked List"
    },
    {
        "arg": "to-lower-case",
        "titleUS": "709 To Lower Case",
        "titleCN": "709 转换成小写字母",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 To Lower Case"
    },
    {
        "arg": "random-pick-with-blacklist",
        "titleUS": "710 Random Pick with Blacklist",
        "titleCN": "710 黑名单中的随机数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Random Pick with Blacklist"
    },
    {
        "arg": "number-of-distinct-islands-ii",
        "titleUS": "711 Number of Distinct Islands II",
        "titleCN": "711 不同岛屿的数量 II",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Number of Distinct Islands II"
    },
    {
        "arg": "minimum-ascii-delete-sum-for-two-strings",
        "titleUS": "712 Minimum ASCII Delete Sum for Two Strings",
        "titleCN": "712 两个字符串的最小ASCII删除和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum ASCII Delete Sum for Two Strings"
    },
    {
        "arg": "subarray-product-less-than-k",
        "titleUS": "713 Subarray Product Less Than K",
        "titleCN": "713 乘积小于 K 的子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Subarray Product Less Than K"
    },
    {
        "arg": "best-time-to-buy-and-sell-stock-with-transaction-fee",
        "titleUS": "714 Best Time to Buy and Sell Stock with Transaction Fee",
        "titleCN": "714 买卖股票的最佳时机含手续费",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Best Time to Buy and Sell Stock with Transaction Fee"
    },
    {
        "arg": "range-module",
        "titleUS": "715 Range Module",
        "titleCN": "715 Range 模块",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Range Module"
    },
    {
        "arg": "max-stack",
        "titleUS": "716 Max Stack",
        "titleCN": "716 最大栈",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Max Stack"
    },
    {
        "arg": "1-bit-and-2-bit-characters",
        "titleUS": "717 1-bit and 2-bit Characters",
        "titleCN": "717 1 比特与 2 比特字符",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 1-bit and 2-bit Characters"
    },
    {
        "arg": "maximum-length-of-repeated-subarray",
        "titleUS": "718 Maximum Length of Repeated Subarray",
        "titleCN": "718 最长重复子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Length of Repeated Subarray"
    },
    {
        "arg": "find-k-th-smallest-pair-distance",
        "titleUS": "719 Find K-th Smallest Pair Distance",
        "titleCN": "719 找出第 K 小的数对距离",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find K-th Smallest Pair Distance"
    },
    {
        "arg": "longest-word-in-dictionary",
        "titleUS": "720 Longest Word in Dictionary",
        "titleCN": "720 词典中最长的单词",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Word in Dictionary"
    },
    {
        "arg": "accounts-merge",
        "titleUS": "721 Accounts Merge",
        "titleCN": "721 账户合并",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Accounts Merge"
    },
    {
        "arg": "remove-comments",
        "titleUS": "722 Remove Comments",
        "titleCN": "722 删除注释",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Remove Comments"
    },
    {
        "arg": "candy-crush",
        "titleUS": "723 Candy Crush",
        "titleCN": "723 粉碎糖果",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Candy Crush"
    },
    {
        "arg": "find-pivot-index",
        "titleUS": "724 Find Pivot Index",
        "titleCN": "724 寻找数组的中心下标",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Pivot Index"
    },
    {
        "arg": "split-linked-list-in-parts",
        "titleUS": "725 Split Linked List in Parts",
        "titleCN": "725 分隔链表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Split Linked List in Parts"
    },
    {
        "arg": "number-of-atoms",
        "titleUS": "726 Number of Atoms",
        "titleCN": "726 原子的数量",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Atoms"
    },
    {
        "arg": "minimum-window-subsequence",
        "titleUS": "727 Minimum Window Subsequence",
        "titleCN": "727 最小窗口子序列",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Minimum Window Subsequence"
    },
    {
        "arg": "self-dividing-numbers",
        "titleUS": "728 Self Dividing Numbers",
        "titleCN": "728 自除数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Self Dividing Numbers"
    },
    {
        "arg": "my-calendar-i",
        "titleUS": "729 My Calendar I",
        "titleCN": "729 我的日程安排表 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 My Calendar I"
    },
    {
        "arg": "count-different-palindromic-subsequences",
        "titleUS": "730 Count Different Palindromic Subsequences",
        "titleCN": "730 统计不同回文子序列",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Different Palindromic Subsequences"
    },
    {
        "arg": "my-calendar-ii",
        "titleUS": "731 My Calendar II",
        "titleCN": "731 我的日程安排表 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 My Calendar II"
    },
    {
        "arg": "my-calendar-iii",
        "titleUS": "732 My Calendar III",
        "titleCN": "732 我的日程安排表 III",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 My Calendar III"
    },
    {
        "arg": "flood-fill",
        "titleUS": "733 Flood Fill",
        "titleCN": "733 图像渲染",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Flood Fill"
    },
    {
        "arg": "sentence-similarity",
        "titleUS": "734 Sentence Similarity",
        "titleCN": "734 句子相似性",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Sentence Similarity"
    },
    {
        "arg": "asteroid-collision",
        "titleUS": "735 Asteroid Collision",
        "titleCN": "735 小行星碰撞",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Asteroid Collision"
    },
    {
        "arg": "parse-lisp-expression",
        "titleUS": "736 Parse Lisp Expression",
        "titleCN": "736 Lisp 语法解析",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Parse Lisp Expression"
    },
    {
        "arg": "sentence-similarity-ii",
        "titleUS": "737 Sentence Similarity II",
        "titleCN": "737 句子相似性 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Sentence Similarity II"
    },
    {
        "arg": "monotone-increasing-digits",
        "titleUS": "738 Monotone Increasing Digits",
        "titleCN": "738 单调递增的数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Monotone Increasing Digits"
    },
    {
        "arg": "daily-temperatures",
        "titleUS": "739 Daily Temperatures",
        "titleCN": "739 每日温度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Daily Temperatures"
    },
    {
        "arg": "delete-and-earn",
        "titleUS": "740 Delete and Earn",
        "titleCN": "740 删除并获得点数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Delete and Earn"
    },
    {
        "arg": "cherry-pickup",
        "titleUS": "741 Cherry Pickup",
        "titleCN": "741 摘樱桃",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Cherry Pickup"
    },
    {
        "arg": "closest-leaf-in-a-binary-tree",
        "titleUS": "742 Closest Leaf in a Binary Tree",
        "titleCN": "742 二叉树最近的叶节点",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Closest Leaf in a Binary Tree"
    },
    {
        "arg": "network-delay-time",
        "titleUS": "743 Network Delay Time",
        "titleCN": "743 网络延迟时间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Network Delay Time"
    },
    {
        "arg": "find-smallest-letter-greater-than-target",
        "titleUS": "744 Find Smallest Letter Greater Than Target",
        "titleCN": "744 寻找比目标字母大的最小字母",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Smallest Letter Greater Than Target"
    },
    {
        "arg": "prefix-and-suffix-search",
        "titleUS": "745 Prefix and Suffix Search",
        "titleCN": "745 前缀和后缀搜索",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Prefix and Suffix Search"
    },
    {
        "arg": "min-cost-climbing-stairs",
        "titleUS": "746 Min Cost Climbing Stairs",
        "titleCN": "746 使用最小花费爬楼梯",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Min Cost Climbing Stairs"
    },
    {
        "arg": "largest-number-at-least-twice-of-others",
        "titleUS": "747 Largest Number At Least Twice of Others",
        "titleCN": "747 至少是其他数字两倍的最大数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Largest Number At Least Twice of Others"
    },
    {
        "arg": "shortest-completing-word",
        "titleUS": "748 Shortest Completing Word",
        "titleCN": "748 最短补全词",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Shortest Completing Word"
    },
    {
        "arg": "contain-virus",
        "titleUS": "749 Contain Virus",
        "titleCN": "749 隔离病毒",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Contain Virus"
    },
    {
        "arg": "number-of-corner-rectangles",
        "titleUS": "750 Number Of Corner Rectangles",
        "titleCN": "750 角矩形的数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number Of Corner Rectangles"
    },
    {
        "arg": "ip-to-cidr",
        "titleUS": "751 IP to CIDR",
        "titleCN": "751 IP 到 CIDR",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 IP to CIDR"
    },
    {
        "arg": "open-the-lock",
        "titleUS": "752 Open the Lock",
        "titleCN": "752 打开转盘锁",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Open the Lock"
    },
    {
        "arg": "cracking-the-safe",
        "titleUS": "753 Cracking the Safe",
        "titleCN": "753 破解保险箱",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Cracking the Safe"
    },
    {
        "arg": "reach-a-number",
        "titleUS": "754 Reach a Number",
        "titleCN": "754 到达终点数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reach a Number"
    },
    {
        "arg": "pour-water",
        "titleUS": "755 Pour Water",
        "titleCN": "755 倒水",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Pour Water"
    },
    {
        "arg": "pyramid-transition-matrix",
        "titleUS": "756 Pyramid Transition Matrix",
        "titleCN": "756 金字塔转换矩阵",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Pyramid Transition Matrix"
    },
    {
        "arg": "set-intersection-size-at-least-two",
        "titleUS": "757 Set Intersection Size At Least Two",
        "titleCN": "757 设置交集大小至少为2",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Set Intersection Size At Least Two"
    },
    {
        "arg": "bold-words-in-string",
        "titleUS": "758 Bold Words in String",
        "titleCN": "758 字符串中的加粗单词",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Bold Words in String"
    },
    {
        "arg": "employee-free-time",
        "titleUS": "759 Employee Free Time",
        "titleCN": "759 员工空闲时间",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Employee Free Time"
    },
    {
        "arg": "find-anagram-mappings",
        "titleUS": "760 Find Anagram Mappings",
        "titleCN": "760 找出变位映射",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Find Anagram Mappings"
    },
    {
        "arg": "special-binary-string",
        "titleUS": "761 Special Binary String",
        "titleCN": "761 特殊的二进制序列",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Special Binary String"
    },
    {
        "arg": "prime-number-of-set-bits-in-binary-representation",
        "titleUS": "762 Prime Number of Set Bits in Binary Representation",
        "titleCN": "762 二进制表示中质数个计算置位",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Prime Number of Set Bits in Binary Representation"
    },
    {
        "arg": "partition-labels",
        "titleUS": "763 Partition Labels",
        "titleCN": "763 划分字母区间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Partition Labels"
    },
    {
        "arg": "largest-plus-sign",
        "titleUS": "764 Largest Plus Sign",
        "titleCN": "764 最大加号标志",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Largest Plus Sign"
    },
    {
        "arg": "couples-holding-hands",
        "titleUS": "765 Couples Holding Hands",
        "titleCN": "765 情侣牵手",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Couples Holding Hands"
    },
    {
        "arg": "toeplitz-matrix",
        "titleUS": "766 Toeplitz Matrix",
        "titleCN": "766 托普利茨矩阵",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Toeplitz Matrix"
    },
    {
        "arg": "reorganize-string",
        "titleUS": "767 Reorganize String",
        "titleCN": "767 重构字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reorganize String"
    },
    {
        "arg": "max-chunks-to-make-sorted-ii",
        "titleUS": "768 Max Chunks To Make Sorted II",
        "titleCN": "768 最多能完成排序的块 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Max Chunks To Make Sorted II"
    },
    {
        "arg": "max-chunks-to-make-sorted",
        "titleUS": "769 Max Chunks To Make Sorted",
        "titleCN": "769 最多能完成排序的块",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Max Chunks To Make Sorted"
    },
    {
        "arg": "basic-calculator-iv",
        "titleUS": "770 Basic Calculator IV",
        "titleCN": "770 基本计算器 IV",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Basic Calculator IV"
    },
    {
        "arg": "jewels-and-stones",
        "titleUS": "771 Jewels and Stones",
        "titleCN": "771 宝石与石头",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Jewels and Stones"
    },
    {
        "arg": "basic-calculator-iii",
        "titleUS": "772 Basic Calculator III",
        "titleCN": "772 基本计算器 III",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Basic Calculator III"
    },
    {
        "arg": "sliding-puzzle",
        "titleUS": "773 Sliding Puzzle",
        "titleCN": "773 滑动谜题",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Sliding Puzzle"
    },
    {
        "arg": "minimize-max-distance-to-gas-station",
        "titleUS": "774 Minimize Max Distance to Gas Station",
        "titleCN": "774 最小化去加油站的最大距离",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Minimize Max Distance to Gas Station"
    },
    {
        "arg": "global-and-local-inversions",
        "titleUS": "775 Global and Local Inversions",
        "titleCN": "775 全局倒置与局部倒置",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Global and Local Inversions"
    },
    {
        "arg": "split-bst",
        "titleUS": "776 Split BST",
        "titleCN": "776 拆分二叉搜索树",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Split BST"
    },
    {
        "arg": "swap-adjacent-in-lr-string",
        "titleUS": "777 Swap Adjacent in LR String",
        "titleCN": "777 在LR字符串中交换相邻字符",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Swap Adjacent in LR String"
    },
    {
        "arg": "swim-in-rising-water",
        "titleUS": "778 Swim in Rising Water",
        "titleCN": "778 水位上升的泳池中游泳",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Swim in Rising Water"
    },
    {
        "arg": "k-th-symbol-in-grammar",
        "titleUS": "779 K-th Symbol in Grammar",
        "titleCN": "779 第K个语法符号",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 K-th Symbol in Grammar"
    },
    {
        "arg": "reaching-points",
        "titleUS": "780 Reaching Points",
        "titleCN": "780 到达终点",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Reaching Points"
    },
    {
        "arg": "rabbits-in-forest",
        "titleUS": "781 Rabbits in Forest",
        "titleCN": "781 森林中的兔子",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Rabbits in Forest"
    },
    {
        "arg": "transform-to-chessboard",
        "titleUS": "782 Transform to Chessboard",
        "titleCN": "782 变为棋盘",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Transform to Chessboard"
    },
    {
        "arg": "minimum-distance-between-bst-nodes",
        "titleUS": "783 Minimum Distance Between BST Nodes",
        "titleCN": "783 二叉搜索树节点最小距离",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Distance Between BST Nodes"
    },
    {
        "arg": "letter-case-permutation",
        "titleUS": "784 Letter Case Permutation",
        "titleCN": "784 字母大小写全排列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Letter Case Permutation"
    },
    {
        "arg": "is-graph-bipartite",
        "titleUS": "785 Is Graph Bipartite?",
        "titleCN": "785 判断二分图",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Is Graph Bipartite?"
    },
    {
        "arg": "k-th-smallest-prime-fraction",
        "titleUS": "786 K-th Smallest Prime Fraction",
        "titleCN": "786 第 K 个最小的质数分数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 K-th Smallest Prime Fraction"
    },
    {
        "arg": "cheapest-flights-within-k-stops",
        "titleUS": "787 Cheapest Flights Within K Stops",
        "titleCN": "787 K 站中转内最便宜的航班",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Cheapest Flights Within K Stops"
    },
    {
        "arg": "rotated-digits",
        "titleUS": "788 Rotated Digits",
        "titleCN": "788 旋转数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Rotated Digits"
    },
    {
        "arg": "escape-the-ghosts",
        "titleUS": "789 Escape The Ghosts",
        "titleCN": "789 逃脱阻碍者",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Escape The Ghosts"
    },
    {
        "arg": "domino-and-tromino-tiling",
        "titleUS": "790 Domino and Tromino Tiling",
        "titleCN": "790 多米诺和托米诺平铺",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Domino and Tromino Tiling"
    },
    {
        "arg": "custom-sort-string",
        "titleUS": "791 Custom Sort String",
        "titleCN": "791 自定义字符串排序",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Custom Sort String"
    },
    {
        "arg": "number-of-matching-subsequences",
        "titleUS": "792 Number of Matching Subsequences",
        "titleCN": "792 匹配子序列的单词数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Matching Subsequences"
    },
    {
        "arg": "preimage-size-of-factorial-zeroes-function",
        "titleUS": "793 Preimage Size of Factorial Zeroes Function",
        "titleCN": "793 阶乘函数后 K 个零",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Preimage Size of Factorial Zeroes Function"
    },
    {
        "arg": "valid-tic-tac-toe-state",
        "titleUS": "794 Valid Tic-Tac-Toe State",
        "titleCN": "794 有效的井字游戏",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Valid Tic-Tac-Toe State"
    },
    {
        "arg": "number-of-subarrays-with-bounded-maximum",
        "titleUS": "795 Number of Subarrays with Bounded Maximum",
        "titleCN": "795 区间子数组个数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Subarrays with Bounded Maximum"
    },
    {
        "arg": "rotate-string",
        "titleUS": "796 Rotate String",
        "titleCN": "796 旋转字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Rotate String"
    },
    {
        "arg": "all-paths-from-source-to-target",
        "titleUS": "797 All Paths From Source to Target",
        "titleCN": "797 所有可能的路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 All Paths From Source to Target"
    },
    {
        "arg": "smallest-rotation-with-highest-score",
        "titleUS": "798 Smallest Rotation with Highest Score",
        "titleCN": "798 得分最高的最小轮调",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Smallest Rotation with Highest Score"
    },
    {
        "arg": "champagne-tower",
        "titleUS": "799 Champagne Tower",
        "titleCN": "799 香槟塔",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Champagne Tower"
    },
    {
        "arg": "similar-rgb-color",
        "titleUS": "800 Similar RGB Color",
        "titleCN": "800 相似 RGB 颜色",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Similar RGB Color"
    },
    {
        "arg": "minimum-swaps-to-make-sequences-increasing",
        "titleUS": "801 Minimum Swaps To Make Sequences Increasing",
        "titleCN": "801 使序列递增的最小交换次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Swaps To Make Sequences Increasing"
    },
    {
        "arg": "find-eventual-safe-states",
        "titleUS": "802 Find Eventual Safe States",
        "titleCN": "802 找到最终的安全状态",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Eventual Safe States"
    },
    {
        "arg": "bricks-falling-when-hit",
        "titleUS": "803 Bricks Falling When Hit",
        "titleCN": "803 打砖块",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Bricks Falling When Hit"
    },
    {
        "arg": "unique-morse-code-words",
        "titleUS": "804 Unique Morse Code Words",
        "titleCN": "804 唯一摩尔斯密码词",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Unique Morse Code Words"
    },
    {
        "arg": "split-array-with-same-average",
        "titleUS": "805 Split Array With Same Average",
        "titleCN": "805 数组的均值分割",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Split Array With Same Average"
    },
    {
        "arg": "number-of-lines-to-write-string",
        "titleUS": "806 Number of Lines To Write String",
        "titleCN": "806 写字符串需要的行数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Lines To Write String"
    },
    {
        "arg": "max-increase-to-keep-city-skyline",
        "titleUS": "807 Max Increase to Keep City Skyline",
        "titleCN": "807 保持城市天际线",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Max Increase to Keep City Skyline"
    },
    {
        "arg": "soup-servings",
        "titleUS": "808 Soup Servings",
        "titleCN": "808 分汤",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Soup Servings"
    },
    {
        "arg": "expressive-words",
        "titleUS": "809 Expressive Words",
        "titleCN": "809 情感丰富的文字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Expressive Words"
    },
    {
        "arg": "chalkboard-xor-game",
        "titleUS": "810 Chalkboard XOR Game",
        "titleCN": "810 黑板异或游戏",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Chalkboard XOR Game"
    },
    {
        "arg": "subdomain-visit-count",
        "titleUS": "811 Subdomain Visit Count",
        "titleCN": "811 子域名访问计数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Subdomain Visit Count"
    },
    {
        "arg": "largest-triangle-area",
        "titleUS": "812 Largest Triangle Area",
        "titleCN": "812 最大三角形面积",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Largest Triangle Area"
    },
    {
        "arg": "largest-sum-of-averages",
        "titleUS": "813 Largest Sum of Averages",
        "titleCN": "813 最大平均值和的分组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Largest Sum of Averages"
    },
    {
        "arg": "binary-tree-pruning",
        "titleUS": "814 Binary Tree Pruning",
        "titleCN": "814 二叉树剪枝",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Binary Tree Pruning"
    },
    {
        "arg": "bus-routes",
        "titleUS": "815 Bus Routes",
        "titleCN": "815 公交路线",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Bus Routes"
    },
    {
        "arg": "ambiguous-coordinates",
        "titleUS": "816 Ambiguous Coordinates",
        "titleCN": "816 模糊坐标",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Ambiguous Coordinates"
    },
    {
        "arg": "linked-list-components",
        "titleUS": "817 Linked List Components",
        "titleCN": "817 链表组件",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Linked List Components"
    },
    {
        "arg": "race-car",
        "titleUS": "818 Race Car",
        "titleCN": "818 赛车",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Race Car"
    },
    {
        "arg": "most-common-word",
        "titleUS": "819 Most Common Word",
        "titleCN": "819 最常见的单词",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Most Common Word"
    },
    {
        "arg": "short-encoding-of-words",
        "titleUS": "820 Short Encoding of Words",
        "titleCN": "820 单词的压缩编码",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Short Encoding of Words"
    },
    {
        "arg": "shortest-distance-to-a-character",
        "titleUS": "821 Shortest Distance to a Character",
        "titleCN": "821 字符的最短距离",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Shortest Distance to a Character"
    },
    {
        "arg": "card-flipping-game",
        "titleUS": "822 Card Flipping Game",
        "titleCN": "822 翻转卡片游戏",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Card Flipping Game"
    },
    {
        "arg": "binary-trees-with-factors",
        "titleUS": "823 Binary Trees With Factors",
        "titleCN": "823 带因子的二叉树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Binary Trees With Factors"
    },
    {
        "arg": "goat-latin",
        "titleUS": "824 Goat Latin",
        "titleCN": "824 山羊拉丁文",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Goat Latin"
    },
    {
        "arg": "friends-of-appropriate-ages",
        "titleUS": "825 Friends Of Appropriate Ages",
        "titleCN": "825 适龄的朋友",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Friends Of Appropriate Ages"
    },
    {
        "arg": "most-profit-assigning-work",
        "titleUS": "826 Most Profit Assigning Work",
        "titleCN": "826 安排工作以达到最大收益",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Most Profit Assigning Work"
    },
    {
        "arg": "making-a-large-island",
        "titleUS": "827 Making A Large Island",
        "titleCN": "827 最大人工岛",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Making A Large Island"
    },
    {
        "arg": "count-unique-characters-of-all-substrings-of-a-given-string",
        "titleUS": "828 Count Unique Characters of All Substrings of a Given String",
        "titleCN": "828 统计子串中的唯一字符",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Unique Characters of All Substrings of a Given String"
    },
    {
        "arg": "consecutive-numbers-sum",
        "titleUS": "829 Consecutive Numbers Sum",
        "titleCN": "829 连续整数求和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Consecutive Numbers Sum"
    },
    {
        "arg": "positions-of-large-groups",
        "titleUS": "830 Positions of Large Groups",
        "titleCN": "830 较大分组的位置",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Positions of Large Groups"
    },
    {
        "arg": "masking-personal-information",
        "titleUS": "831 Masking Personal Information",
        "titleCN": "831 隐藏个人信息",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Masking Personal Information"
    },
    {
        "arg": "flipping-an-image",
        "titleUS": "832 Flipping an Image",
        "titleCN": "832 翻转图像",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Flipping an Image"
    },
    {
        "arg": "find-and-replace-in-string",
        "titleUS": "833 Find And Replace in String",
        "titleCN": "833 字符串中的查找与替换",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find And Replace in String"
    },
    {
        "arg": "sum-of-distances-in-tree",
        "titleUS": "834 Sum of Distances in Tree",
        "titleCN": "834 树中距离之和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Sum of Distances in Tree"
    },
    {
        "arg": "image-overlap",
        "titleUS": "835 Image Overlap",
        "titleCN": "835 图像重叠",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Image Overlap"
    },
    {
        "arg": "rectangle-overlap",
        "titleUS": "836 Rectangle Overlap",
        "titleCN": "836 矩形重叠",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Rectangle Overlap"
    },
    {
        "arg": "new-21-game",
        "titleUS": "837 New 21 Game",
        "titleCN": "837 新 21 点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 New 21 Game"
    },
    {
        "arg": "push-dominoes",
        "titleUS": "838 Push Dominoes",
        "titleCN": "838 推多米诺",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Push Dominoes"
    },
    {
        "arg": "similar-string-groups",
        "titleUS": "839 Similar String Groups",
        "titleCN": "839 相似字符串组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Similar String Groups"
    },
    {
        "arg": "magic-squares-in-grid",
        "titleUS": "840 Magic Squares In Grid",
        "titleCN": "840 矩阵中的幻方",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Magic Squares In Grid"
    },
    {
        "arg": "keys-and-rooms",
        "titleUS": "841 Keys and Rooms",
        "titleCN": "841 钥匙和房间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Keys and Rooms"
    },
    {
        "arg": "split-array-into-fibonacci-sequence",
        "titleUS": "842 Split Array into Fibonacci Sequence",
        "titleCN": "842 将数组拆分成斐波那契序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Split Array into Fibonacci Sequence"
    },
    {
        "arg": "guess-the-word",
        "titleUS": "843 Guess the Word",
        "titleCN": "843 猜猜这个单词",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Guess the Word"
    },
    {
        "arg": "backspace-string-compare",
        "titleUS": "844 Backspace String Compare",
        "titleCN": "844 比较含退格的字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Backspace String Compare"
    },
    {
        "arg": "longest-mountain-in-array",
        "titleUS": "845 Longest Mountain in Array",
        "titleCN": "845 数组中的最长山脉",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Mountain in Array"
    },
    {
        "arg": "hand-of-straights",
        "titleUS": "846 Hand of Straights",
        "titleCN": "846 一手顺子",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Hand of Straights"
    },
    {
        "arg": "shortest-path-visiting-all-nodes",
        "titleUS": "847 Shortest Path Visiting All Nodes",
        "titleCN": "847 访问所有节点的最短路径",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Shortest Path Visiting All Nodes"
    },
    {
        "arg": "shifting-letters",
        "titleUS": "848 Shifting Letters",
        "titleCN": "848 字母移位",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Shifting Letters"
    },
    {
        "arg": "maximize-distance-to-closest-person",
        "titleUS": "849 Maximize Distance to Closest Person",
        "titleCN": "849 到最近的人的最大距离",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximize Distance to Closest Person"
    },
    {
        "arg": "rectangle-area-ii",
        "titleUS": "850 Rectangle Area II",
        "titleCN": "850 矩形面积 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Rectangle Area II"
    },
    {
        "arg": "loud-and-rich",
        "titleUS": "851 Loud and Rich",
        "titleCN": "851 喧闹和富有",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Loud and Rich"
    },
    {
        "arg": "peak-index-in-a-mountain-array",
        "titleUS": "852 Peak Index in a Mountain Array",
        "titleCN": "852 山脉数组的峰顶索引",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Peak Index in a Mountain Array"
    },
    {
        "arg": "car-fleet",
        "titleUS": "853 Car Fleet",
        "titleCN": "853 车队",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Car Fleet"
    },
    {
        "arg": "k-similar-strings",
        "titleUS": "854 K-Similar Strings",
        "titleCN": "854 相似度为 K 的字符串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 K-Similar Strings"
    },
    {
        "arg": "exam-room",
        "titleUS": "855 Exam Room",
        "titleCN": "855 考场就座",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Exam Room"
    },
    {
        "arg": "score-of-parentheses",
        "titleUS": "856 Score of Parentheses",
        "titleCN": "856 括号的分数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Score of Parentheses"
    },
    {
        "arg": "minimum-cost-to-hire-k-workers",
        "titleUS": "857 Minimum Cost to Hire K Workers",
        "titleCN": "857 雇佣 K 名工人的最低成本",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Cost to Hire K Workers"
    },
    {
        "arg": "mirror-reflection",
        "titleUS": "858 Mirror Reflection",
        "titleCN": "858 镜面反射",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Mirror Reflection"
    },
    {
        "arg": "buddy-strings",
        "titleUS": "859 Buddy Strings",
        "titleCN": "859 亲密字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Buddy Strings"
    },
    {
        "arg": "lemonade-change",
        "titleUS": "860 Lemonade Change",
        "titleCN": "860 柠檬水找零",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Lemonade Change"
    },
    {
        "arg": "score-after-flipping-matrix",
        "titleUS": "861 Score After Flipping Matrix",
        "titleCN": "861 翻转矩阵后的得分",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Score After Flipping Matrix"
    },
    {
        "arg": "shortest-subarray-with-sum-at-least-k",
        "titleUS": "862 Shortest Subarray with Sum at Least K",
        "titleCN": "862 和至少为 K 的最短子数组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Shortest Subarray with Sum at Least K"
    },
    {
        "arg": "all-nodes-distance-k-in-binary-tree",
        "titleUS": "863 All Nodes Distance K in Binary Tree",
        "titleCN": "863 二叉树中所有距离为 K 的结点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 All Nodes Distance K in Binary Tree"
    },
    {
        "arg": "shortest-path-to-get-all-keys",
        "titleUS": "864 Shortest Path to Get All Keys",
        "titleCN": "864 获取所有钥匙的最短路径",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Shortest Path to Get All Keys"
    },
    {
        "arg": "smallest-subtree-with-all-the-deepest-nodes",
        "titleUS": "865 Smallest Subtree with all the Deepest Nodes",
        "titleCN": "865 具有所有最深节点的最小子树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Smallest Subtree with all the Deepest Nodes"
    },
    {
        "arg": "prime-palindrome",
        "titleUS": "866 Prime Palindrome",
        "titleCN": "866 回文质数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Prime Palindrome"
    },
    {
        "arg": "transpose-matrix",
        "titleUS": "867 Transpose Matrix",
        "titleCN": "867 转置矩阵",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Transpose Matrix"
    },
    {
        "arg": "binary-gap",
        "titleUS": "868 Binary Gap",
        "titleCN": "868 二进制间距",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Binary Gap"
    },
    {
        "arg": "reordered-power-of-2",
        "titleUS": "869 Reordered Power of 2",
        "titleCN": "869 重新排序得到 2 的幂",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reordered Power of 2"
    },
    {
        "arg": "advantage-shuffle",
        "titleUS": "870 Advantage Shuffle",
        "titleCN": "870 优势洗牌",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Advantage Shuffle"
    },
    {
        "arg": "minimum-number-of-refueling-stops",
        "titleUS": "871 Minimum Number of Refueling Stops",
        "titleCN": "871 最低加油次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Number of Refueling Stops"
    },
    {
        "arg": "leaf-similar-trees",
        "titleUS": "872 Leaf-Similar Trees",
        "titleCN": "872 叶子相似的树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Leaf-Similar Trees"
    },
    {
        "arg": "length-of-longest-fibonacci-subsequence",
        "titleUS": "873 Length of Longest Fibonacci Subsequence",
        "titleCN": "873 最长的斐波那契子序列的长度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Length of Longest Fibonacci Subsequence"
    },
    {
        "arg": "walking-robot-simulation",
        "titleUS": "874 Walking Robot Simulation",
        "titleCN": "874 模拟行走机器人",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Walking Robot Simulation"
    },
    {
        "arg": "koko-eating-bananas",
        "titleUS": "875 Koko Eating Bananas",
        "titleCN": "875 爱吃香蕉的珂珂",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Koko Eating Bananas"
    },
    {
        "arg": "middle-of-the-linked-list",
        "titleUS": "876 Middle of the Linked List",
        "titleCN": "876 链表的中间结点",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Middle of the Linked List"
    },
    {
        "arg": "stone-game",
        "titleUS": "877 Stone Game",
        "titleCN": "877 石子游戏",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Stone Game"
    },
    {
        "arg": "nth-magical-number",
        "titleUS": "878 Nth Magical Number",
        "titleCN": "878 第 N 个神奇数字",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Nth Magical Number"
    },
    {
        "arg": "profitable-schemes",
        "titleUS": "879 Profitable Schemes",
        "titleCN": "879 盈利计划",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Profitable Schemes"
    },
    {
        "arg": "decoded-string-at-index",
        "titleUS": "880 Decoded String at Index",
        "titleCN": "880 索引处的解码字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Decoded String at Index"
    },
    {
        "arg": "boats-to-save-people",
        "titleUS": "881 Boats to Save People",
        "titleCN": "881 救生艇",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Boats to Save People"
    },
    {
        "arg": "reachable-nodes-in-subdivided-graph",
        "titleUS": "882 Reachable Nodes In Subdivided Graph",
        "titleCN": "882 细分图中的可到达节点",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Reachable Nodes In Subdivided Graph"
    },
    {
        "arg": "projection-area-of-3d-shapes",
        "titleUS": "883 Projection Area of 3D Shapes",
        "titleCN": "883 三维形体投影面积",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Projection Area of 3D Shapes"
    },
    {
        "arg": "uncommon-words-from-two-sentences",
        "titleUS": "884 Uncommon Words from Two Sentences",
        "titleCN": "884 两句话中的不常见单词",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Uncommon Words from Two Sentences"
    },
    {
        "arg": "spiral-matrix-iii",
        "titleUS": "885 Spiral Matrix III",
        "titleCN": "885 螺旋矩阵 III",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Spiral Matrix III"
    },
    {
        "arg": "possible-bipartition",
        "titleUS": "886 Possible Bipartition",
        "titleCN": "886 可能的二分法",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Possible Bipartition"
    },
    {
        "arg": "super-egg-drop",
        "titleUS": "887 Super Egg Drop",
        "titleCN": "887 鸡蛋掉落",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Super Egg Drop"
    },
    {
        "arg": "fair-candy-swap",
        "titleUS": "888 Fair Candy Swap",
        "titleCN": "888 公平的糖果交换",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Fair Candy Swap"
    },
    {
        "arg": "construct-binary-tree-from-preorder-and-postorder-traversal",
        "titleUS": "889 Construct Binary Tree from Preorder and Postorder Traversal",
        "titleCN": "889 根据前序和后序遍历构造二叉树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Construct Binary Tree from Preorder and Postorder Traversal"
    },
    {
        "arg": "find-and-replace-pattern",
        "titleUS": "890 Find and Replace Pattern",
        "titleCN": "890 查找和替换模式",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find and Replace Pattern"
    },
    {
        "arg": "sum-of-subsequence-widths",
        "titleUS": "891 Sum of Subsequence Widths",
        "titleCN": "891 子序列宽度之和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Sum of Subsequence Widths"
    },
    {
        "arg": "surface-area-of-3d-shapes",
        "titleUS": "892 Surface Area of 3D Shapes",
        "titleCN": "892 三维形体的表面积",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Surface Area of 3D Shapes"
    },
    {
        "arg": "groups-of-special-equivalent-strings",
        "titleUS": "893 Groups of Special-Equivalent Strings",
        "titleCN": "893 特殊等价字符串组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Groups of Special-Equivalent Strings"
    },
    {
        "arg": "all-possible-full-binary-trees",
        "titleUS": "894 All Possible Full Binary Trees",
        "titleCN": "894 所有可能的真二叉树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 All Possible Full Binary Trees"
    },
    {
        "arg": "maximum-frequency-stack",
        "titleUS": "895 Maximum Frequency Stack",
        "titleCN": "895 最大频率栈",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Frequency Stack"
    },
    {
        "arg": "monotonic-array",
        "titleUS": "896 Monotonic Array",
        "titleCN": "896 单调数列",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Monotonic Array"
    },
    {
        "arg": "increasing-order-search-tree",
        "titleUS": "897 Increasing Order Search Tree",
        "titleCN": "897 递增顺序搜索树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Increasing Order Search Tree"
    },
    {
        "arg": "bitwise-ors-of-subarrays",
        "titleUS": "898 Bitwise ORs of Subarrays",
        "titleCN": "898 子数组按位或操作",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Bitwise ORs of Subarrays"
    },
    {
        "arg": "orderly-queue",
        "titleUS": "899 Orderly Queue",
        "titleCN": "899 有序队列",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Orderly Queue"
    },
    {
        "arg": "rle-iterator",
        "titleUS": "900 RLE Iterator",
        "titleCN": "900 RLE 迭代器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 RLE Iterator"
    },
    {
        "arg": "online-stock-span",
        "titleUS": "901 Online Stock Span",
        "titleCN": "901 股票价格跨度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Online Stock Span"
    },
    {
        "arg": "numbers-at-most-n-given-digit-set",
        "titleUS": "902 Numbers At Most N Given Digit Set",
        "titleCN": "902 最大为 N 的数字组合",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Numbers At Most N Given Digit Set"
    },
    {
        "arg": "valid-permutations-for-di-sequence",
        "titleUS": "903 Valid Permutations for DI Sequence",
        "titleCN": "903 DI 序列的有效排列",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Valid Permutations for DI Sequence"
    },
    {
        "arg": "fruit-into-baskets",
        "titleUS": "904 Fruit Into Baskets",
        "titleCN": "904 水果成篮",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Fruit Into Baskets"
    },
    {
        "arg": "sort-array-by-parity",
        "titleUS": "905 Sort Array By Parity",
        "titleCN": "905 按奇偶排序数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sort Array By Parity"
    },
    {
        "arg": "super-palindromes",
        "titleUS": "906 Super Palindromes",
        "titleCN": "906 超级回文数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Super Palindromes"
    },
    {
        "arg": "sum-of-subarray-minimums",
        "titleUS": "907 Sum of Subarray Minimums",
        "titleCN": "907 子数组的最小值之和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum of Subarray Minimums"
    },
    {
        "arg": "smallest-range-i",
        "titleUS": "908 Smallest Range I",
        "titleCN": "908 最小差值 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Smallest Range I"
    },
    {
        "arg": "snakes-and-ladders",
        "titleUS": "909 Snakes and Ladders",
        "titleCN": "909 蛇梯棋",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Snakes and Ladders"
    },
    {
        "arg": "smallest-range-ii",
        "titleUS": "910 Smallest Range II",
        "titleCN": "910 最小差值 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Smallest Range II"
    },
    {
        "arg": "online-election",
        "titleUS": "911 Online Election",
        "titleCN": "911 在线选举",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Online Election"
    },
    {
        "arg": "sort-an-array",
        "titleUS": "912 Sort an Array",
        "titleCN": "912 排序数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sort an Array"
    },
    {
        "arg": "cat-and-mouse",
        "titleUS": "913 Cat and Mouse",
        "titleCN": "913 猫和老鼠",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Cat and Mouse"
    },
    {
        "arg": "x-of-a-kind-in-a-deck-of-cards",
        "titleUS": "914 X of a Kind in a Deck of Cards",
        "titleCN": "914 卡牌分组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 X of a Kind in a Deck of Cards"
    },
    {
        "arg": "partition-array-into-disjoint-intervals",
        "titleUS": "915 Partition Array into Disjoint Intervals",
        "titleCN": "915 分割数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Partition Array into Disjoint Intervals"
    },
    {
        "arg": "word-subsets",
        "titleUS": "916 Word Subsets",
        "titleCN": "916 单词子集",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Word Subsets"
    },
    {
        "arg": "reverse-only-letters",
        "titleUS": "917 Reverse Only Letters",
        "titleCN": "917 仅仅反转字母",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Reverse Only Letters"
    },
    {
        "arg": "maximum-sum-circular-subarray",
        "titleUS": "918 Maximum Sum Circular Subarray",
        "titleCN": "918 环形子数组的最大和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Sum Circular Subarray"
    },
    {
        "arg": "complete-binary-tree-inserter",
        "titleUS": "919 Complete Binary Tree Inserter",
        "titleCN": "919 完全二叉树插入器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Complete Binary Tree Inserter"
    },
    {
        "arg": "number-of-music-playlists",
        "titleUS": "920 Number of Music Playlists",
        "titleCN": "920 播放列表的数量",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Music Playlists"
    },
    {
        "arg": "minimum-add-to-make-parentheses-valid",
        "titleUS": "921 Minimum Add to Make Parentheses Valid",
        "titleCN": "921 使括号有效的最少添加",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Add to Make Parentheses Valid"
    },
    {
        "arg": "sort-array-by-parity-ii",
        "titleUS": "922 Sort Array By Parity II",
        "titleCN": "922 按奇偶排序数组 II",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sort Array By Parity II"
    },
    {
        "arg": "3sum-with-multiplicity",
        "titleUS": "923 3Sum With Multiplicity",
        "titleCN": "923 三数之和的多种可能",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 3Sum With Multiplicity"
    },
    {
        "arg": "minimize-malware-spread",
        "titleUS": "924 Minimize Malware Spread",
        "titleCN": "924 尽量减少恶意软件的传播",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimize Malware Spread"
    },
    {
        "arg": "long-pressed-name",
        "titleUS": "925 Long Pressed Name",
        "titleCN": "925 长按键入",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Long Pressed Name"
    },
    {
        "arg": "flip-string-to-monotone-increasing",
        "titleUS": "926 Flip String to Monotone Increasing",
        "titleCN": "926 将字符串翻转到单调递增",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Flip String to Monotone Increasing"
    },
    {
        "arg": "three-equal-parts",
        "titleUS": "927 Three Equal Parts",
        "titleCN": "927 三等分",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Three Equal Parts"
    },
    {
        "arg": "minimize-malware-spread-ii",
        "titleUS": "928 Minimize Malware Spread II",
        "titleCN": "928 尽量减少恶意软件的传播 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimize Malware Spread II"
    },
    {
        "arg": "unique-email-addresses",
        "titleUS": "929 Unique Email Addresses",
        "titleCN": "929 独特的电子邮件地址",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Unique Email Addresses"
    },
    {
        "arg": "binary-subarrays-with-sum",
        "titleUS": "930 Binary Subarrays With Sum",
        "titleCN": "930 和相同的二元子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Binary Subarrays With Sum"
    },
    {
        "arg": "minimum-falling-path-sum",
        "titleUS": "931 Minimum Falling Path Sum",
        "titleCN": "931 下降路径最小和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Falling Path Sum"
    },
    {
        "arg": "beautiful-array",
        "titleUS": "932 Beautiful Array",
        "titleCN": "932 漂亮数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Beautiful Array"
    },
    {
        "arg": "number-of-recent-calls",
        "titleUS": "933 Number of Recent Calls",
        "titleCN": "933 最近的请求次数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Recent Calls"
    },
    {
        "arg": "shortest-bridge",
        "titleUS": "934 Shortest Bridge",
        "titleCN": "934 最短的桥",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Shortest Bridge"
    },
    {
        "arg": "knight-dialer",
        "titleUS": "935 Knight Dialer",
        "titleCN": "935 骑士拨号器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Knight Dialer"
    },
    {
        "arg": "stamping-the-sequence",
        "titleUS": "936 Stamping The Sequence",
        "titleCN": "936 戳印序列",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Stamping The Sequence"
    },
    {
        "arg": "reorder-data-in-log-files",
        "titleUS": "937 Reorder Data in Log Files",
        "titleCN": "937 重新排列日志文件",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reorder Data in Log Files"
    },
    {
        "arg": "range-sum-of-bst",
        "titleUS": "938 Range Sum of BST",
        "titleCN": "938 二叉搜索树的范围和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Range Sum of BST"
    },
    {
        "arg": "minimum-area-rectangle",
        "titleUS": "939 Minimum Area Rectangle",
        "titleCN": "939 最小面积矩形",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Area Rectangle"
    },
    {
        "arg": "distinct-subsequences-ii",
        "titleUS": "940 Distinct Subsequences II",
        "titleCN": "940 不同的子序列 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Distinct Subsequences II"
    },
    {
        "arg": "valid-mountain-array",
        "titleUS": "941 Valid Mountain Array",
        "titleCN": "941 有效的山脉数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Valid Mountain Array"
    },
    {
        "arg": "di-string-match",
        "titleUS": "942 DI String Match",
        "titleCN": "942 增减字符串匹配",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 DI String Match"
    },
    {
        "arg": "find-the-shortest-superstring",
        "titleUS": "943 Find the Shortest Superstring",
        "titleCN": "943 最短超级串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find the Shortest Superstring"
    },
    {
        "arg": "delete-columns-to-make-sorted",
        "titleUS": "944 Delete Columns to Make Sorted",
        "titleCN": "944 删列造序",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Delete Columns to Make Sorted"
    },
    {
        "arg": "minimum-increment-to-make-array-unique",
        "titleUS": "945 Minimum Increment to Make Array Unique",
        "titleCN": "945 使数组唯一的最小增量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Increment to Make Array Unique"
    },
    {
        "arg": "validate-stack-sequences",
        "titleUS": "946 Validate Stack Sequences",
        "titleCN": "946 验证栈序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Validate Stack Sequences"
    },
    {
        "arg": "most-stones-removed-with-same-row-or-column",
        "titleUS": "947 Most Stones Removed with Same Row or Column",
        "titleCN": "947 移除最多的同行或同列石头",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Most Stones Removed with Same Row or Column"
    },
    {
        "arg": "bag-of-tokens",
        "titleUS": "948 Bag of Tokens",
        "titleCN": "948 令牌放置",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Bag of Tokens"
    },
    {
        "arg": "largest-time-for-given-digits",
        "titleUS": "949 Largest Time for Given Digits",
        "titleCN": "949 给定数字能组成的最大时间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Largest Time for Given Digits"
    },
    {
        "arg": "reveal-cards-in-increasing-order",
        "titleUS": "950 Reveal Cards In Increasing Order",
        "titleCN": "950 按递增顺序显示卡牌",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reveal Cards In Increasing Order"
    },
    {
        "arg": "flip-equivalent-binary-trees",
        "titleUS": "951 Flip Equivalent Binary Trees",
        "titleCN": "951 翻转等价二叉树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Flip Equivalent Binary Trees"
    },
    {
        "arg": "largest-component-size-by-common-factor",
        "titleUS": "952 Largest Component Size by Common Factor",
        "titleCN": "952 按公因数计算最大组件大小",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Largest Component Size by Common Factor"
    },
    {
        "arg": "verifying-an-alien-dictionary",
        "titleUS": "953 Verifying an Alien Dictionary",
        "titleCN": "953 验证外星语词典",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Verifying an Alien Dictionary"
    },
    {
        "arg": "array-of-doubled-pairs",
        "titleUS": "954 Array of Doubled Pairs",
        "titleCN": "954 二倍数对数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Array of Doubled Pairs"
    },
    {
        "arg": "delete-columns-to-make-sorted-ii",
        "titleUS": "955 Delete Columns to Make Sorted II",
        "titleCN": "955 删列造序 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Delete Columns to Make Sorted II"
    },
    {
        "arg": "tallest-billboard",
        "titleUS": "956 Tallest Billboard",
        "titleCN": "956 最高的广告牌",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Tallest Billboard"
    },
    {
        "arg": "prison-cells-after-n-days",
        "titleUS": "957 Prison Cells After N Days",
        "titleCN": "957 N 天后的牢房",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Prison Cells After N Days"
    },
    {
        "arg": "check-completeness-of-a-binary-tree",
        "titleUS": "958 Check Completeness of a Binary Tree",
        "titleCN": "958 二叉树的完全性检验",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Check Completeness of a Binary Tree"
    },
    {
        "arg": "regions-cut-by-slashes",
        "titleUS": "959 Regions Cut By Slashes",
        "titleCN": "959 由斜杠划分区域",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Regions Cut By Slashes"
    },
    {
        "arg": "delete-columns-to-make-sorted-iii",
        "titleUS": "960 Delete Columns to Make Sorted III",
        "titleCN": "960 删列造序 III",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Delete Columns to Make Sorted III"
    },
    {
        "arg": "n-repeated-element-in-size-2n-array",
        "titleUS": "961 N-Repeated Element in Size 2N Array",
        "titleCN": "961 在长度 2N 的数组中找出重复 N 次的元素",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 N-Repeated Element in Size 2N Array"
    },
    {
        "arg": "maximum-width-ramp",
        "titleUS": "962 Maximum Width Ramp",
        "titleCN": "962 最大宽度坡",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Width Ramp"
    },
    {
        "arg": "minimum-area-rectangle-ii",
        "titleUS": "963 Minimum Area Rectangle II",
        "titleCN": "963 最小面积矩形 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Area Rectangle II"
    },
    {
        "arg": "least-operators-to-express-number",
        "titleUS": "964 Least Operators to Express Number",
        "titleCN": "964 表示数字的最少运算符",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Least Operators to Express Number"
    },
    {
        "arg": "univalued-binary-tree",
        "titleUS": "965 Univalued Binary Tree",
        "titleCN": "965 单值二叉树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Univalued Binary Tree"
    },
    {
        "arg": "vowel-spellchecker",
        "titleUS": "966 Vowel Spellchecker",
        "titleCN": "966 元音拼写检查器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Vowel Spellchecker"
    },
    {
        "arg": "numbers-with-same-consecutive-differences",
        "titleUS": "967 Numbers With Same Consecutive Differences",
        "titleCN": "967 连续差相同的数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Numbers With Same Consecutive Differences"
    },
    {
        "arg": "binary-tree-cameras",
        "titleUS": "968 Binary Tree Cameras",
        "titleCN": "968 监控二叉树",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Binary Tree Cameras"
    },
    {
        "arg": "pancake-sorting",
        "titleUS": "969 Pancake Sorting",
        "titleCN": "969 煎饼排序",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Pancake Sorting"
    },
    {
        "arg": "powerful-integers",
        "titleUS": "970 Powerful Integers",
        "titleCN": "970 强整数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Powerful Integers"
    },
    {
        "arg": "flip-binary-tree-to-match-preorder-traversal",
        "titleUS": "971 Flip Binary Tree To Match Preorder Traversal",
        "titleCN": "971 翻转二叉树以匹配先序遍历",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Flip Binary Tree To Match Preorder Traversal"
    },
    {
        "arg": "equal-rational-numbers",
        "titleUS": "972 Equal Rational Numbers",
        "titleCN": "972 相等的有理数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Equal Rational Numbers"
    },
    {
        "arg": "k-closest-points-to-origin",
        "titleUS": "973 K Closest Points to Origin",
        "titleCN": "973 最接近原点的 K 个点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 K Closest Points to Origin"
    },
    {
        "arg": "subarray-sums-divisible-by-k",
        "titleUS": "974 Subarray Sums Divisible by K",
        "titleCN": "974 和可被 K 整除的子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Subarray Sums Divisible by K"
    },
    {
        "arg": "odd-even-jump",
        "titleUS": "975 Odd Even Jump",
        "titleCN": "975 奇偶跳",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Odd Even Jump"
    },
    {
        "arg": "largest-perimeter-triangle",
        "titleUS": "976 Largest Perimeter Triangle",
        "titleCN": "976 三角形的最大周长",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Largest Perimeter Triangle"
    },
    {
        "arg": "squares-of-a-sorted-array",
        "titleUS": "977 Squares of a Sorted Array",
        "titleCN": "977 有序数组的平方",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Squares of a Sorted Array"
    },
    {
        "arg": "longest-turbulent-subarray",
        "titleUS": "978 Longest Turbulent Subarray",
        "titleCN": "978 最长湍流子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Turbulent Subarray"
    },
    {
        "arg": "distribute-coins-in-binary-tree",
        "titleUS": "979 Distribute Coins in Binary Tree",
        "titleCN": "979 在二叉树中分配硬币",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Distribute Coins in Binary Tree"
    },
    {
        "arg": "unique-paths-iii",
        "titleUS": "980 Unique Paths III",
        "titleCN": "980 不同路径 III",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Unique Paths III"
    },
    {
        "arg": "time-based-key-value-store",
        "titleUS": "981 Time Based Key-Value Store",
        "titleCN": "981 基于时间的键值存储",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Time Based Key-Value Store"
    },
    {
        "arg": "triples-with-bitwise-and-equal-to-zero",
        "titleUS": "982 Triples with Bitwise AND Equal To Zero",
        "titleCN": "982 按位与为零的三元组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Triples with Bitwise AND Equal To Zero"
    },
    {
        "arg": "minimum-cost-for-tickets",
        "titleUS": "983 Minimum Cost For Tickets",
        "titleCN": "983 最低票价",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Cost For Tickets"
    },
    {
        "arg": "string-without-aaa-or-bbb",
        "titleUS": "984 String Without AAA or BBB",
        "titleCN": "984 不含 AAA 或 BBB 的字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 String Without AAA or BBB"
    },
    {
        "arg": "sum-of-even-numbers-after-queries",
        "titleUS": "985 Sum of Even Numbers After Queries",
        "titleCN": "985 查询后的偶数和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum of Even Numbers After Queries"
    },
    {
        "arg": "interval-list-intersections",
        "titleUS": "986 Interval List Intersections",
        "titleCN": "986 区间列表的交集",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Interval List Intersections"
    },
    {
        "arg": "vertical-order-traversal-of-a-binary-tree",
        "titleUS": "987 Vertical Order Traversal of a Binary Tree",
        "titleCN": "987 二叉树的垂序遍历",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Vertical Order Traversal of a Binary Tree"
    },
    {
        "arg": "smallest-string-starting-from-leaf",
        "titleUS": "988 Smallest String Starting From Leaf",
        "titleCN": "988 从叶结点开始的最小字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Smallest String Starting From Leaf"
    },
    {
        "arg": "add-to-array-form-of-integer",
        "titleUS": "989 Add to Array-Form of Integer",
        "titleCN": "989 数组形式的整数加法",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Add to Array-Form of Integer"
    },
    {
        "arg": "satisfiability-of-equality-equations",
        "titleUS": "990 Satisfiability of Equality Equations",
        "titleCN": "990 等式方程的可满足性",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Satisfiability of Equality Equations"
    },
    {
        "arg": "broken-calculator",
        "titleUS": "991 Broken Calculator",
        "titleCN": "991 坏了的计算器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Broken Calculator"
    },
    {
        "arg": "subarrays-with-k-different-integers",
        "titleUS": "992 Subarrays with K Different Integers",
        "titleCN": "992 K 个不同整数的子数组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Subarrays with K Different Integers"
    },
    {
        "arg": "cousins-in-binary-tree",
        "titleUS": "993 Cousins in Binary Tree",
        "titleCN": "993 二叉树的堂兄弟节点",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Cousins in Binary Tree"
    },
    {
        "arg": "rotting-oranges",
        "titleUS": "994 Rotting Oranges",
        "titleCN": "994 腐烂的橘子",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Rotting Oranges"
    },
    {
        "arg": "minimum-number-of-k-consecutive-bit-flips",
        "titleUS": "995 Minimum Number of K Consecutive Bit Flips",
        "titleCN": "995 K 连续位的最小翻转次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Number of K Consecutive Bit Flips"
    },
    {
        "arg": "number-of-squareful-arrays",
        "titleUS": "996 Number of Squareful Arrays",
        "titleCN": "996 正方形数组的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Squareful Arrays"
    },
    {
        "arg": "find-the-town-judge",
        "titleUS": "997 Find the Town Judge",
        "titleCN": "997 找到小镇的法官",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Town Judge"
    },
    {
        "arg": "maximum-binary-tree-ii",
        "titleUS": "998 Maximum Binary Tree II",
        "titleCN": "998 最大二叉树 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Binary Tree II"
    },
    {
        "arg": "available-captures-for-rook",
        "titleUS": "999 Available Captures for Rook",
        "titleCN": "999 可以被一步捕获的棋子数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Available Captures for Rook"
    },
    {
        "arg": "minimum-cost-to-merge-stones",
        "titleUS": "1000 Minimum Cost to Merge Stones",
        "titleCN": "1000 合并石头的最低成本",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Cost to Merge Stones"
    },
    {
        "arg": "grid-illumination",
        "titleUS": "1001 Grid Illumination",
        "titleCN": "1001 网格照明",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Grid Illumination"
    },
    {
        "arg": "find-common-characters",
        "titleUS": "1002 Find Common Characters",
        "titleCN": "1002 查找共用字符",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Common Characters"
    },
    {
        "arg": "check-if-word-is-valid-after-substitutions",
        "titleUS": "1003 Check If Word Is Valid After Substitutions",
        "titleCN": "1003 检查替换后的词是否有效",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Check If Word Is Valid After Substitutions"
    },
    {
        "arg": "max-consecutive-ones-iii",
        "titleUS": "1004 Max Consecutive Ones III",
        "titleCN": "1004 最大连续1的个数 III",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Max Consecutive Ones III"
    },
    {
        "arg": "maximize-sum-of-array-after-k-negations",
        "titleUS": "1005 Maximize Sum Of Array After K Negations",
        "titleCN": "1005 K 次取反后最大化的数组和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximize Sum Of Array After K Negations"
    },
    {
        "arg": "clumsy-factorial",
        "titleUS": "1006 Clumsy Factorial",
        "titleCN": "1006 笨阶乘",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Clumsy Factorial"
    },
    {
        "arg": "minimum-domino-rotations-for-equal-row",
        "titleUS": "1007 Minimum Domino Rotations For Equal Row",
        "titleCN": "1007 行相等的最少多米诺旋转",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Domino Rotations For Equal Row"
    },
    {
        "arg": "construct-binary-search-tree-from-preorder-traversal",
        "titleUS": "1008 Construct Binary Search Tree from Preorder Traversal",
        "titleCN": "1008 前序遍历构造二叉搜索树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Construct Binary Search Tree from Preorder Traversal"
    },
    {
        "arg": "complement-of-base-10-integer",
        "titleUS": "1009 Complement of Base 10 Integer",
        "titleCN": "1009 十进制整数的反码",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Complement of Base 10 Integer"
    },
    {
        "arg": "pairs-of-songs-with-total-durations-divisible-by-60",
        "titleUS": "1010 Pairs of Songs With Total Durations Divisible by 60",
        "titleCN": "1010 总持续时间可被 60 整除的歌曲",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Pairs of Songs With Total Durations Divisible by 60"
    },
    {
        "arg": "capacity-to-ship-packages-within-d-days",
        "titleUS": "1011 Capacity To Ship Packages Within D Days",
        "titleCN": "1011 在 D 天内送达包裹的能力",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Capacity To Ship Packages Within D Days"
    },
    {
        "arg": "numbers-with-repeated-digits",
        "titleUS": "1012 Numbers With Repeated Digits",
        "titleCN": "1012 至少有 1 位重复的数字",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Numbers With Repeated Digits"
    },
    {
        "arg": "partition-array-into-three-parts-with-equal-sum",
        "titleUS": "1013 Partition Array Into Three Parts With Equal Sum",
        "titleCN": "1013 将数组分成和相等的三个部分",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Partition Array Into Three Parts With Equal Sum"
    },
    {
        "arg": "best-sightseeing-pair",
        "titleUS": "1014 Best Sightseeing Pair",
        "titleCN": "1014 最佳观光组合",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Best Sightseeing Pair"
    },
    {
        "arg": "smallest-integer-divisible-by-k",
        "titleUS": "1015 Smallest Integer Divisible by K",
        "titleCN": "1015 可被 K 整除的最小整数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Smallest Integer Divisible by K"
    },
    {
        "arg": "binary-string-with-substrings-representing-1-to-n",
        "titleUS": "1016 Binary String With Substrings Representing 1 To N",
        "titleCN": "1016 子串能表示从 1 到 N 数字的二进制串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Binary String With Substrings Representing 1 To N"
    },
    {
        "arg": "convert-to-base-2",
        "titleUS": "1017 Convert to Base -2",
        "titleCN": "1017 负二进制转换",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Convert to Base -2"
    },
    {
        "arg": "binary-prefix-divisible-by-5",
        "titleUS": "1018 Binary Prefix Divisible By 5",
        "titleCN": "1018 可被 5 整除的二进制前缀",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Binary Prefix Divisible By 5"
    },
    {
        "arg": "next-greater-node-in-linked-list",
        "titleUS": "1019 Next Greater Node In Linked List",
        "titleCN": "1019 链表中的下一个更大节点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Next Greater Node In Linked List"
    },
    {
        "arg": "number-of-enclaves",
        "titleUS": "1020 Number of Enclaves",
        "titleCN": "1020 飞地的数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Enclaves"
    },
    {
        "arg": "remove-outermost-parentheses",
        "titleUS": "1021 Remove Outermost Parentheses",
        "titleCN": "1021 删除最外层的括号",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Remove Outermost Parentheses"
    },
    {
        "arg": "sum-of-root-to-leaf-binary-numbers",
        "titleUS": "1022 Sum of Root To Leaf Binary Numbers",
        "titleCN": "1022 从根到叶的二进制数之和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sum of Root To Leaf Binary Numbers"
    },
    {
        "arg": "camelcase-matching",
        "titleUS": "1023 Camelcase Matching",
        "titleCN": "1023 驼峰式匹配",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Camelcase Matching"
    },
    {
        "arg": "video-stitching",
        "titleUS": "1024 Video Stitching",
        "titleCN": "1024 视频拼接",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Video Stitching"
    },
    {
        "arg": "divisor-game",
        "titleUS": "1025 Divisor Game",
        "titleCN": "1025 除数博弈",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Divisor Game"
    },
    {
        "arg": "maximum-difference-between-node-and-ancestor",
        "titleUS": "1026 Maximum Difference Between Node and Ancestor",
        "titleCN": "1026 节点与其祖先之间的最大差值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Difference Between Node and Ancestor"
    },
    {
        "arg": "longest-arithmetic-subsequence",
        "titleUS": "1027 Longest Arithmetic Subsequence",
        "titleCN": "1027 最长等差数列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Arithmetic Subsequence"
    },
    {
        "arg": "recover-a-tree-from-preorder-traversal",
        "titleUS": "1028 Recover a Tree From Preorder Traversal",
        "titleCN": "1028 从先序遍历还原二叉树",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Recover a Tree From Preorder Traversal"
    },
    {
        "arg": "two-city-scheduling",
        "titleUS": "1029 Two City Scheduling",
        "titleCN": "1029 两地调度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Two City Scheduling"
    },
    {
        "arg": "matrix-cells-in-distance-order",
        "titleUS": "1030 Matrix Cells in Distance Order",
        "titleCN": "1030 距离顺序排列矩阵单元格",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Matrix Cells in Distance Order"
    },
    {
        "arg": "maximum-sum-of-two-non-overlapping-subarrays",
        "titleUS": "1031 Maximum Sum of Two Non-Overlapping Subarrays",
        "titleCN": "1031 两个非重叠子数组的最大和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Sum of Two Non-Overlapping Subarrays"
    },
    {
        "arg": "stream-of-characters",
        "titleUS": "1032 Stream of Characters",
        "titleCN": "1032 字符流",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Stream of Characters"
    },
    {
        "arg": "moving-stones-until-consecutive",
        "titleUS": "1033 Moving Stones Until Consecutive",
        "titleCN": "1033 移动石子直到连续",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Moving Stones Until Consecutive"
    },
    {
        "arg": "coloring-a-border",
        "titleUS": "1034 Coloring A Border",
        "titleCN": "1034 边界着色",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Coloring A Border"
    },
    {
        "arg": "uncrossed-lines",
        "titleUS": "1035 Uncrossed Lines",
        "titleCN": "1035 不相交的线",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Uncrossed Lines"
    },
    {
        "arg": "escape-a-large-maze",
        "titleUS": "1036 Escape a Large Maze",
        "titleCN": "1036 逃离大迷宫",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Escape a Large Maze"
    },
    {
        "arg": "valid-boomerang",
        "titleUS": "1037 Valid Boomerang",
        "titleCN": "1037 有效的回旋镖",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Valid Boomerang"
    },
    {
        "arg": "binary-search-tree-to-greater-sum-tree",
        "titleUS": "1038 Binary Search Tree to Greater Sum Tree",
        "titleCN": "1038 从二叉搜索树到更大和树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Binary Search Tree to Greater Sum Tree"
    },
    {
        "arg": "minimum-score-triangulation-of-polygon",
        "titleUS": "1039 Minimum Score Triangulation of Polygon",
        "titleCN": "1039 多边形三角剖分的最低得分",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Score Triangulation of Polygon"
    },
    {
        "arg": "moving-stones-until-consecutive-ii",
        "titleUS": "1040 Moving Stones Until Consecutive II",
        "titleCN": "1040 移动石子直到连续 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Moving Stones Until Consecutive II"
    },
    {
        "arg": "robot-bounded-in-circle",
        "titleUS": "1041 Robot Bounded In Circle",
        "titleCN": "1041 困于环中的机器人",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Robot Bounded In Circle"
    },
    {
        "arg": "flower-planting-with-no-adjacent",
        "titleUS": "1042 Flower Planting With No Adjacent",
        "titleCN": "1042 不邻接植花",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Flower Planting With No Adjacent"
    },
    {
        "arg": "partition-array-for-maximum-sum",
        "titleUS": "1043 Partition Array for Maximum Sum",
        "titleCN": "1043 分隔数组以得到最大和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Partition Array for Maximum Sum"
    },
    {
        "arg": "longest-duplicate-substring",
        "titleUS": "1044 Longest Duplicate Substring",
        "titleCN": "1044 最长重复子串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Longest Duplicate Substring"
    },
    {
        "arg": "last-stone-weight",
        "titleUS": "1046 Last Stone Weight",
        "titleCN": "1046 最后一块石头的重量",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Last Stone Weight"
    },
    {
        "arg": "remove-all-adjacent-duplicates-in-string",
        "titleUS": "1047 Remove All Adjacent Duplicates In String",
        "titleCN": "1047 删除字符串中的所有相邻重复项",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Remove All Adjacent Duplicates In String"
    },
    {
        "arg": "longest-string-chain",
        "titleUS": "1048 Longest String Chain",
        "titleCN": "1048 最长字符串链",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest String Chain"
    },
    {
        "arg": "last-stone-weight-ii",
        "titleUS": "1049 Last Stone Weight II",
        "titleCN": "1049 最后一块石头的重量 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Last Stone Weight II"
    },
    {
        "arg": "height-checker",
        "titleUS": "1051 Height Checker",
        "titleCN": "1051 高度检查器",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Height Checker"
    },
    {
        "arg": "grumpy-bookstore-owner",
        "titleUS": "1052 Grumpy Bookstore Owner",
        "titleCN": "1052 爱生气的书店老板",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Grumpy Bookstore Owner"
    },
    {
        "arg": "previous-permutation-with-one-swap",
        "titleUS": "1053 Previous Permutation With One Swap",
        "titleCN": "1053 交换一次的先前排列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Previous Permutation With One Swap"
    },
    {
        "arg": "distant-barcodes",
        "titleUS": "1054 Distant Barcodes",
        "titleCN": "1054 距离相等的条形码",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Distant Barcodes"
    },
    {
        "arg": "shortest-way-to-form-string",
        "titleUS": "1055 Shortest Way to Form String",
        "titleCN": "1055 形成字符串的最短路径",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Shortest Way to Form String"
    },
    {
        "arg": "confusing-number",
        "titleUS": "1056 Confusing Number",
        "titleCN": "1056 易混淆数",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Confusing Number"
    },
    {
        "arg": "campus-bikes",
        "titleUS": "1057 Campus Bikes",
        "titleCN": "1057 校园自行车分配",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Campus Bikes"
    },
    {
        "arg": "minimize-rounding-error-to-meet-target",
        "titleUS": "1058 Minimize Rounding Error to Meet Target",
        "titleCN": "1058 最小化舍入误差以满足目标",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimize Rounding Error to Meet Target"
    },
    {
        "arg": "all-paths-from-source-lead-to-destination",
        "titleUS": "1059 All Paths from Source Lead to Destination",
        "titleCN": "1059 从始点到终点的所有路径",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 All Paths from Source Lead to Destination"
    },
    {
        "arg": "missing-element-in-sorted-array",
        "titleUS": "1060 Missing Element in Sorted Array",
        "titleCN": "1060 有序数组中的缺失元素",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Missing Element in Sorted Array"
    },
    {
        "arg": "lexicographically-smallest-equivalent-string",
        "titleUS": "1061 Lexicographically Smallest Equivalent String",
        "titleCN": "1061 按字典序排列最小的等效字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Lexicographically Smallest Equivalent String"
    },
    {
        "arg": "longest-repeating-substring",
        "titleUS": "1062 Longest Repeating Substring",
        "titleCN": "1062 最长重复子串",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Longest Repeating Substring"
    },
    {
        "arg": "number-of-valid-subarrays",
        "titleUS": "1063 Number of Valid Subarrays",
        "titleCN": "1063 有效子数组的数目",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Number of Valid Subarrays"
    },
    {
        "arg": "fixed-point",
        "titleUS": "1064 Fixed Point",
        "titleCN": "1064 不动点",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Fixed Point"
    },
    {
        "arg": "index-pairs-of-a-string",
        "titleUS": "1065 Index Pairs of a String",
        "titleCN": "1065 字符串的索引对",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Index Pairs of a String"
    },
    {
        "arg": "campus-bikes-ii",
        "titleUS": "1066 Campus Bikes II",
        "titleCN": "1066 校园自行车分配 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Campus Bikes II"
    },
    {
        "arg": "digit-count-in-range",
        "titleUS": "1067 Digit Count in Range",
        "titleCN": "1067 范围内的数字计数",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Digit Count in Range"
    },
    {
        "arg": "greatest-common-divisor-of-strings",
        "titleUS": "1071 Greatest Common Divisor of Strings",
        "titleCN": "1071 字符串的最大公因子",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Greatest Common Divisor of Strings"
    },
    {
        "arg": "flip-columns-for-maximum-number-of-equal-rows",
        "titleUS": "1072 Flip Columns For Maximum Number of Equal Rows",
        "titleCN": "1072 按列翻转得到最大值等行数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Flip Columns For Maximum Number of Equal Rows"
    },
    {
        "arg": "adding-two-negabinary-numbers",
        "titleUS": "1073 Adding Two Negabinary Numbers",
        "titleCN": "1073 负二进制数相加",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Adding Two Negabinary Numbers"
    },
    {
        "arg": "number-of-submatrices-that-sum-to-target",
        "titleUS": "1074 Number of Submatrices That Sum to Target",
        "titleCN": "1074 元素和为目标值的子矩阵数量",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Submatrices That Sum to Target"
    },
    {
        "arg": "occurrences-after-bigram",
        "titleUS": "1078 Occurrences After Bigram",
        "titleCN": "1078 Bigram 分词",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Occurrences After Bigram"
    },
    {
        "arg": "letter-tile-possibilities",
        "titleUS": "1079 Letter Tile Possibilities",
        "titleCN": "1079 活字印刷",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Letter Tile Possibilities"
    },
    {
        "arg": "insufficient-nodes-in-root-to-leaf-paths",
        "titleUS": "1080 Insufficient Nodes in Root to Leaf Paths",
        "titleCN": "1080 根到叶路径上的不足节点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Insufficient Nodes in Root to Leaf Paths"
    },
    {
        "arg": "smallest-subsequence-of-distinct-characters",
        "titleUS": "1081 Smallest Subsequence of Distinct Characters",
        "titleCN": "1081 不同字符的最小子序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Smallest Subsequence of Distinct Characters"
    },
    {
        "arg": "sum-of-digits-in-the-minimum-number",
        "titleUS": "1085 Sum of Digits in the Minimum Number",
        "titleCN": "1085 最小元素各数位之和",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Sum of Digits in the Minimum Number"
    },
    {
        "arg": "high-five",
        "titleUS": "1086 High Five",
        "titleCN": "1086 前五科的均分",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 High Five"
    },
    {
        "arg": "brace-expansion",
        "titleUS": "1087 Brace Expansion",
        "titleCN": "1087 花括号展开",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Brace Expansion"
    },
    {
        "arg": "confusing-number-ii",
        "titleUS": "1088 Confusing Number II",
        "titleCN": "1088 易混淆数 II",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Confusing Number II"
    },
    {
        "arg": "duplicate-zeros",
        "titleUS": "1089 Duplicate Zeros",
        "titleCN": "1089 复写零",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Duplicate Zeros"
    },
    {
        "arg": "largest-values-from-labels",
        "titleUS": "1090 Largest Values From Labels",
        "titleCN": "1090 受标签影响的最大值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Largest Values From Labels"
    },
    {
        "arg": "shortest-path-in-binary-matrix",
        "titleUS": "1091 Shortest Path in Binary Matrix",
        "titleCN": "1091 二进制矩阵中的最短路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Shortest Path in Binary Matrix"
    },
    {
        "arg": "shortest-common-supersequence",
        "titleUS": "1092 Shortest Common Supersequence ",
        "titleCN": "1092 最短公共超序列",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Shortest Common Supersequence "
    },
    {
        "arg": "statistics-from-a-large-sample",
        "titleUS": "1093 Statistics from a Large Sample",
        "titleCN": "1093 大样本统计",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Statistics from a Large Sample"
    },
    {
        "arg": "car-pooling",
        "titleUS": "1094 Car Pooling",
        "titleCN": "1094 拼车",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Car Pooling"
    },
    {
        "arg": "find-in-mountain-array",
        "titleUS": "1095 Find in Mountain Array",
        "titleCN": "1095 山脉数组中查找目标值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find in Mountain Array"
    },
    {
        "arg": "brace-expansion-ii",
        "titleUS": "1096 Brace Expansion II",
        "titleCN": "1096 花括号展开 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Brace Expansion II"
    },
    {
        "arg": "two-sum-less-than-k",
        "titleUS": "1099 Two Sum Less Than K",
        "titleCN": "1099 小于 K 的两数之和",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Two Sum Less Than K"
    },
    {
        "arg": "find-k-length-substrings-with-no-repeated-characters",
        "titleUS": "1100 Find K-Length Substrings With No Repeated Characters",
        "titleCN": "1100 长度为 K 的无重复字符子串",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Find K-Length Substrings With No Repeated Characters"
    },
    {
        "arg": "the-earliest-moment-when-everyone-become-friends",
        "titleUS": "1101 The Earliest Moment When Everyone Become Friends",
        "titleCN": "1101 彼此熟识的最早时间",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 The Earliest Moment When Everyone Become Friends"
    },
    {
        "arg": "path-with-maximum-minimum-value",
        "titleUS": "1102 Path With Maximum Minimum Value",
        "titleCN": "1102 得分最高的路径",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Path With Maximum Minimum Value"
    },
    {
        "arg": "distribute-candies-to-people",
        "titleUS": "1103 Distribute Candies to People",
        "titleCN": "1103 分糖果 II",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Distribute Candies to People"
    },
    {
        "arg": "path-in-zigzag-labelled-binary-tree",
        "titleUS": "1104 Path In Zigzag Labelled Binary Tree",
        "titleCN": "1104 二叉树寻路",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Path In Zigzag Labelled Binary Tree"
    },
    {
        "arg": "filling-bookcase-shelves",
        "titleUS": "1105 Filling Bookcase Shelves",
        "titleCN": "1105 填充书架",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Filling Bookcase Shelves"
    },
    {
        "arg": "parsing-a-boolean-expression",
        "titleUS": "1106 Parsing A Boolean Expression",
        "titleCN": "1106 解析布尔表达式",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Parsing A Boolean Expression"
    },
    {
        "arg": "defanging-an-ip-address",
        "titleUS": "1108 Defanging an IP Address",
        "titleCN": "1108 IP 地址无效化",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Defanging an IP Address"
    },
    {
        "arg": "corporate-flight-bookings",
        "titleUS": "1109 Corporate Flight Bookings",
        "titleCN": "1109 航班预订统计",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Corporate Flight Bookings"
    },
    {
        "arg": "delete-nodes-and-return-forest",
        "titleUS": "1110 Delete Nodes And Return Forest",
        "titleCN": "1110 删点成林",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Delete Nodes And Return Forest"
    },
    {
        "arg": "maximum-nesting-depth-of-two-valid-parentheses-strings",
        "titleUS": "1111 Maximum Nesting Depth of Two Valid Parentheses Strings",
        "titleCN": "1111 有效括号的嵌套深度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Nesting Depth of Two Valid Parentheses Strings"
    },
    {
        "arg": "number-of-days-in-a-month",
        "titleUS": "1118 Number of Days in a Month",
        "titleCN": "1118 一月有多少天",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Number of Days in a Month"
    },
    {
        "arg": "remove-vowels-from-a-string",
        "titleUS": "1119 Remove Vowels from a String",
        "titleCN": "1119 删去字符串中的元音",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Remove Vowels from a String"
    },
    {
        "arg": "maximum-average-subtree",
        "titleUS": "1120 Maximum Average Subtree",
        "titleCN": "1120 子树的最大平均值",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Average Subtree"
    },
    {
        "arg": "divide-array-into-increasing-sequences",
        "titleUS": "1121 Divide Array Into Increasing Sequences",
        "titleCN": "1121 将数组分成几个递增序列",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Divide Array Into Increasing Sequences"
    },
    {
        "arg": "relative-sort-array",
        "titleUS": "1122 Relative Sort Array",
        "titleCN": "1122 数组的相对排序",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Relative Sort Array"
    },
    {
        "arg": "lowest-common-ancestor-of-deepest-leaves",
        "titleUS": "1123 Lowest Common Ancestor of Deepest Leaves",
        "titleCN": "1123 最深叶节点的最近公共祖先",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Lowest Common Ancestor of Deepest Leaves"
    },
    {
        "arg": "longest-well-performing-interval",
        "titleUS": "1124 Longest Well-Performing Interval",
        "titleCN": "1124 表现良好的最长时间段",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Well-Performing Interval"
    },
    {
        "arg": "smallest-sufficient-team",
        "titleUS": "1125 Smallest Sufficient Team",
        "titleCN": "1125 最小的必要团队",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Smallest Sufficient Team"
    },
    {
        "arg": "number-of-equivalent-domino-pairs",
        "titleUS": "1128 Number of Equivalent Domino Pairs",
        "titleCN": "1128 等价多米诺骨牌对的数量",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Equivalent Domino Pairs"
    },
    {
        "arg": "shortest-path-with-alternating-colors",
        "titleUS": "1129 Shortest Path with Alternating Colors",
        "titleCN": "1129 颜色交替的最短路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Shortest Path with Alternating Colors"
    },
    {
        "arg": "minimum-cost-tree-from-leaf-values",
        "titleUS": "1130 Minimum Cost Tree From Leaf Values",
        "titleCN": "1130 叶值的最小代价生成树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Cost Tree From Leaf Values"
    },
    {
        "arg": "maximum-of-absolute-value-expression",
        "titleUS": "1131 Maximum of Absolute Value Expression",
        "titleCN": "1131 绝对值表达式的最大值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum of Absolute Value Expression"
    },
    {
        "arg": "largest-unique-number",
        "titleUS": "1133 Largest Unique Number",
        "titleCN": "1133 最大唯一数",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Largest Unique Number"
    },
    {
        "arg": "armstrong-number",
        "titleUS": "1134 Armstrong Number",
        "titleCN": "1134 阿姆斯特朗数",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Armstrong Number"
    },
    {
        "arg": "connecting-cities-with-minimum-cost",
        "titleUS": "1135 Connecting Cities With Minimum Cost",
        "titleCN": "1135 最低成本连通所有城市",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Connecting Cities With Minimum Cost"
    },
    {
        "arg": "parallel-courses",
        "titleUS": "1136 Parallel Courses",
        "titleCN": "1136 并行课程",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Parallel Courses"
    },
    {
        "arg": "n-th-tribonacci-number",
        "titleUS": "1137 N-th Tribonacci Number",
        "titleCN": "1137 第 N 个泰波那契数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 N-th Tribonacci Number"
    },
    {
        "arg": "alphabet-board-path",
        "titleUS": "1138 Alphabet Board Path",
        "titleCN": "1138 字母板上的路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Alphabet Board Path"
    },
    {
        "arg": "largest-1-bordered-square",
        "titleUS": "1139 Largest 1-Bordered Square",
        "titleCN": "1139 最大的以 1 为边界的正方形",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Largest 1-Bordered Square"
    },
    {
        "arg": "stone-game-ii",
        "titleUS": "1140 Stone Game II",
        "titleCN": "1140 石子游戏 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Stone Game II"
    },
    {
        "arg": "longest-common-subsequence",
        "titleUS": "1143 Longest Common Subsequence",
        "titleCN": "1143 最长公共子序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Common Subsequence"
    },
    {
        "arg": "decrease-elements-to-make-array-zigzag",
        "titleUS": "1144 Decrease Elements To Make Array Zigzag",
        "titleCN": "1144 递减元素使数组呈锯齿状",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Decrease Elements To Make Array Zigzag"
    },
    {
        "arg": "binary-tree-coloring-game",
        "titleUS": "1145 Binary Tree Coloring Game",
        "titleCN": "1145 二叉树着色游戏",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Binary Tree Coloring Game"
    },
    {
        "arg": "snapshot-array",
        "titleUS": "1146 Snapshot Array",
        "titleCN": "1146 快照数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Snapshot Array"
    },
    {
        "arg": "longest-chunked-palindrome-decomposition",
        "titleUS": "1147 Longest Chunked Palindrome Decomposition",
        "titleCN": "1147 段式回文",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Longest Chunked Palindrome Decomposition"
    },
    {
        "arg": "check-if-a-number-is-majority-element-in-a-sorted-array",
        "titleUS": "1150 Check If a Number Is Majority Element in a Sorted Array",
        "titleCN": "1150 检查一个数是否在数组中占绝大多数",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Check If a Number Is Majority Element in a Sorted Array"
    },
    {
        "arg": "minimum-swaps-to-group-all-1s-together",
        "titleUS": "1151 Minimum Swaps to Group All 1's Together",
        "titleCN": "1151 最少交换次数来组合所有的 1",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimum Swaps to Group All 1's Together"
    },
    {
        "arg": "analyze-user-website-visit-pattern",
        "titleUS": "1152 Analyze User Website Visit Pattern",
        "titleCN": "1152 用户网站访问行为分析",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Analyze User Website Visit Pattern"
    },
    {
        "arg": "string-transforms-into-another-string",
        "titleUS": "1153 String Transforms Into Another String",
        "titleCN": "1153 字符串转化",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 String Transforms Into Another String"
    },
    {
        "arg": "day-of-the-year",
        "titleUS": "1154 Day of the Year",
        "titleCN": "1154 一年中的第几天",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Day of the Year"
    },
    {
        "arg": "number-of-dice-rolls-with-target-sum",
        "titleUS": "1155 Number of Dice Rolls With Target Sum",
        "titleCN": "1155 掷骰子等于目标和的方法数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Dice Rolls With Target Sum"
    },
    {
        "arg": "swap-for-longest-repeated-character-substring",
        "titleUS": "1156 Swap For Longest Repeated Character Substring",
        "titleCN": "1156 单字符重复子串的最大长度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Swap For Longest Repeated Character Substring"
    },
    {
        "arg": "online-majority-element-in-subarray",
        "titleUS": "1157 Online Majority Element In Subarray",
        "titleCN": "1157 子数组中占绝大多数的元素",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Online Majority Element In Subarray"
    },
    {
        "arg": "find-words-that-can-be-formed-by-characters",
        "titleUS": "1160 Find Words That Can Be Formed by Characters",
        "titleCN": "1160 拼写单词",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Words That Can Be Formed by Characters"
    },
    {
        "arg": "maximum-level-sum-of-a-binary-tree",
        "titleUS": "1161 Maximum Level Sum of a Binary Tree",
        "titleCN": "1161 最大层内元素和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Level Sum of a Binary Tree"
    },
    {
        "arg": "as-far-from-land-as-possible",
        "titleUS": "1162 As Far from Land as Possible",
        "titleCN": "1162 地图分析",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 As Far from Land as Possible"
    },
    {
        "arg": "last-substring-in-lexicographical-order",
        "titleUS": "1163 Last Substring in Lexicographical Order",
        "titleCN": "1163 按字典序排在最后的子串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Last Substring in Lexicographical Order"
    },
    {
        "arg": "single-row-keyboard",
        "titleUS": "1165 Single-Row Keyboard",
        "titleCN": "1165 单行键盘",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Single-Row Keyboard"
    },
    {
        "arg": "design-file-system",
        "titleUS": "1166 Design File System",
        "titleCN": "1166 设计文件系统",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Design File System"
    },
    {
        "arg": "minimum-cost-to-connect-sticks",
        "titleUS": "1167 Minimum Cost to Connect Sticks",
        "titleCN": "1167 连接木棍的最低费用",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimum Cost to Connect Sticks"
    },
    {
        "arg": "optimize-water-distribution-in-a-village",
        "titleUS": "1168 Optimize Water Distribution in a Village",
        "titleCN": "1168 水资源分配优化",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Optimize Water Distribution in a Village"
    },
    {
        "arg": "invalid-transactions",
        "titleUS": "1169 Invalid Transactions",
        "titleCN": "1169 查询无效交易",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Invalid Transactions"
    },
    {
        "arg": "compare-strings-by-frequency-of-the-smallest-character",
        "titleUS": "1170 Compare Strings by Frequency of the Smallest Character",
        "titleCN": "1170 比较字符串最小字母出现频次",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Compare Strings by Frequency of the Smallest Character"
    },
    {
        "arg": "remove-zero-sum-consecutive-nodes-from-linked-list",
        "titleUS": "1171 Remove Zero Sum Consecutive Nodes from Linked List",
        "titleCN": "1171 从链表中删去总和值为零的连续节点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Remove Zero Sum Consecutive Nodes from Linked List"
    },
    {
        "arg": "dinner-plate-stacks",
        "titleUS": "1172 Dinner Plate Stacks",
        "titleCN": "1172 餐盘栈",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Dinner Plate Stacks"
    },
    {
        "arg": "prime-arrangements",
        "titleUS": "1175 Prime Arrangements",
        "titleCN": "1175 质数排列",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Prime Arrangements"
    },
    {
        "arg": "diet-plan-performance",
        "titleUS": "1176 Diet Plan Performance",
        "titleCN": "1176 健身计划评估",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Diet Plan Performance"
    },
    {
        "arg": "can-make-palindrome-from-substring",
        "titleUS": "1177 Can Make Palindrome from Substring",
        "titleCN": "1177 构建回文串检测",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Can Make Palindrome from Substring"
    },
    {
        "arg": "number-of-valid-words-for-each-puzzle",
        "titleUS": "1178 Number of Valid Words for Each Puzzle",
        "titleCN": "1178 猜字谜",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Valid Words for Each Puzzle"
    },
    {
        "arg": "count-substrings-with-only-one-distinct-letter",
        "titleUS": "1180 Count Substrings with Only One Distinct Letter",
        "titleCN": "1180 统计只含单一字母的子串",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Count Substrings with Only One Distinct Letter"
    },
    {
        "arg": "before-and-after-puzzle",
        "titleUS": "1181 Before and After Puzzle",
        "titleCN": "1181 前后拼接",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Before and After Puzzle"
    },
    {
        "arg": "shortest-distance-to-target-color",
        "titleUS": "1182 Shortest Distance to Target Color",
        "titleCN": "1182 与目标颜色间的最短距离",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Shortest Distance to Target Color"
    },
    {
        "arg": "maximum-number-of-ones",
        "titleUS": "1183 Maximum Number of Ones",
        "titleCN": "1183 矩阵中 1 的最大数量",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Maximum Number of Ones"
    },
    {
        "arg": "distance-between-bus-stops",
        "titleUS": "1184 Distance Between Bus Stops",
        "titleCN": "1184 公交站间的距离",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Distance Between Bus Stops"
    },
    {
        "arg": "day-of-the-week",
        "titleUS": "1185 Day of the Week",
        "titleCN": "1185 一周中的第几天",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Day of the Week"
    },
    {
        "arg": "maximum-subarray-sum-with-one-deletion",
        "titleUS": "1186 Maximum Subarray Sum with One Deletion",
        "titleCN": "1186 删除一次得到子数组最大和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Subarray Sum with One Deletion"
    },
    {
        "arg": "make-array-strictly-increasing",
        "titleUS": "1187 Make Array Strictly Increasing",
        "titleCN": "1187 使数组严格递增",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Make Array Strictly Increasing"
    },
    {
        "arg": "maximum-number-of-balloons",
        "titleUS": "1189 Maximum Number of Balloons",
        "titleCN": "1189 “气球” 的最大数量",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Number of Balloons"
    },
    {
        "arg": "reverse-substrings-between-each-pair-of-parentheses",
        "titleUS": "1190 Reverse Substrings Between Each Pair of Parentheses",
        "titleCN": "1190 反转每对括号间的子串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reverse Substrings Between Each Pair of Parentheses"
    },
    {
        "arg": "k-concatenation-maximum-sum",
        "titleUS": "1191 K-Concatenation Maximum Sum",
        "titleCN": "1191 K 次串联后最大子数组之和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 K-Concatenation Maximum Sum"
    },
    {
        "arg": "critical-connections-in-a-network",
        "titleUS": "1192 Critical Connections in a Network",
        "titleCN": "1192 查找集群内的关键连接",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Critical Connections in a Network"
    },
    {
        "arg": "how-many-apples-can-you-put-into-the-basket",
        "titleUS": "1196 How Many Apples Can You Put into the Basket",
        "titleCN": "1196 最多可以买到的苹果数量",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 How Many Apples Can You Put into the Basket"
    },
    {
        "arg": "minimum-knight-moves",
        "titleUS": "1197 Minimum Knight Moves",
        "titleCN": "1197 进击的骑士",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimum Knight Moves"
    },
    {
        "arg": "find-smallest-common-element-in-all-rows",
        "titleUS": "1198 Find Smallest Common Element in All Rows",
        "titleCN": "1198 找出所有行中最小公共元素",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Find Smallest Common Element in All Rows"
    },
    {
        "arg": "minimum-time-to-build-blocks",
        "titleUS": "1199 Minimum Time to Build Blocks",
        "titleCN": "1199 建造街区的最短时间",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Minimum Time to Build Blocks"
    },
    {
        "arg": "minimum-absolute-difference",
        "titleUS": "1200 Minimum Absolute Difference",
        "titleCN": "1200 最小绝对差",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Absolute Difference"
    },
    {
        "arg": "ugly-number-iii",
        "titleUS": "1201 Ugly Number III",
        "titleCN": "1201 丑数 III",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Ugly Number III"
    },
    {
        "arg": "smallest-string-with-swaps",
        "titleUS": "1202 Smallest String With Swaps",
        "titleCN": "1202 交换字符串中的元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Smallest String With Swaps"
    },
    {
        "arg": "sort-items-by-groups-respecting-dependencies",
        "titleUS": "1203 Sort Items by Groups Respecting Dependencies",
        "titleCN": "1203 项目管理",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Sort Items by Groups Respecting Dependencies"
    },
    {
        "arg": "design-skiplist",
        "titleUS": "1206 Design Skiplist",
        "titleCN": "1206 设计跳表",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Design Skiplist"
    },
    {
        "arg": "unique-number-of-occurrences",
        "titleUS": "1207 Unique Number of Occurrences",
        "titleCN": "1207 独一无二的出现次数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Unique Number of Occurrences"
    },
    {
        "arg": "get-equal-substrings-within-budget",
        "titleUS": "1208 Get Equal Substrings Within Budget",
        "titleCN": "1208 尽可能使字符串相等",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Get Equal Substrings Within Budget"
    },
    {
        "arg": "remove-all-adjacent-duplicates-in-string-ii",
        "titleUS": "1209 Remove All Adjacent Duplicates in String II",
        "titleCN": "1209 删除字符串中的所有相邻重复项 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Remove All Adjacent Duplicates in String II"
    },
    {
        "arg": "minimum-moves-to-reach-target-with-rotations",
        "titleUS": "1210 Minimum Moves to Reach Target with Rotations",
        "titleCN": "1210 穿过迷宫的最少移动次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Moves to Reach Target with Rotations"
    },
    {
        "arg": "intersection-of-three-sorted-arrays",
        "titleUS": "1213 Intersection of Three Sorted Arrays",
        "titleCN": "1213 三个有序数组的交集",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Intersection of Three Sorted Arrays"
    },
    {
        "arg": "two-sum-bsts",
        "titleUS": "1214 Two Sum BSTs",
        "titleCN": "1214 查找两棵二叉搜索树之和",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Two Sum BSTs"
    },
    {
        "arg": "stepping-numbers",
        "titleUS": "1215 Stepping Numbers",
        "titleCN": "1215 步进数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Stepping Numbers"
    },
    {
        "arg": "valid-palindrome-iii",
        "titleUS": "1216 Valid Palindrome III",
        "titleCN": "1216 验证回文串 III",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Valid Palindrome III"
    },
    {
        "arg": "minimum-cost-to-move-chips-to-the-same-position",
        "titleUS": "1217 Minimum Cost to Move Chips to The Same Position",
        "titleCN": "1217 玩筹码",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Cost to Move Chips to The Same Position"
    },
    {
        "arg": "longest-arithmetic-subsequence-of-given-difference",
        "titleUS": "1218 Longest Arithmetic Subsequence of Given Difference",
        "titleCN": "1218 最长定差子序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Arithmetic Subsequence of Given Difference"
    },
    {
        "arg": "path-with-maximum-gold",
        "titleUS": "1219 Path with Maximum Gold",
        "titleCN": "1219 黄金矿工",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Path with Maximum Gold"
    },
    {
        "arg": "count-vowels-permutation",
        "titleUS": "1220 Count Vowels Permutation",
        "titleCN": "1220 统计元音字母序列的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Vowels Permutation"
    },
    {
        "arg": "split-a-string-in-balanced-strings",
        "titleUS": "1221 Split a String in Balanced Strings",
        "titleCN": "1221 分割平衡字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Split a String in Balanced Strings"
    },
    {
        "arg": "queens-that-can-attack-the-king",
        "titleUS": "1222 Queens That Can Attack the King",
        "titleCN": "1222 可以攻击国王的皇后",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Queens That Can Attack the King"
    },
    {
        "arg": "dice-roll-simulation",
        "titleUS": "1223 Dice Roll Simulation",
        "titleCN": "1223 掷骰子模拟",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Dice Roll Simulation"
    },
    {
        "arg": "maximum-equal-frequency",
        "titleUS": "1224 Maximum Equal Frequency",
        "titleCN": "1224 最大相等频率",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Equal Frequency"
    },
    {
        "arg": "airplane-seat-assignment-probability",
        "titleUS": "1227 Airplane Seat Assignment Probability",
        "titleCN": "1227 飞机座位分配概率",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Airplane Seat Assignment Probability"
    },
    {
        "arg": "missing-number-in-arithmetic-progression",
        "titleUS": "1228 Missing Number In Arithmetic Progression",
        "titleCN": "1228 等差数列中缺失的数字",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Missing Number In Arithmetic Progression"
    },
    {
        "arg": "meeting-scheduler",
        "titleUS": "1229 Meeting Scheduler",
        "titleCN": "1229 安排会议日程",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Meeting Scheduler"
    },
    {
        "arg": "toss-strange-coins",
        "titleUS": "1230 Toss Strange Coins",
        "titleCN": "1230 抛掷硬币",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Toss Strange Coins"
    },
    {
        "arg": "divide-chocolate",
        "titleUS": "1231 Divide Chocolate",
        "titleCN": "1231 分享巧克力",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Divide Chocolate"
    },
    {
        "arg": "check-if-it-is-a-straight-line",
        "titleUS": "1232 Check If It Is a Straight Line",
        "titleCN": "1232 缀点成线",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check If It Is a Straight Line"
    },
    {
        "arg": "remove-sub-folders-from-the-filesystem",
        "titleUS": "1233 Remove Sub-Folders from the Filesystem",
        "titleCN": "1233 删除子文件夹",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Remove Sub-Folders from the Filesystem"
    },
    {
        "arg": "replace-the-substring-for-balanced-string",
        "titleUS": "1234 Replace the Substring for Balanced String",
        "titleCN": "1234 替换子串得到平衡字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Replace the Substring for Balanced String"
    },
    {
        "arg": "maximum-profit-in-job-scheduling",
        "titleUS": "1235 Maximum Profit in Job Scheduling",
        "titleCN": "1235 规划兼职工作",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Profit in Job Scheduling"
    },
    {
        "arg": "web-crawler",
        "titleUS": "1236 Web Crawler",
        "titleCN": "1236 网络爬虫",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Web Crawler"
    },
    {
        "arg": "find-positive-integer-solution-for-a-given-equation",
        "titleUS": "1237 Find Positive Integer Solution for a Given Equation",
        "titleCN": "1237 找出给定方程的正整数解",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Positive Integer Solution for a Given Equation"
    },
    {
        "arg": "circular-permutation-in-binary-representation",
        "titleUS": "1238 Circular Permutation in Binary Representation",
        "titleCN": "1238 循环码排列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Circular Permutation in Binary Representation"
    },
    {
        "arg": "maximum-length-of-a-concatenated-string-with-unique-characters",
        "titleUS": "1239 Maximum Length of a Concatenated String with Unique Characters",
        "titleCN": "1239 串联字符串的最大长度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Length of a Concatenated String with Unique Characters"
    },
    {
        "arg": "tiling-a-rectangle-with-the-fewest-squares",
        "titleUS": "1240 Tiling a Rectangle with the Fewest Squares",
        "titleCN": "1240 铺瓷砖",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Tiling a Rectangle with the Fewest Squares"
    },
    {
        "arg": "array-transformation",
        "titleUS": "1243 Array Transformation",
        "titleCN": "1243 数组变换",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Array Transformation"
    },
    {
        "arg": "design-a-leaderboard",
        "titleUS": "1244 Design A Leaderboard",
        "titleCN": "1244 力扣排行榜",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Design A Leaderboard"
    },
    {
        "arg": "tree-diameter",
        "titleUS": "1245 Tree Diameter",
        "titleCN": "1245 树的直径",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Tree Diameter"
    },
    {
        "arg": "palindrome-removal",
        "titleUS": "1246 Palindrome Removal",
        "titleCN": "1246 删除回文子数组",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Palindrome Removal"
    },
    {
        "arg": "minimum-swaps-to-make-strings-equal",
        "titleUS": "1247 Minimum Swaps to Make Strings Equal",
        "titleCN": "1247 交换字符使得字符串相同",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Swaps to Make Strings Equal"
    },
    {
        "arg": "count-number-of-nice-subarrays",
        "titleUS": "1248 Count Number of Nice Subarrays",
        "titleCN": "1248 统计「优美子数组」",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Number of Nice Subarrays"
    },
    {
        "arg": "minimum-remove-to-make-valid-parentheses",
        "titleUS": "1249 Minimum Remove to Make Valid Parentheses",
        "titleCN": "1249 移除无效的括号",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Remove to Make Valid Parentheses"
    },
    {
        "arg": "check-if-it-is-a-good-array",
        "titleUS": "1250 Check If It Is a Good Array",
        "titleCN": "1250 检查「好数组」",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Check If It Is a Good Array"
    },
    {
        "arg": "cells-with-odd-values-in-a-matrix",
        "titleUS": "1252 Cells with Odd Values in a Matrix",
        "titleCN": "1252 奇数值单元格的数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Cells with Odd Values in a Matrix"
    },
    {
        "arg": "reconstruct-a-2-row-binary-matrix",
        "titleUS": "1253 Reconstruct a 2-Row Binary Matrix",
        "titleCN": "1253 重构 2 行二进制矩阵",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reconstruct a 2-Row Binary Matrix"
    },
    {
        "arg": "number-of-closed-islands",
        "titleUS": "1254 Number of Closed Islands",
        "titleCN": "1254 统计封闭岛屿的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Closed Islands"
    },
    {
        "arg": "maximum-score-words-formed-by-letters",
        "titleUS": "1255 Maximum Score Words Formed by Letters",
        "titleCN": "1255 得分最高的单词集合",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Score Words Formed by Letters"
    },
    {
        "arg": "encode-number",
        "titleUS": "1256 Encode Number",
        "titleCN": "1256 加密数字",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Encode Number"
    },
    {
        "arg": "smallest-common-region",
        "titleUS": "1257 Smallest Common Region",
        "titleCN": "1257 最小公共区域",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Smallest Common Region"
    },
    {
        "arg": "synonymous-sentences",
        "titleUS": "1258 Synonymous Sentences",
        "titleCN": "1258 近义词句子",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Synonymous Sentences"
    },
    {
        "arg": "handshakes-that-dont-cross",
        "titleUS": "1259 Handshakes That Don't Cross",
        "titleCN": "1259 不相交的握手",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Handshakes That Don't Cross"
    },
    {
        "arg": "shift-2d-grid",
        "titleUS": "1260 Shift 2D Grid",
        "titleCN": "1260 二维网格迁移",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Shift 2D Grid"
    },
    {
        "arg": "find-elements-in-a-contaminated-binary-tree",
        "titleUS": "1261 Find Elements in a Contaminated Binary Tree",
        "titleCN": "1261 在受污染的二叉树中查找元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Elements in a Contaminated Binary Tree"
    },
    {
        "arg": "greatest-sum-divisible-by-three",
        "titleUS": "1262 Greatest Sum Divisible by Three",
        "titleCN": "1262 可被三整除的最大和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Greatest Sum Divisible by Three"
    },
    {
        "arg": "minimum-moves-to-move-a-box-to-their-target-location",
        "titleUS": "1263 Minimum Moves to Move a Box to Their Target Location",
        "titleCN": "1263 推箱子",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Moves to Move a Box to Their Target Location"
    },
    {
        "arg": "print-immutable-linked-list-in-reverse",
        "titleUS": "1265 Print Immutable Linked List in Reverse",
        "titleCN": "1265 逆序打印不可变链表",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Print Immutable Linked List in Reverse"
    },
    {
        "arg": "minimum-time-visiting-all-points",
        "titleUS": "1266 Minimum Time Visiting All Points",
        "titleCN": "1266 访问所有点的最小时间",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Time Visiting All Points"
    },
    {
        "arg": "count-servers-that-communicate",
        "titleUS": "1267 Count Servers that Communicate",
        "titleCN": "1267 统计参与通信的服务器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Servers that Communicate"
    },
    {
        "arg": "search-suggestions-system",
        "titleUS": "1268 Search Suggestions System",
        "titleCN": "1268 搜索推荐系统",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Search Suggestions System"
    },
    {
        "arg": "number-of-ways-to-stay-in-the-same-place-after-some-steps",
        "titleUS": "1269 Number of Ways to Stay in the Same Place After Some Steps",
        "titleCN": "1269 停在原地的方案数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Ways to Stay in the Same Place After Some Steps"
    },
    {
        "arg": "hexspeak",
        "titleUS": "1271 Hexspeak",
        "titleCN": "1271 十六进制魔术数字",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Hexspeak"
    },
    {
        "arg": "remove-interval",
        "titleUS": "1272 Remove Interval",
        "titleCN": "1272 删除区间",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Remove Interval"
    },
    {
        "arg": "delete-tree-nodes",
        "titleUS": "1273 Delete Tree Nodes",
        "titleCN": "1273 删除树节点",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Delete Tree Nodes"
    },
    {
        "arg": "number-of-ships-in-a-rectangle",
        "titleUS": "1274 Number of Ships in a Rectangle",
        "titleCN": "1274 矩形内船只的数目",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Number of Ships in a Rectangle"
    },
    {
        "arg": "find-winner-on-a-tic-tac-toe-game",
        "titleUS": "1275 Find Winner on a Tic Tac Toe Game",
        "titleCN": "1275 找出井字棋的获胜者",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Winner on a Tic Tac Toe Game"
    },
    {
        "arg": "number-of-burgers-with-no-waste-of-ingredients",
        "titleUS": "1276 Number of Burgers with No Waste of Ingredients",
        "titleCN": "1276 不浪费原料的汉堡制作方案",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Burgers with No Waste of Ingredients"
    },
    {
        "arg": "count-square-submatrices-with-all-ones",
        "titleUS": "1277 Count Square Submatrices with All Ones",
        "titleCN": "1277 统计全为 1 的正方形子矩阵",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Square Submatrices with All Ones"
    },
    {
        "arg": "palindrome-partitioning-iii",
        "titleUS": "1278 Palindrome Partitioning III",
        "titleCN": "1278 分割回文串 III",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Palindrome Partitioning III"
    },
    {
        "arg": "subtract-the-product-and-sum-of-digits-of-an-integer",
        "titleUS": "1281 Subtract the Product and Sum of Digits of an Integer",
        "titleCN": "1281 整数的各位积和之差",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Subtract the Product and Sum of Digits of an Integer"
    },
    {
        "arg": "group-the-people-given-the-group-size-they-belong-to",
        "titleUS": "1282 Group the People Given the Group Size They Belong To",
        "titleCN": "1282 用户分组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Group the People Given the Group Size They Belong To"
    },
    {
        "arg": "find-the-smallest-divisor-given-a-threshold",
        "titleUS": "1283 Find the Smallest Divisor Given a Threshold",
        "titleCN": "1283 使结果不超过阈值的最小除数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Smallest Divisor Given a Threshold"
    },
    {
        "arg": "minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix",
        "titleUS": "1284 Minimum Number of Flips to Convert Binary Matrix to Zero Matrix",
        "titleCN": "1284 转化为全零矩阵的最少反转次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Number of Flips to Convert Binary Matrix to Zero Matrix"
    },
    {
        "arg": "iterator-for-combination",
        "titleUS": "1286 Iterator for Combination",
        "titleCN": "1286 字母组合迭代器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Iterator for Combination"
    },
    {
        "arg": "element-appearing-more-than-25-in-sorted-array",
        "titleUS": "1287 Element Appearing More Than 25% In Sorted Array",
        "titleCN": "1287 有序数组中出现次数超过25%的元素",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Element Appearing More Than 25% In Sorted Array"
    },
    {
        "arg": "remove-covered-intervals",
        "titleUS": "1288 Remove Covered Intervals",
        "titleCN": "1288 删除被覆盖区间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Remove Covered Intervals"
    },
    {
        "arg": "minimum-falling-path-sum-ii",
        "titleUS": "1289 Minimum Falling Path Sum II",
        "titleCN": "1289 下降路径最小和  II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Falling Path Sum II"
    },
    {
        "arg": "convert-binary-number-in-a-linked-list-to-integer",
        "titleUS": "1290 Convert Binary Number in a Linked List to Integer",
        "titleCN": "1290 二进制链表转整数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Convert Binary Number in a Linked List to Integer"
    },
    {
        "arg": "sequential-digits",
        "titleUS": "1291 Sequential Digits",
        "titleCN": "1291 顺次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sequential Digits"
    },
    {
        "arg": "maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold",
        "titleUS": "1292 Maximum Side Length of a Square with Sum Less than or Equal to Threshold",
        "titleCN": "1292 元素和小于等于阈值的正方形的最大边长",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Side Length of a Square with Sum Less than or Equal to Threshold"
    },
    {
        "arg": "shortest-path-in-a-grid-with-obstacles-elimination",
        "titleUS": "1293 Shortest Path in a Grid with Obstacles Elimination",
        "titleCN": "1293 网格中的最短路径",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Shortest Path in a Grid with Obstacles Elimination"
    },
    {
        "arg": "find-numbers-with-even-number-of-digits",
        "titleUS": "1295 Find Numbers with Even Number of Digits",
        "titleCN": "1295 统计位数为偶数的数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Numbers with Even Number of Digits"
    },
    {
        "arg": "divide-array-in-sets-of-k-consecutive-numbers",
        "titleUS": "1296 Divide Array in Sets of K Consecutive Numbers",
        "titleCN": "1296 划分数组为连续数字的集合",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Divide Array in Sets of K Consecutive Numbers"
    },
    {
        "arg": "maximum-number-of-occurrences-of-a-substring",
        "titleUS": "1297 Maximum Number of Occurrences of a Substring",
        "titleCN": "1297 子串的最大出现次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Occurrences of a Substring"
    },
    {
        "arg": "maximum-candies-you-can-get-from-boxes",
        "titleUS": "1298 Maximum Candies You Can Get from Boxes",
        "titleCN": "1298 你能从盒子里获得的最大糖果数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Candies You Can Get from Boxes"
    },
    {
        "arg": "replace-elements-with-greatest-element-on-right-side",
        "titleUS": "1299 Replace Elements with Greatest Element on Right Side",
        "titleCN": "1299 将每个元素替换为右侧最大元素",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Replace Elements with Greatest Element on Right Side"
    },
    {
        "arg": "sum-of-mutated-array-closest-to-target",
        "titleUS": "1300 Sum of Mutated Array Closest to Target",
        "titleCN": "1300 转变数组后最接近目标值的数组和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum of Mutated Array Closest to Target"
    },
    {
        "arg": "number-of-paths-with-max-score",
        "titleUS": "1301 Number of Paths with Max Score",
        "titleCN": "1301 最大得分的路径数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Paths with Max Score"
    },
    {
        "arg": "deepest-leaves-sum",
        "titleUS": "1302 Deepest Leaves Sum",
        "titleCN": "1302 层数最深叶子节点的和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Deepest Leaves Sum"
    },
    {
        "arg": "find-n-unique-integers-sum-up-to-zero",
        "titleUS": "1304 Find N Unique Integers Sum up to Zero",
        "titleCN": "1304 和为零的 N 个不同整数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find N Unique Integers Sum up to Zero"
    },
    {
        "arg": "all-elements-in-two-binary-search-trees",
        "titleUS": "1305 All Elements in Two Binary Search Trees",
        "titleCN": "1305 两棵二叉搜索树中的所有元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 All Elements in Two Binary Search Trees"
    },
    {
        "arg": "jump-game-iii",
        "titleUS": "1306 Jump Game III",
        "titleCN": "1306 跳跃游戏 III",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Jump Game III"
    },
    {
        "arg": "verbal-arithmetic-puzzle",
        "titleUS": "1307 Verbal Arithmetic Puzzle",
        "titleCN": "1307 口算难题",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Verbal Arithmetic Puzzle"
    },
    {
        "arg": "decrypt-string-from-alphabet-to-integer-mapping",
        "titleUS": "1309 Decrypt String from Alphabet to Integer Mapping",
        "titleCN": "1309 解码字母到整数映射",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Decrypt String from Alphabet to Integer Mapping"
    },
    {
        "arg": "xor-queries-of-a-subarray",
        "titleUS": "1310 XOR Queries of a Subarray",
        "titleCN": "1310 子数组异或查询",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 XOR Queries of a Subarray"
    },
    {
        "arg": "get-watched-videos-by-your-friends",
        "titleUS": "1311 Get Watched Videos by Your Friends",
        "titleCN": "1311 获取你好友已观看的视频",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Get Watched Videos by Your Friends"
    },
    {
        "arg": "minimum-insertion-steps-to-make-a-string-palindrome",
        "titleUS": "1312 Minimum Insertion Steps to Make a String Palindrome",
        "titleCN": "1312 让字符串成为回文串的最少插入次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Insertion Steps to Make a String Palindrome"
    },
    {
        "arg": "decompress-run-length-encoded-list",
        "titleUS": "1313 Decompress Run-Length Encoded List",
        "titleCN": "1313 解压缩编码列表",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Decompress Run-Length Encoded List"
    },
    {
        "arg": "matrix-block-sum",
        "titleUS": "1314 Matrix Block Sum",
        "titleCN": "1314 矩阵区域和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Matrix Block Sum"
    },
    {
        "arg": "sum-of-nodes-with-even-valued-grandparent",
        "titleUS": "1315 Sum of Nodes with Even-Valued Grandparent",
        "titleCN": "1315 祖父节点值为偶数的节点和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum of Nodes with Even-Valued Grandparent"
    },
    {
        "arg": "distinct-echo-substrings",
        "titleUS": "1316 Distinct Echo Substrings",
        "titleCN": "1316 不同的循环子字符串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Distinct Echo Substrings"
    },
    {
        "arg": "convert-integer-to-the-sum-of-two-no-zero-integers",
        "titleUS": "1317 Convert Integer to the Sum of Two No-Zero Integers",
        "titleCN": "1317 将整数转换为两个无零整数的和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Convert Integer to the Sum of Two No-Zero Integers"
    },
    {
        "arg": "minimum-flips-to-make-a-or-b-equal-to-c",
        "titleUS": "1318 Minimum Flips to Make a OR b Equal to c",
        "titleCN": "1318 或运算的最小翻转次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Flips to Make a OR b Equal to c"
    },
    {
        "arg": "number-of-operations-to-make-network-connected",
        "titleUS": "1319 Number of Operations to Make Network Connected",
        "titleCN": "1319 连通网络的操作次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Operations to Make Network Connected"
    },
    {
        "arg": "minimum-distance-to-type-a-word-using-two-fingers",
        "titleUS": "1320 Minimum Distance to Type a Word Using Two Fingers",
        "titleCN": "1320 二指输入的的最小距离",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Distance to Type a Word Using Two Fingers"
    },
    {
        "arg": "maximum-69-number",
        "titleUS": "1323 Maximum 69 Number",
        "titleCN": "1323 6 和 9 组成的最大数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum 69 Number"
    },
    {
        "arg": "print-words-vertically",
        "titleUS": "1324 Print Words Vertically",
        "titleCN": "1324 竖直打印单词",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Print Words Vertically"
    },
    {
        "arg": "delete-leaves-with-a-given-value",
        "titleUS": "1325 Delete Leaves With a Given Value",
        "titleCN": "1325 删除给定值的叶子节点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Delete Leaves With a Given Value"
    },
    {
        "arg": "minimum-number-of-taps-to-open-to-water-a-garden",
        "titleUS": "1326 Minimum Number of Taps to Open to Water a Garden",
        "titleCN": "1326 灌溉花园的最少水龙头数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Number of Taps to Open to Water a Garden"
    },
    {
        "arg": "break-a-palindrome",
        "titleUS": "1328 Break a Palindrome",
        "titleCN": "1328 破坏回文串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Break a Palindrome"
    },
    {
        "arg": "sort-the-matrix-diagonally",
        "titleUS": "1329 Sort the Matrix Diagonally",
        "titleCN": "1329 将矩阵按对角线排序",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sort the Matrix Diagonally"
    },
    {
        "arg": "reverse-subarray-to-maximize-array-value",
        "titleUS": "1330 Reverse Subarray To Maximize Array Value",
        "titleCN": "1330 翻转子数组得到最大的数组值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Reverse Subarray To Maximize Array Value"
    },
    {
        "arg": "rank-transform-of-an-array",
        "titleUS": "1331 Rank Transform of an Array",
        "titleCN": "1331 数组序号转换",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Rank Transform of an Array"
    },
    {
        "arg": "remove-palindromic-subsequences",
        "titleUS": "1332 Remove Palindromic Subsequences",
        "titleCN": "1332 删除回文子序列",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Remove Palindromic Subsequences"
    },
    {
        "arg": "filter-restaurants-by-vegan-friendly-price-and-distance",
        "titleUS": "1333 Filter Restaurants by Vegan-Friendly, Price and Distance",
        "titleCN": "1333 餐厅过滤器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Filter Restaurants by Vegan-Friendly, Price and Distance"
    },
    {
        "arg": "find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance",
        "titleUS": "1334 Find the City With the Smallest Number of Neighbors at a Threshold Distance",
        "titleCN": "1334 阈值距离内邻居最少的城市",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the City With the Smallest Number of Neighbors at a Threshold Distance"
    },
    {
        "arg": "minimum-difficulty-of-a-job-schedule",
        "titleUS": "1335 Minimum Difficulty of a Job Schedule",
        "titleCN": "1335 工作计划的最低难度",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Difficulty of a Job Schedule"
    },
    {
        "arg": "the-k-weakest-rows-in-a-matrix",
        "titleUS": "1337 The K Weakest Rows in a Matrix",
        "titleCN": "1337 矩阵中战斗力最弱的 K 行",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 The K Weakest Rows in a Matrix"
    },
    {
        "arg": "reduce-array-size-to-the-half",
        "titleUS": "1338 Reduce Array Size to The Half",
        "titleCN": "1338 数组大小减半",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reduce Array Size to The Half"
    },
    {
        "arg": "maximum-product-of-splitted-binary-tree",
        "titleUS": "1339 Maximum Product of Splitted Binary Tree",
        "titleCN": "1339 分裂二叉树的最大乘积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Product of Splitted Binary Tree"
    },
    {
        "arg": "jump-game-v",
        "titleUS": "1340 Jump Game V",
        "titleCN": "1340 跳跃游戏 V",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Jump Game V"
    },
    {
        "arg": "number-of-steps-to-reduce-a-number-to-zero",
        "titleUS": "1342 Number of Steps to Reduce a Number to Zero",
        "titleCN": "1342 将数字变成 0 的操作次数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Steps to Reduce a Number to Zero"
    },
    {
        "arg": "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold",
        "titleUS": "1343 Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold",
        "titleCN": "1343 大小为 K 且平均值大于等于阈值的子数组数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold"
    },
    {
        "arg": "angle-between-hands-of-a-clock",
        "titleUS": "1344 Angle Between Hands of a Clock",
        "titleCN": "1344 时钟指针的夹角",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Angle Between Hands of a Clock"
    },
    {
        "arg": "jump-game-iv",
        "titleUS": "1345 Jump Game IV",
        "titleCN": "1345 跳跃游戏 IV",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Jump Game IV"
    },
    {
        "arg": "check-if-n-and-its-double-exist",
        "titleUS": "1346 Check If N and Its Double Exist",
        "titleCN": "1346 检查整数及其两倍数是否存在",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check If N and Its Double Exist"
    },
    {
        "arg": "minimum-number-of-steps-to-make-two-strings-anagram",
        "titleUS": "1347 Minimum Number of Steps to Make Two Strings Anagram",
        "titleCN": "1347 制造字母异位词的最小步骤数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Steps to Make Two Strings Anagram"
    },
    {
        "arg": "tweet-counts-per-frequency",
        "titleUS": "1348 Tweet Counts Per Frequency",
        "titleCN": "1348 推文计数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Tweet Counts Per Frequency"
    },
    {
        "arg": "maximum-students-taking-exam",
        "titleUS": "1349 Maximum Students Taking Exam",
        "titleCN": "1349 参加考试的最大学生数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Students Taking Exam"
    },
    {
        "arg": "count-negative-numbers-in-a-sorted-matrix",
        "titleUS": "1351 Count Negative Numbers in a Sorted Matrix",
        "titleCN": "1351 统计有序矩阵中的负数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Negative Numbers in a Sorted Matrix"
    },
    {
        "arg": "product-of-the-last-k-numbers",
        "titleUS": "1352 Product of the Last K Numbers",
        "titleCN": "1352 最后 K 个数的乘积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Product of the Last K Numbers"
    },
    {
        "arg": "maximum-number-of-events-that-can-be-attended",
        "titleUS": "1353 Maximum Number of Events That Can Be Attended",
        "titleCN": "1353 最多可以参加的会议数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Events That Can Be Attended"
    },
    {
        "arg": "construct-target-array-with-multiple-sums",
        "titleUS": "1354 Construct Target Array With Multiple Sums",
        "titleCN": "1354 多次求和构造目标数组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Construct Target Array With Multiple Sums"
    },
    {
        "arg": "sort-integers-by-the-number-of-1-bits",
        "titleUS": "1356 Sort Integers by The Number of 1 Bits",
        "titleCN": "1356 根据数字二进制下 1 的数目排序",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sort Integers by The Number of 1 Bits"
    },
    {
        "arg": "apply-discount-every-n-orders",
        "titleUS": "1357 Apply Discount Every n Orders",
        "titleCN": "1357 每隔 n 个顾客打折",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Apply Discount Every n Orders"
    },
    {
        "arg": "number-of-substrings-containing-all-three-characters",
        "titleUS": "1358 Number of Substrings Containing All Three Characters",
        "titleCN": "1358 包含所有三种字符的子字符串数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Substrings Containing All Three Characters"
    },
    {
        "arg": "count-all-valid-pickup-and-delivery-options",
        "titleUS": "1359 Count All Valid Pickup and Delivery Options",
        "titleCN": "1359 有效的快递序列数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count All Valid Pickup and Delivery Options"
    },
    {
        "arg": "number-of-days-between-two-dates",
        "titleUS": "1360 Number of Days Between Two Dates",
        "titleCN": "1360 日期之间隔几天",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Days Between Two Dates"
    },
    {
        "arg": "validate-binary-tree-nodes",
        "titleUS": "1361 Validate Binary Tree Nodes",
        "titleCN": "1361 验证二叉树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Validate Binary Tree Nodes"
    },
    {
        "arg": "closest-divisors",
        "titleUS": "1362 Closest Divisors",
        "titleCN": "1362 最接近的因数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Closest Divisors"
    },
    {
        "arg": "largest-multiple-of-three",
        "titleUS": "1363 Largest Multiple of Three",
        "titleCN": "1363 形成三的最大倍数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Largest Multiple of Three"
    },
    {
        "arg": "how-many-numbers-are-smaller-than-the-current-number",
        "titleUS": "1365 How Many Numbers Are Smaller Than the Current Number",
        "titleCN": "1365 有多少小于当前数字的数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 How Many Numbers Are Smaller Than the Current Number"
    },
    {
        "arg": "rank-teams-by-votes",
        "titleUS": "1366 Rank Teams by Votes",
        "titleCN": "1366 通过投票对团队排名",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Rank Teams by Votes"
    },
    {
        "arg": "linked-list-in-binary-tree",
        "titleUS": "1367 Linked List in Binary Tree",
        "titleCN": "1367 二叉树中的链表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Linked List in Binary Tree"
    },
    {
        "arg": "minimum-cost-to-make-at-least-one-valid-path-in-a-grid",
        "titleUS": "1368 Minimum Cost to Make at Least One Valid Path in a Grid",
        "titleCN": "1368 使网格图至少有一条有效路径的最小代价",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Cost to Make at Least One Valid Path in a Grid"
    },
    {
        "arg": "increasing-decreasing-string",
        "titleUS": "1370 Increasing Decreasing String",
        "titleCN": "1370 上升下降字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Increasing Decreasing String"
    },
    {
        "arg": "find-the-longest-substring-containing-vowels-in-even-counts",
        "titleUS": "1371 Find the Longest Substring Containing Vowels in Even Counts",
        "titleCN": "1371 每个元音包含偶数次的最长子字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Longest Substring Containing Vowels in Even Counts"
    },
    {
        "arg": "longest-zigzag-path-in-a-binary-tree",
        "titleUS": "1372 Longest ZigZag Path in a Binary Tree",
        "titleCN": "1372 二叉树中的最长交错路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest ZigZag Path in a Binary Tree"
    },
    {
        "arg": "maximum-sum-bst-in-binary-tree",
        "titleUS": "1373 Maximum Sum BST in Binary Tree",
        "titleCN": "1373 二叉搜索子树的最大键值和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Sum BST in Binary Tree"
    },
    {
        "arg": "generate-a-string-with-characters-that-have-odd-counts",
        "titleUS": "1374 Generate a String With Characters That Have Odd Counts",
        "titleCN": "1374 生成每种字符都是奇数个的字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Generate a String With Characters That Have Odd Counts"
    },
    {
        "arg": "number-of-times-binary-string-is-prefix-aligned",
        "titleUS": "1375 Number of Times Binary String Is Prefix-Aligned",
        "titleCN": "1375 二进制字符串前缀一致的次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Times Binary String Is Prefix-Aligned"
    },
    {
        "arg": "time-needed-to-inform-all-employees",
        "titleUS": "1376 Time Needed to Inform All Employees",
        "titleCN": "1376 通知所有员工所需的时间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Time Needed to Inform All Employees"
    },
    {
        "arg": "frog-position-after-t-seconds",
        "titleUS": "1377 Frog Position After T Seconds",
        "titleCN": "1377 T 秒后青蛙的位置",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Frog Position After T Seconds"
    },
    {
        "arg": "find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree",
        "titleUS": "1379 Find a Corresponding Node of a Binary Tree in a Clone of That Tree",
        "titleCN": "1379 找出克隆二叉树中的相同节点",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find a Corresponding Node of a Binary Tree in a Clone of That Tree"
    },
    {
        "arg": "lucky-numbers-in-a-matrix",
        "titleUS": "1380 Lucky Numbers in a Matrix",
        "titleCN": "1380 矩阵中的幸运数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Lucky Numbers in a Matrix"
    },
    {
        "arg": "design-a-stack-with-increment-operation",
        "titleUS": "1381 Design a Stack With Increment Operation",
        "titleCN": "1381 设计一个支持增量操作的栈",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Design a Stack With Increment Operation"
    },
    {
        "arg": "balance-a-binary-search-tree",
        "titleUS": "1382 Balance a Binary Search Tree",
        "titleCN": "1382 将二叉搜索树变平衡",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Balance a Binary Search Tree"
    },
    {
        "arg": "maximum-performance-of-a-team",
        "titleUS": "1383 Maximum Performance of a Team",
        "titleCN": "1383 最大的团队表现值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Performance of a Team"
    },
    {
        "arg": "find-the-distance-value-between-two-arrays",
        "titleUS": "1385 Find the Distance Value Between Two Arrays",
        "titleCN": "1385 两个数组间的距离值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Distance Value Between Two Arrays"
    },
    {
        "arg": "cinema-seat-allocation",
        "titleUS": "1386 Cinema Seat Allocation",
        "titleCN": "1386 安排电影院座位",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Cinema Seat Allocation"
    },
    {
        "arg": "sort-integers-by-the-power-value",
        "titleUS": "1387 Sort Integers by The Power Value",
        "titleCN": "1387 将整数按权重排序",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sort Integers by The Power Value"
    },
    {
        "arg": "pizza-with-3n-slices",
        "titleUS": "1388 Pizza With 3n Slices",
        "titleCN": "1388 3n 块披萨",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Pizza With 3n Slices"
    },
    {
        "arg": "create-target-array-in-the-given-order",
        "titleUS": "1389 Create Target Array in the Given Order",
        "titleCN": "1389 按既定顺序创建目标数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Create Target Array in the Given Order"
    },
    {
        "arg": "four-divisors",
        "titleUS": "1390 Four Divisors",
        "titleCN": "1390 四因数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Four Divisors"
    },
    {
        "arg": "check-if-there-is-a-valid-path-in-a-grid",
        "titleUS": "1391 Check if There is a Valid Path in a Grid",
        "titleCN": "1391 检查网格中是否存在有效路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Check if There is a Valid Path in a Grid"
    },
    {
        "arg": "longest-happy-prefix",
        "titleUS": "1392 Longest Happy Prefix",
        "titleCN": "1392 最长快乐前缀",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Longest Happy Prefix"
    },
    {
        "arg": "find-lucky-integer-in-an-array",
        "titleUS": "1394 Find Lucky Integer in an Array",
        "titleCN": "1394 找出数组中的幸运数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Lucky Integer in an Array"
    },
    {
        "arg": "count-number-of-teams",
        "titleUS": "1395 Count Number of Teams",
        "titleCN": "1395 统计作战单位数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Number of Teams"
    },
    {
        "arg": "design-underground-system",
        "titleUS": "1396 Design Underground System",
        "titleCN": "1396 设计地铁系统",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Design Underground System"
    },
    {
        "arg": "find-all-good-strings",
        "titleUS": "1397 Find All Good Strings",
        "titleCN": "1397 找到所有好字符串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find All Good Strings"
    },
    {
        "arg": "count-largest-group",
        "titleUS": "1399 Count Largest Group",
        "titleCN": "1399 统计最大组的数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Largest Group"
    },
    {
        "arg": "construct-k-palindrome-strings",
        "titleUS": "1400 Construct K Palindrome Strings",
        "titleCN": "1400 构造 K 个回文字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Construct K Palindrome Strings"
    },
    {
        "arg": "circle-and-rectangle-overlapping",
        "titleUS": "1401 Circle and Rectangle Overlapping",
        "titleCN": "1401 圆和矩形是否有重叠",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Circle and Rectangle Overlapping"
    },
    {
        "arg": "reducing-dishes",
        "titleUS": "1402 Reducing Dishes",
        "titleCN": "1402 做菜顺序",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Reducing Dishes"
    },
    {
        "arg": "minimum-subsequence-in-non-increasing-order",
        "titleUS": "1403 Minimum Subsequence in Non-Increasing Order",
        "titleCN": "1403 非递增顺序的最小子序列",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Subsequence in Non-Increasing Order"
    },
    {
        "arg": "number-of-steps-to-reduce-a-number-in-binary-representation-to-one",
        "titleUS": "1404 Number of Steps to Reduce a Number in Binary Representation to One",
        "titleCN": "1404 将二进制表示减到 1 的步骤数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Steps to Reduce a Number in Binary Representation to One"
    },
    {
        "arg": "longest-happy-string",
        "titleUS": "1405 Longest Happy String",
        "titleCN": "1405 最长快乐字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Happy String"
    },
    {
        "arg": "stone-game-iii",
        "titleUS": "1406 Stone Game III",
        "titleCN": "1406 石子游戏 III",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Stone Game III"
    },
    {
        "arg": "string-matching-in-an-array",
        "titleUS": "1408 String Matching in an Array",
        "titleCN": "1408 数组中的字符串匹配",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 String Matching in an Array"
    },
    {
        "arg": "queries-on-a-permutation-with-key",
        "titleUS": "1409 Queries on a Permutation With Key",
        "titleCN": "1409 查询带键的排列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Queries on a Permutation With Key"
    },
    {
        "arg": "html-entity-parser",
        "titleUS": "1410 HTML Entity Parser",
        "titleCN": "1410 HTML 实体解析器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 HTML Entity Parser"
    },
    {
        "arg": "number-of-ways-to-paint-n-3-grid",
        "titleUS": "1411 Number of Ways to Paint N × 3 Grid",
        "titleCN": "1411 给 N x 3 网格图涂色的方案数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Ways to Paint N × 3 Grid"
    },
    {
        "arg": "minimum-value-to-get-positive-step-by-step-sum",
        "titleUS": "1413 Minimum Value to Get Positive Step by Step Sum",
        "titleCN": "1413 逐步求和得到正数的最小值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Value to Get Positive Step by Step Sum"
    },
    {
        "arg": "find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k",
        "titleUS": "1414 Find the Minimum Number of Fibonacci Numbers Whose Sum Is K",
        "titleCN": "1414 和为 K 的最少斐波那契数字数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Minimum Number of Fibonacci Numbers Whose Sum Is K"
    },
    {
        "arg": "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n",
        "titleUS": "1415 The k-th Lexicographical String of All Happy Strings of Length n",
        "titleCN": "1415 长度为 n 的开心字符串中字典序第 k 小的字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 The k-th Lexicographical String of All Happy Strings of Length n"
    },
    {
        "arg": "restore-the-array",
        "titleUS": "1416 Restore The Array",
        "titleCN": "1416 恢复数组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Restore The Array"
    },
    {
        "arg": "reformat-the-string",
        "titleUS": "1417 Reformat The String",
        "titleCN": "1417 重新格式化字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Reformat The String"
    },
    {
        "arg": "display-table-of-food-orders-in-a-restaurant",
        "titleUS": "1418 Display Table of Food Orders in a Restaurant",
        "titleCN": "1418 点菜展示表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Display Table of Food Orders in a Restaurant"
    },
    {
        "arg": "minimum-number-of-frogs-croaking",
        "titleUS": "1419 Minimum Number of Frogs Croaking",
        "titleCN": "1419 数青蛙",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Frogs Croaking"
    },
    {
        "arg": "build-array-where-you-can-find-the-maximum-exactly-k-comparisons",
        "titleUS": "1420 Build Array Where You Can Find The Maximum Exactly K Comparisons",
        "titleCN": "1420 生成数组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Build Array Where You Can Find The Maximum Exactly K Comparisons"
    },
    {
        "arg": "maximum-score-after-splitting-a-string",
        "titleUS": "1422 Maximum Score After Splitting a String",
        "titleCN": "1422 分割字符串的最大得分",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Score After Splitting a String"
    },
    {
        "arg": "maximum-points-you-can-obtain-from-cards",
        "titleUS": "1423 Maximum Points You Can Obtain from Cards",
        "titleCN": "1423 可获得的最大点数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Points You Can Obtain from Cards"
    },
    {
        "arg": "diagonal-traverse-ii",
        "titleUS": "1424 Diagonal Traverse II",
        "titleCN": "1424 对角线遍历 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Diagonal Traverse II"
    },
    {
        "arg": "constrained-subsequence-sum",
        "titleUS": "1425 Constrained Subsequence Sum",
        "titleCN": "1425 带限制的子序列和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Constrained Subsequence Sum"
    },
    {
        "arg": "counting-elements",
        "titleUS": "1426 Counting Elements",
        "titleCN": "1426 数元素",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Counting Elements"
    },
    {
        "arg": "perform-string-shifts",
        "titleUS": "1427 Perform String Shifts",
        "titleCN": "1427 字符串的左右移",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Perform String Shifts"
    },
    {
        "arg": "leftmost-column-with-at-least-a-one",
        "titleUS": "1428 Leftmost Column with at Least a One",
        "titleCN": "1428 至少有一个 1 的最左端列",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Leftmost Column with at Least a One"
    },
    {
        "arg": "first-unique-number",
        "titleUS": "1429 First Unique Number",
        "titleCN": "1429 第一个唯一数字",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 First Unique Number"
    },
    {
        "arg": "check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree",
        "titleUS": "1430 Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree",
        "titleCN": "1430 判断给定的序列是否是二叉树从根到叶的路径",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree"
    },
    {
        "arg": "kids-with-the-greatest-number-of-candies",
        "titleUS": "1431 Kids With the Greatest Number of Candies",
        "titleCN": "1431 拥有最多糖果的孩子",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Kids With the Greatest Number of Candies"
    },
    {
        "arg": "max-difference-you-can-get-from-changing-an-integer",
        "titleUS": "1432 Max Difference You Can Get From Changing an Integer",
        "titleCN": "1432 改变一个整数能得到的最大差值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Max Difference You Can Get From Changing an Integer"
    },
    {
        "arg": "check-if-a-string-can-break-another-string",
        "titleUS": "1433 Check If a String Can Break Another String",
        "titleCN": "1433 检查一个字符串是否可以打破另一个字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Check If a String Can Break Another String"
    },
    {
        "arg": "number-of-ways-to-wear-different-hats-to-each-other",
        "titleUS": "1434 Number of Ways to Wear Different Hats to Each Other",
        "titleCN": "1434 每个人戴不同帽子的方案数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Ways to Wear Different Hats to Each Other"
    },
    {
        "arg": "destination-city",
        "titleUS": "1436 Destination City",
        "titleCN": "1436 旅行终点站",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Destination City"
    },
    {
        "arg": "check-if-all-1s-are-at-least-length-k-places-away",
        "titleUS": "1437 Check If All 1's Are at Least Length K Places Away",
        "titleCN": "1437 是否所有 1 都至少相隔 k 个元素",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check If All 1's Are at Least Length K Places Away"
    },
    {
        "arg": "longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit",
        "titleUS": "1438 Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit",
        "titleCN": "1438 绝对差不超过限制的最长连续子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit"
    },
    {
        "arg": "find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows",
        "titleUS": "1439 Find the Kth Smallest Sum of a Matrix With Sorted Rows",
        "titleCN": "1439 有序矩阵中的第 k 个最小数组和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find the Kth Smallest Sum of a Matrix With Sorted Rows"
    },
    {
        "arg": "build-an-array-with-stack-operations",
        "titleUS": "1441 Build an Array With Stack Operations",
        "titleCN": "1441 用栈操作构建数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Build an Array With Stack Operations"
    },
    {
        "arg": "count-triplets-that-can-form-two-arrays-of-equal-xor",
        "titleUS": "1442 Count Triplets That Can Form Two Arrays of Equal XOR",
        "titleCN": "1442 形成两个异或相等数组的三元组数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Triplets That Can Form Two Arrays of Equal XOR"
    },
    {
        "arg": "minimum-time-to-collect-all-apples-in-a-tree",
        "titleUS": "1443 Minimum Time to Collect All Apples in a Tree",
        "titleCN": "1443 收集树上所有苹果的最少时间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Time to Collect All Apples in a Tree"
    },
    {
        "arg": "number-of-ways-of-cutting-a-pizza",
        "titleUS": "1444 Number of Ways of Cutting a Pizza",
        "titleCN": "1444 切披萨的方案数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Ways of Cutting a Pizza"
    },
    {
        "arg": "consecutive-characters",
        "titleUS": "1446 Consecutive Characters",
        "titleCN": "1446 连续字符",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Consecutive Characters"
    },
    {
        "arg": "simplified-fractions",
        "titleUS": "1447 Simplified Fractions",
        "titleCN": "1447 最简分数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Simplified Fractions"
    },
    {
        "arg": "count-good-nodes-in-binary-tree",
        "titleUS": "1448 Count Good Nodes in Binary Tree",
        "titleCN": "1448 统计二叉树中好节点的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Good Nodes in Binary Tree"
    },
    {
        "arg": "form-largest-integer-with-digits-that-add-up-to-target",
        "titleUS": "1449 Form Largest Integer With Digits That Add up to Target",
        "titleCN": "1449 数位成本和为目标值的最大数字",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Form Largest Integer With Digits That Add up to Target"
    },
    {
        "arg": "number-of-students-doing-homework-at-a-given-time",
        "titleUS": "1450 Number of Students Doing Homework at a Given Time",
        "titleCN": "1450 在既定时间做作业的学生人数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Students Doing Homework at a Given Time"
    },
    {
        "arg": "rearrange-words-in-a-sentence",
        "titleUS": "1451 Rearrange Words in a Sentence",
        "titleCN": "1451 重新排列句子中的单词",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Rearrange Words in a Sentence"
    },
    {
        "arg": "people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list",
        "titleUS": "1452 People Whose List of Favorite Companies Is Not a Subset of Another List",
        "titleCN": "1452 收藏清单",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 People Whose List of Favorite Companies Is Not a Subset of Another List"
    },
    {
        "arg": "maximum-number-of-darts-inside-of-a-circular-dartboard",
        "titleUS": "1453 Maximum Number of Darts Inside of a Circular Dartboard",
        "titleCN": "1453 圆形靶内的最大飞镖数量",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Number of Darts Inside of a Circular Dartboard"
    },
    {
        "arg": "check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence",
        "titleUS": "1455 Check If a Word Occurs As a Prefix of Any Word in a Sentence",
        "titleCN": "1455 检查单词是否为句中其他单词的前缀",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check If a Word Occurs As a Prefix of Any Word in a Sentence"
    },
    {
        "arg": "maximum-number-of-vowels-in-a-substring-of-given-length",
        "titleUS": "1456 Maximum Number of Vowels in a Substring of Given Length",
        "titleCN": "1456 定长子串中元音的最大数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Vowels in a Substring of Given Length"
    },
    {
        "arg": "pseudo-palindromic-paths-in-a-binary-tree",
        "titleUS": "1457 Pseudo-Palindromic Paths in a Binary Tree",
        "titleCN": "1457 二叉树中的伪回文路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Pseudo-Palindromic Paths in a Binary Tree"
    },
    {
        "arg": "max-dot-product-of-two-subsequences",
        "titleUS": "1458 Max Dot Product of Two Subsequences",
        "titleCN": "1458 两个子序列的最大点积",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Max Dot Product of Two Subsequences"
    },
    {
        "arg": "make-two-arrays-equal-by-reversing-subarrays",
        "titleUS": "1460 Make Two Arrays Equal by Reversing Subarrays",
        "titleCN": "1460 通过翻转子数组使两个数组相等",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Make Two Arrays Equal by Reversing Subarrays"
    },
    {
        "arg": "check-if-a-string-contains-all-binary-codes-of-size-k",
        "titleUS": "1461 Check If a String Contains All Binary Codes of Size K",
        "titleCN": "1461 检查一个字符串是否包含所有长度为 K 的二进制子串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Check If a String Contains All Binary Codes of Size K"
    },
    {
        "arg": "course-schedule-iv",
        "titleUS": "1462 Course Schedule IV",
        "titleCN": "1462 课程表 IV",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Course Schedule IV"
    },
    {
        "arg": "cherry-pickup-ii",
        "titleUS": "1463 Cherry Pickup II",
        "titleCN": "1463 摘樱桃 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Cherry Pickup II"
    },
    {
        "arg": "maximum-product-of-two-elements-in-an-array",
        "titleUS": "1464 Maximum Product of Two Elements in an Array",
        "titleCN": "1464 数组中两元素的最大乘积",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Product of Two Elements in an Array"
    },
    {
        "arg": "maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts",
        "titleUS": "1465 Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts",
        "titleCN": "1465 切割后面积最大的蛋糕",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts"
    },
    {
        "arg": "reorder-routes-to-make-all-paths-lead-to-the-city-zero",
        "titleUS": "1466 Reorder Routes to Make All Paths Lead to the City Zero",
        "titleCN": "1466 重新规划路线",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reorder Routes to Make All Paths Lead to the City Zero"
    },
    {
        "arg": "probability-of-a-two-boxes-having-the-same-number-of-distinct-balls",
        "titleUS": "1467 Probability of a Two Boxes Having The Same Number of Distinct Balls",
        "titleCN": "1467 两个盒子中球的颜色数相同的概率",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Probability of a Two Boxes Having The Same Number of Distinct Balls"
    },
    {
        "arg": "find-all-the-lonely-nodes",
        "titleUS": "1469 Find All The Lonely Nodes",
        "titleCN": "1469 寻找所有的独生节点",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Find All The Lonely Nodes"
    },
    {
        "arg": "shuffle-the-array",
        "titleUS": "1470 Shuffle the Array",
        "titleCN": "1470 重新排列数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Shuffle the Array"
    },
    {
        "arg": "the-k-strongest-values-in-an-array",
        "titleUS": "1471 The k Strongest Values in an Array",
        "titleCN": "1471 数组中的 k 个最强值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 The k Strongest Values in an Array"
    },
    {
        "arg": "design-browser-history",
        "titleUS": "1472 Design Browser History",
        "titleCN": "1472 设计浏览器历史记录",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Design Browser History"
    },
    {
        "arg": "paint-house-iii",
        "titleUS": "1473 Paint House III",
        "titleCN": "1473 粉刷房子 III",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Paint House III"
    },
    {
        "arg": "delete-n-nodes-after-m-nodes-of-a-linked-list",
        "titleUS": "1474 Delete N Nodes After M Nodes of a Linked List",
        "titleCN": "1474 删除链表 M 个节点之后的 N 个节点",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Delete N Nodes After M Nodes of a Linked List"
    },
    {
        "arg": "final-prices-with-a-special-discount-in-a-shop",
        "titleUS": "1475 Final Prices With a Special Discount in a Shop",
        "titleCN": "1475 商品折扣后的最终价格",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Final Prices With a Special Discount in a Shop"
    },
    {
        "arg": "subrectangle-queries",
        "titleUS": "1476 Subrectangle Queries",
        "titleCN": "1476 子矩形查询",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Subrectangle Queries"
    },
    {
        "arg": "find-two-non-overlapping-sub-arrays-each-with-target-sum",
        "titleUS": "1477 Find Two Non-overlapping Sub-arrays Each With Target Sum",
        "titleCN": "1477 找两个和为目标值且不重叠的子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Two Non-overlapping Sub-arrays Each With Target Sum"
    },
    {
        "arg": "allocate-mailboxes",
        "titleUS": "1478 Allocate Mailboxes",
        "titleCN": "1478 安排邮筒",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Allocate Mailboxes"
    },
    {
        "arg": "running-sum-of-1d-array",
        "titleUS": "1480 Running Sum of 1d Array",
        "titleCN": "1480 一维数组的动态和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Running Sum of 1d Array"
    },
    {
        "arg": "least-number-of-unique-integers-after-k-removals",
        "titleUS": "1481 Least Number of Unique Integers after K Removals",
        "titleCN": "1481 不同整数的最少数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Least Number of Unique Integers after K Removals"
    },
    {
        "arg": "minimum-number-of-days-to-make-m-bouquets",
        "titleUS": "1482 Minimum Number of Days to Make m Bouquets",
        "titleCN": "1482 制作 m 束花所需的最少天数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Days to Make m Bouquets"
    },
    {
        "arg": "kth-ancestor-of-a-tree-node",
        "titleUS": "1483 Kth Ancestor of a Tree Node",
        "titleCN": "1483 树节点的第 K 个祖先",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Kth Ancestor of a Tree Node"
    },
    {
        "arg": "clone-binary-tree-with-random-pointer",
        "titleUS": "1485 Clone Binary Tree With Random Pointer",
        "titleCN": "1485 克隆含随机指针的二叉树",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Clone Binary Tree With Random Pointer"
    },
    {
        "arg": "xor-operation-in-an-array",
        "titleUS": "1486 XOR Operation in an Array",
        "titleCN": "1486 数组异或操作",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 XOR Operation in an Array"
    },
    {
        "arg": "making-file-names-unique",
        "titleUS": "1487 Making File Names Unique",
        "titleCN": "1487 保证文件名唯一",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Making File Names Unique"
    },
    {
        "arg": "avoid-flood-in-the-city",
        "titleUS": "1488 Avoid Flood in The City",
        "titleCN": "1488 避免洪水泛滥",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Avoid Flood in The City"
    },
    {
        "arg": "find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree",
        "titleUS": "1489 Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree",
        "titleCN": "1489 找到最小生成树里的关键边和伪关键边",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree"
    },
    {
        "arg": "clone-n-ary-tree",
        "titleUS": "1490 Clone N-ary Tree",
        "titleCN": "1490 克隆 N 叉树",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Clone N-ary Tree"
    },
    {
        "arg": "average-salary-excluding-the-minimum-and-maximum-salary",
        "titleUS": "1491 Average Salary Excluding the Minimum and Maximum Salary",
        "titleCN": "1491 去掉最低工资和最高工资后的工资平均值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Average Salary Excluding the Minimum and Maximum Salary"
    },
    {
        "arg": "the-kth-factor-of-n",
        "titleUS": "1492 The kth Factor of n",
        "titleCN": "1492 n 的第 k 个因子",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 The kth Factor of n"
    },
    {
        "arg": "longest-subarray-of-1s-after-deleting-one-element",
        "titleUS": "1493 Longest Subarray of 1's After Deleting One Element",
        "titleCN": "1493 删掉一个元素以后全为 1 的最长子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Subarray of 1's After Deleting One Element"
    },
    {
        "arg": "parallel-courses-ii",
        "titleUS": "1494 Parallel Courses II",
        "titleCN": "1494 并行课程 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Parallel Courses II"
    },
    {
        "arg": "path-crossing",
        "titleUS": "1496 Path Crossing",
        "titleCN": "1496 判断路径是否相交",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Path Crossing"
    },
    {
        "arg": "check-if-array-pairs-are-divisible-by-k",
        "titleUS": "1497 Check If Array Pairs Are Divisible by k",
        "titleCN": "1497 检查数组对是否可以被 k 整除",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Check If Array Pairs Are Divisible by k"
    },
    {
        "arg": "number-of-subsequences-that-satisfy-the-given-sum-condition",
        "titleUS": "1498 Number of Subsequences That Satisfy the Given Sum Condition",
        "titleCN": "1498 满足条件的子序列数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Subsequences That Satisfy the Given Sum Condition"
    },
    {
        "arg": "max-value-of-equation",
        "titleUS": "1499 Max Value of Equation",
        "titleCN": "1499 满足不等式的最大值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Max Value of Equation"
    },
    {
        "arg": "design-a-file-sharing-system",
        "titleUS": "1500 Design a File Sharing System",
        "titleCN": "1500 设计文件分享系统",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Design a File Sharing System"
    },
    {
        "arg": "can-make-arithmetic-progression-from-sequence",
        "titleUS": "1502 Can Make Arithmetic Progression From Sequence",
        "titleCN": "1502 判断能否形成等差数列",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Can Make Arithmetic Progression From Sequence"
    },
    {
        "arg": "last-moment-before-all-ants-fall-out-of-a-plank",
        "titleUS": "1503 Last Moment Before All Ants Fall Out of a Plank",
        "titleCN": "1503 所有蚂蚁掉下来前的最后一刻",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Last Moment Before All Ants Fall Out of a Plank"
    },
    {
        "arg": "count-submatrices-with-all-ones",
        "titleUS": "1504 Count Submatrices With All Ones",
        "titleCN": "1504 统计全 1 子矩形",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Submatrices With All Ones"
    },
    {
        "arg": "minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits",
        "titleUS": "1505 Minimum Possible Integer After at Most K Adjacent Swaps On Digits",
        "titleCN": "1505 最多 K 次交换相邻数位后得到的最小整数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Possible Integer After at Most K Adjacent Swaps On Digits"
    },
    {
        "arg": "find-root-of-n-ary-tree",
        "titleUS": "1506 Find Root of N-Ary Tree",
        "titleCN": "1506 找到 N 叉树的根节点",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Find Root of N-Ary Tree"
    },
    {
        "arg": "reformat-date",
        "titleUS": "1507 Reformat Date",
        "titleCN": "1507 转变日期格式",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Reformat Date"
    },
    {
        "arg": "range-sum-of-sorted-subarray-sums",
        "titleUS": "1508 Range Sum of Sorted Subarray Sums",
        "titleCN": "1508 子数组和排序后的区间和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Range Sum of Sorted Subarray Sums"
    },
    {
        "arg": "minimum-difference-between-largest-and-smallest-value-in-three-moves",
        "titleUS": "1509 Minimum Difference Between Largest and Smallest Value in Three Moves",
        "titleCN": "1509 三次操作后最大值与最小值的最小差",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Difference Between Largest and Smallest Value in Three Moves"
    },
    {
        "arg": "stone-game-iv",
        "titleUS": "1510 Stone Game IV",
        "titleCN": "1510 石子游戏 IV",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Stone Game IV"
    },
    {
        "arg": "number-of-good-pairs",
        "titleUS": "1512 Number of Good Pairs",
        "titleCN": "1512 好数对的数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Good Pairs"
    },
    {
        "arg": "number-of-substrings-with-only-1s",
        "titleUS": "1513 Number of Substrings With Only 1s",
        "titleCN": "1513 仅含 1 的子串数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Substrings With Only 1s"
    },
    {
        "arg": "path-with-maximum-probability",
        "titleUS": "1514 Path with Maximum Probability",
        "titleCN": "1514 概率最大的路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Path with Maximum Probability"
    },
    {
        "arg": "best-position-for-a-service-centre",
        "titleUS": "1515 Best Position for a Service Centre",
        "titleCN": "1515 服务中心的最佳位置",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Best Position for a Service Centre"
    },
    {
        "arg": "move-sub-tree-of-n-ary-tree",
        "titleUS": "1516 Move Sub-Tree of N-Ary Tree",
        "titleCN": "1516 移动 N 叉树的子树",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Move Sub-Tree of N-Ary Tree"
    },
    {
        "arg": "water-bottles",
        "titleUS": "1518 Water Bottles",
        "titleCN": "1518 换水问题",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Water Bottles"
    },
    {
        "arg": "number-of-nodes-in-the-sub-tree-with-the-same-label",
        "titleUS": "1519 Number of Nodes in the Sub-Tree With the Same Label",
        "titleCN": "1519 子树中标签相同的节点数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Nodes in the Sub-Tree With the Same Label"
    },
    {
        "arg": "maximum-number-of-non-overlapping-substrings",
        "titleUS": "1520 Maximum Number of Non-Overlapping Substrings",
        "titleCN": "1520 最多的不重叠子字符串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Number of Non-Overlapping Substrings"
    },
    {
        "arg": "find-a-value-of-a-mysterious-function-closest-to-target",
        "titleUS": "1521 Find a Value of a Mysterious Function Closest to Target",
        "titleCN": "1521 找到最接近目标值的函数值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find a Value of a Mysterious Function Closest to Target"
    },
    {
        "arg": "diameter-of-n-ary-tree",
        "titleUS": "1522 Diameter of N-Ary Tree",
        "titleCN": "1522 N 叉树的直径",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Diameter of N-Ary Tree"
    },
    {
        "arg": "count-odd-numbers-in-an-interval-range",
        "titleUS": "1523 Count Odd Numbers in an Interval Range",
        "titleCN": "1523 在区间范围内统计奇数数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Odd Numbers in an Interval Range"
    },
    {
        "arg": "number-of-sub-arrays-with-odd-sum",
        "titleUS": "1524 Number of Sub-arrays With Odd Sum",
        "titleCN": "1524 和为奇数的子数组数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Sub-arrays With Odd Sum"
    },
    {
        "arg": "number-of-good-ways-to-split-a-string",
        "titleUS": "1525 Number of Good Ways to Split a String",
        "titleCN": "1525 字符串的好分割数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Good Ways to Split a String"
    },
    {
        "arg": "minimum-number-of-increments-on-subarrays-to-form-a-target-array",
        "titleUS": "1526 Minimum Number of Increments on Subarrays to Form a Target Array",
        "titleCN": "1526 形成目标数组的子数组最少增加次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Number of Increments on Subarrays to Form a Target Array"
    },
    {
        "arg": "shuffle-string",
        "titleUS": "1528 Shuffle String",
        "titleCN": "1528 重新排列字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Shuffle String"
    },
    {
        "arg": "minimum-suffix-flips",
        "titleUS": "1529 Minimum Suffix Flips",
        "titleCN": "1529 最少的后缀翻转次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Suffix Flips"
    },
    {
        "arg": "number-of-good-leaf-nodes-pairs",
        "titleUS": "1530 Number of Good Leaf Nodes Pairs",
        "titleCN": "1530 好叶子节点对的数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Good Leaf Nodes Pairs"
    },
    {
        "arg": "string-compression-ii",
        "titleUS": "1531 String Compression II",
        "titleCN": "1531 压缩字符串 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 String Compression II"
    },
    {
        "arg": "find-the-index-of-the-large-integer",
        "titleUS": "1533 Find the Index of the Large Integer",
        "titleCN": "1533 找到最大整数的索引",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Find the Index of the Large Integer"
    },
    {
        "arg": "count-good-triplets",
        "titleUS": "1534 Count Good Triplets",
        "titleCN": "1534 统计好三元组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Good Triplets"
    },
    {
        "arg": "find-the-winner-of-an-array-game",
        "titleUS": "1535 Find the Winner of an Array Game",
        "titleCN": "1535 找出数组游戏的赢家",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Winner of an Array Game"
    },
    {
        "arg": "minimum-swaps-to-arrange-a-binary-grid",
        "titleUS": "1536 Minimum Swaps to Arrange a Binary Grid",
        "titleCN": "1536 排布二进制网格的最少交换次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Swaps to Arrange a Binary Grid"
    },
    {
        "arg": "get-the-maximum-score",
        "titleUS": "1537 Get the Maximum Score",
        "titleCN": "1537 最大得分",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Get the Maximum Score"
    },
    {
        "arg": "guess-the-majority-in-a-hidden-array",
        "titleUS": "1538 Guess the Majority in a Hidden Array",
        "titleCN": "1538 找出隐藏数组中出现次数最多的元素",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Guess the Majority in a Hidden Array"
    },
    {
        "arg": "kth-missing-positive-number",
        "titleUS": "1539 Kth Missing Positive Number",
        "titleCN": "1539 第 k 个缺失的正整数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Kth Missing Positive Number"
    },
    {
        "arg": "can-convert-string-in-k-moves",
        "titleUS": "1540 Can Convert String in K Moves",
        "titleCN": "1540 K 次操作转变字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Can Convert String in K Moves"
    },
    {
        "arg": "minimum-insertions-to-balance-a-parentheses-string",
        "titleUS": "1541 Minimum Insertions to Balance a Parentheses String",
        "titleCN": "1541 平衡括号字符串的最少插入次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Insertions to Balance a Parentheses String"
    },
    {
        "arg": "find-longest-awesome-substring",
        "titleUS": "1542 Find Longest Awesome Substring",
        "titleCN": "1542 找出最长的超赞子字符串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find Longest Awesome Substring"
    },
    {
        "arg": "make-the-string-great",
        "titleUS": "1544 Make The String Great",
        "titleCN": "1544 整理字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Make The String Great"
    },
    {
        "arg": "find-kth-bit-in-nth-binary-string",
        "titleUS": "1545 Find Kth Bit in Nth Binary String",
        "titleCN": "1545 找出第 N 个二进制字符串中的第 K 位",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Kth Bit in Nth Binary String"
    },
    {
        "arg": "maximum-number-of-non-overlapping-subarrays-with-sum-equals-target",
        "titleUS": "1546 Maximum Number of Non-Overlapping Subarrays With Sum Equals Target",
        "titleCN": "1546 和为目标值且不重叠的非空子数组的最大数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Non-Overlapping Subarrays With Sum Equals Target"
    },
    {
        "arg": "minimum-cost-to-cut-a-stick",
        "titleUS": "1547 Minimum Cost to Cut a Stick",
        "titleCN": "1547 切棍子的最小成本",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Cost to Cut a Stick"
    },
    {
        "arg": "the-most-similar-path-in-a-graph",
        "titleUS": "1548 The Most Similar Path in a Graph",
        "titleCN": "1548 图中最相似的路径",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 The Most Similar Path in a Graph"
    },
    {
        "arg": "three-consecutive-odds",
        "titleUS": "1550 Three Consecutive Odds",
        "titleCN": "1550 存在连续三个奇数的数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Three Consecutive Odds"
    },
    {
        "arg": "minimum-operations-to-make-array-equal",
        "titleUS": "1551 Minimum Operations to Make Array Equal",
        "titleCN": "1551 使数组中所有元素相等的最小操作数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Operations to Make Array Equal"
    },
    {
        "arg": "magnetic-force-between-two-balls",
        "titleUS": "1552 Magnetic Force Between Two Balls",
        "titleCN": "1552 两球之间的磁力",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Magnetic Force Between Two Balls"
    },
    {
        "arg": "minimum-number-of-days-to-eat-n-oranges",
        "titleUS": "1553 Minimum Number of Days to Eat N Oranges",
        "titleCN": "1553 吃掉 N 个橘子的最少天数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Number of Days to Eat N Oranges"
    },
    {
        "arg": "strings-differ-by-one-character",
        "titleUS": "1554 Strings Differ by One Character",
        "titleCN": "1554 只有一个不同字符的字符串",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Strings Differ by One Character"
    },
    {
        "arg": "thousand-separator",
        "titleUS": "1556 Thousand Separator",
        "titleCN": "1556 千位分隔数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Thousand Separator"
    },
    {
        "arg": "minimum-number-of-vertices-to-reach-all-nodes",
        "titleUS": "1557 Minimum Number of Vertices to Reach All Nodes",
        "titleCN": "1557 可以到达所有点的最少点数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Vertices to Reach All Nodes"
    },
    {
        "arg": "minimum-numbers-of-function-calls-to-make-target-array",
        "titleUS": "1558 Minimum Numbers of Function Calls to Make Target Array",
        "titleCN": "1558 得到目标数组的最少函数调用次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Numbers of Function Calls to Make Target Array"
    },
    {
        "arg": "detect-cycles-in-2d-grid",
        "titleUS": "1559 Detect Cycles in 2D Grid",
        "titleCN": "1559 二维网格图中探测环",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Detect Cycles in 2D Grid"
    },
    {
        "arg": "most-visited-sector-in-a-circular-track",
        "titleUS": "1560 Most Visited Sector in  a Circular Track",
        "titleCN": "1560 圆形赛道上经过次数最多的扇区",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Most Visited Sector in  a Circular Track"
    },
    {
        "arg": "maximum-number-of-coins-you-can-get",
        "titleUS": "1561 Maximum Number of Coins You Can Get",
        "titleCN": "1561 你可以获得的最大硬币数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Coins You Can Get"
    },
    {
        "arg": "find-latest-group-of-size-m",
        "titleUS": "1562 Find Latest Group of Size M",
        "titleCN": "1562 查找大小为 M 的最新分组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Latest Group of Size M"
    },
    {
        "arg": "stone-game-v",
        "titleUS": "1563 Stone Game V",
        "titleCN": "1563 石子游戏 V",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Stone Game V"
    },
    {
        "arg": "put-boxes-into-the-warehouse-i",
        "titleUS": "1564 Put Boxes Into the Warehouse I",
        "titleCN": "1564 把箱子放进仓库里 I",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Put Boxes Into the Warehouse I"
    },
    {
        "arg": "detect-pattern-of-length-m-repeated-k-or-more-times",
        "titleUS": "1566 Detect Pattern of Length M Repeated K or More Times",
        "titleCN": "1566 重复至少 K 次且长度为 M 的模式",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Detect Pattern of Length M Repeated K or More Times"
    },
    {
        "arg": "maximum-length-of-subarray-with-positive-product",
        "titleUS": "1567 Maximum Length of Subarray With Positive Product",
        "titleCN": "1567 乘积为正数的最长子数组长度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Length of Subarray With Positive Product"
    },
    {
        "arg": "minimum-number-of-days-to-disconnect-island",
        "titleUS": "1568 Minimum Number of Days to Disconnect Island",
        "titleCN": "1568 使陆地分离的最少天数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Number of Days to Disconnect Island"
    },
    {
        "arg": "number-of-ways-to-reorder-array-to-get-same-bst",
        "titleUS": "1569 Number of Ways to Reorder Array to Get Same BST",
        "titleCN": "1569 将子数组重新排序得到同一个二叉搜索树的方案数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Ways to Reorder Array to Get Same BST"
    },
    {
        "arg": "dot-product-of-two-sparse-vectors",
        "titleUS": "1570 Dot Product of Two Sparse Vectors",
        "titleCN": "1570 两个稀疏向量的点积",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Dot Product of Two Sparse Vectors"
    },
    {
        "arg": "matrix-diagonal-sum",
        "titleUS": "1572 Matrix Diagonal Sum",
        "titleCN": "1572 矩阵对角线元素的和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Matrix Diagonal Sum"
    },
    {
        "arg": "number-of-ways-to-split-a-string",
        "titleUS": "1573 Number of Ways to Split a String",
        "titleCN": "1573 分割字符串的方案数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Ways to Split a String"
    },
    {
        "arg": "shortest-subarray-to-be-removed-to-make-array-sorted",
        "titleUS": "1574 Shortest Subarray to be Removed to Make Array Sorted",
        "titleCN": "1574 删除最短的子数组使剩余数组有序",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Shortest Subarray to be Removed to Make Array Sorted"
    },
    {
        "arg": "count-all-possible-routes",
        "titleUS": "1575 Count All Possible Routes",
        "titleCN": "1575 统计所有可行路径",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count All Possible Routes"
    },
    {
        "arg": "replace-all-s-to-avoid-consecutive-repeating-characters",
        "titleUS": "1576 Replace All ?'s to Avoid Consecutive Repeating Characters",
        "titleCN": "1576 替换所有的问号",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Replace All ?'s to Avoid Consecutive Repeating Characters"
    },
    {
        "arg": "number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers",
        "titleUS": "1577 Number of Ways Where Square of Number Is Equal to Product of Two Numbers",
        "titleCN": "1577 数的平方等于两数乘积的方法数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Ways Where Square of Number Is Equal to Product of Two Numbers"
    },
    {
        "arg": "minimum-time-to-make-rope-colorful",
        "titleUS": "1578 Minimum Time to Make Rope Colorful",
        "titleCN": "1578 使绳子变成彩色的最短时间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Time to Make Rope Colorful"
    },
    {
        "arg": "remove-max-number-of-edges-to-keep-graph-fully-traversable",
        "titleUS": "1579 Remove Max Number of Edges to Keep Graph Fully Traversable",
        "titleCN": "1579 保证图可完全遍历",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Remove Max Number of Edges to Keep Graph Fully Traversable"
    },
    {
        "arg": "put-boxes-into-the-warehouse-ii",
        "titleUS": "1580 Put Boxes Into the Warehouse II",
        "titleCN": "1580 把箱子放进仓库里 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Put Boxes Into the Warehouse II"
    },
    {
        "arg": "special-positions-in-a-binary-matrix",
        "titleUS": "1582 Special Positions in a Binary Matrix",
        "titleCN": "1582 二进制矩阵中的特殊位置",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Special Positions in a Binary Matrix"
    },
    {
        "arg": "count-unhappy-friends",
        "titleUS": "1583 Count Unhappy Friends",
        "titleCN": "1583 统计不开心的朋友",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Unhappy Friends"
    },
    {
        "arg": "min-cost-to-connect-all-points",
        "titleUS": "1584 Min Cost to Connect All Points",
        "titleCN": "1584 连接所有点的最小费用",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Min Cost to Connect All Points"
    },
    {
        "arg": "check-if-string-is-transformable-with-substring-sort-operations",
        "titleUS": "1585 Check If String Is Transformable With Substring Sort Operations",
        "titleCN": "1585 检查字符串是否可以通过排序子字符串得到另一个字符串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Check If String Is Transformable With Substring Sort Operations"
    },
    {
        "arg": "binary-search-tree-iterator-ii",
        "titleUS": "1586 Binary Search Tree Iterator II",
        "titleCN": "1586 二叉搜索树迭代器 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Binary Search Tree Iterator II"
    },
    {
        "arg": "sum-of-all-odd-length-subarrays",
        "titleUS": "1588 Sum of All Odd Length Subarrays",
        "titleCN": "1588 所有奇数长度子数组的和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sum of All Odd Length Subarrays"
    },
    {
        "arg": "maximum-sum-obtained-of-any-permutation",
        "titleUS": "1589 Maximum Sum Obtained of Any Permutation",
        "titleCN": "1589 所有排列中的最大和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Sum Obtained of Any Permutation"
    },
    {
        "arg": "make-sum-divisible-by-p",
        "titleUS": "1590 Make Sum Divisible by P",
        "titleCN": "1590 使数组和能被 P 整除",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Make Sum Divisible by P"
    },
    {
        "arg": "strange-printer-ii",
        "titleUS": "1591 Strange Printer II",
        "titleCN": "1591 奇怪的打印机 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Strange Printer II"
    },
    {
        "arg": "rearrange-spaces-between-words",
        "titleUS": "1592 Rearrange Spaces Between Words",
        "titleCN": "1592 重新排列单词间的空格",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Rearrange Spaces Between Words"
    },
    {
        "arg": "split-a-string-into-the-max-number-of-unique-substrings",
        "titleUS": "1593 Split a String Into the Max Number of Unique Substrings",
        "titleCN": "1593 拆分字符串使唯一子字符串的数目最大",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Split a String Into the Max Number of Unique Substrings"
    },
    {
        "arg": "maximum-non-negative-product-in-a-matrix",
        "titleUS": "1594 Maximum Non Negative Product in a Matrix",
        "titleCN": "1594 矩阵的最大非负积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Non Negative Product in a Matrix"
    },
    {
        "arg": "minimum-cost-to-connect-two-groups-of-points",
        "titleUS": "1595 Minimum Cost to Connect Two Groups of Points",
        "titleCN": "1595 连通两组点的最小成本",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Cost to Connect Two Groups of Points"
    },
    {
        "arg": "build-binary-expression-tree-from-infix-expression",
        "titleUS": "1597 Build Binary Expression Tree From Infix Expression",
        "titleCN": "1597 根据中缀表达式构造二叉表达式树",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Build Binary Expression Tree From Infix Expression"
    },
    {
        "arg": "crawler-log-folder",
        "titleUS": "1598 Crawler Log Folder",
        "titleCN": "1598 文件夹操作日志搜集器",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Crawler Log Folder"
    },
    {
        "arg": "maximum-profit-of-operating-a-centennial-wheel",
        "titleUS": "1599 Maximum Profit of Operating a Centennial Wheel",
        "titleCN": "1599 经营摩天轮的最大利润",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Profit of Operating a Centennial Wheel"
    },
    {
        "arg": "throne-inheritance",
        "titleUS": "1600 Throne Inheritance",
        "titleCN": "1600 王位继承顺序",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Throne Inheritance"
    },
    {
        "arg": "maximum-number-of-achievable-transfer-requests",
        "titleUS": "1601 Maximum Number of Achievable Transfer Requests",
        "titleCN": "1601 最多可达成的换楼请求数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Number of Achievable Transfer Requests"
    },
    {
        "arg": "find-nearest-right-node-in-binary-tree",
        "titleUS": "1602 Find Nearest Right Node in Binary Tree",
        "titleCN": "1602 找到二叉树中最近的右侧节点",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Find Nearest Right Node in Binary Tree"
    },
    {
        "arg": "design-parking-system",
        "titleUS": "1603 Design Parking System",
        "titleCN": "1603 设计停车系统",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Design Parking System"
    },
    {
        "arg": "alert-using-same-key-card-three-or-more-times-in-a-one-hour-period",
        "titleUS": "1604 Alert Using Same Key-Card Three or More Times in a One Hour Period",
        "titleCN": "1604 警告一小时内使用相同员工卡大于等于三次的人",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Alert Using Same Key-Card Three or More Times in a One Hour Period"
    },
    {
        "arg": "find-valid-matrix-given-row-and-column-sums",
        "titleUS": "1605 Find Valid Matrix Given Row and Column Sums",
        "titleCN": "1605 给定行和列的和求可行矩阵",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Valid Matrix Given Row and Column Sums"
    },
    {
        "arg": "find-servers-that-handled-most-number-of-requests",
        "titleUS": "1606 Find Servers That Handled Most Number of Requests",
        "titleCN": "1606 找到处理最多请求的服务器",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find Servers That Handled Most Number of Requests"
    },
    {
        "arg": "special-array-with-x-elements-greater-than-or-equal-x",
        "titleUS": "1608 Special Array With X Elements Greater Than or Equal X",
        "titleCN": "1608 特殊数组的特征值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Special Array With X Elements Greater Than or Equal X"
    },
    {
        "arg": "even-odd-tree",
        "titleUS": "1609 Even Odd Tree",
        "titleCN": "1609 奇偶树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Even Odd Tree"
    },
    {
        "arg": "maximum-number-of-visible-points",
        "titleUS": "1610 Maximum Number of Visible Points",
        "titleCN": "1610 可见点的最大数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Number of Visible Points"
    },
    {
        "arg": "minimum-one-bit-operations-to-make-integers-zero",
        "titleUS": "1611 Minimum One Bit Operations to Make Integers Zero",
        "titleCN": "1611 使整数变为 0 的最少操作次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum One Bit Operations to Make Integers Zero"
    },
    {
        "arg": "check-if-two-expression-trees-are-equivalent",
        "titleUS": "1612 Check If Two Expression Trees are Equivalent",
        "titleCN": "1612 检查两棵二叉表达式树是否等价",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Check If Two Expression Trees are Equivalent"
    },
    {
        "arg": "maximum-nesting-depth-of-the-parentheses",
        "titleUS": "1614 Maximum Nesting Depth of the Parentheses",
        "titleCN": "1614 括号的最大嵌套深度",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Nesting Depth of the Parentheses"
    },
    {
        "arg": "maximal-network-rank",
        "titleUS": "1615 Maximal Network Rank",
        "titleCN": "1615 最大网络秩",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximal Network Rank"
    },
    {
        "arg": "split-two-strings-to-make-palindrome",
        "titleUS": "1616 Split Two Strings to Make Palindrome",
        "titleCN": "1616 分割两个字符串得到回文串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Split Two Strings to Make Palindrome"
    },
    {
        "arg": "count-subtrees-with-max-distance-between-cities",
        "titleUS": "1617 Count Subtrees With Max Distance Between Cities",
        "titleCN": "1617 统计子树中城市之间最大距离",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Subtrees With Max Distance Between Cities"
    },
    {
        "arg": "maximum-font-to-fit-a-sentence-in-a-screen",
        "titleUS": "1618 Maximum Font to Fit a Sentence in a Screen",
        "titleCN": "1618 找出适应屏幕的最大字号",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Font to Fit a Sentence in a Screen"
    },
    {
        "arg": "mean-of-array-after-removing-some-elements",
        "titleUS": "1619 Mean of Array After Removing Some Elements",
        "titleCN": "1619 删除某些元素后的数组均值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Mean of Array After Removing Some Elements"
    },
    {
        "arg": "coordinate-with-maximum-network-quality",
        "titleUS": "1620 Coordinate With Maximum Network Quality",
        "titleCN": "1620 网络信号最好的坐标",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Coordinate With Maximum Network Quality"
    },
    {
        "arg": "number-of-sets-of-k-non-overlapping-line-segments",
        "titleUS": "1621 Number of Sets of K Non-Overlapping Line Segments",
        "titleCN": "1621 大小为 K 的不重叠线段的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Sets of K Non-Overlapping Line Segments"
    },
    {
        "arg": "fancy-sequence",
        "titleUS": "1622 Fancy Sequence",
        "titleCN": "1622 奇妙序列",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Fancy Sequence"
    },
    {
        "arg": "largest-substring-between-two-equal-characters",
        "titleUS": "1624 Largest Substring Between Two Equal Characters",
        "titleCN": "1624 两个相同字符之间的最长子字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Largest Substring Between Two Equal Characters"
    },
    {
        "arg": "lexicographically-smallest-string-after-applying-operations",
        "titleUS": "1625 Lexicographically Smallest String After Applying Operations",
        "titleCN": "1625 执行操作后字典序最小的字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Lexicographically Smallest String After Applying Operations"
    },
    {
        "arg": "best-team-with-no-conflicts",
        "titleUS": "1626 Best Team With No Conflicts",
        "titleCN": "1626 无矛盾的最佳球队",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Best Team With No Conflicts"
    },
    {
        "arg": "graph-connectivity-with-threshold",
        "titleUS": "1627 Graph Connectivity With Threshold",
        "titleCN": "1627 带阈值的图连通性",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Graph Connectivity With Threshold"
    },
    {
        "arg": "design-an-expression-tree-with-evaluate-function",
        "titleUS": "1628 Design an Expression Tree With Evaluate Function",
        "titleCN": "1628 设计带解析函数的表达式树",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Design an Expression Tree With Evaluate Function"
    },
    {
        "arg": "slowest-key",
        "titleUS": "1629 Slowest Key",
        "titleCN": "1629 按键持续时间最长的键",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Slowest Key"
    },
    {
        "arg": "arithmetic-subarrays",
        "titleUS": "1630 Arithmetic Subarrays",
        "titleCN": "1630 等差子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Arithmetic Subarrays"
    },
    {
        "arg": "path-with-minimum-effort",
        "titleUS": "1631 Path With Minimum Effort",
        "titleCN": "1631 最小体力消耗路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Path With Minimum Effort"
    },
    {
        "arg": "rank-transform-of-a-matrix",
        "titleUS": "1632 Rank Transform of a Matrix",
        "titleCN": "1632 矩阵转换后的秩",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Rank Transform of a Matrix"
    },
    {
        "arg": "add-two-polynomials-represented-as-linked-lists",
        "titleUS": "1634 Add Two Polynomials Represented as Linked Lists",
        "titleCN": "1634 求两个多项式链表的和",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Add Two Polynomials Represented as Linked Lists"
    },
    {
        "arg": "sort-array-by-increasing-frequency",
        "titleUS": "1636 Sort Array by Increasing Frequency",
        "titleCN": "1636 按照频率将数组升序排序",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sort Array by Increasing Frequency"
    },
    {
        "arg": "widest-vertical-area-between-two-points-containing-no-points",
        "titleUS": "1637 Widest Vertical Area Between Two Points Containing No Points",
        "titleCN": "1637 两点之间不包含任何点的最宽垂直区域",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Widest Vertical Area Between Two Points Containing No Points"
    },
    {
        "arg": "count-substrings-that-differ-by-one-character",
        "titleUS": "1638 Count Substrings That Differ by One Character",
        "titleCN": "1638 统计只差一个字符的子串数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Substrings That Differ by One Character"
    },
    {
        "arg": "number-of-ways-to-form-a-target-string-given-a-dictionary",
        "titleUS": "1639 Number of Ways to Form a Target String Given a Dictionary",
        "titleCN": "1639 通过给定词典构造目标字符串的方案数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Ways to Form a Target String Given a Dictionary"
    },
    {
        "arg": "check-array-formation-through-concatenation",
        "titleUS": "1640 Check Array Formation Through Concatenation",
        "titleCN": "1640 能否连接形成数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check Array Formation Through Concatenation"
    },
    {
        "arg": "count-sorted-vowel-strings",
        "titleUS": "1641 Count Sorted Vowel Strings",
        "titleCN": "1641 统计字典序元音字符串的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Sorted Vowel Strings"
    },
    {
        "arg": "furthest-building-you-can-reach",
        "titleUS": "1642 Furthest Building You Can Reach",
        "titleCN": "1642 可以到达的最远建筑",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Furthest Building You Can Reach"
    },
    {
        "arg": "kth-smallest-instructions",
        "titleUS": "1643 Kth Smallest Instructions",
        "titleCN": "1643 第 K 条最小指令",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Kth Smallest Instructions"
    },
    {
        "arg": "lowest-common-ancestor-of-a-binary-tree-ii",
        "titleUS": "1644 Lowest Common Ancestor of a Binary Tree II",
        "titleCN": "1644 二叉树的最近公共祖先 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Lowest Common Ancestor of a Binary Tree II"
    },
    {
        "arg": "get-maximum-in-generated-array",
        "titleUS": "1646 Get Maximum in Generated Array",
        "titleCN": "1646 获取生成数组中的最大值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Get Maximum in Generated Array"
    },
    {
        "arg": "minimum-deletions-to-make-character-frequencies-unique",
        "titleUS": "1647 Minimum Deletions to Make Character Frequencies Unique",
        "titleCN": "1647 字符频次唯一的最小删除次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Deletions to Make Character Frequencies Unique"
    },
    {
        "arg": "sell-diminishing-valued-colored-balls",
        "titleUS": "1648 Sell Diminishing-Valued Colored Balls",
        "titleCN": "1648 销售价值减少的颜色球",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sell Diminishing-Valued Colored Balls"
    },
    {
        "arg": "create-sorted-array-through-instructions",
        "titleUS": "1649 Create Sorted Array through Instructions",
        "titleCN": "1649 通过指令创建有序数组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Create Sorted Array through Instructions"
    },
    {
        "arg": "lowest-common-ancestor-of-a-binary-tree-iii",
        "titleUS": "1650 Lowest Common Ancestor of a Binary Tree III",
        "titleCN": "1650 二叉树的最近公共祖先 III",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Lowest Common Ancestor of a Binary Tree III"
    },
    {
        "arg": "defuse-the-bomb",
        "titleUS": "1652 Defuse the Bomb",
        "titleCN": "1652 拆炸弹",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Defuse the Bomb"
    },
    {
        "arg": "minimum-deletions-to-make-string-balanced",
        "titleUS": "1653 Minimum Deletions to Make String Balanced",
        "titleCN": "1653 使字符串平衡的最少删除次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Deletions to Make String Balanced"
    },
    {
        "arg": "minimum-jumps-to-reach-home",
        "titleUS": "1654 Minimum Jumps to Reach Home",
        "titleCN": "1654 到家的最少跳跃次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Jumps to Reach Home"
    },
    {
        "arg": "distribute-repeating-integers",
        "titleUS": "1655 Distribute Repeating Integers",
        "titleCN": "1655 分配重复整数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Distribute Repeating Integers"
    },
    {
        "arg": "design-an-ordered-stream",
        "titleUS": "1656 Design an Ordered Stream",
        "titleCN": "1656 设计有序流",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Design an Ordered Stream"
    },
    {
        "arg": "determine-if-two-strings-are-close",
        "titleUS": "1657 Determine if Two Strings Are Close",
        "titleCN": "1657 确定两个字符串是否接近",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Determine if Two Strings Are Close"
    },
    {
        "arg": "minimum-operations-to-reduce-x-to-zero",
        "titleUS": "1658 Minimum Operations to Reduce X to Zero",
        "titleCN": "1658 将 x 减到 0 的最小操作数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Operations to Reduce X to Zero"
    },
    {
        "arg": "maximize-grid-happiness",
        "titleUS": "1659 Maximize Grid Happiness",
        "titleCN": "1659 最大化网格幸福感",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximize Grid Happiness"
    },
    {
        "arg": "correct-a-binary-tree",
        "titleUS": "1660 Correct a Binary Tree",
        "titleCN": "1660 纠正二叉树",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Correct a Binary Tree"
    },
    {
        "arg": "check-if-two-string-arrays-are-equivalent",
        "titleUS": "1662 Check If Two String Arrays are Equivalent",
        "titleCN": "1662 检查两个字符串数组是否相等",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check If Two String Arrays are Equivalent"
    },
    {
        "arg": "smallest-string-with-a-given-numeric-value",
        "titleUS": "1663 Smallest String With A Given Numeric Value",
        "titleCN": "1663 具有给定数值的最小字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Smallest String With A Given Numeric Value"
    },
    {
        "arg": "ways-to-make-a-fair-array",
        "titleUS": "1664 Ways to Make a Fair Array",
        "titleCN": "1664 生成平衡数组的方案数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Ways to Make a Fair Array"
    },
    {
        "arg": "minimum-initial-energy-to-finish-tasks",
        "titleUS": "1665 Minimum Initial Energy to Finish Tasks",
        "titleCN": "1665 完成所有任务的最少初始能量",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Initial Energy to Finish Tasks"
    },
    {
        "arg": "change-the-root-of-a-binary-tree",
        "titleUS": "1666 Change the Root of a Binary Tree",
        "titleCN": "1666 改变二叉树的根节点",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Change the Root of a Binary Tree"
    },
    {
        "arg": "maximum-repeating-substring",
        "titleUS": "1668 Maximum Repeating Substring",
        "titleCN": "1668 最大重复子字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Repeating Substring"
    },
    {
        "arg": "merge-in-between-linked-lists",
        "titleUS": "1669 Merge In Between Linked Lists",
        "titleCN": "1669 合并两个链表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Merge In Between Linked Lists"
    },
    {
        "arg": "design-front-middle-back-queue",
        "titleUS": "1670 Design Front Middle Back Queue",
        "titleCN": "1670 设计前中后队列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Design Front Middle Back Queue"
    },
    {
        "arg": "minimum-number-of-removals-to-make-mountain-array",
        "titleUS": "1671 Minimum Number of Removals to Make Mountain Array",
        "titleCN": "1671 得到山形数组的最少删除次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Number of Removals to Make Mountain Array"
    },
    {
        "arg": "richest-customer-wealth",
        "titleUS": "1672 Richest Customer Wealth",
        "titleCN": "1672 最富有客户的资产总量",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Richest Customer Wealth"
    },
    {
        "arg": "find-the-most-competitive-subsequence",
        "titleUS": "1673 Find the Most Competitive Subsequence",
        "titleCN": "1673 找出最具竞争力的子序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Most Competitive Subsequence"
    },
    {
        "arg": "minimum-moves-to-make-array-complementary",
        "titleUS": "1674 Minimum Moves to Make Array Complementary",
        "titleCN": "1674 使数组互补的最少操作次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Moves to Make Array Complementary"
    },
    {
        "arg": "minimize-deviation-in-array",
        "titleUS": "1675 Minimize Deviation in Array",
        "titleCN": "1675 数组的最小偏移量",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimize Deviation in Array"
    },
    {
        "arg": "lowest-common-ancestor-of-a-binary-tree-iv",
        "titleUS": "1676 Lowest Common Ancestor of a Binary Tree IV",
        "titleCN": "1676 二叉树的最近公共祖先 IV",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Lowest Common Ancestor of a Binary Tree IV"
    },
    {
        "arg": "goal-parser-interpretation",
        "titleUS": "1678 Goal Parser Interpretation",
        "titleCN": "1678 设计 Goal 解析器",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Goal Parser Interpretation"
    },
    {
        "arg": "max-number-of-k-sum-pairs",
        "titleUS": "1679 Max Number of K-Sum Pairs",
        "titleCN": "1679 K 和数对的最大数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Max Number of K-Sum Pairs"
    },
    {
        "arg": "concatenation-of-consecutive-binary-numbers",
        "titleUS": "1680 Concatenation of Consecutive Binary Numbers",
        "titleCN": "1680 连接连续二进制数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Concatenation of Consecutive Binary Numbers"
    },
    {
        "arg": "minimum-incompatibility",
        "titleUS": "1681 Minimum Incompatibility",
        "titleCN": "1681 最小不兼容性",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Incompatibility"
    },
    {
        "arg": "longest-palindromic-subsequence-ii",
        "titleUS": "1682 Longest Palindromic Subsequence II",
        "titleCN": "1682 最长回文子序列 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Longest Palindromic Subsequence II"
    },
    {
        "arg": "count-the-number-of-consistent-strings",
        "titleUS": "1684 Count the Number of Consistent Strings",
        "titleCN": "1684 统计一致字符串的数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count the Number of Consistent Strings"
    },
    {
        "arg": "sum-of-absolute-differences-in-a-sorted-array",
        "titleUS": "1685 Sum of Absolute Differences in a Sorted Array",
        "titleCN": "1685 有序数组中差绝对值之和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum of Absolute Differences in a Sorted Array"
    },
    {
        "arg": "stone-game-vi",
        "titleUS": "1686 Stone Game VI",
        "titleCN": "1686 石子游戏 VI",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Stone Game VI"
    },
    {
        "arg": "delivering-boxes-from-storage-to-ports",
        "titleUS": "1687 Delivering Boxes from Storage to Ports",
        "titleCN": "1687 从仓库到码头运输箱子",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Delivering Boxes from Storage to Ports"
    },
    {
        "arg": "count-of-matches-in-tournament",
        "titleUS": "1688 Count of Matches in Tournament",
        "titleCN": "1688 比赛中的配对次数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count of Matches in Tournament"
    },
    {
        "arg": "partitioning-into-minimum-number-of-deci-binary-numbers",
        "titleUS": "1689 Partitioning Into Minimum Number Of Deci-Binary Numbers",
        "titleCN": "1689 十-二进制数的最少数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Partitioning Into Minimum Number Of Deci-Binary Numbers"
    },
    {
        "arg": "stone-game-vii",
        "titleUS": "1690 Stone Game VII",
        "titleCN": "1690 石子游戏 VII",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Stone Game VII"
    },
    {
        "arg": "maximum-height-by-stacking-cuboids",
        "titleUS": "1691 Maximum Height by Stacking Cuboids ",
        "titleCN": "1691 堆叠长方体的最大高度",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Height by Stacking Cuboids "
    },
    {
        "arg": "count-ways-to-distribute-candies",
        "titleUS": "1692 Count Ways to Distribute Candies",
        "titleCN": "1692 计算分配糖果的不同方式",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Count Ways to Distribute Candies"
    },
    {
        "arg": "reformat-phone-number",
        "titleUS": "1694 Reformat Phone Number",
        "titleCN": "1694 重新格式化电话号码",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Reformat Phone Number"
    },
    {
        "arg": "maximum-erasure-value",
        "titleUS": "1695 Maximum Erasure Value",
        "titleCN": "1695 删除子数组的最大得分",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Erasure Value"
    },
    {
        "arg": "jump-game-vi",
        "titleUS": "1696 Jump Game VI",
        "titleCN": "1696 跳跃游戏 VI",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Jump Game VI"
    },
    {
        "arg": "checking-existence-of-edge-length-limited-paths",
        "titleUS": "1697 Checking Existence of Edge Length Limited Paths",
        "titleCN": "1697 检查边长度限制的路径是否存在",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Checking Existence of Edge Length Limited Paths"
    },
    {
        "arg": "number-of-distinct-substrings-in-a-string",
        "titleUS": "1698 Number of Distinct Substrings in a String",
        "titleCN": "1698 字符串的不同子字符串个数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Distinct Substrings in a String"
    },
    {
        "arg": "number-of-students-unable-to-eat-lunch",
        "titleUS": "1700 Number of Students Unable to Eat Lunch",
        "titleCN": "1700 无法吃午餐的学生数量",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Students Unable to Eat Lunch"
    },
    {
        "arg": "average-waiting-time",
        "titleUS": "1701 Average Waiting Time",
        "titleCN": "1701 平均等待时间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Average Waiting Time"
    },
    {
        "arg": "maximum-binary-string-after-change",
        "titleUS": "1702 Maximum Binary String After Change",
        "titleCN": "1702 修改后的最大二进制字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Binary String After Change"
    },
    {
        "arg": "minimum-adjacent-swaps-for-k-consecutive-ones",
        "titleUS": "1703 Minimum Adjacent Swaps for K Consecutive Ones",
        "titleCN": "1703 得到连续 K 个 1 的最少相邻交换次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Adjacent Swaps for K Consecutive Ones"
    },
    {
        "arg": "determine-if-string-halves-are-alike",
        "titleUS": "1704 Determine if String Halves Are Alike",
        "titleCN": "1704 判断字符串的两半是否相似",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Determine if String Halves Are Alike"
    },
    {
        "arg": "maximum-number-of-eaten-apples",
        "titleUS": "1705 Maximum Number of Eaten Apples",
        "titleCN": "1705 吃苹果的最大数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Eaten Apples"
    },
    {
        "arg": "where-will-the-ball-fall",
        "titleUS": "1706 Where Will the Ball Fall",
        "titleCN": "1706 球会落何处",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Where Will the Ball Fall"
    },
    {
        "arg": "maximum-xor-with-an-element-from-array",
        "titleUS": "1707 Maximum XOR With an Element From Array",
        "titleCN": "1707 与数组中元素的最大异或值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum XOR With an Element From Array"
    },
    {
        "arg": "largest-subarray-length-k",
        "titleUS": "1708 Largest Subarray Length K",
        "titleCN": "1708 长度为 K 的最大子数组",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Largest Subarray Length K"
    },
    {
        "arg": "maximum-units-on-a-truck",
        "titleUS": "1710 Maximum Units on a Truck",
        "titleCN": "1710 卡车上的最大单元数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Units on a Truck"
    },
    {
        "arg": "count-good-meals",
        "titleUS": "1711 Count Good Meals",
        "titleCN": "1711 大餐计数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Good Meals"
    },
    {
        "arg": "ways-to-split-array-into-three-subarrays",
        "titleUS": "1712 Ways to Split Array Into Three Subarrays",
        "titleCN": "1712 将数组分成三个子数组的方案数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Ways to Split Array Into Three Subarrays"
    },
    {
        "arg": "minimum-operations-to-make-a-subsequence",
        "titleUS": "1713 Minimum Operations to Make a Subsequence",
        "titleCN": "1713 得到子序列的最少操作次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Operations to Make a Subsequence"
    },
    {
        "arg": "sum-of-special-evenly-spaced-elements-in-array",
        "titleUS": "1714 Sum Of Special Evenly-Spaced Elements In Array",
        "titleCN": "1714 数组中特殊等间距元素的和",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Sum Of Special Evenly-Spaced Elements In Array"
    },
    {
        "arg": "calculate-money-in-leetcode-bank",
        "titleUS": "1716 Calculate Money in Leetcode Bank",
        "titleCN": "1716 计算力扣银行的钱",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Calculate Money in Leetcode Bank"
    },
    {
        "arg": "maximum-score-from-removing-substrings",
        "titleUS": "1717 Maximum Score From Removing Substrings",
        "titleCN": "1717 删除子字符串的最大得分",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Score From Removing Substrings"
    },
    {
        "arg": "construct-the-lexicographically-largest-valid-sequence",
        "titleUS": "1718 Construct the Lexicographically Largest Valid Sequence",
        "titleCN": "1718 构建字典序最大的可行序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Construct the Lexicographically Largest Valid Sequence"
    },
    {
        "arg": "number-of-ways-to-reconstruct-a-tree",
        "titleUS": "1719 Number Of Ways To Reconstruct A Tree",
        "titleCN": "1719 重构一棵树的方案数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number Of Ways To Reconstruct A Tree"
    },
    {
        "arg": "decode-xored-array",
        "titleUS": "1720 Decode XORed Array",
        "titleCN": "1720 解码异或后的数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Decode XORed Array"
    },
    {
        "arg": "swapping-nodes-in-a-linked-list",
        "titleUS": "1721 Swapping Nodes in a Linked List",
        "titleCN": "1721 交换链表中的节点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Swapping Nodes in a Linked List"
    },
    {
        "arg": "minimize-hamming-distance-after-swap-operations",
        "titleUS": "1722 Minimize Hamming Distance After Swap Operations",
        "titleCN": "1722 执行交换操作后的最小汉明距离",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimize Hamming Distance After Swap Operations"
    },
    {
        "arg": "find-minimum-time-to-finish-all-jobs",
        "titleUS": "1723 Find Minimum Time to Finish All Jobs",
        "titleCN": "1723 完成所有工作的最短时间",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find Minimum Time to Finish All Jobs"
    },
    {
        "arg": "checking-existence-of-edge-length-limited-paths-ii",
        "titleUS": "1724 Checking Existence of Edge Length Limited Paths II",
        "titleCN": "1724 检查边长度限制的路径是否存在 II",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Checking Existence of Edge Length Limited Paths II"
    },
    {
        "arg": "number-of-rectangles-that-can-form-the-largest-square",
        "titleUS": "1725 Number Of Rectangles That Can Form The Largest Square",
        "titleCN": "1725 可以形成最大正方形的矩形数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number Of Rectangles That Can Form The Largest Square"
    },
    {
        "arg": "tuple-with-same-product",
        "titleUS": "1726 Tuple with Same Product",
        "titleCN": "1726 同积元组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Tuple with Same Product"
    },
    {
        "arg": "largest-submatrix-with-rearrangements",
        "titleUS": "1727 Largest Submatrix With Rearrangements",
        "titleCN": "1727 重新排列后的最大子矩阵",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Largest Submatrix With Rearrangements"
    },
    {
        "arg": "cat-and-mouse-ii",
        "titleUS": "1728 Cat and Mouse II",
        "titleCN": "1728 猫和老鼠 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Cat and Mouse II"
    },
    {
        "arg": "shortest-path-to-get-food",
        "titleUS": "1730 Shortest Path to Get Food",
        "titleCN": "1730 获取食物的最短路径",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Shortest Path to Get Food"
    },
    {
        "arg": "find-the-highest-altitude",
        "titleUS": "1732 Find the Highest Altitude",
        "titleCN": "1732 找到最高海拔",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Highest Altitude"
    },
    {
        "arg": "minimum-number-of-people-to-teach",
        "titleUS": "1733 Minimum Number of People to Teach",
        "titleCN": "1733 需要教语言的最少人数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of People to Teach"
    },
    {
        "arg": "decode-xored-permutation",
        "titleUS": "1734 Decode XORed Permutation",
        "titleCN": "1734 解码异或后的排列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Decode XORed Permutation"
    },
    {
        "arg": "count-ways-to-make-array-with-product",
        "titleUS": "1735 Count Ways to Make Array With Product",
        "titleCN": "1735 生成乘积数组的方案数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Ways to Make Array With Product"
    },
    {
        "arg": "latest-time-by-replacing-hidden-digits",
        "titleUS": "1736 Latest Time by Replacing Hidden Digits",
        "titleCN": "1736 替换隐藏数字得到的最晚时间",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Latest Time by Replacing Hidden Digits"
    },
    {
        "arg": "change-minimum-characters-to-satisfy-one-of-three-conditions",
        "titleUS": "1737 Change Minimum Characters to Satisfy One of Three Conditions",
        "titleCN": "1737 满足三条件之一需改变的最少字符数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Change Minimum Characters to Satisfy One of Three Conditions"
    },
    {
        "arg": "find-kth-largest-xor-coordinate-value",
        "titleUS": "1738 Find Kth Largest XOR Coordinate Value",
        "titleCN": "1738 找出第 K 大的异或坐标值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Kth Largest XOR Coordinate Value"
    },
    {
        "arg": "building-boxes",
        "titleUS": "1739 Building Boxes",
        "titleCN": "1739 放置盒子",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Building Boxes"
    },
    {
        "arg": "find-distance-in-a-binary-tree",
        "titleUS": "1740 Find Distance in a Binary Tree",
        "titleCN": "1740 找到二叉树中的距离",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Find Distance in a Binary Tree"
    },
    {
        "arg": "maximum-number-of-balls-in-a-box",
        "titleUS": "1742 Maximum Number of Balls in a Box",
        "titleCN": "1742 盒子中小球的最大数量",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Number of Balls in a Box"
    },
    {
        "arg": "restore-the-array-from-adjacent-pairs",
        "titleUS": "1743 Restore the Array From Adjacent Pairs",
        "titleCN": "1743 从相邻元素对还原数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Restore the Array From Adjacent Pairs"
    },
    {
        "arg": "can-you-eat-your-favorite-candy-on-your-favorite-day",
        "titleUS": "1744 Can You Eat Your Favorite Candy on Your Favorite Day?",
        "titleCN": "1744 你能在你最喜欢的那天吃到你最喜欢的糖果吗？",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Can You Eat Your Favorite Candy on Your Favorite Day?"
    },
    {
        "arg": "palindrome-partitioning-iv",
        "titleUS": "1745 Palindrome Partitioning IV",
        "titleCN": "1745 分割回文串 IV",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Palindrome Partitioning IV"
    },
    {
        "arg": "maximum-subarray-sum-after-one-operation",
        "titleUS": "1746 Maximum Subarray Sum After One Operation",
        "titleCN": "1746 经过一次操作后的最大子数组和",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Subarray Sum After One Operation"
    },
    {
        "arg": "sum-of-unique-elements",
        "titleUS": "1748 Sum of Unique Elements",
        "titleCN": "1748 唯一元素的和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sum of Unique Elements"
    },
    {
        "arg": "maximum-absolute-sum-of-any-subarray",
        "titleUS": "1749 Maximum Absolute Sum of Any Subarray",
        "titleCN": "1749 任意子数组和的绝对值的最大值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Absolute Sum of Any Subarray"
    },
    {
        "arg": "minimum-length-of-string-after-deleting-similar-ends",
        "titleUS": "1750 Minimum Length of String After Deleting Similar Ends",
        "titleCN": "1750 删除字符串两端相同字符后的最短长度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Length of String After Deleting Similar Ends"
    },
    {
        "arg": "maximum-number-of-events-that-can-be-attended-ii",
        "titleUS": "1751 Maximum Number of Events That Can Be Attended II",
        "titleCN": "1751 最多可以参加的会议数目 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Number of Events That Can Be Attended II"
    },
    {
        "arg": "check-if-array-is-sorted-and-rotated",
        "titleUS": "1752 Check if Array Is Sorted and Rotated",
        "titleCN": "1752 检查数组是否经排序和轮转得到",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if Array Is Sorted and Rotated"
    },
    {
        "arg": "maximum-score-from-removing-stones",
        "titleUS": "1753 Maximum Score From Removing Stones",
        "titleCN": "1753 移除石子的最大得分",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Score From Removing Stones"
    },
    {
        "arg": "largest-merge-of-two-strings",
        "titleUS": "1754 Largest Merge Of Two Strings",
        "titleCN": "1754 构造字典序最大的合并字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Largest Merge Of Two Strings"
    },
    {
        "arg": "closest-subsequence-sum",
        "titleUS": "1755 Closest Subsequence Sum",
        "titleCN": "1755 最接近目标值的子序列和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Closest Subsequence Sum"
    },
    {
        "arg": "design-most-recently-used-queue",
        "titleUS": "1756 Design Most Recently Used Queue",
        "titleCN": "1756 设计最近使用（MRU）队列",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Design Most Recently Used Queue"
    },
    {
        "arg": "minimum-changes-to-make-alternating-binary-string",
        "titleUS": "1758 Minimum Changes To Make Alternating Binary String",
        "titleCN": "1758 生成交替二进制字符串的最少操作数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Changes To Make Alternating Binary String"
    },
    {
        "arg": "count-number-of-homogenous-substrings",
        "titleUS": "1759 Count Number of Homogenous Substrings",
        "titleCN": "1759 统计同质子字符串的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Number of Homogenous Substrings"
    },
    {
        "arg": "minimum-limit-of-balls-in-a-bag",
        "titleUS": "1760 Minimum Limit of Balls in a Bag",
        "titleCN": "1760 袋子里最少数目的球",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Limit of Balls in a Bag"
    },
    {
        "arg": "minimum-degree-of-a-connected-trio-in-a-graph",
        "titleUS": "1761 Minimum Degree of a Connected Trio in a Graph",
        "titleCN": "1761 一个图中连通三元组的最小度数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Degree of a Connected Trio in a Graph"
    },
    {
        "arg": "buildings-with-an-ocean-view",
        "titleUS": "1762 Buildings With an Ocean View",
        "titleCN": "1762 能看到海景的建筑物",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Buildings With an Ocean View"
    },
    {
        "arg": "longest-nice-substring",
        "titleUS": "1763 Longest Nice Substring",
        "titleCN": "1763 最长的美好子字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Longest Nice Substring"
    },
    {
        "arg": "form-array-by-concatenating-subarrays-of-another-array",
        "titleUS": "1764 Form Array by Concatenating Subarrays of Another Array",
        "titleCN": "1764 通过连接另一个数组的子数组得到一个数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Form Array by Concatenating Subarrays of Another Array"
    },
    {
        "arg": "map-of-highest-peak",
        "titleUS": "1765 Map of Highest Peak",
        "titleCN": "1765 地图中的最高点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Map of Highest Peak"
    },
    {
        "arg": "tree-of-coprimes",
        "titleUS": "1766 Tree of Coprimes",
        "titleCN": "1766 互质树",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Tree of Coprimes"
    },
    {
        "arg": "merge-strings-alternately",
        "titleUS": "1768 Merge Strings Alternately",
        "titleCN": "1768 交替合并字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Merge Strings Alternately"
    },
    {
        "arg": "minimum-number-of-operations-to-move-all-balls-to-each-box",
        "titleUS": "1769 Minimum Number of Operations to Move All Balls to Each Box",
        "titleCN": "1769 移动所有球到每个盒子所需的最小操作数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Operations to Move All Balls to Each Box"
    },
    {
        "arg": "maximum-score-from-performing-multiplication-operations",
        "titleUS": "1770 Maximum Score from Performing Multiplication Operations",
        "titleCN": "1770 执行乘法运算的最大分数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Score from Performing Multiplication Operations"
    },
    {
        "arg": "maximize-palindrome-length-from-subsequences",
        "titleUS": "1771 Maximize Palindrome Length From Subsequences",
        "titleCN": "1771 由子序列构造的最长回文串的长度",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximize Palindrome Length From Subsequences"
    },
    {
        "arg": "sort-features-by-popularity",
        "titleUS": "1772 Sort Features by Popularity",
        "titleCN": "1772 按受欢迎程度排列功能",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Sort Features by Popularity"
    },
    {
        "arg": "count-items-matching-a-rule",
        "titleUS": "1773 Count Items Matching a Rule",
        "titleCN": "1773 统计匹配检索规则的物品数量",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Items Matching a Rule"
    },
    {
        "arg": "closest-dessert-cost",
        "titleUS": "1774 Closest Dessert Cost",
        "titleCN": "1774 最接近目标价格的甜点成本",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Closest Dessert Cost"
    },
    {
        "arg": "equal-sum-arrays-with-minimum-number-of-operations",
        "titleUS": "1775 Equal Sum Arrays With Minimum Number of Operations",
        "titleCN": "1775 通过最少操作次数使数组的和相等",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Equal Sum Arrays With Minimum Number of Operations"
    },
    {
        "arg": "car-fleet-ii",
        "titleUS": "1776 Car Fleet II",
        "titleCN": "1776 车队 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Car Fleet II"
    },
    {
        "arg": "shortest-path-in-a-hidden-grid",
        "titleUS": "1778 Shortest Path in a Hidden Grid",
        "titleCN": "1778 未知网格中的最短路径",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Shortest Path in a Hidden Grid"
    },
    {
        "arg": "find-nearest-point-that-has-the-same-x-or-y-coordinate",
        "titleUS": "1779 Find Nearest Point That Has the Same X or Y Coordinate",
        "titleCN": "1779 找到最近的有相同 X 或 Y 坐标的点",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Nearest Point That Has the Same X or Y Coordinate"
    },
    {
        "arg": "check-if-number-is-a-sum-of-powers-of-three",
        "titleUS": "1780 Check if Number is a Sum of Powers of Three",
        "titleCN": "1780 判断一个数字是否可以表示成三的幂的和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Check if Number is a Sum of Powers of Three"
    },
    {
        "arg": "sum-of-beauty-of-all-substrings",
        "titleUS": "1781 Sum of Beauty of All Substrings",
        "titleCN": "1781 所有子字符串美丽值之和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum of Beauty of All Substrings"
    },
    {
        "arg": "count-pairs-of-nodes",
        "titleUS": "1782 Count Pairs Of Nodes",
        "titleCN": "1782 统计点对的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Pairs Of Nodes"
    },
    {
        "arg": "check-if-binary-string-has-at-most-one-segment-of-ones",
        "titleUS": "1784 Check if Binary String Has at Most One Segment of Ones",
        "titleCN": "1784 检查二进制字符串字段",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if Binary String Has at Most One Segment of Ones"
    },
    {
        "arg": "minimum-elements-to-add-to-form-a-given-sum",
        "titleUS": "1785 Minimum Elements to Add to Form a Given Sum",
        "titleCN": "1785 构成特定和需要添加的最少元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Elements to Add to Form a Given Sum"
    },
    {
        "arg": "number-of-restricted-paths-from-first-to-last-node",
        "titleUS": "1786 Number of Restricted Paths From First to Last Node",
        "titleCN": "1786 从第一个节点出发到最后一个节点的受限路径数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Restricted Paths From First to Last Node"
    },
    {
        "arg": "make-the-xor-of-all-segments-equal-to-zero",
        "titleUS": "1787 Make the XOR of All Segments Equal to Zero",
        "titleCN": "1787 使所有区间的异或结果为零",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Make the XOR of All Segments Equal to Zero"
    },
    {
        "arg": "maximize-the-beauty-of-the-garden",
        "titleUS": "1788 Maximize the Beauty of the Garden",
        "titleCN": "1788 最大化花园的美观度",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Maximize the Beauty of the Garden"
    },
    {
        "arg": "check-if-one-string-swap-can-make-strings-equal",
        "titleUS": "1790 Check if One String Swap Can Make Strings Equal",
        "titleCN": "1790 仅执行一次字符串交换能否使两个字符串相等",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if One String Swap Can Make Strings Equal"
    },
    {
        "arg": "find-center-of-star-graph",
        "titleUS": "1791 Find Center of Star Graph",
        "titleCN": "1791 找出星型图的中心节点",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Center of Star Graph"
    },
    {
        "arg": "maximum-average-pass-ratio",
        "titleUS": "1792 Maximum Average Pass Ratio",
        "titleCN": "1792 最大平均通过率",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Average Pass Ratio"
    },
    {
        "arg": "maximum-score-of-a-good-subarray",
        "titleUS": "1793 Maximum Score of a Good Subarray",
        "titleCN": "1793 好子数组的最大分数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Score of a Good Subarray"
    },
    {
        "arg": "count-pairs-of-equal-substrings-with-minimum-difference",
        "titleUS": "1794 Count Pairs of Equal Substrings With Minimum Difference",
        "titleCN": "1794 统计距离最小的子串对个数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Count Pairs of Equal Substrings With Minimum Difference"
    },
    {
        "arg": "second-largest-digit-in-a-string",
        "titleUS": "1796 Second Largest Digit in a String",
        "titleCN": "1796 字符串中第二大的数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Second Largest Digit in a String"
    },
    {
        "arg": "design-authentication-manager",
        "titleUS": "1797 Design Authentication Manager",
        "titleCN": "1797 设计一个验证系统",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Design Authentication Manager"
    },
    {
        "arg": "maximum-number-of-consecutive-values-you-can-make",
        "titleUS": "1798 Maximum Number of Consecutive Values You Can Make",
        "titleCN": "1798 你能构造出连续值的最大数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Consecutive Values You Can Make"
    },
    {
        "arg": "maximize-score-after-n-operations",
        "titleUS": "1799 Maximize Score After N Operations",
        "titleCN": "1799 N 次操作后的最大分数和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximize Score After N Operations"
    },
    {
        "arg": "maximum-ascending-subarray-sum",
        "titleUS": "1800 Maximum Ascending Subarray Sum",
        "titleCN": "1800 最大升序子数组和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Ascending Subarray Sum"
    },
    {
        "arg": "number-of-orders-in-the-backlog",
        "titleUS": "1801 Number of Orders in the Backlog",
        "titleCN": "1801 积压订单中的订单总数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Orders in the Backlog"
    },
    {
        "arg": "maximum-value-at-a-given-index-in-a-bounded-array",
        "titleUS": "1802 Maximum Value at a Given Index in a Bounded Array",
        "titleCN": "1802 有界数组中指定下标处的最大值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Value at a Given Index in a Bounded Array"
    },
    {
        "arg": "count-pairs-with-xor-in-a-range",
        "titleUS": "1803 Count Pairs With XOR in a Range",
        "titleCN": "1803 统计异或值在范围内的数对有多少",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Pairs With XOR in a Range"
    },
    {
        "arg": "implement-trie-ii-prefix-tree",
        "titleUS": "1804 Implement Trie II (Prefix Tree)",
        "titleCN": "1804 实现 Trie （前缀树） II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Implement Trie II (Prefix Tree)"
    },
    {
        "arg": "number-of-different-integers-in-a-string",
        "titleUS": "1805 Number of Different Integers in a String",
        "titleCN": "1805 字符串中不同整数的数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Different Integers in a String"
    },
    {
        "arg": "minimum-number-of-operations-to-reinitialize-a-permutation",
        "titleUS": "1806 Minimum Number of Operations to Reinitialize a Permutation",
        "titleCN": "1806 还原排列的最少操作步数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Operations to Reinitialize a Permutation"
    },
    {
        "arg": "evaluate-the-bracket-pairs-of-a-string",
        "titleUS": "1807 Evaluate the Bracket Pairs of a String",
        "titleCN": "1807 替换字符串中的括号内容",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Evaluate the Bracket Pairs of a String"
    },
    {
        "arg": "maximize-number-of-nice-divisors",
        "titleUS": "1808 Maximize Number of Nice Divisors",
        "titleCN": "1808 好因子的最大数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximize Number of Nice Divisors"
    },
    {
        "arg": "minimum-path-cost-in-a-hidden-grid",
        "titleUS": "1810 Minimum Path Cost in a Hidden Grid",
        "titleCN": "1810 隐藏网格下的最小消耗路径",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimum Path Cost in a Hidden Grid"
    },
    {
        "arg": "determine-color-of-a-chessboard-square",
        "titleUS": "1812 Determine Color of a Chessboard Square",
        "titleCN": "1812 判断国际象棋棋盘中一个格子的颜色",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Determine Color of a Chessboard Square"
    },
    {
        "arg": "sentence-similarity-iii",
        "titleUS": "1813 Sentence Similarity III",
        "titleCN": "1813 句子相似性 III",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sentence Similarity III"
    },
    {
        "arg": "count-nice-pairs-in-an-array",
        "titleUS": "1814 Count Nice Pairs in an Array",
        "titleCN": "1814 统计一个数组中好对子的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Nice Pairs in an Array"
    },
    {
        "arg": "maximum-number-of-groups-getting-fresh-donuts",
        "titleUS": "1815 Maximum Number of Groups Getting Fresh Donuts",
        "titleCN": "1815 得到新鲜甜甜圈的最多组数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Number of Groups Getting Fresh Donuts"
    },
    {
        "arg": "truncate-sentence",
        "titleUS": "1816 Truncate Sentence",
        "titleCN": "1816 截断句子",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Truncate Sentence"
    },
    {
        "arg": "finding-the-users-active-minutes",
        "titleUS": "1817 Finding the Users Active Minutes",
        "titleCN": "1817 查找用户活跃分钟数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Finding the Users Active Minutes"
    },
    {
        "arg": "minimum-absolute-sum-difference",
        "titleUS": "1818 Minimum Absolute Sum Difference",
        "titleCN": "1818 绝对差值和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Absolute Sum Difference"
    },
    {
        "arg": "number-of-different-subsequences-gcds",
        "titleUS": "1819 Number of Different Subsequences GCDs",
        "titleCN": "1819 序列中不同最大公约数的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Different Subsequences GCDs"
    },
    {
        "arg": "maximum-number-of-accepted-invitations",
        "titleUS": "1820 Maximum Number of Accepted Invitations",
        "titleCN": "1820 最多邀请的个数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Number of Accepted Invitations"
    },
    {
        "arg": "sign-of-the-product-of-an-array",
        "titleUS": "1822 Sign of the Product of an Array",
        "titleCN": "1822 数组元素积的符号",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sign of the Product of an Array"
    },
    {
        "arg": "find-the-winner-of-the-circular-game",
        "titleUS": "1823 Find the Winner of the Circular Game",
        "titleCN": "1823 找出游戏的获胜者",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Winner of the Circular Game"
    },
    {
        "arg": "minimum-sideway-jumps",
        "titleUS": "1824 Minimum Sideway Jumps",
        "titleCN": "1824 最少侧跳次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Sideway Jumps"
    },
    {
        "arg": "finding-mk-average",
        "titleUS": "1825 Finding MK Average",
        "titleCN": "1825 求出 MK 平均值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Finding MK Average"
    },
    {
        "arg": "faulty-sensor",
        "titleUS": "1826 Faulty Sensor",
        "titleCN": "1826 有缺陷的传感器",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Faulty Sensor"
    },
    {
        "arg": "minimum-operations-to-make-the-array-increasing",
        "titleUS": "1827 Minimum Operations to Make the Array Increasing",
        "titleCN": "1827 最少操作使数组递增",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Operations to Make the Array Increasing"
    },
    {
        "arg": "queries-on-number-of-points-inside-a-circle",
        "titleUS": "1828 Queries on Number of Points Inside a Circle",
        "titleCN": "1828 统计一个圆中点的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Queries on Number of Points Inside a Circle"
    },
    {
        "arg": "maximum-xor-for-each-query",
        "titleUS": "1829 Maximum XOR for Each Query",
        "titleCN": "1829 每个查询的最大异或值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum XOR for Each Query"
    },
    {
        "arg": "minimum-number-of-operations-to-make-string-sorted",
        "titleUS": "1830 Minimum Number of Operations to Make String Sorted",
        "titleCN": "1830 使字符串有序的最少操作次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Number of Operations to Make String Sorted"
    },
    {
        "arg": "check-if-the-sentence-is-pangram",
        "titleUS": "1832 Check if the Sentence Is Pangram",
        "titleCN": "1832 判断句子是否为全字母句",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if the Sentence Is Pangram"
    },
    {
        "arg": "maximum-ice-cream-bars",
        "titleUS": "1833 Maximum Ice Cream Bars",
        "titleCN": "1833 雪糕的最大数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Ice Cream Bars"
    },
    {
        "arg": "single-threaded-cpu",
        "titleUS": "1834 Single-Threaded CPU",
        "titleCN": "1834 单线程 CPU",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Single-Threaded CPU"
    },
    {
        "arg": "find-xor-sum-of-all-pairs-bitwise-and",
        "titleUS": "1835 Find XOR Sum of All Pairs Bitwise AND",
        "titleCN": "1835 所有数对按位与结果的异或和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find XOR Sum of All Pairs Bitwise AND"
    },
    {
        "arg": "remove-duplicates-from-an-unsorted-linked-list",
        "titleUS": "1836 Remove Duplicates From an Unsorted Linked List",
        "titleCN": "1836 从未排序的链表中移除重复元素",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Remove Duplicates From an Unsorted Linked List"
    },
    {
        "arg": "sum-of-digits-in-base-k",
        "titleUS": "1837 Sum of Digits in Base K",
        "titleCN": "1837 K 进制表示下的各位数字总和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sum of Digits in Base K"
    },
    {
        "arg": "frequency-of-the-most-frequent-element",
        "titleUS": "1838 Frequency of the Most Frequent Element",
        "titleCN": "1838 最高频元素的频数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Frequency of the Most Frequent Element"
    },
    {
        "arg": "longest-substring-of-all-vowels-in-order",
        "titleUS": "1839 Longest Substring Of All Vowels in Order",
        "titleCN": "1839 所有元音按顺序排布的最长子字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Substring Of All Vowels in Order"
    },
    {
        "arg": "maximum-building-height",
        "titleUS": "1840 Maximum Building Height",
        "titleCN": "1840 最高建筑高度",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Building Height"
    },
    {
        "arg": "next-palindrome-using-same-digits",
        "titleUS": "1842 Next Palindrome Using Same Digits",
        "titleCN": "1842 下个由相同数字构成的回文串",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Next Palindrome Using Same Digits"
    },
    {
        "arg": "replace-all-digits-with-characters",
        "titleUS": "1844 Replace All Digits with Characters",
        "titleCN": "1844 将所有数字用字符替换",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Replace All Digits with Characters"
    },
    {
        "arg": "seat-reservation-manager",
        "titleUS": "1845 Seat Reservation Manager",
        "titleCN": "1845 座位预约管理系统",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Seat Reservation Manager"
    },
    {
        "arg": "maximum-element-after-decreasing-and-rearranging",
        "titleUS": "1846 Maximum Element After Decreasing and Rearranging",
        "titleCN": "1846 减小和重新排列数组后的最大元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Element After Decreasing and Rearranging"
    },
    {
        "arg": "closest-room",
        "titleUS": "1847 Closest Room",
        "titleCN": "1847 最近的房间",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Closest Room"
    },
    {
        "arg": "minimum-distance-to-the-target-element",
        "titleUS": "1848 Minimum Distance to the Target Element",
        "titleCN": "1848 到目标元素的最小距离",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Distance to the Target Element"
    },
    {
        "arg": "splitting-a-string-into-descending-consecutive-values",
        "titleUS": "1849 Splitting a String Into Descending Consecutive Values",
        "titleCN": "1849 将字符串拆分为递减的连续值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Splitting a String Into Descending Consecutive Values"
    },
    {
        "arg": "minimum-adjacent-swaps-to-reach-the-kth-smallest-number",
        "titleUS": "1850 Minimum Adjacent Swaps to Reach the Kth Smallest Number",
        "titleCN": "1850 邻位交换的最小次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Adjacent Swaps to Reach the Kth Smallest Number"
    },
    {
        "arg": "minimum-interval-to-include-each-query",
        "titleUS": "1851 Minimum Interval to Include Each Query",
        "titleCN": "1851 包含每个查询的最小区间",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Interval to Include Each Query"
    },
    {
        "arg": "distinct-numbers-in-each-subarray",
        "titleUS": "1852 Distinct Numbers in Each Subarray",
        "titleCN": "1852 每个子数组的数字种类数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Distinct Numbers in Each Subarray"
    },
    {
        "arg": "maximum-population-year",
        "titleUS": "1854 Maximum Population Year",
        "titleCN": "1854 人口最多的年份",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Population Year"
    },
    {
        "arg": "maximum-distance-between-a-pair-of-values",
        "titleUS": "1855 Maximum Distance Between a Pair of Values",
        "titleCN": "1855 下标对中的最大距离",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Distance Between a Pair of Values"
    },
    {
        "arg": "maximum-subarray-min-product",
        "titleUS": "1856 Maximum Subarray Min-Product",
        "titleCN": "1856 子数组最小乘积的最大值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Subarray Min-Product"
    },
    {
        "arg": "largest-color-value-in-a-directed-graph",
        "titleUS": "1857 Largest Color Value in a Directed Graph",
        "titleCN": "1857 有向图中最大颜色值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Largest Color Value in a Directed Graph"
    },
    {
        "arg": "longest-word-with-all-prefixes",
        "titleUS": "1858 Longest Word With All Prefixes",
        "titleCN": "1858 包含所有前缀的最长单词",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Longest Word With All Prefixes"
    },
    {
        "arg": "sorting-the-sentence",
        "titleUS": "1859 Sorting the Sentence",
        "titleCN": "1859 将句子排序",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sorting the Sentence"
    },
    {
        "arg": "incremental-memory-leak",
        "titleUS": "1860 Incremental Memory Leak",
        "titleCN": "1860 增长的内存泄露",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Incremental Memory Leak"
    },
    {
        "arg": "rotating-the-box",
        "titleUS": "1861 Rotating the Box",
        "titleCN": "1861 旋转盒子",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Rotating the Box"
    },
    {
        "arg": "sum-of-floored-pairs",
        "titleUS": "1862 Sum of Floored Pairs",
        "titleCN": "1862 向下取整数对和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Sum of Floored Pairs"
    },
    {
        "arg": "sum-of-all-subset-xor-totals",
        "titleUS": "1863 Sum of All Subset XOR Totals",
        "titleCN": "1863 找出所有子集的异或总和再求和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sum of All Subset XOR Totals"
    },
    {
        "arg": "minimum-number-of-swaps-to-make-the-binary-string-alternating",
        "titleUS": "1864 Minimum Number of Swaps to Make the Binary String Alternating",
        "titleCN": "1864 构成交替字符串需要的最小交换次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Swaps to Make the Binary String Alternating"
    },
    {
        "arg": "finding-pairs-with-a-certain-sum",
        "titleUS": "1865 Finding Pairs With a Certain Sum",
        "titleCN": "1865 找出和为指定值的下标对",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Finding Pairs With a Certain Sum"
    },
    {
        "arg": "number-of-ways-to-rearrange-sticks-with-k-sticks-visible",
        "titleUS": "1866 Number of Ways to Rearrange Sticks With K Sticks Visible",
        "titleCN": "1866 恰有 K 根木棍可以看到的排列数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Ways to Rearrange Sticks With K Sticks Visible"
    },
    {
        "arg": "product-of-two-run-length-encoded-arrays",
        "titleUS": "1868 Product of Two Run-Length Encoded Arrays",
        "titleCN": "1868 两个行程编码数组的积",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Product of Two Run-Length Encoded Arrays"
    },
    {
        "arg": "longer-contiguous-segments-of-ones-than-zeros",
        "titleUS": "1869 Longer Contiguous Segments of Ones than Zeros",
        "titleCN": "1869 哪种连续子字符串更长",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Longer Contiguous Segments of Ones than Zeros"
    },
    {
        "arg": "minimum-speed-to-arrive-on-time",
        "titleUS": "1870 Minimum Speed to Arrive on Time",
        "titleCN": "1870 准时到达的列车最小时速",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Speed to Arrive on Time"
    },
    {
        "arg": "jump-game-vii",
        "titleUS": "1871 Jump Game VII",
        "titleCN": "1871 跳跃游戏 VII",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Jump Game VII"
    },
    {
        "arg": "stone-game-viii",
        "titleUS": "1872 Stone Game VIII",
        "titleCN": "1872 石子游戏 VIII",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Stone Game VIII"
    },
    {
        "arg": "minimize-product-sum-of-two-arrays",
        "titleUS": "1874 Minimize Product Sum of Two Arrays",
        "titleCN": "1874 两个数组的最小乘积和",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimize Product Sum of Two Arrays"
    },
    {
        "arg": "substrings-of-size-three-with-distinct-characters",
        "titleUS": "1876 Substrings of Size Three with Distinct Characters",
        "titleCN": "1876 长度为三且各字符不同的子字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Substrings of Size Three with Distinct Characters"
    },
    {
        "arg": "minimize-maximum-pair-sum-in-array",
        "titleUS": "1877 Minimize Maximum Pair Sum in Array",
        "titleCN": "1877 数组中最大数对和的最小值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimize Maximum Pair Sum in Array"
    },
    {
        "arg": "get-biggest-three-rhombus-sums-in-a-grid",
        "titleUS": "1878 Get Biggest Three Rhombus Sums in a Grid",
        "titleCN": "1878 矩阵中最大的三个菱形和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Get Biggest Three Rhombus Sums in a Grid"
    },
    {
        "arg": "minimum-xor-sum-of-two-arrays",
        "titleUS": "1879 Minimum XOR Sum of Two Arrays",
        "titleCN": "1879 两个数组最小的异或值之和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum XOR Sum of Two Arrays"
    },
    {
        "arg": "check-if-word-equals-summation-of-two-words",
        "titleUS": "1880 Check if Word Equals Summation of Two Words",
        "titleCN": "1880 检查某单词是否等于两单词之和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if Word Equals Summation of Two Words"
    },
    {
        "arg": "maximum-value-after-insertion",
        "titleUS": "1881 Maximum Value after Insertion",
        "titleCN": "1881 插入后的最大值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Value after Insertion"
    },
    {
        "arg": "process-tasks-using-servers",
        "titleUS": "1882 Process Tasks Using Servers",
        "titleCN": "1882 使用服务器处理任务",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Process Tasks Using Servers"
    },
    {
        "arg": "minimum-skips-to-arrive-at-meeting-on-time",
        "titleUS": "1883 Minimum Skips to Arrive at Meeting On Time",
        "titleCN": "1883 准时抵达会议现场的最小跳过休息次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Skips to Arrive at Meeting On Time"
    },
    {
        "arg": "egg-drop-with-2-eggs-and-n-floors",
        "titleUS": "1884 Egg Drop With 2 Eggs and N Floors",
        "titleCN": "1884 鸡蛋掉落-两枚鸡蛋",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Egg Drop With 2 Eggs and N Floors"
    },
    {
        "arg": "count-pairs-in-two-arrays",
        "titleUS": "1885 Count Pairs in Two Arrays",
        "titleCN": "1885 统计数对",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Count Pairs in Two Arrays"
    },
    {
        "arg": "determine-whether-matrix-can-be-obtained-by-rotation",
        "titleUS": "1886 Determine Whether Matrix Can Be Obtained By Rotation",
        "titleCN": "1886 判断矩阵经轮转后是否一致",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Determine Whether Matrix Can Be Obtained By Rotation"
    },
    {
        "arg": "reduction-operations-to-make-the-array-elements-equal",
        "titleUS": "1887 Reduction Operations to Make the Array Elements Equal",
        "titleCN": "1887 使数组元素相等的减少操作次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reduction Operations to Make the Array Elements Equal"
    },
    {
        "arg": "minimum-number-of-flips-to-make-the-binary-string-alternating",
        "titleUS": "1888 Minimum Number of Flips to Make the Binary String Alternating",
        "titleCN": "1888 使二进制字符串字符交替的最少反转次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Flips to Make the Binary String Alternating"
    },
    {
        "arg": "minimum-space-wasted-from-packaging",
        "titleUS": "1889 Minimum Space Wasted From Packaging",
        "titleCN": "1889 装包裹的最小浪费空间",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Space Wasted From Packaging"
    },
    {
        "arg": "cutting-ribbons",
        "titleUS": "1891 Cutting Ribbons",
        "titleCN": "1891 割绳子",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Cutting Ribbons"
    },
    {
        "arg": "check-if-all-the-integers-in-a-range-are-covered",
        "titleUS": "1893 Check if All the Integers in a Range Are Covered",
        "titleCN": "1893 检查是否区域内所有整数都被覆盖",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if All the Integers in a Range Are Covered"
    },
    {
        "arg": "find-the-student-that-will-replace-the-chalk",
        "titleUS": "1894 Find the Student that Will Replace the Chalk",
        "titleCN": "1894 找到需要补充粉笔的学生编号",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Student that Will Replace the Chalk"
    },
    {
        "arg": "largest-magic-square",
        "titleUS": "1895 Largest Magic Square",
        "titleCN": "1895 最大的幻方",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Largest Magic Square"
    },
    {
        "arg": "minimum-cost-to-change-the-final-value-of-expression",
        "titleUS": "1896 Minimum Cost to Change the Final Value of Expression",
        "titleCN": "1896 反转表达式值的最少操作次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Cost to Change the Final Value of Expression"
    },
    {
        "arg": "redistribute-characters-to-make-all-strings-equal",
        "titleUS": "1897 Redistribute Characters to Make All Strings Equal",
        "titleCN": "1897 重新分配字符使所有字符串都相等",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Redistribute Characters to Make All Strings Equal"
    },
    {
        "arg": "maximum-number-of-removable-characters",
        "titleUS": "1898 Maximum Number of Removable Characters",
        "titleCN": "1898 可移除字符的最大数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Removable Characters"
    },
    {
        "arg": "merge-triplets-to-form-target-triplet",
        "titleUS": "1899 Merge Triplets to Form Target Triplet",
        "titleCN": "1899 合并若干三元组以形成目标三元组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Merge Triplets to Form Target Triplet"
    },
    {
        "arg": "the-earliest-and-latest-rounds-where-players-compete",
        "titleUS": "1900 The Earliest and Latest Rounds Where Players Compete",
        "titleCN": "1900 最佳运动员的比拼回合",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 The Earliest and Latest Rounds Where Players Compete"
    },
    {
        "arg": "find-a-peak-element-ii",
        "titleUS": "1901 Find a Peak Element II",
        "titleCN": "1901 寻找峰值 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find a Peak Element II"
    },
    {
        "arg": "depth-of-bst-given-insertion-order",
        "titleUS": "1902 Depth of BST Given Insertion Order",
        "titleCN": "1902 给定二叉搜索树的插入顺序求深度",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Depth of BST Given Insertion Order"
    },
    {
        "arg": "largest-odd-number-in-string",
        "titleUS": "1903 Largest Odd Number in String",
        "titleCN": "1903 字符串中的最大奇数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Largest Odd Number in String"
    },
    {
        "arg": "the-number-of-full-rounds-you-have-played",
        "titleUS": "1904 The Number of Full Rounds You Have Played",
        "titleCN": "1904 你完成的完整对局数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 The Number of Full Rounds You Have Played"
    },
    {
        "arg": "count-sub-islands",
        "titleUS": "1905 Count Sub Islands",
        "titleCN": "1905 统计子岛屿",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Sub Islands"
    },
    {
        "arg": "minimum-absolute-difference-queries",
        "titleUS": "1906 Minimum Absolute Difference Queries",
        "titleCN": "1906 查询差绝对值的最小值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Absolute Difference Queries"
    },
    {
        "arg": "game-of-nim",
        "titleUS": "1908 Game of Nim",
        "titleCN": "1908 Nim 游戏 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Game of Nim"
    },
    {
        "arg": "remove-one-element-to-make-the-array-strictly-increasing",
        "titleUS": "1909 Remove One Element to Make the Array Strictly Increasing",
        "titleCN": "1909 删除一个元素使数组严格递增",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Remove One Element to Make the Array Strictly Increasing"
    },
    {
        "arg": "remove-all-occurrences-of-a-substring",
        "titleUS": "1910 Remove All Occurrences of a Substring",
        "titleCN": "1910 删除一个字符串中所有出现的给定子字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Remove All Occurrences of a Substring"
    },
    {
        "arg": "maximum-alternating-subsequence-sum",
        "titleUS": "1911 Maximum Alternating Subsequence Sum",
        "titleCN": "1911 最大子序列交替和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Alternating Subsequence Sum"
    },
    {
        "arg": "design-movie-rental-system",
        "titleUS": "1912 Design Movie Rental System",
        "titleCN": "1912 设计电影租借系统",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Design Movie Rental System"
    },
    {
        "arg": "maximum-product-difference-between-two-pairs",
        "titleUS": "1913 Maximum Product Difference Between Two Pairs",
        "titleCN": "1913 两个数对之间的最大乘积差",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Product Difference Between Two Pairs"
    },
    {
        "arg": "cyclically-rotating-a-grid",
        "titleUS": "1914 Cyclically Rotating a Grid",
        "titleCN": "1914 循环轮转矩阵",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Cyclically Rotating a Grid"
    },
    {
        "arg": "number-of-wonderful-substrings",
        "titleUS": "1915 Number of Wonderful Substrings",
        "titleCN": "1915 最美子字符串的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Wonderful Substrings"
    },
    {
        "arg": "count-ways-to-build-rooms-in-an-ant-colony",
        "titleUS": "1916 Count Ways to Build Rooms in an Ant Colony",
        "titleCN": "1916 统计为蚁群构筑房间的不同顺序",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Ways to Build Rooms in an Ant Colony"
    },
    {
        "arg": "kth-smallest-subarray-sum",
        "titleUS": "1918 Kth Smallest Subarray Sum",
        "titleCN": "1918 第 K 小的子数组和·",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Kth Smallest Subarray Sum"
    },
    {
        "arg": "build-array-from-permutation",
        "titleUS": "1920 Build Array from Permutation",
        "titleCN": "1920 基于排列构建数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Build Array from Permutation"
    },
    {
        "arg": "eliminate-maximum-number-of-monsters",
        "titleUS": "1921 Eliminate Maximum Number of Monsters",
        "titleCN": "1921 消灭怪物的最大数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Eliminate Maximum Number of Monsters"
    },
    {
        "arg": "count-good-numbers",
        "titleUS": "1922 Count Good Numbers",
        "titleCN": "1922 统计好数字的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Good Numbers"
    },
    {
        "arg": "longest-common-subpath",
        "titleUS": "1923 Longest Common Subpath",
        "titleCN": "1923 最长公共子路径",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Longest Common Subpath"
    },
    {
        "arg": "erect-the-fence-ii",
        "titleUS": "1924 Erect the Fence II",
        "titleCN": "1924 安装栅栏 II",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Erect the Fence II"
    },
    {
        "arg": "count-square-sum-triples",
        "titleUS": "1925 Count Square Sum Triples",
        "titleCN": "1925 统计平方和三元组的数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Square Sum Triples"
    },
    {
        "arg": "nearest-exit-from-entrance-in-maze",
        "titleUS": "1926 Nearest Exit from Entrance in Maze",
        "titleCN": "1926 迷宫中离入口最近的出口",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Nearest Exit from Entrance in Maze"
    },
    {
        "arg": "sum-game",
        "titleUS": "1927 Sum Game",
        "titleCN": "1927 求和游戏",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum Game"
    },
    {
        "arg": "minimum-cost-to-reach-destination-in-time",
        "titleUS": "1928 Minimum Cost to Reach Destination in Time",
        "titleCN": "1928 规定时间内到达终点的最小花费",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Cost to Reach Destination in Time"
    },
    {
        "arg": "concatenation-of-array",
        "titleUS": "1929 Concatenation of Array",
        "titleCN": "1929 数组串联",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Concatenation of Array"
    },
    {
        "arg": "unique-length-3-palindromic-subsequences",
        "titleUS": "1930 Unique Length-3 Palindromic Subsequences",
        "titleCN": "1930 长度为 3 的不同回文子序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Unique Length-3 Palindromic Subsequences"
    },
    {
        "arg": "painting-a-grid-with-three-different-colors",
        "titleUS": "1931 Painting a Grid With Three Different Colors",
        "titleCN": "1931 用三种不同颜色为网格涂色",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Painting a Grid With Three Different Colors"
    },
    {
        "arg": "merge-bsts-to-create-single-bst",
        "titleUS": "1932 Merge BSTs to Create Single BST",
        "titleCN": "1932 合并多棵二叉搜索树",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Merge BSTs to Create Single BST"
    },
    {
        "arg": "check-if-string-is-decomposable-into-value-equal-substrings",
        "titleUS": "1933 Check if String Is Decomposable Into Value-Equal Substrings",
        "titleCN": "1933 判断字符串是否可分解为值均等的子串",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Check if String Is Decomposable Into Value-Equal Substrings"
    },
    {
        "arg": "maximum-number-of-words-you-can-type",
        "titleUS": "1935 Maximum Number of Words You Can Type",
        "titleCN": "1935 可以输入的最大单词数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Number of Words You Can Type"
    },
    {
        "arg": "add-minimum-number-of-rungs",
        "titleUS": "1936 Add Minimum Number of Rungs",
        "titleCN": "1936 新增的最少台阶数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Add Minimum Number of Rungs"
    },
    {
        "arg": "maximum-number-of-points-with-cost",
        "titleUS": "1937 Maximum Number of Points with Cost",
        "titleCN": "1937 扣分后的最大得分",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Points with Cost"
    },
    {
        "arg": "maximum-genetic-difference-query",
        "titleUS": "1938 Maximum Genetic Difference Query",
        "titleCN": "1938 查询最大基因差",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Genetic Difference Query"
    },
    {
        "arg": "longest-common-subsequence-between-sorted-arrays",
        "titleUS": "1940 Longest Common Subsequence Between Sorted Arrays",
        "titleCN": "1940 排序数组之间的最长公共子序列",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Longest Common Subsequence Between Sorted Arrays"
    },
    {
        "arg": "check-if-all-characters-have-equal-number-of-occurrences",
        "titleUS": "1941 Check if All Characters Have Equal Number of Occurrences",
        "titleCN": "1941 检查是否所有字符出现次数相同",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if All Characters Have Equal Number of Occurrences"
    },
    {
        "arg": "the-number-of-the-smallest-unoccupied-chair",
        "titleUS": "1942 The Number of the Smallest Unoccupied Chair",
        "titleCN": "1942 最小未被占据椅子的编号",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 The Number of the Smallest Unoccupied Chair"
    },
    {
        "arg": "describe-the-painting",
        "titleUS": "1943 Describe the Painting",
        "titleCN": "1943 描述绘画结果",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Describe the Painting"
    },
    {
        "arg": "number-of-visible-people-in-a-queue",
        "titleUS": "1944 Number of Visible People in a Queue",
        "titleCN": "1944 队列中可以看到的人数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Visible People in a Queue"
    },
    {
        "arg": "sum-of-digits-of-string-after-convert",
        "titleUS": "1945 Sum of Digits of String After Convert",
        "titleCN": "1945 字符串转化后的各位数字之和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sum of Digits of String After Convert"
    },
    {
        "arg": "largest-number-after-mutating-substring",
        "titleUS": "1946 Largest Number After Mutating Substring",
        "titleCN": "1946 子字符串突变后可能得到的最大整数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Largest Number After Mutating Substring"
    },
    {
        "arg": "maximum-compatibility-score-sum",
        "titleUS": "1947 Maximum Compatibility Score Sum",
        "titleCN": "1947 最大兼容性评分和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Compatibility Score Sum"
    },
    {
        "arg": "delete-duplicate-folders-in-system",
        "titleUS": "1948 Delete Duplicate Folders in System",
        "titleCN": "1948 删除系统中的重复文件夹",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Delete Duplicate Folders in System"
    },
    {
        "arg": "maximum-of-minimum-values-in-all-subarrays",
        "titleUS": "1950 Maximum of Minimum Values in All Subarrays",
        "titleCN": "1950 所有子数组最小值中的最大值",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum of Minimum Values in All Subarrays"
    },
    {
        "arg": "three-divisors",
        "titleUS": "1952 Three Divisors",
        "titleCN": "1952 三除数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Three Divisors"
    },
    {
        "arg": "maximum-number-of-weeks-for-which-you-can-work",
        "titleUS": "1953 Maximum Number of Weeks for Which You Can Work",
        "titleCN": "1953 你可以工作的最大周数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Weeks for Which You Can Work"
    },
    {
        "arg": "minimum-garden-perimeter-to-collect-enough-apples",
        "titleUS": "1954 Minimum Garden Perimeter to Collect Enough Apples",
        "titleCN": "1954 收集足够苹果的最小花园周长",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Garden Perimeter to Collect Enough Apples"
    },
    {
        "arg": "count-number-of-special-subsequences",
        "titleUS": "1955 Count Number of Special Subsequences",
        "titleCN": "1955 统计特殊子序列的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Number of Special Subsequences"
    },
    {
        "arg": "minimum-time-for-k-virus-variants-to-spread",
        "titleUS": "1956 Minimum Time For K Virus Variants to Spread",
        "titleCN": "1956 感染 K 种病毒所需的最短时间",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Minimum Time For K Virus Variants to Spread"
    },
    {
        "arg": "delete-characters-to-make-fancy-string",
        "titleUS": "1957 Delete Characters to Make Fancy String",
        "titleCN": "1957 删除字符使字符串变好",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Delete Characters to Make Fancy String"
    },
    {
        "arg": "check-if-move-is-legal",
        "titleUS": "1958 Check if Move is Legal",
        "titleCN": "1958 检查操作是否合法",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Check if Move is Legal"
    },
    {
        "arg": "minimum-total-space-wasted-with-k-resizing-operations",
        "titleUS": "1959 Minimum Total Space Wasted With K Resizing Operations",
        "titleCN": "1959 K 次调整数组大小浪费的最小总空间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Total Space Wasted With K Resizing Operations"
    },
    {
        "arg": "maximum-product-of-the-length-of-two-palindromic-substrings",
        "titleUS": "1960 Maximum Product of the Length of Two Palindromic Substrings",
        "titleCN": "1960 两个回文子字符串长度的最大乘积",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Product of the Length of Two Palindromic Substrings"
    },
    {
        "arg": "check-if-string-is-a-prefix-of-array",
        "titleUS": "1961 Check If String Is a Prefix of Array",
        "titleCN": "1961 检查字符串是否为数组前缀",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check If String Is a Prefix of Array"
    },
    {
        "arg": "remove-stones-to-minimize-the-total",
        "titleUS": "1962 Remove Stones to Minimize the Total",
        "titleCN": "1962 移除石子使总数最小",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Remove Stones to Minimize the Total"
    },
    {
        "arg": "minimum-number-of-swaps-to-make-the-string-balanced",
        "titleUS": "1963 Minimum Number of Swaps to Make the String Balanced",
        "titleCN": "1963 使字符串平衡的最小交换次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Swaps to Make the String Balanced"
    },
    {
        "arg": "find-the-longest-valid-obstacle-course-at-each-position",
        "titleUS": "1964 Find the Longest Valid Obstacle Course at Each Position",
        "titleCN": "1964 找出到每个位置为止最长的有效障碍赛跑路线",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find the Longest Valid Obstacle Course at Each Position"
    },
    {
        "arg": "binary-searchable-numbers-in-an-unsorted-array",
        "titleUS": "1966 Binary Searchable Numbers in an Unsorted Array",
        "titleCN": "1966 未排序数组中的可被二分搜索的数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Binary Searchable Numbers in an Unsorted Array"
    },
    {
        "arg": "number-of-strings-that-appear-as-substrings-in-word",
        "titleUS": "1967 Number of Strings That Appear as Substrings in Word",
        "titleCN": "1967 作为子字符串出现在单词中的字符串数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Strings That Appear as Substrings in Word"
    },
    {
        "arg": "array-with-elements-not-equal-to-average-of-neighbors",
        "titleUS": "1968 Array With Elements Not Equal to Average of Neighbors",
        "titleCN": "1968 构造元素不等于两相邻元素平均值的数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Array With Elements Not Equal to Average of Neighbors"
    },
    {
        "arg": "minimum-non-zero-product-of-the-array-elements",
        "titleUS": "1969 Minimum Non-Zero Product of the Array Elements",
        "titleCN": "1969 数组元素的最小非零乘积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Non-Zero Product of the Array Elements"
    },
    {
        "arg": "last-day-where-you-can-still-cross",
        "titleUS": "1970 Last Day Where You Can Still Cross",
        "titleCN": "1970 你能穿过矩阵的最后一天",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Last Day Where You Can Still Cross"
    },
    {
        "arg": "find-if-path-exists-in-graph",
        "titleUS": "1971 Find if Path Exists in Graph",
        "titleCN": "1971 寻找图中是否存在路径",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find if Path Exists in Graph"
    },
    {
        "arg": "count-nodes-equal-to-sum-of-descendants",
        "titleUS": "1973 Count Nodes Equal to Sum of Descendants",
        "titleCN": "1973 值等于子节点值之和的节点数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Count Nodes Equal to Sum of Descendants"
    },
    {
        "arg": "minimum-time-to-type-word-using-special-typewriter",
        "titleUS": "1974 Minimum Time to Type Word Using Special Typewriter",
        "titleCN": "1974 使用特殊打字机键入单词的最少时间",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Time to Type Word Using Special Typewriter"
    },
    {
        "arg": "maximum-matrix-sum",
        "titleUS": "1975 Maximum Matrix Sum",
        "titleCN": "1975 最大方阵和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Matrix Sum"
    },
    {
        "arg": "number-of-ways-to-arrive-at-destination",
        "titleUS": "1976 Number of Ways to Arrive at Destination",
        "titleCN": "1976 到达目的地的方案数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Ways to Arrive at Destination"
    },
    {
        "arg": "number-of-ways-to-separate-numbers",
        "titleUS": "1977 Number of Ways to Separate Numbers",
        "titleCN": "1977 划分数字的方案数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Ways to Separate Numbers"
    },
    {
        "arg": "find-greatest-common-divisor-of-array",
        "titleUS": "1979 Find Greatest Common Divisor of Array",
        "titleCN": "1979 找出数组的最大公约数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Greatest Common Divisor of Array"
    },
    {
        "arg": "find-unique-binary-string",
        "titleUS": "1980 Find Unique Binary String",
        "titleCN": "1980 找出不同的二进制字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Unique Binary String"
    },
    {
        "arg": "minimize-the-difference-between-target-and-chosen-elements",
        "titleUS": "1981 Minimize the Difference Between Target and Chosen Elements",
        "titleCN": "1981 最小化目标值与所选元素的差",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimize the Difference Between Target and Chosen Elements"
    },
    {
        "arg": "find-array-given-subset-sums",
        "titleUS": "1982 Find Array Given Subset Sums",
        "titleCN": "1982 从子集的和还原数组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find Array Given Subset Sums"
    },
    {
        "arg": "widest-pair-of-indices-with-equal-range-sum",
        "titleUS": "1983 Widest Pair of Indices With Equal Range Sum",
        "titleCN": "1983 范围和相等的最宽索引对",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Widest Pair of Indices With Equal Range Sum"
    },
    {
        "arg": "minimum-difference-between-highest-and-lowest-of-k-scores",
        "titleUS": "1984 Minimum Difference Between Highest and Lowest of K Scores",
        "titleCN": "1984 学生分数的最小差值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Difference Between Highest and Lowest of K Scores"
    },
    {
        "arg": "find-the-kth-largest-integer-in-the-array",
        "titleUS": "1985 Find the Kth Largest Integer in the Array",
        "titleCN": "1985 找出数组中的第 K 大整数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Kth Largest Integer in the Array"
    },
    {
        "arg": "minimum-number-of-work-sessions-to-finish-the-tasks",
        "titleUS": "1986 Minimum Number of Work Sessions to Finish the Tasks",
        "titleCN": "1986 完成任务的最少工作时间段",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Work Sessions to Finish the Tasks"
    },
    {
        "arg": "number-of-unique-good-subsequences",
        "titleUS": "1987 Number of Unique Good Subsequences",
        "titleCN": "1987 不同的好子序列数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Unique Good Subsequences"
    },
    {
        "arg": "maximum-number-of-people-that-can-be-caught-in-tag",
        "titleUS": "1989 Maximum Number of People That Can Be Caught in Tag",
        "titleCN": "1989 捉迷藏中可捕获的最大人数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Number of People That Can Be Caught in Tag"
    },
    {
        "arg": "find-the-middle-index-in-array",
        "titleUS": "1991 Find the Middle Index in Array",
        "titleCN": "1991 找到数组的中间位置",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Middle Index in Array"
    },
    {
        "arg": "find-all-groups-of-farmland",
        "titleUS": "1992 Find All Groups of Farmland",
        "titleCN": "1992 找到所有的农场组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find All Groups of Farmland"
    },
    {
        "arg": "operations-on-tree",
        "titleUS": "1993 Operations on Tree",
        "titleCN": "1993 树上的操作",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Operations on Tree"
    },
    {
        "arg": "the-number-of-good-subsets",
        "titleUS": "1994 The Number of Good Subsets",
        "titleCN": "1994 好子集的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 The Number of Good Subsets"
    },
    {
        "arg": "count-special-quadruplets",
        "titleUS": "1995 Count Special Quadruplets",
        "titleCN": "1995 统计特殊四元组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Special Quadruplets"
    },
    {
        "arg": "the-number-of-weak-characters-in-the-game",
        "titleUS": "1996 The Number of Weak Characters in the Game",
        "titleCN": "1996 游戏中弱角色的数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 The Number of Weak Characters in the Game"
    },
    {
        "arg": "first-day-where-you-have-been-in-all-the-rooms",
        "titleUS": "1997 First Day Where You Have Been in All the Rooms",
        "titleCN": "1997 访问完所有房间的第一天",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 First Day Where You Have Been in All the Rooms"
    },
    {
        "arg": "gcd-sort-of-an-array",
        "titleUS": "1998 GCD Sort of an Array",
        "titleCN": "1998 数组的最大公因数排序",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 GCD Sort of an Array"
    },
    {
        "arg": "smallest-greater-multiple-made-of-two-digits",
        "titleUS": "1999 Smallest Greater Multiple Made of Two Digits",
        "titleCN": "1999 最小的仅由两个数组成的倍数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Smallest Greater Multiple Made of Two Digits"
    },
    {
        "arg": "reverse-prefix-of-word",
        "titleUS": "2000 Reverse Prefix of Word",
        "titleCN": "2000 反转单词前缀",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Reverse Prefix of Word"
    },
    {
        "arg": "number-of-pairs-of-interchangeable-rectangles",
        "titleUS": "2001 Number of Pairs of Interchangeable Rectangles",
        "titleCN": "2001 可互换矩形的组数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Pairs of Interchangeable Rectangles"
    },
    {
        "arg": "maximum-product-of-the-length-of-two-palindromic-subsequences",
        "titleUS": "2002 Maximum Product of the Length of Two Palindromic Subsequences",
        "titleCN": "2002 两个回文子序列长度的最大乘积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Product of the Length of Two Palindromic Subsequences"
    },
    {
        "arg": "smallest-missing-genetic-value-in-each-subtree",
        "titleUS": "2003 Smallest Missing Genetic Value in Each Subtree",
        "titleCN": "2003 每棵子树内缺失的最小基因值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Smallest Missing Genetic Value in Each Subtree"
    },
    {
        "arg": "subtree-removal-game-with-fibonacci-tree",
        "titleUS": "2005 Subtree Removal Game with Fibonacci Tree",
        "titleCN": "2005 斐波那契树的移除子树游戏",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Subtree Removal Game with Fibonacci Tree"
    },
    {
        "arg": "count-number-of-pairs-with-absolute-difference-k",
        "titleUS": "2006 Count Number of Pairs With Absolute Difference K",
        "titleCN": "2006 差的绝对值为 K 的数对数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Number of Pairs With Absolute Difference K"
    },
    {
        "arg": "find-original-array-from-doubled-array",
        "titleUS": "2007 Find Original Array From Doubled Array",
        "titleCN": "2007 从双倍数组中还原原数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Original Array From Doubled Array"
    },
    {
        "arg": "maximum-earnings-from-taxi",
        "titleUS": "2008 Maximum Earnings From Taxi",
        "titleCN": "2008 出租车的最大盈利",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Earnings From Taxi"
    },
    {
        "arg": "minimum-number-of-operations-to-make-array-continuous",
        "titleUS": "2009 Minimum Number of Operations to Make Array Continuous",
        "titleCN": "2009 使数组连续的最少操作数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Number of Operations to Make Array Continuous"
    },
    {
        "arg": "final-value-of-variable-after-performing-operations",
        "titleUS": "2011 Final Value of Variable After Performing Operations",
        "titleCN": "2011 执行操作后的变量值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Final Value of Variable After Performing Operations"
    },
    {
        "arg": "sum-of-beauty-in-the-array",
        "titleUS": "2012 Sum of Beauty in the Array",
        "titleCN": "2012 数组美丽值求和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum of Beauty in the Array"
    },
    {
        "arg": "detect-squares",
        "titleUS": "2013 Detect Squares",
        "titleCN": "2013 检测正方形",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Detect Squares"
    },
    {
        "arg": "longest-subsequence-repeated-k-times",
        "titleUS": "2014 Longest Subsequence Repeated k Times",
        "titleCN": "2014 重复 K 次的最长子序列",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Longest Subsequence Repeated k Times"
    },
    {
        "arg": "average-height-of-buildings-in-each-segment",
        "titleUS": "2015 Average Height of Buildings in Each Segment",
        "titleCN": "2015 每段建筑物的平均高度",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Average Height of Buildings in Each Segment"
    },
    {
        "arg": "maximum-difference-between-increasing-elements",
        "titleUS": "2016 Maximum Difference Between Increasing Elements",
        "titleCN": "2016 增量元素之间的最大差值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Difference Between Increasing Elements"
    },
    {
        "arg": "grid-game",
        "titleUS": "2017 Grid Game",
        "titleCN": "2017 网格游戏",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Grid Game"
    },
    {
        "arg": "check-if-word-can-be-placed-in-crossword",
        "titleUS": "2018 Check if Word Can Be Placed In Crossword",
        "titleCN": "2018 判断单词是否能放入填字游戏内",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Check if Word Can Be Placed In Crossword"
    },
    {
        "arg": "the-score-of-students-solving-math-expression",
        "titleUS": "2019 The Score of Students Solving Math Expression",
        "titleCN": "2019 解出数学表达式的学生分数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 The Score of Students Solving Math Expression"
    },
    {
        "arg": "brightest-position-on-street",
        "titleUS": "2021 Brightest Position on Street",
        "titleCN": "2021 街上最亮的位置",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Brightest Position on Street"
    },
    {
        "arg": "convert-1d-array-into-2d-array",
        "titleUS": "2022 Convert 1D Array Into 2D Array",
        "titleCN": "2022 将一维数组转变成二维数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Convert 1D Array Into 2D Array"
    },
    {
        "arg": "number-of-pairs-of-strings-with-concatenation-equal-to-target",
        "titleUS": "2023 Number of Pairs of Strings With Concatenation Equal to Target",
        "titleCN": "2023 连接后等于目标字符串的字符串对",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Pairs of Strings With Concatenation Equal to Target"
    },
    {
        "arg": "maximize-the-confusion-of-an-exam",
        "titleUS": "2024 Maximize the Confusion of an Exam",
        "titleCN": "2024 考试的最大困扰度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximize the Confusion of an Exam"
    },
    {
        "arg": "maximum-number-of-ways-to-partition-an-array",
        "titleUS": "2025 Maximum Number of Ways to Partition an Array",
        "titleCN": "2025 分割数组的最多方案数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Number of Ways to Partition an Array"
    },
    {
        "arg": "minimum-moves-to-convert-string",
        "titleUS": "2027 Minimum Moves to Convert String",
        "titleCN": "2027 转换字符串的最少操作次数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Moves to Convert String"
    },
    {
        "arg": "find-missing-observations",
        "titleUS": "2028 Find Missing Observations",
        "titleCN": "2028 找出缺失的观测数据",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Missing Observations"
    },
    {
        "arg": "stone-game-ix",
        "titleUS": "2029 Stone Game IX",
        "titleCN": "2029 石子游戏 IX",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Stone Game IX"
    },
    {
        "arg": "smallest-k-length-subsequence-with-occurrences-of-a-letter",
        "titleUS": "2030 Smallest K-Length Subsequence With Occurrences of a Letter",
        "titleCN": "2030 含特定字母的最小子序列",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Smallest K-Length Subsequence With Occurrences of a Letter"
    },
    {
        "arg": "count-subarrays-with-more-ones-than-zeros",
        "titleUS": "2031 Count Subarrays With More Ones Than Zeros",
        "titleCN": "2031 1 比 0 多的子数组个数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Count Subarrays With More Ones Than Zeros"
    },
    {
        "arg": "two-out-of-three",
        "titleUS": "2032 Two Out of Three",
        "titleCN": "2032 至少在两个数组中出现的值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Two Out of Three"
    },
    {
        "arg": "minimum-operations-to-make-a-uni-value-grid",
        "titleUS": "2033 Minimum Operations to Make a Uni-Value Grid",
        "titleCN": "2033 获取单值网格的最小操作数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Operations to Make a Uni-Value Grid"
    },
    {
        "arg": "stock-price-fluctuation",
        "titleUS": "2034 Stock Price Fluctuation ",
        "titleCN": "2034 股票价格波动",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Stock Price Fluctuation "
    },
    {
        "arg": "partition-array-into-two-arrays-to-minimize-sum-difference",
        "titleUS": "2035 Partition Array Into Two Arrays to Minimize Sum Difference",
        "titleCN": "2035 将数组分成两个数组并最小化数组和的差",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Partition Array Into Two Arrays to Minimize Sum Difference"
    },
    {
        "arg": "maximum-alternating-subarray-sum",
        "titleUS": "2036 Maximum Alternating Subarray Sum",
        "titleCN": "2036 最大交替子数组和",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Alternating Subarray Sum"
    },
    {
        "arg": "minimum-number-of-moves-to-seat-everyone",
        "titleUS": "2037 Minimum Number of Moves to Seat Everyone",
        "titleCN": "2037 使每位学生都有座位的最少移动次数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Number of Moves to Seat Everyone"
    },
    {
        "arg": "remove-colored-pieces-if-both-neighbors-are-the-same-color",
        "titleUS": "2038 Remove Colored Pieces if Both Neighbors are the Same Color",
        "titleCN": "2038 如果相邻两个颜色均相同则删除当前颜色",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Remove Colored Pieces if Both Neighbors are the Same Color"
    },
    {
        "arg": "the-time-when-the-network-becomes-idle",
        "titleUS": "2039 The Time When the Network Becomes Idle",
        "titleCN": "2039 网络空闲的时刻",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 The Time When the Network Becomes Idle"
    },
    {
        "arg": "kth-smallest-product-of-two-sorted-arrays",
        "titleUS": "2040 Kth Smallest Product of Two Sorted Arrays",
        "titleCN": "2040 两个有序数组的第 K 小乘积",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Kth Smallest Product of Two Sorted Arrays"
    },
    {
        "arg": "check-if-numbers-are-ascending-in-a-sentence",
        "titleUS": "2042 Check if Numbers Are Ascending in a Sentence",
        "titleCN": "2042 检查句子中的数字是否递增",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if Numbers Are Ascending in a Sentence"
    },
    {
        "arg": "simple-bank-system",
        "titleUS": "2043 Simple Bank System",
        "titleCN": "2043 简易银行系统",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Simple Bank System"
    },
    {
        "arg": "count-number-of-maximum-bitwise-or-subsets",
        "titleUS": "2044 Count Number of Maximum Bitwise-OR Subsets",
        "titleCN": "2044 统计按位或能得到最大值的子集数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Number of Maximum Bitwise-OR Subsets"
    },
    {
        "arg": "second-minimum-time-to-reach-destination",
        "titleUS": "2045 Second Minimum Time to Reach Destination",
        "titleCN": "2045 到达目的地的第二短时间",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Second Minimum Time to Reach Destination"
    },
    {
        "arg": "sort-linked-list-already-sorted-using-absolute-values",
        "titleUS": "2046 Sort Linked List Already Sorted Using Absolute Values",
        "titleCN": "2046 给按照绝对值排序的链表排序",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Sort Linked List Already Sorted Using Absolute Values"
    },
    {
        "arg": "number-of-valid-words-in-a-sentence",
        "titleUS": "2047 Number of Valid Words in a Sentence",
        "titleCN": "2047 句子中的有效单词数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Valid Words in a Sentence"
    },
    {
        "arg": "next-greater-numerically-balanced-number",
        "titleUS": "2048 Next Greater Numerically Balanced Number",
        "titleCN": "2048 下一个更大的数值平衡数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Next Greater Numerically Balanced Number"
    },
    {
        "arg": "count-nodes-with-the-highest-score",
        "titleUS": "2049 Count Nodes With the Highest Score",
        "titleCN": "2049 统计最高分的节点数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Nodes With the Highest Score"
    },
    {
        "arg": "parallel-courses-iii",
        "titleUS": "2050 Parallel Courses III",
        "titleCN": "2050 并行课程 III",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Parallel Courses III"
    },
    {
        "arg": "minimum-cost-to-separate-sentence-into-rows",
        "titleUS": "2052 Minimum Cost to Separate Sentence Into Rows",
        "titleCN": "2052 将句子分隔成行的最低成本",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimum Cost to Separate Sentence Into Rows"
    },
    {
        "arg": "kth-distinct-string-in-an-array",
        "titleUS": "2053 Kth Distinct String in an Array",
        "titleCN": "2053 数组中第 K 个独一无二的字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Kth Distinct String in an Array"
    },
    {
        "arg": "two-best-non-overlapping-events",
        "titleUS": "2054 Two Best Non-Overlapping Events",
        "titleCN": "2054 两个最好的不重叠活动",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Two Best Non-Overlapping Events"
    },
    {
        "arg": "plates-between-candles",
        "titleUS": "2055 Plates Between Candles",
        "titleCN": "2055 蜡烛之间的盘子",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Plates Between Candles"
    },
    {
        "arg": "number-of-valid-move-combinations-on-chessboard",
        "titleUS": "2056 Number of Valid Move Combinations On Chessboard",
        "titleCN": "2056 棋盘上有效移动组合的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Valid Move Combinations On Chessboard"
    },
    {
        "arg": "smallest-index-with-equal-value",
        "titleUS": "2057 Smallest Index With Equal Value",
        "titleCN": "2057 值相等的最小索引",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Smallest Index With Equal Value"
    },
    {
        "arg": "find-the-minimum-and-maximum-number-of-nodes-between-critical-points",
        "titleUS": "2058 Find the Minimum and Maximum Number of Nodes Between Critical Points",
        "titleCN": "2058 找出临界点之间的最小和最大距离",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Minimum and Maximum Number of Nodes Between Critical Points"
    },
    {
        "arg": "minimum-operations-to-convert-number",
        "titleUS": "2059 Minimum Operations to Convert Number",
        "titleCN": "2059 转化数字的最小运算数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Operations to Convert Number"
    },
    {
        "arg": "check-if-an-original-string-exists-given-two-encoded-strings",
        "titleUS": "2060 Check if an Original String Exists Given Two Encoded Strings",
        "titleCN": "2060 同源字符串检测",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Check if an Original String Exists Given Two Encoded Strings"
    },
    {
        "arg": "number-of-spaces-cleaning-robot-cleaned",
        "titleUS": "2061 Number of Spaces Cleaning Robot Cleaned",
        "titleCN": "2061 扫地机器人清扫过的空间个数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Spaces Cleaning Robot Cleaned"
    },
    {
        "arg": "count-vowel-substrings-of-a-string",
        "titleUS": "2062 Count Vowel Substrings of a String",
        "titleCN": "2062 统计字符串中的元音子字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Vowel Substrings of a String"
    },
    {
        "arg": "vowels-of-all-substrings",
        "titleUS": "2063 Vowels of All Substrings",
        "titleCN": "2063 所有子字符串中的元音",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Vowels of All Substrings"
    },
    {
        "arg": "minimized-maximum-of-products-distributed-to-any-store",
        "titleUS": "2064 Minimized Maximum of Products Distributed to Any Store",
        "titleCN": "2064 分配给商店的最多商品的最小值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimized Maximum of Products Distributed to Any Store"
    },
    {
        "arg": "maximum-path-quality-of-a-graph",
        "titleUS": "2065 Maximum Path Quality of a Graph",
        "titleCN": "2065 最大化一张图中的路径价值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Path Quality of a Graph"
    },
    {
        "arg": "number-of-equal-count-substrings",
        "titleUS": "2067 Number of Equal Count Substrings",
        "titleCN": "2067 等计数子串的数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Equal Count Substrings"
    },
    {
        "arg": "check-whether-two-strings-are-almost-equivalent",
        "titleUS": "2068 Check Whether Two Strings are Almost Equivalent",
        "titleCN": "2068 检查两个字符串是否几乎相等",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check Whether Two Strings are Almost Equivalent"
    },
    {
        "arg": "walking-robot-simulation-ii",
        "titleUS": "2069 Walking Robot Simulation II",
        "titleCN": "2069 模拟行走机器人 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Walking Robot Simulation II"
    },
    {
        "arg": "most-beautiful-item-for-each-query",
        "titleUS": "2070 Most Beautiful Item for Each Query",
        "titleCN": "2070 每一个查询的最大美丽值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Most Beautiful Item for Each Query"
    },
    {
        "arg": "maximum-number-of-tasks-you-can-assign",
        "titleUS": "2071 Maximum Number of Tasks You Can Assign",
        "titleCN": "2071 你可以安排的最多任务数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Number of Tasks You Can Assign"
    },
    {
        "arg": "time-needed-to-buy-tickets",
        "titleUS": "2073 Time Needed to Buy Tickets",
        "titleCN": "2073 买票需要的时间",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Time Needed to Buy Tickets"
    },
    {
        "arg": "reverse-nodes-in-even-length-groups",
        "titleUS": "2074 Reverse Nodes in Even Length Groups",
        "titleCN": "2074 反转偶数长度组的节点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reverse Nodes in Even Length Groups"
    },
    {
        "arg": "decode-the-slanted-ciphertext",
        "titleUS": "2075 Decode the Slanted Ciphertext",
        "titleCN": "2075 解码斜向换位密码",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Decode the Slanted Ciphertext"
    },
    {
        "arg": "process-restricted-friend-requests",
        "titleUS": "2076 Process Restricted Friend Requests",
        "titleCN": "2076 处理含限制条件的好友请求",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Process Restricted Friend Requests"
    },
    {
        "arg": "paths-in-maze-that-lead-to-same-room",
        "titleUS": "2077 Paths in Maze That Lead to Same Room",
        "titleCN": "2077 殊途同归",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Paths in Maze That Lead to Same Room"
    },
    {
        "arg": "two-furthest-houses-with-different-colors",
        "titleUS": "2078 Two Furthest Houses With Different Colors",
        "titleCN": "2078 两栋颜色不同且距离最远的房子",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Two Furthest Houses With Different Colors"
    },
    {
        "arg": "watering-plants",
        "titleUS": "2079 Watering Plants",
        "titleCN": "2079 给植物浇水",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Watering Plants"
    },
    {
        "arg": "range-frequency-queries",
        "titleUS": "2080 Range Frequency Queries",
        "titleCN": "2080 区间内查询数字的频率",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Range Frequency Queries"
    },
    {
        "arg": "sum-of-k-mirror-numbers",
        "titleUS": "2081 Sum of k-Mirror Numbers",
        "titleCN": "2081 k 镜像数字的和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Sum of k-Mirror Numbers"
    },
    {
        "arg": "substrings-that-begin-and-end-with-the-same-letter",
        "titleUS": "2083 Substrings That Begin and End With the Same Letter",
        "titleCN": "2083 求以相同字母开头和结尾的子串总数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Substrings That Begin and End With the Same Letter"
    },
    {
        "arg": "count-common-words-with-one-occurrence",
        "titleUS": "2085 Count Common Words With One Occurrence",
        "titleCN": "2085 统计出现过一次的公共字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Common Words With One Occurrence"
    },
    {
        "arg": "minimum-number-of-food-buckets-to-feed-the-hamsters",
        "titleUS": "2086 Minimum Number of Food Buckets to Feed the Hamsters",
        "titleCN": "2086 喂食仓鼠的最小食物桶数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Food Buckets to Feed the Hamsters"
    },
    {
        "arg": "minimum-cost-homecoming-of-a-robot-in-a-grid",
        "titleUS": "2087 Minimum Cost Homecoming of a Robot in a Grid",
        "titleCN": "2087 网格图中机器人回家的最小代价",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Cost Homecoming of a Robot in a Grid"
    },
    {
        "arg": "count-fertile-pyramids-in-a-land",
        "titleUS": "2088 Count Fertile Pyramids in a Land",
        "titleCN": "2088 统计农场中肥沃金字塔的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Fertile Pyramids in a Land"
    },
    {
        "arg": "find-target-indices-after-sorting-array",
        "titleUS": "2089 Find Target Indices After Sorting Array",
        "titleCN": "2089 找出数组排序后的目标下标",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Target Indices After Sorting Array"
    },
    {
        "arg": "k-radius-subarray-averages",
        "titleUS": "2090 K Radius Subarray Averages",
        "titleCN": "2090 半径为 k 的子数组平均值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 K Radius Subarray Averages"
    },
    {
        "arg": "removing-minimum-and-maximum-from-array",
        "titleUS": "2091 Removing Minimum and Maximum From Array",
        "titleCN": "2091 从数组中移除最大值和最小值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Removing Minimum and Maximum From Array"
    },
    {
        "arg": "find-all-people-with-secret",
        "titleUS": "2092 Find All People With Secret",
        "titleCN": "2092 找出知晓秘密的所有专家",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find All People With Secret"
    },
    {
        "arg": "minimum-cost-to-reach-city-with-discounts",
        "titleUS": "2093 Minimum Cost to Reach City With Discounts",
        "titleCN": "2093 前往目标城市的最小费用",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimum Cost to Reach City With Discounts"
    },
    {
        "arg": "finding-3-digit-even-numbers",
        "titleUS": "2094 Finding 3-Digit Even Numbers",
        "titleCN": "2094 找出 3 位偶数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Finding 3-Digit Even Numbers"
    },
    {
        "arg": "delete-the-middle-node-of-a-linked-list",
        "titleUS": "2095 Delete the Middle Node of a Linked List",
        "titleCN": "2095 删除链表的中间节点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Delete the Middle Node of a Linked List"
    },
    {
        "arg": "step-by-step-directions-from-a-binary-tree-node-to-another",
        "titleUS": "2096 Step-By-Step Directions From a Binary Tree Node to Another",
        "titleCN": "2096 从二叉树一个节点到另一个节点每一步的方向",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Step-By-Step Directions From a Binary Tree Node to Another"
    },
    {
        "arg": "valid-arrangement-of-pairs",
        "titleUS": "2097 Valid Arrangement of Pairs",
        "titleCN": "2097 合法重新排列数对",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Valid Arrangement of Pairs"
    },
    {
        "arg": "subsequence-of-size-k-with-the-largest-even-sum",
        "titleUS": "2098 Subsequence of Size K With the Largest Even Sum",
        "titleCN": "2098 长度为 K 的最大偶数和子序列",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Subsequence of Size K With the Largest Even Sum"
    },
    {
        "arg": "find-subsequence-of-length-k-with-the-largest-sum",
        "titleUS": "2099 Find Subsequence of Length K With the Largest Sum",
        "titleCN": "2099 找到和最大的长度为 K 的子序列",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Subsequence of Length K With the Largest Sum"
    },
    {
        "arg": "find-good-days-to-rob-the-bank",
        "titleUS": "2100 Find Good Days to Rob the Bank",
        "titleCN": "2100 适合野炊的日子",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Good Days to Rob the Bank"
    },
    {
        "arg": "detonate-the-maximum-bombs",
        "titleUS": "2101 Detonate the Maximum Bombs",
        "titleCN": "2101 引爆最多的炸弹",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Detonate the Maximum Bombs"
    },
    {
        "arg": "sequentially-ordinal-rank-tracker",
        "titleUS": "2102 Sequentially Ordinal Rank Tracker",
        "titleCN": "2102 序列顺序查询",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Sequentially Ordinal Rank Tracker"
    },
    {
        "arg": "rings-and-rods",
        "titleUS": "2103 Rings and Rods",
        "titleCN": "2103 环和杆",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Rings and Rods"
    },
    {
        "arg": "sum-of-subarray-ranges",
        "titleUS": "2104 Sum of Subarray Ranges",
        "titleCN": "2104 子数组范围和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum of Subarray Ranges"
    },
    {
        "arg": "watering-plants-ii",
        "titleUS": "2105 Watering Plants II",
        "titleCN": "2105 给植物浇水 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Watering Plants II"
    },
    {
        "arg": "maximum-fruits-harvested-after-at-most-k-steps",
        "titleUS": "2106 Maximum Fruits Harvested After at Most K Steps",
        "titleCN": "2106 摘水果",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Fruits Harvested After at Most K Steps"
    },
    {
        "arg": "number-of-unique-flavors-after-sharing-k-candies",
        "titleUS": "2107 Number of Unique Flavors After Sharing K Candies",
        "titleCN": "2107 分享 K 个糖果后独特口味的数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Unique Flavors After Sharing K Candies"
    },
    {
        "arg": "find-first-palindromic-string-in-the-array",
        "titleUS": "2108 Find First Palindromic String in the Array",
        "titleCN": "2108 找出数组中的第一个回文字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find First Palindromic String in the Array"
    },
    {
        "arg": "adding-spaces-to-a-string",
        "titleUS": "2109 Adding Spaces to a String",
        "titleCN": "2109 向字符串添加空格",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Adding Spaces to a String"
    },
    {
        "arg": "number-of-smooth-descent-periods-of-a-stock",
        "titleUS": "2110 Number of Smooth Descent Periods of a Stock",
        "titleCN": "2110 股票平滑下跌阶段的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Smooth Descent Periods of a Stock"
    },
    {
        "arg": "minimum-operations-to-make-the-array-k-increasing",
        "titleUS": "2111 Minimum Operations to Make the Array K-Increasing",
        "titleCN": "2111 使数组 K 递增的最少操作次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Operations to Make the Array K-Increasing"
    },
    {
        "arg": "elements-in-array-after-removing-and-replacing-elements",
        "titleUS": "2113 Elements in Array After Removing and Replacing Elements",
        "titleCN": "2113 查询删除和添加元素后的数组",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Elements in Array After Removing and Replacing Elements"
    },
    {
        "arg": "maximum-number-of-words-found-in-sentences",
        "titleUS": "2114 Maximum Number of Words Found in Sentences",
        "titleCN": "2114 句子中的最多单词数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Number of Words Found in Sentences"
    },
    {
        "arg": "find-all-possible-recipes-from-given-supplies",
        "titleUS": "2115 Find All Possible Recipes from Given Supplies",
        "titleCN": "2115 从给定原材料中找到所有可以做出的菜",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find All Possible Recipes from Given Supplies"
    },
    {
        "arg": "check-if-a-parentheses-string-can-be-valid",
        "titleUS": "2116 Check if a Parentheses String Can Be Valid",
        "titleCN": "2116 判断一个括号字符串是否有效",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Check if a Parentheses String Can Be Valid"
    },
    {
        "arg": "abbreviating-the-product-of-a-range",
        "titleUS": "2117 Abbreviating the Product of a Range",
        "titleCN": "2117 一个区间内所有数乘积的缩写",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Abbreviating the Product of a Range"
    },
    {
        "arg": "a-number-after-a-double-reversal",
        "titleUS": "2119 A Number After a Double Reversal",
        "titleCN": "2119 反转两次的数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 A Number After a Double Reversal"
    },
    {
        "arg": "execution-of-all-suffix-instructions-staying-in-a-grid",
        "titleUS": "2120 Execution of All Suffix Instructions Staying in a Grid",
        "titleCN": "2120 执行所有后缀指令",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Execution of All Suffix Instructions Staying in a Grid"
    },
    {
        "arg": "intervals-between-identical-elements",
        "titleUS": "2121 Intervals Between Identical Elements",
        "titleCN": "2121 相同元素的间隔之和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Intervals Between Identical Elements"
    },
    {
        "arg": "recover-the-original-array",
        "titleUS": "2122 Recover the Original Array",
        "titleCN": "2122 还原原数组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Recover the Original Array"
    },
    {
        "arg": "minimum-operations-to-remove-adjacent-ones-in-matrix",
        "titleUS": "2123 Minimum Operations to Remove Adjacent Ones in Matrix",
        "titleCN": "2123 使矩阵中的 1 互不相邻的最小操作数",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Minimum Operations to Remove Adjacent Ones in Matrix"
    },
    {
        "arg": "check-if-all-as-appears-before-all-bs",
        "titleUS": "2124 Check if All A's Appears Before All B's",
        "titleCN": "2124 检查是否所有 A 都在 B 之前",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if All A's Appears Before All B's"
    },
    {
        "arg": "number-of-laser-beams-in-a-bank",
        "titleUS": "2125 Number of Laser Beams in a Bank",
        "titleCN": "2125 银行中的激光束数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Laser Beams in a Bank"
    },
    {
        "arg": "destroying-asteroids",
        "titleUS": "2126 Destroying Asteroids",
        "titleCN": "2126 摧毁小行星",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Destroying Asteroids"
    },
    {
        "arg": "maximum-employees-to-be-invited-to-a-meeting",
        "titleUS": "2127 Maximum Employees to Be Invited to a Meeting",
        "titleCN": "2127 参加会议的最多员工数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Employees to Be Invited to a Meeting"
    },
    {
        "arg": "remove-all-ones-with-row-and-column-flips",
        "titleUS": "2128 Remove All Ones With Row and Column Flips",
        "titleCN": "2128 通过翻转行或列来去除所有的 1",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Remove All Ones With Row and Column Flips"
    },
    {
        "arg": "capitalize-the-title",
        "titleUS": "2129 Capitalize the Title",
        "titleCN": "2129 将标题首字母大写",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Capitalize the Title"
    },
    {
        "arg": "maximum-twin-sum-of-a-linked-list",
        "titleUS": "2130 Maximum Twin Sum of a Linked List",
        "titleCN": "2130 链表最大孪生和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Twin Sum of a Linked List"
    },
    {
        "arg": "longest-palindrome-by-concatenating-two-letter-words",
        "titleUS": "2131 Longest Palindrome by Concatenating Two Letter Words",
        "titleCN": "2131 连接两字母单词得到的最长回文串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Palindrome by Concatenating Two Letter Words"
    },
    {
        "arg": "stamping-the-grid",
        "titleUS": "2132 Stamping the Grid",
        "titleCN": "2132 用邮票贴满网格图",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Stamping the Grid"
    },
    {
        "arg": "check-if-every-row-and-column-contains-all-numbers",
        "titleUS": "2133 Check if Every Row and Column Contains All Numbers",
        "titleCN": "2133 检查是否每一行每一列都包含全部整数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if Every Row and Column Contains All Numbers"
    },
    {
        "arg": "minimum-swaps-to-group-all-1s-together-ii",
        "titleUS": "2134 Minimum Swaps to Group All 1's Together II",
        "titleCN": "2134 最少交换次数来组合所有的 1 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Swaps to Group All 1's Together II"
    },
    {
        "arg": "count-words-obtained-after-adding-a-letter",
        "titleUS": "2135 Count Words Obtained After Adding a Letter",
        "titleCN": "2135 统计追加字母可以获得的单词数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Words Obtained After Adding a Letter"
    },
    {
        "arg": "earliest-possible-day-of-full-bloom",
        "titleUS": "2136 Earliest Possible Day of Full Bloom",
        "titleCN": "2136 全部开花的最早一天",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Earliest Possible Day of Full Bloom"
    },
    {
        "arg": "pour-water-between-buckets-to-make-water-levels-equal",
        "titleUS": "2137 Pour Water Between Buckets to Make Water Levels Equal",
        "titleCN": "2137 通过倒水操作让所有的水桶所含水量相等",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Pour Water Between Buckets to Make Water Levels Equal"
    },
    {
        "arg": "divide-a-string-into-groups-of-size-k",
        "titleUS": "2138 Divide a String Into Groups of Size k",
        "titleCN": "2138 将字符串拆分为若干长度为 k 的组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Divide a String Into Groups of Size k"
    },
    {
        "arg": "minimum-moves-to-reach-target-score",
        "titleUS": "2139 Minimum Moves to Reach Target Score",
        "titleCN": "2139 得到目标值的最少行动次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Moves to Reach Target Score"
    },
    {
        "arg": "solving-questions-with-brainpower",
        "titleUS": "2140 Solving Questions With Brainpower",
        "titleCN": "2140 解决智力问题",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Solving Questions With Brainpower"
    },
    {
        "arg": "maximum-running-time-of-n-computers",
        "titleUS": "2141 Maximum Running Time of N Computers",
        "titleCN": "2141 同时运行 N 台电脑的最长时间",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Running Time of N Computers"
    },
    {
        "arg": "choose-numbers-from-two-arrays-in-range",
        "titleUS": "2143 Choose Numbers From Two Arrays in Range",
        "titleCN": "2143 在两个数组的区间中选取数字",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Choose Numbers From Two Arrays in Range"
    },
    {
        "arg": "minimum-cost-of-buying-candies-with-discount",
        "titleUS": "2144 Minimum Cost of Buying Candies With Discount",
        "titleCN": "2144 打折购买糖果的最小开销",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Cost of Buying Candies With Discount"
    },
    {
        "arg": "count-the-hidden-sequences",
        "titleUS": "2145 Count the Hidden Sequences",
        "titleCN": "2145 统计隐藏数组数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count the Hidden Sequences"
    },
    {
        "arg": "k-highest-ranked-items-within-a-price-range",
        "titleUS": "2146 K Highest Ranked Items Within a Price Range",
        "titleCN": "2146 价格范围内最高排名的 K 样物品",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 K Highest Ranked Items Within a Price Range"
    },
    {
        "arg": "number-of-ways-to-divide-a-long-corridor",
        "titleUS": "2147 Number of Ways to Divide a Long Corridor",
        "titleCN": "2147 分隔长廊的方案数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Ways to Divide a Long Corridor"
    },
    {
        "arg": "count-elements-with-strictly-smaller-and-greater-elements",
        "titleUS": "2148 Count Elements With Strictly Smaller and Greater Elements ",
        "titleCN": "2148 元素计数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Elements With Strictly Smaller and Greater Elements "
    },
    {
        "arg": "rearrange-array-elements-by-sign",
        "titleUS": "2149 Rearrange Array Elements by Sign",
        "titleCN": "2149 按符号重排数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Rearrange Array Elements by Sign"
    },
    {
        "arg": "find-all-lonely-numbers-in-the-array",
        "titleUS": "2150 Find All Lonely Numbers in the Array",
        "titleCN": "2150 找出数组中的所有孤独数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find All Lonely Numbers in the Array"
    },
    {
        "arg": "maximum-good-people-based-on-statements",
        "titleUS": "2151 Maximum Good People Based on Statements",
        "titleCN": "2151 基于陈述统计最多好人数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Good People Based on Statements"
    },
    {
        "arg": "minimum-number-of-lines-to-cover-points",
        "titleUS": "2152 Minimum Number of Lines to Cover Points",
        "titleCN": "2152 穿过所有点的所需最少直线数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimum Number of Lines to Cover Points"
    },
    {
        "arg": "keep-multiplying-found-values-by-two",
        "titleUS": "2154 Keep Multiplying Found Values by Two",
        "titleCN": "2154 将找到的值乘以 2",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Keep Multiplying Found Values by Two"
    },
    {
        "arg": "all-divisions-with-the-highest-score-of-a-binary-array",
        "titleUS": "2155 All Divisions With the Highest Score of a Binary Array",
        "titleCN": "2155 分组得分最高的所有下标",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 All Divisions With the Highest Score of a Binary Array"
    },
    {
        "arg": "find-substring-with-given-hash-value",
        "titleUS": "2156 Find Substring With Given Hash Value",
        "titleCN": "2156 查找给定哈希值的子串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find Substring With Given Hash Value"
    },
    {
        "arg": "groups-of-strings",
        "titleUS": "2157 Groups of Strings",
        "titleCN": "2157 字符串分组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Groups of Strings"
    },
    {
        "arg": "amount-of-new-area-painted-each-day",
        "titleUS": "2158 Amount of New Area Painted Each Day",
        "titleCN": "2158 每天绘制新区域的数量",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Amount of New Area Painted Each Day"
    },
    {
        "arg": "minimum-sum-of-four-digit-number-after-splitting-digits",
        "titleUS": "2160 Minimum Sum of Four Digit Number After Splitting Digits",
        "titleCN": "2160 拆分数位后四位数字的最小和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Sum of Four Digit Number After Splitting Digits"
    },
    {
        "arg": "partition-array-according-to-given-pivot",
        "titleUS": "2161 Partition Array According to Given Pivot",
        "titleCN": "2161 根据给定数字划分数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Partition Array According to Given Pivot"
    },
    {
        "arg": "minimum-cost-to-set-cooking-time",
        "titleUS": "2162 Minimum Cost to Set Cooking Time",
        "titleCN": "2162 设置时间的最少代价",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Cost to Set Cooking Time"
    },
    {
        "arg": "minimum-difference-in-sums-after-removal-of-elements",
        "titleUS": "2163 Minimum Difference in Sums After Removal of Elements",
        "titleCN": "2163 删除元素后和的最小差值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Difference in Sums After Removal of Elements"
    },
    {
        "arg": "sort-even-and-odd-indices-independently",
        "titleUS": "2164 Sort Even and Odd Indices Independently",
        "titleCN": "2164 对奇偶下标分别排序",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sort Even and Odd Indices Independently"
    },
    {
        "arg": "smallest-value-of-the-rearranged-number",
        "titleUS": "2165 Smallest Value of the Rearranged Number",
        "titleCN": "2165 重排数字的最小值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Smallest Value of the Rearranged Number"
    },
    {
        "arg": "design-bitset",
        "titleUS": "2166 Design Bitset",
        "titleCN": "2166 设计位集",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Design Bitset"
    },
    {
        "arg": "minimum-time-to-remove-all-cars-containing-illegal-goods",
        "titleUS": "2167 Minimum Time to Remove All Cars Containing Illegal Goods",
        "titleCN": "2167 移除所有载有违禁货物车厢所需的最少时间",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Time to Remove All Cars Containing Illegal Goods"
    },
    {
        "arg": "unique-substrings-with-equal-digit-frequency",
        "titleUS": "2168 Unique Substrings With Equal Digit Frequency",
        "titleCN": "2168 每个数字的频率都相同的独特子字符串的数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Unique Substrings With Equal Digit Frequency"
    },
    {
        "arg": "count-operations-to-obtain-zero",
        "titleUS": "2169 Count Operations to Obtain Zero",
        "titleCN": "2169 得到 0 的操作数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Operations to Obtain Zero"
    },
    {
        "arg": "minimum-operations-to-make-the-array-alternating",
        "titleUS": "2170 Minimum Operations to Make the Array Alternating",
        "titleCN": "2170 使数组变成交替数组的最少操作数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Operations to Make the Array Alternating"
    },
    {
        "arg": "removing-minimum-number-of-magic-beans",
        "titleUS": "2171 Removing Minimum Number of Magic Beans",
        "titleCN": "2171 拿出最少数目的魔法豆",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Removing Minimum Number of Magic Beans"
    },
    {
        "arg": "maximum-and-sum-of-array",
        "titleUS": "2172 Maximum AND Sum of Array",
        "titleCN": "2172 数组的最大与和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum AND Sum of Array"
    },
    {
        "arg": "remove-all-ones-with-row-and-column-flips-ii",
        "titleUS": "2174 Remove All Ones With Row and Column Flips II",
        "titleCN": "2174 通过翻转行或列来去除所有的 1 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Remove All Ones With Row and Column Flips II"
    },
    {
        "arg": "count-equal-and-divisible-pairs-in-an-array",
        "titleUS": "2176 Count Equal and Divisible Pairs in an Array",
        "titleCN": "2176 统计数组中相等且可以被整除的数对",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Equal and Divisible Pairs in an Array"
    },
    {
        "arg": "find-three-consecutive-integers-that-sum-to-a-given-number",
        "titleUS": "2177 Find Three Consecutive Integers That Sum to a Given Number",
        "titleCN": "2177 找到和为给定整数的三个连续整数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Three Consecutive Integers That Sum to a Given Number"
    },
    {
        "arg": "maximum-split-of-positive-even-integers",
        "titleUS": "2178 Maximum Split of Positive Even Integers",
        "titleCN": "2178 拆分成最多数目的正偶数之和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Split of Positive Even Integers"
    },
    {
        "arg": "count-good-triplets-in-an-array",
        "titleUS": "2179 Count Good Triplets in an Array",
        "titleCN": "2179 统计数组中好三元组数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Good Triplets in an Array"
    },
    {
        "arg": "count-integers-with-even-digit-sum",
        "titleUS": "2180 Count Integers With Even Digit Sum",
        "titleCN": "2180 统计各位数字之和为偶数的整数个数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Integers With Even Digit Sum"
    },
    {
        "arg": "merge-nodes-in-between-zeros",
        "titleUS": "2181 Merge Nodes in Between Zeros",
        "titleCN": "2181 合并零之间的节点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Merge Nodes in Between Zeros"
    },
    {
        "arg": "construct-string-with-repeat-limit",
        "titleUS": "2182 Construct String With Repeat Limit",
        "titleCN": "2182 构造限制重复的字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Construct String With Repeat Limit"
    },
    {
        "arg": "count-array-pairs-divisible-by-k",
        "titleUS": "2183 Count Array Pairs Divisible by K",
        "titleCN": "2183 统计可以被 K 整除的下标对数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Array Pairs Divisible by K"
    },
    {
        "arg": "number-of-ways-to-build-sturdy-brick-wall",
        "titleUS": "2184 Number of Ways to Build Sturdy Brick Wall",
        "titleCN": "2184 建造坚实的砖墙的方法数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Ways to Build Sturdy Brick Wall"
    },
    {
        "arg": "counting-words-with-a-given-prefix",
        "titleUS": "2185 Counting Words With a Given Prefix",
        "titleCN": "2185 统计包含给定前缀的字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Counting Words With a Given Prefix"
    },
    {
        "arg": "minimum-number-of-steps-to-make-two-strings-anagram-ii",
        "titleUS": "2186 Minimum Number of Steps to Make Two Strings Anagram II",
        "titleCN": "2186 制造字母异位词的最小步骤数 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Steps to Make Two Strings Anagram II"
    },
    {
        "arg": "minimum-time-to-complete-trips",
        "titleUS": "2187 Minimum Time to Complete Trips",
        "titleCN": "2187 完成旅途的最少时间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Time to Complete Trips"
    },
    {
        "arg": "minimum-time-to-finish-the-race",
        "titleUS": "2188 Minimum Time to Finish the Race",
        "titleCN": "2188 完成比赛的最少时间",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Time to Finish the Race"
    },
    {
        "arg": "number-of-ways-to-build-house-of-cards",
        "titleUS": "2189 Number of Ways to Build House of Cards",
        "titleCN": "2189 建造纸牌屋的方法数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Ways to Build House of Cards"
    },
    {
        "arg": "most-frequent-number-following-key-in-an-array",
        "titleUS": "2190 Most Frequent Number Following Key In an Array",
        "titleCN": "2190 数组中紧跟 key 之后出现最频繁的数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Most Frequent Number Following Key In an Array"
    },
    {
        "arg": "sort-the-jumbled-numbers",
        "titleUS": "2191 Sort the Jumbled Numbers",
        "titleCN": "2191 将杂乱无章的数字排序",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sort the Jumbled Numbers"
    },
    {
        "arg": "all-ancestors-of-a-node-in-a-directed-acyclic-graph",
        "titleUS": "2192 All Ancestors of a Node in a Directed Acyclic Graph",
        "titleCN": "2192 有向无环图中一个节点的所有祖先",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 All Ancestors of a Node in a Directed Acyclic Graph"
    },
    {
        "arg": "minimum-number-of-moves-to-make-palindrome",
        "titleUS": "2193 Minimum Number of Moves to Make Palindrome",
        "titleCN": "2193 得到回文串的最少操作次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Number of Moves to Make Palindrome"
    },
    {
        "arg": "cells-in-a-range-on-an-excel-sheet",
        "titleUS": "2194 Cells in a Range on an Excel Sheet",
        "titleCN": "2194 Excel 表中某个范围内的单元格",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Cells in a Range on an Excel Sheet"
    },
    {
        "arg": "append-k-integers-with-minimal-sum",
        "titleUS": "2195 Append K Integers With Minimal Sum",
        "titleCN": "2195 向数组中追加 K 个整数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Append K Integers With Minimal Sum"
    },
    {
        "arg": "create-binary-tree-from-descriptions",
        "titleUS": "2196 Create Binary Tree From Descriptions",
        "titleCN": "2196 根据描述创建二叉树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Create Binary Tree From Descriptions"
    },
    {
        "arg": "replace-non-coprime-numbers-in-array",
        "titleUS": "2197 Replace Non-Coprime Numbers in Array",
        "titleCN": "2197 替换数组中的非互质数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Replace Non-Coprime Numbers in Array"
    },
    {
        "arg": "number-of-single-divisor-triplets",
        "titleUS": "2198 Number of Single Divisor Triplets",
        "titleCN": "2198 单因数三元组",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Single Divisor Triplets"
    },
    {
        "arg": "find-all-k-distant-indices-in-an-array",
        "titleUS": "2200 Find All K-Distant Indices in an Array",
        "titleCN": "2200 找出数组中的所有 K 近邻下标",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find All K-Distant Indices in an Array"
    },
    {
        "arg": "count-artifacts-that-can-be-extracted",
        "titleUS": "2201 Count Artifacts That Can Be Extracted",
        "titleCN": "2201 统计可以提取的工件",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Artifacts That Can Be Extracted"
    },
    {
        "arg": "maximize-the-topmost-element-after-k-moves",
        "titleUS": "2202 Maximize the Topmost Element After K Moves",
        "titleCN": "2202 K 次操作后最大化顶端元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximize the Topmost Element After K Moves"
    },
    {
        "arg": "minimum-weighted-subgraph-with-the-required-paths",
        "titleUS": "2203 Minimum Weighted Subgraph With the Required Paths",
        "titleCN": "2203 得到要求路径的最小带权子图",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Weighted Subgraph With the Required Paths"
    },
    {
        "arg": "distance-to-a-cycle-in-undirected-graph",
        "titleUS": "2204 Distance to a Cycle in Undirected Graph",
        "titleCN": "2204 无向图中到环的距离",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Distance to a Cycle in Undirected Graph"
    },
    {
        "arg": "divide-array-into-equal-pairs",
        "titleUS": "2206 Divide Array Into Equal Pairs",
        "titleCN": "2206 将数组划分成相等数对",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Divide Array Into Equal Pairs"
    },
    {
        "arg": "maximize-number-of-subsequences-in-a-string",
        "titleUS": "2207 Maximize Number of Subsequences in a String",
        "titleCN": "2207 字符串中最多数目的子序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximize Number of Subsequences in a String"
    },
    {
        "arg": "minimum-operations-to-halve-array-sum",
        "titleUS": "2208 Minimum Operations to Halve Array Sum",
        "titleCN": "2208 将数组和减半的最少操作次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Operations to Halve Array Sum"
    },
    {
        "arg": "minimum-white-tiles-after-covering-with-carpets",
        "titleUS": "2209 Minimum White Tiles After Covering With Carpets",
        "titleCN": "2209 用地毯覆盖后的最少白色砖块",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum White Tiles After Covering With Carpets"
    },
    {
        "arg": "count-hills-and-valleys-in-an-array",
        "titleUS": "2210 Count Hills and Valleys in an Array",
        "titleCN": "2210 统计数组中峰和谷的数量",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Hills and Valleys in an Array"
    },
    {
        "arg": "count-collisions-on-a-road",
        "titleUS": "2211 Count Collisions on a Road",
        "titleCN": "2211 统计道路上的碰撞次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Collisions on a Road"
    },
    {
        "arg": "maximum-points-in-an-archery-competition",
        "titleUS": "2212 Maximum Points in an Archery Competition",
        "titleCN": "2212 射箭比赛中的最大得分",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Points in an Archery Competition"
    },
    {
        "arg": "longest-substring-of-one-repeating-character",
        "titleUS": "2213 Longest Substring of One Repeating Character",
        "titleCN": "2213 由单个字符重复的最长子字符串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Longest Substring of One Repeating Character"
    },
    {
        "arg": "minimum-health-to-beat-game",
        "titleUS": "2214 Minimum Health to Beat Game",
        "titleCN": "2214 通关游戏所需的最低生命值",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimum Health to Beat Game"
    },
    {
        "arg": "find-the-difference-of-two-arrays",
        "titleUS": "2215 Find the Difference of Two Arrays",
        "titleCN": "2215 找出两数组的不同",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Difference of Two Arrays"
    },
    {
        "arg": "minimum-deletions-to-make-array-beautiful",
        "titleUS": "2216 Minimum Deletions to Make Array Beautiful",
        "titleCN": "2216 美化数组的最少删除数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Deletions to Make Array Beautiful"
    },
    {
        "arg": "find-palindrome-with-fixed-length",
        "titleUS": "2217 Find Palindrome With Fixed Length",
        "titleCN": "2217 找到指定长度的回文数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Palindrome With Fixed Length"
    },
    {
        "arg": "maximum-value-of-k-coins-from-piles",
        "titleUS": "2218 Maximum Value of K Coins From Piles",
        "titleCN": "2218 从栈中取出 K 个硬币的最大面值和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Value of K Coins From Piles"
    },
    {
        "arg": "maximum-sum-score-of-array",
        "titleUS": "2219 Maximum Sum Score of Array",
        "titleCN": "2219 数组的最大总分",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Sum Score of Array"
    },
    {
        "arg": "minimum-bit-flips-to-convert-number",
        "titleUS": "2220 Minimum Bit Flips to Convert Number",
        "titleCN": "2220 转换数字的最少位翻转次数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Bit Flips to Convert Number"
    },
    {
        "arg": "find-triangular-sum-of-an-array",
        "titleUS": "2221 Find Triangular Sum of an Array",
        "titleCN": "2221 数组的三角和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Triangular Sum of an Array"
    },
    {
        "arg": "number-of-ways-to-select-buildings",
        "titleUS": "2222 Number of Ways to Select Buildings",
        "titleCN": "2222 选择建筑的方案数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Ways to Select Buildings"
    },
    {
        "arg": "sum-of-scores-of-built-strings",
        "titleUS": "2223 Sum of Scores of Built Strings",
        "titleCN": "2223 构造字符串的总得分和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Sum of Scores of Built Strings"
    },
    {
        "arg": "minimum-number-of-operations-to-convert-time",
        "titleUS": "2224 Minimum Number of Operations to Convert Time",
        "titleCN": "2224 转化时间需要的最少操作数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Number of Operations to Convert Time"
    },
    {
        "arg": "find-players-with-zero-or-one-losses",
        "titleUS": "2225 Find Players With Zero or One Losses",
        "titleCN": "2225 找出输掉零场或一场比赛的玩家",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Players With Zero or One Losses"
    },
    {
        "arg": "maximum-candies-allocated-to-k-children",
        "titleUS": "2226 Maximum Candies Allocated to K Children",
        "titleCN": "2226 每个小孩最多能分到多少糖果",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Candies Allocated to K Children"
    },
    {
        "arg": "encrypt-and-decrypt-strings",
        "titleUS": "2227 Encrypt and Decrypt Strings",
        "titleCN": "2227 加密解密字符串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Encrypt and Decrypt Strings"
    },
    {
        "arg": "check-if-an-array-is-consecutive",
        "titleUS": "2229 Check if an Array Is Consecutive",
        "titleCN": "2229 检查数组是否连贯",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Check if an Array Is Consecutive"
    },
    {
        "arg": "largest-number-after-digit-swaps-by-parity",
        "titleUS": "2231 Largest Number After Digit Swaps by Parity",
        "titleCN": "2231 按奇偶性交换后的最大数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Largest Number After Digit Swaps by Parity"
    },
    {
        "arg": "minimize-result-by-adding-parentheses-to-expression",
        "titleUS": "2232 Minimize Result by Adding Parentheses to Expression",
        "titleCN": "2232 向表达式添加括号后的最小结果",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimize Result by Adding Parentheses to Expression"
    },
    {
        "arg": "maximum-product-after-k-increments",
        "titleUS": "2233 Maximum Product After K Increments",
        "titleCN": "2233 K 次增加后的最大乘积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Product After K Increments"
    },
    {
        "arg": "maximum-total-beauty-of-the-gardens",
        "titleUS": "2234 Maximum Total Beauty of the Gardens",
        "titleCN": "2234 花园的最大总美丽值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Total Beauty of the Gardens"
    },
    {
        "arg": "add-two-integers",
        "titleUS": "2235 Add Two Integers",
        "titleCN": "2235 两整数相加",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Add Two Integers"
    },
    {
        "arg": "root-equals-sum-of-children",
        "titleUS": "2236 Root Equals Sum of Children",
        "titleCN": "2236 判断根结点是否等于子结点之和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Root Equals Sum of Children"
    },
    {
        "arg": "count-positions-on-street-with-required-brightness",
        "titleUS": "2237 Count Positions on Street With Required Brightness",
        "titleCN": "2237 计算街道上满足所需亮度的位置数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Count Positions on Street With Required Brightness"
    },
    {
        "arg": "find-closest-number-to-zero",
        "titleUS": "2239 Find Closest Number to Zero",
        "titleCN": "2239 找到最接近 0 的数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Closest Number to Zero"
    },
    {
        "arg": "number-of-ways-to-buy-pens-and-pencils",
        "titleUS": "2240 Number of Ways to Buy Pens and Pencils",
        "titleCN": "2240 买钢笔和铅笔的方案数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Ways to Buy Pens and Pencils"
    },
    {
        "arg": "design-an-atm-machine",
        "titleUS": "2241 Design an ATM Machine",
        "titleCN": "2241 设计一个 ATM 机器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Design an ATM Machine"
    },
    {
        "arg": "maximum-score-of-a-node-sequence",
        "titleUS": "2242 Maximum Score of a Node Sequence",
        "titleCN": "2242 节点序列的最大得分",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Score of a Node Sequence"
    },
    {
        "arg": "calculate-digit-sum-of-a-string",
        "titleUS": "2243 Calculate Digit Sum of a String",
        "titleCN": "2243 计算字符串的数字和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Calculate Digit Sum of a String"
    },
    {
        "arg": "minimum-rounds-to-complete-all-tasks",
        "titleUS": "2244 Minimum Rounds to Complete All Tasks",
        "titleCN": "2244 完成所有任务需要的最少轮数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Rounds to Complete All Tasks"
    },
    {
        "arg": "maximum-trailing-zeros-in-a-cornered-path",
        "titleUS": "2245 Maximum Trailing Zeros in a Cornered Path",
        "titleCN": "2245 转角路径的乘积中最多能有几个尾随零",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Trailing Zeros in a Cornered Path"
    },
    {
        "arg": "longest-path-with-different-adjacent-characters",
        "titleUS": "2246 Longest Path With Different Adjacent Characters",
        "titleCN": "2246 相邻字符不同的最长路径",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Longest Path With Different Adjacent Characters"
    },
    {
        "arg": "maximum-cost-of-trip-with-k-highways",
        "titleUS": "2247 Maximum Cost of Trip With K Highways",
        "titleCN": "2247 K 条高速公路的最大旅行费用",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Maximum Cost of Trip With K Highways"
    },
    {
        "arg": "intersection-of-multiple-arrays",
        "titleUS": "2248 Intersection of Multiple Arrays",
        "titleCN": "2248 多个数组求交集",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Intersection of Multiple Arrays"
    },
    {
        "arg": "count-lattice-points-inside-a-circle",
        "titleUS": "2249 Count Lattice Points Inside a Circle",
        "titleCN": "2249 统计圆内格点数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Lattice Points Inside a Circle"
    },
    {
        "arg": "count-number-of-rectangles-containing-each-point",
        "titleUS": "2250 Count Number of Rectangles Containing Each Point",
        "titleCN": "2250 统计包含每个点的矩形数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Number of Rectangles Containing Each Point"
    },
    {
        "arg": "number-of-flowers-in-full-bloom",
        "titleUS": "2251 Number of Flowers in Full Bloom",
        "titleCN": "2251 花期内花的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Flowers in Full Bloom"
    },
    {
        "arg": "design-video-sharing-platform",
        "titleUS": "2254 Design Video Sharing Platform",
        "titleCN": "2254 设计视频共享平台",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Design Video Sharing Platform"
    },
    {
        "arg": "count-prefixes-of-a-given-string",
        "titleUS": "2255 Count Prefixes of a Given String",
        "titleCN": "2255 统计是给定字符串前缀的字符串数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Prefixes of a Given String"
    },
    {
        "arg": "minimum-average-difference",
        "titleUS": "2256 Minimum Average Difference",
        "titleCN": "2256 最小平均差",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Average Difference"
    },
    {
        "arg": "count-unguarded-cells-in-the-grid",
        "titleUS": "2257 Count Unguarded Cells in the Grid",
        "titleCN": "2257 统计网格图中没有被保卫的格子数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Unguarded Cells in the Grid"
    },
    {
        "arg": "escape-the-spreading-fire",
        "titleUS": "2258 Escape the Spreading Fire",
        "titleCN": "2258 逃离火灾",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Escape the Spreading Fire"
    },
    {
        "arg": "remove-digit-from-number-to-maximize-result",
        "titleUS": "2259 Remove Digit From Number to Maximize Result",
        "titleCN": "2259 移除指定数字得到的最大结果",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Remove Digit From Number to Maximize Result"
    },
    {
        "arg": "minimum-consecutive-cards-to-pick-up",
        "titleUS": "2260 Minimum Consecutive Cards to Pick Up",
        "titleCN": "2260 必须拿起的最小连续卡牌数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Consecutive Cards to Pick Up"
    },
    {
        "arg": "k-divisible-elements-subarrays",
        "titleUS": "2261 K Divisible Elements Subarrays",
        "titleCN": "2261 含最多 K 个可整除元素的子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 K Divisible Elements Subarrays"
    },
    {
        "arg": "total-appeal-of-a-string",
        "titleUS": "2262 Total Appeal of A String",
        "titleCN": "2262 字符串的总引力",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Total Appeal of A String"
    },
    {
        "arg": "make-array-non-decreasing-or-non-increasing",
        "titleUS": "2263 Make Array Non-decreasing or Non-increasing",
        "titleCN": "2263 数组变为有序的最小操作次数",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Make Array Non-decreasing or Non-increasing"
    },
    {
        "arg": "largest-3-same-digit-number-in-string",
        "titleUS": "2264 Largest 3-Same-Digit Number in String",
        "titleCN": "2264 字符串中最大的 3 位相同数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Largest 3-Same-Digit Number in String"
    },
    {
        "arg": "count-nodes-equal-to-average-of-subtree",
        "titleUS": "2265 Count Nodes Equal to Average of Subtree",
        "titleCN": "2265 统计值等于子树平均值的节点数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Nodes Equal to Average of Subtree"
    },
    {
        "arg": "count-number-of-texts",
        "titleUS": "2266 Count Number of Texts",
        "titleCN": "2266 统计打字方案数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Number of Texts"
    },
    {
        "arg": "check-if-there-is-a-valid-parentheses-string-path",
        "titleUS": "2267  Check if There Is a Valid Parentheses String Path",
        "titleCN": "2267 检查是否有合法括号字符串路径",
        "subtitleUS": "Hard",
        "subtitleCN": "较难  Check if There Is a Valid Parentheses String Path"
    },
    {
        "arg": "minimum-number-of-keypresses",
        "titleUS": "2268 Minimum Number of Keypresses",
        "titleCN": "2268 最少按键次数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimum Number of Keypresses"
    },
    {
        "arg": "find-the-k-beauty-of-a-number",
        "titleUS": "2269 Find the K-Beauty of a Number",
        "titleCN": "2269 找到一个数字的 K 美丽值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the K-Beauty of a Number"
    },
    {
        "arg": "number-of-ways-to-split-array",
        "titleUS": "2270 Number of Ways to Split Array",
        "titleCN": "2270 分割数组的方案数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Ways to Split Array"
    },
    {
        "arg": "maximum-white-tiles-covered-by-a-carpet",
        "titleUS": "2271 Maximum White Tiles Covered by a Carpet",
        "titleCN": "2271 毯子覆盖的最多白色砖块数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum White Tiles Covered by a Carpet"
    },
    {
        "arg": "substring-with-largest-variance",
        "titleUS": "2272 Substring With Largest Variance",
        "titleCN": "2272 最大波动的子字符串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Substring With Largest Variance"
    },
    {
        "arg": "find-resultant-array-after-removing-anagrams",
        "titleUS": "2273 Find Resultant Array After Removing Anagrams",
        "titleCN": "2273 移除字母异位词后的结果数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Resultant Array After Removing Anagrams"
    },
    {
        "arg": "maximum-consecutive-floors-without-special-floors",
        "titleUS": "2274 Maximum Consecutive Floors Without Special Floors",
        "titleCN": "2274 不含特殊楼层的最大连续楼层数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Consecutive Floors Without Special Floors"
    },
    {
        "arg": "largest-combination-with-bitwise-and-greater-than-zero",
        "titleUS": "2275 Largest Combination With Bitwise AND Greater Than Zero",
        "titleCN": "2275 按位与结果大于零的最长组合",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Largest Combination With Bitwise AND Greater Than Zero"
    },
    {
        "arg": "count-integers-in-intervals",
        "titleUS": "2276 Count Integers in Intervals",
        "titleCN": "2276 统计区间中的整数数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Integers in Intervals"
    },
    {
        "arg": "closest-node-to-path-in-tree",
        "titleUS": "2277 Closest Node to Path in Tree",
        "titleCN": "2277 树中最接近路径的节点",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Closest Node to Path in Tree"
    },
    {
        "arg": "percentage-of-letter-in-string",
        "titleUS": "2278 Percentage of Letter in String",
        "titleCN": "2278 字母在字符串中的百分比",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Percentage of Letter in String"
    },
    {
        "arg": "maximum-bags-with-full-capacity-of-rocks",
        "titleUS": "2279 Maximum Bags With Full Capacity of Rocks",
        "titleCN": "2279 装满石头的背包的最大数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Bags With Full Capacity of Rocks"
    },
    {
        "arg": "minimum-lines-to-represent-a-line-chart",
        "titleUS": "2280 Minimum Lines to Represent a Line Chart",
        "titleCN": "2280 表示一个折线图的最少线段数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Lines to Represent a Line Chart"
    },
    {
        "arg": "sum-of-total-strength-of-wizards",
        "titleUS": "2281 Sum of Total Strength of Wizards",
        "titleCN": "2281 巫师的总力量和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Sum of Total Strength of Wizards"
    },
    {
        "arg": "number-of-people-that-can-be-seen-in-a-grid",
        "titleUS": "2282 Number of People That Can Be Seen in a Grid",
        "titleCN": "2282 在一个网格中可以看到的人数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of People That Can Be Seen in a Grid"
    },
    {
        "arg": "check-if-number-has-equal-digit-count-and-digit-value",
        "titleUS": "2283 Check if Number Has Equal Digit Count and Digit Value",
        "titleCN": "2283 判断一个数的数字计数是否等于数位的值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if Number Has Equal Digit Count and Digit Value"
    },
    {
        "arg": "sender-with-largest-word-count",
        "titleUS": "2284 Sender With Largest Word Count",
        "titleCN": "2284 最多单词数的发件人",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sender With Largest Word Count"
    },
    {
        "arg": "maximum-total-importance-of-roads",
        "titleUS": "2285 Maximum Total Importance of Roads",
        "titleCN": "2285 道路的最大总重要性",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Total Importance of Roads"
    },
    {
        "arg": "booking-concert-tickets-in-groups",
        "titleUS": "2286 Booking Concert Tickets in Groups",
        "titleCN": "2286 以组为单位订音乐会的门票",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Booking Concert Tickets in Groups"
    },
    {
        "arg": "rearrange-characters-to-make-target-string",
        "titleUS": "2287 Rearrange Characters to Make Target String",
        "titleCN": "2287 重排字符形成目标字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Rearrange Characters to Make Target String"
    },
    {
        "arg": "apply-discount-to-prices",
        "titleUS": "2288 Apply Discount to Prices",
        "titleCN": "2288 价格减免",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Apply Discount to Prices"
    },
    {
        "arg": "steps-to-make-array-non-decreasing",
        "titleUS": "2289 Steps to Make Array Non-decreasing",
        "titleCN": "2289 使数组按非递减顺序排列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Steps to Make Array Non-decreasing"
    },
    {
        "arg": "minimum-obstacle-removal-to-reach-corner",
        "titleUS": "2290 Minimum Obstacle Removal to Reach Corner",
        "titleCN": "2290 到达角落需要移除障碍物的最小数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Obstacle Removal to Reach Corner"
    },
    {
        "arg": "maximum-profit-from-trading-stocks",
        "titleUS": "2291 Maximum Profit From Trading Stocks",
        "titleCN": "2291 最大股票收益",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Profit From Trading Stocks"
    },
    {
        "arg": "min-max-game",
        "titleUS": "2293 Min Max Game",
        "titleCN": "2293 极大极小游戏",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Min Max Game"
    },
    {
        "arg": "partition-array-such-that-maximum-difference-is-k",
        "titleUS": "2294 Partition Array Such That Maximum Difference Is K",
        "titleCN": "2294 划分数组使最大差为 K",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Partition Array Such That Maximum Difference Is K"
    },
    {
        "arg": "replace-elements-in-an-array",
        "titleUS": "2295 Replace Elements in an Array",
        "titleCN": "2295 替换数组中的元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Replace Elements in an Array"
    },
    {
        "arg": "design-a-text-editor",
        "titleUS": "2296 Design a Text Editor",
        "titleCN": "2296 设计一个文本编辑器",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Design a Text Editor"
    },
    {
        "arg": "jump-game-viii",
        "titleUS": "2297 Jump Game VIII",
        "titleCN": "2297 跳跃游戏 VIII",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Jump Game VIII"
    },
    {
        "arg": "strong-password-checker-ii",
        "titleUS": "2299 Strong Password Checker II",
        "titleCN": "2299 强密码检验器 II",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Strong Password Checker II"
    },
    {
        "arg": "successful-pairs-of-spells-and-potions",
        "titleUS": "2300 Successful Pairs of Spells and Potions",
        "titleCN": "2300 咒语和药水的成功对数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Successful Pairs of Spells and Potions"
    },
    {
        "arg": "match-substring-after-replacement",
        "titleUS": "2301 Match Substring After Replacement",
        "titleCN": "2301 替换字符后匹配",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Match Substring After Replacement"
    },
    {
        "arg": "count-subarrays-with-score-less-than-k",
        "titleUS": "2302 Count Subarrays With Score Less Than K",
        "titleCN": "2302 统计得分小于 K 的子数组数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Subarrays With Score Less Than K"
    },
    {
        "arg": "calculate-amount-paid-in-taxes",
        "titleUS": "2303 Calculate Amount Paid in Taxes",
        "titleCN": "2303 计算应缴税款总额",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Calculate Amount Paid in Taxes"
    },
    {
        "arg": "minimum-path-cost-in-a-grid",
        "titleUS": "2304 Minimum Path Cost in a Grid",
        "titleCN": "2304 网格中的最小路径代价",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Path Cost in a Grid"
    },
    {
        "arg": "fair-distribution-of-cookies",
        "titleUS": "2305 Fair Distribution of Cookies",
        "titleCN": "2305 公平分发饼干",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Fair Distribution of Cookies"
    },
    {
        "arg": "naming-a-company",
        "titleUS": "2306 Naming a Company",
        "titleCN": "2306 公司命名",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Naming a Company"
    },
    {
        "arg": "check-for-contradictions-in-equations",
        "titleUS": "2307 Check for Contradictions in Equations",
        "titleCN": "2307 检查方程中的矛盾之处",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Check for Contradictions in Equations"
    },
    {
        "arg": "greatest-english-letter-in-upper-and-lower-case",
        "titleUS": "2309 Greatest English Letter in Upper and Lower Case",
        "titleCN": "2309 兼具大小写的最好英文字母",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Greatest English Letter in Upper and Lower Case"
    },
    {
        "arg": "sum-of-numbers-with-units-digit-k",
        "titleUS": "2310 Sum of Numbers With Units Digit K",
        "titleCN": "2310 个位数字为 K 的整数之和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum of Numbers With Units Digit K"
    },
    {
        "arg": "longest-binary-subsequence-less-than-or-equal-to-k",
        "titleUS": "2311 Longest Binary Subsequence Less Than or Equal to K",
        "titleCN": "2311 小于等于 K 的最长二进制子序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Binary Subsequence Less Than or Equal to K"
    },
    {
        "arg": "selling-pieces-of-wood",
        "titleUS": "2312 Selling Pieces of Wood",
        "titleCN": "2312 卖木头块",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Selling Pieces of Wood"
    },
    {
        "arg": "minimum-flips-in-binary-tree-to-get-result",
        "titleUS": "2313 Minimum Flips in Binary Tree to Get Result",
        "titleCN": "2313 二叉树中得到结果所需的最少翻转次数",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Minimum Flips in Binary Tree to Get Result"
    },
    {
        "arg": "count-asterisks",
        "titleUS": "2315 Count Asterisks",
        "titleCN": "2315 统计星号",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Asterisks"
    },
    {
        "arg": "count-unreachable-pairs-of-nodes-in-an-undirected-graph",
        "titleUS": "2316 Count Unreachable Pairs of Nodes in an Undirected Graph",
        "titleCN": "2316 统计无向图中无法互相到达点对数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Unreachable Pairs of Nodes in an Undirected Graph"
    },
    {
        "arg": "maximum-xor-after-operations",
        "titleUS": "2317 Maximum XOR After Operations ",
        "titleCN": "2317 操作后的最大异或和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum XOR After Operations "
    },
    {
        "arg": "number-of-distinct-roll-sequences",
        "titleUS": "2318 Number of Distinct Roll Sequences",
        "titleCN": "2318 不同骰子序列的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Distinct Roll Sequences"
    },
    {
        "arg": "check-if-matrix-is-x-matrix",
        "titleUS": "2319 Check if Matrix Is X-Matrix",
        "titleCN": "2319 判断矩阵是否是一个 X 矩阵",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if Matrix Is X-Matrix"
    },
    {
        "arg": "count-number-of-ways-to-place-houses",
        "titleUS": "2320 Count Number of Ways to Place Houses",
        "titleCN": "2320 统计放置房子的方式数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Number of Ways to Place Houses"
    },
    {
        "arg": "maximum-score-of-spliced-array",
        "titleUS": "2321 Maximum Score Of Spliced Array",
        "titleCN": "2321 拼接数组的最大分数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Score Of Spliced Array"
    },
    {
        "arg": "minimum-score-after-removals-on-a-tree",
        "titleUS": "2322 Minimum Score After Removals on a Tree",
        "titleCN": "2322 从树中删除边的最小分数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Score After Removals on a Tree"
    },
    {
        "arg": "find-minimum-time-to-finish-all-jobs-ii",
        "titleUS": "2323 Find Minimum Time to Finish All Jobs II",
        "titleCN": "2323 完成所有工作的最短时间 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Find Minimum Time to Finish All Jobs II"
    },
    {
        "arg": "decode-the-message",
        "titleUS": "2325 Decode the Message",
        "titleCN": "2325 解密消息",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Decode the Message"
    },
    {
        "arg": "spiral-matrix-iv",
        "titleUS": "2326 Spiral Matrix IV",
        "titleCN": "2326 螺旋矩阵 IV",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Spiral Matrix IV"
    },
    {
        "arg": "number-of-people-aware-of-a-secret",
        "titleUS": "2327 Number of People Aware of a Secret",
        "titleCN": "2327 知道秘密的人数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of People Aware of a Secret"
    },
    {
        "arg": "number-of-increasing-paths-in-a-grid",
        "titleUS": "2328 Number of Increasing Paths in a Grid",
        "titleCN": "2328 网格图中递增路径的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Increasing Paths in a Grid"
    },
    {
        "arg": "valid-palindrome-iv",
        "titleUS": "2330 Valid Palindrome IV",
        "titleCN": "2330 验证回文串 IV",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Valid Palindrome IV"
    },
    {
        "arg": "evaluate-boolean-binary-tree",
        "titleUS": "2331 Evaluate Boolean Binary Tree",
        "titleCN": "2331 计算布尔二叉树的值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Evaluate Boolean Binary Tree"
    },
    {
        "arg": "the-latest-time-to-catch-a-bus",
        "titleUS": "2332 The Latest Time to Catch a Bus",
        "titleCN": "2332 坐上公交的最晚时间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 The Latest Time to Catch a Bus"
    },
    {
        "arg": "minimum-sum-of-squared-difference",
        "titleUS": "2333 Minimum Sum of Squared Difference",
        "titleCN": "2333 最小差值平方和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Sum of Squared Difference"
    },
    {
        "arg": "subarray-with-elements-greater-than-varying-threshold",
        "titleUS": "2334 Subarray With Elements Greater Than Varying Threshold",
        "titleCN": "2334 元素值大于变化阈值的子数组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Subarray With Elements Greater Than Varying Threshold"
    },
    {
        "arg": "minimum-amount-of-time-to-fill-cups",
        "titleUS": "2335 Minimum Amount of Time to Fill Cups",
        "titleCN": "2335 装满杯子需要的最短总时长",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Amount of Time to Fill Cups"
    },
    {
        "arg": "smallest-number-in-infinite-set",
        "titleUS": "2336 Smallest Number in Infinite Set",
        "titleCN": "2336 无限集中的最小数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Smallest Number in Infinite Set"
    },
    {
        "arg": "move-pieces-to-obtain-a-string",
        "titleUS": "2337 Move Pieces to Obtain a String",
        "titleCN": "2337 移动片段得到字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Move Pieces to Obtain a String"
    },
    {
        "arg": "count-the-number-of-ideal-arrays",
        "titleUS": "2338 Count the Number of Ideal Arrays",
        "titleCN": "2338 统计理想数组的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count the Number of Ideal Arrays"
    },
    {
        "arg": "minimum-adjacent-swaps-to-make-a-valid-array",
        "titleUS": "2340 Minimum Adjacent Swaps to Make a Valid Array",
        "titleCN": "2340 生成有效数组的最少交换次数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimum Adjacent Swaps to Make a Valid Array"
    },
    {
        "arg": "maximum-number-of-pairs-in-array",
        "titleUS": "2341 Maximum Number of Pairs in Array",
        "titleCN": "2341 数组能形成多少数对",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Number of Pairs in Array"
    },
    {
        "arg": "max-sum-of-a-pair-with-equal-sum-of-digits",
        "titleUS": "2342 Max Sum of a Pair With Equal Sum of Digits",
        "titleCN": "2342 数位和相等数对的最大和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Max Sum of a Pair With Equal Sum of Digits"
    },
    {
        "arg": "query-kth-smallest-trimmed-number",
        "titleUS": "2343 Query Kth Smallest Trimmed Number",
        "titleCN": "2343 裁剪数字后查询第 K 小的数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Query Kth Smallest Trimmed Number"
    },
    {
        "arg": "minimum-deletions-to-make-array-divisible",
        "titleUS": "2344 Minimum Deletions to Make Array Divisible",
        "titleCN": "2344 使数组可以被整除的最少删除次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Deletions to Make Array Divisible"
    },
    {
        "arg": "finding-the-number-of-visible-mountains",
        "titleUS": "2345 Finding the Number of Visible Mountains",
        "titleCN": "2345 寻找可见山的数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Finding the Number of Visible Mountains"
    },
    {
        "arg": "best-poker-hand",
        "titleUS": "2347 Best Poker Hand",
        "titleCN": "2347 最好的扑克手牌",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Best Poker Hand"
    },
    {
        "arg": "number-of-zero-filled-subarrays",
        "titleUS": "2348 Number of Zero-Filled Subarrays",
        "titleCN": "2348 全 0 子数组的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Zero-Filled Subarrays"
    },
    {
        "arg": "design-a-number-container-system",
        "titleUS": "2349 Design a Number Container System",
        "titleCN": "2349 设计数字容器系统",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Design a Number Container System"
    },
    {
        "arg": "shortest-impossible-sequence-of-rolls",
        "titleUS": "2350 Shortest Impossible Sequence of Rolls",
        "titleCN": "2350 不可能得到的最短骰子序列",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Shortest Impossible Sequence of Rolls"
    },
    {
        "arg": "first-letter-to-appear-twice",
        "titleUS": "2351 First Letter to Appear Twice",
        "titleCN": "2351 第一个出现两次的字母",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 First Letter to Appear Twice"
    },
    {
        "arg": "equal-row-and-column-pairs",
        "titleUS": "2352 Equal Row and Column Pairs",
        "titleCN": "2352 相等行列对",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Equal Row and Column Pairs"
    },
    {
        "arg": "design-a-food-rating-system",
        "titleUS": "2353 Design a Food Rating System",
        "titleCN": "2353 设计食物评分系统",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Design a Food Rating System"
    },
    {
        "arg": "number-of-excellent-pairs",
        "titleUS": "2354 Number of Excellent Pairs",
        "titleCN": "2354 优质数对的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Excellent Pairs"
    },
    {
        "arg": "maximum-number-of-books-you-can-take",
        "titleUS": "2355 Maximum Number of Books You Can Take",
        "titleCN": "2355 你能拿走的最大图书数量",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Maximum Number of Books You Can Take"
    },
    {
        "arg": "make-array-zero-by-subtracting-equal-amounts",
        "titleUS": "2357 Make Array Zero by Subtracting Equal Amounts",
        "titleCN": "2357 使数组中所有元素都等于零",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Make Array Zero by Subtracting Equal Amounts"
    },
    {
        "arg": "maximum-number-of-groups-entering-a-competition",
        "titleUS": "2358 Maximum Number of Groups Entering a Competition",
        "titleCN": "2358 分组的最大数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Groups Entering a Competition"
    },
    {
        "arg": "find-closest-node-to-given-two-nodes",
        "titleUS": "2359 Find Closest Node to Given Two Nodes",
        "titleCN": "2359 找到离给定两个节点最近的节点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Closest Node to Given Two Nodes"
    },
    {
        "arg": "longest-cycle-in-a-graph",
        "titleUS": "2360 Longest Cycle in a Graph",
        "titleCN": "2360 图中的最长环",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Longest Cycle in a Graph"
    },
    {
        "arg": "minimum-costs-using-the-train-line",
        "titleUS": "2361 Minimum Costs Using the Train Line",
        "titleCN": "2361 乘坐火车路线的最少费用",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Minimum Costs Using the Train Line"
    },
    {
        "arg": "merge-similar-items",
        "titleUS": "2363 Merge Similar Items",
        "titleCN": "2363 合并相似的物品",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Merge Similar Items"
    },
    {
        "arg": "count-number-of-bad-pairs",
        "titleUS": "2364 Count Number of Bad Pairs",
        "titleCN": "2364 统计坏数对的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Number of Bad Pairs"
    },
    {
        "arg": "task-scheduler-ii",
        "titleUS": "2365 Task Scheduler II",
        "titleCN": "2365 任务调度器 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Task Scheduler II"
    },
    {
        "arg": "minimum-replacements-to-sort-the-array",
        "titleUS": "2366 Minimum Replacements to Sort the Array",
        "titleCN": "2366 将数组排序的最少替换次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Replacements to Sort the Array"
    },
    {
        "arg": "number-of-arithmetic-triplets",
        "titleUS": "2367 Number of Arithmetic Triplets",
        "titleCN": "2367 算术三元组的数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Arithmetic Triplets"
    },
    {
        "arg": "reachable-nodes-with-restrictions",
        "titleUS": "2368 Reachable Nodes With Restrictions",
        "titleCN": "2368 受限条件下可到达节点的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reachable Nodes With Restrictions"
    },
    {
        "arg": "check-if-there-is-a-valid-partition-for-the-array",
        "titleUS": "2369 Check if There is a Valid Partition For The Array",
        "titleCN": "2369 检查数组是否存在有效划分",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Check if There is a Valid Partition For The Array"
    },
    {
        "arg": "longest-ideal-subsequence",
        "titleUS": "2370 Longest Ideal Subsequence",
        "titleCN": "2370 最长理想子序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Ideal Subsequence"
    },
    {
        "arg": "minimize-maximum-value-in-a-grid",
        "titleUS": "2371 Minimize Maximum Value in a Grid",
        "titleCN": "2371 最小化网格中的最大值",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Minimize Maximum Value in a Grid"
    },
    {
        "arg": "largest-local-values-in-a-matrix",
        "titleUS": "2373 Largest Local Values in a Matrix",
        "titleCN": "2373 矩阵中的局部最大值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Largest Local Values in a Matrix"
    },
    {
        "arg": "node-with-highest-edge-score",
        "titleUS": "2374 Node With Highest Edge Score",
        "titleCN": "2374 边积分最高的节点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Node With Highest Edge Score"
    },
    {
        "arg": "construct-smallest-number-from-di-string",
        "titleUS": "2375 Construct Smallest Number From DI String",
        "titleCN": "2375 根据模式串构造最小数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Construct Smallest Number From DI String"
    },
    {
        "arg": "count-special-integers",
        "titleUS": "2376 Count Special Integers",
        "titleCN": "2376 统计特殊整数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Special Integers"
    },
    {
        "arg": "choose-edges-to-maximize-score-in-a-tree",
        "titleUS": "2378 Choose Edges to Maximize Score in a Tree",
        "titleCN": "2378 选择边来最大化树的得分",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Choose Edges to Maximize Score in a Tree"
    },
    {
        "arg": "minimum-recolors-to-get-k-consecutive-black-blocks",
        "titleUS": "2379 Minimum Recolors to Get K Consecutive Black Blocks",
        "titleCN": "2379 得到 K 个黑块的最少涂色次数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Recolors to Get K Consecutive Black Blocks"
    },
    {
        "arg": "time-needed-to-rearrange-a-binary-string",
        "titleUS": "2380 Time Needed to Rearrange a Binary String",
        "titleCN": "2380 二进制字符串重新安排顺序需要的时间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Time Needed to Rearrange a Binary String"
    },
    {
        "arg": "shifting-letters-ii",
        "titleUS": "2381 Shifting Letters II",
        "titleCN": "2381 字母移位 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Shifting Letters II"
    },
    {
        "arg": "maximum-segment-sum-after-removals",
        "titleUS": "2382 Maximum Segment Sum After Removals",
        "titleCN": "2382 删除操作后的最大子段和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Segment Sum After Removals"
    },
    {
        "arg": "minimum-hours-of-training-to-win-a-competition",
        "titleUS": "2383 Minimum Hours of Training to Win a Competition",
        "titleCN": "2383 赢得比赛需要的最少训练时长",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Hours of Training to Win a Competition"
    },
    {
        "arg": "largest-palindromic-number",
        "titleUS": "2384 Largest Palindromic Number",
        "titleCN": "2384 最大回文数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Largest Palindromic Number"
    },
    {
        "arg": "amount-of-time-for-binary-tree-to-be-infected",
        "titleUS": "2385 Amount of Time for Binary Tree to Be Infected",
        "titleCN": "2385 感染二叉树需要的总时间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Amount of Time for Binary Tree to Be Infected"
    },
    {
        "arg": "find-the-k-sum-of-an-array",
        "titleUS": "2386 Find the K-Sum of an Array",
        "titleCN": "2386 找出数组的第 K 大和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find the K-Sum of an Array"
    },
    {
        "arg": "median-of-a-row-wise-sorted-matrix",
        "titleUS": "2387 Median of a Row Wise Sorted Matrix",
        "titleCN": "2387 行排序矩阵的中位数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Median of a Row Wise Sorted Matrix"
    },
    {
        "arg": "longest-subsequence-with-limited-sum",
        "titleUS": "2389 Longest Subsequence With Limited Sum",
        "titleCN": "2389 和有限的最长子序列",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Longest Subsequence With Limited Sum"
    },
    {
        "arg": "removing-stars-from-a-string",
        "titleUS": "2390 Removing Stars From a String",
        "titleCN": "2390 从字符串中移除星号",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Removing Stars From a String"
    },
    {
        "arg": "minimum-amount-of-time-to-collect-garbage",
        "titleUS": "2391 Minimum Amount of Time to Collect Garbage",
        "titleCN": "2391 收集垃圾的最少总时间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Amount of Time to Collect Garbage"
    },
    {
        "arg": "build-a-matrix-with-conditions",
        "titleUS": "2392 Build a Matrix With Conditions",
        "titleCN": "2392 给定条件下构造矩阵",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Build a Matrix With Conditions"
    },
    {
        "arg": "count-strictly-increasing-subarrays",
        "titleUS": "2393 Count Strictly Increasing Subarrays",
        "titleCN": "2393 严格递增的子数组个数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Count Strictly Increasing Subarrays"
    },
    {
        "arg": "find-subarrays-with-equal-sum",
        "titleUS": "2395 Find Subarrays With Equal Sum",
        "titleCN": "2395 和相等的子数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Subarrays With Equal Sum"
    },
    {
        "arg": "strictly-palindromic-number",
        "titleUS": "2396 Strictly Palindromic Number",
        "titleCN": "2396 严格回文的数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Strictly Palindromic Number"
    },
    {
        "arg": "maximum-rows-covered-by-columns",
        "titleUS": "2397 Maximum Rows Covered by Columns",
        "titleCN": "2397 被列覆盖的最多行数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Rows Covered by Columns"
    },
    {
        "arg": "maximum-number-of-robots-within-budget",
        "titleUS": "2398 Maximum Number of Robots Within Budget",
        "titleCN": "2398 预算内的最多机器人数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Number of Robots Within Budget"
    },
    {
        "arg": "check-distances-between-same-letters",
        "titleUS": "2399 Check Distances Between Same Letters",
        "titleCN": "2399 检查相同字母间的距离",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check Distances Between Same Letters"
    },
    {
        "arg": "number-of-ways-to-reach-a-position-after-exactly-k-steps",
        "titleUS": "2400 Number of Ways to Reach a Position After Exactly k Steps",
        "titleCN": "2400 恰好移动 k 步到达某一位置的方法数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Ways to Reach a Position After Exactly k Steps"
    },
    {
        "arg": "longest-nice-subarray",
        "titleUS": "2401 Longest Nice Subarray",
        "titleCN": "2401 最长优雅子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Nice Subarray"
    },
    {
        "arg": "meeting-rooms-iii",
        "titleUS": "2402 Meeting Rooms III",
        "titleCN": "2402 会议室 III",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Meeting Rooms III"
    },
    {
        "arg": "minimum-time-to-kill-all-monsters",
        "titleUS": "2403 Minimum Time to Kill All Monsters",
        "titleCN": "2403 杀死所有怪物的最短时间",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Minimum Time to Kill All Monsters"
    },
    {
        "arg": "most-frequent-even-element",
        "titleUS": "2404 Most Frequent Even Element",
        "titleCN": "2404 出现最频繁的偶数元素",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Most Frequent Even Element"
    },
    {
        "arg": "optimal-partition-of-string",
        "titleUS": "2405 Optimal Partition of String",
        "titleCN": "2405 子字符串的最优划分",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Optimal Partition of String"
    },
    {
        "arg": "divide-intervals-into-minimum-number-of-groups",
        "titleUS": "2406 Divide Intervals Into Minimum Number of Groups",
        "titleCN": "2406 将区间分为最少组数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Divide Intervals Into Minimum Number of Groups"
    },
    {
        "arg": "longest-increasing-subsequence-ii",
        "titleUS": "2407 Longest Increasing Subsequence II",
        "titleCN": "2407 最长递增子序列 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Longest Increasing Subsequence II"
    },
    {
        "arg": "design-sql",
        "titleUS": "2408 Design SQL",
        "titleCN": "2408 设计 SQL",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Design SQL"
    },
    {
        "arg": "count-days-spent-together",
        "titleUS": "2409 Count Days Spent Together",
        "titleCN": "2409 统计共同度过的日子数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Days Spent Together"
    },
    {
        "arg": "maximum-matching-of-players-with-trainers",
        "titleUS": "2410 Maximum Matching of Players With Trainers",
        "titleCN": "2410 运动员和训练师的最大匹配数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Matching of Players With Trainers"
    },
    {
        "arg": "smallest-subarrays-with-maximum-bitwise-or",
        "titleUS": "2411 Smallest Subarrays With Maximum Bitwise OR",
        "titleCN": "2411 按位或最大的最小子数组长度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Smallest Subarrays With Maximum Bitwise OR"
    },
    {
        "arg": "minimum-money-required-before-transactions",
        "titleUS": "2412 Minimum Money Required Before Transactions",
        "titleCN": "2412 完成所有交易的初始最少钱数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Money Required Before Transactions"
    },
    {
        "arg": "smallest-even-multiple",
        "titleUS": "2413 Smallest Even Multiple",
        "titleCN": "2413 最小偶倍数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Smallest Even Multiple"
    },
    {
        "arg": "length-of-the-longest-alphabetical-continuous-substring",
        "titleUS": "2414 Length of the Longest Alphabetical Continuous Substring",
        "titleCN": "2414 最长的字母序连续子字符串的长度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Length of the Longest Alphabetical Continuous Substring"
    },
    {
        "arg": "reverse-odd-levels-of-binary-tree",
        "titleUS": "2415 Reverse Odd Levels of Binary Tree",
        "titleCN": "2415 反转二叉树的奇数层",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reverse Odd Levels of Binary Tree"
    },
    {
        "arg": "sum-of-prefix-scores-of-strings",
        "titleUS": "2416 Sum of Prefix Scores of Strings",
        "titleCN": "2416 字符串的前缀分数和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Sum of Prefix Scores of Strings"
    },
    {
        "arg": "closest-fair-integer",
        "titleUS": "2417 Closest Fair Integer",
        "titleCN": "2417 最近的公平整数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Closest Fair Integer"
    },
    {
        "arg": "sort-the-people",
        "titleUS": "2418 Sort the People",
        "titleCN": "2418 按身高排序",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sort the People"
    },
    {
        "arg": "longest-subarray-with-maximum-bitwise-and",
        "titleUS": "2419 Longest Subarray With Maximum Bitwise AND",
        "titleCN": "2419 按位与最大的最长子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Subarray With Maximum Bitwise AND"
    },
    {
        "arg": "find-all-good-indices",
        "titleUS": "2420 Find All Good Indices",
        "titleCN": "2420 找到所有好下标",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find All Good Indices"
    },
    {
        "arg": "number-of-good-paths",
        "titleUS": "2421 Number of Good Paths",
        "titleCN": "2421 好路径的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Good Paths"
    },
    {
        "arg": "merge-operations-to-turn-array-into-a-palindrome",
        "titleUS": "2422 Merge Operations to Turn Array Into a Palindrome",
        "titleCN": "2422 使用合并操作将数组转换为回文序列",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Merge Operations to Turn Array Into a Palindrome"
    },
    {
        "arg": "remove-letter-to-equalize-frequency",
        "titleUS": "2423 Remove Letter To Equalize Frequency",
        "titleCN": "2423 删除字符使频率相同",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Remove Letter To Equalize Frequency"
    },
    {
        "arg": "longest-uploaded-prefix",
        "titleUS": "2424 Longest Uploaded Prefix",
        "titleCN": "2424 最长上传前缀",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Uploaded Prefix"
    },
    {
        "arg": "bitwise-xor-of-all-pairings",
        "titleUS": "2425 Bitwise XOR of All Pairings",
        "titleCN": "2425 所有数对的异或和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Bitwise XOR of All Pairings"
    },
    {
        "arg": "number-of-pairs-satisfying-inequality",
        "titleUS": "2426 Number of Pairs Satisfying Inequality",
        "titleCN": "2426 满足不等式的数对数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Pairs Satisfying Inequality"
    },
    {
        "arg": "number-of-common-factors",
        "titleUS": "2427 Number of Common Factors",
        "titleCN": "2427 公因子的数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Common Factors"
    },
    {
        "arg": "maximum-sum-of-an-hourglass",
        "titleUS": "2428 Maximum Sum of an Hourglass",
        "titleCN": "2428 沙漏的最大总和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Sum of an Hourglass"
    },
    {
        "arg": "minimize-xor",
        "titleUS": "2429 Minimize XOR",
        "titleCN": "2429 最小异或",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimize XOR"
    },
    {
        "arg": "maximum-deletions-on-a-string",
        "titleUS": "2430 Maximum Deletions on a String",
        "titleCN": "2430 对字母串可执行的最大删除数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Deletions on a String"
    },
    {
        "arg": "maximize-total-tastiness-of-purchased-fruits",
        "titleUS": "2431 Maximize Total Tastiness of Purchased Fruits",
        "titleCN": "2431 最大限度地提高购买水果的口味",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximize Total Tastiness of Purchased Fruits"
    },
    {
        "arg": "the-employee-that-worked-on-the-longest-task",
        "titleUS": "2432 The Employee That Worked on the Longest Task",
        "titleCN": "2432 处理用时最长的那个任务的员工",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 The Employee That Worked on the Longest Task"
    },
    {
        "arg": "find-the-original-array-of-prefix-xor",
        "titleUS": "2433 Find The Original Array of Prefix Xor",
        "titleCN": "2433 找出前缀异或的原始数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find The Original Array of Prefix Xor"
    },
    {
        "arg": "using-a-robot-to-print-the-lexicographically-smallest-string",
        "titleUS": "2434 Using a Robot to Print the Lexicographically Smallest String",
        "titleCN": "2434 使用机器人打印字典序最小的字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Using a Robot to Print the Lexicographically Smallest String"
    },
    {
        "arg": "paths-in-matrix-whose-sum-is-divisible-by-k",
        "titleUS": "2435 Paths in Matrix Whose Sum Is Divisible by K",
        "titleCN": "2435 矩阵中和能被 K 整除的路径",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Paths in Matrix Whose Sum Is Divisible by K"
    },
    {
        "arg": "minimum-split-into-subarrays-with-gcd-greater-than-one",
        "titleUS": "2436 Minimum Split Into Subarrays With GCD Greater Than One",
        "titleCN": "2436 使子数组最大公约数大于一的最小分割数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimum Split Into Subarrays With GCD Greater Than One"
    },
    {
        "arg": "number-of-valid-clock-times",
        "titleUS": "2437 Number of Valid Clock Times",
        "titleCN": "2437 有效时间的数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Valid Clock Times"
    },
    {
        "arg": "range-product-queries-of-powers",
        "titleUS": "2438 Range Product Queries of Powers",
        "titleCN": "2438 二的幂数组中查询范围内的乘积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Range Product Queries of Powers"
    },
    {
        "arg": "minimize-maximum-of-array",
        "titleUS": "2439 Minimize Maximum of Array",
        "titleCN": "2439 最小化数组中的最大值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimize Maximum of Array"
    },
    {
        "arg": "create-components-with-same-value",
        "titleUS": "2440 Create Components With Same Value",
        "titleCN": "2440 创建价值相同的连通块",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Create Components With Same Value"
    },
    {
        "arg": "largest-positive-integer-that-exists-with-its-negative",
        "titleUS": "2441 Largest Positive Integer That Exists With Its Negative",
        "titleCN": "2441 与对应负数同时存在的最大正整数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Largest Positive Integer That Exists With Its Negative"
    },
    {
        "arg": "count-number-of-distinct-integers-after-reverse-operations",
        "titleUS": "2442 Count Number of Distinct Integers After Reverse Operations",
        "titleCN": "2442 反转之后不同整数的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Number of Distinct Integers After Reverse Operations"
    },
    {
        "arg": "sum-of-number-and-its-reverse",
        "titleUS": "2443 Sum of Number and Its Reverse",
        "titleCN": "2443 反转之后的数字和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum of Number and Its Reverse"
    },
    {
        "arg": "count-subarrays-with-fixed-bounds",
        "titleUS": "2444 Count Subarrays With Fixed Bounds",
        "titleCN": "2444 统计定界子数组的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Subarrays With Fixed Bounds"
    },
    {
        "arg": "number-of-nodes-with-value-one",
        "titleUS": "2445 Number of Nodes With Value One",
        "titleCN": "2445 值为 1 的节点数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Nodes With Value One"
    },
    {
        "arg": "determine-if-two-events-have-conflict",
        "titleUS": "2446 Determine if Two Events Have Conflict",
        "titleCN": "2446 判断两个事件是否存在冲突",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Determine if Two Events Have Conflict"
    },
    {
        "arg": "number-of-subarrays-with-gcd-equal-to-k",
        "titleUS": "2447 Number of Subarrays With GCD Equal to K",
        "titleCN": "2447 最大公因数等于 K 的子数组数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Subarrays With GCD Equal to K"
    },
    {
        "arg": "minimum-cost-to-make-array-equal",
        "titleUS": "2448 Minimum Cost to Make Array Equal",
        "titleCN": "2448 使数组相等的最小开销",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Cost to Make Array Equal"
    },
    {
        "arg": "minimum-number-of-operations-to-make-arrays-similar",
        "titleUS": "2449 Minimum Number of Operations to Make Arrays Similar",
        "titleCN": "2449 使数组相似的最少操作次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Number of Operations to Make Arrays Similar"
    },
    {
        "arg": "number-of-distinct-binary-strings-after-applying-operations",
        "titleUS": "2450 Number of Distinct Binary Strings After Applying Operations",
        "titleCN": "2450 应用操作后不同二进制字符串的数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Distinct Binary Strings After Applying Operations"
    },
    {
        "arg": "odd-string-difference",
        "titleUS": "2451 Odd String Difference",
        "titleCN": "2451 差值数组不同的字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Odd String Difference"
    },
    {
        "arg": "words-within-two-edits-of-dictionary",
        "titleUS": "2452 Words Within Two Edits of Dictionary",
        "titleCN": "2452 距离字典两次编辑以内的单词",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Words Within Two Edits of Dictionary"
    },
    {
        "arg": "destroy-sequential-targets",
        "titleUS": "2453 Destroy Sequential Targets",
        "titleCN": "2453 摧毁一系列目标",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Destroy Sequential Targets"
    },
    {
        "arg": "next-greater-element-iv",
        "titleUS": "2454 Next Greater Element IV",
        "titleCN": "2454 下一个更大元素 IV",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Next Greater Element IV"
    },
    {
        "arg": "average-value-of-even-numbers-that-are-divisible-by-three",
        "titleUS": "2455 Average Value of Even Numbers That Are Divisible by Three",
        "titleCN": "2455 可被三整除的偶数的平均值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Average Value of Even Numbers That Are Divisible by Three"
    },
    {
        "arg": "most-popular-video-creator",
        "titleUS": "2456 Most Popular Video Creator",
        "titleCN": "2456 最流行的视频创作者",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Most Popular Video Creator"
    },
    {
        "arg": "minimum-addition-to-make-integer-beautiful",
        "titleUS": "2457 Minimum Addition to Make Integer Beautiful",
        "titleCN": "2457 美丽整数的最小增量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Addition to Make Integer Beautiful"
    },
    {
        "arg": "height-of-binary-tree-after-subtree-removal-queries",
        "titleUS": "2458 Height of Binary Tree After Subtree Removal Queries",
        "titleCN": "2458 移除子树后的二叉树高度",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Height of Binary Tree After Subtree Removal Queries"
    },
    {
        "arg": "sort-array-by-moving-items-to-empty-space",
        "titleUS": "2459 Sort Array by Moving Items to Empty Space",
        "titleCN": "2459 通过移动项目到空白区域来排序数组",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Sort Array by Moving Items to Empty Space"
    },
    {
        "arg": "apply-operations-to-an-array",
        "titleUS": "2460 Apply Operations to an Array",
        "titleCN": "2460 对数组执行操作",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Apply Operations to an Array"
    },
    {
        "arg": "maximum-sum-of-distinct-subarrays-with-length-k",
        "titleUS": "2461 Maximum Sum of Distinct Subarrays With Length K",
        "titleCN": "2461 长度为 K 子数组中的最大和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Sum of Distinct Subarrays With Length K"
    },
    {
        "arg": "total-cost-to-hire-k-workers",
        "titleUS": "2462 Total Cost to Hire K Workers",
        "titleCN": "2462 雇佣 K 位工人的总代价",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Total Cost to Hire K Workers"
    },
    {
        "arg": "minimum-total-distance-traveled",
        "titleUS": "2463 Minimum Total Distance Traveled",
        "titleCN": "2463 最小移动总距离",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Total Distance Traveled"
    },
    {
        "arg": "minimum-subarrays-in-a-valid-split",
        "titleUS": "2464 Minimum Subarrays in a Valid Split",
        "titleCN": "2464 有效分割中的最少子数组数目",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimum Subarrays in a Valid Split"
    },
    {
        "arg": "number-of-distinct-averages",
        "titleUS": "2465 Number of Distinct Averages",
        "titleCN": "2465 不同的平均值数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Distinct Averages"
    },
    {
        "arg": "count-ways-to-build-good-strings",
        "titleUS": "2466 Count Ways To Build Good Strings",
        "titleCN": "2466 统计构造好字符串的方案数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Ways To Build Good Strings"
    },
    {
        "arg": "most-profitable-path-in-a-tree",
        "titleUS": "2467 Most Profitable Path in a Tree",
        "titleCN": "2467 树上最大得分和路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Most Profitable Path in a Tree"
    },
    {
        "arg": "split-message-based-on-limit",
        "titleUS": "2468 Split Message Based on Limit",
        "titleCN": "2468 根据限制分割消息",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Split Message Based on Limit"
    },
    {
        "arg": "convert-the-temperature",
        "titleUS": "2469 Convert the Temperature",
        "titleCN": "2469 温度转换",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Convert the Temperature"
    },
    {
        "arg": "number-of-subarrays-with-lcm-equal-to-k",
        "titleUS": "2470 Number of Subarrays With LCM Equal to K",
        "titleCN": "2470 最小公倍数为 K 的子数组数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Subarrays With LCM Equal to K"
    },
    {
        "arg": "minimum-number-of-operations-to-sort-a-binary-tree-by-level",
        "titleUS": "2471 Minimum Number of Operations to Sort a Binary Tree by Level",
        "titleCN": "2471 逐层排序二叉树所需的最少操作数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Operations to Sort a Binary Tree by Level"
    },
    {
        "arg": "maximum-number-of-non-overlapping-palindrome-substrings",
        "titleUS": "2472 Maximum Number of Non-overlapping Palindrome Substrings",
        "titleCN": "2472 不重叠回文子字符串的最大数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Number of Non-overlapping Palindrome Substrings"
    },
    {
        "arg": "minimum-cost-to-buy-apples",
        "titleUS": "2473 Minimum Cost to Buy Apples",
        "titleCN": "2473 购买苹果的最低成本",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimum Cost to Buy Apples"
    },
    {
        "arg": "number-of-unequal-triplets-in-array",
        "titleUS": "2475 Number of Unequal Triplets in Array",
        "titleCN": "2475 数组中不等三元组的数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Unequal Triplets in Array"
    },
    {
        "arg": "closest-nodes-queries-in-a-binary-search-tree",
        "titleUS": "2476 Closest Nodes Queries in a Binary Search Tree",
        "titleCN": "2476 二叉搜索树最近节点查询",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Closest Nodes Queries in a Binary Search Tree"
    },
    {
        "arg": "minimum-fuel-cost-to-report-to-the-capital",
        "titleUS": "2477 Minimum Fuel Cost to Report to the Capital",
        "titleCN": "2477 到达首都的最少油耗",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Fuel Cost to Report to the Capital"
    },
    {
        "arg": "number-of-beautiful-partitions",
        "titleUS": "2478 Number of Beautiful Partitions",
        "titleCN": "2478 完美分割的方案数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Beautiful Partitions"
    },
    {
        "arg": "maximum-xor-of-two-non-overlapping-subtrees",
        "titleUS": "2479 Maximum XOR of Two Non-Overlapping Subtrees",
        "titleCN": "2479 两个不重叠子树的最大异或值",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Maximum XOR of Two Non-Overlapping Subtrees"
    },
    {
        "arg": "minimum-cuts-to-divide-a-circle",
        "titleUS": "2481 Minimum Cuts to Divide a Circle",
        "titleCN": "2481 分割圆的最少切割次数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Cuts to Divide a Circle"
    },
    {
        "arg": "difference-between-ones-and-zeros-in-row-and-column",
        "titleUS": "2482 Difference Between Ones and Zeros in Row and Column",
        "titleCN": "2482 行和列中一和零的差值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Difference Between Ones and Zeros in Row and Column"
    },
    {
        "arg": "minimum-penalty-for-a-shop",
        "titleUS": "2483 Minimum Penalty for a Shop",
        "titleCN": "2483 商店的最少代价",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Penalty for a Shop"
    },
    {
        "arg": "count-palindromic-subsequences",
        "titleUS": "2484 Count Palindromic Subsequences",
        "titleCN": "2484 统计回文子序列数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Palindromic Subsequences"
    },
    {
        "arg": "find-the-pivot-integer",
        "titleUS": "2485 Find the Pivot Integer",
        "titleCN": "2485 找出中枢整数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Pivot Integer"
    },
    {
        "arg": "append-characters-to-string-to-make-subsequence",
        "titleUS": "2486 Append Characters to String to Make Subsequence",
        "titleCN": "2486 追加字符以获得子序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Append Characters to String to Make Subsequence"
    },
    {
        "arg": "remove-nodes-from-linked-list",
        "titleUS": "2487 Remove Nodes From Linked List",
        "titleCN": "2487 从链表中移除节点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Remove Nodes From Linked List"
    },
    {
        "arg": "count-subarrays-with-median-k",
        "titleUS": "2488 Count Subarrays With Median K",
        "titleCN": "2488 统计中位数为 K 的子数组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Subarrays With Median K"
    },
    {
        "arg": "number-of-substrings-with-fixed-ratio",
        "titleUS": "2489 Number of Substrings With Fixed Ratio",
        "titleCN": "2489 固定比率的子字符串数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Substrings With Fixed Ratio"
    },
    {
        "arg": "circular-sentence",
        "titleUS": "2490 Circular Sentence",
        "titleCN": "2490 回环句",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Circular Sentence"
    },
    {
        "arg": "divide-players-into-teams-of-equal-skill",
        "titleUS": "2491 Divide Players Into Teams of Equal Skill",
        "titleCN": "2491 划分技能点相等的团队",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Divide Players Into Teams of Equal Skill"
    },
    {
        "arg": "minimum-score-of-a-path-between-two-cities",
        "titleUS": "2492 Minimum Score of a Path Between Two Cities",
        "titleCN": "2492 两个城市间路径的最小分数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Score of a Path Between Two Cities"
    },
    {
        "arg": "divide-nodes-into-the-maximum-number-of-groups",
        "titleUS": "2493 Divide Nodes Into the Maximum Number of Groups",
        "titleCN": "2493 将节点分成尽可能多的组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Divide Nodes Into the Maximum Number of Groups"
    },
    {
        "arg": "number-of-subarrays-having-even-product",
        "titleUS": "2495 Number of Subarrays Having Even Product",
        "titleCN": "2495 乘积为偶数的子数组数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Subarrays Having Even Product"
    },
    {
        "arg": "maximum-value-of-a-string-in-an-array",
        "titleUS": "2496 Maximum Value of a String in an Array",
        "titleCN": "2496 数组中字符串的最大值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Value of a String in an Array"
    },
    {
        "arg": "maximum-star-sum-of-a-graph",
        "titleUS": "2497 Maximum Star Sum of a Graph",
        "titleCN": "2497 图中最大星和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Star Sum of a Graph"
    },
    {
        "arg": "frog-jump-ii",
        "titleUS": "2498 Frog Jump II",
        "titleCN": "2498 青蛙过河 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Frog Jump II"
    },
    {
        "arg": "minimum-total-cost-to-make-arrays-unequal",
        "titleUS": "2499 Minimum Total Cost to Make Arrays Unequal",
        "titleCN": "2499 让数组不相等的最小总代价",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Total Cost to Make Arrays Unequal"
    },
    {
        "arg": "delete-greatest-value-in-each-row",
        "titleUS": "2500 Delete Greatest Value in Each Row",
        "titleCN": "2500 删除每行中的最大值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Delete Greatest Value in Each Row"
    },
    {
        "arg": "longest-square-streak-in-an-array",
        "titleUS": "2501 Longest Square Streak in an Array",
        "titleCN": "2501 数组中最长的方波",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Square Streak in an Array"
    },
    {
        "arg": "design-memory-allocator",
        "titleUS": "2502 Design Memory Allocator",
        "titleCN": "2502 设计内存分配器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Design Memory Allocator"
    },
    {
        "arg": "maximum-number-of-points-from-grid-queries",
        "titleUS": "2503 Maximum Number of Points From Grid Queries",
        "titleCN": "2503 矩阵查询可获得的最大分数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Number of Points From Grid Queries"
    },
    {
        "arg": "bitwise-or-of-all-subsequence-sums",
        "titleUS": "2505 Bitwise OR of All Subsequence Sums",
        "titleCN": "2505 所有子序列和的按位或",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Bitwise OR of All Subsequence Sums"
    },
    {
        "arg": "count-pairs-of-similar-strings",
        "titleUS": "2506 Count Pairs Of Similar Strings",
        "titleCN": "2506 统计相似字符串对的数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Pairs Of Similar Strings"
    },
    {
        "arg": "smallest-value-after-replacing-with-sum-of-prime-factors",
        "titleUS": "2507 Smallest Value After Replacing With Sum of Prime Factors",
        "titleCN": "2507 使用质因数之和替换后可以取到的最小值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Smallest Value After Replacing With Sum of Prime Factors"
    },
    {
        "arg": "add-edges-to-make-degrees-of-all-nodes-even",
        "titleUS": "2508 Add Edges to Make Degrees of All Nodes Even",
        "titleCN": "2508 添加边使所有节点度数都为偶数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Add Edges to Make Degrees of All Nodes Even"
    },
    {
        "arg": "cycle-length-queries-in-a-tree",
        "titleUS": "2509 Cycle Length Queries in a Tree",
        "titleCN": "2509 查询树中环的长度",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Cycle Length Queries in a Tree"
    },
    {
        "arg": "check-if-there-is-a-path-with-equal-number-of-0s-and-1s",
        "titleUS": "2510 Check if There is a Path With Equal Number of 0's And 1's",
        "titleCN": "2510 检查是否有路径经过相同数量的 0 和 1",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Check if There is a Path With Equal Number of 0's And 1's"
    },
    {
        "arg": "maximum-enemy-forts-that-can-be-captured",
        "titleUS": "2511 Maximum Enemy Forts That Can Be Captured",
        "titleCN": "2511 最多可以摧毁的敌人城堡数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Enemy Forts That Can Be Captured"
    },
    {
        "arg": "reward-top-k-students",
        "titleUS": "2512 Reward Top K Students",
        "titleCN": "2512 奖励最顶尖的 K 名学生",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Reward Top K Students"
    },
    {
        "arg": "minimize-the-maximum-of-two-arrays",
        "titleUS": "2513 Minimize the Maximum of Two Arrays",
        "titleCN": "2513 最小化两个数组中的最大值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimize the Maximum of Two Arrays"
    },
    {
        "arg": "count-anagrams",
        "titleUS": "2514 Count Anagrams",
        "titleCN": "2514 统计同位异构字符串数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Anagrams"
    },
    {
        "arg": "shortest-distance-to-target-string-in-a-circular-array",
        "titleUS": "2515 Shortest Distance to Target String in a Circular Array",
        "titleCN": "2515 到目标字符串的最短距离",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Shortest Distance to Target String in a Circular Array"
    },
    {
        "arg": "take-k-of-each-character-from-left-and-right",
        "titleUS": "2516 Take K of Each Character From Left and Right",
        "titleCN": "2516 每种字符至少取 K 个",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Take K of Each Character From Left and Right"
    },
    {
        "arg": "maximum-tastiness-of-candy-basket",
        "titleUS": "2517 Maximum Tastiness of Candy Basket",
        "titleCN": "2517 礼盒的最大甜蜜度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Tastiness of Candy Basket"
    },
    {
        "arg": "number-of-great-partitions",
        "titleUS": "2518 Number of Great Partitions",
        "titleCN": "2518 好分区的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Great Partitions"
    },
    {
        "arg": "count-the-number-of-k-big-indices",
        "titleUS": "2519 Count the Number of K-Big Indices",
        "titleCN": "2519 统计 K-Big 索引的数量",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Count the Number of K-Big Indices"
    },
    {
        "arg": "count-the-digits-that-divide-a-number",
        "titleUS": "2520 Count the Digits That Divide a Number",
        "titleCN": "2520 统计能整除数字的位数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count the Digits That Divide a Number"
    },
    {
        "arg": "distinct-prime-factors-of-product-of-array",
        "titleUS": "2521 Distinct Prime Factors of Product of Array",
        "titleCN": "2521 数组乘积中的不同质因数数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Distinct Prime Factors of Product of Array"
    },
    {
        "arg": "partition-string-into-substrings-with-values-at-most-k",
        "titleUS": "2522 Partition String Into Substrings With Values at Most K",
        "titleCN": "2522 将字符串分割成值不超过 K 的子字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Partition String Into Substrings With Values at Most K"
    },
    {
        "arg": "closest-prime-numbers-in-range",
        "titleUS": "2523 Closest Prime Numbers in Range",
        "titleCN": "2523 范围内最接近的两个质数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Closest Prime Numbers in Range"
    },
    {
        "arg": "maximum-frequency-score-of-a-subarray",
        "titleUS": "2524 Maximum Frequency Score of a Subarray",
        "titleCN": "2524 子数组的最大频率分数",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Maximum Frequency Score of a Subarray"
    },
    {
        "arg": "categorize-box-according-to-criteria",
        "titleUS": "2525 Categorize Box According to Criteria",
        "titleCN": "2525 根据规则将箱子分类",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Categorize Box According to Criteria"
    },
    {
        "arg": "find-consecutive-integers-from-a-data-stream",
        "titleUS": "2526 Find Consecutive Integers from a Data Stream",
        "titleCN": "2526 找到数据流中的连续整数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Consecutive Integers from a Data Stream"
    },
    {
        "arg": "find-xor-beauty-of-array",
        "titleUS": "2527 Find Xor-Beauty of Array",
        "titleCN": "2527 查询数组异或美丽值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Xor-Beauty of Array"
    },
    {
        "arg": "maximize-the-minimum-powered-city",
        "titleUS": "2528 Maximize the Minimum Powered City",
        "titleCN": "2528 最大化城市的最小电量",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximize the Minimum Powered City"
    },
    {
        "arg": "maximum-count-of-positive-integer-and-negative-integer",
        "titleUS": "2529 Maximum Count of Positive Integer and Negative Integer",
        "titleCN": "2529 正整数和负整数的最大计数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Count of Positive Integer and Negative Integer"
    },
    {
        "arg": "maximal-score-after-applying-k-operations",
        "titleUS": "2530 Maximal Score After Applying K Operations",
        "titleCN": "2530 执行 K 次操作后的最大分数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximal Score After Applying K Operations"
    },
    {
        "arg": "make-number-of-distinct-characters-equal",
        "titleUS": "2531 Make Number of Distinct Characters Equal",
        "titleCN": "2531 使字符串中不同字符的数目相等",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Make Number of Distinct Characters Equal"
    },
    {
        "arg": "time-to-cross-a-bridge",
        "titleUS": "2532 Time to Cross a Bridge",
        "titleCN": "2532 过桥的时间",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Time to Cross a Bridge"
    },
    {
        "arg": "number-of-good-binary-strings",
        "titleUS": "2533 Number of Good Binary Strings",
        "titleCN": "2533 好二进制字符串的数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Good Binary Strings"
    },
    {
        "arg": "time-taken-to-cross-the-door",
        "titleUS": "2534 Time Taken to Cross the Door",
        "titleCN": "2534 通过门的时间",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Time Taken to Cross the Door"
    },
    {
        "arg": "difference-between-element-sum-and-digit-sum-of-an-array",
        "titleUS": "2535 Difference Between Element Sum and Digit Sum of an Array",
        "titleCN": "2535 数组元素和与数字和的绝对差",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Difference Between Element Sum and Digit Sum of an Array"
    },
    {
        "arg": "increment-submatrices-by-one",
        "titleUS": "2536 Increment Submatrices by One",
        "titleCN": "2536 子矩阵元素加 1",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Increment Submatrices by One"
    },
    {
        "arg": "count-the-number-of-good-subarrays",
        "titleUS": "2537 Count the Number of Good Subarrays",
        "titleCN": "2537 统计好子数组的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count the Number of Good Subarrays"
    },
    {
        "arg": "difference-between-maximum-and-minimum-price-sum",
        "titleUS": "2538 Difference Between Maximum and Minimum Price Sum",
        "titleCN": "2538 最大价值和与最小价值和的差值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Difference Between Maximum and Minimum Price Sum"
    },
    {
        "arg": "count-the-number-of-good-subsequences",
        "titleUS": "2539 Count the Number of Good Subsequences",
        "titleCN": "2539 好子序列的个数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Count the Number of Good Subsequences"
    },
    {
        "arg": "minimum-common-value",
        "titleUS": "2540 Minimum Common Value",
        "titleCN": "2540 最小公共值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Common Value"
    },
    {
        "arg": "minimum-operations-to-make-array-equal-ii",
        "titleUS": "2541 Minimum Operations to Make Array Equal II",
        "titleCN": "2541 使数组中所有元素相等的最小操作数 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Operations to Make Array Equal II"
    },
    {
        "arg": "maximum-subsequence-score",
        "titleUS": "2542 Maximum Subsequence Score",
        "titleCN": "2542 最大子序列的分数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Subsequence Score"
    },
    {
        "arg": "check-if-point-is-reachable",
        "titleUS": "2543 Check if Point Is Reachable",
        "titleCN": "2543 判断一个点是否可以到达",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Check if Point Is Reachable"
    },
    {
        "arg": "alternating-digit-sum",
        "titleUS": "2544 Alternating Digit Sum",
        "titleCN": "2544 交替数字和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Alternating Digit Sum"
    },
    {
        "arg": "sort-the-students-by-their-kth-score",
        "titleUS": "2545 Sort the Students by Their Kth Score",
        "titleCN": "2545 根据第 K 场考试的分数排序",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sort the Students by Their Kth Score"
    },
    {
        "arg": "apply-bitwise-operations-to-make-strings-equal",
        "titleUS": "2546 Apply Bitwise Operations to Make Strings Equal",
        "titleCN": "2546 执行逐位运算使字符串相等",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Apply Bitwise Operations to Make Strings Equal"
    },
    {
        "arg": "minimum-cost-to-split-an-array",
        "titleUS": "2547 Minimum Cost to Split an Array",
        "titleCN": "2547 拆分数组的最小代价",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Cost to Split an Array"
    },
    {
        "arg": "maximum-price-to-fill-a-bag",
        "titleUS": "2548 Maximum Price to Fill a Bag",
        "titleCN": "2548 填满背包的最大价格",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Price to Fill a Bag"
    },
    {
        "arg": "count-distinct-numbers-on-board",
        "titleUS": "2549 Count Distinct Numbers on Board",
        "titleCN": "2549 统计桌面上的不同数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Distinct Numbers on Board"
    },
    {
        "arg": "count-collisions-of-monkeys-on-a-polygon",
        "titleUS": "2550 Count Collisions of Monkeys on a Polygon",
        "titleCN": "2550 猴子碰撞的方法数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Collisions of Monkeys on a Polygon"
    },
    {
        "arg": "put-marbles-in-bags",
        "titleUS": "2551 Put Marbles in Bags",
        "titleCN": "2551 将珠子放入背包中",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Put Marbles in Bags"
    },
    {
        "arg": "count-increasing-quadruplets",
        "titleUS": "2552 Count Increasing Quadruplets",
        "titleCN": "2552 统计上升四元组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Increasing Quadruplets"
    },
    {
        "arg": "separate-the-digits-in-an-array",
        "titleUS": "2553 Separate the Digits in an Array",
        "titleCN": "2553 分割数组中数字的数位",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Separate the Digits in an Array"
    },
    {
        "arg": "maximum-number-of-integers-to-choose-from-a-range-i",
        "titleUS": "2554 Maximum Number of Integers to Choose From a Range I",
        "titleCN": "2554 从一个范围内选择最多整数 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Integers to Choose From a Range I"
    },
    {
        "arg": "maximize-win-from-two-segments",
        "titleUS": "2555 Maximize Win From Two Segments",
        "titleCN": "2555 两个线段获得的最多奖品",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximize Win From Two Segments"
    },
    {
        "arg": "disconnect-path-in-a-binary-matrix-by-at-most-one-flip",
        "titleUS": "2556 Disconnect Path in a Binary Matrix by at Most One Flip",
        "titleCN": "2556 二进制矩阵中翻转最多一次使路径不连通",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Disconnect Path in a Binary Matrix by at Most One Flip"
    },
    {
        "arg": "maximum-number-of-integers-to-choose-from-a-range-ii",
        "titleUS": "2557 Maximum Number of Integers to Choose From a Range II",
        "titleCN": "2557 从一个范围内选择最多整数 II",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Number of Integers to Choose From a Range II"
    },
    {
        "arg": "take-gifts-from-the-richest-pile",
        "titleUS": "2558 Take Gifts From the Richest Pile",
        "titleCN": "2558 从数量最多的堆取走礼物",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Take Gifts From the Richest Pile"
    },
    {
        "arg": "count-vowel-strings-in-ranges",
        "titleUS": "2559 Count Vowel Strings in Ranges",
        "titleCN": "2559 统计范围内的元音字符串数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Vowel Strings in Ranges"
    },
    {
        "arg": "house-robber-iv",
        "titleUS": "2560 House Robber IV",
        "titleCN": "2560 打家劫舍 IV",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 House Robber IV"
    },
    {
        "arg": "rearranging-fruits",
        "titleUS": "2561 Rearranging Fruits",
        "titleCN": "2561 重排水果",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Rearranging Fruits"
    },
    {
        "arg": "find-the-array-concatenation-value",
        "titleUS": "2562 Find the Array Concatenation Value",
        "titleCN": "2562 找出数组的串联值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Array Concatenation Value"
    },
    {
        "arg": "count-the-number-of-fair-pairs",
        "titleUS": "2563 Count the Number of Fair Pairs",
        "titleCN": "2563 统计公平数对的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count the Number of Fair Pairs"
    },
    {
        "arg": "substring-xor-queries",
        "titleUS": "2564 Substring XOR Queries",
        "titleCN": "2564 子字符串异或查询",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Substring XOR Queries"
    },
    {
        "arg": "subsequence-with-the-minimum-score",
        "titleUS": "2565 Subsequence With the Minimum Score",
        "titleCN": "2565 最少得分子序列",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Subsequence With the Minimum Score"
    },
    {
        "arg": "maximum-difference-by-remapping-a-digit",
        "titleUS": "2566 Maximum Difference by Remapping a Digit",
        "titleCN": "2566 替换一个数字后的最大差值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Difference by Remapping a Digit"
    },
    {
        "arg": "minimum-score-by-changing-two-elements",
        "titleUS": "2567 Minimum Score by Changing Two Elements",
        "titleCN": "2567 修改两个元素的最小分数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Score by Changing Two Elements"
    },
    {
        "arg": "minimum-impossible-or",
        "titleUS": "2568 Minimum Impossible OR",
        "titleCN": "2568 最小无法得到的或值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Impossible OR"
    },
    {
        "arg": "handling-sum-queries-after-update",
        "titleUS": "2569 Handling Sum Queries After Update",
        "titleCN": "2569 更新数组后处理求和查询",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Handling Sum Queries After Update"
    },
    {
        "arg": "merge-two-2d-arrays-by-summing-values",
        "titleUS": "2570 Merge Two 2D Arrays by Summing Values",
        "titleCN": "2570 合并两个二维数组 - 求和法",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Merge Two 2D Arrays by Summing Values"
    },
    {
        "arg": "minimum-operations-to-reduce-an-integer-to-0",
        "titleUS": "2571 Minimum Operations to Reduce an Integer to 0",
        "titleCN": "2571 将整数减少到零需要的最少操作数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Operations to Reduce an Integer to 0"
    },
    {
        "arg": "count-the-number-of-square-free-subsets",
        "titleUS": "2572 Count the Number of Square-Free Subsets",
        "titleCN": "2572 无平方子集计数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count the Number of Square-Free Subsets"
    },
    {
        "arg": "find-the-string-with-lcp",
        "titleUS": "2573 Find the String with LCP",
        "titleCN": "2573 找出对应 LCP 矩阵的字符串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find the String with LCP"
    },
    {
        "arg": "left-and-right-sum-differences",
        "titleUS": "2574 Left and Right Sum Differences",
        "titleCN": "2574 左右元素和的差值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Left and Right Sum Differences"
    },
    {
        "arg": "find-the-divisibility-array-of-a-string",
        "titleUS": "2575 Find the Divisibility Array of a String",
        "titleCN": "2575 找出字符串的可整除数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Divisibility Array of a String"
    },
    {
        "arg": "find-the-maximum-number-of-marked-indices",
        "titleUS": "2576 Find the Maximum Number of Marked Indices",
        "titleCN": "2576 求出最多标记下标",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Maximum Number of Marked Indices"
    },
    {
        "arg": "minimum-time-to-visit-a-cell-in-a-grid",
        "titleUS": "2577 Minimum Time to Visit a Cell In a Grid",
        "titleCN": "2577 在网格图中访问一个格子的最少时间",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Time to Visit a Cell In a Grid"
    },
    {
        "arg": "split-with-minimum-sum",
        "titleUS": "2578 Split With Minimum Sum",
        "titleCN": "2578 最小和分割",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Split With Minimum Sum"
    },
    {
        "arg": "count-total-number-of-colored-cells",
        "titleUS": "2579 Count Total Number of Colored Cells",
        "titleCN": "2579 统计染色格子数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Total Number of Colored Cells"
    },
    {
        "arg": "count-ways-to-group-overlapping-ranges",
        "titleUS": "2580 Count Ways to Group Overlapping Ranges",
        "titleCN": "2580 统计将重叠区间合并成组的方案数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Ways to Group Overlapping Ranges"
    },
    {
        "arg": "count-number-of-possible-root-nodes",
        "titleUS": "2581 Count Number of Possible Root Nodes",
        "titleCN": "2581 统计可能的树根数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Number of Possible Root Nodes"
    },
    {
        "arg": "pass-the-pillow",
        "titleUS": "2582 Pass the Pillow",
        "titleCN": "2582 递枕头",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Pass the Pillow"
    },
    {
        "arg": "kth-largest-sum-in-a-binary-tree",
        "titleUS": "2583 Kth Largest Sum in a Binary Tree",
        "titleCN": "2583 二叉树中的第 K 大层和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Kth Largest Sum in a Binary Tree"
    },
    {
        "arg": "split-the-array-to-make-coprime-products",
        "titleUS": "2584 Split the Array to Make Coprime Products",
        "titleCN": "2584 分割数组使乘积互质",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Split the Array to Make Coprime Products"
    },
    {
        "arg": "number-of-ways-to-earn-points",
        "titleUS": "2585 Number of Ways to Earn Points",
        "titleCN": "2585 获得分数的方法数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Ways to Earn Points"
    },
    {
        "arg": "count-the-number-of-vowel-strings-in-range",
        "titleUS": "2586 Count the Number of Vowel Strings in Range",
        "titleCN": "2586 统计范围内的元音字符串数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count the Number of Vowel Strings in Range"
    },
    {
        "arg": "rearrange-array-to-maximize-prefix-score",
        "titleUS": "2587 Rearrange Array to Maximize Prefix Score",
        "titleCN": "2587 重排数组以得到最大前缀分数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Rearrange Array to Maximize Prefix Score"
    },
    {
        "arg": "count-the-number-of-beautiful-subarrays",
        "titleUS": "2588 Count the Number of Beautiful Subarrays",
        "titleCN": "2588 统计美丽子数组数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count the Number of Beautiful Subarrays"
    },
    {
        "arg": "minimum-time-to-complete-all-tasks",
        "titleUS": "2589 Minimum Time to Complete All Tasks",
        "titleCN": "2589 完成所有任务的最少时间",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Time to Complete All Tasks"
    },
    {
        "arg": "design-a-todo-list",
        "titleUS": "2590 Design a Todo List",
        "titleCN": "2590 设计一个待办事项清单",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Design a Todo List"
    },
    {
        "arg": "distribute-money-to-maximum-children",
        "titleUS": "2591 Distribute Money to Maximum Children",
        "titleCN": "2591 将钱分给最多的儿童",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Distribute Money to Maximum Children"
    },
    {
        "arg": "maximize-greatness-of-an-array",
        "titleUS": "2592 Maximize Greatness of an Array",
        "titleCN": "2592 最大化数组的伟大值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximize Greatness of an Array"
    },
    {
        "arg": "find-score-of-an-array-after-marking-all-elements",
        "titleUS": "2593 Find Score of an Array After Marking All Elements",
        "titleCN": "2593 标记所有元素后数组的分数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Score of an Array After Marking All Elements"
    },
    {
        "arg": "minimum-time-to-repair-cars",
        "titleUS": "2594 Minimum Time to Repair Cars",
        "titleCN": "2594 修车的最少时间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Time to Repair Cars"
    },
    {
        "arg": "number-of-even-and-odd-bits",
        "titleUS": "2595 Number of Even and Odd Bits",
        "titleCN": "2595 奇偶位数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Even and Odd Bits"
    },
    {
        "arg": "check-knight-tour-configuration",
        "titleUS": "2596 Check Knight Tour Configuration",
        "titleCN": "2596 检查骑士巡视方案",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Check Knight Tour Configuration"
    },
    {
        "arg": "the-number-of-beautiful-subsets",
        "titleUS": "2597 The Number of Beautiful Subsets",
        "titleCN": "2597 美丽子集的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 The Number of Beautiful Subsets"
    },
    {
        "arg": "smallest-missing-non-negative-integer-after-operations",
        "titleUS": "2598 Smallest Missing Non-negative Integer After Operations",
        "titleCN": "2598 执行操作后的最大 MEX",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Smallest Missing Non-negative Integer After Operations"
    },
    {
        "arg": "make-the-prefix-sum-non-negative",
        "titleUS": "2599 Make the Prefix Sum Non-negative",
        "titleCN": "2599 使前缀和数组非负",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Make the Prefix Sum Non-negative"
    },
    {
        "arg": "k-items-with-the-maximum-sum",
        "titleUS": "2600 K Items With the Maximum Sum",
        "titleCN": "2600 K 件物品的最大和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 K Items With the Maximum Sum"
    },
    {
        "arg": "prime-subtraction-operation",
        "titleUS": "2601 Prime Subtraction Operation",
        "titleCN": "2601 质数减法运算",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Prime Subtraction Operation"
    },
    {
        "arg": "minimum-operations-to-make-all-array-elements-equal",
        "titleUS": "2602 Minimum Operations to Make All Array Elements Equal",
        "titleCN": "2602 使数组元素全部相等的最少操作次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Operations to Make All Array Elements Equal"
    },
    {
        "arg": "collect-coins-in-a-tree",
        "titleUS": "2603 Collect Coins in a Tree",
        "titleCN": "2603 收集树中金币",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Collect Coins in a Tree"
    },
    {
        "arg": "minimum-time-to-eat-all-grains",
        "titleUS": "2604 Minimum Time to Eat All Grains",
        "titleCN": "2604 吃掉所有谷子的最短时间",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Minimum Time to Eat All Grains"
    },
    {
        "arg": "form-smallest-number-from-two-digit-arrays",
        "titleUS": "2605 Form Smallest Number From Two Digit Arrays",
        "titleCN": "2605 从两个数字数组里生成最小数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Form Smallest Number From Two Digit Arrays"
    },
    {
        "arg": "find-the-substring-with-maximum-cost",
        "titleUS": "2606 Find the Substring With Maximum Cost",
        "titleCN": "2606 找到最大开销的子字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Substring With Maximum Cost"
    },
    {
        "arg": "make-k-subarray-sums-equal",
        "titleUS": "2607 Make K-Subarray Sums Equal",
        "titleCN": "2607 使子数组元素和相等",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Make K-Subarray Sums Equal"
    },
    {
        "arg": "shortest-cycle-in-a-graph",
        "titleUS": "2608 Shortest Cycle in a Graph",
        "titleCN": "2608 图中的最短环",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Shortest Cycle in a Graph"
    },
    {
        "arg": "find-the-longest-balanced-substring-of-a-binary-string",
        "titleUS": "2609 Find the Longest Balanced Substring of a Binary String",
        "titleCN": "2609 最长平衡子字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Longest Balanced Substring of a Binary String"
    },
    {
        "arg": "convert-an-array-into-a-2d-array-with-conditions",
        "titleUS": "2610 Convert an Array Into a 2D Array With Conditions",
        "titleCN": "2610 转换二维数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Convert an Array Into a 2D Array With Conditions"
    },
    {
        "arg": "mice-and-cheese",
        "titleUS": "2611 Mice and Cheese",
        "titleCN": "2611 老鼠和奶酪",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Mice and Cheese"
    },
    {
        "arg": "minimum-reverse-operations",
        "titleUS": "2612 Minimum Reverse Operations",
        "titleCN": "2612 最少翻转操作数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Reverse Operations"
    },
    {
        "arg": "beautiful-pairs",
        "titleUS": "2613 Beautiful Pairs",
        "titleCN": "2613 美数对",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Beautiful Pairs"
    },
    {
        "arg": "prime-in-diagonal",
        "titleUS": "2614 Prime In Diagonal",
        "titleCN": "2614 对角线上的质数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Prime In Diagonal"
    },
    {
        "arg": "sum-of-distances",
        "titleUS": "2615 Sum of Distances",
        "titleCN": "2615 等值距离和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum of Distances"
    },
    {
        "arg": "minimize-the-maximum-difference-of-pairs",
        "titleUS": "2616 Minimize the Maximum Difference of Pairs",
        "titleCN": "2616 最小化数对的最大差值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimize the Maximum Difference of Pairs"
    },
    {
        "arg": "minimum-number-of-visited-cells-in-a-grid",
        "titleUS": "2617 Minimum Number of Visited Cells in a Grid",
        "titleCN": "2617 网格图中最少访问的格子数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Number of Visited Cells in a Grid"
    },
    {
        "arg": "count-the-number-of-k-free-subsets",
        "titleUS": "2638 Count the Number of K-Free Subsets",
        "titleCN": "2638 统计 K-Free 子集的总数",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Count the Number of K-Free Subsets"
    },
    {
        "arg": "find-the-width-of-columns-of-a-grid",
        "titleUS": "2639 Find the Width of Columns of a Grid",
        "titleCN": "2639 查询网格图中每一列的宽度",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Width of Columns of a Grid"
    },
    {
        "arg": "find-the-score-of-all-prefixes-of-an-array",
        "titleUS": "2640 Find the Score of All Prefixes of an Array",
        "titleCN": "2640 一个数组所有前缀的分数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Score of All Prefixes of an Array"
    },
    {
        "arg": "cousins-in-binary-tree-ii",
        "titleUS": "2641 Cousins in Binary Tree II",
        "titleCN": "2641 二叉树的堂兄弟节点 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Cousins in Binary Tree II"
    },
    {
        "arg": "design-graph-with-shortest-path-calculator",
        "titleUS": "2642 Design Graph With Shortest Path Calculator",
        "titleCN": "2642 设计可以求最短路径的图类",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Design Graph With Shortest Path Calculator"
    },
    {
        "arg": "row-with-maximum-ones",
        "titleUS": "2643 Row With Maximum Ones",
        "titleCN": "2643 一最多的行",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Row With Maximum Ones"
    },
    {
        "arg": "find-the-maximum-divisibility-score",
        "titleUS": "2644 Find the Maximum Divisibility Score",
        "titleCN": "2644 找出可整除性得分最大的整数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Maximum Divisibility Score"
    },
    {
        "arg": "minimum-additions-to-make-valid-string",
        "titleUS": "2645 Minimum Additions to Make Valid String",
        "titleCN": "2645 构造有效字符串的最少插入数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Additions to Make Valid String"
    },
    {
        "arg": "minimize-the-total-price-of-the-trips",
        "titleUS": "2646 Minimize the Total Price of the Trips",
        "titleCN": "2646 最小化旅行的价格总和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimize the Total Price of the Trips"
    },
    {
        "arg": "color-the-triangle-red",
        "titleUS": "2647 Color the Triangle Red",
        "titleCN": "2647 把三角形染成红色",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Color the Triangle Red"
    },
    {
        "arg": "calculate-delayed-arrival-time",
        "titleUS": "2651 Calculate Delayed Arrival Time",
        "titleCN": "2651 计算列车到站时间",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Calculate Delayed Arrival Time"
    },
    {
        "arg": "sum-multiples",
        "titleUS": "2652 Sum Multiples",
        "titleCN": "2652 倍数求和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sum Multiples"
    },
    {
        "arg": "sliding-subarray-beauty",
        "titleUS": "2653 Sliding Subarray Beauty",
        "titleCN": "2653 滑动子数组的美丽值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sliding Subarray Beauty"
    },
    {
        "arg": "minimum-number-of-operations-to-make-all-array-elements-equal-to-1",
        "titleUS": "2654 Minimum Number of Operations to Make All Array Elements Equal to 1",
        "titleCN": "2654 使数组所有元素变成 1 的最少操作次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Operations to Make All Array Elements Equal to 1"
    },
    {
        "arg": "find-maximal-uncovered-ranges",
        "titleUS": "2655 Find Maximal Uncovered Ranges",
        "titleCN": "2655 寻找最大长度的未覆盖区间",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Find Maximal Uncovered Ranges"
    },
    {
        "arg": "maximum-sum-with-exactly-k-elements",
        "titleUS": "2656 Maximum Sum With Exactly K Elements ",
        "titleCN": "2656 K 个元素的最大和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Sum With Exactly K Elements "
    },
    {
        "arg": "find-the-prefix-common-array-of-two-arrays",
        "titleUS": "2657 Find the Prefix Common Array of Two Arrays",
        "titleCN": "2657 找到两个数组的前缀公共数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Prefix Common Array of Two Arrays"
    },
    {
        "arg": "maximum-number-of-fish-in-a-grid",
        "titleUS": "2658 Maximum Number of Fish in a Grid",
        "titleCN": "2658 网格图中鱼的最大数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Fish in a Grid"
    },
    {
        "arg": "make-array-empty",
        "titleUS": "2659 Make Array Empty",
        "titleCN": "2659 将数组清空",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Make Array Empty"
    },
    {
        "arg": "determine-the-winner-of-a-bowling-game",
        "titleUS": "2660 Determine the Winner of a Bowling Game",
        "titleCN": "2660 保龄球游戏的获胜者",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Determine the Winner of a Bowling Game"
    },
    {
        "arg": "first-completely-painted-row-or-column",
        "titleUS": "2661 First Completely Painted Row or Column",
        "titleCN": "2661 找出叠涂元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 First Completely Painted Row or Column"
    },
    {
        "arg": "minimum-cost-of-a-path-with-special-roads",
        "titleUS": "2662 Minimum Cost of a Path With Special Roads",
        "titleCN": "2662 前往目标的最小代价",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Cost of a Path With Special Roads"
    },
    {
        "arg": "lexicographically-smallest-beautiful-string",
        "titleUS": "2663 Lexicographically Smallest Beautiful String",
        "titleCN": "2663 字典序最小的美丽字符串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Lexicographically Smallest Beautiful String"
    },
    {
        "arg": "the-knights-tour",
        "titleUS": "2664 The Knight’s Tour",
        "titleCN": "2664 巡逻的骑士",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 The Knight’s Tour"
    },
    {
        "arg": "find-the-distinct-difference-array",
        "titleUS": "2670 Find the Distinct Difference Array",
        "titleCN": "2670 找出不同元素数目差数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Distinct Difference Array"
    },
    {
        "arg": "frequency-tracker",
        "titleUS": "2671 Frequency Tracker",
        "titleCN": "2671 频率跟踪器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Frequency Tracker"
    },
    {
        "arg": "number-of-adjacent-elements-with-the-same-color",
        "titleUS": "2672 Number of Adjacent Elements With the Same Color",
        "titleCN": "2672 有相同颜色的相邻元素数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Adjacent Elements With the Same Color"
    },
    {
        "arg": "make-costs-of-paths-equal-in-a-binary-tree",
        "titleUS": "2673 Make Costs of Paths Equal in a Binary Tree",
        "titleCN": "2673 使二叉树所有路径值相等的最小代价",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Make Costs of Paths Equal in a Binary Tree"
    },
    {
        "arg": "split-a-circular-linked-list",
        "titleUS": "2674 Split a Circular Linked List",
        "titleCN": "2674 拆分循环链表",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Split a Circular Linked List"
    },
    {
        "arg": "number-of-senior-citizens",
        "titleUS": "2678 Number of Senior Citizens",
        "titleCN": "2678 老人的数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Senior Citizens"
    },
    {
        "arg": "sum-in-a-matrix",
        "titleUS": "2679 Sum in a Matrix",
        "titleCN": "2679 矩阵中的和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum in a Matrix"
    },
    {
        "arg": "maximum-or",
        "titleUS": "2680 Maximum OR",
        "titleCN": "2680 最大或值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum OR"
    },
    {
        "arg": "power-of-heroes",
        "titleUS": "2681 Power of Heroes",
        "titleCN": "2681 英雄的力量",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Power of Heroes"
    },
    {
        "arg": "find-the-losers-of-the-circular-game",
        "titleUS": "2682 Find the Losers of the Circular Game",
        "titleCN": "2682 找出转圈游戏输家",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Losers of the Circular Game"
    },
    {
        "arg": "neighboring-bitwise-xor",
        "titleUS": "2683 Neighboring Bitwise XOR",
        "titleCN": "2683 相邻值的按位异或",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Neighboring Bitwise XOR"
    },
    {
        "arg": "maximum-number-of-moves-in-a-grid",
        "titleUS": "2684 Maximum Number of Moves in a Grid",
        "titleCN": "2684 矩阵中移动的最大次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Moves in a Grid"
    },
    {
        "arg": "count-the-number-of-complete-components",
        "titleUS": "2685 Count the Number of Complete Components",
        "titleCN": "2685 统计完全连通分量的数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count the Number of Complete Components"
    },
    {
        "arg": "extract-kth-character-from-the-rope-tree",
        "titleUS": "2689 Extract Kth Character From The Rope Tree",
        "titleCN": "2689 从 Rope 树中提取第 K 个字符",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Extract Kth Character From The Rope Tree"
    },
    {
        "arg": "minimum-string-length-after-removing-substrings",
        "titleUS": "2696 Minimum String Length After Removing Substrings",
        "titleCN": "2696 删除子串后的字符串最小长度",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum String Length After Removing Substrings"
    },
    {
        "arg": "lexicographically-smallest-palindrome",
        "titleUS": "2697 Lexicographically Smallest Palindrome",
        "titleCN": "2697 字典序最小回文串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Lexicographically Smallest Palindrome"
    },
    {
        "arg": "find-the-punishment-number-of-an-integer",
        "titleUS": "2698 Find the Punishment Number of an Integer",
        "titleCN": "2698 求一个整数的惩罚数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Punishment Number of an Integer"
    },
    {
        "arg": "modify-graph-edge-weights",
        "titleUS": "2699 Modify Graph Edge Weights",
        "titleCN": "2699 修改图中的边权",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Modify Graph Edge Weights"
    },
    {
        "arg": "minimum-operations-to-make-numbers-non-positive",
        "titleUS": "2702 Minimum Operations to Make Numbers Non-positive",
        "titleCN": "2702 使数字变为非正数的最小操作次数",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Minimum Operations to Make Numbers Non-positive"
    },
    {
        "arg": "buy-two-chocolates",
        "titleUS": "2706 Buy Two Chocolates",
        "titleCN": "2706 购买两块巧克力",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Buy Two Chocolates"
    },
    {
        "arg": "extra-characters-in-a-string",
        "titleUS": "2707 Extra Characters in a String",
        "titleCN": "2707 字符串中的额外字符",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Extra Characters in a String"
    },
    {
        "arg": "maximum-strength-of-a-group",
        "titleUS": "2708 Maximum Strength of a Group",
        "titleCN": "2708 一个小组的最大实力值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Strength of a Group"
    },
    {
        "arg": "greatest-common-divisor-traversal",
        "titleUS": "2709 Greatest Common Divisor Traversal",
        "titleCN": "2709 最大公约数遍历",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Greatest Common Divisor Traversal"
    },
    {
        "arg": "remove-trailing-zeros-from-a-string",
        "titleUS": "2710 Remove Trailing Zeros From a String",
        "titleCN": "2710 移除字符串中的尾随零",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Remove Trailing Zeros From a String"
    },
    {
        "arg": "difference-of-number-of-distinct-values-on-diagonals",
        "titleUS": "2711 Difference of Number of Distinct Values on Diagonals",
        "titleCN": "2711 对角线上不同值的数量差",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Difference of Number of Distinct Values on Diagonals"
    },
    {
        "arg": "minimum-cost-to-make-all-characters-equal",
        "titleUS": "2712 Minimum Cost to Make All Characters Equal",
        "titleCN": "2712 使所有字符相等的最小成本",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Cost to Make All Characters Equal"
    },
    {
        "arg": "maximum-strictly-increasing-cells-in-a-matrix",
        "titleUS": "2713 Maximum Strictly Increasing Cells in a Matrix",
        "titleCN": "2713 矩阵中严格递增的单元格数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Strictly Increasing Cells in a Matrix"
    },
    {
        "arg": "find-shortest-path-with-k-hops",
        "titleUS": "2714 Find Shortest Path with K Hops",
        "titleCN": "2714 找到最短路径的 K 次跨越",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Find Shortest Path with K Hops"
    },
    {
        "arg": "minimize-string-length",
        "titleUS": "2716 Minimize String Length",
        "titleCN": "2716 最小化字符串长度",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimize String Length"
    },
    {
        "arg": "semi-ordered-permutation",
        "titleUS": "2717 Semi-Ordered Permutation",
        "titleCN": "2717 半有序排列",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Semi-Ordered Permutation"
    },
    {
        "arg": "sum-of-matrix-after-queries",
        "titleUS": "2718 Sum of Matrix After Queries",
        "titleCN": "2718 查询后矩阵的和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sum of Matrix After Queries"
    },
    {
        "arg": "count-of-integers",
        "titleUS": "2719 Count of Integers",
        "titleCN": "2719 统计整数数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count of Integers"
    },
    {
        "arg": "count-houses-in-a-circular-street",
        "titleUS": "2728 Count Houses in a Circular Street",
        "titleCN": "2728 计算一个环形街道上的房屋数量",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Count Houses in a Circular Street"
    },
    {
        "arg": "check-if-the-number-is-fascinating",
        "titleUS": "2729 Check if The Number is Fascinating",
        "titleCN": "2729 判断一个数是否迷人",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if The Number is Fascinating"
    },
    {
        "arg": "find-the-longest-semi-repetitive-substring",
        "titleUS": "2730 Find the Longest Semi-Repetitive Substring",
        "titleCN": "2730 找到最长的半重复子字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Longest Semi-Repetitive Substring"
    },
    {
        "arg": "movement-of-robots",
        "titleUS": "2731 Movement of Robots",
        "titleCN": "2731 移动机器人",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Movement of Robots"
    },
    {
        "arg": "find-a-good-subset-of-the-matrix",
        "titleUS": "2732 Find a Good Subset of the Matrix",
        "titleCN": "2732 找到矩阵中的好子集",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find a Good Subset of the Matrix"
    },
    {
        "arg": "neither-minimum-nor-maximum",
        "titleUS": "2733 Neither Minimum nor Maximum",
        "titleCN": "2733 既不是最小值也不是最大值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Neither Minimum nor Maximum"
    },
    {
        "arg": "lexicographically-smallest-string-after-substring-operation",
        "titleUS": "2734 Lexicographically Smallest String After Substring Operation",
        "titleCN": "2734 执行子串操作后的字典序最小字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Lexicographically Smallest String After Substring Operation"
    },
    {
        "arg": "collecting-chocolates",
        "titleUS": "2735 Collecting Chocolates",
        "titleCN": "2735 收集巧克力",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Collecting Chocolates"
    },
    {
        "arg": "maximum-sum-queries",
        "titleUS": "2736 Maximum Sum Queries",
        "titleCN": "2736 最大和查询",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Sum Queries"
    },
    {
        "arg": "find-the-closest-marked-node",
        "titleUS": "2737 Find the Closest Marked Node",
        "titleCN": "2737 找到最近的标记节点",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Find the Closest Marked Node"
    },
    {
        "arg": "total-distance-traveled",
        "titleUS": "2739 Total Distance Traveled",
        "titleCN": "2739 总行驶距离",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Total Distance Traveled"
    },
    {
        "arg": "find-the-value-of-the-partition",
        "titleUS": "2740 Find the Value of the Partition",
        "titleCN": "2740 找出分区值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Value of the Partition"
    },
    {
        "arg": "special-permutations",
        "titleUS": "2741 Special Permutations",
        "titleCN": "2741 特别的排列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Special Permutations"
    },
    {
        "arg": "painting-the-walls",
        "titleUS": "2742 Painting the Walls",
        "titleCN": "2742 给墙壁刷油漆",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Painting the Walls"
    },
    {
        "arg": "count-substrings-without-repeating-character",
        "titleUS": "2743 Count Substrings Without Repeating Character",
        "titleCN": "2743 计算没有重复字符的子字符串数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Count Substrings Without Repeating Character"
    },
    {
        "arg": "find-maximum-number-of-string-pairs",
        "titleUS": "2744 Find Maximum Number of String Pairs",
        "titleCN": "2744 最大字符串配对数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Maximum Number of String Pairs"
    },
    {
        "arg": "construct-the-longest-new-string",
        "titleUS": "2745 Construct the Longest New String",
        "titleCN": "2745 构造最长的新字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Construct the Longest New String"
    },
    {
        "arg": "decremental-string-concatenation",
        "titleUS": "2746 Decremental String Concatenation",
        "titleCN": "2746 字符串连接删减字母",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Decremental String Concatenation"
    },
    {
        "arg": "count-zero-request-servers",
        "titleUS": "2747 Count Zero Request Servers",
        "titleCN": "2747 统计没有收到请求的服务器数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Zero Request Servers"
    },
    {
        "arg": "number-of-beautiful-pairs",
        "titleUS": "2748 Number of Beautiful Pairs",
        "titleCN": "2748 美丽下标对的数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Beautiful Pairs"
    },
    {
        "arg": "minimum-operations-to-make-the-integer-zero",
        "titleUS": "2749 Minimum Operations to Make the Integer Zero",
        "titleCN": "2749 得到整数零需要执行的最少操作数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Operations to Make the Integer Zero"
    },
    {
        "arg": "ways-to-split-array-into-good-subarrays",
        "titleUS": "2750 Ways to Split Array Into Good Subarrays",
        "titleCN": "2750 将数组划分成若干好子数组的方式",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Ways to Split Array Into Good Subarrays"
    },
    {
        "arg": "robot-collisions",
        "titleUS": "2751 Robot Collisions",
        "titleCN": "2751 机器人碰撞",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Robot Collisions"
    },
    {
        "arg": "count-houses-in-a-circular-street-ii",
        "titleUS": "2753 Count Houses in a Circular Street II",
        "titleCN": "2753 计算一个环形街道上的房屋数量 II",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Count Houses in a Circular Street II"
    },
    {
        "arg": "longest-even-odd-subarray-with-threshold",
        "titleUS": "2760 Longest Even Odd Subarray With Threshold",
        "titleCN": "2760 最长奇偶子数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Longest Even Odd Subarray With Threshold"
    },
    {
        "arg": "prime-pairs-with-target-sum",
        "titleUS": "2761 Prime Pairs With Target Sum",
        "titleCN": "2761 和等于目标值的质数对",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Prime Pairs With Target Sum"
    },
    {
        "arg": "continuous-subarrays",
        "titleUS": "2762 Continuous Subarrays",
        "titleCN": "2762 不间断子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Continuous Subarrays"
    },
    {
        "arg": "sum-of-imbalance-numbers-of-all-subarrays",
        "titleUS": "2763 Sum of Imbalance Numbers of All Subarrays",
        "titleCN": "2763 所有子数组中不平衡数字之和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Sum of Imbalance Numbers of All Subarrays"
    },
    {
        "arg": "is-array-a-preorder-of-some-binary-tree",
        "titleUS": "2764 Is Array a Preorder of Some ‌Binary Tree",
        "titleCN": "2764 数组是否表示某二叉树的前序遍历",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Is Array a Preorder of Some ‌Binary Tree"
    },
    {
        "arg": "longest-alternating-subarray",
        "titleUS": "2765 Longest Alternating Subarray",
        "titleCN": "2765 最长交替子数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Longest Alternating Subarray"
    },
    {
        "arg": "relocate-marbles",
        "titleUS": "2766 Relocate Marbles",
        "titleCN": "2766 重新放置石块",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Relocate Marbles"
    },
    {
        "arg": "partition-string-into-minimum-beautiful-substrings",
        "titleUS": "2767 Partition String Into Minimum Beautiful Substrings",
        "titleCN": "2767 将字符串分割为最少的美丽子字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Partition String Into Minimum Beautiful Substrings"
    },
    {
        "arg": "number-of-black-blocks",
        "titleUS": "2768 Number of Black Blocks",
        "titleCN": "2768 黑格子的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Black Blocks"
    },
    {
        "arg": "find-the-maximum-achievable-number",
        "titleUS": "2769 Find the Maximum Achievable Number",
        "titleCN": "2769 找出最大的可达成数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Maximum Achievable Number"
    },
    {
        "arg": "maximum-number-of-jumps-to-reach-the-last-index",
        "titleUS": "2770 Maximum Number of Jumps to Reach the Last Index",
        "titleCN": "2770 达到末尾下标所需的最大跳跃次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Jumps to Reach the Last Index"
    },
    {
        "arg": "longest-non-decreasing-subarray-from-two-arrays",
        "titleUS": "2771 Longest Non-decreasing Subarray From Two Arrays",
        "titleCN": "2771 构造最长非递减子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Non-decreasing Subarray From Two Arrays"
    },
    {
        "arg": "apply-operations-to-make-all-array-elements-equal-to-zero",
        "titleUS": "2772 Apply Operations to Make All Array Elements Equal to Zero",
        "titleCN": "2772 使数组中的所有元素都等于零",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Apply Operations to Make All Array Elements Equal to Zero"
    },
    {
        "arg": "height-of-special-binary-tree",
        "titleUS": "2773 Height of Special Binary Tree",
        "titleCN": "2773 特殊二叉树的高度",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Height of Special Binary Tree"
    },
    {
        "arg": "sum-of-squares-of-special-elements",
        "titleUS": "2778 Sum of Squares of Special Elements ",
        "titleCN": "2778 特殊元素平方和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sum of Squares of Special Elements "
    },
    {
        "arg": "maximum-beauty-of-an-array-after-applying-operation",
        "titleUS": "2779 Maximum Beauty of an Array After Applying Operation",
        "titleCN": "2779 数组的最大美丽值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Beauty of an Array After Applying Operation"
    },
    {
        "arg": "minimum-index-of-a-valid-split",
        "titleUS": "2780 Minimum Index of a Valid Split",
        "titleCN": "2780 合法分割的最小下标",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Index of a Valid Split"
    },
    {
        "arg": "length-of-the-longest-valid-substring",
        "titleUS": "2781 Length of the Longest Valid Substring",
        "titleCN": "2781 最长合法子字符串的长度",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Length of the Longest Valid Substring"
    },
    {
        "arg": "number-of-unique-categories",
        "titleUS": "2782 Number of Unique Categories",
        "titleCN": "2782 唯一类别的数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Unique Categories"
    },
    {
        "arg": "check-if-array-is-good",
        "titleUS": "2784 Check if Array is Good",
        "titleCN": "2784 检查数组是否是好的",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if Array is Good"
    },
    {
        "arg": "sort-vowels-in-a-string",
        "titleUS": "2785 Sort Vowels in a String",
        "titleCN": "2785 将字符串中的元音字母排序",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sort Vowels in a String"
    },
    {
        "arg": "visit-array-positions-to-maximize-score",
        "titleUS": "2786 Visit Array Positions to Maximize Score",
        "titleCN": "2786 访问数组中的位置使分数最大",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Visit Array Positions to Maximize Score"
    },
    {
        "arg": "ways-to-express-an-integer-as-sum-of-powers",
        "titleUS": "2787 Ways to Express an Integer as Sum of Powers",
        "titleCN": "2787 将一个数字表示成幂的和的方案数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Ways to Express an Integer as Sum of Powers"
    },
    {
        "arg": "split-strings-by-separator",
        "titleUS": "2788 Split Strings by Separator",
        "titleCN": "2788 按分隔符拆分字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Split Strings by Separator"
    },
    {
        "arg": "largest-element-in-an-array-after-merge-operations",
        "titleUS": "2789 Largest Element in an Array after Merge Operations",
        "titleCN": "2789 合并后数组中的最大元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Largest Element in an Array after Merge Operations"
    },
    {
        "arg": "maximum-number-of-groups-with-increasing-length",
        "titleUS": "2790 Maximum Number of Groups With Increasing Length",
        "titleCN": "2790 长度递增组的最大数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Number of Groups With Increasing Length"
    },
    {
        "arg": "count-paths-that-can-form-a-palindrome-in-a-tree",
        "titleUS": "2791 Count Paths That Can Form a Palindrome in a Tree",
        "titleCN": "2791 树中可以形成回文的路径数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Paths That Can Form a Palindrome in a Tree"
    },
    {
        "arg": "count-nodes-that-are-great-enough",
        "titleUS": "2792 Count Nodes That Are Great Enough",
        "titleCN": "2792 计算足够大的节点数",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Count Nodes That Are Great Enough"
    },
    {
        "arg": "number-of-employees-who-met-the-target",
        "titleUS": "2798 Number of Employees Who Met the Target",
        "titleCN": "2798 满足目标工作时长的员工数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Employees Who Met the Target"
    },
    {
        "arg": "count-complete-subarrays-in-an-array",
        "titleUS": "2799 Count Complete Subarrays in an Array",
        "titleCN": "2799 统计完全子数组的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Complete Subarrays in an Array"
    },
    {
        "arg": "shortest-string-that-contains-three-strings",
        "titleUS": "2800 Shortest String That Contains Three Strings",
        "titleCN": "2800 包含三个字符串的最短字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Shortest String That Contains Three Strings"
    },
    {
        "arg": "count-stepping-numbers-in-range",
        "titleUS": "2801 Count Stepping Numbers in Range",
        "titleCN": "2801 统计范围内的步进数字数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Stepping Numbers in Range"
    },
    {
        "arg": "find-the-k-th-lucky-number",
        "titleUS": "2802 Find The K-th Lucky Number",
        "titleCN": "2802 找出第 K 个幸运数字",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Find The K-th Lucky Number"
    },
    {
        "arg": "account-balance-after-rounded-purchase",
        "titleUS": "2806 Account Balance After Rounded Purchase",
        "titleCN": "2806 取整购买后的账户余额",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Account Balance After Rounded Purchase"
    },
    {
        "arg": "insert-greatest-common-divisors-in-linked-list",
        "titleUS": "2807 Insert Greatest Common Divisors in Linked List",
        "titleCN": "2807 在链表中插入最大公约数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Insert Greatest Common Divisors in Linked List"
    },
    {
        "arg": "minimum-seconds-to-equalize-a-circular-array",
        "titleUS": "2808 Minimum Seconds to Equalize a Circular Array",
        "titleCN": "2808 使循环数组所有元素相等的最少秒数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Seconds to Equalize a Circular Array"
    },
    {
        "arg": "minimum-time-to-make-array-sum-at-most-x",
        "titleUS": "2809 Minimum Time to Make Array Sum At Most x",
        "titleCN": "2809 使数组和小于等于 x 的最少时间",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Time to Make Array Sum At Most x"
    },
    {
        "arg": "faulty-keyboard",
        "titleUS": "2810 Faulty Keyboard",
        "titleCN": "2810 故障键盘",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Faulty Keyboard"
    },
    {
        "arg": "check-if-it-is-possible-to-split-array",
        "titleUS": "2811 Check if it is Possible to Split Array",
        "titleCN": "2811 判断是否能拆分数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Check if it is Possible to Split Array"
    },
    {
        "arg": "find-the-safest-path-in-a-grid",
        "titleUS": "2812 Find the Safest Path in a Grid",
        "titleCN": "2812 找出最安全路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Safest Path in a Grid"
    },
    {
        "arg": "maximum-elegance-of-a-k-length-subsequence",
        "titleUS": "2813 Maximum Elegance of a K-Length Subsequence",
        "titleCN": "2813 子序列最大优雅度",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Elegance of a K-Length Subsequence"
    },
    {
        "arg": "minimum-time-takes-to-reach-destination-without-drowning",
        "titleUS": "2814 Minimum Time Takes to Reach Destination Without Drowning",
        "titleCN": "2814 避免淹死并到达目的地的最短时间",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Minimum Time Takes to Reach Destination Without Drowning"
    },
    {
        "arg": "max-pair-sum-in-an-array",
        "titleUS": "2815 Max Pair Sum in an Array",
        "titleCN": "2815 数组中的最大数对和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Max Pair Sum in an Array"
    },
    {
        "arg": "double-a-number-represented-as-a-linked-list",
        "titleUS": "2816 Double a Number Represented as a Linked List",
        "titleCN": "2816 翻倍以链表形式表示的数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Double a Number Represented as a Linked List"
    },
    {
        "arg": "minimum-absolute-difference-between-elements-with-constraint",
        "titleUS": "2817 Minimum Absolute Difference Between Elements With Constraint",
        "titleCN": "2817 限制条件下元素之间的最小绝对差",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Absolute Difference Between Elements With Constraint"
    },
    {
        "arg": "apply-operations-to-maximize-score",
        "titleUS": "2818 Apply Operations to Maximize Score",
        "titleCN": "2818 操作使得分最大",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Apply Operations to Maximize Score"
    },
    {
        "arg": "minimum-relative-loss-after-buying-chocolates",
        "titleUS": "2819 Minimum Relative Loss After Buying Chocolates",
        "titleCN": "2819 购买巧克力后的最小相对损失",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Minimum Relative Loss After Buying Chocolates"
    },
    {
        "arg": "count-pairs-whose-sum-is-less-than-target",
        "titleUS": "2824 Count Pairs Whose Sum is Less than Target",
        "titleCN": "2824 统计和小于目标的下标对数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Pairs Whose Sum is Less than Target"
    },
    {
        "arg": "make-string-a-subsequence-using-cyclic-increments",
        "titleUS": "2825 Make String a Subsequence Using Cyclic Increments",
        "titleCN": "2825 循环增长使字符串子序列等于另一个字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Make String a Subsequence Using Cyclic Increments"
    },
    {
        "arg": "sorting-three-groups",
        "titleUS": "2826 Sorting Three Groups",
        "titleCN": "2826 将三个组排序",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Sorting Three Groups"
    },
    {
        "arg": "number-of-beautiful-integers-in-the-range",
        "titleUS": "2827 Number of Beautiful Integers in the Range",
        "titleCN": "2827 范围中美丽整数的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Beautiful Integers in the Range"
    },
    {
        "arg": "check-if-a-string-is-an-acronym-of-words",
        "titleUS": "2828 Check if a String Is an Acronym of Words",
        "titleCN": "2828 判别首字母缩略词",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if a String Is an Acronym of Words"
    },
    {
        "arg": "determine-the-minimum-sum-of-a-k-avoiding-array",
        "titleUS": "2829 Determine the Minimum Sum of a k-avoiding Array",
        "titleCN": "2829 k-avoiding 数组的最小总和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Determine the Minimum Sum of a k-avoiding Array"
    },
    {
        "arg": "maximize-the-profit-as-the-salesman",
        "titleUS": "2830 Maximize the Profit as the Salesman",
        "titleCN": "2830 销售利润最大化",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximize the Profit as the Salesman"
    },
    {
        "arg": "find-the-longest-equal-subarray",
        "titleUS": "2831 Find the Longest Equal Subarray",
        "titleCN": "2831 找出最长等值子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Longest Equal Subarray"
    },
    {
        "arg": "maximal-range-that-each-element-is-maximum-in-it",
        "titleUS": "2832 Maximal Range That Each Element Is Maximum in It",
        "titleCN": "2832 每个元素为最大值的最大范围",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximal Range That Each Element Is Maximum in It"
    },
    {
        "arg": "furthest-point-from-origin",
        "titleUS": "2833 Furthest Point From Origin",
        "titleCN": "2833 距离原点最远的点",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Furthest Point From Origin"
    },
    {
        "arg": "find-the-minimum-possible-sum-of-a-beautiful-array",
        "titleUS": "2834 Find the Minimum Possible Sum of a Beautiful Array",
        "titleCN": "2834 找出美丽数组的最小和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Minimum Possible Sum of a Beautiful Array"
    },
    {
        "arg": "minimum-operations-to-form-subsequence-with-target-sum",
        "titleUS": "2835 Minimum Operations to Form Subsequence With Target Sum",
        "titleCN": "2835 使子序列的和等于目标的最少操作次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Operations to Form Subsequence With Target Sum"
    },
    {
        "arg": "maximize-value-of-function-in-a-ball-passing-game",
        "titleUS": "2836 Maximize Value of Function in a Ball Passing Game",
        "titleCN": "2836 在传球游戏中最大化函数值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximize Value of Function in a Ball Passing Game"
    },
    {
        "arg": "maximum-coins-heroes-can-collect",
        "titleUS": "2838 Maximum Coins Heroes Can Collect",
        "titleCN": "2838 ",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Coins Heroes Can Collect"
    },
    {
        "arg": "check-if-strings-can-be-made-equal-with-operations-i",
        "titleUS": "2839 Check if Strings Can be Made Equal With Operations I",
        "titleCN": "2839 判断通过操作能否让字符串相等 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if Strings Can be Made Equal With Operations I"
    },
    {
        "arg": "check-if-strings-can-be-made-equal-with-operations-ii",
        "titleUS": "2840 Check if Strings Can be Made Equal With Operations II",
        "titleCN": "2840 判断通过操作能否让字符串相等 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Check if Strings Can be Made Equal With Operations II"
    },
    {
        "arg": "maximum-sum-of-almost-unique-subarray",
        "titleUS": "2841 Maximum Sum of Almost Unique Subarray",
        "titleCN": "2841 几乎唯一子数组的最大和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Sum of Almost Unique Subarray"
    },
    {
        "arg": "count-k-subsequences-of-a-string-with-maximum-beauty",
        "titleUS": "2842 Count K-Subsequences of a String With Maximum Beauty",
        "titleCN": "2842 统计一个字符串的 k 子序列美丽值最大的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count K-Subsequences of a String With Maximum Beauty"
    },
    {
        "arg": "count-symmetric-integers",
        "titleUS": "2843   Count Symmetric Integers",
        "titleCN": "2843 统计对称整数的数目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单   Count Symmetric Integers"
    },
    {
        "arg": "minimum-operations-to-make-a-special-number",
        "titleUS": "2844 Minimum Operations to Make a Special Number",
        "titleCN": "2844 生成特殊数字的最少操作",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Operations to Make a Special Number"
    },
    {
        "arg": "count-of-interesting-subarrays",
        "titleUS": "2845 Count of Interesting Subarrays",
        "titleCN": "2845 统计趣味子数组的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count of Interesting Subarrays"
    },
    {
        "arg": "minimum-edge-weight-equilibrium-queries-in-a-tree",
        "titleUS": "2846 Minimum Edge Weight Equilibrium Queries in a Tree",
        "titleCN": "2846 边权重均等查询",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Edge Weight Equilibrium Queries in a Tree"
    },
    {
        "arg": "smallest-number-with-given-digit-product",
        "titleUS": "2847 Smallest Number With Given Digit Product",
        "titleCN": "2847 给定数字乘积的最小数字",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Smallest Number With Given Digit Product"
    },
    {
        "arg": "points-that-intersect-with-cars",
        "titleUS": "2848 Points That Intersect With Cars",
        "titleCN": "2848 与车相交的点",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Points That Intersect With Cars"
    },
    {
        "arg": "determine-if-a-cell-is-reachable-at-a-given-time",
        "titleUS": "2849 Determine if a Cell Is Reachable at a Given Time",
        "titleCN": "2849 判断能否在给定时间到达单元格",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Determine if a Cell Is Reachable at a Given Time"
    },
    {
        "arg": "minimum-moves-to-spread-stones-over-grid",
        "titleUS": "2850 Minimum Moves to Spread Stones Over Grid",
        "titleCN": "2850 将石头分散到网格图的最少移动次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Moves to Spread Stones Over Grid"
    },
    {
        "arg": "string-transformation",
        "titleUS": "2851 String Transformation",
        "titleCN": "2851 字符串转换",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 String Transformation"
    },
    {
        "arg": "sum-of-remoteness-of-all-cells",
        "titleUS": "2852 Sum of Remoteness of All Cells",
        "titleCN": "2852 所有单元格的远离程度之和",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Sum of Remoteness of All Cells"
    },
    {
        "arg": "minimum-right-shifts-to-sort-the-array",
        "titleUS": "2855 Minimum Right Shifts to Sort the Array",
        "titleCN": "2855 使数组成为递增数组的最少右移次数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Right Shifts to Sort the Array"
    },
    {
        "arg": "minimum-array-length-after-pair-removals",
        "titleUS": "2856 Minimum Array Length After Pair Removals",
        "titleCN": "2856 删除数对后的最小数组长度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Array Length After Pair Removals"
    },
    {
        "arg": "count-pairs-of-points-with-distance-k",
        "titleUS": "2857 Count Pairs of Points With Distance k",
        "titleCN": "2857 统计距离为 k 的点对",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Pairs of Points With Distance k"
    },
    {
        "arg": "minimum-edge-reversals-so-every-node-is-reachable",
        "titleUS": "2858 Minimum Edge Reversals So Every Node Is Reachable",
        "titleCN": "2858 可以到达每一个节点的最少边反转次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Edge Reversals So Every Node Is Reachable"
    },
    {
        "arg": "sum-of-values-at-indices-with-k-set-bits",
        "titleUS": "2859 Sum of Values at Indices With K Set Bits",
        "titleCN": "2859 计算 K 置位下标对应元素的和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Sum of Values at Indices With K Set Bits"
    },
    {
        "arg": "happy-students",
        "titleUS": "2860 Happy Students",
        "titleCN": "2860 让所有学生保持开心的分组方法数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Happy Students"
    },
    {
        "arg": "maximum-number-of-alloys",
        "titleUS": "2861 Maximum Number of Alloys",
        "titleCN": "2861 最大合金数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Alloys"
    },
    {
        "arg": "maximum-element-sum-of-a-complete-subset-of-indices",
        "titleUS": "2862 Maximum Element-Sum of a Complete Subset of Indices",
        "titleCN": "2862 完全子集的最大元素和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Element-Sum of a Complete Subset of Indices"
    },
    {
        "arg": "maximum-length-of-semi-decreasing-subarrays",
        "titleUS": "2863 Maximum Length of Semi-Decreasing Subarrays",
        "titleCN": "2863 最长半递减数组",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Length of Semi-Decreasing Subarrays"
    },
    {
        "arg": "maximum-odd-binary-number",
        "titleUS": "2864 Maximum Odd Binary Number",
        "titleCN": "2864 最大二进制奇数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Odd Binary Number"
    },
    {
        "arg": "beautiful-towers-i",
        "titleUS": "2865 Beautiful Towers I",
        "titleCN": "2865 美丽塔 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Beautiful Towers I"
    },
    {
        "arg": "beautiful-towers-ii",
        "titleUS": "2866 Beautiful Towers II",
        "titleCN": "2866 美丽塔 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Beautiful Towers II"
    },
    {
        "arg": "count-valid-paths-in-a-tree",
        "titleUS": "2867 Count Valid Paths in a Tree",
        "titleCN": "2867 统计树中的合法路径数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Valid Paths in a Tree"
    },
    {
        "arg": "the-wording-game",
        "titleUS": "2868 The Wording Game",
        "titleCN": "2868 单词游戏",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 The Wording Game"
    },
    {
        "arg": "minimum-operations-to-collect-elements",
        "titleUS": "2869 Minimum Operations to Collect Elements",
        "titleCN": "2869 收集元素的最少操作次数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Operations to Collect Elements"
    },
    {
        "arg": "minimum-number-of-operations-to-make-array-empty",
        "titleUS": "2870 Minimum Number of Operations to Make Array Empty",
        "titleCN": "2870 使数组为空的最少操作次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Operations to Make Array Empty"
    },
    {
        "arg": "split-array-into-maximum-number-of-subarrays",
        "titleUS": "2871 Split Array Into Maximum Number of Subarrays",
        "titleCN": "2871 将数组分割成最多数目的子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Split Array Into Maximum Number of Subarrays"
    },
    {
        "arg": "maximum-number-of-k-divisible-components",
        "titleUS": "2872 Maximum Number of K-Divisible Components",
        "titleCN": "2872 可以被 K 整除连通块的最大数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Number of K-Divisible Components"
    },
    {
        "arg": "maximum-value-of-an-ordered-triplet-i",
        "titleUS": "2873 Maximum Value of an Ordered Triplet I",
        "titleCN": "2873 有序三元组中的最大值 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Value of an Ordered Triplet I"
    },
    {
        "arg": "maximum-value-of-an-ordered-triplet-ii",
        "titleUS": "2874 Maximum Value of an Ordered Triplet II",
        "titleCN": "2874 有序三元组中的最大值 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Value of an Ordered Triplet II"
    },
    {
        "arg": "minimum-size-subarray-in-infinite-array",
        "titleUS": "2875 Minimum Size Subarray in Infinite Array",
        "titleCN": "2875 无限数组的最短子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Size Subarray in Infinite Array"
    },
    {
        "arg": "count-visited-nodes-in-a-directed-graph",
        "titleUS": "2876 Count Visited Nodes in a Directed Graph",
        "titleCN": "2876 有向图访问计数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Visited Nodes in a Directed Graph"
    },
    {
        "arg": "minimizing-array-after-replacing-pairs-with-their-product",
        "titleUS": "2892 Minimizing Array After Replacing Pairs With Their Product",
        "titleCN": "2892 将相邻元素相乘后得到最小化数组",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Minimizing Array After Replacing Pairs With Their Product"
    },
    {
        "arg": "divisible-and-non-divisible-sums-difference",
        "titleUS": "2894 Divisible and Non-divisible Sums Difference",
        "titleCN": "2894 分类求和并作差",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Divisible and Non-divisible Sums Difference"
    },
    {
        "arg": "minimum-processing-time",
        "titleUS": "2895 Minimum Processing Time",
        "titleCN": "2895 最小处理时间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Processing Time"
    },
    {
        "arg": "apply-operations-to-make-two-strings-equal",
        "titleUS": "2896 Apply Operations to Make Two Strings Equal",
        "titleCN": "2896 执行操作使两个字符串相等",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Apply Operations to Make Two Strings Equal"
    },
    {
        "arg": "apply-operations-on-array-to-maximize-sum-of-squares",
        "titleUS": "2897 Apply Operations on Array to Maximize Sum of Squares",
        "titleCN": "2897 对数组执行操作使平方和最大",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Apply Operations on Array to Maximize Sum of Squares"
    },
    {
        "arg": "maximum-linear-stock-score",
        "titleUS": "2898 Maximum Linear Stock Score",
        "titleCN": "2898 最大线性股票得分",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Linear Stock Score"
    },
    {
        "arg": "last-visited-integers",
        "titleUS": "2899 Last Visited Integers",
        "titleCN": "2899 上一个遍历的整数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Last Visited Integers"
    },
    {
        "arg": "longest-unequal-adjacent-groups-subsequence-i",
        "titleUS": "2900 Longest Unequal Adjacent Groups Subsequence I",
        "titleCN": "2900 最长相邻不相等子序列 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Longest Unequal Adjacent Groups Subsequence I"
    },
    {
        "arg": "longest-unequal-adjacent-groups-subsequence-ii",
        "titleUS": "2901 Longest Unequal Adjacent Groups Subsequence II",
        "titleCN": "2901 最长相邻不相等子序列 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Longest Unequal Adjacent Groups Subsequence II"
    },
    {
        "arg": "count-of-sub-multisets-with-bounded-sum",
        "titleUS": "2902 Count of Sub-Multisets With Bounded Sum",
        "titleCN": "2902 和带限制的子多重集合的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count of Sub-Multisets With Bounded Sum"
    },
    {
        "arg": "find-indices-with-index-and-value-difference-i",
        "titleUS": "2903 Find Indices With Index and Value Difference I",
        "titleCN": "2903 找出满足差值条件的下标 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Indices With Index and Value Difference I"
    },
    {
        "arg": "shortest-and-lexicographically-smallest-beautiful-string",
        "titleUS": "2904 Shortest and Lexicographically Smallest Beautiful String",
        "titleCN": "2904 最短且字典序最小的美丽子字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Shortest and Lexicographically Smallest Beautiful String"
    },
    {
        "arg": "find-indices-with-index-and-value-difference-ii",
        "titleUS": "2905 Find Indices With Index and Value Difference II",
        "titleCN": "2905 找出满足差值条件的下标 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Indices With Index and Value Difference II"
    },
    {
        "arg": "construct-product-matrix",
        "titleUS": "2906 Construct Product Matrix",
        "titleCN": "2906 构造乘积矩阵",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Construct Product Matrix"
    },
    {
        "arg": "maximum-profitable-triplets-with-increasing-prices-i",
        "titleUS": "2907 Maximum Profitable Triplets With Increasing Prices I",
        "titleCN": "2907 价格递增的最大利润三元组 I",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Profitable Triplets With Increasing Prices I"
    },
    {
        "arg": "minimum-sum-of-mountain-triplets-i",
        "titleUS": "2908 Minimum Sum of Mountain Triplets I",
        "titleCN": "2908 元素和最小的山形三元组 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Sum of Mountain Triplets I"
    },
    {
        "arg": "minimum-sum-of-mountain-triplets-ii",
        "titleUS": "2909 Minimum Sum of Mountain Triplets II",
        "titleCN": "2909 元素和最小的山形三元组 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Sum of Mountain Triplets II"
    },
    {
        "arg": "minimum-number-of-groups-to-create-a-valid-assignment",
        "titleUS": "2910 Minimum Number of Groups to Create a Valid Assignment",
        "titleCN": "2910 合法分组的最少组数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Groups to Create a Valid Assignment"
    },
    {
        "arg": "minimum-changes-to-make-k-semi-palindromes",
        "titleUS": "2911 Minimum Changes to Make K Semi-palindromes",
        "titleCN": "2911 得到 K 个半回文串的最少修改次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Changes to Make K Semi-palindromes"
    },
    {
        "arg": "number-of-ways-to-reach-destination-in-the-grid",
        "titleUS": "2912 Number of Ways to Reach Destination in the Grid",
        "titleCN": "2912 在网格上移动到目的地的方法数",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Number of Ways to Reach Destination in the Grid"
    },
    {
        "arg": "subarrays-distinct-element-sum-of-squares-i",
        "titleUS": "2913 Subarrays Distinct Element Sum of Squares I",
        "titleCN": "2913 子数组不同元素数目的平方和 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Subarrays Distinct Element Sum of Squares I"
    },
    {
        "arg": "minimum-number-of-changes-to-make-binary-string-beautiful",
        "titleUS": "2914 Minimum Number of Changes to Make Binary String Beautiful",
        "titleCN": "2914 使二进制字符串变美丽的最少修改次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Changes to Make Binary String Beautiful"
    },
    {
        "arg": "length-of-the-longest-subsequence-that-sums-to-target",
        "titleUS": "2915 Length of the Longest Subsequence That Sums to Target",
        "titleCN": "2915 和为目标值的最长子序列的长度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Length of the Longest Subsequence That Sums to Target"
    },
    {
        "arg": "subarrays-distinct-element-sum-of-squares-ii",
        "titleUS": "2916 Subarrays Distinct Element Sum of Squares II",
        "titleCN": "2916 子数组不同元素数目的平方和 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Subarrays Distinct Element Sum of Squares II"
    },
    {
        "arg": "find-the-k-or-of-an-array",
        "titleUS": "2917 Find the K-or of an Array",
        "titleCN": "2917 找出数组中的 K-or 值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the K-or of an Array"
    },
    {
        "arg": "minimum-equal-sum-of-two-arrays-after-replacing-zeros",
        "titleUS": "2918 Minimum Equal Sum of Two Arrays After Replacing Zeros",
        "titleCN": "2918 数组的最小相等和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Equal Sum of Two Arrays After Replacing Zeros"
    },
    {
        "arg": "minimum-increment-operations-to-make-array-beautiful",
        "titleUS": "2919 Minimum Increment Operations to Make Array Beautiful",
        "titleCN": "2919 使数组变美的最小增量运算数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Increment Operations to Make Array Beautiful"
    },
    {
        "arg": "maximum-points-after-collecting-coins-from-all-nodes",
        "titleUS": "2920 Maximum Points After Collecting Coins From All Nodes",
        "titleCN": "2920 收集所有金币可获得的最大积分",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Points After Collecting Coins From All Nodes"
    },
    {
        "arg": "maximum-profitable-triplets-with-increasing-prices-ii",
        "titleUS": "2921 Maximum Profitable Triplets With Increasing Prices II",
        "titleCN": "2921 价格递增的最大利润三元组 II",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Maximum Profitable Triplets With Increasing Prices II"
    },
    {
        "arg": "find-champion-i",
        "titleUS": "2923 Find Champion I",
        "titleCN": "2923 找到冠军 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Champion I"
    },
    {
        "arg": "find-champion-ii",
        "titleUS": "2924 Find Champion II",
        "titleCN": "2924 找到冠军 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Champion II"
    },
    {
        "arg": "maximum-score-after-applying-operations-on-a-tree",
        "titleUS": "2925 Maximum Score After Applying Operations on a Tree",
        "titleCN": "2925 在树上执行操作以后得到的最大分数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Score After Applying Operations on a Tree"
    },
    {
        "arg": "maximum-balanced-subsequence-sum",
        "titleUS": "2926 Maximum Balanced Subsequence Sum",
        "titleCN": "2926 平衡子序列的最大和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Balanced Subsequence Sum"
    },
    {
        "arg": "distribute-candies-among-children-iii",
        "titleUS": "2927 Distribute Candies Among Children III",
        "titleCN": "2927 给小朋友们分糖果 III",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Distribute Candies Among Children III"
    },
    {
        "arg": "distribute-candies-among-children-i",
        "titleUS": "2928 Distribute Candies Among Children I",
        "titleCN": "2928 给小朋友们分糖果 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Distribute Candies Among Children I"
    },
    {
        "arg": "distribute-candies-among-children-ii",
        "titleUS": "2929 Distribute Candies Among Children II",
        "titleCN": "2929 给小朋友们分糖果 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Distribute Candies Among Children II"
    },
    {
        "arg": "number-of-strings-which-can-be-rearranged-to-contain-substring",
        "titleUS": "2930 Number of Strings Which Can Be Rearranged to Contain Substring",
        "titleCN": "2930 重新排列后包含指定子字符串的字符串数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Strings Which Can Be Rearranged to Contain Substring"
    },
    {
        "arg": "maximum-spending-after-buying-items",
        "titleUS": "2931 Maximum Spending After Buying Items",
        "titleCN": "2931 购买物品的最大开销",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Spending After Buying Items"
    },
    {
        "arg": "maximum-strong-pair-xor-i",
        "titleUS": "2932 Maximum Strong Pair XOR I",
        "titleCN": "2932 找出强数对的最大异或值 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Strong Pair XOR I"
    },
    {
        "arg": "high-access-employees",
        "titleUS": "2933 High-Access Employees",
        "titleCN": "2933 高访问员工",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 High-Access Employees"
    },
    {
        "arg": "minimum-operations-to-maximize-last-elements-in-arrays",
        "titleUS": "2934 Minimum Operations to Maximize Last Elements in Arrays",
        "titleCN": "2934 最大化数组末位元素的最少操作次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Operations to Maximize Last Elements in Arrays"
    },
    {
        "arg": "maximum-strong-pair-xor-ii",
        "titleUS": "2935 Maximum Strong Pair XOR II",
        "titleCN": "2935 找出强数对的最大异或值 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Strong Pair XOR II"
    },
    {
        "arg": "number-of-equal-numbers-blocks",
        "titleUS": "2936 Number of Equal Numbers Blocks",
        "titleCN": "2936 包含相等值数字块的数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Equal Numbers Blocks"
    },
    {
        "arg": "make-three-strings-equal",
        "titleUS": "2937 Make Three Strings Equal",
        "titleCN": "2937 使三个字符串相等",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Make Three Strings Equal"
    },
    {
        "arg": "separate-black-and-white-balls",
        "titleUS": "2938 Separate Black and White Balls",
        "titleCN": "2938 区分黑球与白球",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Separate Black and White Balls"
    },
    {
        "arg": "maximum-xor-product",
        "titleUS": "2939 Maximum Xor Product",
        "titleCN": "2939 最大异或乘积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Xor Product"
    },
    {
        "arg": "find-building-where-alice-and-bob-can-meet",
        "titleUS": "2940 Find Building Where Alice and Bob Can Meet",
        "titleCN": "2940 找到 Alice 和 Bob 可以相遇的建筑",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find Building Where Alice and Bob Can Meet"
    },
    {
        "arg": "maximum-gcd-sum-of-a-subarray",
        "titleUS": "2941 Maximum GCD-Sum of a Subarray",
        "titleCN": "2941 子数组的最大 GCD-Sum",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Maximum GCD-Sum of a Subarray"
    },
    {
        "arg": "find-words-containing-character",
        "titleUS": "2942 Find Words Containing Character",
        "titleCN": "2942 查找包含给定字符的单词",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Words Containing Character"
    },
    {
        "arg": "maximize-area-of-square-hole-in-grid",
        "titleUS": "2943 Maximize Area of Square Hole in Grid",
        "titleCN": "2943 最大化网格图中正方形空洞的面积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximize Area of Square Hole in Grid"
    },
    {
        "arg": "minimum-number-of-coins-for-fruits",
        "titleUS": "2944 Minimum Number of Coins for Fruits",
        "titleCN": "2944 购买水果需要的最少金币数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Coins for Fruits"
    },
    {
        "arg": "find-maximum-non-decreasing-array-length",
        "titleUS": "2945 Find Maximum Non-decreasing Array Length",
        "titleCN": "2945 找到最大非递减数组的长度",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find Maximum Non-decreasing Array Length"
    },
    {
        "arg": "matrix-similarity-after-cyclic-shifts",
        "titleUS": "2946 Matrix Similarity After Cyclic Shifts",
        "titleCN": "2946 循环移位后的矩阵相似检查",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Matrix Similarity After Cyclic Shifts"
    },
    {
        "arg": "count-beautiful-substrings-i",
        "titleUS": "2947 Count Beautiful Substrings I",
        "titleCN": "2947 统计美丽子字符串 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Beautiful Substrings I"
    },
    {
        "arg": "make-lexicographically-smallest-array-by-swapping-elements",
        "titleUS": "2948 Make Lexicographically Smallest Array by Swapping Elements",
        "titleCN": "2948 交换得到字典序最小的数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Make Lexicographically Smallest Array by Swapping Elements"
    },
    {
        "arg": "count-beautiful-substrings-ii",
        "titleUS": "2949 Count Beautiful Substrings II",
        "titleCN": "2949 统计美丽子字符串 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Beautiful Substrings II"
    },
    {
        "arg": "number-of-divisible-substrings",
        "titleUS": "2950 Number of Divisible Substrings",
        "titleCN": "2950 可整除子串的数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Divisible Substrings"
    },
    {
        "arg": "find-the-peaks",
        "titleUS": "2951 Find the Peaks",
        "titleCN": "2951 找出峰值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Peaks"
    },
    {
        "arg": "minimum-number-of-coins-to-be-added",
        "titleUS": "2952 Minimum Number of Coins to be Added",
        "titleCN": "2952 需要添加的硬币的最小数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Coins to be Added"
    },
    {
        "arg": "count-complete-substrings",
        "titleUS": "2953 Count Complete Substrings",
        "titleCN": "2953 统计完全子字符串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Complete Substrings"
    },
    {
        "arg": "count-the-number-of-infection-sequences",
        "titleUS": "2954 Count the Number of Infection Sequences",
        "titleCN": "2954 统计感冒序列的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count the Number of Infection Sequences"
    },
    {
        "arg": "number-of-same-end-substrings",
        "titleUS": "2955 Number of Same-End Substrings",
        "titleCN": "2955 同端子串的数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Same-End Substrings"
    },
    {
        "arg": "find-common-elements-between-two-arrays",
        "titleUS": "2956 Find Common Elements Between Two Arrays",
        "titleCN": "2956 找到两个数组中的公共元素",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Common Elements Between Two Arrays"
    },
    {
        "arg": "remove-adjacent-almost-equal-characters",
        "titleUS": "2957 Remove Adjacent Almost-Equal Characters",
        "titleCN": "2957 消除相邻近似相等字符",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Remove Adjacent Almost-Equal Characters"
    },
    {
        "arg": "length-of-longest-subarray-with-at-most-k-frequency",
        "titleUS": "2958 Length of Longest Subarray With at Most K Frequency",
        "titleCN": "2958 最多 K 个重复元素的最长子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Length of Longest Subarray With at Most K Frequency"
    },
    {
        "arg": "number-of-possible-sets-of-closing-branches",
        "titleUS": "2959 Number of Possible Sets of Closing Branches",
        "titleCN": "2959 关闭分部的可行集合数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Possible Sets of Closing Branches"
    },
    {
        "arg": "count-tested-devices-after-test-operations",
        "titleUS": "2960 Count Tested Devices After Test Operations",
        "titleCN": "2960 统计已测试设备",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Tested Devices After Test Operations"
    },
    {
        "arg": "double-modular-exponentiation",
        "titleUS": "2961 Double Modular Exponentiation",
        "titleCN": "2961 双模幂运算",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Double Modular Exponentiation"
    },
    {
        "arg": "count-subarrays-where-max-element-appears-at-least-k-times",
        "titleUS": "2962 Count Subarrays Where Max Element Appears at Least K Times",
        "titleCN": "2962 统计最大元素出现至少 K 次的子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Subarrays Where Max Element Appears at Least K Times"
    },
    {
        "arg": "count-the-number-of-good-partitions",
        "titleUS": "2963 Count the Number of Good Partitions",
        "titleCN": "2963 统计好分割方案的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count the Number of Good Partitions"
    },
    {
        "arg": "number-of-divisible-triplet-sums",
        "titleUS": "2964 Number of Divisible Triplet Sums",
        "titleCN": "2964 可被整除的三元组数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Divisible Triplet Sums"
    },
    {
        "arg": "find-missing-and-repeated-values",
        "titleUS": "2965 Find Missing and Repeated Values",
        "titleCN": "2965 找出缺失和重复的数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find Missing and Repeated Values"
    },
    {
        "arg": "divide-array-into-arrays-with-max-difference",
        "titleUS": "2966 Divide Array Into Arrays With Max Difference",
        "titleCN": "2966 划分数组并满足最大差限制",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Divide Array Into Arrays With Max Difference"
    },
    {
        "arg": "minimum-cost-to-make-array-equalindromic",
        "titleUS": "2967 Minimum Cost to Make Array Equalindromic",
        "titleCN": "2967 使数组成为等数数组的最小代价",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Cost to Make Array Equalindromic"
    },
    {
        "arg": "apply-operations-to-maximize-frequency-score",
        "titleUS": "2968 Apply Operations to Maximize Frequency Score",
        "titleCN": "2968 执行操作使频率分数最大",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Apply Operations to Maximize Frequency Score"
    },
    {
        "arg": "minimum-number-of-coins-for-fruits-ii",
        "titleUS": "2969 Minimum Number of Coins for Fruits II",
        "titleCN": "2969 购买水果需要的最少金币数 II",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Minimum Number of Coins for Fruits II"
    },
    {
        "arg": "count-the-number-of-incremovable-subarrays-i",
        "titleUS": "2970 Count the Number of Incremovable Subarrays I",
        "titleCN": "2970 统计移除递增子数组的数目 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count the Number of Incremovable Subarrays I"
    },
    {
        "arg": "find-polygon-with-the-largest-perimeter",
        "titleUS": "2971 Find Polygon With the Largest Perimeter",
        "titleCN": "2971 找到最大周长的多边形",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Polygon With the Largest Perimeter"
    },
    {
        "arg": "count-the-number-of-incremovable-subarrays-ii",
        "titleUS": "2972 Count the Number of Incremovable Subarrays II",
        "titleCN": "2972 统计移除递增子数组的数目 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count the Number of Incremovable Subarrays II"
    },
    {
        "arg": "find-number-of-coins-to-place-in-tree-nodes",
        "titleUS": "2973 Find Number of Coins to Place in Tree Nodes",
        "titleCN": "2973 树中每个节点放置的金币数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find Number of Coins to Place in Tree Nodes"
    },
    {
        "arg": "minimum-number-game",
        "titleUS": "2974 Minimum Number Game",
        "titleCN": "2974 最小数字游戏",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Number Game"
    },
    {
        "arg": "maximum-square-area-by-removing-fences-from-a-field",
        "titleUS": "2975 Maximum Square Area by Removing Fences From a Field",
        "titleCN": "2975 移除栅栏得到的正方形田地的最大面积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Square Area by Removing Fences From a Field"
    },
    {
        "arg": "minimum-cost-to-convert-string-i",
        "titleUS": "2976 Minimum Cost to Convert String I",
        "titleCN": "2976 转换字符串的最小成本 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Cost to Convert String I"
    },
    {
        "arg": "minimum-cost-to-convert-string-ii",
        "titleUS": "2977 Minimum Cost to Convert String II",
        "titleCN": "2977 转换字符串的最小成本 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Cost to Convert String II"
    },
    {
        "arg": "most-expensive-item-that-can-not-be-bought",
        "titleUS": "2979 Most Expensive Item That Can Not Be Bought",
        "titleCN": "2979 最贵的无法购买的商品",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Most Expensive Item That Can Not Be Bought"
    },
    {
        "arg": "check-if-bitwise-or-has-trailing-zeros",
        "titleUS": "2980 Check if Bitwise OR Has Trailing Zeros",
        "titleCN": "2980 检查按位或是否存在尾随零",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Check if Bitwise OR Has Trailing Zeros"
    },
    {
        "arg": "find-longest-special-substring-that-occurs-thrice-i",
        "titleUS": "2981 Find Longest Special Substring That Occurs Thrice I",
        "titleCN": "2981 找出出现至少三次的最长特殊子字符串 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Longest Special Substring That Occurs Thrice I"
    },
    {
        "arg": "find-longest-special-substring-that-occurs-thrice-ii",
        "titleUS": "2982 Find Longest Special Substring That Occurs Thrice II",
        "titleCN": "2982 找出出现至少三次的最长特殊子字符串 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Longest Special Substring That Occurs Thrice II"
    },
    {
        "arg": "palindrome-rearrangement-queries",
        "titleUS": "2983 Palindrome Rearrangement Queries",
        "titleCN": "2983 回文串重新排列查询",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Palindrome Rearrangement Queries"
    },
    {
        "arg": "number-of-self-divisible-permutations",
        "titleUS": "2992 Number of Self-Divisible Permutations",
        "titleCN": "2992 自整除排列的数量",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Number of Self-Divisible Permutations"
    },
    {
        "arg": "smallest-missing-integer-greater-than-sequential-prefix-sum",
        "titleUS": "2996 Smallest Missing Integer Greater Than Sequential Prefix Sum",
        "titleCN": "2996 大于等于顺序前缀和的最小缺失整数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Smallest Missing Integer Greater Than Sequential Prefix Sum"
    },
    {
        "arg": "minimum-number-of-operations-to-make-array-xor-equal-to-k",
        "titleUS": "2997 Minimum Number of Operations to Make Array XOR Equal to K",
        "titleCN": "2997 使数组异或和等于 K 的最少操作次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Operations to Make Array XOR Equal to K"
    },
    {
        "arg": "minimum-number-of-operations-to-make-x-and-y-equal",
        "titleUS": "2998 Minimum Number of Operations to Make X and Y Equal",
        "titleCN": "2998 使 X 和 Y 相等的最少操作次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Operations to Make X and Y Equal"
    },
    {
        "arg": "count-the-number-of-powerful-integers",
        "titleUS": "2999 Count the Number of Powerful Integers",
        "titleCN": "2999 统计强大整数的数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count the Number of Powerful Integers"
    },
    {
        "arg": "maximum-area-of-longest-diagonal-rectangle",
        "titleUS": "3000 Maximum Area of Longest Diagonal Rectangle",
        "titleCN": "3000 对角线最长的矩形的面积",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Area of Longest Diagonal Rectangle"
    },
    {
        "arg": "minimum-moves-to-capture-the-queen",
        "titleUS": "3001 Minimum Moves to Capture The Queen",
        "titleCN": "3001 捕获黑皇后需要的最少移动次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Moves to Capture The Queen"
    },
    {
        "arg": "maximum-size-of-a-set-after-removals",
        "titleUS": "3002 Maximum Size of a Set After Removals",
        "titleCN": "3002 移除后集合的最多元素数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Size of a Set After Removals"
    },
    {
        "arg": "maximize-the-number-of-partitions-after-operations",
        "titleUS": "3003 Maximize the Number of Partitions After Operations",
        "titleCN": "3003 执行操作后的最大分割数量",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximize the Number of Partitions After Operations"
    },
    {
        "arg": "maximum-subtree-of-the-same-color",
        "titleUS": "3004 Maximum Subtree of the Same Color",
        "titleCN": "3004 相同颜色的最大子树",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Subtree of the Same Color"
    },
    {
        "arg": "count-elements-with-maximum-frequency",
        "titleUS": "3005 Count Elements With Maximum Frequency",
        "titleCN": "3005 最大频率元素计数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Elements With Maximum Frequency"
    },
    {
        "arg": "find-beautiful-indices-in-the-given-array-i",
        "titleUS": "3006 Find Beautiful Indices in the Given Array I",
        "titleCN": "3006 找出数组中的美丽下标 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find Beautiful Indices in the Given Array I"
    },
    {
        "arg": "maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k",
        "titleUS": "3007 Maximum Number That Sum of the Prices Is Less Than or Equal to K",
        "titleCN": "3007 价值和小于等于 K 的最大数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number That Sum of the Prices Is Less Than or Equal to K"
    },
    {
        "arg": "find-beautiful-indices-in-the-given-array-ii",
        "titleUS": "3008 Find Beautiful Indices in the Given Array II",
        "titleCN": "3008 找出数组中的美丽下标 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find Beautiful Indices in the Given Array II"
    },
    {
        "arg": "maximum-number-of-intersections-on-the-chart",
        "titleUS": "3009 Maximum Number of Intersections on the Chart",
        "titleCN": "3009 折线图上的最大交点数量",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Maximum Number of Intersections on the Chart"
    },
    {
        "arg": "divide-an-array-into-subarrays-with-minimum-cost-i",
        "titleUS": "3010 Divide an Array Into Subarrays With Minimum Cost I",
        "titleCN": "3010 将数组分成最小总代价的子数组 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Divide an Array Into Subarrays With Minimum Cost I"
    },
    {
        "arg": "find-if-array-can-be-sorted",
        "titleUS": "3011 Find if Array Can Be Sorted",
        "titleCN": "3011 判断一个数组是否可以变为有序",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find if Array Can Be Sorted"
    },
    {
        "arg": "minimize-length-of-array-using-operations",
        "titleUS": "3012 Minimize Length of Array Using Operations",
        "titleCN": "3012 通过操作使数组长度最小",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimize Length of Array Using Operations"
    },
    {
        "arg": "divide-an-array-into-subarrays-with-minimum-cost-ii",
        "titleUS": "3013 Divide an Array Into Subarrays With Minimum Cost II",
        "titleCN": "3013 将数组分成最小总代价的子数组 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Divide an Array Into Subarrays With Minimum Cost II"
    },
    {
        "arg": "minimum-number-of-pushes-to-type-word-i",
        "titleUS": "3014 Minimum Number of Pushes to Type Word I",
        "titleCN": "3014 输入单词需要的最少按键次数 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Number of Pushes to Type Word I"
    },
    {
        "arg": "count-the-number-of-houses-at-a-certain-distance-i",
        "titleUS": "3015 Count the Number of Houses at a Certain Distance I",
        "titleCN": "3015 按距离统计房屋对数目 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count the Number of Houses at a Certain Distance I"
    },
    {
        "arg": "minimum-number-of-pushes-to-type-word-ii",
        "titleUS": "3016 Minimum Number of Pushes to Type Word II",
        "titleCN": "3016 输入单词需要的最少按键次数 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Number of Pushes to Type Word II"
    },
    {
        "arg": "count-the-number-of-houses-at-a-certain-distance-ii",
        "titleUS": "3017 Count the Number of Houses at a Certain Distance II",
        "titleCN": "3017 按距离统计房屋对数目 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count the Number of Houses at a Certain Distance II"
    },
    {
        "arg": "maximum-number-of-removal-queries-that-can-be-processed-i",
        "titleUS": "3018 Maximum Number of Removal Queries That Can Be Processed I",
        "titleCN": "3018 可处理的最大删除操作数 I",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Maximum Number of Removal Queries That Can Be Processed I"
    },
    {
        "arg": "number-of-changing-keys",
        "titleUS": "3019 Number of Changing Keys",
        "titleCN": "3019 按键变更的次数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Number of Changing Keys"
    },
    {
        "arg": "find-the-maximum-number-of-elements-in-subset",
        "titleUS": "3020 Find the Maximum Number of Elements in Subset",
        "titleCN": "3020 子集中元素的最大数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Maximum Number of Elements in Subset"
    },
    {
        "arg": "alice-and-bob-playing-flower-game",
        "titleUS": "3021 Alice and Bob Playing Flower Game",
        "titleCN": "3021 Alice 和 Bob 玩鲜花游戏",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Alice and Bob Playing Flower Game"
    },
    {
        "arg": "minimize-or-of-remaining-elements-using-operations",
        "titleUS": "3022 Minimize OR of Remaining Elements Using Operations",
        "titleCN": "3022 给定操作次数内使剩余元素的或值最小",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimize OR of Remaining Elements Using Operations"
    },
    {
        "arg": "find-pattern-in-infinite-stream-i",
        "titleUS": "3023 Find Pattern in Infinite Stream I",
        "titleCN": "3023 在无限流中寻找模式 I",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Find Pattern in Infinite Stream I"
    },
    {
        "arg": "type-of-triangle",
        "titleUS": "3024 Type of Triangle",
        "titleCN": "3024 三角形类型",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Type of Triangle"
    },
    {
        "arg": "find-the-number-of-ways-to-place-people-i",
        "titleUS": "3025 Find the Number of Ways to Place People I",
        "titleCN": "3025 人员站位的方案数 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Number of Ways to Place People I"
    },
    {
        "arg": "maximum-good-subarray-sum",
        "titleUS": "3026 Maximum Good Subarray Sum",
        "titleCN": "3026 最大好子数组和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Good Subarray Sum"
    },
    {
        "arg": "find-the-number-of-ways-to-place-people-ii",
        "titleUS": "3027 Find the Number of Ways to Place People II",
        "titleCN": "3027 人员站位的方案数 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find the Number of Ways to Place People II"
    },
    {
        "arg": "ant-on-the-boundary",
        "titleUS": "3028 Ant on the Boundary",
        "titleCN": "3028 边界上的蚂蚁",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Ant on the Boundary"
    },
    {
        "arg": "minimum-time-to-revert-word-to-initial-state-i",
        "titleUS": "3029 Minimum Time to Revert Word to Initial State I",
        "titleCN": "3029 将单词恢复初始状态所需的最短时间 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Time to Revert Word to Initial State I"
    },
    {
        "arg": "find-the-grid-of-region-average",
        "titleUS": "3030 Find the Grid of Region Average",
        "titleCN": "3030 找出网格的区域平均强度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Grid of Region Average"
    },
    {
        "arg": "minimum-time-to-revert-word-to-initial-state-ii",
        "titleUS": "3031 Minimum Time to Revert Word to Initial State II",
        "titleCN": "3031 将单词恢复初始状态所需的最短时间 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Time to Revert Word to Initial State II"
    },
    {
        "arg": "count-numbers-with-unique-digits-ii",
        "titleUS": "3032 Count Numbers With Unique Digits II",
        "titleCN": "3032 统计各位数字都不同的数字个数 II",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Count Numbers With Unique Digits II"
    },
    {
        "arg": "modify-the-matrix",
        "titleUS": "3033 Modify the Matrix",
        "titleCN": "3033 修改矩阵",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Modify the Matrix"
    },
    {
        "arg": "number-of-subarrays-that-match-a-pattern-i",
        "titleUS": "3034 Number of Subarrays That Match a Pattern I",
        "titleCN": "3034 匹配模式数组的子数组数目 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Number of Subarrays That Match a Pattern I"
    },
    {
        "arg": "maximum-palindromes-after-operations",
        "titleUS": "3035 Maximum Palindromes After Operations",
        "titleCN": "3035 回文字符串的最大数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Palindromes After Operations"
    },
    {
        "arg": "number-of-subarrays-that-match-a-pattern-ii",
        "titleUS": "3036 Number of Subarrays That Match a Pattern II",
        "titleCN": "3036 匹配模式数组的子数组数目 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Number of Subarrays That Match a Pattern II"
    },
    {
        "arg": "find-pattern-in-infinite-stream-ii",
        "titleUS": "3037 Find Pattern in Infinite Stream II",
        "titleCN": "3037 在无限流中寻找模式 II",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Find Pattern in Infinite Stream II"
    },
    {
        "arg": "maximum-number-of-operations-with-the-same-score-i",
        "titleUS": "3038 Maximum Number of Operations With the Same Score I",
        "titleCN": "3038 相同分数的最大操作数目 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Number of Operations With the Same Score I"
    },
    {
        "arg": "apply-operations-to-make-string-empty",
        "titleUS": "3039 Apply Operations to Make String Empty",
        "titleCN": "3039 进行操作使字符串为空",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Apply Operations to Make String Empty"
    },
    {
        "arg": "maximum-number-of-operations-with-the-same-score-ii",
        "titleUS": "3040 Maximum Number of Operations With the Same Score II",
        "titleCN": "3040 相同分数的最大操作数目 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximum Number of Operations With the Same Score II"
    },
    {
        "arg": "maximize-consecutive-elements-in-an-array-after-modification",
        "titleUS": "3041 Maximize Consecutive Elements in an Array After Modification",
        "titleCN": "3041 修改数组后最大化数组中的连续元素数目",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximize Consecutive Elements in an Array After Modification"
    },
    {
        "arg": "count-prefix-and-suffix-pairs-i",
        "titleUS": "3042 Count Prefix and Suffix Pairs I",
        "titleCN": "3042 统计前后缀下标对 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Count Prefix and Suffix Pairs I"
    },
    {
        "arg": "find-the-length-of-the-longest-common-prefix",
        "titleUS": "3043 Find the Length of the Longest Common Prefix",
        "titleCN": "3043 最长公共前缀的长度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Length of the Longest Common Prefix"
    },
    {
        "arg": "most-frequent-prime",
        "titleUS": "3044 Most Frequent Prime",
        "titleCN": "3044 出现频率最高的质数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Most Frequent Prime"
    },
    {
        "arg": "count-prefix-and-suffix-pairs-ii",
        "titleUS": "3045 Count Prefix and Suffix Pairs II",
        "titleCN": "3045 统计前后缀下标对 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Count Prefix and Suffix Pairs II"
    },
    {
        "arg": "split-the-array",
        "titleUS": "3046 Split the Array",
        "titleCN": "3046 分割数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Split the Array"
    },
    {
        "arg": "find-the-largest-area-of-square-inside-two-rectangles",
        "titleUS": "3047 Find the Largest Area of Square Inside Two Rectangles",
        "titleCN": "3047 求交集区域内的最大正方形面积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Find the Largest Area of Square Inside Two Rectangles"
    },
    {
        "arg": "earliest-second-to-mark-indices-i",
        "titleUS": "3048 Earliest Second to Mark Indices I",
        "titleCN": "3048 标记所有下标的最早秒数 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Earliest Second to Mark Indices I"
    },
    {
        "arg": "earliest-second-to-mark-indices-ii",
        "titleUS": "3049 Earliest Second to Mark Indices II",
        "titleCN": "3049 标记所有下标的最早秒数 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Earliest Second to Mark Indices II"
    },
    {
        "arg": "winner-of-the-linked-list-game",
        "titleUS": "3062 Winner of the Linked List Game",
        "titleCN": "3062 链表游戏的获胜者",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Winner of the Linked List Game"
    },
    {
        "arg": "linked-list-frequency",
        "titleUS": "3063 Linked List Frequency",
        "titleCN": "3063 链表频率",
        "subtitleUS": "💰 Easy",
        "subtitleCN": "💰 简单 Linked List Frequency"
    },
    {
        "arg": "guess-the-number-using-bitwise-questions-i",
        "titleUS": "3064 Guess the Number Using Bitwise Questions I",
        "titleCN": "3064 使用按位查询猜测数字 I",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Guess the Number Using Bitwise Questions I"
    },
    {
        "arg": "minimum-operations-to-exceed-threshold-value-i",
        "titleUS": "3065 Minimum Operations to Exceed Threshold Value I",
        "titleCN": "3065 超过阈值的最少操作数 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Minimum Operations to Exceed Threshold Value I"
    },
    {
        "arg": "minimum-operations-to-exceed-threshold-value-ii",
        "titleUS": "3066 Minimum Operations to Exceed Threshold Value II",
        "titleCN": "3066 超过阈值的最少操作数 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Operations to Exceed Threshold Value II"
    },
    {
        "arg": "count-pairs-of-connectable-servers-in-a-weighted-tree-network",
        "titleUS": "3067 Count Pairs of Connectable Servers in a Weighted Tree Network",
        "titleCN": "3067 在带权树网络中统计可连接服务器对数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Pairs of Connectable Servers in a Weighted Tree Network"
    },
    {
        "arg": "find-the-maximum-sum-of-node-values",
        "titleUS": "3068 Find the Maximum Sum of Node Values",
        "titleCN": "3068 最大节点价值之和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find the Maximum Sum of Node Values"
    },
    {
        "arg": "distribute-elements-into-two-arrays-i",
        "titleUS": "3069 Distribute Elements Into Two Arrays I",
        "titleCN": "3069 将元素分配到两个数组中 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Distribute Elements Into Two Arrays I"
    },
    {
        "arg": "count-submatrices-with-top-left-element-and-sum-less-than-k",
        "titleUS": "3070 Count Submatrices with Top-Left Element and Sum Less Than k",
        "titleCN": "3070 元素和小于等于 k 的子矩阵的数目",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Submatrices with Top-Left Element and Sum Less Than k"
    },
    {
        "arg": "minimum-operations-to-write-the-letter-y-on-a-grid",
        "titleUS": "3071 Minimum Operations to Write the Letter Y on a Grid",
        "titleCN": "3071 在矩阵上写出字母 Y 所需的最少操作次数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Operations to Write the Letter Y on a Grid"
    },
    {
        "arg": "distribute-elements-into-two-arrays-ii",
        "titleUS": "3072 Distribute Elements Into Two Arrays II",
        "titleCN": "3072 将元素分配到两个数组中 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Distribute Elements Into Two Arrays II"
    },
    {
        "arg": "maximum-increasing-triplet-value",
        "titleUS": "3073 Maximum Increasing Triplet Value",
        "titleCN": "3073 最大递增三元组",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Maximum Increasing Triplet Value"
    },
    {
        "arg": "apple-redistribution-into-boxes",
        "titleUS": "3074 Apple Redistribution into Boxes",
        "titleCN": "3074 重新分装苹果",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Apple Redistribution into Boxes"
    },
    {
        "arg": "maximize-happiness-of-selected-children",
        "titleUS": "3075 Maximize Happiness of Selected Children",
        "titleCN": "3075 幸福值最大化的选择方案",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Maximize Happiness of Selected Children"
    },
    {
        "arg": "shortest-uncommon-substring-in-an-array",
        "titleUS": "3076 Shortest Uncommon Substring in an Array",
        "titleCN": "3076 数组中的最短非公共子字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Shortest Uncommon Substring in an Array"
    },
    {
        "arg": "maximum-strength-of-k-disjoint-subarrays",
        "titleUS": "3077 Maximum Strength of K Disjoint Subarrays",
        "titleCN": "3077 K 个不相交子数组的最大能量值",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Maximum Strength of K Disjoint Subarrays"
    },
    {
        "arg": "match-alphanumerical-pattern-in-matrix-i",
        "titleUS": "3078 Match Alphanumerical Pattern in Matrix I",
        "titleCN": "3078 矩阵中的字母数字模式匹配 I",
        "subtitleUS": "💰 Medium",
        "subtitleCN": "💰 中等 Match Alphanumerical Pattern in Matrix I"
    },
    {
        "arg": "find-the-sum-of-encrypted-integers",
        "titleUS": "3079 Find the Sum of Encrypted Integers",
        "titleCN": "3079 求出加密整数的和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Find the Sum of Encrypted Integers"
    },
    {
        "arg": "mark-elements-on-array-by-performing-queries",
        "titleUS": "3080 Mark Elements on Array by Performing Queries",
        "titleCN": "3080 执行操作标记数组中的元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Mark Elements on Array by Performing Queries"
    },
    {
        "arg": "replace-question-marks-in-string-to-minimize-its-value",
        "titleUS": "3081 Replace Question Marks in String to Minimize Its Value",
        "titleCN": "3081 替换字符串中的问号使分数最小",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Replace Question Marks in String to Minimize Its Value"
    },
    {
        "arg": "find-the-sum-of-the-power-of-all-subsequences",
        "titleUS": "3082 Find the Sum of the Power of All Subsequences",
        "titleCN": "3082 求出所有子序列的能量和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Find the Sum of the Power of All Subsequences"
    },
    {
        "arg": "existence-of-a-substring-in-a-string-and-its-reverse",
        "titleUS": "3083 Existence of a Substring in a String and Its Reverse",
        "titleCN": "3083 字符串及其反转中是否存在同一子字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Existence of a Substring in a String and Its Reverse"
    },
    {
        "arg": "count-substrings-starting-and-ending-with-given-character",
        "titleUS": "3084 Count Substrings Starting and Ending with Given Character",
        "titleCN": "3084 统计以给定字符开头和结尾的子字符串总数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Count Substrings Starting and Ending with Given Character"
    },
    {
        "arg": "minimum-deletions-to-make-string-k-special",
        "titleUS": "3085 Minimum Deletions to Make String K-Special",
        "titleCN": "3085 成为 K 特殊字符串需要删除的最少字符数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Minimum Deletions to Make String K-Special"
    },
    {
        "arg": "minimum-moves-to-pick-k-ones",
        "titleUS": "3086 Minimum Moves to Pick K Ones",
        "titleCN": "3086 拾起 K 个 1 需要的最少行动次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Minimum Moves to Pick K Ones"
    },
    {
        "arg": "make-string-anti-palindrome",
        "titleUS": "3088 Make String Anti-palindrome",
        "titleCN": "3088 使字符串反回文",
        "subtitleUS": "💰 Hard",
        "subtitleCN": "💰 较难 Make String Anti-palindrome"
    },
    {
        "arg": "maximum-length-substring-with-two-occurrences",
        "titleUS": "3090 Maximum Length Substring With Two Occurrences",
        "titleCN": "3090 每个字符最多出现两次的最长子字符串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Maximum Length Substring With Two Occurrences"
    },
    {
        "arg": "apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k",
        "titleUS": "3091 Apply Operations to Make Sum of Array Greater Than or Equal to k",
        "titleCN": "3091 执行操作使数据元素之和大于等于 K",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Apply Operations to Make Sum of Array Greater Than or Equal to k"
    },
    {
        "arg": "most-frequent-ids",
        "titleUS": "3092 Most Frequent IDs",
        "titleCN": "3092 最高频率的 ID",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Most Frequent IDs"
    },
    {
        "arg": "longest-common-suffix-queries",
        "titleUS": "3093 Longest Common Suffix Queries",
        "titleCN": "3093 最长公共后缀查询",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Longest Common Suffix Queries"
    },
    {
        "arg": "guess-numbers",
        "titleUS": "LCP 01 Guess Numbers",
        "titleCN": "LCP 01 猜数字",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Guess Numbers"
    },
    {
        "arg": "deep-dark-fraction",
        "titleUS": "LCP 02 Deep Dark Fraction",
        "titleCN": "LCP 02 分式化简",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 Deep Dark Fraction"
    },
    {
        "arg": "programmable-robot",
        "titleUS": "LCP 03 Programmable Robot",
        "titleCN": "LCP 03 机器人大冒险",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Programmable Robot"
    },
    {
        "arg": "broken-board-dominoes",
        "titleUS": "LCP 04 Broken Board Dominoes",
        "titleCN": "LCP 04 覆盖",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Broken Board Dominoes"
    },
    {
        "arg": "coin-bonus",
        "titleUS": "LCP 05 Coin Bonus",
        "titleCN": "LCP 05 发 LeetCoin",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Coin Bonus"
    },
    {
        "arg": "na-ying-bi",
        "titleUS": "LCP 06 拿硬币",
        "titleCN": "LCP 06 拿硬币",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 拿硬币"
    },
    {
        "arg": "chuan-di-xin-xi",
        "titleUS": "LCP 07 传递信息",
        "titleCN": "LCP 07 传递信息",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 传递信息"
    },
    {
        "arg": "ju-qing-hong-fa-shi-jian",
        "titleUS": "LCP 08 剧情触发时间",
        "titleCN": "LCP 08 剧情触发时间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 剧情触发时间"
    },
    {
        "arg": "zui-xiao-tiao-yue-ci-shu",
        "titleUS": "LCP 09 最小跳跃次数",
        "titleCN": "LCP 09 最小跳跃次数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 最小跳跃次数"
    },
    {
        "arg": "er-cha-shu-ren-wu-diao-du",
        "titleUS": "LCP 10 二叉树任务调度",
        "titleCN": "LCP 10 二叉树任务调度",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 二叉树任务调度"
    },
    {
        "arg": "qi-wang-ge-shu-tong-ji",
        "titleUS": "LCP 11 期望个数统计",
        "titleCN": "LCP 11 期望个数统计",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 期望个数统计"
    },
    {
        "arg": "xiao-zhang-shua-ti-ji-hua",
        "titleUS": "LCP 12 小张刷题计划",
        "titleCN": "LCP 12 小张刷题计划",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 小张刷题计划"
    },
    {
        "arg": "xun-bao",
        "titleUS": "LCP 13 寻宝",
        "titleCN": "LCP 13 寻宝",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 寻宝"
    },
    {
        "arg": "qie-fen-shu-zu",
        "titleUS": "LCP 14 切分数组",
        "titleCN": "LCP 14 切分数组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 切分数组"
    },
    {
        "arg": "you-le-yuan-de-mi-gong",
        "titleUS": "LCP 15 游乐园的迷宫",
        "titleCN": "LCP 15 游乐园的迷宫",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 游乐园的迷宫"
    },
    {
        "arg": "you-le-yuan-de-you-lan-ji-hua",
        "titleUS": "LCP 16 游乐园的游览计划",
        "titleCN": "LCP 16 游乐园的游览计划",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 游乐园的游览计划"
    },
    {
        "arg": "nGK0Fy",
        "titleUS": "LCP 17 速算机器人",
        "titleCN": "LCP 17 速算机器人",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 速算机器人"
    },
    {
        "arg": "2vYnGI",
        "titleUS": "LCP 18 早餐组合",
        "titleCN": "LCP 18 早餐组合",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 早餐组合"
    },
    {
        "arg": "UlBDOe",
        "titleUS": "LCP 19 秋叶收藏集",
        "titleCN": "LCP 19 秋叶收藏集",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 秋叶收藏集"
    },
    {
        "arg": "meChtZ",
        "titleUS": "LCP 20 快速公交",
        "titleCN": "LCP 20 快速公交",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 快速公交"
    },
    {
        "arg": "Za25hA",
        "titleUS": "LCP 21 追逐游戏",
        "titleCN": "LCP 21 追逐游戏",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 追逐游戏"
    },
    {
        "arg": "ccw6C7",
        "titleUS": "LCP 22 黑白方格画",
        "titleCN": "LCP 22 黑白方格画",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 黑白方格画"
    },
    {
        "arg": "er94lq",
        "titleUS": "LCP 23 魔术排列",
        "titleCN": "LCP 23 魔术排列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 魔术排列"
    },
    {
        "arg": "5TxKeK",
        "titleUS": "LCP 24 数字游戏",
        "titleCN": "LCP 24 数字游戏",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 数字游戏"
    },
    {
        "arg": "Uh984O",
        "titleUS": "LCP 25 古董键盘",
        "titleCN": "LCP 25 古董键盘",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 古董键盘"
    },
    {
        "arg": "hSRGyL",
        "titleUS": "LCP 26 导航装置",
        "titleCN": "LCP 26 导航装置",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 导航装置"
    },
    {
        "arg": "IQvJ9i",
        "titleUS": "LCP 27 黑盒光线反射",
        "titleCN": "LCP 27 黑盒光线反射",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 黑盒光线反射"
    },
    {
        "arg": "4xy4Wx",
        "titleUS": "LCP 28 采购方案",
        "titleCN": "LCP 28 采购方案",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 采购方案"
    },
    {
        "arg": "SNJvJP",
        "titleUS": "LCP 29 乐团站位",
        "titleCN": "LCP 29 乐团站位",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 乐团站位"
    },
    {
        "arg": "p0NxJO",
        "titleUS": "LCP 30 魔塔游戏",
        "titleCN": "LCP 30 魔塔游戏",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 魔塔游戏"
    },
    {
        "arg": "Db3wC1",
        "titleUS": "LCP 31 变换的迷宫",
        "titleCN": "LCP 31 变换的迷宫",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 变换的迷宫"
    },
    {
        "arg": "t3fKg1",
        "titleUS": "LCP 32 批量处理任务",
        "titleCN": "LCP 32 批量处理任务",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 批量处理任务"
    },
    {
        "arg": "o8SXZn",
        "titleUS": "LCP 33 蓄水",
        "titleCN": "LCP 33 蓄水",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 蓄水"
    },
    {
        "arg": "er-cha-shu-ran-se-UGC",
        "titleUS": "LCP 34 二叉树染色",
        "titleCN": "LCP 34 二叉树染色",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 二叉树染色"
    },
    {
        "arg": "DFPeFJ",
        "titleUS": "LCP 35 电动车游城市",
        "titleCN": "LCP 35 电动车游城市",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 电动车游城市"
    },
    {
        "arg": "Up5XYM",
        "titleUS": "LCP 36 最多牌组数",
        "titleCN": "LCP 36 最多牌组数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 最多牌组数"
    },
    {
        "arg": "zui-xiao-ju-xing-mian-ji",
        "titleUS": "LCP 37 最小矩形面积",
        "titleCN": "LCP 37 最小矩形面积",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 最小矩形面积"
    },
    {
        "arg": "7rLGCR",
        "titleUS": "LCP 38 守卫城堡",
        "titleCN": "LCP 38 守卫城堡",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 守卫城堡"
    },
    {
        "arg": "0jQkd0",
        "titleUS": "LCP 39 无人机方阵",
        "titleCN": "LCP 39 无人机方阵",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 无人机方阵"
    },
    {
        "arg": "uOAnQW",
        "titleUS": "LCP 40 心算挑战",
        "titleCN": "LCP 40 心算挑战",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 心算挑战"
    },
    {
        "arg": "fHi6rV",
        "titleUS": "LCP 41 黑白翻转棋",
        "titleCN": "LCP 41 黑白翻转棋",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 黑白翻转棋"
    },
    {
        "arg": "vFjcfV",
        "titleUS": "LCP 42 玩具套圈",
        "titleCN": "LCP 42 玩具套圈",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 玩具套圈"
    },
    {
        "arg": "Y1VbOX",
        "titleUS": "LCP 43 十字路口的交通",
        "titleCN": "LCP 43 十字路口的交通",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 十字路口的交通"
    },
    {
        "arg": "sZ59z6",
        "titleUS": "LCP 44 开幕式焰火",
        "titleCN": "LCP 44 开幕式焰火",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 开幕式焰火"
    },
    {
        "arg": "kplEvH",
        "titleUS": "LCP 45 自行车炫技赛场",
        "titleCN": "LCP 45 自行车炫技赛场",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 自行车炫技赛场"
    },
    {
        "arg": "05ZEDJ",
        "titleUS": "LCP 46 志愿者调配",
        "titleCN": "LCP 46 志愿者调配",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 志愿者调配"
    },
    {
        "arg": "oPs9Bm",
        "titleUS": "LCP 47 入场安检",
        "titleCN": "LCP 47 入场安检",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 入场安检"
    },
    {
        "arg": "fsa7oZ",
        "titleUS": "LCP 48 无限棋局",
        "titleCN": "LCP 48 无限棋局",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 无限棋局"
    },
    {
        "arg": "K8GULz",
        "titleUS": "LCP 49 环形闯关游戏",
        "titleCN": "LCP 49 环形闯关游戏",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 环形闯关游戏"
    },
    {
        "arg": "WHnhjV",
        "titleUS": "LCP 50 宝石补给",
        "titleCN": "LCP 50 宝石补给",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 宝石补给"
    },
    {
        "arg": "UEcfPD",
        "titleUS": "LCP 51 烹饪料理",
        "titleCN": "LCP 51 烹饪料理",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 烹饪料理"
    },
    {
        "arg": "QO5KpG",
        "titleUS": "LCP 52 二叉搜索树染色",
        "titleCN": "LCP 52 二叉搜索树染色",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 二叉搜索树染色"
    },
    {
        "arg": "EJvmW4",
        "titleUS": "LCP 53 守护太空城",
        "titleCN": "LCP 53 守护太空城",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 守护太空城"
    },
    {
        "arg": "s5kipK",
        "titleUS": "LCP 54 夺回据点",
        "titleCN": "LCP 54 夺回据点",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 夺回据点"
    },
    {
        "arg": "PTXy4P",
        "titleUS": "LCP 55 采集果实",
        "titleCN": "LCP 55 采集果实",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 采集果实"
    },
    {
        "arg": "6UEx57",
        "titleUS": "LCP 56 信物传送",
        "titleCN": "LCP 56 信物传送",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 信物传送"
    },
    {
        "arg": "ZbAuEH",
        "titleUS": "LCP 57 打地鼠",
        "titleCN": "LCP 57 打地鼠",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 打地鼠"
    },
    {
        "arg": "De4qBB",
        "titleUS": "LCP 58 积木拼接",
        "titleCN": "LCP 58 积木拼接",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 积木拼接"
    },
    {
        "arg": "NfY1m5",
        "titleUS": "LCP 59 搭桥过河",
        "titleCN": "LCP 59 搭桥过河",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 搭桥过河"
    },
    {
        "arg": "WInSav",
        "titleUS": "LCP 60 力扣泡泡龙",
        "titleCN": "LCP 60 力扣泡泡龙",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 力扣泡泡龙"
    },
    {
        "arg": "6CE719",
        "titleUS": "LCP 61 气温变化趋势",
        "titleCN": "LCP 61 气温变化趋势",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 气温变化趋势"
    },
    {
        "arg": "D9PW8w",
        "titleUS": "LCP 62 交通枢纽",
        "titleCN": "LCP 62 交通枢纽",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 交通枢纽"
    },
    {
        "arg": "EXvqDp",
        "titleUS": "LCP 63 弹珠游戏",
        "titleCN": "LCP 63 弹珠游戏",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 弹珠游戏"
    },
    {
        "arg": "U7WvvU",
        "titleUS": "LCP 64 二叉树灯饰",
        "titleCN": "LCP 64 二叉树灯饰",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 二叉树灯饰"
    },
    {
        "arg": "3aqs1c",
        "titleUS": "LCP 65 舒适的湿度",
        "titleCN": "LCP 65 舒适的湿度",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 舒适的湿度"
    },
    {
        "arg": "600YaG",
        "titleUS": "LCP 66 最小展台数量",
        "titleCN": "LCP 66 最小展台数量",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 最小展台数量"
    },
    {
        "arg": "KnLfVT",
        "titleUS": "LCP 67 装饰树",
        "titleCN": "LCP 67 装饰树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 装饰树"
    },
    {
        "arg": "1GxJYY",
        "titleUS": "LCP 68 美观的花束",
        "titleCN": "LCP 68 美观的花束",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 美观的花束"
    },
    {
        "arg": "rMeRt2",
        "titleUS": "LCP 69 Hello LeetCode!",
        "titleCN": "LCP 69 Hello LeetCode!",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 Hello LeetCode!"
    },
    {
        "arg": "XxZZjK",
        "titleUS": "LCP 70 沙地治理",
        "titleCN": "LCP 70 沙地治理",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 沙地治理"
    },
    {
        "arg": "kskhHQ",
        "titleUS": "LCP 71 集水器",
        "titleCN": "LCP 71 集水器",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 集水器"
    },
    {
        "arg": "hqCnmP",
        "titleUS": "LCP 72 补给马车",
        "titleCN": "LCP 72 补给马车",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 补给马车"
    },
    {
        "arg": "0Zeoeg",
        "titleUS": "LCP 73 探险营地",
        "titleCN": "LCP 73 探险营地",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 探险营地"
    },
    {
        "arg": "xepqZ5",
        "titleUS": "LCP 74 最强祝福力场",
        "titleCN": "LCP 74 最强祝福力场",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 最强祝福力场"
    },
    {
        "arg": "rdmXM7",
        "titleUS": "LCP 75 传送卷轴",
        "titleCN": "LCP 75 传送卷轴",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 传送卷轴"
    },
    {
        "arg": "1ybDKD",
        "titleUS": "LCP 76 魔法棋盘",
        "titleCN": "LCP 76 魔法棋盘",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 魔法棋盘"
    },
    {
        "arg": "W2ZX4X",
        "titleUS": "LCP 77 符文储备",
        "titleCN": "LCP 77 符文储备",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 符文储备"
    },
    {
        "arg": "Nsibyl",
        "titleUS": "LCP 78 城墙防线",
        "titleCN": "LCP 78 城墙防线",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 城墙防线"
    },
    {
        "arg": "kjpLFZ",
        "titleUS": "LCP 79 提取咒文",
        "titleCN": "LCP 79 提取咒文",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 提取咒文"
    },
    {
        "arg": "qoQAMX",
        "titleUS": "LCP 80 生物进化录",
        "titleCN": "LCP 80 生物进化录",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 生物进化录"
    },
    {
        "arg": "ryfUiz",
        "titleUS": "LCP 81 与非的谜题",
        "titleCN": "LCP 81 与非的谜题",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 与非的谜题"
    },
    {
        "arg": "cnHoX6",
        "titleUS": "LCP 82 万灵之树",
        "titleCN": "LCP 82 万灵之树",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 万灵之树"
    },
    {
        "arg": "xoh6Oh",
        "titleUS": "LCR 001 两数相除",
        "titleCN": "LCR 001 两数相除",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 两数相除"
    },
    {
        "arg": "JFETK5",
        "titleUS": "LCR 002 二进制求和",
        "titleCN": "LCR 002 二进制求和",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 二进制求和"
    },
    {
        "arg": "w3tCBm",
        "titleUS": "LCR 003 比特位计数",
        "titleCN": "LCR 003 比特位计数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 比特位计数"
    },
    {
        "arg": "WGki4K",
        "titleUS": "LCR 004 只出现一次的数字 II",
        "titleCN": "LCR 004 只出现一次的数字 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 只出现一次的数字 II"
    },
    {
        "arg": "aseY1I",
        "titleUS": "LCR 005 最大单词长度乘积",
        "titleCN": "LCR 005 最大单词长度乘积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 最大单词长度乘积"
    },
    {
        "arg": "kLl5u1",
        "titleUS": "LCR 006 两数之和 II - 输入有序数组",
        "titleCN": "LCR 006 两数之和 II - 输入有序数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 两数之和 II - 输入有序数组"
    },
    {
        "arg": "1fGaJU",
        "titleUS": "LCR 007 三数之和",
        "titleCN": "LCR 007 三数之和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 三数之和"
    },
    {
        "arg": "2VG8Kg",
        "titleUS": "LCR 008 长度最小的子数组",
        "titleCN": "LCR 008 长度最小的子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 长度最小的子数组"
    },
    {
        "arg": "ZVAVXX",
        "titleUS": "LCR 009 乘积小于 K 的子数组",
        "titleCN": "LCR 009 乘积小于 K 的子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 乘积小于 K 的子数组"
    },
    {
        "arg": "QTMn0o",
        "titleUS": "LCR 010 和为 K 的子数组",
        "titleCN": "LCR 010 和为 K 的子数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 和为 K 的子数组"
    },
    {
        "arg": "A1NYOS",
        "titleUS": "LCR 011 连续数组",
        "titleCN": "LCR 011 连续数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 连续数组"
    },
    {
        "arg": "tvdfij",
        "titleUS": "LCR 012 寻找数组的中心下标",
        "titleCN": "LCR 012 寻找数组的中心下标",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 寻找数组的中心下标"
    },
    {
        "arg": "O4NDxx",
        "titleUS": "LCR 013 二维区域和检索 - 矩阵不可变",
        "titleCN": "LCR 013 二维区域和检索 - 矩阵不可变",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 二维区域和检索 - 矩阵不可变"
    },
    {
        "arg": "MPnaiL",
        "titleUS": "LCR 014 字符串的排列",
        "titleCN": "LCR 014 字符串的排列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 字符串的排列"
    },
    {
        "arg": "VabMRr",
        "titleUS": "LCR 015 找到字符串中所有字母异位词",
        "titleCN": "LCR 015 找到字符串中所有字母异位词",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 找到字符串中所有字母异位词"
    },
    {
        "arg": "wtcaE1",
        "titleUS": "LCR 016 无重复字符的最长子串",
        "titleCN": "LCR 016 无重复字符的最长子串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 无重复字符的最长子串"
    },
    {
        "arg": "M1oyTv",
        "titleUS": "LCR 017 最小覆盖子串",
        "titleCN": "LCR 017 最小覆盖子串",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 最小覆盖子串"
    },
    {
        "arg": "XltzEq",
        "titleUS": "LCR 018 验证回文串",
        "titleCN": "LCR 018 验证回文串",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 验证回文串"
    },
    {
        "arg": "RQku0D",
        "titleUS": "LCR 019 验证回文串 II",
        "titleCN": "LCR 019 验证回文串 II",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 验证回文串 II"
    },
    {
        "arg": "a7VOhD",
        "titleUS": "LCR 020 回文子串",
        "titleCN": "LCR 020 回文子串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 回文子串"
    },
    {
        "arg": "SLwz0R",
        "titleUS": "LCR 021 删除链表的倒数第 N 个结点",
        "titleCN": "LCR 021 删除链表的倒数第 N 个结点",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 删除链表的倒数第 N 个结点"
    },
    {
        "arg": "c32eOV",
        "titleUS": "LCR 022 环形链表 II",
        "titleCN": "LCR 022 环形链表 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 环形链表 II"
    },
    {
        "arg": "3u1WK4",
        "titleUS": "LCR 023 相交链表",
        "titleCN": "LCR 023 相交链表",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 相交链表"
    },
    {
        "arg": "UHnkqh",
        "titleUS": "LCR 024 反转链表",
        "titleCN": "LCR 024 反转链表",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 反转链表"
    },
    {
        "arg": "lMSNwu",
        "titleUS": "LCR 025 两数相加 II",
        "titleCN": "LCR 025 两数相加 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 两数相加 II"
    },
    {
        "arg": "LGjMqU",
        "titleUS": "LCR 026 重排链表",
        "titleCN": "LCR 026 重排链表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 重排链表"
    },
    {
        "arg": "aMhZSa",
        "titleUS": "LCR 027 回文链表",
        "titleCN": "LCR 027 回文链表",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 回文链表"
    },
    {
        "arg": "Qv1Da2",
        "titleUS": "LCR 028 扁平化多级双向链表",
        "titleCN": "LCR 028 扁平化多级双向链表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 扁平化多级双向链表"
    },
    {
        "arg": "4ueAj6",
        "titleUS": "LCR 029 循环有序列表的插入",
        "titleCN": "LCR 029 循环有序列表的插入",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 循环有序列表的插入"
    },
    {
        "arg": "FortPu",
        "titleUS": "LCR 030 O(1) 时间插入、删除和获取随机元素",
        "titleCN": "LCR 030 O(1) 时间插入、删除和获取随机元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 O(1) 时间插入、删除和获取随机元素"
    },
    {
        "arg": "OrIXps",
        "titleUS": "LCR 031 LRU 缓存",
        "titleCN": "LCR 031 LRU 缓存",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 LRU 缓存"
    },
    {
        "arg": "dKk3P7",
        "titleUS": "LCR 032 有效的字母异位词",
        "titleCN": "LCR 032 有效的字母异位词",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 有效的字母异位词"
    },
    {
        "arg": "sfvd7V",
        "titleUS": "LCR 033 字母异位词分组",
        "titleCN": "LCR 033 字母异位词分组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 字母异位词分组"
    },
    {
        "arg": "lwyVBB",
        "titleUS": "LCR 034 验证外星语词典",
        "titleCN": "LCR 034 验证外星语词典",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 验证外星语词典"
    },
    {
        "arg": "569nqc",
        "titleUS": "LCR 035 最小时间差",
        "titleCN": "LCR 035 最小时间差",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 最小时间差"
    },
    {
        "arg": "8Zf90G",
        "titleUS": "LCR 036 逆波兰表达式求值",
        "titleCN": "LCR 036 逆波兰表达式求值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 逆波兰表达式求值"
    },
    {
        "arg": "XagZNi",
        "titleUS": "LCR 037 行星碰撞",
        "titleCN": "LCR 037 行星碰撞",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 行星碰撞"
    },
    {
        "arg": "iIQa4I",
        "titleUS": "LCR 038 每日温度",
        "titleCN": "LCR 038 每日温度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 每日温度"
    },
    {
        "arg": "0ynMMM",
        "titleUS": "LCR 039 柱状图中最大的矩形",
        "titleCN": "LCR 039 柱状图中最大的矩形",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 柱状图中最大的矩形"
    },
    {
        "arg": "PLYXKQ",
        "titleUS": "LCR 040 最大矩形",
        "titleCN": "LCR 040 最大矩形",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 最大矩形"
    },
    {
        "arg": "qIsx9U",
        "titleUS": "LCR 041 数据流中的移动平均值",
        "titleCN": "LCR 041 数据流中的移动平均值",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 数据流中的移动平均值"
    },
    {
        "arg": "H8086Q",
        "titleUS": "LCR 042 最近的请求次数",
        "titleCN": "LCR 042 最近的请求次数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 最近的请求次数"
    },
    {
        "arg": "NaqhDT",
        "titleUS": "LCR 043 完全二叉树插入器",
        "titleCN": "LCR 043 完全二叉树插入器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 完全二叉树插入器"
    },
    {
        "arg": "hPov7L",
        "titleUS": "LCR 044 在每个树行中找最大值",
        "titleCN": "LCR 044 在每个树行中找最大值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 在每个树行中找最大值"
    },
    {
        "arg": "LwUNpT",
        "titleUS": "LCR 045 找树左下角的值",
        "titleCN": "LCR 045 找树左下角的值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 找树左下角的值"
    },
    {
        "arg": "WNC0Lk",
        "titleUS": "LCR 046 二叉树的右视图",
        "titleCN": "LCR 046 二叉树的右视图",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 二叉树的右视图"
    },
    {
        "arg": "pOCWxh",
        "titleUS": "LCR 047 二叉树剪枝",
        "titleCN": "LCR 047 二叉树剪枝",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 二叉树剪枝"
    },
    {
        "arg": "h54YBf",
        "titleUS": "LCR 048 二叉树的序列化与反序列化",
        "titleCN": "LCR 048 二叉树的序列化与反序列化",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 二叉树的序列化与反序列化"
    },
    {
        "arg": "3Etpl5",
        "titleUS": "LCR 049 求根节点到叶节点数字之和",
        "titleCN": "LCR 049 求根节点到叶节点数字之和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 求根节点到叶节点数字之和"
    },
    {
        "arg": "6eUYwP",
        "titleUS": "LCR 050 路径总和 III",
        "titleCN": "LCR 050 路径总和 III",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 路径总和 III"
    },
    {
        "arg": "jC7MId",
        "titleUS": "LCR 051 二叉树中的最大路径和",
        "titleCN": "LCR 051 二叉树中的最大路径和",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 二叉树中的最大路径和"
    },
    {
        "arg": "NYBBNL",
        "titleUS": "LCR 052 递增顺序搜索树",
        "titleCN": "LCR 052 递增顺序搜索树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 递增顺序搜索树"
    },
    {
        "arg": "P5rCT8",
        "titleUS": "LCR 053 二叉搜索树中的中序后继",
        "titleCN": "LCR 053 二叉搜索树中的中序后继",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 二叉搜索树中的中序后继"
    },
    {
        "arg": "w6cpku",
        "titleUS": "LCR 054 把二叉搜索树转换为累加树",
        "titleCN": "LCR 054 把二叉搜索树转换为累加树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 把二叉搜索树转换为累加树"
    },
    {
        "arg": "kTOapQ",
        "titleUS": "LCR 055 二叉搜索树迭代器",
        "titleCN": "LCR 055 二叉搜索树迭代器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 二叉搜索树迭代器"
    },
    {
        "arg": "opLdQZ",
        "titleUS": "LCR 056 两数之和 IV - 输入二叉搜索树",
        "titleCN": "LCR 056 两数之和 IV - 输入二叉搜索树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 两数之和 IV - 输入二叉搜索树"
    },
    {
        "arg": "7WqeDu",
        "titleUS": "LCR 057 存在重复元素 III",
        "titleCN": "LCR 057 存在重复元素 III",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 存在重复元素 III"
    },
    {
        "arg": "fi9suh",
        "titleUS": "LCR 058 我的日程安排表 I",
        "titleCN": "LCR 058 我的日程安排表 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 我的日程安排表 I"
    },
    {
        "arg": "jBjn9C",
        "titleUS": "LCR 059 数据流中的第 K 大元素",
        "titleCN": "LCR 059 数据流中的第 K 大元素",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 数据流中的第 K 大元素"
    },
    {
        "arg": "g5c51o",
        "titleUS": "LCR 060 前 K 个高频元素",
        "titleCN": "LCR 060 前 K 个高频元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 前 K 个高频元素"
    },
    {
        "arg": "qn8gGX",
        "titleUS": "LCR 061 查找和最小的 K 对数字",
        "titleCN": "LCR 061 查找和最小的 K 对数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 查找和最小的 K 对数字"
    },
    {
        "arg": "QC3q1f",
        "titleUS": "LCR 062 实现 Trie (前缀树)",
        "titleCN": "LCR 062 实现 Trie (前缀树)",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 实现 Trie (前缀树)"
    },
    {
        "arg": "UhWRSj",
        "titleUS": "LCR 063 单词替换",
        "titleCN": "LCR 063 单词替换",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 单词替换"
    },
    {
        "arg": "US1pGT",
        "titleUS": "LCR 064 实现一个魔法字典",
        "titleCN": "LCR 064 实现一个魔法字典",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 实现一个魔法字典"
    },
    {
        "arg": "iSwD2y",
        "titleUS": "LCR 065 单词的压缩编码",
        "titleCN": "LCR 065 单词的压缩编码",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 单词的压缩编码"
    },
    {
        "arg": "z1R5dt",
        "titleUS": "LCR 066  键值映射",
        "titleCN": "LCR 066  键值映射",
        "subtitleUS": "Medium",
        "subtitleCN": "中等  键值映射"
    },
    {
        "arg": "ms70jA",
        "titleUS": "LCR 067 数组中两个数的最大异或值",
        "titleCN": "LCR 067 数组中两个数的最大异或值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 数组中两个数的最大异或值"
    },
    {
        "arg": "N6YdxV",
        "titleUS": "LCR 068 搜索插入位置",
        "titleCN": "LCR 068 搜索插入位置",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 搜索插入位置"
    },
    {
        "arg": "B1IidL",
        "titleUS": "LCR 069 山脉数组的峰顶索引",
        "titleCN": "LCR 069 山脉数组的峰顶索引",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 山脉数组的峰顶索引"
    },
    {
        "arg": "skFtm2",
        "titleUS": "LCR 070 有序数组中的单一元素",
        "titleCN": "LCR 070 有序数组中的单一元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 有序数组中的单一元素"
    },
    {
        "arg": "cuyjEf",
        "titleUS": "LCR 071 按权重随机选择",
        "titleCN": "LCR 071 按权重随机选择",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 按权重随机选择"
    },
    {
        "arg": "jJ0w9p",
        "titleUS": "LCR 072 x 的平方根",
        "titleCN": "LCR 072 x 的平方根",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 x 的平方根"
    },
    {
        "arg": "nZZqjQ",
        "titleUS": "LCR 073 爱吃香蕉的狒狒",
        "titleCN": "LCR 073 爱吃香蕉的狒狒",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 爱吃香蕉的狒狒"
    },
    {
        "arg": "SsGoHC",
        "titleUS": "LCR 074 合并区间",
        "titleCN": "LCR 074 合并区间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 合并区间"
    },
    {
        "arg": "0H97ZC",
        "titleUS": "LCR 075 数组的相对排序",
        "titleCN": "LCR 075 数组的相对排序",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 数组的相对排序"
    },
    {
        "arg": "xx4gT2",
        "titleUS": "LCR 076 数组中的第 K 个最大元素",
        "titleCN": "LCR 076 数组中的第 K 个最大元素",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 数组中的第 K 个最大元素"
    },
    {
        "arg": "7WHec2",
        "titleUS": "LCR 077 排序链表",
        "titleCN": "LCR 077 排序链表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 排序链表"
    },
    {
        "arg": "vvXgSW",
        "titleUS": "LCR 078 合并 K 个升序链表",
        "titleCN": "LCR 078 合并 K 个升序链表",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 合并 K 个升序链表"
    },
    {
        "arg": "TVdhkn",
        "titleUS": "LCR 079 子集",
        "titleCN": "LCR 079 子集",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 子集"
    },
    {
        "arg": "uUsW3B",
        "titleUS": "LCR 080 组合",
        "titleCN": "LCR 080 组合",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 组合"
    },
    {
        "arg": "Ygoe9J",
        "titleUS": "LCR 081 组合总和",
        "titleCN": "LCR 081 组合总和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 组合总和"
    },
    {
        "arg": "4sjJUc",
        "titleUS": "LCR 082 组合总和 II",
        "titleCN": "LCR 082 组合总和 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 组合总和 II"
    },
    {
        "arg": "VvJkup",
        "titleUS": "LCR 083 全排列",
        "titleCN": "LCR 083 全排列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 全排列"
    },
    {
        "arg": "7p8L0Z",
        "titleUS": "LCR 084 全排列 II ",
        "titleCN": "LCR 084 全排列 II ",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 全排列 II "
    },
    {
        "arg": "IDBivT",
        "titleUS": "LCR 085 括号生成",
        "titleCN": "LCR 085 括号生成",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 括号生成"
    },
    {
        "arg": "M99OJA",
        "titleUS": "LCR 086 分割回文串",
        "titleCN": "LCR 086 分割回文串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 分割回文串"
    },
    {
        "arg": "0on3uN",
        "titleUS": "LCR 087 复原 IP 地址",
        "titleCN": "LCR 087 复原 IP 地址",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 复原 IP 地址"
    },
    {
        "arg": "GzCJIP",
        "titleUS": "LCR 088 使用最小花费爬楼梯",
        "titleCN": "LCR 088 使用最小花费爬楼梯",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 使用最小花费爬楼梯"
    },
    {
        "arg": "Gu0c2T",
        "titleUS": "LCR 089 打家劫舍",
        "titleCN": "LCR 089 打家劫舍",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 打家劫舍"
    },
    {
        "arg": "PzWKhm",
        "titleUS": "LCR 090 打家劫舍 II",
        "titleCN": "LCR 090 打家劫舍 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 打家劫舍 II"
    },
    {
        "arg": "JEj789",
        "titleUS": "LCR 091 粉刷房子",
        "titleCN": "LCR 091 粉刷房子",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 粉刷房子"
    },
    {
        "arg": "cyJERH",
        "titleUS": "LCR 092 将字符串翻转到单调递增",
        "titleCN": "LCR 092 将字符串翻转到单调递增",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 将字符串翻转到单调递增"
    },
    {
        "arg": "Q91FMA",
        "titleUS": "LCR 093 最长的斐波那契子序列的长度",
        "titleCN": "LCR 093 最长的斐波那契子序列的长度",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 最长的斐波那契子序列的长度"
    },
    {
        "arg": "omKAoA",
        "titleUS": "LCR 094 分割回文串 II",
        "titleCN": "LCR 094 分割回文串 II",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 分割回文串 II"
    },
    {
        "arg": "qJnOS7",
        "titleUS": "LCR 095 最长公共子序列",
        "titleCN": "LCR 095 最长公共子序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 最长公共子序列"
    },
    {
        "arg": "IY6buf",
        "titleUS": "LCR 096 交错字符串",
        "titleCN": "LCR 096 交错字符串",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 交错字符串"
    },
    {
        "arg": "21dk04",
        "titleUS": "LCR 097 不同的子序列",
        "titleCN": "LCR 097 不同的子序列",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 不同的子序列"
    },
    {
        "arg": "2AoeFn",
        "titleUS": "LCR 098 不同路径",
        "titleCN": "LCR 098 不同路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 不同路径"
    },
    {
        "arg": "0i0mDW",
        "titleUS": "LCR 099 最小路径和",
        "titleCN": "LCR 099 最小路径和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 最小路径和"
    },
    {
        "arg": "IlPe0q",
        "titleUS": "LCR 100 三角形最小路径和",
        "titleCN": "LCR 100 三角形最小路径和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 三角形最小路径和"
    },
    {
        "arg": "NUPfPr",
        "titleUS": "LCR 101 分割等和子集",
        "titleCN": "LCR 101 分割等和子集",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 分割等和子集"
    },
    {
        "arg": "YaVDxD",
        "titleUS": "LCR 102 目标和",
        "titleCN": "LCR 102 目标和",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 目标和"
    },
    {
        "arg": "gaM7Ch",
        "titleUS": "LCR 103 零钱兑换",
        "titleCN": "LCR 103 零钱兑换",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 零钱兑换"
    },
    {
        "arg": "D0F0SV",
        "titleUS": "LCR 104 组合总和 Ⅳ",
        "titleCN": "LCR 104 组合总和 Ⅳ",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 组合总和 Ⅳ"
    },
    {
        "arg": "ZL6zAn",
        "titleUS": "LCR 105 岛屿的最大面积",
        "titleCN": "LCR 105 岛屿的最大面积",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 岛屿的最大面积"
    },
    {
        "arg": "vEAB3K",
        "titleUS": "LCR 106 判断二分图",
        "titleCN": "LCR 106 判断二分图",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 判断二分图"
    },
    {
        "arg": "2bCMpM",
        "titleUS": "LCR 107 01 矩阵",
        "titleCN": "LCR 107 01 矩阵",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 01 矩阵"
    },
    {
        "arg": "om3reC",
        "titleUS": "LCR 108 单词接龙",
        "titleCN": "LCR 108 单词接龙",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 单词接龙"
    },
    {
        "arg": "zlDJc7",
        "titleUS": "LCR 109 打开转盘锁",
        "titleCN": "LCR 109 打开转盘锁",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 打开转盘锁"
    },
    {
        "arg": "bP4bmD",
        "titleUS": "LCR 110 所有可能的路径",
        "titleCN": "LCR 110 所有可能的路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 所有可能的路径"
    },
    {
        "arg": "vlzXQL",
        "titleUS": "LCR 111 除法求值",
        "titleCN": "LCR 111 除法求值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 除法求值"
    },
    {
        "arg": "fpTFWP",
        "titleUS": "LCR 112 矩阵中的最长递增路径",
        "titleCN": "LCR 112 矩阵中的最长递增路径",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 矩阵中的最长递增路径"
    },
    {
        "arg": "QA2IGt",
        "titleUS": "LCR 113 课程表 II",
        "titleCN": "LCR 113 课程表 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 课程表 II"
    },
    {
        "arg": "Jf1JuT",
        "titleUS": "LCR 114 火星词典",
        "titleCN": "LCR 114 火星词典",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 火星词典"
    },
    {
        "arg": "ur2n8P",
        "titleUS": "LCR 115 序列重建",
        "titleCN": "LCR 115 序列重建",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 序列重建"
    },
    {
        "arg": "bLyHh0",
        "titleUS": "LCR 116 省份数量",
        "titleCN": "LCR 116 省份数量",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 省份数量"
    },
    {
        "arg": "H6lPxb",
        "titleUS": "LCR 117 相似字符串组",
        "titleCN": "LCR 117 相似字符串组",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 相似字符串组"
    },
    {
        "arg": "7LpjUW",
        "titleUS": "LCR 118 冗余连接",
        "titleCN": "LCR 118 冗余连接",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 冗余连接"
    },
    {
        "arg": "WhsWhI",
        "titleUS": "LCR 119 最长连续序列",
        "titleCN": "LCR 119 最长连续序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 最长连续序列"
    },
    {
        "arg": "shu-zu-zhong-zhong-fu-de-shu-zi-lcof",
        "titleUS": "LCR 120 寻找文件副本",
        "titleCN": "LCR 120 寻找文件副本",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 寻找文件副本"
    },
    {
        "arg": "er-wei-shu-zu-zhong-de-cha-zhao-lcof",
        "titleUS": "LCR 121 寻找目标值 - 二维数组",
        "titleCN": "LCR 121 寻找目标值 - 二维数组",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 寻找目标值 - 二维数组"
    },
    {
        "arg": "ti-huan-kong-ge-lcof",
        "titleUS": "LCR 122 路径加密",
        "titleCN": "LCR 122 路径加密",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 路径加密"
    },
    {
        "arg": "cong-wei-dao-tou-da-yin-lian-biao-lcof",
        "titleUS": "LCR 123 图书整理 I",
        "titleCN": "LCR 123 图书整理 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 图书整理 I"
    },
    {
        "arg": "zhong-jian-er-cha-shu-lcof",
        "titleUS": "LCR 124 推理二叉树",
        "titleCN": "LCR 124 推理二叉树",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 推理二叉树"
    },
    {
        "arg": "yong-liang-ge-zhan-shi-xian-dui-lie-lcof",
        "titleUS": "LCR 125 图书整理 II",
        "titleCN": "LCR 125 图书整理 II",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 图书整理 II"
    },
    {
        "arg": "fei-bo-na-qi-shu-lie-lcof",
        "titleUS": "LCR 126 斐波那契数",
        "titleCN": "LCR 126 斐波那契数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 斐波那契数"
    },
    {
        "arg": "qing-wa-tiao-tai-jie-wen-ti-lcof",
        "titleUS": "LCR 127 跳跃训练",
        "titleCN": "LCR 127 跳跃训练",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 跳跃训练"
    },
    {
        "arg": "xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof",
        "titleUS": "LCR 128 库存管理 I",
        "titleCN": "LCR 128 库存管理 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 库存管理 I"
    },
    {
        "arg": "ju-zhen-zhong-de-lu-jing-lcof",
        "titleUS": "LCR 129 字母迷宫",
        "titleCN": "LCR 129 字母迷宫",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 字母迷宫"
    },
    {
        "arg": "ji-qi-ren-de-yun-dong-fan-wei-lcof",
        "titleUS": "LCR 130 衣橱整理",
        "titleCN": "LCR 130 衣橱整理",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 衣橱整理"
    },
    {
        "arg": "jian-sheng-zi-lcof",
        "titleUS": "LCR 131 砍竹子 I",
        "titleCN": "LCR 131 砍竹子 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 砍竹子 I"
    },
    {
        "arg": "jian-sheng-zi-ii-lcof",
        "titleUS": "LCR 132 砍竹子 II",
        "titleCN": "LCR 132 砍竹子 II",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 砍竹子 II"
    },
    {
        "arg": "er-jin-zhi-zhong-1de-ge-shu-lcof",
        "titleUS": "LCR 133 位 1 的个数",
        "titleCN": "LCR 133 位 1 的个数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 位 1 的个数"
    },
    {
        "arg": "shu-zhi-de-zheng-shu-ci-fang-lcof",
        "titleUS": "LCR 134 Pow(x, n)",
        "titleCN": "LCR 134 Pow(x, n)",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 Pow(x, n)"
    },
    {
        "arg": "da-yin-cong-1dao-zui-da-de-nwei-shu-lcof",
        "titleUS": "LCR 135 报数",
        "titleCN": "LCR 135 报数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 报数"
    },
    {
        "arg": "shan-chu-lian-biao-de-jie-dian-lcof",
        "titleUS": "LCR 136 删除链表的节点",
        "titleCN": "LCR 136 删除链表的节点",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 删除链表的节点"
    },
    {
        "arg": "zheng-ze-biao-da-shi-pi-pei-lcof",
        "titleUS": "LCR 137 模糊搜索验证",
        "titleCN": "LCR 137 模糊搜索验证",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 模糊搜索验证"
    },
    {
        "arg": "biao-shi-shu-zhi-de-zi-fu-chuan-lcof",
        "titleUS": "LCR 138 有效数字",
        "titleCN": "LCR 138 有效数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 有效数字"
    },
    {
        "arg": "diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof",
        "titleUS": "LCR 139 训练计划 I",
        "titleCN": "LCR 139 训练计划 I",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 训练计划 I"
    },
    {
        "arg": "lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof",
        "titleUS": "LCR 140 训练计划 II",
        "titleCN": "LCR 140 训练计划 II",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 训练计划 II"
    },
    {
        "arg": "fan-zhuan-lian-biao-lcof",
        "titleUS": "LCR 141 训练计划 III",
        "titleCN": "LCR 141 训练计划 III",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 训练计划 III"
    },
    {
        "arg": "he-bing-liang-ge-pai-xu-de-lian-biao-lcof",
        "titleUS": "LCR 142 训练计划 IV",
        "titleCN": "LCR 142 训练计划 IV",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 训练计划 IV"
    },
    {
        "arg": "shu-de-zi-jie-gou-lcof",
        "titleUS": "LCR 143 子结构判断",
        "titleCN": "LCR 143 子结构判断",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 子结构判断"
    },
    {
        "arg": "er-cha-shu-de-jing-xiang-lcof",
        "titleUS": "LCR 144 翻转二叉树",
        "titleCN": "LCR 144 翻转二叉树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 翻转二叉树"
    },
    {
        "arg": "dui-cheng-de-er-cha-shu-lcof",
        "titleUS": "LCR 145 判断对称二叉树",
        "titleCN": "LCR 145 判断对称二叉树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 判断对称二叉树"
    },
    {
        "arg": "shun-shi-zhen-da-yin-ju-zhen-lcof",
        "titleUS": "LCR 146 螺旋遍历二维数组",
        "titleCN": "LCR 146 螺旋遍历二维数组",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 螺旋遍历二维数组"
    },
    {
        "arg": "bao-han-minhan-shu-de-zhan-lcof",
        "titleUS": "LCR 147 最小栈",
        "titleCN": "LCR 147 最小栈",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 最小栈"
    },
    {
        "arg": "zhan-de-ya-ru-dan-chu-xu-lie-lcof",
        "titleUS": "LCR 148 验证图书取出顺序",
        "titleCN": "LCR 148 验证图书取出顺序",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 验证图书取出顺序"
    },
    {
        "arg": "cong-shang-dao-xia-da-yin-er-cha-shu-lcof",
        "titleUS": "LCR 149 彩灯装饰记录 I",
        "titleCN": "LCR 149 彩灯装饰记录 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 彩灯装饰记录 I"
    },
    {
        "arg": "cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof",
        "titleUS": "LCR 150 彩灯装饰记录 II",
        "titleCN": "LCR 150 彩灯装饰记录 II",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 彩灯装饰记录 II"
    },
    {
        "arg": "cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof",
        "titleUS": "LCR 151 彩灯装饰记录 III",
        "titleCN": "LCR 151 彩灯装饰记录 III",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 彩灯装饰记录 III"
    },
    {
        "arg": "er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof",
        "titleUS": "LCR 152 验证二叉搜索树的后序遍历序列",
        "titleCN": "LCR 152 验证二叉搜索树的后序遍历序列",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 验证二叉搜索树的后序遍历序列"
    },
    {
        "arg": "er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof",
        "titleUS": "LCR 153 二叉树中和为目标值的路径",
        "titleCN": "LCR 153 二叉树中和为目标值的路径",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 二叉树中和为目标值的路径"
    },
    {
        "arg": "fu-za-lian-biao-de-fu-zhi-lcof",
        "titleUS": "LCR 154 随机链表的复制",
        "titleCN": "LCR 154 复杂链表的复制",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 随机链表的复制"
    },
    {
        "arg": "er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof",
        "titleUS": "LCR 155 将二叉搜索树转化为排序的双向链表",
        "titleCN": "LCR 155 将二叉搜索树转化为排序的双向链表",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 将二叉搜索树转化为排序的双向链表"
    },
    {
        "arg": "xu-lie-hua-er-cha-shu-lcof",
        "titleUS": "LCR 156 序列化与反序列化二叉树",
        "titleCN": "LCR 156 序列化与反序列化二叉树",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 序列化与反序列化二叉树"
    },
    {
        "arg": "zi-fu-chuan-de-pai-lie-lcof",
        "titleUS": "LCR 157 套餐内商品的排列顺序",
        "titleCN": "LCR 157 套餐内商品的排列顺序",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 套餐内商品的排列顺序"
    },
    {
        "arg": "shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof",
        "titleUS": "LCR 158 库存管理 II",
        "titleCN": "LCR 158 库存管理 II",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 库存管理 II"
    },
    {
        "arg": "zui-xiao-de-kge-shu-lcof",
        "titleUS": "LCR 159 库存管理 III",
        "titleCN": "LCR 159 库存管理 III",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 库存管理 III"
    },
    {
        "arg": "shu-ju-liu-zhong-de-zhong-wei-shu-lcof",
        "titleUS": "LCR 160 数据流中的中位数",
        "titleCN": "LCR 160 数据流中的中位数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 数据流中的中位数"
    },
    {
        "arg": "lian-xu-zi-shu-zu-de-zui-da-he-lcof",
        "titleUS": "LCR 161 连续天数的最高销售额",
        "titleCN": "LCR 161 连续天数的最高销售额",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 连续天数的最高销售额"
    },
    {
        "arg": "1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof",
        "titleUS": "LCR 162 数字 1 的个数",
        "titleCN": "LCR 162 数字 1 的个数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 数字 1 的个数"
    },
    {
        "arg": "shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof",
        "titleUS": "LCR 163 找到第 k 位数字",
        "titleCN": "LCR 163 找到第 k 位数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 找到第 k 位数字"
    },
    {
        "arg": "ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof",
        "titleUS": "LCR 164 破解闯关密码",
        "titleCN": "LCR 164 破解闯关密码",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 破解闯关密码"
    },
    {
        "arg": "ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof",
        "titleUS": "LCR 165 解密数字",
        "titleCN": "LCR 165 解密数字",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 解密数字"
    },
    {
        "arg": "li-wu-de-zui-da-jie-zhi-lcof",
        "titleUS": "LCR 166 珠宝的最高价值",
        "titleCN": "LCR 166 珠宝的最高价值",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 珠宝的最高价值"
    },
    {
        "arg": "zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof",
        "titleUS": "LCR 167 招式拆解 I",
        "titleCN": "LCR 167 招式拆解 I",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 招式拆解 I"
    },
    {
        "arg": "chou-shu-lcof",
        "titleUS": "LCR 168 丑数",
        "titleCN": "LCR 168 丑数",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 丑数"
    },
    {
        "arg": "di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof",
        "titleUS": "LCR 169 招式拆解 II",
        "titleCN": "LCR 169 招式拆解 II",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 招式拆解 II"
    },
    {
        "arg": "shu-zu-zhong-de-ni-xu-dui-lcof",
        "titleUS": "LCR 170 交易逆序对的总数",
        "titleCN": "LCR 170 交易逆序对的总数",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 交易逆序对的总数"
    },
    {
        "arg": "liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof",
        "titleUS": "LCR 171 训练计划 V",
        "titleCN": "LCR 171 训练计划 V",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 训练计划 V"
    },
    {
        "arg": "zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof",
        "titleUS": "LCR 172 统计目标成绩的出现次数",
        "titleCN": "LCR 172 统计目标成绩的出现次数",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 统计目标成绩的出现次数"
    },
    {
        "arg": "que-shi-de-shu-zi-lcof",
        "titleUS": "LCR 173 点名",
        "titleCN": "LCR 173 点名",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 点名"
    },
    {
        "arg": "er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof",
        "titleUS": "LCR 174 寻找二叉搜索树中的目标节点",
        "titleCN": "LCR 174 寻找二叉搜索树中的目标节点",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 寻找二叉搜索树中的目标节点"
    },
    {
        "arg": "er-cha-shu-de-shen-du-lcof",
        "titleUS": "LCR 175 计算二叉树的深度",
        "titleCN": "LCR 175 计算二叉树的深度",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 计算二叉树的深度"
    },
    {
        "arg": "ping-heng-er-cha-shu-lcof",
        "titleUS": "LCR 176 判断是否为平衡二叉树",
        "titleCN": "LCR 176 判断是否为平衡二叉树",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 判断是否为平衡二叉树"
    },
    {
        "arg": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof",
        "titleUS": "LCR 177 撞色搭配",
        "titleCN": "LCR 177 撞色搭配",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 撞色搭配"
    },
    {
        "arg": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof",
        "titleUS": "LCR 178 训练计划 VI",
        "titleCN": "LCR 178 训练计划 VI",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 训练计划 VI"
    },
    {
        "arg": "he-wei-sde-liang-ge-shu-zi-lcof",
        "titleUS": "LCR 179 查找总价格为目标值的两个商品",
        "titleCN": "LCR 179 查找总价格为目标值的两个商品",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 查找总价格为目标值的两个商品"
    },
    {
        "arg": "he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof",
        "titleUS": "LCR 180 文件组合",
        "titleCN": "LCR 180 文件组合",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 文件组合"
    },
    {
        "arg": "fan-zhuan-dan-ci-shun-xu-lcof",
        "titleUS": "LCR 181 字符串中的单词反转",
        "titleCN": "LCR 181 字符串中的单词反转",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 字符串中的单词反转"
    },
    {
        "arg": "zuo-xuan-zhuan-zi-fu-chuan-lcof",
        "titleUS": "LCR 182 动态口令",
        "titleCN": "LCR 182 动态口令",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 动态口令"
    },
    {
        "arg": "hua-dong-chuang-kou-de-zui-da-zhi-lcof",
        "titleUS": "LCR 183 望远镜中最高的海拔",
        "titleCN": "LCR 183 望远镜中最高的海拔",
        "subtitleUS": "Hard",
        "subtitleCN": "较难 望远镜中最高的海拔"
    },
    {
        "arg": "dui-lie-de-zui-da-zhi-lcof",
        "titleUS": "LCR 184 设计自助结算系统",
        "titleCN": "LCR 184 设计自助结算系统",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 设计自助结算系统"
    },
    {
        "arg": "nge-tou-zi-de-dian-shu-lcof",
        "titleUS": "LCR 185 统计结果概率",
        "titleCN": "LCR 185 统计结果概率",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 统计结果概率"
    },
    {
        "arg": "bu-ke-pai-zhong-de-shun-zi-lcof",
        "titleUS": "LCR 186 文物朝代判断",
        "titleCN": "LCR 186 文物朝代判断",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 文物朝代判断"
    },
    {
        "arg": "yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof",
        "titleUS": "LCR 187 破冰游戏",
        "titleCN": "LCR 187 破冰游戏",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 破冰游戏"
    },
    {
        "arg": "gu-piao-de-zui-da-li-run-lcof",
        "titleUS": "LCR 188 买卖芯片的最佳时机",
        "titleCN": "LCR 188 买卖芯片的最佳时机",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 买卖芯片的最佳时机"
    },
    {
        "arg": "qiu-12n-lcof",
        "titleUS": "LCR 189 设计机械累加器",
        "titleCN": "LCR 189 设计机械累加器",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 设计机械累加器"
    },
    {
        "arg": "bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof",
        "titleUS": "LCR 190 加密运算",
        "titleCN": "LCR 190 加密运算",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 加密运算"
    },
    {
        "arg": "gou-jian-cheng-ji-shu-zu-lcof",
        "titleUS": "LCR 191 按规则计算统计结果",
        "titleCN": "LCR 191 按规则计算统计结果",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 按规则计算统计结果"
    },
    {
        "arg": "ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof",
        "titleUS": "LCR 192 把字符串转换成整数 (atoi)",
        "titleCN": "LCR 192 把字符串转换成整数 (atoi)",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 把字符串转换成整数 (atoi)"
    },
    {
        "arg": "er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof",
        "titleUS": "LCR 193 求二叉搜索树的最近公共祖先",
        "titleCN": "LCR 193 二叉搜索树的最近公共祖先",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 求二叉搜索树的最近公共祖先"
    },
    {
        "arg": "er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof",
        "titleUS": "LCR 194 寻找二叉树的最近公共祖先",
        "titleCN": "LCR 194 二叉树的最近公共祖先",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 寻找二叉树的最近公共祖先"
    },
    {
        "arg": "Ju9Xwi",
        "titleUS": "LCS 01 下载插件",
        "titleCN": "LCS 01 下载插件",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 下载插件"
    },
    {
        "arg": "WqXACV",
        "titleUS": "LCS 02 完成一半题目",
        "titleCN": "LCS 02 完成一半题目",
        "subtitleUS": "Easy",
        "subtitleCN": "简单 完成一半题目"
    },
    {
        "arg": "YesdPw",
        "titleUS": "LCS 03 主题空间",
        "titleCN": "LCS 03 主题空间",
        "subtitleUS": "Medium",
        "subtitleCN": "中等 主题空间"
    }
]