diff --git "a/cses_problem_metadata.json" "b/cses_problem_metadata.json"
new file mode 100644--- /dev/null
+++ "b/cses_problem_metadata.json"
@@ -0,0 +1,5102 @@
+[
+  {
+    "id": "1068",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Weird Algorithm",
+    "norm_name": "weird_algorithm",
+    "url": "https://cses.fi/problemset/task/1068",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 119616,
+      "attempted_by": 125315,
+      "success_rate": 95.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "1083",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Missing Number",
+    "norm_name": "missing_number",
+    "url": "https://cses.fi/problemset/task/1083",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 102510,
+      "attempted_by": 107900,
+      "success_rate": 95.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "1069",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Repetitions",
+    "norm_name": "repetitions",
+    "url": "https://cses.fi/problemset/task/1069",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 89407,
+      "attempted_by": 93387,
+      "success_rate": 95.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1094",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Increasing Array",
+    "norm_name": "increasing_array",
+    "url": "https://cses.fi/problemset/task/1094",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 83904,
+      "attempted_by": 87247,
+      "success_rate": 96.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 7
+  },
+  {
+    "id": "1070",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Permutations",
+    "norm_name": "permutations",
+    "url": "https://cses.fi/problemset/task/1070",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 73586,
+      "attempted_by": 76044,
+      "success_rate": 96.7
+    },
+    "num_examples": 2,
+    "num_test_cases": 21
+  },
+  {
+    "id": "1071",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Number Spiral",
+    "norm_name": "number_spiral",
+    "url": "https://cses.fi/problemset/task/1071",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 52182,
+      "attempted_by": 56935,
+      "success_rate": 91.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 2
+  },
+  {
+    "id": "1072",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Two Knights",
+    "norm_name": "two_knights",
+    "url": "https://cses.fi/problemset/task/1072",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 39384,
+      "attempted_by": 40727,
+      "success_rate": 96.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 3
+  },
+  {
+    "id": "1092",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Two Sets",
+    "norm_name": "two_sets",
+    "url": "https://cses.fi/problemset/task/1092",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 42668,
+      "attempted_by": 46242,
+      "success_rate": 92.2
+    },
+    "num_examples": 2,
+    "num_test_cases": 23
+  },
+  {
+    "id": "1617",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Bit Strings",
+    "norm_name": "bit_strings",
+    "url": "https://cses.fi/problemset/task/1617",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 49366,
+      "attempted_by": 52139,
+      "success_rate": 94.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1618",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Trailing Zeros",
+    "norm_name": "trailing_zeros",
+    "url": "https://cses.fi/problemset/task/1618",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 46149,
+      "attempted_by": 49269,
+      "success_rate": 93.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1754",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Coin Piles",
+    "norm_name": "coin_piles",
+    "url": "https://cses.fi/problemset/task/1754",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 40746,
+      "attempted_by": 44879,
+      "success_rate": 90.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 3
+  },
+  {
+    "id": "1755",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Palindrome Reorder",
+    "norm_name": "palindrome_reorder",
+    "url": "https://cses.fi/problemset/task/1755",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 37646,
+      "attempted_by": 39943,
+      "success_rate": 94.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 17
+  },
+  {
+    "id": "2205",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Gray Code",
+    "norm_name": "gray_code",
+    "url": "https://cses.fi/problemset/task/2205",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 24227,
+      "attempted_by": 27540,
+      "success_rate": 87.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 16
+  },
+  {
+    "id": "2165",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Tower of Hanoi",
+    "norm_name": "tower_of_hanoi",
+    "url": "https://cses.fi/problemset/task/2165",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 22410,
+      "attempted_by": 23347,
+      "success_rate": 95.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 16
+  },
+  {
+    "id": "1622",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Creating Strings",
+    "norm_name": "creating_strings",
+    "url": "https://cses.fi/problemset/task/1622",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 32200,
+      "attempted_by": 33133,
+      "success_rate": 97.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "1623",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Apple Division",
+    "norm_name": "apple_division",
+    "url": "https://cses.fi/problemset/task/1623",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 31627,
+      "attempted_by": 36050,
+      "success_rate": 87.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 18
+  },
+  {
+    "id": "1624",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Chessboard and Queens",
+    "norm_name": "chessboard_and_queens",
+    "url": "https://cses.fi/problemset/task/1624",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 18866,
+      "attempted_by": 19255,
+      "success_rate": 97.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "2431",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Digit Queries",
+    "norm_name": "digit_queries",
+    "url": "https://cses.fi/problemset/task/2431",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 13271,
+      "attempted_by": 15756,
+      "success_rate": 84.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 4
+  },
+  {
+    "id": "1625",
+    "category": "Introductory Problems",
+    "norm_category": "introductory_problems",
+    "name": "Grid Paths",
+    "norm_name": "grid_paths",
+    "url": "https://cses.fi/problemset/task/1625",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 7658,
+      "attempted_by": 9897,
+      "success_rate": 77.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 20
+  },
+  {
+    "id": "1621",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Distinct Numbers",
+    "norm_name": "distinct_numbers",
+    "url": "https://cses.fi/problemset/task/1621",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 57669,
+      "attempted_by": 62749,
+      "success_rate": 91.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "1084",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Apartments",
+    "norm_name": "apartments",
+    "url": "https://cses.fi/problemset/task/1084",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 42289,
+      "attempted_by": 47533,
+      "success_rate": 88.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 19
+  },
+  {
+    "id": "1090",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Ferris Wheel",
+    "norm_name": "ferris_wheel",
+    "url": "https://cses.fi/problemset/task/1090",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 40434,
+      "attempted_by": 43956,
+      "success_rate": 91.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1091",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Concert Tickets",
+    "norm_name": "concert_tickets",
+    "url": "https://cses.fi/problemset/task/1091",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 32584,
+      "attempted_by": 38432,
+      "success_rate": 84.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 11
+  },
+  {
+    "id": "1619",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Restaurant Customers",
+    "norm_name": "restaurant_customers",
+    "url": "https://cses.fi/problemset/task/1619",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 33285,
+      "attempted_by": 36196,
+      "success_rate": 91.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "1629",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Movie Festival",
+    "norm_name": "movie_festival",
+    "url": "https://cses.fi/problemset/task/1629",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 31415,
+      "attempted_by": 33485,
+      "success_rate": 93.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 11
+  },
+  {
+    "id": "1640",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Sum of Two Values",
+    "norm_name": "sum_of_two_values",
+    "url": "https://cses.fi/problemset/task/1640",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 36922,
+      "attempted_by": 41820,
+      "success_rate": 88.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 27
+  },
+  {
+    "id": "1643",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Maximum Subarray Sum",
+    "norm_name": "maximum_subarray_sum",
+    "url": "https://cses.fi/problemset/task/1643",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 36159,
+      "attempted_by": 37912,
+      "success_rate": 95.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "1074",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Stick Lengths",
+    "norm_name": "stick_lengths",
+    "url": "https://cses.fi/problemset/task/1074",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 32177,
+      "attempted_by": 33854,
+      "success_rate": 95.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "2183",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Missing Coin Sum",
+    "norm_name": "missing_coin_sum",
+    "url": "https://cses.fi/problemset/task/2183",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 23307,
+      "attempted_by": 24204,
+      "success_rate": 96.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "2216",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Collecting Numbers",
+    "norm_name": "collecting_numbers",
+    "url": "https://cses.fi/problemset/task/2216",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 24007,
+      "attempted_by": 25923,
+      "success_rate": 92.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 4
+  },
+  {
+    "id": "2217",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Collecting Numbers II",
+    "norm_name": "collecting_numbers_ii",
+    "url": "https://cses.fi/problemset/task/2217",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 9618,
+      "attempted_by": 12553,
+      "success_rate": 76.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 2
+  },
+  {
+    "id": "1141",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Playlist",
+    "norm_name": "playlist",
+    "url": "https://cses.fi/problemset/task/1141",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 24375,
+      "attempted_by": 28270,
+      "success_rate": 86.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 21
+  },
+  {
+    "id": "1073",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Towers",
+    "norm_name": "towers",
+    "url": "https://cses.fi/problemset/task/1073",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 24901,
+      "attempted_by": 26845,
+      "success_rate": 92.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1163",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Traffic Lights",
+    "norm_name": "traffic_lights",
+    "url": "https://cses.fi/problemset/task/1163",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 19337,
+      "attempted_by": 21794,
+      "success_rate": 88.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "2162",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Josephus Problem I",
+    "norm_name": "josephus_problem_i",
+    "url": "https://cses.fi/problemset/task/2162",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 14091,
+      "attempted_by": 15788,
+      "success_rate": 89.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "2163",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Josephus Problem II",
+    "norm_name": "josephus_problem_ii",
+    "url": "https://cses.fi/problemset/task/2163",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 7781,
+      "attempted_by": 10538,
+      "success_rate": 73.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 17
+  },
+  {
+    "id": "2168",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Nested Ranges Check",
+    "norm_name": "nested_ranges_check",
+    "url": "https://cses.fi/problemset/task/2168",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 7950,
+      "attempted_by": 9254,
+      "success_rate": 85.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "2169",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Nested Ranges Count",
+    "norm_name": "nested_ranges_count",
+    "url": "https://cses.fi/problemset/task/2169",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 5499,
+      "attempted_by": 6475,
+      "success_rate": 84.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1164",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Room Allocation",
+    "norm_name": "room_allocation",
+    "url": "https://cses.fi/problemset/task/1164",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 14290,
+      "attempted_by": 16569,
+      "success_rate": 86.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1620",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Factory Machines",
+    "norm_name": "factory_machines",
+    "url": "https://cses.fi/problemset/task/1620",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 19670,
+      "attempted_by": 21779,
+      "success_rate": 90.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 20
+  },
+  {
+    "id": "1630",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Tasks and Deadlines",
+    "norm_name": "tasks_and_deadlines",
+    "url": "https://cses.fi/problemset/task/1630",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 16568,
+      "attempted_by": 16948,
+      "success_rate": 97.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "1631",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Reading Books",
+    "norm_name": "reading_books",
+    "url": "https://cses.fi/problemset/task/1631",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 13278,
+      "attempted_by": 14260,
+      "success_rate": 93.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1641",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Sum of Three Values",
+    "norm_name": "sum_of_three_values",
+    "url": "https://cses.fi/problemset/task/1641",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 19436,
+      "attempted_by": 21836,
+      "success_rate": 89.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 27
+  },
+  {
+    "id": "1642",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Sum of Four Values",
+    "norm_name": "sum_of_four_values",
+    "url": "https://cses.fi/problemset/task/1642",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 12219,
+      "attempted_by": 13753,
+      "success_rate": 88.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 31
+  },
+  {
+    "id": "1645",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Nearest Smaller Values",
+    "norm_name": "nearest_smaller_values",
+    "url": "https://cses.fi/problemset/task/1645",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 16384,
+      "attempted_by": 16995,
+      "success_rate": 96.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1660",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Subarray Sums I",
+    "norm_name": "subarray_sums_i",
+    "url": "https://cses.fi/problemset/task/1660",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 21164,
+      "attempted_by": 22863,
+      "success_rate": 92.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "1661",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Subarray Sums II",
+    "norm_name": "subarray_sums_ii",
+    "url": "https://cses.fi/problemset/task/1661",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 18721,
+      "attempted_by": 22852,
+      "success_rate": 81.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 28
+  },
+  {
+    "id": "1662",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Subarray Divisibility",
+    "norm_name": "subarray_divisibility",
+    "url": "https://cses.fi/problemset/task/1662",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 17685,
+      "attempted_by": 19375,
+      "success_rate": 91.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "2428",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Subarray Distinct Values",
+    "norm_name": "subarray_distinct_values",
+    "url": "https://cses.fi/problemset/task/2428",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 10475,
+      "attempted_by": 11246,
+      "success_rate": 93.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "1085",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Array Division",
+    "norm_name": "array_division",
+    "url": "https://cses.fi/problemset/task/1085",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 16577,
+      "attempted_by": 17545,
+      "success_rate": 94.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 18
+  },
+  {
+    "id": "1076",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Sliding Window Median",
+    "norm_name": "sliding_window_median",
+    "url": "https://cses.fi/problemset/task/1076",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 10747,
+      "attempted_by": 12286,
+      "success_rate": 87.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 40
+  },
+  {
+    "id": "1077",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Sliding Window Cost",
+    "norm_name": "sliding_window_cost",
+    "url": "https://cses.fi/problemset/task/1077",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 7229,
+      "attempted_by": 8348,
+      "success_rate": 86.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 34
+  },
+  {
+    "id": "1632",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Movie Festival II",
+    "norm_name": "movie_festival_ii",
+    "url": "https://cses.fi/problemset/task/1632",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 8778,
+      "attempted_by": 10832,
+      "success_rate": 81.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "1644",
+    "category": "Sorting and Searching",
+    "norm_category": "sorting_and_searching",
+    "name": "Maximum Subarray Sum II",
+    "norm_name": "maximum_subarray_sum_ii",
+    "url": "https://cses.fi/problemset/task/1644",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 8086,
+      "attempted_by": 9741,
+      "success_rate": 83.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 25
+  },
+  {
+    "id": "1633",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Dice Combinations",
+    "norm_name": "dice_combinations",
+    "url": "https://cses.fi/problemset/task/1633",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 58143,
+      "attempted_by": 61796,
+      "success_rate": 94.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 20
+  },
+  {
+    "id": "1634",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Minimizing Coins",
+    "norm_name": "minimizing_coins",
+    "url": "https://cses.fi/problemset/task/1634",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 50167,
+      "attempted_by": 54149,
+      "success_rate": 92.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 18
+  },
+  {
+    "id": "1635",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Coin Combinations I",
+    "norm_name": "coin_combinations_i",
+    "url": "https://cses.fi/problemset/task/1635",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 45912,
+      "attempted_by": 49990,
+      "success_rate": 91.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1636",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Coin Combinations II",
+    "norm_name": "coin_combinations_ii",
+    "url": "https://cses.fi/problemset/task/1636",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 38600,
+      "attempted_by": 44161,
+      "success_rate": 87.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "1637",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Removing Digits",
+    "norm_name": "removing_digits",
+    "url": "https://cses.fi/problemset/task/1637",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 42771,
+      "attempted_by": 43775,
+      "success_rate": 97.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "1638",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Grid Paths",
+    "norm_name": "grid_paths",
+    "url": "https://cses.fi/problemset/task/1638",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 40669,
+      "attempted_by": 41972,
+      "success_rate": 96.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "1158",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Book Shop",
+    "norm_name": "book_shop",
+    "url": "https://cses.fi/problemset/task/1158",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 35903,
+      "attempted_by": 39963,
+      "success_rate": 89.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "1746",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Array Description",
+    "norm_name": "array_description",
+    "url": "https://cses.fi/problemset/task/1746",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 26127,
+      "attempted_by": 29363,
+      "success_rate": 88.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 29
+  },
+  {
+    "id": "2413",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Counting Towers",
+    "norm_name": "counting_towers",
+    "url": "https://cses.fi/problemset/task/2413",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 15399,
+      "attempted_by": 16355,
+      "success_rate": 94.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 4
+  },
+  {
+    "id": "1639",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Edit Distance",
+    "norm_name": "edit_distance",
+    "url": "https://cses.fi/problemset/task/1639",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 26769,
+      "attempted_by": 28379,
+      "success_rate": 94.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 17
+  },
+  {
+    "id": "1744",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Rectangle Cutting",
+    "norm_name": "rectangle_cutting",
+    "url": "https://cses.fi/problemset/task/1744",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 22302,
+      "attempted_by": 24415,
+      "success_rate": 91.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 27
+  },
+  {
+    "id": "1745",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Money Sums",
+    "norm_name": "money_sums",
+    "url": "https://cses.fi/problemset/task/1745",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 26664,
+      "attempted_by": 27808,
+      "success_rate": 95.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1097",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Removal Game",
+    "norm_name": "removal_game",
+    "url": "https://cses.fi/problemset/task/1097",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 19349,
+      "attempted_by": 21413,
+      "success_rate": 90.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "1093",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Two Sets II",
+    "norm_name": "two_sets_ii",
+    "url": "https://cses.fi/problemset/task/1093",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 21038,
+      "attempted_by": 22904,
+      "success_rate": 91.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 24
+  },
+  {
+    "id": "1145",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Increasing Subsequence",
+    "norm_name": "increasing_subsequence",
+    "url": "https://cses.fi/problemset/task/1145",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 21656,
+      "attempted_by": 24481,
+      "success_rate": 88.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 19
+  },
+  {
+    "id": "1140",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Projects",
+    "norm_name": "projects",
+    "url": "https://cses.fi/problemset/task/1140",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 14643,
+      "attempted_by": 16548,
+      "success_rate": 88.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "1653",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Elevator Rides",
+    "norm_name": "elevator_rides",
+    "url": "https://cses.fi/problemset/task/1653",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 9080,
+      "attempted_by": 11633,
+      "success_rate": 78.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 39
+  },
+  {
+    "id": "2181",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Counting Tilings",
+    "norm_name": "counting_tilings",
+    "url": "https://cses.fi/problemset/task/2181",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 5215,
+      "attempted_by": 5735,
+      "success_rate": 90.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "2220",
+    "category": "Dynamic Programming",
+    "norm_category": "dynamic_programming",
+    "name": "Counting Numbers",
+    "norm_name": "counting_numbers",
+    "url": "https://cses.fi/problemset/task/2220",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 6986,
+      "attempted_by": 8024,
+      "success_rate": 87.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 16
+  },
+  {
+    "id": "1192",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Counting Rooms",
+    "norm_name": "counting_rooms",
+    "url": "https://cses.fi/problemset/task/1192",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 39588,
+      "attempted_by": 41915,
+      "success_rate": 94.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 19
+  },
+  {
+    "id": "1193",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Labyrinth",
+    "norm_name": "labyrinth",
+    "url": "https://cses.fi/problemset/task/1193",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 26507,
+      "attempted_by": 32690,
+      "success_rate": 81.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 17
+  },
+  {
+    "id": "1666",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Building Roads",
+    "norm_name": "building_roads",
+    "url": "https://cses.fi/problemset/task/1666",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 34505,
+      "attempted_by": 35880,
+      "success_rate": 96.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1667",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Message Route",
+    "norm_name": "message_route",
+    "url": "https://cses.fi/problemset/task/1667",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 29372,
+      "attempted_by": 30706,
+      "success_rate": 95.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1668",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Building Teams",
+    "norm_name": "building_teams",
+    "url": "https://cses.fi/problemset/task/1668",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 27715,
+      "attempted_by": 29556,
+      "success_rate": 93.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1669",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Round Trip",
+    "norm_name": "round_trip",
+    "url": "https://cses.fi/problemset/task/1669",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 21927,
+      "attempted_by": 24152,
+      "success_rate": 90.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 26
+  },
+  {
+    "id": "1194",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Monsters",
+    "norm_name": "monsters",
+    "url": "https://cses.fi/problemset/task/1194",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 14280,
+      "attempted_by": 17377,
+      "success_rate": 82.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 28
+  },
+  {
+    "id": "1671",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Shortest Routes I",
+    "norm_name": "shortest_routes_i",
+    "url": "https://cses.fi/problemset/task/1671",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 23700,
+      "attempted_by": 26736,
+      "success_rate": 88.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 24
+  },
+  {
+    "id": "1672",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Shortest Routes II",
+    "norm_name": "shortest_routes_ii",
+    "url": "https://cses.fi/problemset/task/1672",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 19104,
+      "attempted_by": 21859,
+      "success_rate": 87.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 16
+  },
+  {
+    "id": "1673",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "High Score",
+    "norm_name": "high_score",
+    "url": "https://cses.fi/problemset/task/1673",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 10774,
+      "attempted_by": 16599,
+      "success_rate": 64.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 44
+  },
+  {
+    "id": "1195",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Flight Discount",
+    "norm_name": "flight_discount",
+    "url": "https://cses.fi/problemset/task/1195",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 14532,
+      "attempted_by": 17512,
+      "success_rate": 82.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 24
+  },
+  {
+    "id": "1197",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Cycle Finding",
+    "norm_name": "cycle_finding",
+    "url": "https://cses.fi/problemset/task/1197",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 10412,
+      "attempted_by": 13147,
+      "success_rate": 79.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 27
+  },
+  {
+    "id": "1196",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Flight Routes",
+    "norm_name": "flight_routes",
+    "url": "https://cses.fi/problemset/task/1196",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 9999,
+      "attempted_by": 11247,
+      "success_rate": 88.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 17
+  },
+  {
+    "id": "1678",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Round Trip II",
+    "norm_name": "round_trip_ii",
+    "url": "https://cses.fi/problemset/task/1678",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 11760,
+      "attempted_by": 13444,
+      "success_rate": 87.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 23
+  },
+  {
+    "id": "1679",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Course Schedule",
+    "norm_name": "course_schedule",
+    "url": "https://cses.fi/problemset/task/1679",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 15643,
+      "attempted_by": 16800,
+      "success_rate": 93.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 17
+  },
+  {
+    "id": "1680",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Longest Flight Route",
+    "norm_name": "longest_flight_route",
+    "url": "https://cses.fi/problemset/task/1680",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 10392,
+      "attempted_by": 13564,
+      "success_rate": 76.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 25
+  },
+  {
+    "id": "1681",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Game Routes",
+    "norm_name": "game_routes",
+    "url": "https://cses.fi/problemset/task/1681",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 11975,
+      "attempted_by": 13035,
+      "success_rate": 91.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "1202",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Investigation",
+    "norm_name": "investigation",
+    "url": "https://cses.fi/problemset/task/1202",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 8822,
+      "attempted_by": 9554,
+      "success_rate": 92.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "1750",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Planets Queries I",
+    "norm_name": "planets_queries_i",
+    "url": "https://cses.fi/problemset/task/1750",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 7654,
+      "attempted_by": 9162,
+      "success_rate": 83.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1160",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Planets Queries II",
+    "norm_name": "planets_queries_ii",
+    "url": "https://cses.fi/problemset/task/1160",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2809,
+      "attempted_by": 3549,
+      "success_rate": 79.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "1751",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Planets Cycles",
+    "norm_name": "planets_cycles",
+    "url": "https://cses.fi/problemset/task/1751",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 4808,
+      "attempted_by": 5415,
+      "success_rate": 88.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "1675",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Road Reparation",
+    "norm_name": "road_reparation",
+    "url": "https://cses.fi/problemset/task/1675",
+    "time_limit": "1.00",
+    "memory_limit": "128",
+    "statistics": {
+      "solved_by": 11849,
+      "attempted_by": 12428,
+      "success_rate": 95.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 16
+  },
+  {
+    "id": "1676",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Road Construction",
+    "norm_name": "road_construction",
+    "url": "https://cses.fi/problemset/task/1676",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 12607,
+      "attempted_by": 13079,
+      "success_rate": 96.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "1682",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Flight Routes Check",
+    "norm_name": "flight_routes_check",
+    "url": "https://cses.fi/problemset/task/1682",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 10551,
+      "attempted_by": 11570,
+      "success_rate": 91.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 20
+  },
+  {
+    "id": "1683",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Planets and Kingdoms",
+    "norm_name": "planets_and_kingdoms",
+    "url": "https://cses.fi/problemset/task/1683",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 8470,
+      "attempted_by": 8800,
+      "success_rate": 96.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "1684",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Giant Pizza",
+    "norm_name": "giant_pizza",
+    "url": "https://cses.fi/problemset/task/1684",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 3491,
+      "attempted_by": 3895,
+      "success_rate": 89.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 22
+  },
+  {
+    "id": "1686",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Coin Collector",
+    "norm_name": "coin_collector",
+    "url": "https://cses.fi/problemset/task/1686",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 5373,
+      "attempted_by": 6062,
+      "success_rate": 88.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "1691",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Mail Delivery",
+    "norm_name": "mail_delivery",
+    "url": "https://cses.fi/problemset/task/1691",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 4616,
+      "attempted_by": 5100,
+      "success_rate": 90.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 16
+  },
+  {
+    "id": "1692",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "De Bruijn Sequence",
+    "norm_name": "de_bruijn_sequence",
+    "url": "https://cses.fi/problemset/task/1692",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2429,
+      "attempted_by": 2552,
+      "success_rate": 95.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "1693",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Teleporters Path",
+    "norm_name": "teleporters_path",
+    "url": "https://cses.fi/problemset/task/1693",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 3453,
+      "attempted_by": 4071,
+      "success_rate": 84.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 21
+  },
+  {
+    "id": "1690",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Hamiltonian Flights",
+    "norm_name": "hamiltonian_flights",
+    "url": "https://cses.fi/problemset/task/1690",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 5149,
+      "attempted_by": 5886,
+      "success_rate": 87.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 20
+  },
+  {
+    "id": "1689",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Knight's Tour",
+    "norm_name": "knights_tour",
+    "url": "https://cses.fi/problemset/task/1689",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1979,
+      "attempted_by": 2428,
+      "success_rate": 81.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 26
+  },
+  {
+    "id": "1694",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Download Speed",
+    "norm_name": "download_speed",
+    "url": "https://cses.fi/problemset/task/1694",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 3592,
+      "attempted_by": 4866,
+      "success_rate": 73.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 25
+  },
+  {
+    "id": "1695",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Police Chase",
+    "norm_name": "police_chase",
+    "url": "https://cses.fi/problemset/task/1695",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2771,
+      "attempted_by": 3155,
+      "success_rate": 87.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "1696",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "School Dance",
+    "norm_name": "school_dance",
+    "url": "https://cses.fi/problemset/task/1696",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 3090,
+      "attempted_by": 3296,
+      "success_rate": 93.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "1711",
+    "category": "Graph Algorithms",
+    "norm_category": "graph_algorithms",
+    "name": "Distinct Routes",
+    "norm_name": "distinct_routes",
+    "url": "https://cses.fi/problemset/task/1711",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2021,
+      "attempted_by": 2746,
+      "success_rate": 73.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 18
+  },
+  {
+    "id": "1646",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Static Range Sum Queries",
+    "norm_name": "static_range_sum_queries",
+    "url": "https://cses.fi/problemset/task/1646",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 27330,
+      "attempted_by": 28582,
+      "success_rate": 95.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 2
+  },
+  {
+    "id": "1647",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Static Range Minimum Queries",
+    "norm_name": "static_range_minimum_queries",
+    "url": "https://cses.fi/problemset/task/1647",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 19778,
+      "attempted_by": 21219,
+      "success_rate": 93.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "1648",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Dynamic Range Sum Queries",
+    "norm_name": "dynamic_range_sum_queries",
+    "url": "https://cses.fi/problemset/task/1648",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 20478,
+      "attempted_by": 21417,
+      "success_rate": 95.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 2
+  },
+  {
+    "id": "1649",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Dynamic Range Minimum Queries",
+    "norm_name": "dynamic_range_minimum_queries",
+    "url": "https://cses.fi/problemset/task/1649",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 18760,
+      "attempted_by": 19226,
+      "success_rate": 97.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 2
+  },
+  {
+    "id": "1650",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Range Xor Queries",
+    "norm_name": "range_xor_queries",
+    "url": "https://cses.fi/problemset/task/1650",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 19282,
+      "attempted_by": 19559,
+      "success_rate": 98.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 2
+  },
+  {
+    "id": "1651",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Range Update Queries",
+    "norm_name": "range_update_queries",
+    "url": "https://cses.fi/problemset/task/1651",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 15192,
+      "attempted_by": 16407,
+      "success_rate": 92.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 4
+  },
+  {
+    "id": "1652",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Forest Queries",
+    "norm_name": "forest_queries",
+    "url": "https://cses.fi/problemset/task/1652",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 15093,
+      "attempted_by": 15692,
+      "success_rate": 96.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 3
+  },
+  {
+    "id": "1143",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Hotel Queries",
+    "norm_name": "hotel_queries",
+    "url": "https://cses.fi/problemset/task/1143",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 10823,
+      "attempted_by": 11610,
+      "success_rate": 93.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1749",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "List Removals",
+    "norm_name": "list_removals",
+    "url": "https://cses.fi/problemset/task/1749",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 9042,
+      "attempted_by": 9543,
+      "success_rate": 94.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 9
+  },
+  {
+    "id": "1144",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Salary Queries",
+    "norm_name": "salary_queries",
+    "url": "https://cses.fi/problemset/task/1144",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 6807,
+      "attempted_by": 8331,
+      "success_rate": 81.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "2166",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Prefix Sum Queries",
+    "norm_name": "prefix_sum_queries",
+    "url": "https://cses.fi/problemset/task/2166",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 5562,
+      "attempted_by": 6097,
+      "success_rate": 91.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "2206",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Pizzeria Queries",
+    "norm_name": "pizzeria_queries",
+    "url": "https://cses.fi/problemset/task/2206",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 4502,
+      "attempted_by": 4680,
+      "success_rate": 96.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 4
+  },
+  {
+    "id": "1190",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Subarray Sum Queries",
+    "norm_name": "subarray_sum_queries",
+    "url": "https://cses.fi/problemset/task/1190",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 5674,
+      "attempted_by": 6241,
+      "success_rate": 90.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "1734",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Distinct Values Queries",
+    "norm_name": "distinct_values_queries",
+    "url": "https://cses.fi/problemset/task/1734",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 5261,
+      "attempted_by": 6388,
+      "success_rate": 82.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "2416",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Increasing Array Queries",
+    "norm_name": "increasing_array_queries",
+    "url": "https://cses.fi/problemset/task/2416",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1931,
+      "attempted_by": 2214,
+      "success_rate": 87.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "1739",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Forest Queries II",
+    "norm_name": "forest_queries_ii",
+    "url": "https://cses.fi/problemset/task/1739",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 3498,
+      "attempted_by": 3795,
+      "success_rate": 92.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 5
+  },
+  {
+    "id": "1735",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Range Updates and Sums",
+    "norm_name": "range_updates_and_sums",
+    "url": "https://cses.fi/problemset/task/1735",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 4412,
+      "attempted_by": 5365,
+      "success_rate": 82.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 4
+  },
+  {
+    "id": "1736",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Polynomial Queries",
+    "norm_name": "polynomial_queries",
+    "url": "https://cses.fi/problemset/task/1736",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 3294,
+      "attempted_by": 3873,
+      "success_rate": 85.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 3
+  },
+  {
+    "id": "1737",
+    "category": "Range Queries",
+    "norm_category": "range_queries",
+    "name": "Range Queries and Copies",
+    "norm_name": "range_queries_and_copies",
+    "url": "https://cses.fi/problemset/task/1737",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2316,
+      "attempted_by": 2504,
+      "success_rate": 92.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 7
+  },
+  {
+    "id": "1674",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Subordinates",
+    "norm_name": "subordinates",
+    "url": "https://cses.fi/problemset/task/1674",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 22780,
+      "attempted_by": 24510,
+      "success_rate": 92.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1130",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Tree Matching",
+    "norm_name": "tree_matching",
+    "url": "https://cses.fi/problemset/task/1130",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 12718,
+      "attempted_by": 14980,
+      "success_rate": 84.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1131",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Tree Diameter",
+    "norm_name": "tree_diameter",
+    "url": "https://cses.fi/problemset/task/1131",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 18729,
+      "attempted_by": 19985,
+      "success_rate": 93.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 18
+  },
+  {
+    "id": "1132",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Tree Distances I",
+    "norm_name": "tree_distances_i",
+    "url": "https://cses.fi/problemset/task/1132",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 14005,
+      "attempted_by": 15154,
+      "success_rate": 92.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "1133",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Tree Distances II",
+    "norm_name": "tree_distances_ii",
+    "url": "https://cses.fi/problemset/task/1133",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 11549,
+      "attempted_by": 12054,
+      "success_rate": 95.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "1687",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Company Queries I",
+    "norm_name": "company_queries_i",
+    "url": "https://cses.fi/problemset/task/1687",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 12694,
+      "attempted_by": 13426,
+      "success_rate": 94.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1688",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Company Queries II",
+    "norm_name": "company_queries_ii",
+    "url": "https://cses.fi/problemset/task/1688",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 11885,
+      "attempted_by": 12529,
+      "success_rate": 94.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1135",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Distance Queries",
+    "norm_name": "distance_queries",
+    "url": "https://cses.fi/problemset/task/1135",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 10926,
+      "attempted_by": 11766,
+      "success_rate": 92.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1136",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Counting Paths",
+    "norm_name": "counting_paths",
+    "url": "https://cses.fi/problemset/task/1136",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 6640,
+      "attempted_by": 7107,
+      "success_rate": 93.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1137",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Subtree Queries",
+    "norm_name": "subtree_queries",
+    "url": "https://cses.fi/problemset/task/1137",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 8154,
+      "attempted_by": 8742,
+      "success_rate": 93.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1138",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Path Queries",
+    "norm_name": "path_queries",
+    "url": "https://cses.fi/problemset/task/1138",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 6508,
+      "attempted_by": 6890,
+      "success_rate": 94.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 11
+  },
+  {
+    "id": "2134",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Path Queries II",
+    "norm_name": "path_queries_ii",
+    "url": "https://cses.fi/problemset/task/2134",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2457,
+      "attempted_by": 3892,
+      "success_rate": 63.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "1139",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Distinct Colors",
+    "norm_name": "distinct_colors",
+    "url": "https://cses.fi/problemset/task/1139",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 6180,
+      "attempted_by": 6891,
+      "success_rate": 89.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "2079",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Finding a Centroid",
+    "norm_name": "finding_a_centroid",
+    "url": "https://cses.fi/problemset/task/2079",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 5103,
+      "attempted_by": 5326,
+      "success_rate": 95.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 16
+  },
+  {
+    "id": "2080",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Fixed-Length Paths I",
+    "norm_name": "fixed-length_paths_i",
+    "url": "https://cses.fi/problemset/task/2080",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2284,
+      "attempted_by": 3098,
+      "success_rate": 73.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 21
+  },
+  {
+    "id": "2081",
+    "category": "Tree Algorithms",
+    "norm_category": "tree_algorithms",
+    "name": "Fixed-Length Paths II",
+    "norm_name": "fixed-length_paths_ii",
+    "url": "https://cses.fi/problemset/task/2081",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 980,
+      "attempted_by": 2065,
+      "success_rate": 47.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 24
+  },
+  {
+    "id": "2164",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Josephus Queries",
+    "norm_name": "josephus_queries",
+    "url": "https://cses.fi/problemset/task/2164",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 3400,
+      "attempted_by": 4271,
+      "success_rate": 79.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 2
+  },
+  {
+    "id": "1095",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Exponentiation",
+    "norm_name": "exponentiation",
+    "url": "https://cses.fi/problemset/task/1095",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 18379,
+      "attempted_by": 19778,
+      "success_rate": 92.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 3
+  },
+  {
+    "id": "1712",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Exponentiation II",
+    "norm_name": "exponentiation_ii",
+    "url": "https://cses.fi/problemset/task/1712",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 13179,
+      "attempted_by": 16066,
+      "success_rate": 82.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1713",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Counting Divisors",
+    "norm_name": "counting_divisors",
+    "url": "https://cses.fi/problemset/task/1713",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 16608,
+      "attempted_by": 18911,
+      "success_rate": 87.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 16
+  },
+  {
+    "id": "1081",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Common Divisors",
+    "norm_name": "common_divisors",
+    "url": "https://cses.fi/problemset/task/1081",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 10968,
+      "attempted_by": 12970,
+      "success_rate": 84.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 18
+  },
+  {
+    "id": "1082",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Sum of Divisors",
+    "norm_name": "sum_of_divisors",
+    "url": "https://cses.fi/problemset/task/1082",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 6167,
+      "attempted_by": 9347,
+      "success_rate": 65.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 18
+  },
+  {
+    "id": "2182",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Divisor Analysis",
+    "norm_name": "divisor_analysis",
+    "url": "https://cses.fi/problemset/task/2182",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 4075,
+      "attempted_by": 5468,
+      "success_rate": 74.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 7
+  },
+  {
+    "id": "2185",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Prime Multiples",
+    "norm_name": "prime_multiples",
+    "url": "https://cses.fi/problemset/task/2185",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 4531,
+      "attempted_by": 5400,
+      "success_rate": 83.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "2417",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Counting Coprime Pairs",
+    "norm_name": "counting_coprime_pairs",
+    "url": "https://cses.fi/problemset/task/2417",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2948,
+      "attempted_by": 3486,
+      "success_rate": 84.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "1079",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Binomial Coefficients",
+    "norm_name": "binomial_coefficients",
+    "url": "https://cses.fi/problemset/task/1079",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 7527,
+      "attempted_by": 8479,
+      "success_rate": 88.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 11
+  },
+  {
+    "id": "1715",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Creating Strings II",
+    "norm_name": "creating_strings_ii",
+    "url": "https://cses.fi/problemset/task/1715",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 6447,
+      "attempted_by": 6866,
+      "success_rate": 93.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1716",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Distributing Apples",
+    "norm_name": "distributing_apples",
+    "url": "https://cses.fi/problemset/task/1716",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 6236,
+      "attempted_by": 6749,
+      "success_rate": 92.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1717",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Christmas Party",
+    "norm_name": "christmas_party",
+    "url": "https://cses.fi/problemset/task/1717",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 4791,
+      "attempted_by": 5188,
+      "success_rate": 92.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "2064",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Bracket Sequences I",
+    "norm_name": "bracket_sequences_i",
+    "url": "https://cses.fi/problemset/task/2064",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 3394,
+      "attempted_by": 3747,
+      "success_rate": 90.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 17
+  },
+  {
+    "id": "2187",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Bracket Sequences II",
+    "norm_name": "bracket_sequences_ii",
+    "url": "https://cses.fi/problemset/task/2187",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1748,
+      "attempted_by": 2026,
+      "success_rate": 86.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 11
+  },
+  {
+    "id": "2209",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Counting Necklaces",
+    "norm_name": "counting_necklaces",
+    "url": "https://cses.fi/problemset/task/2209",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1621,
+      "attempted_by": 1769,
+      "success_rate": 91.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "2210",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Counting Grids",
+    "norm_name": "counting_grids",
+    "url": "https://cses.fi/problemset/task/2210",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1308,
+      "attempted_by": 1403,
+      "success_rate": 93.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1722",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Fibonacci Numbers",
+    "norm_name": "fibonacci_numbers",
+    "url": "https://cses.fi/problemset/task/1722",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 5419,
+      "attempted_by": 6900,
+      "success_rate": 78.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1096",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Throwing Dice",
+    "norm_name": "throwing_dice",
+    "url": "https://cses.fi/problemset/task/1096",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2890,
+      "attempted_by": 3146,
+      "success_rate": 91.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 32
+  },
+  {
+    "id": "1723",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Graph Paths I",
+    "norm_name": "graph_paths_i",
+    "url": "https://cses.fi/problemset/task/1723",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2669,
+      "attempted_by": 2883,
+      "success_rate": 92.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "1724",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Graph Paths II",
+    "norm_name": "graph_paths_ii",
+    "url": "https://cses.fi/problemset/task/1724",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2231,
+      "attempted_by": 2337,
+      "success_rate": 95.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "1725",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Dice Probability",
+    "norm_name": "dice_probability",
+    "url": "https://cses.fi/problemset/task/1725",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2485,
+      "attempted_by": 2677,
+      "success_rate": 92.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 21
+  },
+  {
+    "id": "1726",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Moving Robots",
+    "norm_name": "moving_robots",
+    "url": "https://cses.fi/problemset/task/1726",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1270,
+      "attempted_by": 1356,
+      "success_rate": 93.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 16
+  },
+  {
+    "id": "1727",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Candy Lottery",
+    "norm_name": "candy_lottery",
+    "url": "https://cses.fi/problemset/task/1727",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 940,
+      "attempted_by": 2164,
+      "success_rate": 43.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 18
+  },
+  {
+    "id": "1728",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Inversion Probability",
+    "norm_name": "inversion_probability",
+    "url": "https://cses.fi/problemset/task/1728",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 261,
+      "attempted_by": 1770,
+      "success_rate": 14.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 22
+  },
+  {
+    "id": "1729",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Stick Game",
+    "norm_name": "stick_game",
+    "url": "https://cses.fi/problemset/task/1729",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2713,
+      "attempted_by": 2778,
+      "success_rate": 97.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "1730",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Nim Game I",
+    "norm_name": "nim_game_i",
+    "url": "https://cses.fi/problemset/task/1730",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 3564,
+      "attempted_by": 3707,
+      "success_rate": 96.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 4
+  },
+  {
+    "id": "1098",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Nim Game II",
+    "norm_name": "nim_game_ii",
+    "url": "https://cses.fi/problemset/task/1098",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2875,
+      "attempted_by": 3000,
+      "success_rate": 95.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 4
+  },
+  {
+    "id": "1099",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Stair Game",
+    "norm_name": "stair_game",
+    "url": "https://cses.fi/problemset/task/1099",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1975,
+      "attempted_by": 2151,
+      "success_rate": 91.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 7
+  },
+  {
+    "id": "2207",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Grundy's Game",
+    "norm_name": "grundys_game",
+    "url": "https://cses.fi/problemset/task/2207",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1273,
+      "attempted_by": 1647,
+      "success_rate": 77.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 3
+  },
+  {
+    "id": "2208",
+    "category": "Mathematics",
+    "norm_category": "mathematics",
+    "name": "Another Game",
+    "norm_name": "another_game",
+    "url": "https://cses.fi/problemset/task/2208",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1481,
+      "attempted_by": 1608,
+      "success_rate": 92.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 3
+  },
+  {
+    "id": "1731",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "Word Combinations",
+    "norm_name": "word_combinations",
+    "url": "https://cses.fi/problemset/task/1731",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 4263,
+      "attempted_by": 6395,
+      "success_rate": 66.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "1753",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "String Matching",
+    "norm_name": "string_matching",
+    "url": "https://cses.fi/problemset/task/1753",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 8464,
+      "attempted_by": 11723,
+      "success_rate": 72.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 39
+  },
+  {
+    "id": "1732",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "Finding Borders",
+    "norm_name": "finding_borders",
+    "url": "https://cses.fi/problemset/task/1732",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 6219,
+      "attempted_by": 6878,
+      "success_rate": 90.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 11
+  },
+  {
+    "id": "1733",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "Finding Periods",
+    "norm_name": "finding_periods",
+    "url": "https://cses.fi/problemset/task/1733",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 4367,
+      "attempted_by": 4974,
+      "success_rate": 87.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "1110",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "Minimal Rotation",
+    "norm_name": "minimal_rotation",
+    "url": "https://cses.fi/problemset/task/1110",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2116,
+      "attempted_by": 3373,
+      "success_rate": 62.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 21
+  },
+  {
+    "id": "1111",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "Longest Palindrome",
+    "norm_name": "longest_palindrome",
+    "url": "https://cses.fi/problemset/task/1111",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 3225,
+      "attempted_by": 4383,
+      "success_rate": 73.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 20
+  },
+  {
+    "id": "1112",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "Required Substring",
+    "norm_name": "required_substring",
+    "url": "https://cses.fi/problemset/task/1112",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1211,
+      "attempted_by": 1942,
+      "success_rate": 62.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 19
+  },
+  {
+    "id": "2420",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "Palindrome Queries",
+    "norm_name": "palindrome_queries",
+    "url": "https://cses.fi/problemset/task/2420",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1540,
+      "attempted_by": 1819,
+      "success_rate": 84.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "2102",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "Finding Patterns",
+    "norm_name": "finding_patterns",
+    "url": "https://cses.fi/problemset/task/2102",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1380,
+      "attempted_by": 2001,
+      "success_rate": 68.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 18
+  },
+  {
+    "id": "2103",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "Counting Patterns",
+    "norm_name": "counting_patterns",
+    "url": "https://cses.fi/problemset/task/2103",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1294,
+      "attempted_by": 1643,
+      "success_rate": 78.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 11
+  },
+  {
+    "id": "2104",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "Pattern Positions",
+    "norm_name": "pattern_positions",
+    "url": "https://cses.fi/problemset/task/2104",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1095,
+      "attempted_by": 1366,
+      "success_rate": 80.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "2105",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "Distinct Substrings",
+    "norm_name": "distinct_substrings",
+    "url": "https://cses.fi/problemset/task/2105",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1290,
+      "attempted_by": 1556,
+      "success_rate": 82.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 7
+  },
+  {
+    "id": "2106",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "Repeating Substring",
+    "norm_name": "repeating_substring",
+    "url": "https://cses.fi/problemset/task/2106",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1392,
+      "attempted_by": 1571,
+      "success_rate": 88.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "2107",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "String Functions",
+    "norm_name": "string_functions",
+    "url": "https://cses.fi/problemset/task/2107",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1219,
+      "attempted_by": 1285,
+      "success_rate": 94.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 5
+  },
+  {
+    "id": "2108",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "Substring Order I",
+    "norm_name": "substring_order_i",
+    "url": "https://cses.fi/problemset/task/2108",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 893,
+      "attempted_by": 1004,
+      "success_rate": 88.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "2109",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "Substring Order II",
+    "norm_name": "substring_order_ii",
+    "url": "https://cses.fi/problemset/task/2109",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 573,
+      "attempted_by": 742,
+      "success_rate": 77.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 9
+  },
+  {
+    "id": "2110",
+    "category": "String Algorithms",
+    "norm_category": "string_algorithms",
+    "name": "Substring Distribution",
+    "norm_name": "substring_distribution",
+    "url": "https://cses.fi/problemset/task/2110",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 815,
+      "attempted_by": 890,
+      "success_rate": 91.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 9
+  },
+  {
+    "id": "2189",
+    "category": "Geometry",
+    "norm_category": "geometry",
+    "name": "Point Location Test",
+    "norm_name": "point_location_test",
+    "url": "https://cses.fi/problemset/task/2189",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 5401,
+      "attempted_by": 6118,
+      "success_rate": 88.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "2190",
+    "category": "Geometry",
+    "norm_category": "geometry",
+    "name": "Line Segment Intersection",
+    "norm_name": "line_segment_intersection",
+    "url": "https://cses.fi/problemset/task/2190",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 3257,
+      "attempted_by": 4202,
+      "success_rate": 77.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "2191",
+    "category": "Geometry",
+    "norm_category": "geometry",
+    "name": "Polygon Area",
+    "norm_name": "polygon_area",
+    "url": "https://cses.fi/problemset/task/2191",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 3843,
+      "attempted_by": 4112,
+      "success_rate": 93.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 5
+  },
+  {
+    "id": "2192",
+    "category": "Geometry",
+    "norm_category": "geometry",
+    "name": "Point in Polygon",
+    "norm_name": "point_in_polygon",
+    "url": "https://cses.fi/problemset/task/2192",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2040,
+      "attempted_by": 2670,
+      "success_rate": 76.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "2193",
+    "category": "Geometry",
+    "norm_category": "geometry",
+    "name": "Polygon Lattice Points",
+    "norm_name": "polygon_lattice_points",
+    "url": "https://cses.fi/problemset/task/2193",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1779,
+      "attempted_by": 1853,
+      "success_rate": 96.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 5
+  },
+  {
+    "id": "2194",
+    "category": "Geometry",
+    "norm_category": "geometry",
+    "name": "Minimum Euclidean Distance",
+    "norm_name": "minimum_euclidean_distance",
+    "url": "https://cses.fi/problemset/task/2194",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1518,
+      "attempted_by": 2208,
+      "success_rate": 68.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 30
+  },
+  {
+    "id": "2195",
+    "category": "Geometry",
+    "norm_category": "geometry",
+    "name": "Convex Hull",
+    "norm_name": "convex_hull",
+    "url": "https://cses.fi/problemset/task/2195",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2619,
+      "attempted_by": 3156,
+      "success_rate": 82.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 9
+  },
+  {
+    "id": "1628",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Meet in the Middle",
+    "norm_name": "meet_in_the_middle",
+    "url": "https://cses.fi/problemset/task/1628",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 4855,
+      "attempted_by": 7153,
+      "success_rate": 67.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 40
+  },
+  {
+    "id": "2136",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Hamming Distance",
+    "norm_name": "hamming_distance",
+    "url": "https://cses.fi/problemset/task/2136",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2499,
+      "attempted_by": 2717,
+      "success_rate": 91.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 20
+  },
+  {
+    "id": "2137",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Beautiful Subgrids",
+    "norm_name": "beautiful_subgrids",
+    "url": "https://cses.fi/problemset/task/2137",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1778,
+      "attempted_by": 1991,
+      "success_rate": 89.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "2138",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Reachable Nodes",
+    "norm_name": "reachable_nodes",
+    "url": "https://cses.fi/problemset/task/2138",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1771,
+      "attempted_by": 1917,
+      "success_rate": 92.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 4
+  },
+  {
+    "id": "2143",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Reachability Queries",
+    "norm_name": "reachability_queries",
+    "url": "https://cses.fi/problemset/task/2143",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1191,
+      "attempted_by": 1426,
+      "success_rate": 83.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 7
+  },
+  {
+    "id": "2072",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Cut and Paste",
+    "norm_name": "cut_and_paste",
+    "url": "https://cses.fi/problemset/task/2072",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1163,
+      "attempted_by": 1300,
+      "success_rate": 89.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 7
+  },
+  {
+    "id": "2073",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Substring Reversals",
+    "norm_name": "substring_reversals",
+    "url": "https://cses.fi/problemset/task/2073",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1014,
+      "attempted_by": 1113,
+      "success_rate": 91.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 4
+  },
+  {
+    "id": "2074",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Reversals and Sums",
+    "norm_name": "reversals_and_sums",
+    "url": "https://cses.fi/problemset/task/2074",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1018,
+      "attempted_by": 1113,
+      "success_rate": 91.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 5
+  },
+  {
+    "id": "2076",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Necessary Roads",
+    "norm_name": "necessary_roads",
+    "url": "https://cses.fi/problemset/task/2076",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1516,
+      "attempted_by": 1558,
+      "success_rate": 97.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 5
+  },
+  {
+    "id": "2077",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Necessary Cities",
+    "norm_name": "necessary_cities",
+    "url": "https://cses.fi/problemset/task/2077",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1403,
+      "attempted_by": 1480,
+      "success_rate": 94.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "2078",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Eulerian Subgraphs",
+    "norm_name": "eulerian_subgraphs",
+    "url": "https://cses.fi/problemset/task/2078",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 619,
+      "attempted_by": 655,
+      "success_rate": 94.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 4
+  },
+  {
+    "id": "2084",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Monster Game I",
+    "norm_name": "monster_game_i",
+    "url": "https://cses.fi/problemset/task/2084",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 910,
+      "attempted_by": 1008,
+      "success_rate": 90.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 5
+  },
+  {
+    "id": "2085",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Monster Game II",
+    "norm_name": "monster_game_ii",
+    "url": "https://cses.fi/problemset/task/2085",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 812,
+      "attempted_by": 881,
+      "success_rate": 92.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "2086",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Subarray Squares",
+    "norm_name": "subarray_squares",
+    "url": "https://cses.fi/problemset/task/2086",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 998,
+      "attempted_by": 1185,
+      "success_rate": 84.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "2087",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Houses and Schools",
+    "norm_name": "houses_and_schools",
+    "url": "https://cses.fi/problemset/task/2087",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 592,
+      "attempted_by": 691,
+      "success_rate": 85.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "2088",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Knuth Division",
+    "norm_name": "knuth_division",
+    "url": "https://cses.fi/problemset/task/2088",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 693,
+      "attempted_by": 787,
+      "success_rate": 88.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 3
+  },
+  {
+    "id": "2111",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Apples and Bananas",
+    "norm_name": "apples_and_bananas",
+    "url": "https://cses.fi/problemset/task/2111",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 698,
+      "attempted_by": 770,
+      "success_rate": 90.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "2112",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "One Bit Positions",
+    "norm_name": "one_bit_positions",
+    "url": "https://cses.fi/problemset/task/2112",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 621,
+      "attempted_by": 689,
+      "success_rate": 90.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 5
+  },
+  {
+    "id": "2113",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Signal Processing",
+    "norm_name": "signal_processing",
+    "url": "https://cses.fi/problemset/task/2113",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 572,
+      "attempted_by": 622,
+      "success_rate": 91.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "2101",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "New Roads Queries",
+    "norm_name": "new_roads_queries",
+    "url": "https://cses.fi/problemset/task/2101",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1593,
+      "attempted_by": 1938,
+      "success_rate": 82.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 7
+  },
+  {
+    "id": "2133",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Dynamic Connectivity",
+    "norm_name": "dynamic_connectivity",
+    "url": "https://cses.fi/problemset/task/2133",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 726,
+      "attempted_by": 835,
+      "success_rate": 86.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 7
+  },
+  {
+    "id": "2121",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Parcel Delivery",
+    "norm_name": "parcel_delivery",
+    "url": "https://cses.fi/problemset/task/2121",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 550,
+      "attempted_by": 626,
+      "success_rate": 87.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "2129",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Task Assignment",
+    "norm_name": "task_assignment",
+    "url": "https://cses.fi/problemset/task/2129",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 610,
+      "attempted_by": 657,
+      "success_rate": 92.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "2130",
+    "category": "Advanced Techniques",
+    "norm_category": "advanced_techniques",
+    "name": "Distinct Routes II",
+    "norm_name": "distinct_routes_ii",
+    "url": "https://cses.fi/problemset/task/2130",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 426,
+      "attempted_by": 495,
+      "success_rate": 86.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "1087",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Shortest Subsequence",
+    "norm_name": "shortest_subsequence",
+    "url": "https://cses.fi/problemset/task/1087",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2349,
+      "attempted_by": 3127,
+      "success_rate": 75.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 5
+  },
+  {
+    "id": "1146",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Counting Bits",
+    "norm_name": "counting_bits",
+    "url": "https://cses.fi/problemset/task/1146",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2740,
+      "attempted_by": 3494,
+      "success_rate": 78.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 21
+  },
+  {
+    "id": "1670",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Swap Game",
+    "norm_name": "swap_game",
+    "url": "https://cses.fi/problemset/task/1670",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1590,
+      "attempted_by": 2029,
+      "success_rate": 78.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 19
+  },
+  {
+    "id": "1134",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Pr\u00fcfer Code",
+    "norm_name": "pr\u00fcfer_code",
+    "url": "https://cses.fi/problemset/task/1134",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1091,
+      "attempted_by": 1201,
+      "success_rate": 90.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 11
+  },
+  {
+    "id": "1756",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Acyclic Graph Edges",
+    "norm_name": "acyclic_graph_edges",
+    "url": "https://cses.fi/problemset/task/1756",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1692,
+      "attempted_by": 1800,
+      "success_rate": 94.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 4
+  },
+  {
+    "id": "2177",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Strongly Connected Edges",
+    "norm_name": "strongly_connected_edges",
+    "url": "https://cses.fi/problemset/task/2177",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1086,
+      "attempted_by": 1193,
+      "success_rate": 91.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 11
+  },
+  {
+    "id": "2179",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Even Outdegree Edges",
+    "norm_name": "even_outdegree_edges",
+    "url": "https://cses.fi/problemset/task/2179",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 997,
+      "attempted_by": 1168,
+      "success_rate": 85.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "2422",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Multiplication Table",
+    "norm_name": "multiplication_table",
+    "url": "https://cses.fi/problemset/task/2422",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 4508,
+      "attempted_by": 5083,
+      "success_rate": 88.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "1142",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Advertisement",
+    "norm_name": "advertisement",
+    "url": "https://cses.fi/problemset/task/1142",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 3251,
+      "attempted_by": 3452,
+      "success_rate": 94.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 11
+  },
+  {
+    "id": "2186",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Special Substrings",
+    "norm_name": "special_substrings",
+    "url": "https://cses.fi/problemset/task/2186",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 749,
+      "attempted_by": 822,
+      "success_rate": 91.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "2229",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Permutation Inversions",
+    "norm_name": "permutation_inversions",
+    "url": "https://cses.fi/problemset/task/2229",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 777,
+      "attempted_by": 858,
+      "success_rate": 90.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 16
+  },
+  {
+    "id": "1655",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Maximum Xor Subarray",
+    "norm_name": "maximum_xor_subarray",
+    "url": "https://cses.fi/problemset/task/1655",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1775,
+      "attempted_by": 1949,
+      "success_rate": 91.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "1664",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Movie Festival Queries",
+    "norm_name": "movie_festival_queries",
+    "url": "https://cses.fi/problemset/task/1664",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 779,
+      "attempted_by": 880,
+      "success_rate": 88.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 5
+  },
+  {
+    "id": "1697",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Chess Tournament",
+    "norm_name": "chess_tournament",
+    "url": "https://cses.fi/problemset/task/1697",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 859,
+      "attempted_by": 995,
+      "success_rate": 86.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 21
+  },
+  {
+    "id": "1702",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Tree Traversals",
+    "norm_name": "tree_traversals",
+    "url": "https://cses.fi/problemset/task/1702",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 843,
+      "attempted_by": 945,
+      "success_rate": 89.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1704",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Network Renovation",
+    "norm_name": "network_renovation",
+    "url": "https://cses.fi/problemset/task/1704",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 741,
+      "attempted_by": 984,
+      "success_rate": 75.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 21
+  },
+  {
+    "id": "1707",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Graph Girth",
+    "norm_name": "graph_girth",
+    "url": "https://cses.fi/problemset/task/1707",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2408,
+      "attempted_by": 2790,
+      "success_rate": 86.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 20
+  },
+  {
+    "id": "1740",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Intersection Points",
+    "norm_name": "intersection_points",
+    "url": "https://cses.fi/problemset/task/1740",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1437,
+      "attempted_by": 1552,
+      "success_rate": 92.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 5
+  },
+  {
+    "id": "2214",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Inverse Inversions",
+    "norm_name": "inverse_inversions",
+    "url": "https://cses.fi/problemset/task/2214",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 782,
+      "attempted_by": 823,
+      "success_rate": 95.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "2215",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Monotone Subsequences",
+    "norm_name": "monotone_subsequences",
+    "url": "https://cses.fi/problemset/task/2215",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 538,
+      "attempted_by": 603,
+      "success_rate": 89.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 2
+  },
+  {
+    "id": "1743",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "String Reorder",
+    "norm_name": "string_reorder",
+    "url": "https://cses.fi/problemset/task/1743",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 597,
+      "attempted_by": 660,
+      "success_rate": 90.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "2425",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Stack Weights",
+    "norm_name": "stack_weights",
+    "url": "https://cses.fi/problemset/task/2425",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 458,
+      "attempted_by": 541,
+      "success_rate": 84.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 5
+  },
+  {
+    "id": "1747",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Pyramid Array",
+    "norm_name": "pyramid_array",
+    "url": "https://cses.fi/problemset/task/1747",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 576,
+      "attempted_by": 694,
+      "success_rate": 83.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1748",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Increasing Subsequence II",
+    "norm_name": "increasing_subsequence_ii",
+    "url": "https://cses.fi/problemset/task/1748",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1829,
+      "attempted_by": 1975,
+      "success_rate": 92.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "1149",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "String Removals",
+    "norm_name": "string_removals",
+    "url": "https://cses.fi/problemset/task/1149",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 768,
+      "attempted_by": 830,
+      "success_rate": 92.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 7
+  },
+  {
+    "id": "1188",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Bit Inversions",
+    "norm_name": "bit_inversions",
+    "url": "https://cses.fi/problemset/task/1188",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1843,
+      "attempted_by": 2120,
+      "success_rate": 86.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "2419",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Xor Pyramid",
+    "norm_name": "xor_pyramid",
+    "url": "https://cses.fi/problemset/task/2419",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1198,
+      "attempted_by": 1514,
+      "success_rate": 79.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "1086",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Writing Numbers",
+    "norm_name": "writing_numbers",
+    "url": "https://cses.fi/problemset/task/1086",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 603,
+      "attempted_by": 655,
+      "success_rate": 92.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 21
+  },
+  {
+    "id": "1113",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "String Transform",
+    "norm_name": "string_transform",
+    "url": "https://cses.fi/problemset/task/1113",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 375,
+      "attempted_by": 470,
+      "success_rate": 79.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "2427",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Letter Pair Move Game",
+    "norm_name": "letter_pair_move_game",
+    "url": "https://cses.fi/problemset/task/2427",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 144,
+      "attempted_by": 211,
+      "success_rate": 68.2
+    },
+    "num_examples": 2,
+    "num_test_cases": 24
+  },
+  {
+    "id": "1147",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Maximum Building I",
+    "norm_name": "maximum_building_i",
+    "url": "https://cses.fi/problemset/task/1147",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1654,
+      "attempted_by": 1728,
+      "success_rate": 95.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1162",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Sorting Methods",
+    "norm_name": "sorting_methods",
+    "url": "https://cses.fi/problemset/task/1162",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 635,
+      "attempted_by": 681,
+      "success_rate": 93.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "1191",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Cyclic Array",
+    "norm_name": "cyclic_array",
+    "url": "https://cses.fi/problemset/task/1191",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 857,
+      "attempted_by": 981,
+      "success_rate": 87.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 22
+  },
+  {
+    "id": "2414",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "List of Sums",
+    "norm_name": "list_of_sums",
+    "url": "https://cses.fi/problemset/task/2414",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 356,
+      "attempted_by": 472,
+      "success_rate": 75.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "2132",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Increasing Array II",
+    "norm_name": "increasing_array_ii",
+    "url": "https://cses.fi/problemset/task/2132",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 615,
+      "attempted_by": 711,
+      "success_rate": 86.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 7
+  },
+  {
+    "id": "1189",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Food Division",
+    "norm_name": "food_division",
+    "url": "https://cses.fi/problemset/task/1189",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 425,
+      "attempted_by": 502,
+      "success_rate": 84.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 5
+  },
+  {
+    "id": "1654",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Bit Problem",
+    "norm_name": "bit_problem",
+    "url": "https://cses.fi/problemset/task/1654",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1311,
+      "attempted_by": 1411,
+      "success_rate": 92.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 2
+  },
+  {
+    "id": "1698",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Swap Round Sorting",
+    "norm_name": "swap_round_sorting",
+    "url": "https://cses.fi/problemset/task/1698",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 335,
+      "attempted_by": 415,
+      "success_rate": 80.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "2430",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Binary Subsequences",
+    "norm_name": "binary_subsequences",
+    "url": "https://cses.fi/problemset/task/2430",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 200,
+      "attempted_by": 306,
+      "success_rate": 65.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1700",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Tree Isomorphism I",
+    "norm_name": "tree_isomorphism_i",
+    "url": "https://cses.fi/problemset/task/1700",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 840,
+      "attempted_by": 971,
+      "success_rate": 86.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 16
+  },
+  {
+    "id": "2228",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Counting Sequences",
+    "norm_name": "counting_sequences",
+    "url": "https://cses.fi/problemset/task/2228",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 473,
+      "attempted_by": 513,
+      "success_rate": 92.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 11
+  },
+  {
+    "id": "1703",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Critical Cities",
+    "norm_name": "critical_cities",
+    "url": "https://cses.fi/problemset/task/1703",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 310,
+      "attempted_by": 483,
+      "success_rate": 64.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "1706",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "School Excursion",
+    "norm_name": "school_excursion",
+    "url": "https://cses.fi/problemset/task/1706",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1049,
+      "attempted_by": 1120,
+      "success_rate": 93.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1709",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Coin Grid",
+    "norm_name": "coin_grid",
+    "url": "https://cses.fi/problemset/task/1709",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 603,
+      "attempted_by": 723,
+      "success_rate": 83.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "1742",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Robot Path",
+    "norm_name": "robot_path",
+    "url": "https://cses.fi/problemset/task/1742",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 236,
+      "attempted_by": 400,
+      "success_rate": 59.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 35
+  },
+  {
+    "id": "2426",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Programmers and Artists",
+    "norm_name": "programmers_and_artists",
+    "url": "https://cses.fi/problemset/task/2426",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 401,
+      "attempted_by": 519,
+      "success_rate": 77.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 11
+  },
+  {
+    "id": "1757",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Course Schedule II",
+    "norm_name": "course_schedule_ii",
+    "url": "https://cses.fi/problemset/task/1757",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1266,
+      "attempted_by": 1798,
+      "success_rate": 70.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "2174",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Removing Digits II",
+    "norm_name": "removing_digits_ii",
+    "url": "https://cses.fi/problemset/task/2174",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 158,
+      "attempted_by": 341,
+      "success_rate": 46.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 9
+  },
+  {
+    "id": "2180",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Coin Arrangement",
+    "norm_name": "coin_arrangement",
+    "url": "https://cses.fi/problemset/task/2180",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 250,
+      "attempted_by": 332,
+      "success_rate": 75.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "2176",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Counting Bishops",
+    "norm_name": "counting_bishops",
+    "url": "https://cses.fi/problemset/task/2176",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 274,
+      "attempted_by": 311,
+      "success_rate": 88.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "2432",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Grid Puzzle I",
+    "norm_name": "grid_puzzle_i",
+    "url": "https://cses.fi/problemset/task/2432",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 393,
+      "attempted_by": 434,
+      "success_rate": 90.5
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "2131",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Grid Puzzle II",
+    "norm_name": "grid_puzzle_ii",
+    "url": "https://cses.fi/problemset/task/2131",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 325,
+      "attempted_by": 365,
+      "success_rate": 89.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "1080",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Empty String",
+    "norm_name": "empty_string",
+    "url": "https://cses.fi/problemset/task/1080",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1175,
+      "attempted_by": 1420,
+      "success_rate": 82.7
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "1078",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Grid Paths",
+    "norm_name": "grid_paths",
+    "url": "https://cses.fi/problemset/task/1078",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 586,
+      "attempted_by": 732,
+      "success_rate": 80.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "2115",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Bit Substrings",
+    "norm_name": "bit_substrings",
+    "url": "https://cses.fi/problemset/task/2115",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 277,
+      "attempted_by": 345,
+      "success_rate": 80.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "2075",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Reversal Sorting",
+    "norm_name": "reversal_sorting",
+    "url": "https://cses.fi/problemset/task/2075",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 262,
+      "attempted_by": 322,
+      "success_rate": 81.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 12
+  },
+  {
+    "id": "2421",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Counting Reorders",
+    "norm_name": "counting_reorders",
+    "url": "https://cses.fi/problemset/task/2421",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 150,
+      "attempted_by": 233,
+      "success_rate": 64.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 9
+  },
+  {
+    "id": "1159",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Book Shop II",
+    "norm_name": "book_shop_ii",
+    "url": "https://cses.fi/problemset/task/1159",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 820,
+      "attempted_by": 952,
+      "success_rate": 86.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 10
+  },
+  {
+    "id": "1677",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Network Breakdown",
+    "norm_name": "network_breakdown",
+    "url": "https://cses.fi/problemset/task/1677",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 717,
+      "attempted_by": 762,
+      "success_rate": 94.0
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "1203",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Visiting Cities",
+    "norm_name": "visiting_cities",
+    "url": "https://cses.fi/problemset/task/1203",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 526,
+      "attempted_by": 699,
+      "success_rate": 75.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "2184",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Missing Coin Sum Queries",
+    "norm_name": "missing_coin_sum_queries",
+    "url": "https://cses.fi/problemset/task/2184",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 306,
+      "attempted_by": 410,
+      "success_rate": 74.6
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "1157",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Number Grid",
+    "norm_name": "number_grid",
+    "url": "https://cses.fi/problemset/task/1157",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 661,
+      "attempted_by": 793,
+      "success_rate": 83.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 20
+  },
+  {
+    "id": "1148",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Maximum Building II",
+    "norm_name": "maximum_building_ii",
+    "url": "https://cses.fi/problemset/task/1148",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 336,
+      "attempted_by": 413,
+      "success_rate": 81.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 13
+  },
+  {
+    "id": "2423",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Filling Trominos",
+    "norm_name": "filling_trominos",
+    "url": "https://cses.fi/problemset/task/2423",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 172,
+      "attempted_by": 278,
+      "success_rate": 61.8
+    },
+    "num_examples": 1,
+    "num_test_cases": 4
+  },
+  {
+    "id": "1161",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Stick Divisions",
+    "norm_name": "stick_divisions",
+    "url": "https://cses.fi/problemset/task/1161",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 2964,
+      "attempted_by": 3512,
+      "success_rate": 84.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "1665",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Coding Company",
+    "norm_name": "coding_company",
+    "url": "https://cses.fi/problemset/task/1665",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 1083,
+      "attempted_by": 1442,
+      "success_rate": 75.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 16
+  },
+  {
+    "id": "1699",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Flight Route Requests",
+    "norm_name": "flight_route_requests",
+    "url": "https://cses.fi/problemset/task/1699",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 347,
+      "attempted_by": 422,
+      "success_rate": 82.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 17
+  },
+  {
+    "id": "2402",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Two Stacks Sorting",
+    "norm_name": "two_stacks_sorting",
+    "url": "https://cses.fi/problemset/task/2402",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 123,
+      "attempted_by": 382,
+      "success_rate": 32.2
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "1701",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Tree Isomorphism II",
+    "norm_name": "tree_isomorphism_ii",
+    "url": "https://cses.fi/problemset/task/1701",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 675,
+      "attempted_by": 781,
+      "success_rate": 86.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 14
+  },
+  {
+    "id": "1705",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Forbidden Cities",
+    "norm_name": "forbidden_cities",
+    "url": "https://cses.fi/problemset/task/1705",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 587,
+      "attempted_by": 771,
+      "success_rate": 76.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 16
+  },
+  {
+    "id": "1741",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Area of Rectangles",
+    "norm_name": "area_of_rectangles",
+    "url": "https://cses.fi/problemset/task/1741",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 835,
+      "attempted_by": 939,
+      "success_rate": 88.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 15
+  },
+  {
+    "id": "2429",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Grid Completion",
+    "norm_name": "grid_completion",
+    "url": "https://cses.fi/problemset/task/2429",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 156,
+      "attempted_by": 205,
+      "success_rate": 76.1
+    },
+    "num_examples": 1,
+    "num_test_cases": 6
+  },
+  {
+    "id": "1752",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Creating Offices",
+    "norm_name": "creating_offices",
+    "url": "https://cses.fi/problemset/task/1752",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 320,
+      "attempted_by": 408,
+      "success_rate": 78.4
+    },
+    "num_examples": 1,
+    "num_test_cases": 22
+  },
+  {
+    "id": "1075",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Permutations II",
+    "norm_name": "permutations_ii",
+    "url": "https://cses.fi/problemset/task/1075",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 675,
+      "attempted_by": 773,
+      "success_rate": 87.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 23
+  },
+  {
+    "id": "2415",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Functional Graph Distribution",
+    "norm_name": "functional_graph_distribution",
+    "url": "https://cses.fi/problemset/task/2415",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 173,
+      "attempted_by": 218,
+      "success_rate": 79.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 8
+  },
+  {
+    "id": "1685",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "New Flight Routes",
+    "norm_name": "new_flight_routes",
+    "url": "https://cses.fi/problemset/task/1685",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 250,
+      "attempted_by": 611,
+      "success_rate": 40.9
+    },
+    "num_examples": 1,
+    "num_test_cases": 26
+  },
+  {
+    "id": "2418",
+    "category": "Additional Problems",
+    "norm_category": "additional_problems",
+    "name": "Grid Path Construction",
+    "norm_name": "grid_path_construction",
+    "url": "https://cses.fi/problemset/task/2418",
+    "time_limit": "1.00",
+    "memory_limit": "512",
+    "statistics": {
+      "solved_by": 78,
+      "attempted_by": 321,
+      "success_rate": 24.3
+    },
+    "num_examples": 1,
+    "num_test_cases": 20
+  }
+]
\ No newline at end of file