{
  "schema_version": 1,
  "site": "cn",
  "username": "piao-16m",
  "updated_at": "2026-11-10T09:46:31Z",
  "hot100": {
    "total": 100,
    "solved": 48,
    "percentage": 48.0
  },
  "categories": {
    "Backtracking": {
      "total": 8,
      "solved": 2
    },
    "Binary Search": {
      "total": 7,
      "solved": 5
    },
    "Binary Tree": {
      "total": 14,
      "solved": 4
    },
    "Dynamic Programming": {
      "total": 15,
      "solved": 4
    },
    "Graph": {
      "total": 3,
      "solved": 1
    },
    "Greedy": {
      "total": 4,
      "solved": 2
    },
    "Hashing": {
      "total": 4,
      "solved": 4
    },
    "Heap": {
      "total": 3,
      "solved": 0
    },
    "Linked Lists": {
      "total": 14,
      "solved": 7
    },
    "Matrix": {
      "total": 4,
      "solved": 4
    },
    "Sliding Window": {
      "total": 4,
      "solved": 4
    },
    "Stack": {
      "total": 5,
      "solved": 1
    },
    "Two Pointers": {
      "total": 4,
      "solved": 4
    },
    "Trie": {
      "total": 1,
      "solved": 0
    },
    "Misc": {
      "total": 10,
      "solved": 6
    }
  },
  "remaining": [
    {
      "title": "Letter Combinations of a Phone Number",
      "slug": "letter-combinations-of-a-phone-number",
      "difficulty": "Medium",
      "category": "Backtracking"
    },
    {
      "title": "Generate Parentheses",
      "slug": "generate-parentheses",
      "difficulty": "Medium",
      "category": "Backtracking"
    },
    {
      "title": "Combination Sum",
      "slug": "combination-sum",
      "difficulty": "Medium",
      "category": "Backtracking"
    },
    {
      "title": "N-Queens",
      "slug": "n-queens",
      "difficulty": "Hard",
      "category": "Backtracking"
    },
    {
      "title": "Subsets",
      "slug": "subsets",
      "difficulty": "Medium",
      "category": "Backtracking"
    },
    {
      "title": "Palindrome Partitioning",
      "slug": "palindrome-partitioning",
      "difficulty": "Medium",
      "category": "Backtracking"
    },
    {
      "title": "Median of Two Sorted Arrays",
      "slug": "median-of-two-sorted-arrays",
      "difficulty": "Hard",
      "category": "Binary Search"
    },
    {
      "title": "Binary Tree Maximum Path Sum",
      "slug": "binary-tree-maximum-path-sum",
      "difficulty": "Hard",
      "category": "Binary Search"
    },
    {
      "title": "Validate Binary Search Tree",
      "slug": "validate-binary-search-tree",
      "difficulty": "Medium",
      "category": "Binary Tree"
    },
    {
      "title": "Binary Tree Level Order Traversal",
      "slug": "binary-tree-level-order-traversal",
      "difficulty": "Medium",
      "category": "Binary Tree"
    },
    {
      "title": "Construct Binary Tree from Preorder and Inorder Traversal",
      "slug": "construct-binary-tree-from-preorder-and-inorder-traversal",
      "difficulty": "Medium",
      "category": "Binary Tree"
    },
    {
      "title": "Convert Sorted Array to Binary Search Tree",
      "slug": "convert-sorted-array-to-binary-search-tree",
      "difficulty": "Easy",
      "category": "Binary Tree"
    },
    {
      "title": "Flatten Binary Tree to Linked List",
      "slug": "flatten-binary-tree-to-linked-list",
      "difficulty": "Medium",
      "category": "Binary Tree"
    },
    {
      "title": "Binary Tree Right Side View",
      "slug": "binary-tree-right-side-view",
      "difficulty": "Medium",
      "category": "Binary Tree"
    },
    {
      "title": "Kth Smallest Element in a BST",
      "slug": "kth-smallest-element-in-a-bst",
      "difficulty": "Medium",
      "category": "Binary Tree"
    },
    {
      "title": "Lowest Common Ancestor of a Binary Tree",
      "slug": "lowest-common-ancestor-of-a-binary-tree",
      "difficulty": "Medium",
      "category": "Binary Tree"
    },
    {
      "title": "Path Sum III",
      "slug": "path-sum-iii",
      "difficulty": "Medium",
      "category": "Binary Tree"
    },
    {
      "title": "Diameter of Binary Tree",
      "slug": "diameter-of-binary-tree",
      "difficulty": "Easy",
      "category": "Binary Tree"
    },
    {
      "title": "Longest Palindromic Substring",
      "slug": "longest-palindromic-substring",
      "difficulty": "Medium",
      "category": "Dynamic Programming"
    },
    {
      "title": "Longest Valid Parentheses",
      "slug": "longest-valid-parentheses",
      "difficulty": "Hard",
      "category": "Dynamic Programming"
    },
    {
      "title": "Unique Paths",
      "slug": "unique-paths",
      "difficulty": "Medium",
      "category": "Dynamic Programming"
    },
    {
      "title": "Minimum Path Sum",
      "slug": "minimum-path-sum",
      "difficulty": "Medium",
      "category": "Dynamic Programming"
    },
    {
      "title": "Edit Distance",
      "slug": "edit-distance",
      "difficulty": "Medium",
      "category": "Dynamic Programming"
    },
    {
      "title": "Word Break",
      "slug": "word-break",
      "difficulty": "Medium",
      "category": "Dynamic Programming"
    },
    {
      "title": "Maximum Product Subarray",
      "slug": "maximum-product-subarray",
      "difficulty": "Medium",
      "category": "Dynamic Programming"
    },
    {
      "title": "Longest Increasing Subsequence",
      "slug": "longest-increasing-subsequence",
      "difficulty": "Medium",
      "category": "Dynamic Programming"
    },
    {
      "title": "Coin Change",
      "slug": "coin-change",
      "difficulty": "Medium",
      "category": "Dynamic Programming"
    },
    {
      "title": "Partition Equal Subset Sum",
      "slug": "partition-equal-subset-sum",
      "difficulty": "Medium",
      "category": "Dynamic Programming"
    },
    {
      "title": "Longest Common Subsequence",
      "slug": "longest-common-subsequence",
      "difficulty": "Medium",
      "category": "Dynamic Programming"
    },
    {
      "title": "Course Schedule",
      "slug": "course-schedule",
      "difficulty": "Medium",
      "category": "Graph"
    },
    {
      "title": "Rotting Oranges",
      "slug": "rotting-oranges",
      "difficulty": "Medium",
      "category": "Graph"
    },
    {
      "title": "Jump Game II",
      "slug": "jump-game-ii",
      "difficulty": "Medium",
      "category": "Greedy"
    },
    {
      "title": "Partition Labels",
      "slug": "partition-labels",
      "difficulty": "Medium",
      "category": "Greedy"
    },
    {
      "title": "Kth Largest Element in an Array",
      "slug": "kth-largest-element-in-an-array",
      "difficulty": "Medium",
      "category": "Heap"
    },
    {
      "title": "Find Median from Data Stream",
      "slug": "find-median-from-data-stream",
      "difficulty": "Hard",
      "category": "Heap"
    },
    {
      "title": "Top K Frequent Elements",
      "slug": "top-k-frequent-elements",
      "difficulty": "Medium",
      "category": "Heap"
    },
    {
      "title": "Remove Nth Node From End of List",
      "slug": "remove-nth-node-from-end-of-list",
      "difficulty": "Medium",
      "category": "Linked Lists"
    },
    {
      "title": "Merge k Sorted Lists",
      "slug": "merge-k-sorted-lists",
      "difficulty": "Hard",
      "category": "Linked Lists"
    },
    {
      "title": "Swap Nodes in Pairs",
      "slug": "swap-nodes-in-pairs",
      "difficulty": "Medium",
      "category": "Linked Lists"
    },
    {
      "title": "Reverse Nodes in k-Group",
      "slug": "reverse-nodes-in-k-group",
      "difficulty": "Hard",
      "category": "Linked Lists"
    },
    {
      "title": "Copy List with Random Pointer",
      "slug": "copy-list-with-random-pointer",
      "difficulty": "Medium",
      "category": "Linked Lists"
    },
    {
      "title": "LRU Cache",
      "slug": "lru-cache",
      "difficulty": "Medium",
      "category": "Linked Lists"
    },
    {
      "title": "Sort List",
      "slug": "sort-list",
      "difficulty": "Medium",
      "category": "Linked Lists"
    },
    {
      "title": "Largest Rectangle in Histogram",
      "slug": "largest-rectangle-in-histogram",
      "difficulty": "Hard",
      "category": "Stack"
    },
    {
      "title": "Min Stack",
      "slug": "min-stack",
      "difficulty": "Medium",
      "category": "Stack"
    },
    {
      "title": "Decode String",
      "slug": "decode-string",
      "difficulty": "Medium",
      "category": "Stack"
    },
    {
      "title": "Daily Temperatures",
      "slug": "daily-temperatures",
      "difficulty": "Medium",
      "category": "Stack"
    },
    {
      "title": "Implement Trie (Prefix Tree)",
      "slug": "implement-trie-prefix-tree",
      "difficulty": "Medium",
      "category": "Trie"
    },
    {
      "title": "Next Permutation",
      "slug": "next-permutation",
      "difficulty": "Medium",
      "category": "Misc"
    },
    {
      "title": "Sort Colors",
      "slug": "sort-colors",
      "difficulty": "Medium",
      "category": "Misc"
    },
    {
      "title": "Majority Element",
      "slug": "majority-element",
      "difficulty": "Easy",
      "category": "Misc"
    },
    {
      "title": "Find the Duplicate Number",
      "slug": "find-the-duplicate-number",
      "difficulty": "Medium",
      "category": "Misc"
    }
  ],
  "recent": {
    "submissions": [
      {
        "id": "758795024",
        "title": "3Sum",
        "slug": "3sum",
        "submitted_at": "2026-11-05T12:23:44Z"
      },
      {
        "id": "758793217",
        "title": "3Sum",
        "slug": "3sum",
        "submitted_at": "2026-11-05T12:13:50Z"
      },
      {
        "id": "758739830",
        "title": "Permutations",
        "slug": "permutations",
        "submitted_at": "2026-11-05T07:35:03Z"
      },
      {
        "id": "758738254",
        "title": "Two Sum",
        "slug": "two-sum",
        "submitted_at": "2026-11-05T07:28:47Z"
      },
      {
        "id": "758692290",
        "title": "Permutations",
        "slug": "permutations",
        "submitted_at": "2026-11-05T02:40:29Z"
      },
      {
        "id": "758687919",
        "title": "Maximum Depth of Binary Tree",
        "slug": "maximum-depth-of-binary-tree",
        "submitted_at": "2026-11-05T02:17:51Z"
      },
      {
        "id": "758686587",
        "title": "Same Tree",
        "slug": "same-tree",
        "submitted_at": "2026-11-05T02:09:38Z"
      },
      {
        "id": "758438789",
        "title": "Symmetric Tree",
        "slug": "symmetric-tree",
        "submitted_at": "2026-11-03T11:27:14Z"
      },
      {
        "id": "758403864",
        "title": "Valid Parentheses",
        "slug": "valid-parentheses",
        "submitted_at": "2026-11-03T08:34:17Z"
      },
      {
        "id": "757378092",
        "title": "Single Number",
        "slug": "single-number",
        "submitted_at": "2026-10-28T03:41:10Z"
      },
      {
        "id": "757361249",
        "title": "Number of Islands",
        "slug": "number-of-islands",
        "submitted_at": "2026-10-28T02:33:25Z"
      },
      {
        "id": "757017638",
        "title": "Invert Binary Tree",
        "slug": "invert-binary-tree",
        "submitted_at": "2026-10-26T07:46:54Z"
      },
      {
        "id": "757016177",
        "title": "Maximum Depth of Binary Tree",
        "slug": "maximum-depth-of-binary-tree",
        "submitted_at": "2026-10-26T07:42:29Z"
      },
      {
        "id": "756997571",
        "title": "Linked List Cycle II",
        "slug": "linked-list-cycle-ii",
        "submitted_at": "2026-10-26T06:35:59Z"
      },
      {
        "id": "756402765",
        "title": "Word Search",
        "slug": "word-search",
        "submitted_at": "2026-10-22T11:53:21Z"
      }
    ],
    "newly_observed_slugs": []
  },
  "coverage": {
    "source": "public_recent_ac_with_local_history",
    "is_complete": true,
    "known_solved": 69,
    "reported_solved": 69
  }
}