{
  "n_problems": 45903,
  "platforms": {
    "atcoder": {
      "n": 9095,
      "with_difficulty": 4699,
      "with_canonical_topic": 775,
      "predicted_tags": 775,
      "difficulty_median": 0.4022
    },
    "codechef": {
      "n": 21568,
      "with_difficulty": 5520,
      "with_canonical_topic": 5450,
      "predicted_tags": 1480,
      "difficulty_median": 0.4924
    },
    "codeforces": {
      "n": 11263,
      "with_difficulty": 10979,
      "with_canonical_topic": 10834,
      "predicted_tags": 0,
      "difficulty_median": 0.3704
    },
    "leetcode": {
      "n": 3977,
      "with_difficulty": 3977,
      "with_canonical_topic": 3522,
      "predicted_tags": 0,
      "difficulty_median": 0.5
    }
  },
  "n_taxonomy_defined": 44,
  "n_canonical_topics": 44,
  "n_other_labels": 55,
  "canonical_topics": [
    "array",
    "backtracking",
    "bfs",
    "binary_search",
    "bitmask",
    "brute_force",
    "combinatorics",
    "constructive",
    "data_structures",
    "design",
    "dfs",
    "divide_and_conquer",
    "dynamic_programming",
    "fft",
    "game_theory",
    "geometry",
    "graphs",
    "greedy",
    "hash_table",
    "hashing",
    "heap",
    "implementation",
    "linked_list",
    "math",
    "matrix",
    "monotonic_stack",
    "network_flow",
    "number_theory",
    "prefix_sum",
    "probability",
    "queue",
    "recursion",
    "segment_tree",
    "shortest_paths",
    "simulation",
    "sliding_window",
    "sorting",
    "stack",
    "string_matching",
    "strings",
    "trees",
    "trie",
    "two_pointers",
    "union_find"
  ],
  "with_difficulty": 25175,
  "with_canonical_topic": 20581,
  "predicted_tags_total": 2255
}