hot100.json

{
  "plan_slug": "top-100-liked",
  "plan_name": "Top 100 Liked",
  "source": "https://leetcode.com/studyplan/top-100-liked/",
  "cn_study_plan": "https://leetcode.cn/studyplan/top-100-liked/",
  "fetched_at": "2026-06-26T07:27:08+08:00",
  "questions": [
    {
      "id": "17",
      "slug": "letter-combinations-of-a-phone-number",
      "title": "Letter Combinations of a Phone Number",
      "english_title": "Letter Combinations of a Phone Number",
      "difficulty": "Medium",
      "topic": "Backtracking",
      "url": "https://leetcode.cn/problems/letter-combinations-of-a-phone-number/"
    },
    {
      "id": "22",
      "slug": "generate-parentheses",
      "title": "Generate Parentheses",
      "english_title": "Generate Parentheses",
      "difficulty": "Medium",
      "topic": "Backtracking",
      "url": "https://leetcode.cn/problems/generate-parentheses/"
    },
    {
      "id": "39",
      "slug": "combination-sum",
      "title": "Combination Sum",
      "english_title": "Combination Sum",
      "difficulty": "Medium",
      "topic": "Backtracking",
      "url": "https://leetcode.cn/problems/combination-sum/"
    },
    {
      "id": "46",
      "slug": "permutations",
      "title": "Permutations",
      "english_title": "Permutations",
      "difficulty": "Medium",
      "topic": "Backtracking",
      "url": "https://leetcode.cn/problems/permutations/"
    },
    {
      "id": "51",
      "slug": "n-queens",
      "title": "N-Queens",
      "english_title": "N-Queens",
      "difficulty": "Hard",
      "topic": "Backtracking",
      "url": "https://leetcode.cn/problems/n-queens/"
    },
    {
      "id": "78",
      "slug": "subsets",
      "title": "Subsets",
      "english_title": "Subsets",
      "difficulty": "Medium",
      "topic": "Backtracking",
      "url": "https://leetcode.cn/problems/subsets/"
    },
    {
      "id": "79",
      "slug": "word-search",
      "title": "Word Search",
      "english_title": "Word Search",
      "difficulty": "Medium",
      "topic": "Backtracking",
      "url": "https://leetcode.cn/problems/word-search/"
    },
    {
      "id": "131",
      "slug": "palindrome-partitioning",
      "title": "Palindrome Partitioning",
      "english_title": "Palindrome Partitioning",
      "difficulty": "Medium",
      "topic": "Backtracking",
      "url": "https://leetcode.cn/problems/palindrome-partitioning/"
    },
    {
      "id": "4",
      "slug": "median-of-two-sorted-arrays",
      "title": "Median of Two Sorted Arrays",
      "english_title": "Median of Two Sorted Arrays",
      "difficulty": "Hard",
      "topic": "Binary Search",
      "url": "https://leetcode.cn/problems/median-of-two-sorted-arrays/"
    },
    {
      "id": "33",
      "slug": "search-in-rotated-sorted-array",
      "title": "Search in Rotated Sorted Array",
      "english_title": "Search in Rotated Sorted Array",
      "difficulty": "Medium",
      "topic": "Binary Search",
      "url": "https://leetcode.cn/problems/search-in-rotated-sorted-array/"
    },
    {
      "id": "34",
      "slug": "find-first-and-last-position-of-element-in-sorted-array",
      "title": "Find First and Last Position of Element in Sorted Array",
      "english_title": "Find First and Last Position of Element in Sorted Array",
      "difficulty": "Medium",
      "topic": "Binary Search",
      "url": "https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/"
    },
    {
      "id": "35",
      "slug": "search-insert-position",
      "title": "Search Insert Position",
      "english_title": "Search Insert Position",
      "difficulty": "Easy",
      "topic": "Binary Search",
      "url": "https://leetcode.cn/problems/search-insert-position/"
    },
    {
      "id": "74",
      "slug": "search-a-2d-matrix",
      "title": "Search a 2D Matrix",
      "english_title": "Search a 2D Matrix",
      "difficulty": "Medium",
      "topic": "Binary Search",
      "url": "https://leetcode.cn/problems/search-a-2d-matrix/"
    },
    {
      "id": "124",
      "slug": "binary-tree-maximum-path-sum",
      "title": "Binary Tree Maximum Path Sum",
      "english_title": "Binary Tree Maximum Path Sum",
      "difficulty": "Hard",
      "topic": "Binary Search",
      "url": "https://leetcode.cn/problems/binary-tree-maximum-path-sum/"
    },
    {
      "id": "153",
      "slug": "find-minimum-in-rotated-sorted-array",
      "title": "Find Minimum in Rotated Sorted Array",
      "english_title": "Find Minimum in Rotated Sorted Array",
      "difficulty": "Medium",
      "topic": "Binary Search",
      "url": "https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/"
    },
    {
      "id": "94",
      "slug": "binary-tree-inorder-traversal",
      "title": "Binary Tree Inorder Traversal",
      "english_title": "Binary Tree Inorder Traversal",
      "difficulty": "Easy",
      "topic": "Binary Tree",
      "url": "https://leetcode.cn/problems/binary-tree-inorder-traversal/"
    },
    {
      "id": "98",
      "slug": "validate-binary-search-tree",
      "title": "Validate Binary Search Tree",
      "english_title": "Validate Binary Search Tree",
      "difficulty": "Medium",
      "topic": "Binary Tree",
      "url": "https://leetcode.cn/problems/validate-binary-search-tree/"
    },
    {
      "id": "101",
      "slug": "symmetric-tree",
      "title": "Symmetric Tree",
      "english_title": "Symmetric Tree",
      "difficulty": "Easy",
      "topic": "Binary Tree",
      "url": "https://leetcode.cn/problems/symmetric-tree/"
    },
    {
      "id": "102",
      "slug": "binary-tree-level-order-traversal",
      "title": "Binary Tree Level Order Traversal",
      "english_title": "Binary Tree Level Order Traversal",
      "difficulty": "Medium",
      "topic": "Binary Tree",
      "url": "https://leetcode.cn/problems/binary-tree-level-order-traversal/"
    },
    {
      "id": "104",
      "slug": "maximum-depth-of-binary-tree",
      "title": "Maximum Depth of Binary Tree",
      "english_title": "Maximum Depth of Binary Tree",
      "difficulty": "Easy",
      "topic": "Binary Tree",
      "url": "https://leetcode.cn/problems/maximum-depth-of-binary-tree/"
    },
    {
      "id": "105",
      "slug": "construct-binary-tree-from-preorder-and-inorder-traversal",
      "title": "Construct Binary Tree from Preorder and Inorder Traversal",
      "english_title": "Construct Binary Tree from Preorder and Inorder Traversal",
      "difficulty": "Medium",
      "topic": "Binary Tree",
      "url": "https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/"
    },
    {
      "id": "108",
      "slug": "convert-sorted-array-to-binary-search-tree",
      "title": "Convert Sorted Array to Binary Search Tree",
      "english_title": "Convert Sorted Array to Binary Search Tree",
      "difficulty": "Easy",
      "topic": "Binary Tree",
      "url": "https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/"
    },
    {
      "id": "114",
      "slug": "flatten-binary-tree-to-linked-list",
      "title": "Flatten Binary Tree to Linked List",
      "english_title": "Flatten Binary Tree to Linked List",
      "difficulty": "Medium",
      "topic": "Binary Tree",
      "url": "https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/"
    },
    {
      "id": "199",
      "slug": "binary-tree-right-side-view",
      "title": "Binary Tree Right Side View",
      "english_title": "Binary Tree Right Side View",
      "difficulty": "Medium",
      "topic": "Binary Tree",
      "url": "https://leetcode.cn/problems/binary-tree-right-side-view/"
    },
    {
      "id": "226",
      "slug": "invert-binary-tree",
      "title": "Invert Binary Tree",
      "english_title": "Invert Binary Tree",
      "difficulty": "Easy",
      "topic": "Binary Tree",
      "url": "https://leetcode.cn/problems/invert-binary-tree/"
    },
    {
      "id": "230",
      "slug": "kth-smallest-element-in-a-bst",
      "title": "Kth Smallest Element in a BST",
      "english_title": "Kth Smallest Element in a BST",
      "difficulty": "Medium",
      "topic": "Binary Tree",
      "url": "https://leetcode.cn/problems/kth-smallest-element-in-a-bst/"
    },
    {
      "id": "236",
      "slug": "lowest-common-ancestor-of-a-binary-tree",
      "title": "Lowest Common Ancestor of a Binary Tree",
      "english_title": "Lowest Common Ancestor of a Binary Tree",
      "difficulty": "Medium",
      "topic": "Binary Tree",
      "url": "https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/"
    },
    {
      "id": "437",
      "slug": "path-sum-iii",
      "title": "Path Sum III",
      "english_title": "Path Sum III",
      "difficulty": "Medium",
      "topic": "Binary Tree",
      "url": "https://leetcode.cn/problems/path-sum-iii/"
    },
    {
      "id": "543",
      "slug": "diameter-of-binary-tree",
      "title": "Diameter of Binary Tree",
      "english_title": "Diameter of Binary Tree",
      "difficulty": "Easy",
      "topic": "Binary Tree",
      "url": "https://leetcode.cn/problems/diameter-of-binary-tree/"
    },
    {
      "id": "5",
      "slug": "longest-palindromic-substring",
      "title": "Longest Palindromic Substring",
      "english_title": "Longest Palindromic Substring",
      "difficulty": "Medium",
      "topic": "Dynamic Programming",
      "url": "https://leetcode.cn/problems/longest-palindromic-substring/"
    },
    {
      "id": "32",
      "slug": "longest-valid-parentheses",
      "title": "Longest Valid Parentheses",
      "english_title": "Longest Valid Parentheses",
      "difficulty": "Hard",
      "topic": "Dynamic Programming",
      "url": "https://leetcode.cn/problems/longest-valid-parentheses/"
    },
    {
      "id": "62",
      "slug": "unique-paths",
      "title": "Unique Paths",
      "english_title": "Unique Paths",
      "difficulty": "Medium",
      "topic": "Dynamic Programming",
      "url": "https://leetcode.cn/problems/unique-paths/"
    },
    {
      "id": "64",
      "slug": "minimum-path-sum",
      "title": "Minimum Path Sum",
      "english_title": "Minimum Path Sum",
      "difficulty": "Medium",
      "topic": "Dynamic Programming",
      "url": "https://leetcode.cn/problems/minimum-path-sum/"
    },
    {
      "id": "70",
      "slug": "climbing-stairs",
      "title": "Climbing Stairs",
      "english_title": "Climbing Stairs",
      "difficulty": "Easy",
      "topic": "Dynamic Programming",
      "url": "https://leetcode.cn/problems/climbing-stairs/"
    },
    {
      "id": "72",
      "slug": "edit-distance",
      "title": "Edit Distance",
      "english_title": "Edit Distance",
      "difficulty": "Medium",
      "topic": "Dynamic Programming",
      "url": "https://leetcode.cn/problems/edit-distance/"
    },
    {
      "id": "118",
      "slug": "pascals-triangle",
      "title": "Pascal's Triangle",
      "english_title": "Pascal's Triangle",
      "difficulty": "Easy",
      "topic": "Dynamic Programming",
      "url": "https://leetcode.cn/problems/pascals-triangle/"
    },
    {
      "id": "139",
      "slug": "word-break",
      "title": "Word Break",
      "english_title": "Word Break",
      "difficulty": "Medium",
      "topic": "Dynamic Programming",
      "url": "https://leetcode.cn/problems/word-break/"
    },
    {
      "id": "152",
      "slug": "maximum-product-subarray",
      "title": "Maximum Product Subarray",
      "english_title": "Maximum Product Subarray",
      "difficulty": "Medium",
      "topic": "Dynamic Programming",
      "url": "https://leetcode.cn/problems/maximum-product-subarray/"
    },
    {
      "id": "198",
      "slug": "house-robber",
      "title": "House Robber",
      "english_title": "House Robber",
      "difficulty": "Medium",
      "topic": "Dynamic Programming",
      "url": "https://leetcode.cn/problems/house-robber/"
    },
    {
      "id": "279",
      "slug": "perfect-squares",
      "title": "Perfect Squares",
      "english_title": "Perfect Squares",
      "difficulty": "Medium",
      "topic": "Dynamic Programming",
      "url": "https://leetcode.cn/problems/perfect-squares/"
    },
    {
      "id": "300",
      "slug": "longest-increasing-subsequence",
      "title": "Longest Increasing Subsequence",
      "english_title": "Longest Increasing Subsequence",
      "difficulty": "Medium",
      "topic": "Dynamic Programming",
      "url": "https://leetcode.cn/problems/longest-increasing-subsequence/"
    },
    {
      "id": "322",
      "slug": "coin-change",
      "title": "Coin Change",
      "english_title": "Coin Change",
      "difficulty": "Medium",
      "topic": "Dynamic Programming",
      "url": "https://leetcode.cn/problems/coin-change/"
    },
    {
      "id": "416",
      "slug": "partition-equal-subset-sum",
      "title": "Partition Equal Subset Sum",
      "english_title": "Partition Equal Subset Sum",
      "difficulty": "Medium",
      "topic": "Dynamic Programming",
      "url": "https://leetcode.cn/problems/partition-equal-subset-sum/"
    },
    {
      "id": "1143",
      "slug": "longest-common-subsequence",
      "title": "Longest Common Subsequence",
      "english_title": "Longest Common Subsequence",
      "difficulty": "Medium",
      "topic": "Dynamic Programming",
      "url": "https://leetcode.cn/problems/longest-common-subsequence/"
    },
    {
      "id": "200",
      "slug": "number-of-islands",
      "title": "Number of Islands",
      "english_title": "Number of Islands",
      "difficulty": "Medium",
      "topic": "Graph",
      "url": "https://leetcode.cn/problems/number-of-islands/"
    },
    {
      "id": "207",
      "slug": "course-schedule",
      "title": "Course Schedule",
      "english_title": "Course Schedule",
      "difficulty": "Medium",
      "topic": "Graph",
      "url": "https://leetcode.cn/problems/course-schedule/"
    },
    {
      "id": "994",
      "slug": "rotting-oranges",
      "title": "Rotting Oranges",
      "english_title": "Rotting Oranges",
      "difficulty": "Medium",
      "topic": "Graph",
      "url": "https://leetcode.cn/problems/rotting-oranges/"
    },
    {
      "id": "45",
      "slug": "jump-game-ii",
      "title": "Jump Game II",
      "english_title": "Jump Game II",
      "difficulty": "Medium",
      "topic": "Greedy",
      "url": "https://leetcode.cn/problems/jump-game-ii/"
    },
    {
      "id": "55",
      "slug": "jump-game",
      "title": "Jump Game",
      "english_title": "Jump Game",
      "difficulty": "Medium",
      "topic": "Greedy",
      "url": "https://leetcode.cn/problems/jump-game/"
    },
    {
      "id": "121",
      "slug": "best-time-to-buy-and-sell-stock",
      "title": "Best Time to Buy and Sell Stock",
      "english_title": "Best Time to Buy and Sell Stock",
      "difficulty": "Easy",
      "topic": "Greedy",
      "url": "https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/"
    },
    {
      "id": "763",
      "slug": "partition-labels",
      "title": "Partition Labels",
      "english_title": "Partition Labels",
      "difficulty": "Medium",
      "topic": "Greedy",
      "url": "https://leetcode.cn/problems/partition-labels/"
    },
    {
      "id": "1",
      "slug": "two-sum",
      "title": "Two Sum",
      "english_title": "Two Sum",
      "difficulty": "Easy",
      "topic": "Hashing",
      "url": "https://leetcode.cn/problems/two-sum/"
    },
    {
      "id": "49",
      "slug": "group-anagrams",
      "title": "Group Anagrams",
      "english_title": "Group Anagrams",
      "difficulty": "Medium",
      "topic": "Hashing",
      "url": "https://leetcode.cn/problems/group-anagrams/"
    },
    {
      "id": "128",
      "slug": "longest-consecutive-sequence",
      "title": "Longest Consecutive Sequence",
      "english_title": "Longest Consecutive Sequence",
      "difficulty": "Medium",
      "topic": "Hashing",
      "url": "https://leetcode.cn/problems/longest-consecutive-sequence/"
    },
    {
      "id": "560",
      "slug": "subarray-sum-equals-k",
      "title": "Subarray Sum Equals K",
      "english_title": "Subarray Sum Equals K",
      "difficulty": "Medium",
      "topic": "Hashing",
      "url": "https://leetcode.cn/problems/subarray-sum-equals-k/"
    },
    {
      "id": "215",
      "slug": "kth-largest-element-in-an-array",
      "title": "Kth Largest Element in an Array",
      "english_title": "Kth Largest Element in an Array",
      "difficulty": "Medium",
      "topic": "Heap",
      "aliases": [
        "快速选择",
        "Quickselect",
        "第 k 大的数字",
        "第k大的数字"
      ],
      "url": "https://leetcode.cn/problems/kth-largest-element-in-an-array/"
    },
    {
      "id": "295",
      "slug": "find-median-from-data-stream",
      "title": "Find Median from Data Stream",
      "english_title": "Find Median from Data Stream",
      "difficulty": "Hard",
      "topic": "Heap",
      "url": "https://leetcode.cn/problems/find-median-from-data-stream/"
    },
    {
      "id": "347",
      "slug": "top-k-frequent-elements",
      "title": "Top K Frequent Elements",
      "english_title": "Top K Frequent Elements",
      "difficulty": "Medium",
      "topic": "Heap",
      "url": "https://leetcode.cn/problems/top-k-frequent-elements/"
    },
    {
      "id": "2",
      "slug": "add-two-numbers",
      "title": "Add Two Numbers",
      "english_title": "Add Two Numbers",
      "difficulty": "Medium",
      "topic": "Linked Lists",
      "url": "https://leetcode.cn/problems/add-two-numbers/"
    },
    {
      "id": "19",
      "slug": "remove-nth-node-from-end-of-list",
      "title": "Remove Nth Node From End of List",
      "english_title": "Remove Nth Node From End of List",
      "difficulty": "Medium",
      "topic": "Linked Lists",
      "url": "https://leetcode.cn/problems/remove-nth-node-from-end-of-list/"
    },
    {
      "id": "21",
      "slug": "merge-two-sorted-lists",
      "title": "Merge Two Sorted Lists",
      "english_title": "Merge Two Sorted Lists",
      "difficulty": "Easy",
      "topic": "Linked Lists",
      "url": "https://leetcode.cn/problems/merge-two-sorted-lists/"
    },
    {
      "id": "23",
      "slug": "merge-k-sorted-lists",
      "title": "Merge k Sorted Lists",
      "english_title": "Merge k Sorted Lists",
      "difficulty": "Hard",
      "topic": "Linked Lists",
      "url": "https://leetcode.cn/problems/merge-k-sorted-lists/"
    },
    {
      "id": "24",
      "slug": "swap-nodes-in-pairs",
      "title": "Swap Nodes in Pairs",
      "english_title": "Swap Nodes in Pairs",
      "difficulty": "Medium",
      "topic": "Linked Lists",
      "url": "https://leetcode.cn/problems/swap-nodes-in-pairs/"
    },
    {
      "id": "25",
      "slug": "reverse-nodes-in-k-group",
      "title": "Reverse Nodes in k-Group",
      "english_title": "Reverse Nodes in k-Group",
      "difficulty": "Hard",
      "topic": "Linked Lists",
      "url": "https://leetcode.cn/problems/reverse-nodes-in-k-group/"
    },
    {
      "id": "138",
      "slug": "copy-list-with-random-pointer",
      "title": "Copy List with Random Pointer",
      "english_title": "Copy List with Random Pointer",
      "difficulty": "Medium",
      "topic": "Linked Lists",
      "url": "https://leetcode.cn/problems/copy-list-with-random-pointer/"
    },
    {
      "id": "141",
      "slug": "linked-list-cycle",
      "title": "Linked List Cycle",
      "english_title": "Linked List Cycle",
      "difficulty": "Easy",
      "topic": "Linked Lists",
      "url": "https://leetcode.cn/problems/linked-list-cycle/"
    },
    {
      "id": "142",
      "slug": "linked-list-cycle-ii",
      "title": "Linked List Cycle II",
      "english_title": "Linked List Cycle II",
      "difficulty": "Medium",
      "topic": "Linked Lists",
      "url": "https://leetcode.cn/problems/linked-list-cycle-ii/"
    },
    {
      "id": "146",
      "slug": "lru-cache",
      "title": "LRU Cache",
      "english_title": "LRU Cache",
      "difficulty": "Medium",
      "topic": "Linked Lists",
      "url": "https://leetcode.cn/problems/lru-cache/"
    },
    {
      "id": "148",
      "slug": "sort-list",
      "title": "Sort List",
      "english_title": "Sort List",
      "difficulty": "Medium",
      "topic": "Linked Lists",
      "url": "https://leetcode.cn/problems/sort-list/"
    },
    {
      "id": "160",
      "slug": "intersection-of-two-linked-lists",
      "title": "Intersection of Two Linked Lists",
      "english_title": "Intersection of Two Linked Lists",
      "difficulty": "Easy",
      "topic": "Linked Lists",
      "url": "https://leetcode.cn/problems/intersection-of-two-linked-lists/"
    },
    {
      "id": "206",
      "slug": "reverse-linked-list",
      "title": "Reverse Linked List",
      "english_title": "Reverse Linked List",
      "difficulty": "Easy",
      "topic": "Linked Lists",
      "url": "https://leetcode.cn/problems/reverse-linked-list/"
    },
    {
      "id": "234",
      "slug": "palindrome-linked-list",
      "title": "Palindrome Linked List",
      "english_title": "Palindrome Linked List",
      "difficulty": "Easy",
      "topic": "Linked Lists",
      "url": "https://leetcode.cn/problems/palindrome-linked-list/"
    },
    {
      "id": "48",
      "slug": "rotate-image",
      "title": "Rotate Image",
      "english_title": "Rotate Image",
      "difficulty": "Medium",
      "topic": "Matrix",
      "url": "https://leetcode.cn/problems/rotate-image/"
    },
    {
      "id": "54",
      "slug": "spiral-matrix",
      "title": "Spiral Matrix",
      "english_title": "Spiral Matrix",
      "difficulty": "Medium",
      "topic": "Matrix",
      "url": "https://leetcode.cn/problems/spiral-matrix/"
    },
    {
      "id": "73",
      "slug": "set-matrix-zeroes",
      "title": "Set Matrix Zeroes",
      "english_title": "Set Matrix Zeroes",
      "difficulty": "Medium",
      "topic": "Matrix",
      "url": "https://leetcode.cn/problems/set-matrix-zeroes/"
    },
    {
      "id": "240",
      "slug": "search-a-2d-matrix-ii",
      "title": "Search a 2D Matrix II",
      "english_title": "Search a 2D Matrix II",
      "difficulty": "Medium",
      "topic": "Matrix",
      "url": "https://leetcode.cn/problems/search-a-2d-matrix-ii/"
    },
    {
      "id": "3",
      "slug": "longest-substring-without-repeating-characters",
      "title": "Longest Substring Without Repeating Characters",
      "english_title": "Longest Substring Without Repeating Characters",
      "difficulty": "Medium",
      "topic": "Sliding Window",
      "url": "https://leetcode.cn/problems/longest-substring-without-repeating-characters/"
    },
    {
      "id": "76",
      "slug": "minimum-window-substring",
      "title": "Minimum Window Substring",
      "english_title": "Minimum Window Substring",
      "difficulty": "Hard",
      "topic": "Sliding Window",
      "url": "https://leetcode.cn/problems/minimum-window-substring/"
    },
    {
      "id": "239",
      "slug": "sliding-window-maximum",
      "title": "Sliding Window Maximum",
      "english_title": "Sliding Window Maximum",
      "difficulty": "Hard",
      "topic": "Sliding Window",
      "url": "https://leetcode.cn/problems/sliding-window-maximum/"
    },
    {
      "id": "438",
      "slug": "find-all-anagrams-in-a-string",
      "title": "Find All Anagrams in a String",
      "english_title": "Find All Anagrams in a String",
      "difficulty": "Medium",
      "topic": "Sliding Window",
      "url": "https://leetcode.cn/problems/find-all-anagrams-in-a-string/"
    },
    {
      "id": "20",
      "slug": "valid-parentheses",
      "title": "Valid Parentheses",
      "english_title": "Valid Parentheses",
      "difficulty": "Easy",
      "topic": "Stack",
      "url": "https://leetcode.cn/problems/valid-parentheses/"
    },
    {
      "id": "84",
      "slug": "largest-rectangle-in-histogram",
      "title": "Largest Rectangle in Histogram",
      "english_title": "Largest Rectangle in Histogram",
      "difficulty": "Hard",
      "topic": "Stack",
      "url": "https://leetcode.cn/problems/largest-rectangle-in-histogram/"
    },
    {
      "id": "155",
      "slug": "min-stack",
      "title": "Min Stack",
      "english_title": "Min Stack",
      "difficulty": "Medium",
      "topic": "Stack",
      "url": "https://leetcode.cn/problems/min-stack/"
    },
    {
      "id": "394",
      "slug": "decode-string",
      "title": "Decode String",
      "english_title": "Decode String",
      "difficulty": "Medium",
      "topic": "Stack",
      "url": "https://leetcode.cn/problems/decode-string/"
    },
    {
      "id": "739",
      "slug": "daily-temperatures",
      "title": "Daily Temperatures",
      "english_title": "Daily Temperatures",
      "difficulty": "Medium",
      "topic": "Stack",
      "url": "https://leetcode.cn/problems/daily-temperatures/"
    },
    {
      "id": "11",
      "slug": "container-with-most-water",
      "title": "Container With Most Water",
      "english_title": "Container With Most Water",
      "difficulty": "Medium",
      "topic": "Two Pointers",
      "url": "https://leetcode.cn/problems/container-with-most-water/"
    },
    {
      "id": "15",
      "slug": "3sum",
      "title": "3Sum",
      "english_title": "3Sum",
      "difficulty": "Medium",
      "topic": "Two Pointers",
      "url": "https://leetcode.cn/problems/3sum/"
    },
    {
      "id": "42",
      "slug": "trapping-rain-water",
      "title": "Trapping Rain Water",
      "english_title": "Trapping Rain Water",
      "difficulty": "Hard",
      "topic": "Two Pointers",
      "url": "https://leetcode.cn/problems/trapping-rain-water/"
    },
    {
      "id": "283",
      "slug": "move-zeroes",
      "title": "Move Zeroes",
      "english_title": "Move Zeroes",
      "difficulty": "Easy",
      "topic": "Two Pointers",
      "url": "https://leetcode.cn/problems/move-zeroes/"
    },
    {
      "id": "208",
      "slug": "implement-trie-prefix-tree",
      "title": "Implement Trie (Prefix Tree)",
      "english_title": "Implement Trie (Prefix Tree)",
      "difficulty": "Medium",
      "topic": "Trie",
      "url": "https://leetcode.cn/problems/implement-trie-prefix-tree/"
    },
    {
      "id": "31",
      "slug": "next-permutation",
      "title": "Next Permutation",
      "english_title": "Next Permutation",
      "difficulty": "Medium",
      "topic": "Misc",
      "url": "https://leetcode.cn/problems/next-permutation/"
    },
    {
      "id": "41",
      "slug": "first-missing-positive",
      "title": "First Missing Positive",
      "english_title": "First Missing Positive",
      "difficulty": "Hard",
      "topic": "Misc",
      "url": "https://leetcode.cn/problems/first-missing-positive/"
    },
    {
      "id": "53",
      "slug": "maximum-subarray",
      "title": "Maximum Subarray",
      "english_title": "Maximum Subarray",
      "difficulty": "Medium",
      "topic": "Misc",
      "url": "https://leetcode.cn/problems/maximum-subarray/"
    },
    {
      "id": "56",
      "slug": "merge-intervals",
      "title": "Merge Intervals",
      "english_title": "Merge Intervals",
      "difficulty": "Medium",
      "topic": "Misc",
      "url": "https://leetcode.cn/problems/merge-intervals/"
    },
    {
      "id": "75",
      "slug": "sort-colors",
      "title": "Sort Colors",
      "english_title": "Sort Colors",
      "difficulty": "Medium",
      "topic": "Misc",
      "url": "https://leetcode.cn/problems/sort-colors/"
    },
    {
      "id": "136",
      "slug": "single-number",
      "title": "Single Number",
      "english_title": "Single Number",
      "difficulty": "Easy",
      "topic": "Misc",
      "url": "https://leetcode.cn/problems/single-number/"
    },
    {
      "id": "169",
      "slug": "majority-element",
      "title": "Majority Element",
      "english_title": "Majority Element",
      "difficulty": "Easy",
      "topic": "Misc",
      "url": "https://leetcode.cn/problems/majority-element/"
    },
    {
      "id": "189",
      "slug": "rotate-array",
      "title": "Rotate Array",
      "english_title": "Rotate Array",
      "difficulty": "Medium",
      "topic": "Misc",
      "url": "https://leetcode.cn/problems/rotate-array/"
    },
    {
      "id": "238",
      "slug": "product-of-array-except-self",
      "title": "Product of Array Except Self",
      "english_title": "Product of Array Except Self",
      "difficulty": "Medium",
      "topic": "Misc",
      "url": "https://leetcode.cn/problems/product-of-array-except-self/"
    },
    {
      "id": "287",
      "slug": "find-the-duplicate-number",
      "title": "Find the Duplicate Number",
      "english_title": "Find the Duplicate Number",
      "difficulty": "Medium",
      "topic": "Misc",
      "url": "https://leetcode.cn/problems/find-the-duplicate-number/"
    }
  ],
  "extra_questions": [
    {
      "id": "912",
      "slug": "sort-an-array",
      "title": "快排 / Sort an Array",
      "english_title": "Sort an Array",
      "difficulty": "Medium",
      "topic": "Sorting",
      "aliases": [
        "快排",
        "快速排序",
        "Quick Sort"
      ],
      "url": "https://leetcode.cn/problems/sort-an-array/"
    }
  ]
}