[
  {
    "id": 1,
    "topic": "two-sum",
    "difficulty": "easy"
  },
  {
    "id": 2,
    "topic": "add-two-numbers",
    "difficulty": "medium"
  },
  {
    "id": 3,
    "topic": "longest-substring-without-repeating-characters",
    "difficulty": "medium"
  },
  {
    "id": 4,
    "topic": "median-of-two-sorted-arrays",
    "difficulty": "hard"
  },
  {
    "id": 5,
    "topic": "longest-palindromic-substring",
    "difficulty": "medium"
  },
  {
    "id": 6,
    "topic": "zigzag-conversion",
    "difficulty": "medium"
  },
  {
    "id": 7,
    "topic": "reverse-integer",
    "difficulty": "medium"
  },
  {
    "id": 8,
    "topic": "string-to-integer-atoi",
    "difficulty": "medium"
  },
  {
    "id": 9,
    "topic": "palindrome-number",
    "difficulty": "easy"
  },
  {
    "id": 10,
    "topic": "regular-expression-matching",
    "difficulty": "hard"
  },
  {
    "id": 11,
    "topic": "container-with-most-water",
    "difficulty": "medium"
  },
  {
    "id": 12,
    "topic": "integer-to-roman",
    "difficulty": "medium"
  },
  {
    "id": 13,
    "topic": "roman-to-integer",
    "difficulty": "easy"
  },
  {
    "id": 14,
    "topic": "longest-common-prefix",
    "difficulty": "easy"
  },
  {
    "id": 15,
    "topic": "3sum",
    "difficulty": "medium"
  },
  {
    "id": 16,
    "topic": "3sum-closest",
    "difficulty": "medium"
  },
  {
    "id": 17,
    "topic": "letter-combinations-of-a-phone-number",
    "difficulty": "medium"
  },
  {
    "id": 18,
    "topic": "4sum",
    "difficulty": "medium"
  },
  {
    "id": 19,
    "topic": "remove-nth-node-from-end-of-list",
    "difficulty": "medium"
  },
  {
    "id": 20,
    "topic": "valid-parentheses",
    "difficulty": "easy"
  },
  {
    "id": 21,
    "topic": "merge-two-sorted-lists",
    "difficulty": "easy"
  },
  {
    "id": 22,
    "topic": "generate-parentheses",
    "difficulty": "medium"
  },
  {
    "id": 23,
    "topic": "merge-k-sorted-lists",
    "difficulty": "hard"
  },
  {
    "id": 24,
    "topic": "swap-nodes-in-pairs",
    "difficulty": "medium"
  },
  {
    "id": 25,
    "topic": "reverse-nodes-in-k-group",
    "difficulty": "hard"
  },
  {
    "id": 26,
    "topic": "remove-duplicates-from-sorted-array",
    "difficulty": "easy"
  },
  {
    "id": 27,
    "topic": "remove-element",
    "difficulty": "easy"
  },
  {
    "id": 28,
    "topic": "implement-strstr",
    "difficulty": "easy"
  },
  {
    "id": 29,
    "topic": "divide-two-integers",
    "difficulty": "medium"
  },
  {
    "id": 30,
    "topic": "substring-with-concatenation-of-all-words",
    "difficulty": "hard"
  },
  {
    "id": 31,
    "topic": "next-permutation",
    "difficulty": "medium"
  },
  {
    "id": 32,
    "topic": "longest-valid-parentheses",
    "difficulty": "hard"
  },
  {
    "id": 33,
    "topic": "search-in-rotated-sorted-array",
    "difficulty": "medium"
  },
  {
    "id": 34,
    "topic": "find-first-and-last-position-of-element-in-sorted-array",
    "difficulty": "medium"
  },
  {
    "id": 35,
    "topic": "search-insert-position",
    "difficulty": "easy"
  },
  {
    "id": 36,
    "topic": "valid-sudoku",
    "difficulty": "medium"
  },
  {
    "id": 37,
    "topic": "sudoku-solver",
    "difficulty": "hard"
  },
  {
    "id": 38,
    "topic": "count-and-say",
    "difficulty": "medium"
  },
  {
    "id": 39,
    "topic": "combination-sum",
    "difficulty": "medium"
  },
  {
    "id": 40,
    "topic": "combination-sum-ii",
    "difficulty": "medium"
  },
  {
    "id": 41,
    "topic": "first-missing-positive",
    "difficulty": "hard"
  },
  {
    "id": 42,
    "topic": "trapping-rain-water",
    "difficulty": "hard"
  },
  {
    "id": 43,
    "topic": "multiply-strings",
    "difficulty": "medium"
  },
  {
    "id": 44,
    "topic": "wildcard-matching",
    "difficulty": "hard"
  },
  {
    "id": 45,
    "topic": "jump-game-ii",
    "difficulty": "medium"
  },
  {
    "id": 46,
    "topic": "permutations",
    "difficulty": "medium"
  },
  {
    "id": 47,
    "topic": "permutations-ii",
    "difficulty": "medium"
  },
  {
    "id": 48,
    "topic": "rotate-image",
    "difficulty": "medium"
  },
  {
    "id": 49,
    "topic": "group-anagrams",
    "difficulty": "medium"
  },
  {
    "id": 50,
    "topic": "powx-n",
    "difficulty": "medium"
  },
  {
    "id": 51,
    "topic": "n-queens",
    "difficulty": "hard"
  },
  {
    "id": 52,
    "topic": "n-queens-ii",
    "difficulty": "hard"
  },
  {
    "id": 53,
    "topic": "maximum-subarray",
    "difficulty": "easy"
  },
  {
    "id": 54,
    "topic": "spiral-matrix",
    "difficulty": "medium"
  },
  {
    "id": 55,
    "topic": "jump-game",
    "difficulty": "medium"
  },
  {
    "id": 56,
    "topic": "merge-intervals",
    "difficulty": "medium"
  },
  {
    "id": 57,
    "topic": "insert-interval",
    "difficulty": "medium"
  },
  {
    "id": 58,
    "topic": "length-of-last-word",
    "difficulty": "easy"
  },
  {
    "id": 59,
    "topic": "spiral-matrix-ii",
    "difficulty": "medium"
  },
  {
    "id": 60,
    "topic": "permutation-sequence",
    "difficulty": "hard"
  },
  {
    "id": 61,
    "topic": "rotate-list",
    "difficulty": "medium"
  },
  {
    "id": 62,
    "topic": "unique-paths",
    "difficulty": "medium"
  },
  {
    "id": 63,
    "topic": "unique-paths-ii",
    "difficulty": "medium"
  },
  {
    "id": 64,
    "topic": "minimum-path-sum",
    "difficulty": "medium"
  },
  {
    "id": 65,
    "topic": "valid-number",
    "difficulty": "hard"
  },
  {
    "id": 66,
    "topic": "plus-one",
    "difficulty": "easy"
  },
  {
    "id": 67,
    "topic": "add-binary",
    "difficulty": "easy"
  },
  {
    "id": 68,
    "topic": "text-justification",
    "difficulty": "hard"
  },
  {
    "id": 69,
    "topic": "sqrtx",
    "difficulty": "easy"
  },
  {
    "id": 70,
    "topic": "climbing-stairs",
    "difficulty": "easy"
  },
  {
    "id": 71,
    "topic": "simplify-path",
    "difficulty": "medium"
  },
  {
    "id": 72,
    "topic": "edit-distance",
    "difficulty": "hard"
  },
  {
    "id": 73,
    "topic": "set-matrix-zeroes",
    "difficulty": "medium"
  },
  {
    "id": 74,
    "topic": "search-a-2d-matrix",
    "difficulty": "medium"
  },
  {
    "id": 75,
    "topic": "sort-colors",
    "difficulty": "medium"
  },
  {
    "id": 76,
    "topic": "minimum-window-substring",
    "difficulty": "hard"
  },
  {
    "id": 77,
    "topic": "combinations",
    "difficulty": "medium"
  },
  {
    "id": 78,
    "topic": "subsets",
    "difficulty": "medium"
  },
  {
    "id": 79,
    "topic": "word-search",
    "difficulty": "medium"
  },
  {
    "id": 80,
    "topic": "remove-duplicates-from-sorted-array-ii",
    "difficulty": "medium"
  },
  {
    "id": 81,
    "topic": "search-in-rotated-sorted-array-ii",
    "difficulty": "medium"
  },
  {
    "id": 82,
    "topic": "remove-duplicates-from-sorted-list-ii",
    "difficulty": "medium"
  },
  {
    "id": 83,
    "topic": "remove-duplicates-from-sorted-list",
    "difficulty": "easy"
  },
  {
    "id": 84,
    "topic": "largest-rectangle-in-histogram",
    "difficulty": "hard"
  },
  {
    "id": 85,
    "topic": "maximal-rectangle",
    "difficulty": "hard"
  },
  {
    "id": 86,
    "topic": "partition-list",
    "difficulty": "medium"
  },
  {
    "id": 87,
    "topic": "scramble-string",
    "difficulty": "hard"
  },
  {
    "id": 88,
    "topic": "merge-sorted-array",
    "difficulty": "easy"
  },
  {
    "id": 89,
    "topic": "gray-code",
    "difficulty": "medium"
  },
  {
    "id": 90,
    "topic": "subsets-ii",
    "difficulty": "medium"
  },
  {
    "id": 91,
    "topic": "decode-ways",
    "difficulty": "medium"
  },
  {
    "id": 92,
    "topic": "reverse-linked-list-ii",
    "difficulty": "medium"
  },
  {
    "id": 93,
    "topic": "restore-ip-addresses",
    "difficulty": "medium"
  },
  {
    "id": 94,
    "topic": "binary-tree-inorder-traversal",
    "difficulty": "easy"
  },
  {
    "id": 95,
    "topic": "unique-binary-search-trees-ii",
    "difficulty": "medium"
  },
  {
    "id": 96,
    "topic": "unique-binary-search-trees",
    "difficulty": "medium"
  },
  {
    "id": 97,
    "topic": "interleaving-string",
    "difficulty": "medium"
  },
  {
    "id": 98,
    "topic": "validate-binary-search-tree",
    "difficulty": "medium"
  },
  {
    "id": 99,
    "topic": "recover-binary-search-tree",
    "difficulty": "medium"
  },
  {
    "id": 100,
    "topic": "same-tree",
    "difficulty": "easy"
  },
  {
    "id": 101,
    "topic": "symmetric-tree",
    "difficulty": "easy"
  },
  {
    "id": 102,
    "topic": "binary-tree-level-order-traversal",
    "difficulty": "medium"
  },
  {
    "id": 103,
    "topic": "binary-tree-zigzag-level-order-traversal",
    "difficulty": "medium"
  },
  {
    "id": 104,
    "topic": "maximum-depth-of-binary-tree",
    "difficulty": "easy"
  },
  {
    "id": 105,
    "topic": "construct-binary-tree-from-preorder-and-inorder-traversal",
    "difficulty": "medium"
  },
  {
    "id": 106,
    "topic": "construct-binary-tree-from-inorder-and-postorder-traversal",
    "difficulty": "medium"
  },
  {
    "id": 107,
    "topic": "binary-tree-level-order-traversal-ii",
    "difficulty": "medium"
  },
  {
    "id": 108,
    "topic": "convert-sorted-array-to-binary-search-tree",
    "difficulty": "easy"
  },
  {
    "id": 109,
    "topic": "convert-sorted-list-to-binary-search-tree",
    "difficulty": "medium"
  },
  {
    "id": 110,
    "topic": "balanced-binary-tree",
    "difficulty": "easy"
  },
  {
    "id": 111,
    "topic": "minimum-depth-of-binary-tree",
    "difficulty": "easy"
  },
  {
    "id": 112,
    "topic": "path-sum",
    "difficulty": "easy"
  },
  {
    "id": 113,
    "topic": "path-sum-ii",
    "difficulty": "medium"
  },
  {
    "id": 114,
    "topic": "flatten-binary-tree-to-linked-list",
    "difficulty": "medium"
  },
  {
    "id": 115,
    "topic": "distinct-subsequences",
    "difficulty": "hard"
  },
  {
    "id": 116,
    "topic": "populating-next-right-pointers-in-each-node",
    "difficulty": "medium"
  },
  {
    "id": 117,
    "topic": "populating-next-right-pointers-in-each-node-ii",
    "difficulty": "medium"
  },
  {
    "id": 118,
    "topic": "pascals-triangle",
    "difficulty": "easy"
  },
  {
    "id": 119,
    "topic": "pascals-triangle-ii",
    "difficulty": "easy"
  },
  {
    "id": 120,
    "topic": "triangle",
    "difficulty": "medium"
  },
  {
    "id": 121,
    "topic": "best-time-to-buy-and-sell-stock",
    "difficulty": "easy"
  },
  {
    "id": 122,
    "topic": "best-time-to-buy-and-sell-stock-ii",
    "difficulty": "medium"
  },
  {
    "id": 123,
    "topic": "best-time-to-buy-and-sell-stock-iii",
    "difficulty": "hard"
  },
  {
    "id": 124,
    "topic": "binary-tree-maximum-path-sum",
    "difficulty": "hard"
  },
  {
    "id": 125,
    "topic": "valid-palindrome",
    "difficulty": "easy"
  },
  {
    "id": 126,
    "topic": "word-ladder-ii",
    "difficulty": "hard"
  },
  {
    "id": 127,
    "topic": "word-ladder",
    "difficulty": "hard"
  },
  {
    "id": 128,
    "topic": "longest-consecutive-sequence",
    "difficulty": "medium"
  },
  {
    "id": 129,
    "topic": "sum-root-to-leaf-numbers",
    "difficulty": "medium"
  },
  {
    "id": 130,
    "topic": "surrounded-regions",
    "difficulty": "medium"
  },
  {
    "id": 131,
    "topic": "palindrome-partitioning",
    "difficulty": "medium"
  },
  {
    "id": 132,
    "topic": "palindrome-partitioning-ii",
    "difficulty": "hard"
  },
  {
    "id": 133,
    "topic": "clone-graph",
    "difficulty": "medium"
  },
  {
    "id": 134,
    "topic": "gas-station",
    "difficulty": "medium"
  },
  {
    "id": 135,
    "topic": "candy",
    "difficulty": "hard"
  },
  {
    "id": 136,
    "topic": "single-number",
    "difficulty": "easy"
  },
  {
    "id": 137,
    "topic": "single-number-ii",
    "difficulty": "medium"
  },
  {
    "id": 138,
    "topic": "copy-list-with-random-pointer",
    "difficulty": "medium"
  },
  {
    "id": 139,
    "topic": "word-break",
    "difficulty": "medium"
  },
  {
    "id": 140,
    "topic": "word-break-ii",
    "difficulty": "hard"
  },
  {
    "id": 141,
    "topic": "linked-list-cycle",
    "difficulty": "easy"
  },
  {
    "id": 142,
    "topic": "linked-list-cycle-ii",
    "difficulty": "medium"
  },
  {
    "id": 143,
    "topic": "reorder-list",
    "difficulty": "medium"
  },
  {
    "id": 144,
    "topic": "binary-tree-preorder-traversal",
    "difficulty": "easy"
  },
  {
    "id": 145,
    "topic": "binary-tree-postorder-traversal",
    "difficulty": "easy"
  },
  {
    "id": 146,
    "topic": "lru-cache",
    "difficulty": "medium"
  },
  {
    "id": 147,
    "topic": "insertion-sort-list",
    "difficulty": "medium"
  },
  {
    "id": 148,
    "topic": "sort-list",
    "difficulty": "medium"
  },
  {
    "id": 149,
    "topic": "max-points-on-a-line",
    "difficulty": "hard"
  },
  {
    "id": 150,
    "topic": "evaluate-reverse-polish-notation",
    "difficulty": "medium"
  },
  {
    "id": 151,
    "topic": "reverse-words-in-a-string",
    "difficulty": "medium"
  },
  {
    "id": 152,
    "topic": "maximum-product-subarray",
    "difficulty": "medium"
  },
  {
    "id": 153,
    "topic": "find-minimum-in-rotated-sorted-array",
    "difficulty": "medium"
  },
  {
    "id": 154,
    "topic": "find-minimum-in-rotated-sorted-array-ii",
    "difficulty": "hard"
  },
  {
    "id": 155,
    "topic": "min-stack",
    "difficulty": "easy"
  },
  {
    "id": 156,
    "topic": "binary-tree-upside-down",
    "difficulty": "medium"
  },
  {
    "id": 157,
    "topic": "read-n-characters-given-read4",
    "difficulty": "easy"
  },
  {
    "id": 158,
    "topic": "read-n-characters-given-read4-ii-call-multiple-times",
    "difficulty": "hard"
  },
  {
    "id": 159,
    "topic": "longest-substring-with-at-most-two-distinct-characters",
    "difficulty": "medium"
  },
  {
    "id": 160,
    "topic": "intersection-of-two-linked-lists",
    "difficulty": "easy"
  },
  {
    "id": 161,
    "topic": "one-edit-distance",
    "difficulty": "medium"
  },
  {
    "id": 162,
    "topic": "find-peak-element",
    "difficulty": "medium"
  },
  {
    "id": 163,
    "topic": "missing-ranges",
    "difficulty": "easy"
  },
  {
    "id": 164,
    "topic": "maximum-gap",
    "difficulty": "hard"
  },
  {
    "id": 165,
    "topic": "compare-version-numbers",
    "difficulty": "medium"
  },
  {
    "id": 166,
    "topic": "fraction-to-recurring-decimal",
    "difficulty": "medium"
  },
  {
    "id": 167,
    "topic": "two-sum-ii-input-array-is-sorted",
    "difficulty": "medium"
  },
  {
    "id": 168,
    "topic": "excel-sheet-column-title",
    "difficulty": "easy"
  },
  {
    "id": 169,
    "topic": "majority-element",
    "difficulty": "easy"
  },
  {
    "id": 170,
    "topic": "two-sum-iii-data-structure-design",
    "difficulty": "easy"
  },
  {
    "id": 171,
    "topic": "excel-sheet-column-number",
    "difficulty": "easy"
  },
  {
    "id": 172,
    "topic": "factorial-trailing-zeroes",
    "difficulty": "medium"
  },
  {
    "id": 173,
    "topic": "binary-search-tree-iterator",
    "difficulty": "medium"
  },
  {
    "id": 174,
    "topic": "dungeon-game",
    "difficulty": "hard"
  },
  {
    "id": 175,
    "topic": "combine-two-tables",
    "difficulty": "easy"
  },
  {
    "id": 176,
    "topic": "second-highest-salary",
    "difficulty": "medium"
  },
  {
    "id": 177,
    "topic": "nth-highest-salary",
    "difficulty": "medium"
  },
  {
    "id": 178,
    "topic": "rank-scores",
    "difficulty": "medium"
  },
  {
    "id": 179,
    "topic": "largest-number",
    "difficulty": "medium"
  },
  {
    "id": 180,
    "topic": "consecutive-numbers",
    "difficulty": "medium"
  },
  {
    "id": 181,
    "topic": "employees-earning-more-than-their-managers",
    "difficulty": "easy"
  },
  {
    "id": 182,
    "topic": "duplicate-emails",
    "difficulty": "easy"
  },
  {
    "id": 183,
    "topic": "customers-who-never-order",
    "difficulty": "easy"
  },
  {
    "id": 184,
    "topic": "department-highest-salary",
    "difficulty": "medium"
  },
  {
    "id": 185,
    "topic": "department-top-three-salaries",
    "difficulty": "hard"
  },
  {
    "id": 186,
    "topic": "reverse-words-in-a-string-ii",
    "difficulty": "medium"
  },
  {
    "id": 187,
    "topic": "repeated-dna-sequences",
    "difficulty": "medium"
  },
  {
    "id": 188,
    "topic": "best-time-to-buy-and-sell-stock-iv",
    "difficulty": "hard"
  },
  {
    "id": 189,
    "topic": "rotate-array",
    "difficulty": "medium"
  },
  {
    "id": 190,
    "topic": "reverse-bits",
    "difficulty": "easy"
  },
  {
    "id": 191,
    "topic": "number-of-1-bits",
    "difficulty": "easy"
  },
  {
    "id": 192,
    "topic": "word-frequency",
    "difficulty": "medium"
  },
  {
    "id": 193,
    "topic": "valid-phone-numbers",
    "difficulty": "easy"
  },
  {
    "id": 194,
    "topic": "transpose-file",
    "difficulty": "medium"
  },
  {
    "id": 195,
    "topic": "tenth-line",
    "difficulty": "easy"
  },
  {
    "id": 196,
    "topic": "delete-duplicate-emails",
    "difficulty": "easy"
  },
  {
    "id": 197,
    "topic": "rising-temperature",
    "difficulty": "easy"
  },
  {
    "id": 198,
    "topic": "house-robber",
    "difficulty": "medium"
  },
  {
    "id": 199,
    "topic": "binary-tree-right-side-view",
    "difficulty": "medium"
  },
  {
    "id": 200,
    "topic": "number-of-islands",
    "difficulty": "medium"
  },
  {
    "id": 201,
    "topic": "bitwise-and-of-numbers-range",
    "difficulty": "medium"
  },
  {
    "id": 202,
    "topic": "happy-number",
    "difficulty": "easy"
  },
  {
    "id": 203,
    "topic": "remove-linked-list-elements",
    "difficulty": "easy"
  },
  {
    "id": 204,
    "topic": "count-primes",
    "difficulty": "medium"
  },
  {
    "id": 205,
    "topic": "isomorphic-strings",
    "difficulty": "easy"
  },
  {
    "id": 206,
    "topic": "reverse-linked-list",
    "difficulty": "easy"
  },
  {
    "id": 207,
    "topic": "course-schedule",
    "difficulty": "medium"
  },
  {
    "id": 208,
    "topic": "implement-trie-prefix-tree",
    "difficulty": "medium"
  },
  {
    "id": 209,
    "topic": "minimum-size-subarray-sum",
    "difficulty": "medium"
  },
  {
    "id": 210,
    "topic": "course-schedule-ii",
    "difficulty": "medium"
  },
  {
    "id": 211,
    "topic": "design-add-and-search-words-data-structure",
    "difficulty": "medium"
  },
  {
    "id": 212,
    "topic": "word-search-ii",
    "difficulty": "hard"
  },
  {
    "id": 213,
    "topic": "house-robber-ii",
    "difficulty": "medium"
  },
  {
    "id": 214,
    "topic": "shortest-palindrome",
    "difficulty": "hard"
  },
  {
    "id": 215,
    "topic": "kth-largest-element-in-an-array",
    "difficulty": "medium"
  },
  {
    "id": 216,
    "topic": "combination-sum-iii",
    "difficulty": "medium"
  },
  {
    "id": 217,
    "topic": "contains-duplicate",
    "difficulty": "easy"
  },
  {
    "id": 218,
    "topic": "the-skyline-problem",
    "difficulty": "hard"
  },
  {
    "id": 219,
    "topic": "contains-duplicate-ii",
    "difficulty": "easy"
  },
  {
    "id": 220,
    "topic": "contains-duplicate-iii",
    "difficulty": "medium"
  },
  {
    "id": 221,
    "topic": "maximal-square",
    "difficulty": "medium"
  },
  {
    "id": 222,
    "topic": "count-complete-tree-nodes",
    "difficulty": "medium"
  },
  {
    "id": 223,
    "topic": "rectangle-area",
    "difficulty": "medium"
  },
  {
    "id": 224,
    "topic": "basic-calculator",
    "difficulty": "hard"
  },
  {
    "id": 225,
    "topic": "implement-stack-using-queues",
    "difficulty": "easy"
  },
  {
    "id": 226,
    "topic": "invert-binary-tree",
    "difficulty": "easy"
  },
  {
    "id": 227,
    "topic": "basic-calculator-ii",
    "difficulty": "medium"
  },
  {
    "id": 228,
    "topic": "summary-ranges",
    "difficulty": "easy"
  },
  {
    "id": 229,
    "topic": "majority-element-ii",
    "difficulty": "medium"
  },
  {
    "id": 230,
    "topic": "kth-smallest-element-in-a-bst",
    "difficulty": "medium"
  },
  {
    "id": 231,
    "topic": "power-of-two",
    "difficulty": "easy"
  },
  {
    "id": 232,
    "topic": "implement-queue-using-stacks",
    "difficulty": "easy"
  },
  {
    "id": 233,
    "topic": "number-of-digit-one",
    "difficulty": "hard"
  },
  {
    "id": 234,
    "topic": "palindrome-linked-list",
    "difficulty": "easy"
  },
  {
    "id": 235,
    "topic": "lowest-common-ancestor-of-a-binary-search-tree",
    "difficulty": "easy"
  },
  {
    "id": 236,
    "topic": "lowest-common-ancestor-of-a-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 237,
    "topic": "delete-node-in-a-linked-list",
    "difficulty": "easy"
  },
  {
    "id": 238,
    "topic": "product-of-array-except-self",
    "difficulty": "medium"
  },
  {
    "id": 239,
    "topic": "sliding-window-maximum",
    "difficulty": "hard"
  },
  {
    "id": 240,
    "topic": "search-a-2d-matrix-ii",
    "difficulty": "medium"
  },
  {
    "id": 241,
    "topic": "different-ways-to-add-parentheses",
    "difficulty": "medium"
  },
  {
    "id": 242,
    "topic": "valid-anagram",
    "difficulty": "easy"
  },
  {
    "id": 243,
    "topic": "shortest-word-distance",
    "difficulty": "easy"
  },
  {
    "id": 244,
    "topic": "shortest-word-distance-ii",
    "difficulty": "medium"
  },
  {
    "id": 245,
    "topic": "shortest-word-distance-iii",
    "difficulty": "medium"
  },
  {
    "id": 246,
    "topic": "strobogrammatic-number",
    "difficulty": "easy"
  },
  {
    "id": 247,
    "topic": "strobogrammatic-number-ii",
    "difficulty": "medium"
  },
  {
    "id": 248,
    "topic": "strobogrammatic-number-iii",
    "difficulty": "hard"
  },
  {
    "id": 249,
    "topic": "group-shifted-strings",
    "difficulty": "medium"
  },
  {
    "id": 250,
    "topic": "count-univalue-subtrees",
    "difficulty": "medium"
  },
  {
    "id": 251,
    "topic": "flatten-2d-vector",
    "difficulty": "medium"
  },
  {
    "id": 252,
    "topic": "meeting-rooms",
    "difficulty": "easy"
  },
  {
    "id": 253,
    "topic": "meeting-rooms-ii",
    "difficulty": "medium"
  },
  {
    "id": 254,
    "topic": "factor-combinations",
    "difficulty": "medium"
  },
  {
    "id": 255,
    "topic": "verify-preorder-sequence-in-binary-search-tree",
    "difficulty": "medium"
  },
  {
    "id": 256,
    "topic": "paint-house",
    "difficulty": "medium"
  },
  {
    "id": 257,
    "topic": "binary-tree-paths",
    "difficulty": "easy"
  },
  {
    "id": 258,
    "topic": "add-digits",
    "difficulty": "easy"
  },
  {
    "id": 259,
    "topic": "3sum-smaller",
    "difficulty": "medium"
  },
  {
    "id": 260,
    "topic": "single-number-iii",
    "difficulty": "medium"
  },
  {
    "id": 261,
    "topic": "graph-valid-tree",
    "difficulty": "medium"
  },
  {
    "id": 262,
    "topic": "trips-and-users",
    "difficulty": "hard"
  },
  {
    "id": 263,
    "topic": "ugly-number",
    "difficulty": "easy"
  },
  {
    "id": 264,
    "topic": "ugly-number-ii",
    "difficulty": "medium"
  },
  {
    "id": 265,
    "topic": "paint-house-ii",
    "difficulty": "hard"
  },
  {
    "id": 266,
    "topic": "palindrome-permutation",
    "difficulty": "easy"
  },
  {
    "id": 267,
    "topic": "palindrome-permutation-ii",
    "difficulty": "medium"
  },
  {
    "id": 268,
    "topic": "missing-number",
    "difficulty": "easy"
  },
  {
    "id": 269,
    "topic": "alien-dictionary",
    "difficulty": "hard"
  },
  {
    "id": 270,
    "topic": "closest-binary-search-tree-value",
    "difficulty": "easy"
  },
  {
    "id": 271,
    "topic": "encode-and-decode-strings",
    "difficulty": "medium"
  },
  {
    "id": 272,
    "topic": "closest-binary-search-tree-value-ii",
    "difficulty": "hard"
  },
  {
    "id": 273,
    "topic": "integer-to-english-words",
    "difficulty": "hard"
  },
  {
    "id": 274,
    "topic": "h-index",
    "difficulty": "medium"
  },
  {
    "id": 275,
    "topic": "h-index-ii",
    "difficulty": "medium"
  },
  {
    "id": 276,
    "topic": "paint-fence",
    "difficulty": "medium"
  },
  {
    "id": 277,
    "topic": "find-the-celebrity",
    "difficulty": "medium"
  },
  {
    "id": 278,
    "topic": "first-bad-version",
    "difficulty": "easy"
  },
  {
    "id": 279,
    "topic": "perfect-squares",
    "difficulty": "medium"
  },
  {
    "id": 280,
    "topic": "wiggle-sort",
    "difficulty": "medium"
  },
  {
    "id": 281,
    "topic": "zigzag-iterator",
    "difficulty": "medium"
  },
  {
    "id": 282,
    "topic": "expression-add-operators",
    "difficulty": "hard"
  },
  {
    "id": 283,
    "topic": "move-zeroes",
    "difficulty": "easy"
  },
  {
    "id": 284,
    "topic": "peeking-iterator",
    "difficulty": "medium"
  },
  {
    "id": 285,
    "topic": "inorder-successor-in-bst",
    "difficulty": "medium"
  },
  {
    "id": 286,
    "topic": "walls-and-gates",
    "difficulty": "medium"
  },
  {
    "id": 287,
    "topic": "find-the-duplicate-number",
    "difficulty": "medium"
  },
  {
    "id": 288,
    "topic": "unique-word-abbreviation",
    "difficulty": "medium"
  },
  {
    "id": 289,
    "topic": "game-of-life",
    "difficulty": "medium"
  },
  {
    "id": 290,
    "topic": "word-pattern",
    "difficulty": "easy"
  },
  {
    "id": 291,
    "topic": "word-pattern-ii",
    "difficulty": "medium"
  },
  {
    "id": 292,
    "topic": "nim-game",
    "difficulty": "easy"
  },
  {
    "id": 293,
    "topic": "flip-game",
    "difficulty": "easy"
  },
  {
    "id": 294,
    "topic": "flip-game-ii",
    "difficulty": "medium"
  },
  {
    "id": 295,
    "topic": "find-median-from-data-stream",
    "difficulty": "hard"
  },
  {
    "id": 296,
    "topic": "best-meeting-point",
    "difficulty": "hard"
  },
  {
    "id": 297,
    "topic": "serialize-and-deserialize-binary-tree",
    "difficulty": "hard"
  },
  {
    "id": 298,
    "topic": "binary-tree-longest-consecutive-sequence",
    "difficulty": "medium"
  },
  {
    "id": 299,
    "topic": "bulls-and-cows",
    "difficulty": "medium"
  },
  {
    "id": 300,
    "topic": "longest-increasing-subsequence",
    "difficulty": "medium"
  },
  {
    "id": 301,
    "topic": "remove-invalid-parentheses",
    "difficulty": "hard"
  },
  {
    "id": 302,
    "topic": "smallest-rectangle-enclosing-black-pixels",
    "difficulty": "hard"
  },
  {
    "id": 303,
    "topic": "range-sum-query-immutable",
    "difficulty": "easy"
  },
  {
    "id": 304,
    "topic": "range-sum-query-2d-immutable",
    "difficulty": "medium"
  },
  {
    "id": 305,
    "topic": "number-of-islands-ii",
    "difficulty": "hard"
  },
  {
    "id": 306,
    "topic": "additive-number",
    "difficulty": "medium"
  },
  {
    "id": 307,
    "topic": "range-sum-query-mutable",
    "difficulty": "medium"
  },
  {
    "id": 308,
    "topic": "range-sum-query-2d-mutable",
    "difficulty": "hard"
  },
  {
    "id": 309,
    "topic": "best-time-to-buy-and-sell-stock-with-cooldown",
    "difficulty": "medium"
  },
  {
    "id": 310,
    "topic": "minimum-height-trees",
    "difficulty": "medium"
  },
  {
    "id": 311,
    "topic": "sparse-matrix-multiplication",
    "difficulty": "medium"
  },
  {
    "id": 312,
    "topic": "burst-balloons",
    "difficulty": "hard"
  },
  {
    "id": 313,
    "topic": "super-ugly-number",
    "difficulty": "medium"
  },
  {
    "id": 314,
    "topic": "binary-tree-vertical-order-traversal",
    "difficulty": "medium"
  },
  {
    "id": 315,
    "topic": "count-of-smaller-numbers-after-self",
    "difficulty": "hard"
  },
  {
    "id": 316,
    "topic": "remove-duplicate-letters",
    "difficulty": "medium"
  },
  {
    "id": 317,
    "topic": "shortest-distance-from-all-buildings",
    "difficulty": "hard"
  },
  {
    "id": 318,
    "topic": "maximum-product-of-word-lengths",
    "difficulty": "medium"
  },
  {
    "id": 319,
    "topic": "bulb-switcher",
    "difficulty": "medium"
  },
  {
    "id": 320,
    "topic": "generalized-abbreviation",
    "difficulty": "medium"
  },
  {
    "id": 321,
    "topic": "create-maximum-number",
    "difficulty": "hard"
  },
  {
    "id": 322,
    "topic": "coin-change",
    "difficulty": "medium"
  },
  {
    "id": 323,
    "topic": "number-of-connected-components-in-an-undirected-graph",
    "difficulty": "medium"
  },
  {
    "id": 324,
    "topic": "wiggle-sort-ii",
    "difficulty": "medium"
  },
  {
    "id": 325,
    "topic": "maximum-size-subarray-sum-equals-k",
    "difficulty": "medium"
  },
  {
    "id": 326,
    "topic": "power-of-three",
    "difficulty": "easy"
  },
  {
    "id": 327,
    "topic": "count-of-range-sum",
    "difficulty": "hard"
  },
  {
    "id": 328,
    "topic": "odd-even-linked-list",
    "difficulty": "medium"
  },
  {
    "id": 329,
    "topic": "longest-increasing-path-in-a-matrix",
    "difficulty": "hard"
  },
  {
    "id": 330,
    "topic": "patching-array",
    "difficulty": "hard"
  },
  {
    "id": 331,
    "topic": "verify-preorder-serialization-of-a-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 332,
    "topic": "reconstruct-itinerary",
    "difficulty": "hard"
  },
  {
    "id": 333,
    "topic": "largest-bst-subtree",
    "difficulty": "medium"
  },
  {
    "id": 334,
    "topic": "increasing-triplet-subsequence",
    "difficulty": "medium"
  },
  {
    "id": 335,
    "topic": "self-crossing",
    "difficulty": "hard"
  },
  {
    "id": 336,
    "topic": "palindrome-pairs",
    "difficulty": "hard"
  },
  {
    "id": 337,
    "topic": "house-robber-iii",
    "difficulty": "medium"
  },
  {
    "id": 338,
    "topic": "counting-bits",
    "difficulty": "easy"
  },
  {
    "id": 339,
    "topic": "nested-list-weight-sum",
    "difficulty": "medium"
  },
  {
    "id": 340,
    "topic": "longest-substring-with-at-most-k-distinct-characters",
    "difficulty": "medium"
  },
  {
    "id": 341,
    "topic": "flatten-nested-list-iterator",
    "difficulty": "medium"
  },
  {
    "id": 342,
    "topic": "power-of-four",
    "difficulty": "easy"
  },
  {
    "id": 343,
    "topic": "integer-break",
    "difficulty": "medium"
  },
  {
    "id": 344,
    "topic": "reverse-string",
    "difficulty": "easy"
  },
  {
    "id": 345,
    "topic": "reverse-vowels-of-a-string",
    "difficulty": "easy"
  },
  {
    "id": 346,
    "topic": "moving-average-from-data-stream",
    "difficulty": "easy"
  },
  {
    "id": 347,
    "topic": "top-k-frequent-elements",
    "difficulty": "medium"
  },
  {
    "id": 348,
    "topic": "design-tic-tac-toe",
    "difficulty": "medium"
  },
  {
    "id": 349,
    "topic": "intersection-of-two-arrays",
    "difficulty": "easy"
  },
  {
    "id": 350,
    "topic": "intersection-of-two-arrays-ii",
    "difficulty": "easy"
  },
  {
    "id": 351,
    "topic": "android-unlock-patterns",
    "difficulty": "medium"
  },
  {
    "id": 352,
    "topic": "data-stream-as-disjoint-intervals",
    "difficulty": "hard"
  },
  {
    "id": 353,
    "topic": "design-snake-game",
    "difficulty": "medium"
  },
  {
    "id": 354,
    "topic": "russian-doll-envelopes",
    "difficulty": "hard"
  },
  {
    "id": 355,
    "topic": "design-twitter",
    "difficulty": "medium"
  },
  {
    "id": 356,
    "topic": "line-reflection",
    "difficulty": "medium"
  },
  {
    "id": 357,
    "topic": "count-numbers-with-unique-digits",
    "difficulty": "medium"
  },
  {
    "id": 358,
    "topic": "rearrange-string-k-distance-apart",
    "difficulty": "hard"
  },
  {
    "id": 359,
    "topic": "logger-rate-limiter",
    "difficulty": "easy"
  },
  {
    "id": 360,
    "topic": "sort-transformed-array",
    "difficulty": "medium"
  },
  {
    "id": 361,
    "topic": "bomb-enemy",
    "difficulty": "medium"
  },
  {
    "id": 362,
    "topic": "design-hit-counter",
    "difficulty": "medium"
  },
  {
    "id": 363,
    "topic": "max-sum-of-rectangle-no-larger-than-k",
    "difficulty": "hard"
  },
  {
    "id": 364,
    "topic": "nested-list-weight-sum-ii",
    "difficulty": "medium"
  },
  {
    "id": 365,
    "topic": "water-and-jug-problem",
    "difficulty": "medium"
  },
  {
    "id": 366,
    "topic": "find-leaves-of-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 367,
    "topic": "valid-perfect-square",
    "difficulty": "easy"
  },
  {
    "id": 368,
    "topic": "largest-divisible-subset",
    "difficulty": "medium"
  },
  {
    "id": 369,
    "topic": "plus-one-linked-list",
    "difficulty": "medium"
  },
  {
    "id": 370,
    "topic": "range-addition",
    "difficulty": "medium"
  },
  {
    "id": 371,
    "topic": "sum-of-two-integers",
    "difficulty": "medium"
  },
  {
    "id": 372,
    "topic": "super-pow",
    "difficulty": "medium"
  },
  {
    "id": 373,
    "topic": "find-k-pairs-with-smallest-sums",
    "difficulty": "medium"
  },
  {
    "id": 374,
    "topic": "guess-number-higher-or-lower",
    "difficulty": "easy"
  },
  {
    "id": 375,
    "topic": "guess-number-higher-or-lower-ii",
    "difficulty": "medium"
  },
  {
    "id": 376,
    "topic": "wiggle-subsequence",
    "difficulty": "medium"
  },
  {
    "id": 377,
    "topic": "combination-sum-iv",
    "difficulty": "medium"
  },
  {
    "id": 378,
    "topic": "kth-smallest-element-in-a-sorted-matrix",
    "difficulty": "medium"
  },
  {
    "id": 379,
    "topic": "design-phone-directory",
    "difficulty": "medium"
  },
  {
    "id": 380,
    "topic": "insert-delete-getrandom-o1",
    "difficulty": "medium"
  },
  {
    "id": 381,
    "topic": "insert-delete-getrandom-o1-duplicates-allowed",
    "difficulty": "hard"
  },
  {
    "id": 382,
    "topic": "linked-list-random-node",
    "difficulty": "medium"
  },
  {
    "id": 383,
    "topic": "ransom-note",
    "difficulty": "easy"
  },
  {
    "id": 384,
    "topic": "shuffle-an-array",
    "difficulty": "medium"
  },
  {
    "id": 385,
    "topic": "mini-parser",
    "difficulty": "medium"
  },
  {
    "id": 386,
    "topic": "lexicographical-numbers",
    "difficulty": "medium"
  },
  {
    "id": 387,
    "topic": "first-unique-character-in-a-string",
    "difficulty": "easy"
  },
  {
    "id": 388,
    "topic": "longest-absolute-file-path",
    "difficulty": "medium"
  },
  {
    "id": 389,
    "topic": "find-the-difference",
    "difficulty": "easy"
  },
  {
    "id": 390,
    "topic": "elimination-game",
    "difficulty": "medium"
  },
  {
    "id": 391,
    "topic": "perfect-rectangle",
    "difficulty": "hard"
  },
  {
    "id": 392,
    "topic": "is-subsequence",
    "difficulty": "easy"
  },
  {
    "id": 393,
    "topic": "utf-8-validation",
    "difficulty": "medium"
  },
  {
    "id": 394,
    "topic": "decode-string",
    "difficulty": "medium"
  },
  {
    "id": 395,
    "topic": "longest-substring-with-at-least-k-repeating-characters",
    "difficulty": "medium"
  },
  {
    "id": 396,
    "topic": "rotate-function",
    "difficulty": "medium"
  },
  {
    "id": 397,
    "topic": "integer-replacement",
    "difficulty": "medium"
  },
  {
    "id": 398,
    "topic": "random-pick-index",
    "difficulty": "medium"
  },
  {
    "id": 399,
    "topic": "evaluate-division",
    "difficulty": "medium"
  },
  {
    "id": 400,
    "topic": "nth-digit",
    "difficulty": "medium"
  },
  {
    "id": 401,
    "topic": "binary-watch",
    "difficulty": "easy"
  },
  {
    "id": 402,
    "topic": "remove-k-digits",
    "difficulty": "medium"
  },
  {
    "id": 403,
    "topic": "frog-jump",
    "difficulty": "hard"
  },
  {
    "id": 404,
    "topic": "sum-of-left-leaves",
    "difficulty": "easy"
  },
  {
    "id": 405,
    "topic": "convert-a-number-to-hexadecimal",
    "difficulty": "easy"
  },
  {
    "id": 406,
    "topic": "queue-reconstruction-by-height",
    "difficulty": "medium"
  },
  {
    "id": 407,
    "topic": "trapping-rain-water-ii",
    "difficulty": "hard"
  },
  {
    "id": 408,
    "topic": "valid-word-abbreviation",
    "difficulty": "easy"
  },
  {
    "id": 409,
    "topic": "longest-palindrome",
    "difficulty": "easy"
  },
  {
    "id": 410,
    "topic": "split-array-largest-sum",
    "difficulty": "hard"
  },
  {
    "id": 411,
    "topic": "minimum-unique-word-abbreviation",
    "difficulty": "hard"
  },
  {
    "id": 412,
    "topic": "fizz-buzz",
    "difficulty": "easy"
  },
  {
    "id": 413,
    "topic": "arithmetic-slices",
    "difficulty": "medium"
  },
  {
    "id": 414,
    "topic": "third-maximum-number",
    "difficulty": "easy"
  },
  {
    "id": 415,
    "topic": "add-strings",
    "difficulty": "easy"
  },
  {
    "id": 416,
    "topic": "partition-equal-subset-sum",
    "difficulty": "medium"
  },
  {
    "id": 417,
    "topic": "pacific-atlantic-water-flow",
    "difficulty": "medium"
  },
  {
    "id": 418,
    "topic": "sentence-screen-fitting",
    "difficulty": "medium"
  },
  {
    "id": 419,
    "topic": "battleships-in-a-board",
    "difficulty": "medium"
  },
  {
    "id": 420,
    "topic": "strong-password-checker",
    "difficulty": "hard"
  },
  {
    "id": 421,
    "topic": "maximum-xor-of-two-numbers-in-an-array",
    "difficulty": "medium"
  },
  {
    "id": 422,
    "topic": "valid-word-square",
    "difficulty": "easy"
  },
  {
    "id": 423,
    "topic": "reconstruct-original-digits-from-english",
    "difficulty": "medium"
  },
  {
    "id": 424,
    "topic": "longest-repeating-character-replacement",
    "difficulty": "medium"
  },
  {
    "id": 425,
    "topic": "word-squares",
    "difficulty": "hard"
  },
  {
    "id": 432,
    "topic": "all-oone-data-structure",
    "difficulty": "hard"
  },
  {
    "id": 433,
    "topic": "minimum-genetic-mutation",
    "difficulty": "medium"
  },
  {
    "id": 434,
    "topic": "number-of-segments-in-a-string",
    "difficulty": "easy"
  },
  {
    "id": 435,
    "topic": "non-overlapping-intervals",
    "difficulty": "medium"
  },
  {
    "id": 436,
    "topic": "find-right-interval",
    "difficulty": "medium"
  },
  {
    "id": 437,
    "topic": "path-sum-iii",
    "difficulty": "medium"
  },
  {
    "id": 438,
    "topic": "find-all-anagrams-in-a-string",
    "difficulty": "medium"
  },
  {
    "id": 439,
    "topic": "ternary-expression-parser",
    "difficulty": "medium"
  },
  {
    "id": 440,
    "topic": "k-th-smallest-in-lexicographical-order",
    "difficulty": "hard"
  },
  {
    "id": 441,
    "topic": "arranging-coins",
    "difficulty": "easy"
  },
  {
    "id": 442,
    "topic": "find-all-duplicates-in-an-array",
    "difficulty": "medium"
  },
  {
    "id": 443,
    "topic": "string-compression",
    "difficulty": "medium"
  },
  {
    "id": 444,
    "topic": "sequence-reconstruction",
    "difficulty": "medium"
  },
  {
    "id": 445,
    "topic": "add-two-numbers-ii",
    "difficulty": "medium"
  },
  {
    "id": 446,
    "topic": "arithmetic-slices-ii-subsequence",
    "difficulty": "hard"
  },
  {
    "id": 447,
    "topic": "number-of-boomerangs",
    "difficulty": "medium"
  },
  {
    "id": 448,
    "topic": "find-all-numbers-disappeared-in-an-array",
    "difficulty": "easy"
  },
  {
    "id": 449,
    "topic": "serialize-and-deserialize-bst",
    "difficulty": "medium"
  },
  {
    "id": 450,
    "topic": "delete-node-in-a-bst",
    "difficulty": "medium"
  },
  {
    "id": 451,
    "topic": "sort-characters-by-frequency",
    "difficulty": "medium"
  },
  {
    "id": 452,
    "topic": "minimum-number-of-arrows-to-burst-balloons",
    "difficulty": "medium"
  },
  {
    "id": 453,
    "topic": "minimum-moves-to-equal-array-elements",
    "difficulty": "medium"
  },
  {
    "id": 454,
    "topic": "4sum-ii",
    "difficulty": "medium"
  },
  {
    "id": 455,
    "topic": "assign-cookies",
    "difficulty": "easy"
  },
  {
    "id": 456,
    "topic": "132-pattern",
    "difficulty": "medium"
  },
  {
    "id": 457,
    "topic": "circular-array-loop",
    "difficulty": "medium"
  },
  {
    "id": 458,
    "topic": "poor-pigs",
    "difficulty": "hard"
  },
  {
    "id": 459,
    "topic": "repeated-substring-pattern",
    "difficulty": "easy"
  },
  {
    "id": 460,
    "topic": "lfu-cache",
    "difficulty": "hard"
  },
  {
    "id": 461,
    "topic": "hamming-distance",
    "difficulty": "easy"
  },
  {
    "id": 462,
    "topic": "minimum-moves-to-equal-array-elements-ii",
    "difficulty": "medium"
  },
  {
    "id": 463,
    "topic": "island-perimeter",
    "difficulty": "easy"
  },
  {
    "id": 464,
    "topic": "can-i-win",
    "difficulty": "medium"
  },
  {
    "id": 465,
    "topic": "optimal-account-balancing",
    "difficulty": "hard"
  },
  {
    "id": 466,
    "topic": "count-the-repetitions",
    "difficulty": "hard"
  },
  {
    "id": 467,
    "topic": "unique-substrings-in-wraparound-string",
    "difficulty": "medium"
  },
  {
    "id": 468,
    "topic": "validate-ip-address",
    "difficulty": "medium"
  },
  {
    "id": 469,
    "topic": "convex-polygon",
    "difficulty": "medium"
  },
  {
    "id": 471,
    "topic": "encode-string-with-shortest-length",
    "difficulty": "hard"
  },
  {
    "id": 472,
    "topic": "concatenated-words",
    "difficulty": "hard"
  },
  {
    "id": 473,
    "topic": "matchsticks-to-square",
    "difficulty": "medium"
  },
  {
    "id": 474,
    "topic": "ones-and-zeroes",
    "difficulty": "medium"
  },
  {
    "id": 475,
    "topic": "heaters",
    "difficulty": "medium"
  },
  {
    "id": 476,
    "topic": "number-complement",
    "difficulty": "easy"
  },
  {
    "id": 477,
    "topic": "total-hamming-distance",
    "difficulty": "medium"
  },
  {
    "id": 479,
    "topic": "largest-palindrome-product",
    "difficulty": "hard"
  },
  {
    "id": 480,
    "topic": "sliding-window-median",
    "difficulty": "hard"
  },
  {
    "id": 481,
    "topic": "magical-string",
    "difficulty": "medium"
  },
  {
    "id": 482,
    "topic": "license-key-formatting",
    "difficulty": "easy"
  },
  {
    "id": 483,
    "topic": "smallest-good-base",
    "difficulty": "hard"
  },
  {
    "id": 484,
    "topic": "find-permutation",
    "difficulty": "medium"
  },
  {
    "id": 485,
    "topic": "max-consecutive-ones",
    "difficulty": "easy"
  },
  {
    "id": 486,
    "topic": "predict-the-winner",
    "difficulty": "medium"
  },
  {
    "id": 487,
    "topic": "max-consecutive-ones-ii",
    "difficulty": "medium"
  },
  {
    "id": 488,
    "topic": "zuma-game",
    "difficulty": "hard"
  },
  {
    "id": 489,
    "topic": "kth-smallest-instructions",
    "difficulty": "hard"
  },
  {
    "id": 490,
    "topic": "the-maze",
    "difficulty": "medium"
  },
  {
    "id": 491,
    "topic": "increasing-subsequences",
    "difficulty": "medium"
  },
  {
    "id": 492,
    "topic": "construct-the-rectangle",
    "difficulty": "easy"
  },
  {
    "id": 493,
    "topic": "reverse-pairs",
    "difficulty": "hard"
  },
  {
    "id": 494,
    "topic": "target-sum",
    "difficulty": "medium"
  },
  {
    "id": 495,
    "topic": "teemo-attacking",
    "difficulty": "easy"
  },
  {
    "id": 496,
    "topic": "next-greater-element-i",
    "difficulty": "easy"
  },
  {
    "id": 498,
    "topic": "diagonal-traverse",
    "difficulty": "medium"
  },
  {
    "id": 499,
    "topic": "the-maze-iii",
    "difficulty": "hard"
  },
  {
    "id": 500,
    "topic": "keyboard-row",
    "difficulty": "easy"
  },
  {
    "id": 501,
    "topic": "find-mode-in-binary-search-tree",
    "difficulty": "easy"
  },
  {
    "id": 502,
    "topic": "ipo",
    "difficulty": "hard"
  },
  {
    "id": 503,
    "topic": "next-greater-element-ii",
    "difficulty": "medium"
  },
  {
    "id": 504,
    "topic": "base-7",
    "difficulty": "easy"
  },
  {
    "id": 505,
    "topic": "the-maze-ii",
    "difficulty": "medium"
  },
  {
    "id": 506,
    "topic": "relative-ranks",
    "difficulty": "easy"
  },
  {
    "id": 507,
    "topic": "perfect-number",
    "difficulty": "easy"
  },
  {
    "id": 508,
    "topic": "most-frequent-subtree-sum",
    "difficulty": "medium"
  },
  {
    "id": 509,
    "topic": "inorder-successor-in-bst-ii",
    "difficulty": "medium"
  },
  {
    "id": 510,
    "topic": "count-subarrays-with-more-ones-than-zeros",
    "difficulty": "medium"
  },
  {
    "id": 511,
    "topic": "all-paths-from-source-lead-to-destination",
    "difficulty": "medium"
  },
  {
    "id": 512,
    "topic": "maximum-alternating-subarray-sum",
    "difficulty": "medium"
  },
  {
    "id": 513,
    "topic": "find-bottom-left-tree-value",
    "difficulty": "medium"
  },
  {
    "id": 514,
    "topic": "freedom-trail",
    "difficulty": "hard"
  },
  {
    "id": 515,
    "topic": "find-largest-value-in-each-tree-row",
    "difficulty": "medium"
  },
  {
    "id": 516,
    "topic": "longest-palindromic-subsequence",
    "difficulty": "medium"
  },
  {
    "id": 517,
    "topic": "super-washing-machines",
    "difficulty": "hard"
  },
  {
    "id": 518,
    "topic": "coin-change-2",
    "difficulty": "medium"
  },
  {
    "id": 519,
    "topic": "widest-pair-of-indices-with-equal-range-sum",
    "difficulty": "medium"
  },
  {
    "id": 520,
    "topic": "detect-capital",
    "difficulty": "easy"
  },
  {
    "id": 521,
    "topic": "longest-uncommon-subsequence-i",
    "difficulty": "easy"
  },
  {
    "id": 522,
    "topic": "longest-uncommon-subsequence-ii",
    "difficulty": "medium"
  },
  {
    "id": 523,
    "topic": "continuous-subarray-sum",
    "difficulty": "medium"
  },
  {
    "id": 524,
    "topic": "longest-word-in-dictionary-through-deleting",
    "difficulty": "medium"
  },
  {
    "id": 525,
    "topic": "contiguous-array",
    "difficulty": "medium"
  },
  {
    "id": 526,
    "topic": "beautiful-arrangement",
    "difficulty": "medium"
  },
  {
    "id": 527,
    "topic": "word-abbreviation",
    "difficulty": "hard"
  },
  {
    "id": 528,
    "topic": "swapping-nodes-in-a-linked-list",
    "difficulty": "medium"
  },
  {
    "id": 529,
    "topic": "minesweeper",
    "difficulty": "medium"
  },
  {
    "id": 530,
    "topic": "minimum-absolute-difference-in-bst",
    "difficulty": "easy"
  },
  {
    "id": 531,
    "topic": "lonely-pixel-i",
    "difficulty": "medium"
  },
  {
    "id": 532,
    "topic": "k-diff-pairs-in-an-array",
    "difficulty": "medium"
  },
  {
    "id": 533,
    "topic": "lonely-pixel-ii",
    "difficulty": "medium"
  },
  {
    "id": 535,
    "topic": "encode-and-decode-tinyurl",
    "difficulty": "medium"
  },
  {
    "id": 536,
    "topic": "construct-binary-tree-from-string",
    "difficulty": "medium"
  },
  {
    "id": 537,
    "topic": "complex-number-multiplication",
    "difficulty": "medium"
  },
  {
    "id": 538,
    "topic": "convert-bst-to-greater-tree",
    "difficulty": "medium"
  },
  {
    "id": 539,
    "topic": "minimum-time-difference",
    "difficulty": "medium"
  },
  {
    "id": 540,
    "topic": "single-element-in-a-sorted-array",
    "difficulty": "medium"
  },
  {
    "id": 541,
    "topic": "reverse-string-ii",
    "difficulty": "easy"
  },
  {
    "id": 542,
    "topic": "01-matrix",
    "difficulty": "medium"
  },
  {
    "id": 543,
    "topic": "diameter-of-binary-tree",
    "difficulty": "easy"
  },
  {
    "id": 544,
    "topic": "output-contest-matches",
    "difficulty": "medium"
  },
  {
    "id": 545,
    "topic": "boundary-of-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 546,
    "topic": "remove-boxes",
    "difficulty": "hard"
  },
  {
    "id": 547,
    "topic": "number-of-provinces",
    "difficulty": "medium"
  },
  {
    "id": 548,
    "topic": "split-array-with-equal-sum",
    "difficulty": "hard"
  },
  {
    "id": 549,
    "topic": "binary-tree-longest-consecutive-sequence-ii",
    "difficulty": "medium"
  },
  {
    "id": 550,
    "topic": "shortest-path-to-get-food",
    "difficulty": "medium"
  },
  {
    "id": 551,
    "topic": "student-attendance-record-i",
    "difficulty": "easy"
  },
  {
    "id": 552,
    "topic": "student-attendance-record-ii",
    "difficulty": "hard"
  },
  {
    "id": 553,
    "topic": "optimal-division",
    "difficulty": "medium"
  },
  {
    "id": 554,
    "topic": "brick-wall",
    "difficulty": "medium"
  },
  {
    "id": 555,
    "topic": "split-concatenated-strings",
    "difficulty": "medium"
  },
  {
    "id": 556,
    "topic": "next-greater-element-iii",
    "difficulty": "medium"
  },
  {
    "id": 557,
    "topic": "reverse-words-in-a-string-iii",
    "difficulty": "easy"
  },
  {
    "id": 560,
    "topic": "subarray-sum-equals-k",
    "difficulty": "medium"
  },
  {
    "id": 561,
    "topic": "array-partition-i",
    "difficulty": "easy"
  },
  {
    "id": 562,
    "topic": "longest-line-of-consecutive-one-in-matrix",
    "difficulty": "medium"
  },
  {
    "id": 563,
    "topic": "binary-tree-tilt",
    "difficulty": "easy"
  },
  {
    "id": 564,
    "topic": "find-the-closest-palindrome",
    "difficulty": "hard"
  },
  {
    "id": 565,
    "topic": "array-nesting",
    "difficulty": "medium"
  },
  {
    "id": 566,
    "topic": "reshape-the-matrix",
    "difficulty": "easy"
  },
  {
    "id": 567,
    "topic": "permutation-in-string",
    "difficulty": "medium"
  },
  {
    "id": 568,
    "topic": "maximum-vacation-days",
    "difficulty": "hard"
  },
  {
    "id": 569,
    "topic": "median-employee-salary",
    "difficulty": "hard"
  },
  {
    "id": 570,
    "topic": "managers-with-at-least-5-direct-reports",
    "difficulty": "medium"
  },
  {
    "id": 571,
    "topic": "find-median-given-frequency-of-numbers",
    "difficulty": "hard"
  },
  {
    "id": 572,
    "topic": "subtree-of-another-tree",
    "difficulty": "easy"
  },
  {
    "id": 573,
    "topic": "squirrel-simulation",
    "difficulty": "medium"
  },
  {
    "id": 574,
    "topic": "winning-candidate",
    "difficulty": "medium"
  },
  {
    "id": 575,
    "topic": "distribute-candies",
    "difficulty": "easy"
  },
  {
    "id": 576,
    "topic": "out-of-boundary-paths",
    "difficulty": "medium"
  },
  {
    "id": 577,
    "topic": "employee-bonus",
    "difficulty": "easy"
  },
  {
    "id": 578,
    "topic": "get-highest-answer-rate-question",
    "difficulty": "medium"
  },
  {
    "id": 579,
    "topic": "find-cumulative-salary-of-an-employee",
    "difficulty": "hard"
  },
  {
    "id": 580,
    "topic": "count-student-number-in-departments",
    "difficulty": "medium"
  },
  {
    "id": 581,
    "topic": "shortest-unsorted-continuous-subarray",
    "difficulty": "medium"
  },
  {
    "id": 582,
    "topic": "kill-process",
    "difficulty": "medium"
  },
  {
    "id": 583,
    "topic": "delete-operation-for-two-strings",
    "difficulty": "medium"
  },
  {
    "id": 584,
    "topic": "find-customer-referee",
    "difficulty": "easy"
  },
  {
    "id": 585,
    "topic": "investments-in-2016",
    "difficulty": "medium"
  },
  {
    "id": 586,
    "topic": "customer-placing-the-largest-number-of-orders",
    "difficulty": "easy"
  },
  {
    "id": 587,
    "topic": "erect-the-fence",
    "difficulty": "hard"
  },
  {
    "id": 588,
    "topic": "design-in-memory-file-system",
    "difficulty": "hard"
  },
  {
    "id": 591,
    "topic": "tag-validator",
    "difficulty": "hard"
  },
  {
    "id": 592,
    "topic": "fraction-addition-and-subtraction",
    "difficulty": "medium"
  },
  {
    "id": 593,
    "topic": "valid-square",
    "difficulty": "medium"
  },
  {
    "id": 594,
    "topic": "longest-harmonious-subsequence",
    "difficulty": "easy"
  },
  {
    "id": 595,
    "topic": "big-countries",
    "difficulty": "easy"
  },
  {
    "id": 596,
    "topic": "classes-more-than-5-students",
    "difficulty": "easy"
  },
  {
    "id": 597,
    "topic": "friend-requests-i-overall-acceptance-rate",
    "difficulty": "easy"
  },
  {
    "id": 598,
    "topic": "range-addition-ii",
    "difficulty": "easy"
  },
  {
    "id": 599,
    "topic": "minimum-index-sum-of-two-lists",
    "difficulty": "easy"
  },
  {
    "id": 600,
    "topic": "non-negative-integers-without-consecutive-ones",
    "difficulty": "hard"
  },
  {
    "id": 601,
    "topic": "human-traffic-of-stadium",
    "difficulty": "hard"
  },
  {
    "id": 602,
    "topic": "friend-requests-ii-who-has-the-most-friends",
    "difficulty": "medium"
  },
  {
    "id": 603,
    "topic": "consecutive-available-seats",
    "difficulty": "easy"
  },
  {
    "id": 604,
    "topic": "design-compressed-string-iterator",
    "difficulty": "easy"
  },
  {
    "id": 605,
    "topic": "can-place-flowers",
    "difficulty": "easy"
  },
  {
    "id": 606,
    "topic": "construct-string-from-binary-tree",
    "difficulty": "easy"
  },
  {
    "id": 607,
    "topic": "sales-person",
    "difficulty": "easy"
  },
  {
    "id": 608,
    "topic": "tree-node",
    "difficulty": "medium"
  },
  {
    "id": 609,
    "topic": "find-duplicate-file-in-system",
    "difficulty": "medium"
  },
  {
    "id": 610,
    "topic": "triangle-judgement",
    "difficulty": "easy"
  },
  {
    "id": 611,
    "topic": "valid-triangle-number",
    "difficulty": "medium"
  },
  {
    "id": 612,
    "topic": "shortest-distance-in-a-plane",
    "difficulty": "medium"
  },
  {
    "id": 613,
    "topic": "shortest-distance-in-a-line",
    "difficulty": "easy"
  },
  {
    "id": 614,
    "topic": "second-degree-follower",
    "difficulty": "medium"
  },
  {
    "id": 615,
    "topic": "average-salary-departments-vs-company",
    "difficulty": "hard"
  },
  {
    "id": 616,
    "topic": "add-bold-tag-in-string",
    "difficulty": "medium"
  },
  {
    "id": 617,
    "topic": "merge-two-binary-trees",
    "difficulty": "easy"
  },
  {
    "id": 618,
    "topic": "students-report-by-geography",
    "difficulty": "hard"
  },
  {
    "id": 619,
    "topic": "biggest-single-number",
    "difficulty": "easy"
  },
  {
    "id": 620,
    "topic": "not-boring-movies",
    "difficulty": "easy"
  },
  {
    "id": 621,
    "topic": "task-scheduler",
    "difficulty": "medium"
  },
  {
    "id": 623,
    "topic": "add-one-row-to-tree",
    "difficulty": "medium"
  },
  {
    "id": 624,
    "topic": "maximum-distance-in-arrays",
    "difficulty": "medium"
  },
  {
    "id": 625,
    "topic": "minimum-factorization",
    "difficulty": "medium"
  },
  {
    "id": 626,
    "topic": "exchange-seats",
    "difficulty": "medium"
  },
  {
    "id": 627,
    "topic": "swap-salary",
    "difficulty": "easy"
  },
  {
    "id": 628,
    "topic": "maximum-product-of-three-numbers",
    "difficulty": "easy"
  },
  {
    "id": 629,
    "topic": "k-inverse-pairs-array",
    "difficulty": "hard"
  },
  {
    "id": 630,
    "topic": "course-schedule-iii",
    "difficulty": "hard"
  },
  {
    "id": 631,
    "topic": "design-excel-sum-formula",
    "difficulty": "hard"
  },
  {
    "id": 632,
    "topic": "smallest-range-covering-elements-from-k-lists",
    "difficulty": "hard"
  },
  {
    "id": 633,
    "topic": "sum-of-square-numbers",
    "difficulty": "medium"
  },
  {
    "id": 634,
    "topic": "find-the-derangement-of-an-array",
    "difficulty": "medium"
  },
  {
    "id": 635,
    "topic": "design-log-storage-system",
    "difficulty": "medium"
  },
  {
    "id": 636,
    "topic": "exclusive-time-of-functions",
    "difficulty": "medium"
  },
  {
    "id": 637,
    "topic": "average-of-levels-in-binary-tree",
    "difficulty": "easy"
  },
  {
    "id": 638,
    "topic": "shopping-offers",
    "difficulty": "medium"
  },
  {
    "id": 639,
    "topic": "decode-ways-ii",
    "difficulty": "hard"
  },
  {
    "id": 640,
    "topic": "solve-the-equation",
    "difficulty": "medium"
  },
  {
    "id": 642,
    "topic": "design-search-autocomplete-system",
    "difficulty": "hard"
  },
  {
    "id": 643,
    "topic": "maximum-average-subarray-i",
    "difficulty": "easy"
  },
  {
    "id": 644,
    "topic": "maximum-average-subarray-ii",
    "difficulty": "hard"
  },
  {
    "id": 645,
    "topic": "set-mismatch",
    "difficulty": "easy"
  },
  {
    "id": 646,
    "topic": "maximum-length-of-pair-chain",
    "difficulty": "medium"
  },
  {
    "id": 647,
    "topic": "palindromic-substrings",
    "difficulty": "medium"
  },
  {
    "id": 648,
    "topic": "replace-words",
    "difficulty": "medium"
  },
  {
    "id": 649,
    "topic": "dota2-senate",
    "difficulty": "medium"
  },
  {
    "id": 650,
    "topic": "2-keys-keyboard",
    "difficulty": "medium"
  },
  {
    "id": 651,
    "topic": "4-keys-keyboard",
    "difficulty": "medium"
  },
  {
    "id": 652,
    "topic": "find-duplicate-subtrees",
    "difficulty": "medium"
  },
  {
    "id": 653,
    "topic": "two-sum-iv-input-is-a-bst",
    "difficulty": "easy"
  },
  {
    "id": 654,
    "topic": "maximum-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 655,
    "topic": "print-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 656,
    "topic": "coin-path",
    "difficulty": "hard"
  },
  {
    "id": 657,
    "topic": "robot-return-to-origin",
    "difficulty": "easy"
  },
  {
    "id": 658,
    "topic": "find-k-closest-elements",
    "difficulty": "medium"
  },
  {
    "id": 659,
    "topic": "split-array-into-consecutive-subsequences",
    "difficulty": "medium"
  },
  {
    "id": 660,
    "topic": "remove-9",
    "difficulty": "hard"
  },
  {
    "id": 661,
    "topic": "image-smoother",
    "difficulty": "easy"
  },
  {
    "id": 662,
    "topic": "maximum-width-of-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 663,
    "topic": "equal-tree-partition",
    "difficulty": "medium"
  },
  {
    "id": 664,
    "topic": "strange-printer",
    "difficulty": "hard"
  },
  {
    "id": 665,
    "topic": "non-decreasing-array",
    "difficulty": "medium"
  },
  {
    "id": 666,
    "topic": "path-sum-iv",
    "difficulty": "medium"
  },
  {
    "id": 667,
    "topic": "beautiful-arrangement-ii",
    "difficulty": "medium"
  },
  {
    "id": 668,
    "topic": "kth-smallest-number-in-multiplication-table",
    "difficulty": "hard"
  },
  {
    "id": 669,
    "topic": "trim-a-binary-search-tree",
    "difficulty": "medium"
  },
  {
    "id": 670,
    "topic": "maximum-swap",
    "difficulty": "medium"
  },
  {
    "id": 671,
    "topic": "second-minimum-node-in-a-binary-tree",
    "difficulty": "easy"
  },
  {
    "id": 672,
    "topic": "bulb-switcher-ii",
    "difficulty": "medium"
  },
  {
    "id": 673,
    "topic": "number-of-longest-increasing-subsequence",
    "difficulty": "medium"
  },
  {
    "id": 674,
    "topic": "longest-continuous-increasing-subsequence",
    "difficulty": "easy"
  },
  {
    "id": 675,
    "topic": "cut-off-trees-for-golf-event",
    "difficulty": "hard"
  },
  {
    "id": 676,
    "topic": "implement-magic-dictionary",
    "difficulty": "medium"
  },
  {
    "id": 677,
    "topic": "map-sum-pairs",
    "difficulty": "medium"
  },
  {
    "id": 678,
    "topic": "valid-parenthesis-string",
    "difficulty": "medium"
  },
  {
    "id": 679,
    "topic": "24-game",
    "difficulty": "hard"
  },
  {
    "id": 680,
    "topic": "valid-palindrome-ii",
    "difficulty": "easy"
  },
  {
    "id": 681,
    "topic": "next-closest-time",
    "difficulty": "medium"
  },
  {
    "id": 682,
    "topic": "baseball-game",
    "difficulty": "easy"
  },
  {
    "id": 683,
    "topic": "k-empty-slots",
    "difficulty": "hard"
  },
  {
    "id": 684,
    "topic": "redundant-connection",
    "difficulty": "medium"
  },
  {
    "id": 685,
    "topic": "redundant-connection-ii",
    "difficulty": "hard"
  },
  {
    "id": 686,
    "topic": "repeated-string-match",
    "difficulty": "medium"
  },
  {
    "id": 687,
    "topic": "longest-univalue-path",
    "difficulty": "medium"
  },
  {
    "id": 688,
    "topic": "knight-probability-in-chessboard",
    "difficulty": "medium"
  },
  {
    "id": 689,
    "topic": "maximum-sum-of-3-non-overlapping-subarrays",
    "difficulty": "hard"
  },
  {
    "id": 690,
    "topic": "employee-importance",
    "difficulty": "medium"
  },
  {
    "id": 691,
    "topic": "stickers-to-spell-word",
    "difficulty": "hard"
  },
  {
    "id": 692,
    "topic": "top-k-frequent-words",
    "difficulty": "medium"
  },
  {
    "id": 693,
    "topic": "binary-number-with-alternating-bits",
    "difficulty": "easy"
  },
  {
    "id": 694,
    "topic": "number-of-distinct-islands",
    "difficulty": "medium"
  },
  {
    "id": 695,
    "topic": "max-area-of-island",
    "difficulty": "medium"
  },
  {
    "id": 696,
    "topic": "count-binary-substrings",
    "difficulty": "easy"
  },
  {
    "id": 697,
    "topic": "degree-of-an-array",
    "difficulty": "easy"
  },
  {
    "id": 698,
    "topic": "partition-to-k-equal-sum-subsets",
    "difficulty": "medium"
  },
  {
    "id": 699,
    "topic": "falling-squares",
    "difficulty": "hard"
  },
  {
    "id": 711,
    "topic": "number-of-distinct-islands-ii",
    "difficulty": "hard"
  },
  {
    "id": 712,
    "topic": "minimum-ascii-delete-sum-for-two-strings",
    "difficulty": "medium"
  },
  {
    "id": 713,
    "topic": "subarray-product-less-than-k",
    "difficulty": "medium"
  },
  {
    "id": 714,
    "topic": "best-time-to-buy-and-sell-stock-with-transaction-fee",
    "difficulty": "medium"
  },
  {
    "id": 715,
    "topic": "range-module",
    "difficulty": "hard"
  },
  {
    "id": 716,
    "topic": "max-stack",
    "difficulty": "easy"
  },
  {
    "id": 717,
    "topic": "1-bit-and-2-bit-characters",
    "difficulty": "easy"
  },
  {
    "id": 718,
    "topic": "maximum-length-of-repeated-subarray",
    "difficulty": "medium"
  },
  {
    "id": 719,
    "topic": "find-k-th-smallest-pair-distance",
    "difficulty": "hard"
  },
  {
    "id": 720,
    "topic": "longest-word-in-dictionary",
    "difficulty": "medium"
  },
  {
    "id": 721,
    "topic": "accounts-merge",
    "difficulty": "medium"
  },
  {
    "id": 722,
    "topic": "remove-comments",
    "difficulty": "medium"
  },
  {
    "id": 723,
    "topic": "candy-crush",
    "difficulty": "medium"
  },
  {
    "id": 724,
    "topic": "find-pivot-index",
    "difficulty": "easy"
  },
  {
    "id": 725,
    "topic": "split-linked-list-in-parts",
    "difficulty": "medium"
  },
  {
    "id": 726,
    "topic": "number-of-atoms",
    "difficulty": "hard"
  },
  {
    "id": 727,
    "topic": "minimum-window-subsequence",
    "difficulty": "hard"
  },
  {
    "id": 728,
    "topic": "self-dividing-numbers",
    "difficulty": "easy"
  },
  {
    "id": 729,
    "topic": "my-calendar-i",
    "difficulty": "medium"
  },
  {
    "id": 730,
    "topic": "count-different-palindromic-subsequences",
    "difficulty": "hard"
  },
  {
    "id": 731,
    "topic": "my-calendar-ii",
    "difficulty": "medium"
  },
  {
    "id": 732,
    "topic": "my-calendar-iii",
    "difficulty": "hard"
  },
  {
    "id": 733,
    "topic": "flood-fill",
    "difficulty": "easy"
  },
  {
    "id": 734,
    "topic": "sentence-similarity",
    "difficulty": "easy"
  },
  {
    "id": 735,
    "topic": "asteroid-collision",
    "difficulty": "medium"
  },
  {
    "id": 736,
    "topic": "parse-lisp-expression",
    "difficulty": "hard"
  },
  {
    "id": 737,
    "topic": "sentence-similarity-ii",
    "difficulty": "medium"
  },
  {
    "id": 738,
    "topic": "monotone-increasing-digits",
    "difficulty": "medium"
  },
  {
    "id": 739,
    "topic": "daily-temperatures",
    "difficulty": "medium"
  },
  {
    "id": 740,
    "topic": "delete-and-earn",
    "difficulty": "medium"
  },
  {
    "id": 741,
    "topic": "cherry-pickup",
    "difficulty": "hard"
  },
  {
    "id": 742,
    "topic": "to-lower-case",
    "difficulty": "easy"
  },
  {
    "id": 743,
    "topic": "closest-leaf-in-a-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 744,
    "topic": "network-delay-time",
    "difficulty": "medium"
  },
  {
    "id": 745,
    "topic": "find-smallest-letter-greater-than-target",
    "difficulty": "easy"
  },
  {
    "id": 746,
    "topic": "prefix-and-suffix-search",
    "difficulty": "hard"
  },
  {
    "id": 747,
    "topic": "min-cost-climbing-stairs",
    "difficulty": "easy"
  },
  {
    "id": 748,
    "topic": "largest-number-at-least-twice-of-others",
    "difficulty": "easy"
  },
  {
    "id": 749,
    "topic": "shortest-completing-word",
    "difficulty": "easy"
  },
  {
    "id": 750,
    "topic": "contain-virus",
    "difficulty": "hard"
  },
  {
    "id": 751,
    "topic": "number-of-corner-rectangles",
    "difficulty": "medium"
  },
  {
    "id": 752,
    "topic": "ip-to-cidr",
    "difficulty": "medium"
  },
  {
    "id": 753,
    "topic": "open-the-lock",
    "difficulty": "medium"
  },
  {
    "id": 754,
    "topic": "cracking-the-safe",
    "difficulty": "hard"
  },
  {
    "id": 755,
    "topic": "reach-a-number",
    "difficulty": "medium"
  },
  {
    "id": 756,
    "topic": "pour-water",
    "difficulty": "medium"
  },
  {
    "id": 757,
    "topic": "pyramid-transition-matrix",
    "difficulty": "medium"
  },
  {
    "id": 758,
    "topic": "convert-binary-search-tree-to-sorted-doubly-linked-list",
    "difficulty": "medium"
  },
  {
    "id": 759,
    "topic": "set-intersection-size-at-least-two",
    "difficulty": "hard"
  },
  {
    "id": 760,
    "topic": "bold-words-in-string",
    "difficulty": "medium"
  },
  {
    "id": 761,
    "topic": "employee-free-time",
    "difficulty": "hard"
  },
  {
    "id": 762,
    "topic": "find-anagram-mappings",
    "difficulty": "easy"
  },
  {
    "id": 763,
    "topic": "special-binary-string",
    "difficulty": "hard"
  },
  {
    "id": 764,
    "topic": "n-ary-tree-level-order-traversal",
    "difficulty": "medium"
  },
  {
    "id": 765,
    "topic": "serialize-and-deserialize-n-ary-tree",
    "difficulty": "hard"
  },
  {
    "id": 766,
    "topic": "flatten-a-multilevel-doubly-linked-list",
    "difficulty": "medium"
  },
  {
    "id": 767,
    "topic": "prime-number-of-set-bits-in-binary-representation",
    "difficulty": "easy"
  },
  {
    "id": 768,
    "topic": "partition-labels",
    "difficulty": "medium"
  },
  {
    "id": 769,
    "topic": "largest-plus-sign",
    "difficulty": "medium"
  },
  {
    "id": 770,
    "topic": "couples-holding-hands",
    "difficulty": "hard"
  },
  {
    "id": 771,
    "topic": "encode-n-ary-tree-to-binary-tree",
    "difficulty": "hard"
  },
  {
    "id": 772,
    "topic": "construct-quad-tree",
    "difficulty": "medium"
  },
  {
    "id": 773,
    "topic": "logical-or-of-two-binary-grids-represented-as-quad-trees",
    "difficulty": "medium"
  },
  {
    "id": 774,
    "topic": "maximum-depth-of-n-ary-tree",
    "difficulty": "easy"
  },
  {
    "id": 775,
    "topic": "n-ary-tree-preorder-traversal",
    "difficulty": "easy"
  },
  {
    "id": 776,
    "topic": "n-ary-tree-postorder-traversal",
    "difficulty": "easy"
  },
  {
    "id": 777,
    "topic": "toeplitz-matrix",
    "difficulty": "easy"
  },
  {
    "id": 778,
    "topic": "reorganize-string",
    "difficulty": "medium"
  },
  {
    "id": 779,
    "topic": "max-chunks-to-make-sorted-ii",
    "difficulty": "hard"
  },
  {
    "id": 780,
    "topic": "max-chunks-to-make-sorted",
    "difficulty": "medium"
  },
  {
    "id": 781,
    "topic": "basic-calculator-iv",
    "difficulty": "hard"
  },
  {
    "id": 782,
    "topic": "jewels-and-stones",
    "difficulty": "easy"
  },
  {
    "id": 783,
    "topic": "search-in-a-binary-search-tree",
    "difficulty": "easy"
  },
  {
    "id": 784,
    "topic": "insert-into-a-binary-search-tree",
    "difficulty": "medium"
  },
  {
    "id": 785,
    "topic": "basic-calculator-iii",
    "difficulty": "hard"
  },
  {
    "id": 786,
    "topic": "search-in-a-sorted-array-of-unknown-size",
    "difficulty": "medium"
  },
  {
    "id": 787,
    "topic": "sliding-puzzle",
    "difficulty": "hard"
  },
  {
    "id": 788,
    "topic": "minimize-max-distance-to-gas-station",
    "difficulty": "hard"
  },
  {
    "id": 789,
    "topic": "kth-largest-element-in-a-stream",
    "difficulty": "easy"
  },
  {
    "id": 790,
    "topic": "global-and-local-inversions",
    "difficulty": "medium"
  },
  {
    "id": 791,
    "topic": "split-bst",
    "difficulty": "medium"
  },
  {
    "id": 792,
    "topic": "binary-search",
    "difficulty": "easy"
  },
  {
    "id": 793,
    "topic": "swap-adjacent-in-lr-string",
    "difficulty": "medium"
  },
  {
    "id": 794,
    "topic": "swim-in-rising-water",
    "difficulty": "hard"
  },
  {
    "id": 795,
    "topic": "k-th-symbol-in-grammar",
    "difficulty": "medium"
  },
  {
    "id": 796,
    "topic": "reaching-points",
    "difficulty": "hard"
  },
  {
    "id": 797,
    "topic": "rabbits-in-forest",
    "difficulty": "medium"
  },
  {
    "id": 798,
    "topic": "transform-to-chessboard",
    "difficulty": "hard"
  },
  {
    "id": 799,
    "topic": "minimum-distance-between-bst-nodes",
    "difficulty": "easy"
  },
  {
    "id": 800,
    "topic": "letter-case-permutation",
    "difficulty": "medium"
  },
  {
    "id": 801,
    "topic": "is-graph-bipartite",
    "difficulty": "medium"
  },
  {
    "id": 802,
    "topic": "k-th-smallest-prime-fraction",
    "difficulty": "hard"
  },
  {
    "id": 803,
    "topic": "cheapest-flights-within-k-stops",
    "difficulty": "medium"
  },
  {
    "id": 804,
    "topic": "rotated-digits",
    "difficulty": "medium"
  },
  {
    "id": 805,
    "topic": "escape-the-ghosts",
    "difficulty": "medium"
  },
  {
    "id": 806,
    "topic": "domino-and-tromino-tiling",
    "difficulty": "medium"
  },
  {
    "id": 807,
    "topic": "custom-sort-string",
    "difficulty": "medium"
  },
  {
    "id": 808,
    "topic": "number-of-matching-subsequences",
    "difficulty": "medium"
  },
  {
    "id": 809,
    "topic": "preimage-size-of-factorial-zeroes-function",
    "difficulty": "hard"
  },
  {
    "id": 810,
    "topic": "valid-tic-tac-toe-state",
    "difficulty": "medium"
  },
  {
    "id": 811,
    "topic": "number-of-subarrays-with-bounded-maximum",
    "difficulty": "medium"
  },
  {
    "id": 812,
    "topic": "rotate-string",
    "difficulty": "easy"
  },
  {
    "id": 813,
    "topic": "all-paths-from-source-to-target",
    "difficulty": "medium"
  },
  {
    "id": 814,
    "topic": "smallest-rotation-with-highest-score",
    "difficulty": "hard"
  },
  {
    "id": 815,
    "topic": "champagne-tower",
    "difficulty": "medium"
  },
  {
    "id": 816,
    "topic": "design-hashset",
    "difficulty": "easy"
  },
  {
    "id": 817,
    "topic": "design-hashmap",
    "difficulty": "easy"
  },
  {
    "id": 818,
    "topic": "similar-rgb-color",
    "difficulty": "easy"
  },
  {
    "id": 819,
    "topic": "minimum-swaps-to-make-sequences-increasing",
    "difficulty": "hard"
  },
  {
    "id": 820,
    "topic": "find-eventual-safe-states",
    "difficulty": "medium"
  },
  {
    "id": 821,
    "topic": "bricks-falling-when-hit",
    "difficulty": "hard"
  },
  {
    "id": 822,
    "topic": "unique-morse-code-words",
    "difficulty": "easy"
  },
  {
    "id": 823,
    "topic": "split-array-with-same-average",
    "difficulty": "hard"
  },
  {
    "id": 824,
    "topic": "number-of-lines-to-write-string",
    "difficulty": "easy"
  },
  {
    "id": 825,
    "topic": "max-increase-to-keep-city-skyline",
    "difficulty": "medium"
  },
  {
    "id": 826,
    "topic": "soup-servings",
    "difficulty": "medium"
  },
  {
    "id": 827,
    "topic": "expressive-words",
    "difficulty": "medium"
  },
  {
    "id": 828,
    "topic": "chalkboard-xor-game",
    "difficulty": "hard"
  },
  {
    "id": 829,
    "topic": "subdomain-visit-count",
    "difficulty": "medium"
  },
  {
    "id": 830,
    "topic": "largest-triangle-area",
    "difficulty": "easy"
  },
  {
    "id": 831,
    "topic": "largest-sum-of-averages",
    "difficulty": "medium"
  },
  {
    "id": 832,
    "topic": "binary-tree-pruning",
    "difficulty": "medium"
  },
  {
    "id": 833,
    "topic": "bus-routes",
    "difficulty": "hard"
  },
  {
    "id": 834,
    "topic": "ambiguous-coordinates",
    "difficulty": "medium"
  },
  {
    "id": 835,
    "topic": "linked-list-components",
    "difficulty": "medium"
  },
  {
    "id": 836,
    "topic": "race-car",
    "difficulty": "hard"
  },
  {
    "id": 837,
    "topic": "most-common-word",
    "difficulty": "easy"
  },
  {
    "id": 838,
    "topic": "design-linked-list",
    "difficulty": "medium"
  },
  {
    "id": 839,
    "topic": "short-encoding-of-words",
    "difficulty": "medium"
  },
  {
    "id": 841,
    "topic": "shortest-distance-to-a-character",
    "difficulty": "easy"
  },
  {
    "id": 842,
    "topic": "card-flipping-game",
    "difficulty": "medium"
  },
  {
    "id": 843,
    "topic": "binary-trees-with-factors",
    "difficulty": "medium"
  },
  {
    "id": 850,
    "topic": "insert-into-a-sorted-circular-linked-list",
    "difficulty": "medium"
  },
  {
    "id": 851,
    "topic": "goat-latin",
    "difficulty": "easy"
  },
  {
    "id": 852,
    "topic": "friends-of-appropriate-ages",
    "difficulty": "medium"
  },
  {
    "id": 853,
    "topic": "most-profit-assigning-work",
    "difficulty": "medium"
  },
  {
    "id": 854,
    "topic": "making-a-large-island",
    "difficulty": "hard"
  },
  {
    "id": 855,
    "topic": "count-unique-characters-of-all-substrings-of-a-given-string",
    "difficulty": "hard"
  },
  {
    "id": 856,
    "topic": "consecutive-numbers-sum",
    "difficulty": "hard"
  },
  {
    "id": 857,
    "topic": "positions-of-large-groups",
    "difficulty": "easy"
  },
  {
    "id": 858,
    "topic": "masking-personal-information",
    "difficulty": "medium"
  },
  {
    "id": 859,
    "topic": "design-circular-deque",
    "difficulty": "medium"
  },
  {
    "id": 860,
    "topic": "design-circular-queue",
    "difficulty": "medium"
  },
  {
    "id": 861,
    "topic": "flipping-an-image",
    "difficulty": "easy"
  },
  {
    "id": 862,
    "topic": "find-and-replace-in-string",
    "difficulty": "medium"
  },
  {
    "id": 863,
    "topic": "sum-of-distances-in-tree",
    "difficulty": "hard"
  },
  {
    "id": 864,
    "topic": "image-overlap",
    "difficulty": "medium"
  },
  {
    "id": 865,
    "topic": "robot-room-cleaner",
    "difficulty": "hard"
  },
  {
    "id": 866,
    "topic": "rectangle-overlap",
    "difficulty": "easy"
  },
  {
    "id": 867,
    "topic": "new-21-game",
    "difficulty": "medium"
  },
  {
    "id": 868,
    "topic": "push-dominoes",
    "difficulty": "medium"
  },
  {
    "id": 869,
    "topic": "similar-string-groups",
    "difficulty": "hard"
  },
  {
    "id": 870,
    "topic": "magic-squares-in-grid",
    "difficulty": "medium"
  },
  {
    "id": 871,
    "topic": "keys-and-rooms",
    "difficulty": "medium"
  },
  {
    "id": 872,
    "topic": "split-array-into-fibonacci-sequence",
    "difficulty": "medium"
  },
  {
    "id": 873,
    "topic": "guess-the-word",
    "difficulty": "hard"
  },
  {
    "id": 874,
    "topic": "backspace-string-compare",
    "difficulty": "easy"
  },
  {
    "id": 875,
    "topic": "longest-mountain-in-array",
    "difficulty": "medium"
  },
  {
    "id": 876,
    "topic": "hand-of-straights",
    "difficulty": "medium"
  },
  {
    "id": 877,
    "topic": "shortest-path-visiting-all-nodes",
    "difficulty": "hard"
  },
  {
    "id": 878,
    "topic": "shifting-letters",
    "difficulty": "medium"
  },
  {
    "id": 879,
    "topic": "maximize-distance-to-closest-person",
    "difficulty": "medium"
  },
  {
    "id": 880,
    "topic": "rectangle-area-ii",
    "difficulty": "hard"
  },
  {
    "id": 881,
    "topic": "loud-and-rich",
    "difficulty": "medium"
  },
  {
    "id": 882,
    "topic": "peak-index-in-a-mountain-array",
    "difficulty": "easy"
  },
  {
    "id": 883,
    "topic": "car-fleet",
    "difficulty": "medium"
  },
  {
    "id": 884,
    "topic": "k-similar-strings",
    "difficulty": "hard"
  },
  {
    "id": 885,
    "topic": "exam-room",
    "difficulty": "medium"
  },
  {
    "id": 886,
    "topic": "score-of-parentheses",
    "difficulty": "medium"
  },
  {
    "id": 887,
    "topic": "minimum-cost-to-hire-k-workers",
    "difficulty": "hard"
  },
  {
    "id": 888,
    "topic": "mirror-reflection",
    "difficulty": "medium"
  },
  {
    "id": 889,
    "topic": "buddy-strings",
    "difficulty": "easy"
  },
  {
    "id": 890,
    "topic": "lemonade-change",
    "difficulty": "easy"
  },
  {
    "id": 891,
    "topic": "score-after-flipping-matrix",
    "difficulty": "medium"
  },
  {
    "id": 892,
    "topic": "shortest-subarray-with-sum-at-least-k",
    "difficulty": "hard"
  },
  {
    "id": 893,
    "topic": "all-nodes-distance-k-in-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 894,
    "topic": "random-pick-with-blacklist",
    "difficulty": "hard"
  },
  {
    "id": 895,
    "topic": "shortest-path-to-get-all-keys",
    "difficulty": "hard"
  },
  {
    "id": 896,
    "topic": "smallest-subtree-with-all-the-deepest-nodes",
    "difficulty": "medium"
  },
  {
    "id": 897,
    "topic": "prime-palindrome",
    "difficulty": "medium"
  },
  {
    "id": 898,
    "topic": "transpose-matrix",
    "difficulty": "easy"
  },
  {
    "id": 899,
    "topic": "binary-gap",
    "difficulty": "easy"
  },
  {
    "id": 900,
    "topic": "reordered-power-of-2",
    "difficulty": "medium"
  },
  {
    "id": 901,
    "topic": "advantage-shuffle",
    "difficulty": "medium"
  },
  {
    "id": 902,
    "topic": "minimum-number-of-refueling-stops",
    "difficulty": "hard"
  },
  {
    "id": 903,
    "topic": "implement-rand10-using-rand7",
    "difficulty": "medium"
  },
  {
    "id": 904,
    "topic": "leaf-similar-trees",
    "difficulty": "easy"
  },
  {
    "id": 905,
    "topic": "length-of-longest-fibonacci-subsequence",
    "difficulty": "medium"
  },
  {
    "id": 906,
    "topic": "walking-robot-simulation",
    "difficulty": "medium"
  },
  {
    "id": 907,
    "topic": "koko-eating-bananas",
    "difficulty": "medium"
  },
  {
    "id": 908,
    "topic": "middle-of-the-linked-list",
    "difficulty": "easy"
  },
  {
    "id": 909,
    "topic": "stone-game",
    "difficulty": "medium"
  },
  {
    "id": 910,
    "topic": "nth-magical-number",
    "difficulty": "hard"
  },
  {
    "id": 911,
    "topic": "profitable-schemes",
    "difficulty": "hard"
  },
  {
    "id": 912,
    "topic": "random-pick-with-weight",
    "difficulty": "medium"
  },
  {
    "id": 913,
    "topic": "random-flip-matrix",
    "difficulty": "medium"
  },
  {
    "id": 914,
    "topic": "random-point-in-non-overlapping-rectangles",
    "difficulty": "medium"
  },
  {
    "id": 915,
    "topic": "generate-random-point-in-a-circle",
    "difficulty": "medium"
  },
  {
    "id": 916,
    "topic": "decoded-string-at-index",
    "difficulty": "medium"
  },
  {
    "id": 917,
    "topic": "boats-to-save-people",
    "difficulty": "medium"
  },
  {
    "id": 918,
    "topic": "reachable-nodes-in-subdivided-graph",
    "difficulty": "hard"
  },
  {
    "id": 919,
    "topic": "projection-area-of-3d-shapes",
    "difficulty": "easy"
  },
  {
    "id": 920,
    "topic": "uncommon-words-from-two-sentences",
    "difficulty": "easy"
  },
  {
    "id": 921,
    "topic": "spiral-matrix-iii",
    "difficulty": "medium"
  },
  {
    "id": 922,
    "topic": "possible-bipartition",
    "difficulty": "medium"
  },
  {
    "id": 923,
    "topic": "super-egg-drop",
    "difficulty": "hard"
  },
  {
    "id": 924,
    "topic": "fair-candy-swap",
    "difficulty": "easy"
  },
  {
    "id": 925,
    "topic": "construct-binary-tree-from-preorder-and-postorder-traversal",
    "difficulty": "medium"
  },
  {
    "id": 926,
    "topic": "find-and-replace-pattern",
    "difficulty": "medium"
  },
  {
    "id": 927,
    "topic": "sum-of-subsequence-widths",
    "difficulty": "hard"
  },
  {
    "id": 928,
    "topic": "surface-area-of-3d-shapes",
    "difficulty": "easy"
  },
  {
    "id": 929,
    "topic": "groups-of-special-equivalent-strings",
    "difficulty": "medium"
  },
  {
    "id": 930,
    "topic": "all-possible-full-binary-trees",
    "difficulty": "medium"
  },
  {
    "id": 931,
    "topic": "maximum-frequency-stack",
    "difficulty": "hard"
  },
  {
    "id": 932,
    "topic": "monotonic-array",
    "difficulty": "easy"
  },
  {
    "id": 933,
    "topic": "increasing-order-search-tree",
    "difficulty": "easy"
  },
  {
    "id": 934,
    "topic": "bitwise-ors-of-subarrays",
    "difficulty": "medium"
  },
  {
    "id": 935,
    "topic": "orderly-queue",
    "difficulty": "hard"
  },
  {
    "id": 936,
    "topic": "rle-iterator",
    "difficulty": "medium"
  },
  {
    "id": 937,
    "topic": "online-stock-span",
    "difficulty": "medium"
  },
  {
    "id": 938,
    "topic": "numbers-at-most-n-given-digit-set",
    "difficulty": "hard"
  },
  {
    "id": 939,
    "topic": "valid-permutations-for-di-sequence",
    "difficulty": "hard"
  },
  {
    "id": 940,
    "topic": "fruit-into-baskets",
    "difficulty": "medium"
  },
  {
    "id": 941,
    "topic": "sort-array-by-parity",
    "difficulty": "easy"
  },
  {
    "id": 942,
    "topic": "super-palindromes",
    "difficulty": "hard"
  },
  {
    "id": 943,
    "topic": "sum-of-subarray-minimums",
    "difficulty": "medium"
  },
  {
    "id": 944,
    "topic": "smallest-range-i",
    "difficulty": "easy"
  },
  {
    "id": 945,
    "topic": "snakes-and-ladders",
    "difficulty": "medium"
  },
  {
    "id": 946,
    "topic": "smallest-range-ii",
    "difficulty": "medium"
  },
  {
    "id": 947,
    "topic": "online-election",
    "difficulty": "medium"
  },
  {
    "id": 948,
    "topic": "sort-an-array",
    "difficulty": "medium"
  },
  {
    "id": 949,
    "topic": "cat-and-mouse",
    "difficulty": "hard"
  },
  {
    "id": 950,
    "topic": "x-of-a-kind-in-a-deck-of-cards",
    "difficulty": "easy"
  },
  {
    "id": 951,
    "topic": "partition-array-into-disjoint-intervals",
    "difficulty": "medium"
  },
  {
    "id": 952,
    "topic": "word-subsets",
    "difficulty": "medium"
  },
  {
    "id": 953,
    "topic": "reverse-only-letters",
    "difficulty": "easy"
  },
  {
    "id": 954,
    "topic": "maximum-sum-circular-subarray",
    "difficulty": "medium"
  },
  {
    "id": 955,
    "topic": "complete-binary-tree-inserter",
    "difficulty": "medium"
  },
  {
    "id": 956,
    "topic": "number-of-music-playlists",
    "difficulty": "hard"
  },
  {
    "id": 957,
    "topic": "minimum-add-to-make-parentheses-valid",
    "difficulty": "medium"
  },
  {
    "id": 958,
    "topic": "sort-array-by-parity-ii",
    "difficulty": "easy"
  },
  {
    "id": 959,
    "topic": "3sum-with-multiplicity",
    "difficulty": "medium"
  },
  {
    "id": 960,
    "topic": "minimize-malware-spread",
    "difficulty": "hard"
  },
  {
    "id": 961,
    "topic": "long-pressed-name",
    "difficulty": "easy"
  },
  {
    "id": 962,
    "topic": "flip-string-to-monotone-increasing",
    "difficulty": "medium"
  },
  {
    "id": 963,
    "topic": "three-equal-parts",
    "difficulty": "hard"
  },
  {
    "id": 964,
    "topic": "minimize-malware-spread-ii",
    "difficulty": "hard"
  },
  {
    "id": 965,
    "topic": "unique-email-addresses",
    "difficulty": "easy"
  },
  {
    "id": 966,
    "topic": "binary-subarrays-with-sum",
    "difficulty": "medium"
  },
  {
    "id": 967,
    "topic": "minimum-falling-path-sum",
    "difficulty": "medium"
  },
  {
    "id": 968,
    "topic": "beautiful-array",
    "difficulty": "medium"
  },
  {
    "id": 969,
    "topic": "number-of-recent-calls",
    "difficulty": "easy"
  },
  {
    "id": 971,
    "topic": "shortest-bridge",
    "difficulty": "medium"
  },
  {
    "id": 972,
    "topic": "knight-dialer",
    "difficulty": "medium"
  },
  {
    "id": 973,
    "topic": "stamping-the-sequence",
    "difficulty": "hard"
  },
  {
    "id": 974,
    "topic": "reorder-data-in-log-files",
    "difficulty": "easy"
  },
  {
    "id": 975,
    "topic": "range-sum-of-bst",
    "difficulty": "easy"
  },
  {
    "id": 976,
    "topic": "minimum-area-rectangle",
    "difficulty": "medium"
  },
  {
    "id": 977,
    "topic": "distinct-subsequences-ii",
    "difficulty": "hard"
  },
  {
    "id": 978,
    "topic": "valid-mountain-array",
    "difficulty": "easy"
  },
  {
    "id": 979,
    "topic": "di-string-match",
    "difficulty": "easy"
  },
  {
    "id": 980,
    "topic": "find-the-shortest-superstring",
    "difficulty": "hard"
  },
  {
    "id": 981,
    "topic": "delete-columns-to-make-sorted",
    "difficulty": "easy"
  },
  {
    "id": 982,
    "topic": "minimum-increment-to-make-array-unique",
    "difficulty": "medium"
  },
  {
    "id": 983,
    "topic": "validate-stack-sequences",
    "difficulty": "medium"
  },
  {
    "id": 984,
    "topic": "most-stones-removed-with-same-row-or-column",
    "difficulty": "medium"
  },
  {
    "id": 985,
    "topic": "bag-of-tokens",
    "difficulty": "medium"
  },
  {
    "id": 986,
    "topic": "largest-time-for-given-digits",
    "difficulty": "medium"
  },
  {
    "id": 987,
    "topic": "reveal-cards-in-increasing-order",
    "difficulty": "medium"
  },
  {
    "id": 988,
    "topic": "flip-equivalent-binary-trees",
    "difficulty": "medium"
  },
  {
    "id": 989,
    "topic": "largest-component-size-by-common-factor",
    "difficulty": "hard"
  },
  {
    "id": 990,
    "topic": "verifying-an-alien-dictionary",
    "difficulty": "easy"
  },
  {
    "id": 991,
    "topic": "array-of-doubled-pairs",
    "difficulty": "medium"
  },
  {
    "id": 992,
    "topic": "delete-columns-to-make-sorted-ii",
    "difficulty": "medium"
  },
  {
    "id": 993,
    "topic": "tallest-billboard",
    "difficulty": "hard"
  },
  {
    "id": 994,
    "topic": "prison-cells-after-n-days",
    "difficulty": "medium"
  },
  {
    "id": 998,
    "topic": "check-completeness-of-a-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 999,
    "topic": "regions-cut-by-slashes",
    "difficulty": "medium"
  },
  {
    "id": 1000,
    "topic": "delete-columns-to-make-sorted-iii",
    "difficulty": "hard"
  },
  {
    "id": 1001,
    "topic": "n-repeated-element-in-size-2n-array",
    "difficulty": "easy"
  },
  {
    "id": 1002,
    "topic": "maximum-width-ramp",
    "difficulty": "medium"
  },
  {
    "id": 1003,
    "topic": "minimum-area-rectangle-ii",
    "difficulty": "medium"
  },
  {
    "id": 1004,
    "topic": "least-operators-to-express-number",
    "difficulty": "hard"
  },
  {
    "id": 1005,
    "topic": "univalued-binary-tree",
    "difficulty": "easy"
  },
  {
    "id": 1006,
    "topic": "vowel-spellchecker",
    "difficulty": "medium"
  },
  {
    "id": 1007,
    "topic": "numbers-with-same-consecutive-differences",
    "difficulty": "medium"
  },
  {
    "id": 1008,
    "topic": "binary-tree-cameras",
    "difficulty": "hard"
  },
  {
    "id": 1009,
    "topic": "pancake-sorting",
    "difficulty": "medium"
  },
  {
    "id": 1010,
    "topic": "powerful-integers",
    "difficulty": "medium"
  },
  {
    "id": 1011,
    "topic": "flip-binary-tree-to-match-preorder-traversal",
    "difficulty": "medium"
  },
  {
    "id": 1012,
    "topic": "equal-rational-numbers",
    "difficulty": "hard"
  },
  {
    "id": 1013,
    "topic": "fibonacci-number",
    "difficulty": "easy"
  },
  {
    "id": 1014,
    "topic": "k-closest-points-to-origin",
    "difficulty": "medium"
  },
  {
    "id": 1016,
    "topic": "subarray-sums-divisible-by-k",
    "difficulty": "medium"
  },
  {
    "id": 1017,
    "topic": "odd-even-jump",
    "difficulty": "hard"
  },
  {
    "id": 1018,
    "topic": "largest-perimeter-triangle",
    "difficulty": "easy"
  },
  {
    "id": 1019,
    "topic": "squares-of-a-sorted-array",
    "difficulty": "easy"
  },
  {
    "id": 1020,
    "topic": "longest-turbulent-subarray",
    "difficulty": "medium"
  },
  {
    "id": 1021,
    "topic": "distribute-coins-in-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1022,
    "topic": "unique-paths-iii",
    "difficulty": "hard"
  },
  {
    "id": 1023,
    "topic": "time-based-key-value-store",
    "difficulty": "medium"
  },
  {
    "id": 1024,
    "topic": "triples-with-bitwise-and-equal-to-zero",
    "difficulty": "hard"
  },
  {
    "id": 1025,
    "topic": "minimum-cost-for-tickets",
    "difficulty": "medium"
  },
  {
    "id": 1026,
    "topic": "string-without-aaa-or-bbb",
    "difficulty": "medium"
  },
  {
    "id": 1027,
    "topic": "sum-of-even-numbers-after-queries",
    "difficulty": "medium"
  },
  {
    "id": 1028,
    "topic": "interval-list-intersections",
    "difficulty": "medium"
  },
  {
    "id": 1029,
    "topic": "vertical-order-traversal-of-a-binary-tree",
    "difficulty": "hard"
  },
  {
    "id": 1030,
    "topic": "smallest-string-starting-from-leaf",
    "difficulty": "medium"
  },
  {
    "id": 1031,
    "topic": "add-to-array-form-of-integer",
    "difficulty": "easy"
  },
  {
    "id": 1032,
    "topic": "satisfiability-of-equality-equations",
    "difficulty": "medium"
  },
  {
    "id": 1033,
    "topic": "broken-calculator",
    "difficulty": "medium"
  },
  {
    "id": 1034,
    "topic": "subarrays-with-k-different-integers",
    "difficulty": "hard"
  },
  {
    "id": 1035,
    "topic": "cousins-in-binary-tree",
    "difficulty": "easy"
  },
  {
    "id": 1036,
    "topic": "rotting-oranges",
    "difficulty": "medium"
  },
  {
    "id": 1037,
    "topic": "minimum-number-of-k-consecutive-bit-flips",
    "difficulty": "hard"
  },
  {
    "id": 1038,
    "topic": "number-of-squareful-arrays",
    "difficulty": "hard"
  },
  {
    "id": 1039,
    "topic": "find-the-town-judge",
    "difficulty": "easy"
  },
  {
    "id": 1040,
    "topic": "maximum-binary-tree-ii",
    "difficulty": "medium"
  },
  {
    "id": 1041,
    "topic": "available-captures-for-rook",
    "difficulty": "easy"
  },
  {
    "id": 1042,
    "topic": "minimum-cost-to-merge-stones",
    "difficulty": "hard"
  },
  {
    "id": 1043,
    "topic": "grid-illumination",
    "difficulty": "hard"
  },
  {
    "id": 1044,
    "topic": "find-common-characters",
    "difficulty": "easy"
  },
  {
    "id": 1045,
    "topic": "check-if-word-is-valid-after-substitutions",
    "difficulty": "medium"
  },
  {
    "id": 1046,
    "topic": "max-consecutive-ones-iii",
    "difficulty": "medium"
  },
  {
    "id": 1047,
    "topic": "maximize-sum-of-array-after-k-negations",
    "difficulty": "easy"
  },
  {
    "id": 1048,
    "topic": "clumsy-factorial",
    "difficulty": "medium"
  },
  {
    "id": 1049,
    "topic": "minimum-domino-rotations-for-equal-row",
    "difficulty": "medium"
  },
  {
    "id": 1050,
    "topic": "construct-binary-search-tree-from-preorder-traversal",
    "difficulty": "medium"
  },
  {
    "id": 1051,
    "topic": "shortest-way-to-form-string",
    "difficulty": "medium"
  },
  {
    "id": 1052,
    "topic": "campus-bikes",
    "difficulty": "medium"
  },
  {
    "id": 1053,
    "topic": "minimize-rounding-error-to-meet-target",
    "difficulty": "medium"
  },
  {
    "id": 1054,
    "topic": "complement-of-base-10-integer",
    "difficulty": "easy"
  },
  {
    "id": 1055,
    "topic": "pairs-of-songs-with-total-durations-divisible-by-60",
    "difficulty": "medium"
  },
  {
    "id": 1056,
    "topic": "capacity-to-ship-packages-within-d-days",
    "difficulty": "medium"
  },
  {
    "id": 1057,
    "topic": "numbers-with-repeated-digits",
    "difficulty": "hard"
  },
  {
    "id": 1058,
    "topic": "lexicographically-smallest-equivalent-string",
    "difficulty": "medium"
  },
  {
    "id": 1059,
    "topic": "missing-element-in-sorted-array",
    "difficulty": "medium"
  },
  {
    "id": 1060,
    "topic": "longest-repeating-substring",
    "difficulty": "medium"
  },
  {
    "id": 1061,
    "topic": "number-of-valid-subarrays",
    "difficulty": "hard"
  },
  {
    "id": 1062,
    "topic": "partition-array-into-three-parts-with-equal-sum",
    "difficulty": "easy"
  },
  {
    "id": 1063,
    "topic": "best-sightseeing-pair",
    "difficulty": "medium"
  },
  {
    "id": 1064,
    "topic": "smallest-integer-divisible-by-k",
    "difficulty": "medium"
  },
  {
    "id": 1065,
    "topic": "binary-string-with-substrings-representing-1-to-n",
    "difficulty": "medium"
  },
  {
    "id": 1066,
    "topic": "fixed-point",
    "difficulty": "easy"
  },
  {
    "id": 1067,
    "topic": "campus-bikes-ii",
    "difficulty": "medium"
  },
  {
    "id": 1068,
    "topic": "digit-count-in-range",
    "difficulty": "hard"
  },
  {
    "id": 1069,
    "topic": "confusing-number",
    "difficulty": "easy"
  },
  {
    "id": 1070,
    "topic": "convert-to-base-2",
    "difficulty": "medium"
  },
  {
    "id": 1071,
    "topic": "binary-prefix-divisible-by-5",
    "difficulty": "easy"
  },
  {
    "id": 1072,
    "topic": "next-greater-node-in-linked-list",
    "difficulty": "medium"
  },
  {
    "id": 1073,
    "topic": "number-of-enclaves",
    "difficulty": "medium"
  },
  {
    "id": 1074,
    "topic": "high-five",
    "difficulty": "easy"
  },
  {
    "id": 1075,
    "topic": "index-pairs-of-a-string",
    "difficulty": "easy"
  },
  {
    "id": 1076,
    "topic": "brace-expansion",
    "difficulty": "medium"
  },
  {
    "id": 1077,
    "topic": "confusing-number-ii",
    "difficulty": "hard"
  },
  {
    "id": 1078,
    "topic": "remove-outermost-parentheses",
    "difficulty": "easy"
  },
  {
    "id": 1079,
    "topic": "sum-of-root-to-leaf-binary-numbers",
    "difficulty": "easy"
  },
  {
    "id": 1080,
    "topic": "camelcase-matching",
    "difficulty": "medium"
  },
  {
    "id": 1081,
    "topic": "video-stitching",
    "difficulty": "medium"
  },
  {
    "id": 1082,
    "topic": "sum-of-digits-in-the-minimum-number",
    "difficulty": "easy"
  },
  {
    "id": 1083,
    "topic": "two-sum-less-than-k",
    "difficulty": "easy"
  },
  {
    "id": 1084,
    "topic": "find-k-length-substrings-with-no-repeated-characters",
    "difficulty": "medium"
  },
  {
    "id": 1085,
    "topic": "the-earliest-moment-when-everyone-become-friends",
    "difficulty": "medium"
  },
  {
    "id": 1086,
    "topic": "divisor-game",
    "difficulty": "easy"
  },
  {
    "id": 1087,
    "topic": "longest-arithmetic-subsequence",
    "difficulty": "medium"
  },
  {
    "id": 1088,
    "topic": "number-of-days-in-a-month",
    "difficulty": "easy"
  },
  {
    "id": 1089,
    "topic": "remove-vowels-from-a-string",
    "difficulty": "easy"
  },
  {
    "id": 1090,
    "topic": "armstrong-number",
    "difficulty": "easy"
  },
  {
    "id": 1091,
    "topic": "maximum-average-subtree",
    "difficulty": "medium"
  },
  {
    "id": 1092,
    "topic": "maximum-difference-between-node-and-ancestor",
    "difficulty": "medium"
  },
  {
    "id": 1093,
    "topic": "recover-a-tree-from-preorder-traversal",
    "difficulty": "hard"
  },
  {
    "id": 1094,
    "topic": "matrix-cells-in-distance-order",
    "difficulty": "easy"
  },
  {
    "id": 1095,
    "topic": "two-city-scheduling",
    "difficulty": "medium"
  },
  {
    "id": 1096,
    "topic": "maximum-sum-of-two-non-overlapping-subarrays",
    "difficulty": "medium"
  },
  {
    "id": 1097,
    "topic": "stream-of-characters",
    "difficulty": "hard"
  },
  {
    "id": 1098,
    "topic": "largest-unique-number",
    "difficulty": "easy"
  },
  {
    "id": 1099,
    "topic": "path-with-maximum-minimum-value",
    "difficulty": "medium"
  },
  {
    "id": 1100,
    "topic": "connecting-cities-with-minimum-cost",
    "difficulty": "medium"
  },
  {
    "id": 1101,
    "topic": "parallel-courses",
    "difficulty": "medium"
  },
  {
    "id": 1102,
    "topic": "check-if-a-number-is-majority-element-in-a-sorted-array",
    "difficulty": "easy"
  },
  {
    "id": 1103,
    "topic": "moving-stones-until-consecutive",
    "difficulty": "medium"
  },
  {
    "id": 1104,
    "topic": "coloring-a-border",
    "difficulty": "medium"
  },
  {
    "id": 1105,
    "topic": "uncrossed-lines",
    "difficulty": "medium"
  },
  {
    "id": 1106,
    "topic": "escape-a-large-maze",
    "difficulty": "hard"
  },
  {
    "id": 1107,
    "topic": "minimum-swaps-to-group-all-1s-together",
    "difficulty": "medium"
  },
  {
    "id": 1108,
    "topic": "analyze-user-website-visit-pattern",
    "difficulty": "medium"
  },
  {
    "id": 1111,
    "topic": "minimum-score-triangulation-of-polygon",
    "difficulty": "medium"
  },
  {
    "id": 1112,
    "topic": "find-words-that-can-be-formed-by-characters",
    "difficulty": "easy"
  },
  {
    "id": 1113,
    "topic": "moving-stones-until-consecutive-ii",
    "difficulty": "medium"
  },
  {
    "id": 1114,
    "topic": "binary-search-tree-to-greater-sum-tree",
    "difficulty": "medium"
  },
  {
    "id": 1115,
    "topic": "valid-boomerang",
    "difficulty": "easy"
  },
  {
    "id": 1116,
    "topic": "maximum-level-sum-of-a-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1117,
    "topic": "as-far-from-land-as-possible",
    "difficulty": "medium"
  },
  {
    "id": 1118,
    "topic": "divide-array-into-increasing-sequences",
    "difficulty": "hard"
  },
  {
    "id": 1119,
    "topic": "robot-bounded-in-circle",
    "difficulty": "medium"
  },
  {
    "id": 1120,
    "topic": "flower-planting-with-no-adjacent",
    "difficulty": "medium"
  },
  {
    "id": 1121,
    "topic": "partition-array-for-maximum-sum",
    "difficulty": "medium"
  },
  {
    "id": 1122,
    "topic": "longest-duplicate-substring",
    "difficulty": "hard"
  },
  {
    "id": 1123,
    "topic": "single-row-keyboard",
    "difficulty": "easy"
  },
  {
    "id": 1124,
    "topic": "string-transforms-into-another-string",
    "difficulty": "hard"
  },
  {
    "id": 1125,
    "topic": "design-file-system",
    "difficulty": "medium"
  },
  {
    "id": 1126,
    "topic": "minimum-cost-to-connect-sticks",
    "difficulty": "medium"
  },
  {
    "id": 1127,
    "topic": "last-stone-weight",
    "difficulty": "easy"
  },
  {
    "id": 1128,
    "topic": "remove-all-adjacent-duplicates-in-string",
    "difficulty": "easy"
  },
  {
    "id": 1129,
    "topic": "longest-string-chain",
    "difficulty": "medium"
  },
  {
    "id": 1130,
    "topic": "last-stone-weight-ii",
    "difficulty": "medium"
  },
  {
    "id": 1131,
    "topic": "count-substrings-with-only-one-distinct-letter",
    "difficulty": "easy"
  },
  {
    "id": 1132,
    "topic": "before-and-after-puzzle",
    "difficulty": "medium"
  },
  {
    "id": 1133,
    "topic": "last-substring-in-lexicographical-order",
    "difficulty": "hard"
  },
  {
    "id": 1134,
    "topic": "shortest-distance-to-target-color",
    "difficulty": "medium"
  },
  {
    "id": 1135,
    "topic": "customers-who-bought-all-products",
    "difficulty": "medium"
  },
  {
    "id": 1136,
    "topic": "actors-and-directors-who-cooperated-at-least-three-times",
    "difficulty": "easy"
  },
  {
    "id": 1137,
    "topic": "height-checker",
    "difficulty": "easy"
  },
  {
    "id": 1138,
    "topic": "grumpy-bookstore-owner",
    "difficulty": "medium"
  },
  {
    "id": 1139,
    "topic": "previous-permutation-with-one-swap",
    "difficulty": "medium"
  },
  {
    "id": 1140,
    "topic": "distant-barcodes",
    "difficulty": "medium"
  },
  {
    "id": 1141,
    "topic": "how-many-apples-can-you-put-into-the-basket",
    "difficulty": "easy"
  },
  {
    "id": 1142,
    "topic": "minimum-knight-moves",
    "difficulty": "medium"
  },
  {
    "id": 1143,
    "topic": "find-smallest-common-element-in-all-rows",
    "difficulty": "medium"
  },
  {
    "id": 1144,
    "topic": "optimize-water-distribution-in-a-village",
    "difficulty": "hard"
  },
  {
    "id": 1145,
    "topic": "number-of-submatrices-that-sum-to-target",
    "difficulty": "hard"
  },
  {
    "id": 1146,
    "topic": "greatest-common-divisor-of-strings",
    "difficulty": "easy"
  },
  {
    "id": 1147,
    "topic": "flip-columns-for-maximum-number-of-equal-rows",
    "difficulty": "medium"
  },
  {
    "id": 1148,
    "topic": "adding-two-negabinary-numbers",
    "difficulty": "medium"
  },
  {
    "id": 1149,
    "topic": "intersection-of-three-sorted-arrays",
    "difficulty": "easy"
  },
  {
    "id": 1150,
    "topic": "two-sum-bsts",
    "difficulty": "medium"
  },
  {
    "id": 1151,
    "topic": "stepping-numbers",
    "difficulty": "medium"
  },
  {
    "id": 1152,
    "topic": "maximum-number-of-ones",
    "difficulty": "hard"
  },
  {
    "id": 1153,
    "topic": "product-sales-analysis-i",
    "difficulty": "easy"
  },
  {
    "id": 1154,
    "topic": "product-sales-analysis-ii",
    "difficulty": "easy"
  },
  {
    "id": 1155,
    "topic": "product-sales-analysis-iii",
    "difficulty": "medium"
  },
  {
    "id": 1156,
    "topic": "occurrences-after-bigram",
    "difficulty": "easy"
  },
  {
    "id": 1157,
    "topic": "insufficient-nodes-in-root-to-leaf-paths",
    "difficulty": "medium"
  },
  {
    "id": 1159,
    "topic": "smallest-subsequence-of-distinct-characters",
    "difficulty": "medium"
  },
  {
    "id": 1160,
    "topic": "letter-tile-possibilities",
    "difficulty": "medium"
  },
  {
    "id": 1161,
    "topic": "project-employees-i",
    "difficulty": "easy"
  },
  {
    "id": 1162,
    "topic": "project-employees-ii",
    "difficulty": "easy"
  },
  {
    "id": 1163,
    "topic": "project-employees-iii",
    "difficulty": "medium"
  },
  {
    "id": 1164,
    "topic": "missing-number-in-arithmetic-progression",
    "difficulty": "easy"
  },
  {
    "id": 1165,
    "topic": "meeting-scheduler",
    "difficulty": "medium"
  },
  {
    "id": 1166,
    "topic": "toss-strange-coins",
    "difficulty": "medium"
  },
  {
    "id": 1167,
    "topic": "minimum-time-to-build-blocks",
    "difficulty": "hard"
  },
  {
    "id": 1168,
    "topic": "duplicate-zeros",
    "difficulty": "easy"
  },
  {
    "id": 1169,
    "topic": "largest-values-from-labels",
    "difficulty": "medium"
  },
  {
    "id": 1170,
    "topic": "shortest-common-supersequence",
    "difficulty": "hard"
  },
  {
    "id": 1171,
    "topic": "shortest-path-in-binary-matrix",
    "difficulty": "medium"
  },
  {
    "id": 1172,
    "topic": "sales-analysis-i",
    "difficulty": "easy"
  },
  {
    "id": 1173,
    "topic": "sales-analysis-ii",
    "difficulty": "easy"
  },
  {
    "id": 1174,
    "topic": "sales-analysis-iii",
    "difficulty": "easy"
  },
  {
    "id": 1175,
    "topic": "array-transformation",
    "difficulty": "easy"
  },
  {
    "id": 1176,
    "topic": "design-a-leaderboard",
    "difficulty": "medium"
  },
  {
    "id": 1177,
    "topic": "tree-diameter",
    "difficulty": "medium"
  },
  {
    "id": 1178,
    "topic": "valid-palindrome-iii",
    "difficulty": "hard"
  },
  {
    "id": 1179,
    "topic": "game-play-analysis-i",
    "difficulty": "easy"
  },
  {
    "id": 1180,
    "topic": "game-play-analysis-ii",
    "difficulty": "easy"
  },
  {
    "id": 1181,
    "topic": "game-play-analysis-iii",
    "difficulty": "medium"
  },
  {
    "id": 1182,
    "topic": "game-play-analysis-iv",
    "difficulty": "medium"
  },
  {
    "id": 1183,
    "topic": "statistics-from-a-large-sample",
    "difficulty": "medium"
  },
  {
    "id": 1184,
    "topic": "car-pooling",
    "difficulty": "medium"
  },
  {
    "id": 1185,
    "topic": "find-in-mountain-array",
    "difficulty": "hard"
  },
  {
    "id": 1186,
    "topic": "building-h2o",
    "difficulty": "medium"
  },
  {
    "id": 1187,
    "topic": "print-foobar-alternately",
    "difficulty": "medium"
  },
  {
    "id": 1188,
    "topic": "brace-expansion-ii",
    "difficulty": "hard"
  },
  {
    "id": 1189,
    "topic": "encode-number",
    "difficulty": "medium"
  },
  {
    "id": 1190,
    "topic": "smallest-common-region",
    "difficulty": "medium"
  },
  {
    "id": 1191,
    "topic": "synonymous-sentences",
    "difficulty": "medium"
  },
  {
    "id": 1192,
    "topic": "divide-chocolate",
    "difficulty": "hard"
  },
  {
    "id": 1193,
    "topic": "game-play-analysis-v",
    "difficulty": "hard"
  },
  {
    "id": 1194,
    "topic": "path-in-zigzag-labelled-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1195,
    "topic": "distribute-candies-to-people",
    "difficulty": "easy"
  },
  {
    "id": 1196,
    "topic": "filling-bookcase-shelves",
    "difficulty": "medium"
  },
  {
    "id": 1197,
    "topic": "parsing-a-boolean-expression",
    "difficulty": "hard"
  },
  {
    "id": 1198,
    "topic": "unpopular-books",
    "difficulty": "medium"
  },
  {
    "id": 1199,
    "topic": "hexspeak",
    "difficulty": "easy"
  },
  {
    "id": 1200,
    "topic": "remove-interval",
    "difficulty": "medium"
  },
  {
    "id": 1201,
    "topic": "delete-tree-nodes",
    "difficulty": "medium"
  },
  {
    "id": 1202,
    "topic": "palindrome-removal",
    "difficulty": "hard"
  },
  {
    "id": 1203,
    "topic": "print-in-order",
    "difficulty": "easy"
  },
  {
    "id": 1204,
    "topic": "new-users-daily-count",
    "difficulty": "medium"
  },
  {
    "id": 1205,
    "topic": "defanging-an-ip-address",
    "difficulty": "easy"
  },
  {
    "id": 1206,
    "topic": "corporate-flight-bookings",
    "difficulty": "medium"
  },
  {
    "id": 1207,
    "topic": "delete-nodes-and-return-forest",
    "difficulty": "medium"
  },
  {
    "id": 1208,
    "topic": "maximum-nesting-depth-of-two-valid-parentheses-strings",
    "difficulty": "medium"
  },
  {
    "id": 1209,
    "topic": "design-bounded-blocking-queue",
    "difficulty": "medium"
  },
  {
    "id": 1210,
    "topic": "mean-of-array-after-removing-some-elements",
    "difficulty": "easy"
  },
  {
    "id": 1211,
    "topic": "iterator-for-combination",
    "difficulty": "medium"
  },
  {
    "id": 1212,
    "topic": "sequential-digits",
    "difficulty": "medium"
  },
  {
    "id": 1213,
    "topic": "handshakes-that-dont-cross",
    "difficulty": "hard"
  },
  {
    "id": 1214,
    "topic": "highest-grade-for-each-student",
    "difficulty": "medium"
  },
  {
    "id": 1215,
    "topic": "reported-posts",
    "difficulty": "easy"
  },
  {
    "id": 1216,
    "topic": "print-zero-even-odd",
    "difficulty": "medium"
  },
  {
    "id": 1217,
    "topic": "relative-sort-array",
    "difficulty": "easy"
  },
  {
    "id": 1218,
    "topic": "lowest-common-ancestor-of-deepest-leaves",
    "difficulty": "medium"
  },
  {
    "id": 1219,
    "topic": "longest-well-performing-interval",
    "difficulty": "medium"
  },
  {
    "id": 1220,
    "topic": "smallest-sufficient-team",
    "difficulty": "hard"
  },
  {
    "id": 1221,
    "topic": "element-appearing-more-than-25-in-sorted-array",
    "difficulty": "easy"
  },
  {
    "id": 1222,
    "topic": "remove-covered-intervals",
    "difficulty": "medium"
  },
  {
    "id": 1223,
    "topic": "graph-connectivity-with-threshold",
    "difficulty": "hard"
  },
  {
    "id": 1224,
    "topic": "minimum-falling-path-sum-ii",
    "difficulty": "hard"
  },
  {
    "id": 1225,
    "topic": "active-businesses",
    "difficulty": "medium"
  },
  {
    "id": 1226,
    "topic": "user-purchase-platform",
    "difficulty": "hard"
  },
  {
    "id": 1227,
    "topic": "number-of-equivalent-domino-pairs",
    "difficulty": "easy"
  },
  {
    "id": 1228,
    "topic": "minimum-cost-tree-from-leaf-values",
    "difficulty": "medium"
  },
  {
    "id": 1229,
    "topic": "shortest-path-with-alternating-colors",
    "difficulty": "medium"
  },
  {
    "id": 1230,
    "topic": "maximum-of-absolute-value-expression",
    "difficulty": "medium"
  },
  {
    "id": 1231,
    "topic": "replace-elements-with-greatest-element-on-right-side",
    "difficulty": "easy"
  },
  {
    "id": 1232,
    "topic": "sum-of-mutated-array-closest-to-target",
    "difficulty": "medium"
  },
  {
    "id": 1233,
    "topic": "number-of-ships-in-a-rectangle",
    "difficulty": "hard"
  },
  {
    "id": 1234,
    "topic": "number-of-paths-with-max-score",
    "difficulty": "hard"
  },
  {
    "id": 1236,
    "topic": "n-th-tribonacci-number",
    "difficulty": "easy"
  },
  {
    "id": 1237,
    "topic": "reported-posts-ii",
    "difficulty": "medium"
  },
  {
    "id": 1238,
    "topic": "alphabet-board-path",
    "difficulty": "medium"
  },
  {
    "id": 1239,
    "topic": "largest-1-bordered-square",
    "difficulty": "medium"
  },
  {
    "id": 1240,
    "topic": "stone-game-ii",
    "difficulty": "medium"
  },
  {
    "id": 1241,
    "topic": "decompress-run-length-encoded-list",
    "difficulty": "easy"
  },
  {
    "id": 1242,
    "topic": "matrix-block-sum",
    "difficulty": "medium"
  },
  {
    "id": 1243,
    "topic": "sum-of-nodes-with-even-valued-grandparent",
    "difficulty": "medium"
  },
  {
    "id": 1244,
    "topic": "distinct-echo-substrings",
    "difficulty": "hard"
  },
  {
    "id": 1245,
    "topic": "user-activity-for-the-past-30-days-i",
    "difficulty": "easy"
  },
  {
    "id": 1246,
    "topic": "user-activity-for-the-past-30-days-ii",
    "difficulty": "easy"
  },
  {
    "id": 1247,
    "topic": "decrease-elements-to-make-array-zigzag",
    "difficulty": "medium"
  },
  {
    "id": 1248,
    "topic": "binary-tree-coloring-game",
    "difficulty": "medium"
  },
  {
    "id": 1249,
    "topic": "snapshot-array",
    "difficulty": "medium"
  },
  {
    "id": 1250,
    "topic": "longest-common-subsequence",
    "difficulty": "medium"
  },
  {
    "id": 1251,
    "topic": "longest-chunked-palindrome-decomposition",
    "difficulty": "hard"
  },
  {
    "id": 1252,
    "topic": "break-a-palindrome",
    "difficulty": "medium"
  },
  {
    "id": 1253,
    "topic": "sort-the-matrix-diagonally",
    "difficulty": "medium"
  },
  {
    "id": 1254,
    "topic": "deepest-leaves-sum",
    "difficulty": "medium"
  },
  {
    "id": 1255,
    "topic": "reverse-subarray-to-maximize-array-value",
    "difficulty": "hard"
  },
  {
    "id": 1256,
    "topic": "rank-transform-of-an-array",
    "difficulty": "easy"
  },
  {
    "id": 1257,
    "topic": "rank-transform-of-a-matrix",
    "difficulty": "hard"
  },
  {
    "id": 1258,
    "topic": "article-views-i",
    "difficulty": "easy"
  },
  {
    "id": 1259,
    "topic": "article-views-ii",
    "difficulty": "medium"
  },
  {
    "id": 1260,
    "topic": "day-of-the-year",
    "difficulty": "easy"
  },
  {
    "id": 1261,
    "topic": "swap-for-longest-repeated-character-substring",
    "difficulty": "medium"
  },
  {
    "id": 1262,
    "topic": "online-majority-element-in-subarray",
    "difficulty": "hard"
  },
  {
    "id": 1263,
    "topic": "number-of-dice-rolls-with-target-sum",
    "difficulty": "medium"
  },
  {
    "id": 1264,
    "topic": "maximum-number-of-words-you-can-type",
    "difficulty": "easy"
  },
  {
    "id": 1267,
    "topic": "remove-zero-sum-consecutive-nodes-from-linked-list",
    "difficulty": "medium"
  },
  {
    "id": 1268,
    "topic": "market-analysis-i",
    "difficulty": "medium"
  },
  {
    "id": 1269,
    "topic": "market-analysis-ii",
    "difficulty": "hard"
  },
  {
    "id": 1270,
    "topic": "dinner-plate-stacks",
    "difficulty": "hard"
  },
  {
    "id": 1271,
    "topic": "web-crawler",
    "difficulty": "medium"
  },
  {
    "id": 1272,
    "topic": "invalid-transactions",
    "difficulty": "medium"
  },
  {
    "id": 1273,
    "topic": "compare-strings-by-frequency-of-the-smallest-character",
    "difficulty": "medium"
  },
  {
    "id": 1274,
    "topic": "number-of-days-between-two-dates",
    "difficulty": "easy"
  },
  {
    "id": 1275,
    "topic": "validate-binary-tree-nodes",
    "difficulty": "medium"
  },
  {
    "id": 1276,
    "topic": "closest-divisors",
    "difficulty": "medium"
  },
  {
    "id": 1277,
    "topic": "largest-multiple-of-three",
    "difficulty": "hard"
  },
  {
    "id": 1278,
    "topic": "product-price-at-a-given-date",
    "difficulty": "medium"
  },
  {
    "id": 1279,
    "topic": "prime-arrangements",
    "difficulty": "easy"
  },
  {
    "id": 1280,
    "topic": "diet-plan-performance",
    "difficulty": "easy"
  },
  {
    "id": 1281,
    "topic": "can-make-palindrome-from-substring",
    "difficulty": "medium"
  },
  {
    "id": 1282,
    "topic": "number-of-valid-words-for-each-puzzle",
    "difficulty": "hard"
  },
  {
    "id": 1283,
    "topic": "reformat-date",
    "difficulty": "easy"
  },
  {
    "id": 1284,
    "topic": "four-divisors",
    "difficulty": "medium"
  },
  {
    "id": 1285,
    "topic": "balance-a-binary-search-tree",
    "difficulty": "medium"
  },
  {
    "id": 1286,
    "topic": "constrained-subsequence-sum",
    "difficulty": "hard"
  },
  {
    "id": 1287,
    "topic": "distance-between-bus-stops",
    "difficulty": "easy"
  },
  {
    "id": 1288,
    "topic": "maximum-subarray-sum-with-one-deletion",
    "difficulty": "medium"
  },
  {
    "id": 1289,
    "topic": "day-of-the-week",
    "difficulty": "easy"
  },
  {
    "id": 1290,
    "topic": "make-array-strictly-increasing",
    "difficulty": "hard"
  },
  {
    "id": 1291,
    "topic": "immediate-food-delivery-i",
    "difficulty": "easy"
  },
  {
    "id": 1292,
    "topic": "immediate-food-delivery-ii",
    "difficulty": "medium"
  },
  {
    "id": 1293,
    "topic": "three-consecutive-odds",
    "difficulty": "easy"
  },
  {
    "id": 1294,
    "topic": "range-frequency-queries",
    "difficulty": "medium"
  },
  {
    "id": 1295,
    "topic": "minimum-garden-perimeter-to-collect-enough-apples",
    "difficulty": "medium"
  },
  {
    "id": 1296,
    "topic": "kth-ancestor-of-a-tree-node",
    "difficulty": "hard"
  },
  {
    "id": 1297,
    "topic": "maximum-number-of-balloons",
    "difficulty": "easy"
  },
  {
    "id": 1298,
    "topic": "reverse-substrings-between-each-pair-of-parentheses",
    "difficulty": "medium"
  },
  {
    "id": 1299,
    "topic": "k-concatenation-maximum-sum",
    "difficulty": "medium"
  },
  {
    "id": 1300,
    "topic": "critical-connections-in-a-network",
    "difficulty": "hard"
  },
  {
    "id": 1301,
    "topic": "reformat-department-table",
    "difficulty": "easy"
  },
  {
    "id": 1302,
    "topic": "delete-characters-to-make-fancy-string",
    "difficulty": "easy"
  },
  {
    "id": 1303,
    "topic": "minimum-moves-to-reach-target-score",
    "difficulty": "medium"
  },
  {
    "id": 1304,
    "topic": "longest-happy-string",
    "difficulty": "medium"
  },
  {
    "id": 1305,
    "topic": "number-of-visible-people-in-a-queue",
    "difficulty": "hard"
  },
  {
    "id": 1306,
    "topic": "minimum-absolute-difference",
    "difficulty": "easy"
  },
  {
    "id": 1307,
    "topic": "ugly-number-iii",
    "difficulty": "medium"
  },
  {
    "id": 1308,
    "topic": "smallest-string-with-swaps",
    "difficulty": "medium"
  },
  {
    "id": 1309,
    "topic": "sort-items-by-groups-respecting-dependencies",
    "difficulty": "hard"
  },
  {
    "id": 1310,
    "topic": "watering-plants",
    "difficulty": "medium"
  },
  {
    "id": 1311,
    "topic": "largest-magic-square",
    "difficulty": "medium"
  },
  {
    "id": 1313,
    "topic": "count-ways-to-build-rooms-in-an-ant-colony",
    "difficulty": "hard"
  },
  {
    "id": 1316,
    "topic": "fizz-buzz-multithreaded",
    "difficulty": "medium"
  },
  {
    "id": 1317,
    "topic": "monthly-transactions-i",
    "difficulty": "medium"
  },
  {
    "id": 1318,
    "topic": "tournament-winners",
    "difficulty": "hard"
  },
  {
    "id": 1319,
    "topic": "unique-number-of-occurrences",
    "difficulty": "easy"
  },
  {
    "id": 1320,
    "topic": "remove-all-adjacent-duplicates-in-string-ii",
    "difficulty": "medium"
  },
  {
    "id": 1321,
    "topic": "get-equal-substrings-within-budget",
    "difficulty": "medium"
  },
  {
    "id": 1322,
    "topic": "minimum-moves-to-reach-target-with-rotations",
    "difficulty": "hard"
  },
  {
    "id": 1324,
    "topic": "where-will-the-ball-fall",
    "difficulty": "medium"
  },
  {
    "id": 1325,
    "topic": "path-with-maximum-probability",
    "difficulty": "medium"
  },
  {
    "id": 1326,
    "topic": "sum-of-floored-pairs",
    "difficulty": "hard"
  },
  {
    "id": 1327,
    "topic": "last-person-to-fit-in-the-bus",
    "difficulty": "medium"
  },
  {
    "id": 1328,
    "topic": "monthly-transactions-ii",
    "difficulty": "medium"
  },
  {
    "id": 1329,
    "topic": "minimum-cost-to-move-chips-to-the-same-position",
    "difficulty": "easy"
  },
  {
    "id": 1330,
    "topic": "longest-arithmetic-subsequence-of-given-difference",
    "difficulty": "medium"
  },
  {
    "id": 1331,
    "topic": "path-with-maximum-gold",
    "difficulty": "medium"
  },
  {
    "id": 1332,
    "topic": "count-vowels-permutation",
    "difficulty": "hard"
  },
  {
    "id": 1336,
    "topic": "maximum-product-of-the-length-of-two-palindromic-substrings",
    "difficulty": "hard"
  },
  {
    "id": 1337,
    "topic": "design-skiplist",
    "difficulty": "hard"
  },
  {
    "id": 1338,
    "topic": "queries-quality-and-percentage",
    "difficulty": "easy"
  },
  {
    "id": 1339,
    "topic": "team-scores-in-football-tournament",
    "difficulty": "medium"
  },
  {
    "id": 1340,
    "topic": "the-dining-philosophers",
    "difficulty": "medium"
  },
  {
    "id": 1341,
    "topic": "split-a-string-in-balanced-strings",
    "difficulty": "easy"
  },
  {
    "id": 1342,
    "topic": "queens-that-can-attack-the-king",
    "difficulty": "medium"
  },
  {
    "id": 1343,
    "topic": "dice-roll-simulation",
    "difficulty": "hard"
  },
  {
    "id": 1344,
    "topic": "maximum-equal-frequency",
    "difficulty": "hard"
  },
  {
    "id": 1345,
    "topic": "perform-string-shifts",
    "difficulty": "easy"
  },
  {
    "id": 1349,
    "topic": "check-if-it-is-a-straight-line",
    "difficulty": "easy"
  },
  {
    "id": 1350,
    "topic": "remove-sub-folders-from-the-filesystem",
    "difficulty": "medium"
  },
  {
    "id": 1351,
    "topic": "replace-the-substring-for-balanced-string",
    "difficulty": "medium"
  },
  {
    "id": 1352,
    "topic": "maximum-profit-in-job-scheduling",
    "difficulty": "hard"
  },
  {
    "id": 1357,
    "topic": "report-contiguous-dates",
    "difficulty": "hard"
  },
  {
    "id": 1358,
    "topic": "find-positive-integer-solution-for-a-given-equation",
    "difficulty": "medium"
  },
  {
    "id": 1359,
    "topic": "circular-permutation-in-binary-representation",
    "difficulty": "medium"
  },
  {
    "id": 1360,
    "topic": "maximum-length-of-a-concatenated-string-with-unique-characters",
    "difficulty": "medium"
  },
  {
    "id": 1361,
    "topic": "tiling-a-rectangle-with-the-fewest-squares",
    "difficulty": "hard"
  },
  {
    "id": 1362,
    "topic": "airplane-seat-assignment-probability",
    "difficulty": "medium"
  },
  {
    "id": 1364,
    "topic": "tuple-with-same-product",
    "difficulty": "medium"
  },
  {
    "id": 1366,
    "topic": "first-unique-number",
    "difficulty": "medium"
  },
  {
    "id": 1367,
    "topic": "maximum-height-by-stacking-cuboids",
    "difficulty": "hard"
  },
  {
    "id": 1368,
    "topic": "web-crawler-multithreaded",
    "difficulty": "medium"
  },
  {
    "id": 1369,
    "topic": "minimum-swaps-to-make-strings-equal",
    "difficulty": "medium"
  },
  {
    "id": 1370,
    "topic": "count-number-of-nice-subarrays",
    "difficulty": "medium"
  },
  {
    "id": 1371,
    "topic": "minimum-remove-to-make-valid-parentheses",
    "difficulty": "medium"
  },
  {
    "id": 1372,
    "topic": "check-if-it-is-a-good-array",
    "difficulty": "hard"
  },
  {
    "id": 1374,
    "topic": "leftmost-column-with-at-least-a-one",
    "difficulty": "medium"
  },
  {
    "id": 1377,
    "topic": "number-of-comments-per-post",
    "difficulty": "easy"
  },
  {
    "id": 1378,
    "topic": "cells-with-odd-values-in-a-matrix",
    "difficulty": "easy"
  },
  {
    "id": 1379,
    "topic": "reconstruct-a-2-row-binary-matrix",
    "difficulty": "medium"
  },
  {
    "id": 1380,
    "topic": "number-of-closed-islands",
    "difficulty": "medium"
  },
  {
    "id": 1381,
    "topic": "maximum-score-words-formed-by-letters",
    "difficulty": "hard"
  },
  {
    "id": 1384,
    "topic": "maximum-font-to-fit-a-sentence-in-a-screen",
    "difficulty": "medium"
  },
  {
    "id": 1386,
    "topic": "shift-2d-grid",
    "difficulty": "easy"
  },
  {
    "id": 1387,
    "topic": "find-elements-in-a-contaminated-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1388,
    "topic": "greatest-sum-divisible-by-three",
    "difficulty": "medium"
  },
  {
    "id": 1389,
    "topic": "minimum-moves-to-move-a-box-to-their-target-location",
    "difficulty": "hard"
  },
  {
    "id": 1390,
    "topic": "average-selling-price",
    "difficulty": "easy"
  },
  {
    "id": 1391,
    "topic": "counting-elements",
    "difficulty": "easy"
  },
  {
    "id": 1395,
    "topic": "minimum-time-visiting-all-points",
    "difficulty": "easy"
  },
  {
    "id": 1396,
    "topic": "count-servers-that-communicate",
    "difficulty": "medium"
  },
  {
    "id": 1397,
    "topic": "search-suggestions-system",
    "difficulty": "medium"
  },
  {
    "id": 1398,
    "topic": "number-of-ways-to-stay-in-the-same-place-after-some-steps",
    "difficulty": "hard"
  },
  {
    "id": 1399,
    "topic": "page-recommendations",
    "difficulty": "medium"
  },
  {
    "id": 1400,
    "topic": "find-winner-on-a-tic-tac-toe-game",
    "difficulty": "easy"
  },
  {
    "id": 1401,
    "topic": "number-of-burgers-with-no-waste-of-ingredients",
    "difficulty": "medium"
  },
  {
    "id": 1402,
    "topic": "count-square-submatrices-with-all-ones",
    "difficulty": "medium"
  },
  {
    "id": 1403,
    "topic": "palindrome-partitioning-iii",
    "difficulty": "hard"
  },
  {
    "id": 1404,
    "topic": "print-immutable-linked-list-in-reverse",
    "difficulty": "medium"
  },
  {
    "id": 1405,
    "topic": "all-people-report-to-the-given-manager",
    "difficulty": "medium"
  },
  {
    "id": 1406,
    "topic": "subtract-the-product-and-sum-of-digits-of-an-integer",
    "difficulty": "easy"
  },
  {
    "id": 1407,
    "topic": "group-the-people-given-the-group-size-they-belong-to",
    "difficulty": "medium"
  },
  {
    "id": 1408,
    "topic": "find-the-smallest-divisor-given-a-threshold",
    "difficulty": "medium"
  },
  {
    "id": 1409,
    "topic": "minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix",
    "difficulty": "hard"
  },
  {
    "id": 1410,
    "topic": "traffic-light-controlled-intersection",
    "difficulty": "easy"
  },
  {
    "id": 1411,
    "topic": "convert-binary-number-in-a-linked-list-to-integer",
    "difficulty": "easy"
  },
  {
    "id": 1413,
    "topic": "maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold",
    "difficulty": "medium"
  },
  {
    "id": 1414,
    "topic": "shortest-path-in-a-grid-with-obstacles-elimination",
    "difficulty": "hard"
  },
  {
    "id": 1415,
    "topic": "students-and-examinations",
    "difficulty": "easy"
  },
  {
    "id": 1420,
    "topic": "find-the-start-and-end-number-of-continuous-ranges",
    "difficulty": "medium"
  },
  {
    "id": 1421,
    "topic": "find-numbers-with-even-number-of-digits",
    "difficulty": "easy"
  },
  {
    "id": 1422,
    "topic": "divide-array-in-sets-of-k-consecutive-numbers",
    "difficulty": "medium"
  },
  {
    "id": 1423,
    "topic": "maximum-number-of-occurrences-of-a-substring",
    "difficulty": "medium"
  },
  {
    "id": 1424,
    "topic": "maximum-candies-you-can-get-from-boxes",
    "difficulty": "hard"
  },
  {
    "id": 1425,
    "topic": "weather-type-in-each-country",
    "difficulty": "easy"
  },
  {
    "id": 1426,
    "topic": "find-n-unique-integers-sum-up-to-zero",
    "difficulty": "easy"
  },
  {
    "id": 1427,
    "topic": "all-elements-in-two-binary-search-trees",
    "difficulty": "medium"
  },
  {
    "id": 1428,
    "topic": "jump-game-iii",
    "difficulty": "medium"
  },
  {
    "id": 1429,
    "topic": "verbal-arithmetic-puzzle",
    "difficulty": "hard"
  },
  {
    "id": 1432,
    "topic": "check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1434,
    "topic": "decrypt-string-from-alphabet-to-integer-mapping",
    "difficulty": "easy"
  },
  {
    "id": 1435,
    "topic": "xor-queries-of-a-subarray",
    "difficulty": "medium"
  },
  {
    "id": 1436,
    "topic": "get-watched-videos-by-your-friends",
    "difficulty": "medium"
  },
  {
    "id": 1437,
    "topic": "minimum-insertion-steps-to-make-a-string-palindrome",
    "difficulty": "hard"
  },
  {
    "id": 1438,
    "topic": "find-the-team-size",
    "difficulty": "easy"
  },
  {
    "id": 1439,
    "topic": "running-total-for-different-genders",
    "difficulty": "medium"
  },
  {
    "id": 1440,
    "topic": "convert-integer-to-the-sum-of-two-no-zero-integers",
    "difficulty": "easy"
  },
  {
    "id": 1441,
    "topic": "minimum-flips-to-make-a-or-b-equal-to-c",
    "difficulty": "medium"
  },
  {
    "id": 1442,
    "topic": "number-of-operations-to-make-network-connected",
    "difficulty": "medium"
  },
  {
    "id": 1443,
    "topic": "minimum-distance-to-type-a-word-using-two-fingers",
    "difficulty": "hard"
  },
  {
    "id": 1444,
    "topic": "number-of-steps-to-reduce-a-number-to-zero",
    "difficulty": "easy"
  },
  {
    "id": 1445,
    "topic": "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold",
    "difficulty": "medium"
  },
  {
    "id": 1446,
    "topic": "angle-between-hands-of-a-clock",
    "difficulty": "medium"
  },
  {
    "id": 1447,
    "topic": "jump-game-iv",
    "difficulty": "hard"
  },
  {
    "id": 1448,
    "topic": "maximum-69-number",
    "difficulty": "easy"
  },
  {
    "id": 1449,
    "topic": "print-words-vertically",
    "difficulty": "medium"
  },
  {
    "id": 1450,
    "topic": "delete-leaves-with-a-given-value",
    "difficulty": "medium"
  },
  {
    "id": 1451,
    "topic": "minimum-number-of-taps-to-open-to-water-a-garden",
    "difficulty": "hard"
  },
  {
    "id": 1452,
    "topic": "restaurant-growth",
    "difficulty": "medium"
  },
  {
    "id": 1453,
    "topic": "ads-performance",
    "difficulty": "easy"
  },
  {
    "id": 1454,
    "topic": "remove-palindromic-subsequences",
    "difficulty": "easy"
  },
  {
    "id": 1455,
    "topic": "filter-restaurants-by-vegan-friendly-price-and-distance",
    "difficulty": "medium"
  },
  {
    "id": 1456,
    "topic": "find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance",
    "difficulty": "medium"
  },
  {
    "id": 1457,
    "topic": "minimum-difficulty-of-a-job-schedule",
    "difficulty": "hard"
  },
  {
    "id": 1458,
    "topic": "sort-integers-by-the-number-of-1-bits",
    "difficulty": "easy"
  },
  {
    "id": 1459,
    "topic": "apply-discount-every-n-orders",
    "difficulty": "medium"
  },
  {
    "id": 1460,
    "topic": "number-of-substrings-containing-all-three-characters",
    "difficulty": "medium"
  },
  {
    "id": 1461,
    "topic": "count-all-valid-pickup-and-delivery-options",
    "difficulty": "hard"
  },
  {
    "id": 1462,
    "topic": "list-the-products-ordered-in-a-period",
    "difficulty": "easy"
  },
  {
    "id": 1463,
    "topic": "the-k-weakest-rows-in-a-matrix",
    "difficulty": "easy"
  },
  {
    "id": 1464,
    "topic": "reduce-array-size-to-the-half",
    "difficulty": "medium"
  },
  {
    "id": 1465,
    "topic": "maximum-product-of-splitted-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1466,
    "topic": "jump-game-v",
    "difficulty": "hard"
  },
  {
    "id": 1467,
    "topic": "number-of-transactions-per-visit",
    "difficulty": "hard"
  },
  {
    "id": 1468,
    "topic": "check-if-n-and-its-double-exist",
    "difficulty": "easy"
  },
  {
    "id": 1469,
    "topic": "minimum-number-of-steps-to-make-two-strings-anagram",
    "difficulty": "medium"
  },
  {
    "id": 1470,
    "topic": "tweet-counts-per-frequency",
    "difficulty": "medium"
  },
  {
    "id": 1471,
    "topic": "maximum-students-taking-exam",
    "difficulty": "hard"
  },
  {
    "id": 1472,
    "topic": "increasing-decreasing-string",
    "difficulty": "easy"
  },
  {
    "id": 1473,
    "topic": "find-the-longest-substring-containing-vowels-in-even-counts",
    "difficulty": "medium"
  },
  {
    "id": 1474,
    "topic": "longest-zigzag-path-in-a-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1475,
    "topic": "maximum-sum-bst-in-binary-tree",
    "difficulty": "hard"
  },
  {
    "id": 1476,
    "topic": "count-negative-numbers-in-a-sorted-matrix",
    "difficulty": "easy"
  },
  {
    "id": 1477,
    "topic": "product-of-the-last-k-numbers",
    "difficulty": "medium"
  },
  {
    "id": 1478,
    "topic": "maximum-number-of-events-that-can-be-attended",
    "difficulty": "medium"
  },
  {
    "id": 1479,
    "topic": "construct-target-array-with-multiple-sums",
    "difficulty": "hard"
  },
  {
    "id": 1480,
    "topic": "movie-rating",
    "difficulty": "medium"
  },
  {
    "id": 1481,
    "topic": "students-with-invalid-departments",
    "difficulty": "easy"
  },
  {
    "id": 1482,
    "topic": "how-many-numbers-are-smaller-than-the-current-number",
    "difficulty": "easy"
  },
  {
    "id": 1483,
    "topic": "rank-teams-by-votes",
    "difficulty": "medium"
  },
  {
    "id": 1484,
    "topic": "linked-list-in-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1485,
    "topic": "minimum-cost-to-make-at-least-one-valid-path-in-a-grid",
    "difficulty": "hard"
  },
  {
    "id": 1486,
    "topic": "find-the-distance-value-between-two-arrays",
    "difficulty": "easy"
  },
  {
    "id": 1487,
    "topic": "cinema-seat-allocation",
    "difficulty": "medium"
  },
  {
    "id": 1488,
    "topic": "sort-integers-by-the-power-value",
    "difficulty": "medium"
  },
  {
    "id": 1489,
    "topic": "pizza-with-3n-slices",
    "difficulty": "hard"
  },
  {
    "id": 1490,
    "topic": "generate-a-string-with-characters-that-have-odd-counts",
    "difficulty": "easy"
  },
  {
    "id": 1491,
    "topic": "number-of-times-binary-string-is-prefix-aligned",
    "difficulty": "medium"
  },
  {
    "id": 1492,
    "topic": "time-needed-to-inform-all-employees",
    "difficulty": "medium"
  },
  {
    "id": 1493,
    "topic": "frog-position-after-t-seconds",
    "difficulty": "hard"
  },
  {
    "id": 1494,
    "topic": "activity-participants",
    "difficulty": "medium"
  },
  {
    "id": 1495,
    "topic": "number-of-trusted-contacts-of-a-customer",
    "difficulty": "medium"
  },
  {
    "id": 1496,
    "topic": "lucky-numbers-in-a-matrix",
    "difficulty": "easy"
  },
  {
    "id": 1497,
    "topic": "design-a-stack-with-increment-operation",
    "difficulty": "medium"
  },
  {
    "id": 1498,
    "topic": "find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree",
    "difficulty": "medium"
  },
  {
    "id": 1499,
    "topic": "maximum-performance-of-a-team",
    "difficulty": "hard"
  },
  {
    "id": 1500,
    "topic": "count-largest-group",
    "difficulty": "easy"
  },
  {
    "id": 1501,
    "topic": "circle-and-rectangle-overlapping",
    "difficulty": "medium"
  },
  {
    "id": 1502,
    "topic": "construct-k-palindrome-strings",
    "difficulty": "medium"
  },
  {
    "id": 1503,
    "topic": "reducing-dishes",
    "difficulty": "hard"
  },
  {
    "id": 1504,
    "topic": "get-the-second-most-recent-activity",
    "difficulty": "hard"
  },
  {
    "id": 1505,
    "topic": "create-target-array-in-the-given-order",
    "difficulty": "easy"
  },
  {
    "id": 1507,
    "topic": "check-if-there-is-a-valid-path-in-a-grid",
    "difficulty": "medium"
  },
  {
    "id": 1508,
    "topic": "longest-happy-prefix",
    "difficulty": "hard"
  },
  {
    "id": 1509,
    "topic": "replace-employee-id-with-the-unique-identifier",
    "difficulty": "easy"
  },
  {
    "id": 1510,
    "topic": "find-lucky-integer-in-an-array",
    "difficulty": "easy"
  },
  {
    "id": 1511,
    "topic": "count-number-of-teams",
    "difficulty": "medium"
  },
  {
    "id": 1512,
    "topic": "design-underground-system",
    "difficulty": "medium"
  },
  {
    "id": 1513,
    "topic": "find-all-good-strings",
    "difficulty": "hard"
  },
  {
    "id": 1514,
    "topic": "minimum-value-to-get-positive-step-by-step-sum",
    "difficulty": "easy"
  },
  {
    "id": 1515,
    "topic": "find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k",
    "difficulty": "medium"
  },
  {
    "id": 1516,
    "topic": "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n",
    "difficulty": "medium"
  },
  {
    "id": 1517,
    "topic": "restore-the-array",
    "difficulty": "hard"
  },
  {
    "id": 1518,
    "topic": "total-sales-amount-by-year",
    "difficulty": "hard"
  },
  {
    "id": 1519,
    "topic": "minimum-subsequence-in-non-increasing-order",
    "difficulty": "easy"
  },
  {
    "id": 1520,
    "topic": "number-of-steps-to-reduce-a-number-in-binary-representation-to-one",
    "difficulty": "medium"
  },
  {
    "id": 1522,
    "topic": "stone-game-iii",
    "difficulty": "hard"
  },
  {
    "id": 1523,
    "topic": "capital-gainloss",
    "difficulty": "medium"
  },
  {
    "id": 1524,
    "topic": "string-matching-in-an-array",
    "difficulty": "easy"
  },
  {
    "id": 1525,
    "topic": "queries-on-a-permutation-with-key",
    "difficulty": "medium"
  },
  {
    "id": 1526,
    "topic": "html-entity-parser",
    "difficulty": "medium"
  },
  {
    "id": 1527,
    "topic": "number-of-ways-to-paint-n-3-grid",
    "difficulty": "hard"
  },
  {
    "id": 1528,
    "topic": "kids-with-the-greatest-number-of-candies",
    "difficulty": "easy"
  },
  {
    "id": 1529,
    "topic": "max-difference-you-can-get-from-changing-an-integer",
    "difficulty": "medium"
  },
  {
    "id": 1530,
    "topic": "check-if-a-string-can-break-another-string",
    "difficulty": "medium"
  },
  {
    "id": 1531,
    "topic": "number-of-ways-to-wear-different-hats-to-each-other",
    "difficulty": "hard"
  },
  {
    "id": 1532,
    "topic": "reformat-the-string",
    "difficulty": "easy"
  },
  {
    "id": 1533,
    "topic": "display-table-of-food-orders-in-a-restaurant",
    "difficulty": "medium"
  },
  {
    "id": 1534,
    "topic": "minimum-number-of-frogs-croaking",
    "difficulty": "medium"
  },
  {
    "id": 1535,
    "topic": "build-array-where-you-can-find-the-maximum-exactly-k-comparisons",
    "difficulty": "hard"
  },
  {
    "id": 1536,
    "topic": "customers-who-bought-products-a-and-b-but-not-c",
    "difficulty": "medium"
  },
  {
    "id": 1537,
    "topic": "maximum-score-after-splitting-a-string",
    "difficulty": "easy"
  },
  {
    "id": 1538,
    "topic": "maximum-points-you-can-obtain-from-cards",
    "difficulty": "medium"
  },
  {
    "id": 1539,
    "topic": "diagonal-traverse-ii",
    "difficulty": "medium"
  },
  {
    "id": 1541,
    "topic": "top-travellers",
    "difficulty": "easy"
  },
  {
    "id": 1542,
    "topic": "consecutive-characters",
    "difficulty": "easy"
  },
  {
    "id": 1543,
    "topic": "simplified-fractions",
    "difficulty": "medium"
  },
  {
    "id": 1544,
    "topic": "count-good-nodes-in-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1545,
    "topic": "form-largest-integer-with-digits-that-add-up-to-target",
    "difficulty": "hard"
  },
  {
    "id": 1546,
    "topic": "find-the-quiet-students-in-all-exams",
    "difficulty": "hard"
  },
  {
    "id": 1547,
    "topic": "destination-city",
    "difficulty": "easy"
  },
  {
    "id": 1548,
    "topic": "check-if-all-1s-are-at-least-length-k-places-away",
    "difficulty": "easy"
  },
  {
    "id": 1549,
    "topic": "longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit",
    "difficulty": "medium"
  },
  {
    "id": 1550,
    "topic": "find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows",
    "difficulty": "hard"
  },
  {
    "id": 1551,
    "topic": "npv-queries",
    "difficulty": "easy"
  },
  {
    "id": 1552,
    "topic": "build-an-array-with-stack-operations",
    "difficulty": "easy"
  },
  {
    "id": 1553,
    "topic": "count-triplets-that-can-form-two-arrays-of-equal-xor",
    "difficulty": "medium"
  },
  {
    "id": 1554,
    "topic": "minimum-time-to-collect-all-apples-in-a-tree",
    "difficulty": "medium"
  },
  {
    "id": 1555,
    "topic": "number-of-ways-of-cutting-a-pizza",
    "difficulty": "hard"
  },
  {
    "id": 1556,
    "topic": "make-two-arrays-equal-by-reversing-sub-arrays",
    "difficulty": "easy"
  },
  {
    "id": 1557,
    "topic": "check-if-a-string-contains-all-binary-codes-of-size-k",
    "difficulty": "medium"
  },
  {
    "id": 1558,
    "topic": "course-schedule-iv",
    "difficulty": "medium"
  },
  {
    "id": 1559,
    "topic": "cherry-pickup-ii",
    "difficulty": "hard"
  },
  {
    "id": 1560,
    "topic": "number-of-students-doing-homework-at-a-given-time",
    "difficulty": "easy"
  },
  {
    "id": 1561,
    "topic": "rearrange-words-in-a-sentence",
    "difficulty": "medium"
  },
  {
    "id": 1562,
    "topic": "people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list",
    "difficulty": "medium"
  },
  {
    "id": 1563,
    "topic": "maximum-number-of-darts-inside-of-a-circular-dartboard",
    "difficulty": "hard"
  },
  {
    "id": 1564,
    "topic": "create-a-session-bar-chart",
    "difficulty": "easy"
  },
  {
    "id": 1565,
    "topic": "evaluate-boolean-expression",
    "difficulty": "medium"
  },
  {
    "id": 1566,
    "topic": "check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence",
    "difficulty": "easy"
  },
  {
    "id": 1567,
    "topic": "maximum-number-of-vowels-in-a-substring-of-given-length",
    "difficulty": "medium"
  },
  {
    "id": 1568,
    "topic": "pseudo-palindromic-paths-in-a-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1569,
    "topic": "max-dot-product-of-two-subsequences",
    "difficulty": "hard"
  },
  {
    "id": 1570,
    "topic": "final-prices-with-a-special-discount-in-a-shop",
    "difficulty": "easy"
  },
  {
    "id": 1571,
    "topic": "allocate-mailboxes",
    "difficulty": "hard"
  },
  {
    "id": 1572,
    "topic": "subrectangle-queries",
    "difficulty": "medium"
  },
  {
    "id": 1573,
    "topic": "find-two-non-overlapping-sub-arrays-each-with-target-sum",
    "difficulty": "medium"
  },
  {
    "id": 1574,
    "topic": "maximum-product-of-two-elements-in-an-array",
    "difficulty": "easy"
  },
  {
    "id": 1575,
    "topic": "maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts",
    "difficulty": "medium"
  },
  {
    "id": 1576,
    "topic": "reorder-routes-to-make-all-paths-lead-to-the-city-zero",
    "difficulty": "medium"
  },
  {
    "id": 1577,
    "topic": "probability-of-a-two-boxes-having-the-same-number-of-distinct-balls",
    "difficulty": "hard"
  },
  {
    "id": 1578,
    "topic": "apples-oranges",
    "difficulty": "medium"
  },
  {
    "id": 1579,
    "topic": "active-users",
    "difficulty": "medium"
  },
  {
    "id": 1580,
    "topic": "shuffle-the-array",
    "difficulty": "easy"
  },
  {
    "id": 1581,
    "topic": "the-k-strongest-values-in-an-array",
    "difficulty": "medium"
  },
  {
    "id": 1582,
    "topic": "design-browser-history",
    "difficulty": "medium"
  },
  {
    "id": 1583,
    "topic": "paint-house-iii",
    "difficulty": "hard"
  },
  {
    "id": 1584,
    "topic": "average-salary-excluding-the-minimum-and-maximum-salary",
    "difficulty": "easy"
  },
  {
    "id": 1585,
    "topic": "the-kth-factor-of-n",
    "difficulty": "medium"
  },
  {
    "id": 1586,
    "topic": "longest-subarray-of-1s-after-deleting-one-element",
    "difficulty": "medium"
  },
  {
    "id": 1587,
    "topic": "parallel-courses-ii",
    "difficulty": "hard"
  },
  {
    "id": 1603,
    "topic": "running-sum-of-1d-array",
    "difficulty": "easy"
  },
  {
    "id": 1604,
    "topic": "least-number-of-unique-integers-after-k-removals",
    "difficulty": "medium"
  },
  {
    "id": 1605,
    "topic": "minimum-number-of-days-to-make-m-bouquets",
    "difficulty": "medium"
  },
  {
    "id": 1607,
    "topic": "rectangles-area",
    "difficulty": "medium"
  },
  {
    "id": 1608,
    "topic": "calculate-salaries",
    "difficulty": "medium"
  },
  {
    "id": 1609,
    "topic": "find-all-the-lonely-nodes",
    "difficulty": "easy"
  },
  {
    "id": 1610,
    "topic": "xor-operation-in-an-array",
    "difficulty": "easy"
  },
  {
    "id": 1611,
    "topic": "making-file-names-unique",
    "difficulty": "medium"
  },
  {
    "id": 1612,
    "topic": "avoid-flood-in-the-city",
    "difficulty": "medium"
  },
  {
    "id": 1613,
    "topic": "find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree",
    "difficulty": "hard"
  },
  {
    "id": 1615,
    "topic": "range-sum-of-sorted-subarray-sums",
    "difficulty": "medium"
  },
  {
    "id": 1616,
    "topic": "minimum-difference-between-largest-and-smallest-value-in-three-moves",
    "difficulty": "medium"
  },
  {
    "id": 1617,
    "topic": "stone-game-iv",
    "difficulty": "hard"
  },
  {
    "id": 1618,
    "topic": "delete-n-nodes-after-m-nodes-of-a-linked-list",
    "difficulty": "easy"
  },
  {
    "id": 1619,
    "topic": "path-crossing",
    "difficulty": "easy"
  },
  {
    "id": 1620,
    "topic": "check-if-array-pairs-are-divisible-by-k",
    "difficulty": "medium"
  },
  {
    "id": 1621,
    "topic": "number-of-subsequences-that-satisfy-the-given-sum-condition",
    "difficulty": "medium"
  },
  {
    "id": 1622,
    "topic": "max-value-of-equation",
    "difficulty": "hard"
  },
  {
    "id": 1623,
    "topic": "sales-by-day-of-the-week",
    "difficulty": "hard"
  },
  {
    "id": 1624,
    "topic": "clone-binary-tree-with-random-pointer",
    "difficulty": "medium"
  },
  {
    "id": 1625,
    "topic": "group-sold-products-by-the-date",
    "difficulty": "easy"
  },
  {
    "id": 1626,
    "topic": "can-make-arithmetic-progression-from-sequence",
    "difficulty": "easy"
  },
  {
    "id": 1627,
    "topic": "last-moment-before-all-ants-fall-out-of-a-plank",
    "difficulty": "medium"
  },
  {
    "id": 1628,
    "topic": "count-submatrices-with-all-ones",
    "difficulty": "medium"
  },
  {
    "id": 1629,
    "topic": "minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits",
    "difficulty": "hard"
  },
  {
    "id": 1630,
    "topic": "count-odd-numbers-in-an-interval-range",
    "difficulty": "easy"
  },
  {
    "id": 1631,
    "topic": "number-of-sub-arrays-with-odd-sum",
    "difficulty": "medium"
  },
  {
    "id": 1632,
    "topic": "number-of-good-ways-to-split-a-string",
    "difficulty": "medium"
  },
  {
    "id": 1633,
    "topic": "minimum-number-of-increments-on-subarrays-to-form-a-target-array",
    "difficulty": "hard"
  },
  {
    "id": 1634,
    "topic": "clone-n-ary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1635,
    "topic": "number-of-good-pairs",
    "difficulty": "easy"
  },
  {
    "id": 1636,
    "topic": "number-of-substrings-with-only-1s",
    "difficulty": "medium"
  },
  {
    "id": 1637,
    "topic": "string-compression-ii",
    "difficulty": "hard"
  },
  {
    "id": 1638,
    "topic": "best-position-for-a-service-centre",
    "difficulty": "hard"
  },
  {
    "id": 1639,
    "topic": "friendly-movies-streamed-last-month",
    "difficulty": "easy"
  },
  {
    "id": 1640,
    "topic": "design-a-file-sharing-system",
    "difficulty": "medium"
  },
  {
    "id": 1641,
    "topic": "countries-you-can-safely-invest-in",
    "difficulty": "medium"
  },
  {
    "id": 1642,
    "topic": "water-bottles",
    "difficulty": "easy"
  },
  {
    "id": 1643,
    "topic": "number-of-nodes-in-the-sub-tree-with-the-same-label",
    "difficulty": "medium"
  },
  {
    "id": 1644,
    "topic": "maximum-number-of-non-overlapping-substrings",
    "difficulty": "hard"
  },
  {
    "id": 1645,
    "topic": "find-a-value-of-a-mysterious-function-closest-to-target",
    "difficulty": "hard"
  },
  {
    "id": 1646,
    "topic": "kth-missing-positive-number",
    "difficulty": "easy"
  },
  {
    "id": 1647,
    "topic": "can-convert-string-in-k-moves",
    "difficulty": "medium"
  },
  {
    "id": 1648,
    "topic": "minimum-insertions-to-balance-a-parentheses-string",
    "difficulty": "medium"
  },
  {
    "id": 1649,
    "topic": "maximum-number-of-non-overlapping-subarrays-with-sum-equals-target",
    "difficulty": "medium"
  },
  {
    "id": 1650,
    "topic": "find-root-of-n-ary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1651,
    "topic": "shuffle-string",
    "difficulty": "easy"
  },
  {
    "id": 1652,
    "topic": "minimum-suffix-flips",
    "difficulty": "medium"
  },
  {
    "id": 1653,
    "topic": "number-of-good-leaf-nodes-pairs",
    "difficulty": "medium"
  },
  {
    "id": 1654,
    "topic": "customer-order-frequency",
    "difficulty": "easy"
  },
  {
    "id": 1655,
    "topic": "move-sub-tree-of-n-ary-tree",
    "difficulty": "hard"
  },
  {
    "id": 1656,
    "topic": "count-good-triplets",
    "difficulty": "easy"
  },
  {
    "id": 1657,
    "topic": "find-the-winner-of-an-array-game",
    "difficulty": "medium"
  },
  {
    "id": 1658,
    "topic": "minimum-swaps-to-arrange-a-binary-grid",
    "difficulty": "medium"
  },
  {
    "id": 1659,
    "topic": "get-the-maximum-score",
    "difficulty": "hard"
  },
  {
    "id": 1660,
    "topic": "thousand-separator",
    "difficulty": "easy"
  },
  {
    "id": 1661,
    "topic": "minimum-number-of-vertices-to-reach-all-nodes",
    "difficulty": "medium"
  },
  {
    "id": 1662,
    "topic": "minimum-numbers-of-function-calls-to-make-target-array",
    "difficulty": "medium"
  },
  {
    "id": 1663,
    "topic": "detect-cycles-in-2d-grid",
    "difficulty": "medium"
  },
  {
    "id": 1664,
    "topic": "find-users-with-valid-e-mails",
    "difficulty": "easy"
  },
  {
    "id": 1665,
    "topic": "diameter-of-n-ary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1666,
    "topic": "make-the-string-great",
    "difficulty": "easy"
  },
  {
    "id": 1667,
    "topic": "find-kth-bit-in-nth-binary-string",
    "difficulty": "medium"
  },
  {
    "id": 1668,
    "topic": "find-longest-awesome-substring",
    "difficulty": "hard"
  },
  {
    "id": 1669,
    "topic": "minimum-cost-to-cut-a-stick",
    "difficulty": "hard"
  },
  {
    "id": 1670,
    "topic": "patients-with-a-condition",
    "difficulty": "easy"
  },
  {
    "id": 1671,
    "topic": "the-most-recent-three-orders",
    "difficulty": "medium"
  },
  {
    "id": 1672,
    "topic": "find-the-index-of-the-large-integer",
    "difficulty": "medium"
  },
  {
    "id": 1674,
    "topic": "minimum-operations-to-make-array-equal",
    "difficulty": "medium"
  },
  {
    "id": 1675,
    "topic": "magnetic-force-between-two-balls",
    "difficulty": "medium"
  },
  {
    "id": 1676,
    "topic": "minimum-number-of-days-to-eat-n-oranges",
    "difficulty": "hard"
  },
  {
    "id": 1677,
    "topic": "matrix-diagonal-sum",
    "difficulty": "easy"
  },
  {
    "id": 1678,
    "topic": "number-of-ways-to-split-a-string",
    "difficulty": "medium"
  },
  {
    "id": 1679,
    "topic": "shortest-subarray-to-be-removed-to-make-array-sorted",
    "difficulty": "medium"
  },
  {
    "id": 1680,
    "topic": "count-all-possible-routes",
    "difficulty": "hard"
  },
  {
    "id": 1681,
    "topic": "guess-the-majority-in-a-hidden-array",
    "difficulty": "medium"
  },
  {
    "id": 1682,
    "topic": "most-visited-sector-in-a-circular-track",
    "difficulty": "easy"
  },
  {
    "id": 1683,
    "topic": "maximum-number-of-coins-you-can-get",
    "difficulty": "medium"
  },
  {
    "id": 1684,
    "topic": "find-latest-group-of-size-m",
    "difficulty": "medium"
  },
  {
    "id": 1685,
    "topic": "stone-game-v",
    "difficulty": "hard"
  },
  {
    "id": 1686,
    "topic": "fix-product-name-format",
    "difficulty": "easy"
  },
  {
    "id": 1687,
    "topic": "the-most-similar-path-in-a-graph",
    "difficulty": "hard"
  },
  {
    "id": 1688,
    "topic": "the-most-recent-orders-for-each-product",
    "difficulty": "medium"
  },
  {
    "id": 1689,
    "topic": "detect-pattern-of-length-m-repeated-k-or-more-times",
    "difficulty": "easy"
  },
  {
    "id": 1690,
    "topic": "maximum-length-of-subarray-with-positive-product",
    "difficulty": "medium"
  },
  {
    "id": 1691,
    "topic": "minimum-number-of-days-to-disconnect-island",
    "difficulty": "hard"
  },
  {
    "id": 1692,
    "topic": "number-of-ways-to-reorder-array-to-get-same-bst",
    "difficulty": "hard"
  },
  {
    "id": 1693,
    "topic": "sum-of-all-odd-length-subarrays",
    "difficulty": "easy"
  },
  {
    "id": 1694,
    "topic": "make-sum-divisible-by-p",
    "difficulty": "medium"
  },
  {
    "id": 1695,
    "topic": "maximum-sum-obtained-of-any-permutation",
    "difficulty": "medium"
  },
  {
    "id": 1696,
    "topic": "strange-printer-ii",
    "difficulty": "hard"
  },
  {
    "id": 1697,
    "topic": "strings-differ-by-one-character",
    "difficulty": "medium"
  },
  {
    "id": 1698,
    "topic": "replace-all-s-to-avoid-consecutive-repeating-characters",
    "difficulty": "easy"
  },
  {
    "id": 1699,
    "topic": "number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers",
    "difficulty": "medium"
  },
  {
    "id": 1700,
    "topic": "minimum-time-to-make-rope-colorful",
    "difficulty": "medium"
  },
  {
    "id": 1701,
    "topic": "remove-max-number-of-edges-to-keep-graph-fully-traversable",
    "difficulty": "hard"
  },
  {
    "id": 1702,
    "topic": "bank-account-summary",
    "difficulty": "medium"
  },
  {
    "id": 1703,
    "topic": "put-boxes-into-the-warehouse-i",
    "difficulty": "medium"
  },
  {
    "id": 1704,
    "topic": "special-positions-in-a-binary-matrix",
    "difficulty": "easy"
  },
  {
    "id": 1705,
    "topic": "count-unhappy-friends",
    "difficulty": "medium"
  },
  {
    "id": 1706,
    "topic": "min-cost-to-connect-all-points",
    "difficulty": "medium"
  },
  {
    "id": 1707,
    "topic": "check-if-string-is-transformable-with-substring-sort-operations",
    "difficulty": "hard"
  },
  {
    "id": 1708,
    "topic": "design-parking-system",
    "difficulty": "easy"
  },
  {
    "id": 1709,
    "topic": "alert-using-same-key-card-three-or-more-times-in-a-one-hour-period",
    "difficulty": "medium"
  },
  {
    "id": 1710,
    "topic": "find-servers-that-handled-most-number-of-requests",
    "difficulty": "hard"
  },
  {
    "id": 1711,
    "topic": "find-valid-matrix-given-row-and-column-sums",
    "difficulty": "medium"
  },
  {
    "id": 1712,
    "topic": "unique-orders-and-customers-per-month",
    "difficulty": "easy"
  },
  {
    "id": 1713,
    "topic": "dot-product-of-two-sparse-vectors",
    "difficulty": "medium"
  },
  {
    "id": 1714,
    "topic": "rearrange-spaces-between-words",
    "difficulty": "easy"
  },
  {
    "id": 1715,
    "topic": "split-a-string-into-the-max-number-of-unique-substrings",
    "difficulty": "medium"
  },
  {
    "id": 1716,
    "topic": "maximum-non-negative-product-in-a-matrix",
    "difficulty": "medium"
  },
  {
    "id": 1717,
    "topic": "minimum-cost-to-connect-two-groups-of-points",
    "difficulty": "hard"
  },
  {
    "id": 1718,
    "topic": "warehouse-manager",
    "difficulty": "easy"
  },
  {
    "id": 1719,
    "topic": "put-boxes-into-the-warehouse-ii",
    "difficulty": "medium"
  },
  {
    "id": 1720,
    "topic": "crawler-log-folder",
    "difficulty": "easy"
  },
  {
    "id": 1721,
    "topic": "maximum-profit-of-operating-a-centennial-wheel",
    "difficulty": "medium"
  },
  {
    "id": 1722,
    "topic": "throne-inheritance",
    "difficulty": "medium"
  },
  {
    "id": 1723,
    "topic": "maximum-number-of-achievable-transfer-requests",
    "difficulty": "hard"
  },
  {
    "id": 1724,
    "topic": "customer-who-visited-but-did-not-make-any-transactions",
    "difficulty": "easy"
  },
  {
    "id": 1725,
    "topic": "number-of-sets-of-k-non-overlapping-line-segments",
    "difficulty": "medium"
  },
  {
    "id": 1726,
    "topic": "coordinate-with-maximum-network-quality",
    "difficulty": "medium"
  },
  {
    "id": 1727,
    "topic": "cat-and-mouse-ii",
    "difficulty": "hard"
  },
  {
    "id": 1728,
    "topic": "fancy-sequence",
    "difficulty": "hard"
  },
  {
    "id": 1729,
    "topic": "binary-search-tree-iterator-ii",
    "difficulty": "medium"
  },
  {
    "id": 1730,
    "topic": "special-array-with-x-elements-greater-than-or-equal-x",
    "difficulty": "easy"
  },
  {
    "id": 1731,
    "topic": "even-odd-tree",
    "difficulty": "medium"
  },
  {
    "id": 1732,
    "topic": "minimum-one-bit-operations-to-make-integers-zero",
    "difficulty": "hard"
  },
  {
    "id": 1733,
    "topic": "maximum-number-of-visible-points",
    "difficulty": "hard"
  },
  {
    "id": 1734,
    "topic": "bank-account-summary-ii",
    "difficulty": "easy"
  },
  {
    "id": 1735,
    "topic": "the-most-frequently-ordered-products-for-each-customer",
    "difficulty": "medium"
  },
  {
    "id": 1736,
    "topic": "build-binary-expression-tree-from-infix-expression",
    "difficulty": "hard"
  },
  {
    "id": 1737,
    "topic": "maximum-nesting-depth-of-the-parentheses",
    "difficulty": "easy"
  },
  {
    "id": 1738,
    "topic": "maximal-network-rank",
    "difficulty": "medium"
  },
  {
    "id": 1739,
    "topic": "split-two-strings-to-make-palindrome",
    "difficulty": "medium"
  },
  {
    "id": 1740,
    "topic": "count-subtrees-with-max-distance-between-cities",
    "difficulty": "hard"
  },
  {
    "id": 1741,
    "topic": "sort-array-by-increasing-frequency",
    "difficulty": "easy"
  },
  {
    "id": 1742,
    "topic": "widest-vertical-area-between-two-points-containing-no-points",
    "difficulty": "medium"
  },
  {
    "id": 1743,
    "topic": "count-substrings-that-differ-by-one-character",
    "difficulty": "medium"
  },
  {
    "id": 1744,
    "topic": "number-of-ways-to-form-a-target-string-given-a-dictionary",
    "difficulty": "hard"
  },
  {
    "id": 1745,
    "topic": "find-nearest-right-node-in-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1746,
    "topic": "largest-substring-between-two-equal-characters",
    "difficulty": "easy"
  },
  {
    "id": 1747,
    "topic": "lexicographically-smallest-string-after-applying-operations",
    "difficulty": "medium"
  },
  {
    "id": 1748,
    "topic": "best-team-with-no-conflicts",
    "difficulty": "medium"
  },
  {
    "id": 1749,
    "topic": "sellers-with-no-sales",
    "difficulty": "easy"
  },
  {
    "id": 1750,
    "topic": "check-if-two-expression-trees-are-equivalent",
    "difficulty": "medium"
  },
  {
    "id": 1751,
    "topic": "slowest-key",
    "difficulty": "easy"
  },
  {
    "id": 1752,
    "topic": "arithmetic-subarrays",
    "difficulty": "medium"
  },
  {
    "id": 1753,
    "topic": "path-with-minimum-effort",
    "difficulty": "medium"
  },
  {
    "id": 1755,
    "topic": "defuse-the-bomb",
    "difficulty": "easy"
  },
  {
    "id": 1756,
    "topic": "minimum-deletions-to-make-string-balanced",
    "difficulty": "medium"
  },
  {
    "id": 1757,
    "topic": "minimum-jumps-to-reach-home",
    "difficulty": "medium"
  },
  {
    "id": 1758,
    "topic": "distribute-repeating-integers",
    "difficulty": "hard"
  },
  {
    "id": 1759,
    "topic": "find-the-missing-ids",
    "difficulty": "medium"
  },
  {
    "id": 1760,
    "topic": "check-array-formation-through-concatenation",
    "difficulty": "easy"
  },
  {
    "id": 1761,
    "topic": "count-sorted-vowel-strings",
    "difficulty": "medium"
  },
  {
    "id": 1762,
    "topic": "furthest-building-you-can-reach",
    "difficulty": "medium"
  },
  {
    "id": 1763,
    "topic": "all-valid-triplets-that-can-represent-a-country",
    "difficulty": "easy"
  },
  {
    "id": 1764,
    "topic": "maximum-repeating-substring",
    "difficulty": "easy"
  },
  {
    "id": 1765,
    "topic": "merge-in-between-linked-lists",
    "difficulty": "medium"
  },
  {
    "id": 1766,
    "topic": "minimum-number-of-removals-to-make-mountain-array",
    "difficulty": "hard"
  },
  {
    "id": 1767,
    "topic": "design-front-middle-back-queue",
    "difficulty": "medium"
  },
  {
    "id": 1768,
    "topic": "design-an-expression-tree-with-evaluate-function",
    "difficulty": "medium"
  },
  {
    "id": 1769,
    "topic": "get-maximum-in-generated-array",
    "difficulty": "easy"
  },
  {
    "id": 1770,
    "topic": "minimum-deletions-to-make-character-frequencies-unique",
    "difficulty": "medium"
  },
  {
    "id": 1771,
    "topic": "sell-diminishing-valued-colored-balls",
    "difficulty": "medium"
  },
  {
    "id": 1772,
    "topic": "create-sorted-array-through-instructions",
    "difficulty": "hard"
  },
  {
    "id": 1773,
    "topic": "percentage-of-users-attended-a-contest",
    "difficulty": "easy"
  },
  {
    "id": 1774,
    "topic": "add-two-polynomials-represented-as-linked-lists",
    "difficulty": "medium"
  },
  {
    "id": 1775,
    "topic": "design-an-ordered-stream",
    "difficulty": "easy"
  },
  {
    "id": 1776,
    "topic": "minimum-operations-to-reduce-x-to-zero",
    "difficulty": "medium"
  },
  {
    "id": 1777,
    "topic": "determine-if-two-strings-are-close",
    "difficulty": "medium"
  },
  {
    "id": 1778,
    "topic": "maximize-grid-happiness",
    "difficulty": "hard"
  },
  {
    "id": 1779,
    "topic": "hopper-company-queries-i",
    "difficulty": "hard"
  },
  {
    "id": 1780,
    "topic": "lowest-common-ancestor-of-a-binary-tree-ii",
    "difficulty": "medium"
  },
  {
    "id": 1781,
    "topic": "check-if-two-string-arrays-are-equivalent",
    "difficulty": "easy"
  },
  {
    "id": 1782,
    "topic": "smallest-string-with-a-given-numeric-value",
    "difficulty": "medium"
  },
  {
    "id": 1783,
    "topic": "ways-to-make-a-fair-array",
    "difficulty": "medium"
  },
  {
    "id": 1784,
    "topic": "minimum-initial-energy-to-finish-tasks",
    "difficulty": "hard"
  },
  {
    "id": 1785,
    "topic": "hopper-company-queries-ii",
    "difficulty": "hard"
  },
  {
    "id": 1786,
    "topic": "count-the-number-of-consistent-strings",
    "difficulty": "easy"
  },
  {
    "id": 1787,
    "topic": "sum-of-absolute-differences-in-a-sorted-array",
    "difficulty": "medium"
  },
  {
    "id": 1788,
    "topic": "stone-game-vi",
    "difficulty": "medium"
  },
  {
    "id": 1789,
    "topic": "delivering-boxes-from-storage-to-ports",
    "difficulty": "hard"
  },
  {
    "id": 1790,
    "topic": "lowest-common-ancestor-of-a-binary-tree-iii",
    "difficulty": "medium"
  },
  {
    "id": 1791,
    "topic": "richest-customer-wealth",
    "difficulty": "easy"
  },
  {
    "id": 1792,
    "topic": "find-the-most-competitive-subsequence",
    "difficulty": "medium"
  },
  {
    "id": 1793,
    "topic": "minimum-moves-to-make-array-complementary",
    "difficulty": "medium"
  },
  {
    "id": 1794,
    "topic": "minimize-deviation-in-array",
    "difficulty": "hard"
  },
  {
    "id": 1795,
    "topic": "hopper-company-queries-iii",
    "difficulty": "hard"
  },
  {
    "id": 1796,
    "topic": "correct-a-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1797,
    "topic": "goal-parser-interpretation",
    "difficulty": "easy"
  },
  {
    "id": 1798,
    "topic": "max-number-of-k-sum-pairs",
    "difficulty": "medium"
  },
  {
    "id": 1799,
    "topic": "minimum-incompatibility",
    "difficulty": "hard"
  },
  {
    "id": 1800,
    "topic": "concatenation-of-consecutive-binary-numbers",
    "difficulty": "medium"
  },
  {
    "id": 1801,
    "topic": "average-time-of-process-per-machine",
    "difficulty": "easy"
  },
  {
    "id": 1802,
    "topic": "number-of-students-unable-to-eat-lunch",
    "difficulty": "easy"
  },
  {
    "id": 1803,
    "topic": "average-waiting-time",
    "difficulty": "medium"
  },
  {
    "id": 1804,
    "topic": "maximum-binary-string-after-change",
    "difficulty": "medium"
  },
  {
    "id": 1805,
    "topic": "minimum-adjacent-swaps-for-k-consecutive-ones",
    "difficulty": "hard"
  },
  {
    "id": 1806,
    "topic": "count-of-matches-in-tournament",
    "difficulty": "easy"
  },
  {
    "id": 1807,
    "topic": "partitioning-into-minimum-number-of-deci-binary-numbers",
    "difficulty": "medium"
  },
  {
    "id": 1808,
    "topic": "stone-game-vii",
    "difficulty": "medium"
  },
  {
    "id": 1809,
    "topic": "sum-of-special-evenly-spaced-elements-in-array",
    "difficulty": "hard"
  },
  {
    "id": 1810,
    "topic": "change-the-root-of-a-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1811,
    "topic": "fix-names-in-a-table",
    "difficulty": "easy"
  },
  {
    "id": 1812,
    "topic": "reformat-phone-number",
    "difficulty": "easy"
  },
  {
    "id": 1813,
    "topic": "maximum-erasure-value",
    "difficulty": "medium"
  },
  {
    "id": 1814,
    "topic": "jump-game-vi",
    "difficulty": "medium"
  },
  {
    "id": 1815,
    "topic": "checking-existence-of-edge-length-limited-paths",
    "difficulty": "hard"
  },
  {
    "id": 1816,
    "topic": "lowest-common-ancestor-of-a-binary-tree-iv",
    "difficulty": "medium"
  },
  {
    "id": 1817,
    "topic": "calculate-money-in-leetcode-bank",
    "difficulty": "easy"
  },
  {
    "id": 1818,
    "topic": "maximum-score-from-removing-substrings",
    "difficulty": "medium"
  },
  {
    "id": 1819,
    "topic": "construct-the-lexicographically-largest-valid-sequence",
    "difficulty": "medium"
  },
  {
    "id": 1820,
    "topic": "number-of-ways-to-reconstruct-a-tree",
    "difficulty": "hard"
  },
  {
    "id": 1821,
    "topic": "products-worth-over-invoices",
    "difficulty": "easy"
  },
  {
    "id": 1822,
    "topic": "longest-palindromic-subsequence-ii",
    "difficulty": "medium"
  },
  {
    "id": 1823,
    "topic": "determine-if-string-halves-are-alike",
    "difficulty": "easy"
  },
  {
    "id": 1824,
    "topic": "maximum-number-of-eaten-apples",
    "difficulty": "medium"
  },
  {
    "id": 1825,
    "topic": "find-minimum-time-to-finish-all-jobs",
    "difficulty": "hard"
  },
  {
    "id": 1826,
    "topic": "maximum-xor-with-an-element-from-array",
    "difficulty": "hard"
  },
  {
    "id": 1827,
    "topic": "invalid-tweets",
    "difficulty": "easy"
  },
  {
    "id": 1828,
    "topic": "count-ways-to-distribute-candies",
    "difficulty": "hard"
  },
  {
    "id": 1829,
    "topic": "maximum-units-on-a-truck",
    "difficulty": "easy"
  },
  {
    "id": 1830,
    "topic": "count-good-meals",
    "difficulty": "medium"
  },
  {
    "id": 1831,
    "topic": "ways-to-split-array-into-three-subarrays",
    "difficulty": "medium"
  },
  {
    "id": 1832,
    "topic": "minimum-operations-to-make-a-subsequence",
    "difficulty": "hard"
  },
  {
    "id": 1833,
    "topic": "find-the-highest-altitude",
    "difficulty": "easy"
  },
  {
    "id": 1834,
    "topic": "minimum-number-of-people-to-teach",
    "difficulty": "medium"
  },
  {
    "id": 1835,
    "topic": "decode-xored-permutation",
    "difficulty": "medium"
  },
  {
    "id": 1836,
    "topic": "count-ways-to-make-array-with-product",
    "difficulty": "hard"
  },
  {
    "id": 1837,
    "topic": "daily-leads-and-partners",
    "difficulty": "easy"
  },
  {
    "id": 1838,
    "topic": "number-of-distinct-substrings-in-a-string",
    "difficulty": "medium"
  },
  {
    "id": 1839,
    "topic": "decode-xored-array",
    "difficulty": "easy"
  },
  {
    "id": 1840,
    "topic": "minimize-hamming-distance-after-swap-operations",
    "difficulty": "medium"
  },
  {
    "id": 1842,
    "topic": "number-of-calls-between-two-persons",
    "difficulty": "medium"
  },
  {
    "id": 1843,
    "topic": "number-of-rectangles-that-can-form-the-largest-square",
    "difficulty": "easy"
  },
  {
    "id": 1844,
    "topic": "maximum-number-of-balls-in-a-box",
    "difficulty": "easy"
  },
  {
    "id": 1845,
    "topic": "largest-submatrix-with-rearrangements",
    "difficulty": "medium"
  },
  {
    "id": 1847,
    "topic": "largest-subarray-length-k",
    "difficulty": "easy"
  },
  {
    "id": 1848,
    "topic": "sum-of-unique-elements",
    "difficulty": "easy"
  },
  {
    "id": 1849,
    "topic": "maximum-absolute-sum-of-any-subarray",
    "difficulty": "medium"
  },
  {
    "id": 1850,
    "topic": "minimum-length-of-string-after-deleting-similar-ends",
    "difficulty": "medium"
  },
  {
    "id": 1851,
    "topic": "maximum-number-of-events-that-can-be-attended-ii",
    "difficulty": "hard"
  },
  {
    "id": 1852,
    "topic": "biggest-window-between-visits",
    "difficulty": "medium"
  },
  {
    "id": 1858,
    "topic": "latest-time-by-replacing-hidden-digits",
    "difficulty": "easy"
  },
  {
    "id": 1859,
    "topic": "change-minimum-characters-to-satisfy-one-of-three-conditions",
    "difficulty": "medium"
  },
  {
    "id": 1860,
    "topic": "find-kth-largest-xor-coordinate-value",
    "difficulty": "medium"
  },
  {
    "id": 1861,
    "topic": "building-boxes",
    "difficulty": "hard"
  },
  {
    "id": 1862,
    "topic": "count-apples-and-oranges",
    "difficulty": "medium"
  },
  {
    "id": 1865,
    "topic": "checking-existence-of-edge-length-limited-paths-ii",
    "difficulty": "hard"
  },
  {
    "id": 1866,
    "topic": "restore-the-array-from-adjacent-pairs",
    "difficulty": "medium"
  },
  {
    "id": 1871,
    "topic": "palindrome-partitioning-iv",
    "difficulty": "hard"
  },
  {
    "id": 1872,
    "topic": "can-you-eat-your-favorite-candy-on-your-favorite-day",
    "difficulty": "medium"
  },
  {
    "id": 1873,
    "topic": "longest-nice-substring",
    "difficulty": "easy"
  },
  {
    "id": 1874,
    "topic": "form-array-by-concatenating-subarrays-of-another-array",
    "difficulty": "medium"
  },
  {
    "id": 1875,
    "topic": "tree-of-coprimes",
    "difficulty": "hard"
  },
  {
    "id": 1876,
    "topic": "map-of-highest-peak",
    "difficulty": "medium"
  },
  {
    "id": 1877,
    "topic": "find-followers-count",
    "difficulty": "easy"
  },
  {
    "id": 1878,
    "topic": "check-if-array-is-sorted-and-rotated",
    "difficulty": "easy"
  },
  {
    "id": 1879,
    "topic": "maximum-score-from-removing-stones",
    "difficulty": "medium"
  },
  {
    "id": 1880,
    "topic": "largest-merge-of-two-strings",
    "difficulty": "medium"
  },
  {
    "id": 1881,
    "topic": "closest-subsequence-sum",
    "difficulty": "hard"
  },
  {
    "id": 1882,
    "topic": "the-number-of-employees-which-report-to-each-employee",
    "difficulty": "easy"
  },
  {
    "id": 1883,
    "topic": "find-distance-in-a-binary-tree",
    "difficulty": "medium"
  },
  {
    "id": 1884,
    "topic": "minimum-changes-to-make-alternating-binary-string",
    "difficulty": "easy"
  },
  {
    "id": 1885,
    "topic": "count-number-of-homogenous-substrings",
    "difficulty": "medium"
  },
  {
    "id": 1886,
    "topic": "minimum-limit-of-balls-in-a-bag",
    "difficulty": "medium"
  },
  {
    "id": 1887,
    "topic": "minimum-degree-of-a-connected-trio-in-a-graph",
    "difficulty": "hard"
  },
  {
    "id": 1888,
    "topic": "find-nearest-point-that-has-the-same-x-or-y-coordinate",
    "difficulty": "easy"
  },
  {
    "id": 1889,
    "topic": "check-if-number-is-a-sum-of-powers-of-three",
    "difficulty": "medium"
  },
  {
    "id": 1890,
    "topic": "sum-of-beauty-of-all-substrings",
    "difficulty": "medium"
  },
  {
    "id": 1891,
    "topic": "count-pairs-of-nodes",
    "difficulty": "hard"
  },
  {
    "id": 1892,
    "topic": "find-total-time-spent-by-each-employee",
    "difficulty": "easy"
  },
  {
    "id": 1893,
    "topic": "maximum-subarray-sum-after-one-operation",
    "difficulty": "medium"
  },
  {
    "id": 1894,
    "topic": "merge-strings-alternately",
    "difficulty": "easy"
  },
  {
    "id": 1895,
    "topic": "minimum-number-of-operations-to-move-all-balls-to-each-box",
    "difficulty": "medium"
  },
  {
    "id": 1896,
    "topic": "maximum-score-from-performing-multiplication-operations",
    "difficulty": "medium"
  },
  {
    "id": 1897,
    "topic": "maximize-palindrome-length-from-subsequences",
    "difficulty": "hard"
  },
  {
    "id": 1898,
    "topic": "leetflex-banned-accounts",
    "difficulty": "medium"
  },
  {
    "id": 1899,
    "topic": "count-items-matching-a-rule",
    "difficulty": "easy"
  },
  {
    "id": 1900,
    "topic": "closest-dessert-cost",
    "difficulty": "medium"
  },
  {
    "id": 1901,
    "topic": "equal-sum-arrays-with-minimum-number-of-operations",
    "difficulty": "medium"
  },
  {
    "id": 1902,
    "topic": "car-fleet-ii",
    "difficulty": "hard"
  },
  {
    "id": 1903,
    "topic": "design-most-recently-used-queue",
    "difficulty": "medium"
  },
  {
    "id": 1904,
    "topic": "second-largest-digit-in-a-string",
    "difficulty": "easy"
  },
  {
    "id": 1905,
    "topic": "design-authentication-manager",
    "difficulty": "medium"
  },
  {
    "id": 1906,
    "topic": "maximize-score-after-n-operations",
    "difficulty": "hard"
  },
  {
    "id": 1907,
    "topic": "count-pairs-with-xor-in-a-range",
    "difficulty": "hard"
  },
  {
    "id": 1908,
    "topic": "recyclable-and-low-fat-products",
    "difficulty": "easy"
  },
  {
    "id": 1909,
    "topic": "buildings-with-an-ocean-view",
    "difficulty": "medium"
  },
  {
    "id": 1910,
    "topic": "check-if-binary-string-has-at-most-one-segment-of-ones",
    "difficulty": "easy"
  },
  {
    "id": 1911,
    "topic": "minimum-elements-to-add-to-form-a-given-sum",
    "difficulty": "medium"
  },
  {
    "id": 1912,
    "topic": "number-of-restricted-paths-from-first-to-last-node",
    "difficulty": "medium"
  },
  {
    "id": 1913,
    "topic": "make-the-xor-of-all-segments-equal-to-zero",
    "difficulty": "hard"
  },
  {
    "id": 1914,
    "topic": "find-the-subtasks-that-did-not-execute",
    "difficulty": "hard"
  },
  {
    "id": 1915,
    "topic": "check-if-one-string-swap-can-make-strings-equal",
    "difficulty": "easy"
  },
  {
    "id": 1916,
    "topic": "find-center-of-star-graph",
    "difficulty": "easy"
  },
  {
    "id": 1917,
    "topic": "maximum-average-pass-ratio",
    "difficulty": "medium"
  },
  {
    "id": 1918,
    "topic": "maximum-score-of-a-good-subarray",
    "difficulty": "hard"
  },
  {
    "id": 1919,
    "topic": "sort-features-by-popularity",
    "difficulty": "medium"
  },
  {
    "id": 1920,
    "topic": "determine-color-of-a-chessboard-square",
    "difficulty": "easy"
  },
  {
    "id": 1923,
    "topic": "sentence-similarity-iii",
    "difficulty": "medium"
  },
  {
    "id": 1924,
    "topic": "maximum-number-of-groups-getting-fresh-donuts",
    "difficulty": "hard"
  },
  {
    "id": 1925,
    "topic": "count-nice-pairs-in-an-array",
    "difficulty": "medium"
  },
  {
    "id": 1926,
    "topic": "products-price-for-each-store",
    "difficulty": "easy"
  },
  {
    "id": 1927,
    "topic": "maximum-ascending-subarray-sum",
    "difficulty": "easy"
  },
  {
    "id": 1928,
    "topic": "number-of-orders-in-the-backlog",
    "difficulty": "medium"
  },
  {
    "id": 1929,
    "topic": "maximum-value-at-a-given-index-in-a-bounded-array",
    "difficulty": "medium"
  },
  {
    "id": 1930,
    "topic": "maximum-number-of-consecutive-values-you-can-make",
    "difficulty": "medium"
  },
  {
    "id": 1931,
    "topic": "shortest-path-in-a-hidden-grid",
    "difficulty": "medium"
  },
  {
    "id": 1932,
    "topic": "grand-slam-titles",
    "difficulty": "medium"
  },
  {
    "id": 1933,
    "topic": "number-of-different-integers-in-a-string",
    "difficulty": "easy"
  },
  {
    "id": 1934,
    "topic": "evaluate-the-bracket-pairs-of-a-string",
    "difficulty": "medium"
  },
  {
    "id": 1935,
    "topic": "minimum-number-of-operations-to-reinitialize-a-permutation",
    "difficulty": "medium"
  },
  {
    "id": 1936,
    "topic": "maximize-number-of-nice-divisors",
    "difficulty": "hard"
  },
  {
    "id": 1937,
    "topic": "maximize-the-beauty-of-the-garden",
    "difficulty": "hard"
  },
  {
    "id": 1938,
    "topic": "minimum-operations-to-make-the-array-increasing",
    "difficulty": "easy"
  },
  {
    "id": 1939,
    "topic": "queries-on-number-of-points-inside-a-circle",
    "difficulty": "medium"
  },
  {
    "id": 1940,
    "topic": "maximum-xor-for-each-query",
    "difficulty": "medium"
  },
  {
    "id": 1941,
    "topic": "minimum-number-of-operations-to-make-string-sorted",
    "difficulty": "hard"
  },
  {
    "id": 1942,
    "topic": "primary-department-for-each-employee",
    "difficulty": "easy"
  },
  {
    "id": 1943,
    "topic": "count-pairs-of-equal-substrings-with-minimum-difference",
    "difficulty": "medium"
  },
  {
    "id": 1944,
    "topic": "truncate-sentence",
    "difficulty": "easy"
  },
  {
    "id": 1945,
    "topic": "finding-the-users-active-minutes",
    "difficulty": "medium"
  },
  {
    "id": 1946,
    "topic": "minimum-absolute-sum-difference",
    "difficulty": "medium"
  },
  {
    "id": 1947,
    "topic": "number-of-different-subsequences-gcds",
    "difficulty": "hard"
  },
  {
    "id": 1948,
    "topic": "rearrange-products-table",
    "difficulty": "easy"
  },
  {
    "id": 1949,
    "topic": "implement-trie-ii-prefix-tree",
    "difficulty": "medium"
  },
  {
    "id": 1950,
    "topic": "sign-of-the-product-of-an-array",
    "difficulty": "easy"
  },
  {
    "id": 1951,
    "topic": "find-the-winner-of-the-circular-game",
    "difficulty": "medium"
  },
  {
    "id": 1952,
    "topic": "minimum-sideway-jumps",
    "difficulty": "medium"
  },
  {
    "id": 1953,
    "topic": "finding-mk-average",
    "difficulty": "hard"
  },
  {
    "id": 1954,
    "topic": "replace-all-digits-with-characters",
    "difficulty": "easy"
  },
  {
    "id": 1955,
    "topic": "seat-reservation-manager",
    "difficulty": "medium"
  },
  {
    "id": 1956,
    "topic": "maximum-element-after-decreasing-and-rearranging",
    "difficulty": "medium"
  },
  {
    "id": 1957,
    "topic": "closest-room",
    "difficulty": "hard"
  },
  {
    "id": 1958,
    "topic": "ad-free-sessions",
    "difficulty": "easy"
  },
  {
    "id": 1959,
    "topic": "minimum-path-cost-in-a-hidden-grid",
    "difficulty": "medium"
  },
  {
    "id": 1960,
    "topic": "check-if-the-sentence-is-pangram",
    "difficulty": "easy"
  },
  {
    "id": 1961,
    "topic": "maximum-ice-cream-bars",
    "difficulty": "medium"
  },
  {
    "id": 1962,
    "topic": "single-threaded-cpu",
    "difficulty": "medium"
  },
  {
    "id": 1963,
    "topic": "find-xor-sum-of-all-pairs-bitwise-and",
    "difficulty": "hard"
  },
  {
    "id": 1964,
    "topic": "find-interview-candidates",
    "difficulty": "medium"
  },
  {
    "id": 1965,
    "topic": "sum-of-digits-in-base-k",
    "difficulty": "easy"
  },
  {
    "id": 1966,
    "topic": "frequency-of-the-most-frequent-element",
    "difficulty": "medium"
  },
  {
    "id": 1967,
    "topic": "longest-substring-of-all-vowels-in-order",
    "difficulty": "medium"
  },
  {
    "id": 1968,
    "topic": "maximum-building-height",
    "difficulty": "hard"
  },
  {
    "id": 1969,
    "topic": "maximum-number-of-accepted-invitations",
    "difficulty": "medium"
  },
  {
    "id": 1970,
    "topic": "sorting-the-sentence",
    "difficulty": "easy"
  },
  {
    "id": 1971,
    "topic": "incremental-memory-leak",
    "difficulty": "medium"
  },
  {
    "id": 1972,
    "topic": "rotating-the-box",
    "difficulty": "medium"
  },
  {
    "id": 1974,
    "topic": "find-customers-with-positive-revenue-this-year",
    "difficulty": "easy"
  },
  {
    "id": 1975,
    "topic": "minimum-distance-to-the-target-element",
    "difficulty": "easy"
  },
  {
    "id": 1976,
    "topic": "splitting-a-string-into-descending-consecutive-values",
    "difficulty": "medium"
  },
  {
    "id": 1977,
    "topic": "minimum-interval-to-include-each-query",
    "difficulty": "hard"
  },
  {
    "id": 1978,
    "topic": "minimum-adjacent-swaps-to-reach-the-kth-smallest-number",
    "difficulty": "medium"
  },
  {
    "id": 1979,
    "topic": "maximum-number-of-people-that-can-be-caught-in-tag",
    "difficulty": "medium"
  },
  {
    "id": 1980,
    "topic": "faulty-sensor",
    "difficulty": "easy"
  },
  {
    "id": 1981,
    "topic": "maximum-transaction-each-day",
    "difficulty": "medium"
  },
  {
    "id": 1982,
    "topic": "remove-duplicates-from-an-unsorted-linked-list",
    "difficulty": "medium"
  },
  {
    "id": 1983,
    "topic": "maximum-population-year",
    "difficulty": "easy"
  },
  {
    "id": 1984,
    "topic": "maximum-distance-between-a-pair-of-values",
    "difficulty": "medium"
  },
  {
    "id": 1985,
    "topic": "maximum-subarray-min-product",
    "difficulty": "medium"
  },
  {
    "id": 1986,
    "topic": "largest-color-value-in-a-directed-graph",
    "difficulty": "hard"
  },
  {
    "id": 1987,
    "topic": "substrings-of-size-three-with-distinct-characters",
    "difficulty": "easy"
  },
  {
    "id": 1988,
    "topic": "minimize-maximum-pair-sum-in-array",
    "difficulty": "medium"
  },
  {
    "id": 1989,
    "topic": "minimum-xor-sum-of-two-arrays",
    "difficulty": "hard"
  },
  {
    "id": 1990,
    "topic": "get-biggest-three-rhombus-sums-in-a-grid",
    "difficulty": "medium"
  },
  {
    "id": 1991,
    "topic": "league-statistics",
    "difficulty": "medium"
  },
  {
    "id": 1992,
    "topic": "sort-linked-list-already-sorted-using-absolute-values",
    "difficulty": "medium"
  },
  {
    "id": 1993,
    "topic": "sum-of-all-subset-xor-totals",
    "difficulty": "easy"
  },
  {
    "id": 1994,
    "topic": "minimum-number-of-swaps-to-make-the-binary-string-alternating",
    "difficulty": "medium"
  },
  {
    "id": 1995,
    "topic": "finding-pairs-with-a-certain-sum",
    "difficulty": "medium"
  },
  {
    "id": 1996,
    "topic": "number-of-ways-to-rearrange-sticks-with-k-sticks-visible",
    "difficulty": "hard"
  },
  {
    "id": 1997,
    "topic": "next-palindrome-using-same-digits",
    "difficulty": "hard"
  },
  {
    "id": 1998,
    "topic": "suspicious-bank-accounts",
    "difficulty": "medium"
  },
  {
    "id": 1999,
    "topic": "longer-contiguous-segments-of-ones-than-zeros",
    "difficulty": "easy"
  },
  {
    "id": 2000,
    "topic": "minimum-speed-to-arrive-on-time",
    "difficulty": "medium"
  },
  {
    "id": 2001,
    "topic": "jump-game-vii",
    "difficulty": "medium"
  },
  {
    "id": 2002,
    "topic": "stone-game-viii",
    "difficulty": "hard"
  },
  {
    "id": 2003,
    "topic": "distinct-numbers-in-each-subarray",
    "difficulty": "medium"
  },
  {
    "id": 2004,
    "topic": "convert-date-format",
    "difficulty": "easy"
  },
  {
    "id": 2005,
    "topic": "check-if-all-the-integers-in-a-range-are-covered",
    "difficulty": "easy"
  },
  {
    "id": 2006,
    "topic": "find-the-student-that-will-replace-the-chalk",
    "difficulty": "medium"
  },
  {
    "id": 2008,
    "topic": "minimum-cost-to-change-the-final-value-of-expression",
    "difficulty": "hard"
  },
  {
    "id": 2009,
    "topic": "longest-word-with-all-prefixes",
    "difficulty": "medium"
  },
  {
    "id": 2010,
    "topic": "check-if-word-equals-summation-of-two-words",
    "difficulty": "easy"
  },
  {
    "id": 2011,
    "topic": "maximum-value-after-insertion",
    "difficulty": "medium"
  },
  {
    "id": 2012,
    "topic": "process-tasks-using-servers",
    "difficulty": "medium"
  },
  {
    "id": 2013,
    "topic": "minimum-skips-to-arrive-at-meeting-on-time",
    "difficulty": "hard"
  },
  {
    "id": 2014,
    "topic": "orders-with-maximum-quantity-above-average",
    "difficulty": "medium"
  },
  {
    "id": 2015,
    "topic": "determine-whether-matrix-can-be-obtained-by-rotation",
    "difficulty": "easy"
  },
  {
    "id": 2016,
    "topic": "reduction-operations-to-make-the-array-elements-equal",
    "difficulty": "medium"
  },
  {
    "id": 2017,
    "topic": "minimum-number-of-flips-to-make-the-binary-string-alternating",
    "difficulty": "medium"
  },
  {
    "id": 2018,
    "topic": "minimum-space-wasted-from-packaging",
    "difficulty": "hard"
  },
  {
    "id": 2019,
    "topic": "product-of-two-run-length-encoded-arrays",
    "difficulty": "medium"
  },
  {
    "id": 2020,
    "topic": "remove-one-element-to-make-the-array-strictly-increasing",
    "difficulty": "easy"
  },
  {
    "id": 2021,
    "topic": "remove-all-occurrences-of-a-substring",
    "difficulty": "medium"
  },
  {
    "id": 2022,
    "topic": "maximum-alternating-subsequence-sum",
    "difficulty": "medium"
  },
  {
    "id": 2023,
    "topic": "design-movie-rental-system",
    "difficulty": "hard"
  },
  {
    "id": 2024,
    "topic": "calculate-special-bonus",
    "difficulty": "easy"
  },
  {
    "id": 2025,
    "topic": "redistribute-characters-to-make-all-strings-equal",
    "difficulty": "easy"
  },
  {
    "id": 2026,
    "topic": "merge-triplets-to-form-target-triplet",
    "difficulty": "medium"
  },
  {
    "id": 2027,
    "topic": "maximum-number-of-removable-characters",
    "difficulty": "medium"
  },
  {
    "id": 2028,
    "topic": "the-earliest-and-latest-rounds-where-players-compete",
    "difficulty": "hard"
  },
  {
    "id": 2029,
    "topic": "minimize-product-sum-of-two-arrays",
    "difficulty": "medium"
  },
  {
    "id": 2030,
    "topic": "group-employees-of-the-same-salary",
    "difficulty": "medium"
  },
  {
    "id": 2031,
    "topic": "egg-drop-with-2-eggs-and-n-floors",
    "difficulty": "medium"
  },
  {
    "id": 2032,
    "topic": "largest-odd-number-in-string",
    "difficulty": "easy"
  },
  {
    "id": 2033,
    "topic": "the-number-of-full-rounds-you-have-played",
    "difficulty": "medium"
  },
  {
    "id": 2034,
    "topic": "minimum-absolute-difference-queries",
    "difficulty": "medium"
  },
  {
    "id": 2035,
    "topic": "count-sub-islands",
    "difficulty": "medium"
  },
  {
    "id": 2036,
    "topic": "count-pairs-in-two-arrays",
    "difficulty": "medium"
  },
  {
    "id": 2037,
    "topic": "count-square-sum-triples",
    "difficulty": "easy"
  },
  {
    "id": 2038,
    "topic": "nearest-exit-from-entrance-in-maze",
    "difficulty": "medium"
  },
  {
    "id": 2039,
    "topic": "sum-game",
    "difficulty": "medium"
  },
  {
    "id": 2040,
    "topic": "minimum-cost-to-reach-destination-in-time",
    "difficulty": "hard"
  },
  {
    "id": 2041,
    "topic": "the-latest-login-in-2020",
    "difficulty": "easy"
  },
  {
    "id": 2042,
    "topic": "maximum-product-difference-between-two-pairs",
    "difficulty": "easy"
  },
  {
    "id": 2043,
    "topic": "cyclically-rotating-a-grid",
    "difficulty": "medium"
  },
  {
    "id": 2044,
    "topic": "number-of-wonderful-substrings",
    "difficulty": "medium"
  },
  {
    "id": 2045,
    "topic": "cutting-ribbons",
    "difficulty": "medium"
  },
  {
    "id": 2046,
    "topic": "page-recommendations-ii",
    "difficulty": "hard"
  },
  {
    "id": 2047,
    "topic": "find-a-peak-element-ii",
    "difficulty": "medium"
  },
  {
    "id": 2048,
    "topic": "build-array-from-permutation",
    "difficulty": "easy"
  },
  {
    "id": 2049,
    "topic": "eliminate-maximum-number-of-monsters",
    "difficulty": "medium"
  },
  {
    "id": 2050,
    "topic": "count-good-numbers",
    "difficulty": "medium"
  },
  {
    "id": 2051,
    "topic": "longest-common-subpath",
    "difficulty": "hard"
  },
  {
    "id": 2052,
    "topic": "depth-of-bst-given-insertion-order",
    "difficulty": "medium"
  },
  {
    "id": 2053,
    "topic": "check-if-all-characters-have-equal-number-of-occurrences",
    "difficulty": "easy"
  },
  {
    "id": 2054,
    "topic": "the-number-of-the-smallest-unoccupied-chair",
    "difficulty": "medium"
  },
  {
    "id": 2055,
    "topic": "describe-the-painting",
    "difficulty": "medium"
  },
  {
    "id": 2057,
    "topic": "count-salary-categories",
    "difficulty": "medium"
  },
  {
    "id": 2058,
    "topic": "concatenation-of-array",
    "difficulty": "easy"
  },
  {
    "id": 2059,
    "topic": "unique-length-3-palindromic-subsequences",
    "difficulty": "medium"
  },
  {
    "id": 2060,
    "topic": "merge-bsts-to-create-single-bst",
    "difficulty": "hard"
  },
  {
    "id": 2061,
    "topic": "painting-a-grid-with-three-different-colors",
    "difficulty": "hard"
  },
  {
    "id": 2062,
    "topic": "game-of-nim",
    "difficulty": "medium"
  },
  {
    "id": 2063,
    "topic": "leetcodify-friends-recommendations",
    "difficulty": "hard"
  },
  {
    "id": 2064,
    "topic": "leetcodify-similar-friends",
    "difficulty": "hard"
  },
  {
    "id": 2066,
    "topic": "add-minimum-number-of-rungs",
    "difficulty": "medium"
  },
  {
    "id": 2067,
    "topic": "maximum-number-of-points-with-cost",
    "difficulty": "medium"
  },
  {
    "id": 2068,
    "topic": "maximum-genetic-difference-query",
    "difficulty": "hard"
  },
  {
    "id": 2069,
    "topic": "kth-smallest-subarray-sum",
    "difficulty": "medium"
  },
  {
    "id": 2070,
    "topic": "check-if-string-is-decomposable-into-value-equal-substrings",
    "difficulty": "easy"
  },
  {
    "id": 2071,
    "topic": "longest-common-subsequence-between-sorted-arrays",
    "difficulty": "medium"
  },
  {
    "id": 2072,
    "topic": "maximum-of-minimum-values-in-all-subarrays",
    "difficulty": "medium"
  },
  {
    "id": 2073,
    "topic": "minimum-time-for-k-virus-variants-to-spread",
    "difficulty": "hard"
  },
  {
    "id": 2074,
    "topic": "erect-the-fence-ii",
    "difficulty": "hard"
  },
  {
    "id": 2075,
    "topic": "brightest-position-on-street",
    "difficulty": "medium"
  },
  {
    "id": 2076,
    "topic": "sum-of-digits-of-string-after-convert",
    "difficulty": "easy"
  },
  {
    "id": 2077,
    "topic": "largest-number-after-mutating-substring",
    "difficulty": "medium"
  },
  {
    "id": 2078,
    "topic": "maximum-compatibility-score-sum",
    "difficulty": "medium"
  },
  {
    "id": 2079,
    "topic": "delete-duplicate-folders-in-system",
    "difficulty": "hard"
  },
  {
    "id": 2080,
    "topic": "check-if-move-is-legal",
    "difficulty": "medium"
  },
  {
    "id": 2081,
    "topic": "minimum-total-space-wasted-with-k-resizing-operations",
    "difficulty": "medium"
  },
  {
    "id": 2082,
    "topic": "minimum-cost-to-separate-sentence-into-rows",
    "difficulty": "medium"
  },
  {
    "id": 2083,
    "topic": "three-divisors",
    "difficulty": "easy"
  },
  {
    "id": 2084,
    "topic": "maximum-number-of-weeks-for-which-you-can-work",
    "difficulty": "medium"
  },
  {
    "id": 2085,
    "topic": "array-with-elements-not-equal-to-average-of-neighbors",
    "difficulty": "medium"
  },
  {
    "id": 2086,
    "topic": "count-number-of-special-subsequences",
    "difficulty": "hard"
  },
  {
    "id": 2087,
    "topic": "confirmation-rate",
    "difficulty": "medium"
  },
  {
    "id": 2088,
    "topic": "minimum-time-to-type-word-using-special-typewriter",
    "difficulty": "easy"
  },
  {
    "id": 2089,
    "topic": "maximum-matrix-sum",
    "difficulty": "medium"
  },
  {
    "id": 2090,
    "topic": "number-of-ways-to-arrive-at-destination",
    "difficulty": "medium"
  },
  {
    "id": 2091,
    "topic": "number-of-ways-to-separate-numbers",
    "difficulty": "hard"
  },
  {
    "id": 2092,
    "topic": "users-that-actively-request-confirmation-messages",
    "difficulty": "easy"
  },
  {
    "id": 2093,
    "topic": "check-if-string-is-a-prefix-of-array",
    "difficulty": "easy"
  },
  {
    "id": 2094,
    "topic": "remove-stones-to-minimize-the-total",
    "difficulty": "medium"
  },
  {
    "id": 2095,
    "topic": "minimum-number-of-swaps-to-make-the-string-balanced",
    "difficulty": "medium"
  },
  {
    "id": 2096,
    "topic": "find-the-longest-valid-obstacle-course-at-each-position",
    "difficulty": "hard"
  },
  {
    "id": 2097,
    "topic": "strong-friendship",
    "difficulty": "medium"
  },
  {
    "id": 2098,
    "topic": "all-the-pairs-with-the-maximum-number-of-common-followers",
    "difficulty": "medium"
  },
  {
    "id": 2099,
    "topic": "number-of-strings-that-appear-as-substrings-in-word",
    "difficulty": "easy"
  },
  {
    "id": 2100,
    "topic": "minimum-non-zero-product-of-the-array-elements",
    "difficulty": "medium"
  },
  {
    "id": 2101,
    "topic": "last-day-where-you-can-still-cross",
    "difficulty": "hard"
  },
  {
    "id": 2102,
    "topic": "find-the-middle-index-in-array",
    "difficulty": "easy"
  },
  {
    "id": 2103,
    "topic": "find-all-groups-of-farmland",
    "difficulty": "medium"
  },
  {
    "id": 2104,
    "topic": "operations-on-tree",
    "difficulty": "medium"
  },
  {
    "id": 2105,
    "topic": "the-number-of-good-subsets",
    "difficulty": "hard"
  },
  {
    "id": 2106,
    "topic": "find-greatest-common-divisor-of-array",
    "difficulty": "easy"
  },
  {
    "id": 2107,
    "topic": "find-unique-binary-string",
    "difficulty": "medium"
  },
  {
    "id": 2108,
    "topic": "minimize-the-difference-between-target-and-chosen-elements",
    "difficulty": "medium"
  },
  {
    "id": 2109,
    "topic": "find-array-given-subset-sums",
    "difficulty": "hard"
  },
  {
    "id": 2110,
    "topic": "employees-with-missing-information",
    "difficulty": "easy"
  },
  {
    "id": 2111,
    "topic": "binary-searchable-numbers-in-an-unsorted-array",
    "difficulty": "medium"
  },
  {
    "id": 2112,
    "topic": "minimum-difference-between-highest-and-lowest-of-k-scores",
    "difficulty": "easy"
  },
  {
    "id": 2113,
    "topic": "find-the-kth-largest-integer-in-the-array",
    "difficulty": "medium"
  },
  {
    "id": 2114,
    "topic": "minimum-number-of-work-sessions-to-finish-the-tasks",
    "difficulty": "medium"
  },
  {
    "id": 2115,
    "topic": "number-of-unique-good-subsequences",
    "difficulty": "hard"
  },
  {
    "id": 2116,
    "topic": "count-number-of-pairs-with-absolute-difference-k",
    "difficulty": "easy"
  },
  {
    "id": 2117,
    "topic": "find-original-array-from-doubled-array",
    "difficulty": "medium"
  },
  {
    "id": 2118,
    "topic": "maximum-earnings-from-taxi",
    "difficulty": "medium"
  },
  {
    "id": 2119,
    "topic": "minimum-number-of-operations-to-make-array-continuous",
    "difficulty": "hard"
  },
  {
    "id": 2120,
    "topic": "first-and-last-call-on-the-same-day",
    "difficulty": "hard"
  },
  {
    "id": 2121,
    "topic": "find-if-path-exists-in-graph",
    "difficulty": "easy"
  },
  {
    "id": 2122,
    "topic": "count-special-quadruplets",
    "difficulty": "easy"
  },
  {
    "id": 2123,
    "topic": "the-number-of-weak-characters-in-the-game",
    "difficulty": "medium"
  },
  {
    "id": 2124,
    "topic": "first-day-where-you-have-been-in-all-the-rooms",
    "difficulty": "medium"
  },
  {
    "id": 2125,
    "topic": "gcd-sort-of-an-array",
    "difficulty": "hard"
  },
  {
    "id": 2126,
    "topic": "count-nodes-equal-to-sum-of-descendants",
    "difficulty": "medium"
  },
  {
    "id": 2127,
    "topic": "employees-whose-manager-left-the-company",
    "difficulty": "easy"
  },
  {
    "id": 2128,
    "topic": "reverse-prefix-of-word",
    "difficulty": "easy"
  },
  {
    "id": 2129,
    "topic": "number-of-pairs-of-interchangeable-rectangles",
    "difficulty": "medium"
  },
  {
    "id": 2130,
    "topic": "maximum-product-of-the-length-of-two-palindromic-subsequences",
    "difficulty": "medium"
  },
  {
    "id": 2131,
    "topic": "smallest-missing-genetic-value-in-each-subtree",
    "difficulty": "hard"
  },
  {
    "id": 2132,
    "topic": "convert-1d-array-into-2d-array",
    "difficulty": "easy"
  },
  {
    "id": 2133,
    "topic": "number-of-pairs-of-strings-with-concatenation-equal-to-target",
    "difficulty": "medium"
  },
  {
    "id": 2134,
    "topic": "maximize-the-confusion-of-an-exam",
    "difficulty": "medium"
  },
  {
    "id": 2135,
    "topic": "maximum-number-of-ways-to-partition-an-array",
    "difficulty": "hard"
  },
  {
    "id": 2136,
    "topic": "find-cutoff-score-for-each-school",
    "difficulty": "medium"
  },
  {
    "id": 2137,
    "topic": "final-value-of-variable-after-performing-operations",
    "difficulty": "easy"
  },
  {
    "id": 2138,
    "topic": "sum-of-beauty-in-the-array",
    "difficulty": "medium"
  },
  {
    "id": 2139,
    "topic": "detect-squares",
    "difficulty": "medium"
  },
  {
    "id": 2140,
    "topic": "longest-subsequence-repeated-k-times",
    "difficulty": "hard"
  },
  {
    "id": 2141,
    "topic": "smallest-greater-multiple-made-of-two-digits",
    "difficulty": "medium"
  },
  {
    "id": 2142,
    "topic": "average-height-of-buildings-in-each-segment",
    "difficulty": "medium"
  },
  {
    "id": 2143,
    "topic": "count-the-number-of-experiments",
    "difficulty": "medium"
  },
  {
    "id": 2144,
    "topic": "maximum-difference-between-increasing-elements",
    "difficulty": "easy"
  },
  {
    "id": 2145,
    "topic": "grid-game",
    "difficulty": "medium"
  },
  {
    "id": 2146,
    "topic": "check-if-word-can-be-placed-in-crossword",
    "difficulty": "medium"
  },
  {
    "id": 2147,
    "topic": "the-score-of-students-solving-math-expression",
    "difficulty": "hard"
  },
  {
    "id": 2148,
    "topic": "minimum-number-of-moves-to-seat-everyone",
    "difficulty": "easy"
  },
  {
    "id": 2149,
    "topic": "remove-colored-pieces-if-both-neighbors-are-the-same-color",
    "difficulty": "medium"
  },
  {
    "id": 2150,
    "topic": "kth-smallest-product-of-two-sorted-arrays",
    "difficulty": "hard"
  },
  {
    "id": 2151,
    "topic": "the-time-when-the-network-becomes-idle",
    "difficulty": "medium"
  },
  {
    "id": 2152,
    "topic": "the-number-of-seniors-and-juniors-to-join-the-company",
    "difficulty": "hard"
  },
  {
    "id": 2153,
    "topic": "subtree-removal-game-with-fibonacci-tree",
    "difficulty": "hard"
  },
  {
    "id": 2154,
    "topic": "minimum-moves-to-convert-string",
    "difficulty": "easy"
  },
  {
    "id": 2155,
    "topic": "find-missing-observations",
    "difficulty": "medium"
  },
  {
    "id": 2156,
    "topic": "stone-game-ix",
    "difficulty": "medium"
  },
  {
    "id": 2157,
    "topic": "smallest-k-length-subsequence-with-occurrences-of-a-letter",
    "difficulty": "hard"
  },
  {
    "id": 2158,
    "topic": "the-number-of-seniors-and-juniors-to-join-the-company-ii",
    "difficulty": "hard"
  },
  {
    "id": 2159,
    "topic": "two-out-of-three",
    "difficulty": "easy"
  },
  {
    "id": 2160,
    "topic": "minimum-operations-to-make-a-uni-value-grid",
    "difficulty": "medium"
  },
  {
    "id": 2161,
    "topic": "stock-price-fluctuation",
    "difficulty": "medium"
  },
  {
    "id": 2162,
    "topic": "partition-array-into-two-arrays-to-minimize-sum-difference",
    "difficulty": "hard"
  },
  {
    "id": 2163,
    "topic": "kth-distinct-string-in-an-array",
    "difficulty": "easy"
  },
  {
    "id": 2164,
    "topic": "two-best-non-overlapping-events",
    "difficulty": "medium"
  },
  {
    "id": 2165,
    "topic": "plates-between-candles",
    "difficulty": "medium"
  },
  {
    "id": 2166,
    "topic": "number-of-valid-move-combinations-on-chessboard",
    "difficulty": "hard"
  },
  {
    "id": 2167,
    "topic": "number-of-accounts-that-did-not-stream",
    "difficulty": "medium"
  },
  {
    "id": 2168,
    "topic": "check-if-numbers-are-ascending-in-a-sentence",
    "difficulty": "easy"
  },
  {
    "id": 2169,
    "topic": "simple-bank-system",
    "difficulty": "medium"
  },
  {
    "id": 2170,
    "topic": "count-number-of-maximum-bitwise-or-subsets",
    "difficulty": "medium"
  },
  {
    "id": 2171,
    "topic": "second-minimum-time-to-reach-destination",
    "difficulty": "hard"
  },
  {
    "id": 2172,
    "topic": "low-quality-problems",
    "difficulty": "easy"
  },
  {
    "id": 2173,
    "topic": "number-of-valid-words-in-a-sentence",
    "difficulty": "easy"
  },
  {
    "id": 2174,
    "topic": "next-greater-numerically-balanced-number",
    "difficulty": "medium"
  },
  {
    "id": 2175,
    "topic": "count-nodes-with-the-highest-score",
    "difficulty": "medium"
  },
  {
    "id": 2176,
    "topic": "parallel-courses-iii",
    "difficulty": "hard"
  },
  {
    "id": 2177,
    "topic": "check-whether-two-strings-are-almost-equivalent",
    "difficulty": "easy"
  },
  {
    "id": 2178,
    "topic": "walking-robot-simulation-ii",
    "difficulty": "medium"
  },
  {
    "id": 2179,
    "topic": "most-beautiful-item-for-each-query",
    "difficulty": "medium"
  },
  {
    "id": 2180,
    "topic": "maximum-number-of-tasks-you-can-assign",
    "difficulty": "hard"
  },
  {
    "id": 2181,
    "topic": "smallest-index-with-equal-value",
    "difficulty": "easy"
  },
  {
    "id": 2182,
    "topic": "find-the-minimum-and-maximum-number-of-nodes-between-critical-points",
    "difficulty": "medium"
  },
  {
    "id": 2183,
    "topic": "minimum-operations-to-convert-number",
    "difficulty": "medium"
  },
  {
    "id": 2184,
    "topic": "check-if-an-original-string-exists-given-two-encoded-strings",
    "difficulty": "hard"
  },
  {
    "id": 2185,
    "topic": "accepted-candidates-from-the-interviews",
    "difficulty": "medium"
  },
  {
    "id": 2186,
    "topic": "count-vowel-substrings-of-a-string",
    "difficulty": "easy"
  },
  {
    "id": 2187,
    "topic": "vowels-of-all-substrings",
    "difficulty": "medium"
  },
  {
    "id": 2188,
    "topic": "minimized-maximum-of-products-distributed-to-any-store",
    "difficulty": "medium"
  },
  {
    "id": 2189,
    "topic": "maximum-path-quality-of-a-graph",
    "difficulty": "hard"
  },
  {
    "id": 2190,
    "topic": "count-common-words-with-one-occurrence",
    "difficulty": "easy"
  },
  {
    "id": 2191,
    "topic": "minimum-number-of-buckets-required-to-collect-rainwater-from-houses",
    "difficulty": "medium"
  },
  {
    "id": 2192,
    "topic": "minimum-cost-homecoming-of-a-robot-in-a-grid",
    "difficulty": "medium"
  },
  {
    "id": 2193,
    "topic": "count-fertile-pyramids-in-a-land",
    "difficulty": "hard"
  },
  {
    "id": 2194,
    "topic": "the-category-of-each-member-in-the-store",
    "difficulty": "medium"
  },
  {
    "id": 2195,
    "topic": "time-needed-to-buy-tickets",
    "difficulty": "easy"
  },
  {
    "id": 2196,
    "topic": "reverse-nodes-in-even-length-groups",
    "difficulty": "medium"
  },
  {
    "id": 2197,
    "topic": "decode-the-slanted-ciphertext",
    "difficulty": "medium"
  },
  {
    "id": 2198,
    "topic": "process-restricted-friend-requests",
    "difficulty": "hard"
  },
  {
    "id": 2199,
    "topic": "two-furthest-houses-with-different-colors",
    "difficulty": "easy"
  },
  {
    "id": 2200,
    "topic": "stamping-the-grid",
    "difficulty": "hard"
  },
  {
    "id": 2201,
    "topic": "valid-arrangement-of-pairs",
    "difficulty": "hard"
  },
  {
    "id": 2202,
    "topic": "sum-of-k-mirror-numbers",
    "difficulty": "hard"
  },
  {
    "id": 2203,
    "topic": "number-of-spaces-cleaning-robot-cleaned",
    "difficulty": "medium"
  },
  {
    "id": 2204,
    "topic": "find-subsequence-of-length-k-with-the-largest-sum",
    "difficulty": "easy"
  },
  {
    "id": 2205,
    "topic": "find-good-days-to-rob-the-bank",
    "difficulty": "medium"
  },
  {
    "id": 2206,
    "topic": "detonate-the-maximum-bombs",
    "difficulty": "medium"
  },
  {
    "id": 2207,
    "topic": "sequentially-ordinal-rank-tracker",
    "difficulty": "hard"
  },
  {
    "id": 2208,
    "topic": "account-balance",
    "difficulty": "medium"
  },
  {
    "id": 2209,
    "topic": "number-of-equal-count-substrings",
    "difficulty": "medium"
  },
  {
    "id": 2210,
    "topic": "find-target-indices-after-sorting-array",
    "difficulty": "easy"
  },
  {
    "id": 2211,
    "topic": "k-radius-subarray-averages",
    "difficulty": "medium"
  },
  {
    "id": 2212,
    "topic": "removing-minimum-and-maximum-from-array",
    "difficulty": "medium"
  },
  {
    "id": 2213,
    "topic": "find-all-people-with-secret",
    "difficulty": "hard"
  },
  {
    "id": 2214,
    "topic": "the-winner-university",
    "difficulty": "easy"
  },
  {
    "id": 2215,
    "topic": "finding-3-digit-even-numbers",
    "difficulty": "easy"
  },
  {
    "id": 2216,
    "topic": "delete-the-middle-node-of-a-linked-list",
    "difficulty": "medium"
  },
  {
    "id": 2217,
    "topic": "step-by-step-directions-from-a-binary-tree-node-to-another",
    "difficulty": "medium"
  },
  {
    "id": 2218,
    "topic": "paths-in-maze-that-lead-to-same-room",
    "difficulty": "medium"
  },
  {
    "id": 2219,
    "topic": "maximum-number-of-words-found-in-sentences",
    "difficulty": "easy"
  },
  {
    "id": 2220,
    "topic": "find-all-possible-recipes-from-given-supplies",
    "difficulty": "medium"
  },
  {
    "id": 2221,
    "topic": "check-if-a-parentheses-string-can-be-valid",
    "difficulty": "medium"
  },
  {
    "id": 2222,
    "topic": "abbreviating-the-product-of-a-range",
    "difficulty": "hard"
  },
  {
    "id": 2223,
    "topic": "the-number-of-rich-customers",
    "difficulty": "easy"
  },
  {
    "id": 2224,
    "topic": "drop-type-1-orders-for-customers-with-type-0-orders",
    "difficulty": "medium"
  },
  {
    "id": 2225,
    "topic": "substrings-that-begin-and-end-with-the-same-letter",
    "difficulty": "medium"
  },
  {
    "id": 2226,
    "topic": "rings-and-rods",
    "difficulty": "easy"
  },
  {
    "id": 2227,
    "topic": "sum-of-subarray-ranges",
    "difficulty": "medium"
  },
  {
    "id": 2228,
    "topic": "watering-plants-ii",
    "difficulty": "medium"
  },
  {
    "id": 2229,
    "topic": "maximum-fruits-harvested-after-at-most-k-steps",
    "difficulty": "hard"
  },
  {
    "id": 2230,
    "topic": "minimum-cost-to-reach-city-with-discounts",
    "difficulty": "medium"
  },
  {
    "id": 2231,
    "topic": "find-first-palindromic-string-in-the-array",
    "difficulty": "easy"
  },
  {
    "id": 2232,
    "topic": "adding-spaces-to-a-string",
    "difficulty": "medium"
  },
  {
    "id": 2233,
    "topic": "number-of-smooth-descent-periods-of-a-stock",
    "difficulty": "medium"
  },
  {
    "id": 2234,
    "topic": "minimum-operations-to-make-the-array-k-increasing",
    "difficulty": "hard"
  },
  {
    "id": 2235,
    "topic": "capitalize-the-title",
    "difficulty": "easy"
  },
  {
    "id": 2236,
    "topic": "maximum-twin-sum-of-a-linked-list",
    "difficulty": "medium"
  },
  {
    "id": 2237,
    "topic": "longest-palindrome-by-concatenating-two-letter-words",
    "difficulty": "medium"
  },
  {
    "id": 2238,
    "topic": "a-number-after-a-double-reversal",
    "difficulty": "easy"
  },
  {
    "id": 2239,
    "topic": "execution-of-all-suffix-instructions-staying-in-a-grid",
    "difficulty": "medium"
  },
  {
    "id": 2240,
    "topic": "intervals-between-identical-elements",
    "difficulty": "medium"
  },
  {
    "id": 2241,
    "topic": "recover-the-original-array",
    "difficulty": "hard"
  },
  {
    "id": 2242,
    "topic": "subsequence-of-size-k-with-the-largest-even-sum",
    "difficulty": "medium"
  },
  {
    "id": 2243,
    "topic": "check-if-all-as-appears-before-all-bs",
    "difficulty": "easy"
  },
  {
    "id": 2244,
    "topic": "number-of-laser-beams-in-a-bank",
    "difficulty": "medium"
  },
  {
    "id": 2245,
    "topic": "destroying-asteroids",
    "difficulty": "medium"
  },
  {
    "id": 2246,
    "topic": "maximum-employees-to-be-invited-to-a-meeting",
    "difficulty": "hard"
  },
  {
    "id": 2247,
    "topic": "number-of-unique-flavors-after-sharing-k-candies",
    "difficulty": "medium"
  },
  {
    "id": 2248,
    "topic": "minimum-cost-of-buying-candies-with-discount",
    "difficulty": "easy"
  },
  {
    "id": 2249,
    "topic": "count-the-hidden-sequences",
    "difficulty": "medium"
  },
  {
    "id": 2250,
    "topic": "k-highest-ranked-items-within-a-price-range",
    "difficulty": "medium"
  },
  {
    "id": 2251,
    "topic": "number-of-ways-to-divide-a-long-corridor",
    "difficulty": "hard"
  },
  {
    "id": 2252,
    "topic": "the-airport-with-the-most-traffic",
    "difficulty": "medium"
  },
  {
    "id": 2253,
    "topic": "build-the-equation",
    "difficulty": "hard"
  },
  {
    "id": 2254,
    "topic": "check-if-every-row-and-column-contains-all-numbers",
    "difficulty": "easy"
  },
  {
    "id": 2255,
    "topic": "minimum-swaps-to-group-all-1s-together-ii",
    "difficulty": "medium"
  },
  {
    "id": 2256,
    "topic": "count-words-obtained-after-adding-a-letter",
    "difficulty": "medium"
  },
  {
    "id": 2257,
    "topic": "earliest-possible-day-of-full-bloom",
    "difficulty": "hard"
  },
  {
    "id": 2258,
    "topic": "elements-in-array-after-removing-and-replacing-elements",
    "difficulty": "medium"
  },
  {
    "id": 2259,
    "topic": "minimum-operations-to-remove-adjacent-ones-in-matrix",
    "difficulty": "hard"
  },
  {
    "id": 2260,
    "topic": "divide-a-string-into-groups-of-size-k",
    "difficulty": "easy"
  },
  {
    "id": 2261,
    "topic": "all-divisions-with-the-highest-score-of-a-binary-array",
    "difficulty": "medium"
  },
  {
    "id": 2262,
    "topic": "solving-questions-with-brainpower",
    "difficulty": "medium"
  },
  {
    "id": 2263,
    "topic": "maximum-running-time-of-n-computers",
    "difficulty": "hard"
  },
  {
    "id": 2264,
    "topic": "minimum-sum-of-four-digit-number-after-splitting-digits",
    "difficulty": "easy"
  },
  {
    "id": 2265,
    "topic": "partition-array-according-to-given-pivot",
    "difficulty": "medium"
  },
  {
    "id": 2266,
    "topic": "minimum-cost-to-set-cooking-time",
    "difficulty": "medium"
  },
  {
    "id": 2267,
    "topic": "minimum-difference-in-sums-after-removal-of-elements",
    "difficulty": "hard"
  },
  {
    "id": 2268,
    "topic": "remove-all-ones-with-row-and-column-flips",
    "difficulty": "medium"
  },
  {
    "id": 2269,
    "topic": "count-elements-with-strictly-smaller-and-greater-elements",
    "difficulty": "easy"
  },
  {
    "id": 2270,
    "topic": "find-all-lonely-numbers-in-the-array",
    "difficulty": "medium"
  },
  {
    "id": 2271,
    "topic": "rearrange-array-elements-by-sign",
    "difficulty": "medium"
  },
  {
    "id": 2272,
    "topic": "maximum-good-people-based-on-statements",
    "difficulty": "hard"
  },
  {
    "id": 2273,
    "topic": "pour-water-between-buckets-to-make-water-levels-equal",
    "difficulty": "medium"
  },
  {
    "id": 2274,
    "topic": "keep-multiplying-found-values-by-two",
    "difficulty": "easy"
  },
  {
    "id": 2275,
    "topic": "find-substring-with-given-hash-value",
    "difficulty": "hard"
  },
  {
    "id": 2276,
    "topic": "groups-of-strings",
    "difficulty": "hard"
  },
  {
    "id": 2281,
    "topic": "the-number-of-passengers-in-each-bus-i",
    "difficulty": "medium"
  },
  {
    "id": 2282,
    "topic": "choose-numbers-from-two-arrays-in-range",
    "difficulty": "hard"
  },
  {
    "id": 2283,
    "topic": "sort-even-and-odd-indices-independently",
    "difficulty": "easy"
  },
  {
    "id": 2284,
    "topic": "smallest-value-of-the-rearranged-number",
    "difficulty": "medium"
  },
  {
    "id": 2285,
    "topic": "design-bitset",
    "difficulty": "medium"
  },
  {
    "id": 2286,
    "topic": "minimum-time-to-remove-all-cars-containing-illegal-goods",
    "difficulty": "hard"
  },
  {
    "id": 2287,
    "topic": "minimum-number-of-lines-to-cover-points",
    "difficulty": "medium"
  },
  {
    "id": 2296,
    "topic": "the-number-of-passengers-in-each-bus-ii",
    "difficulty": "hard"
  },
  {
    "id": 2297,
    "topic": "amount-of-new-area-painted-each-day",
    "difficulty": "hard"
  },
  {
    "id": 2302,
    "topic": "order-two-columns-independently",
    "difficulty": "medium"
  }
]