problem_data.json

{
    "1": {
        "id": "1",
        "name": "Two Sum",
        "acceptance": "55.4",
        "difficulty": "Easy",
        "displayText": "1. Two Sum"
    },
    "2": {
        "id": "2",
        "name": "Add Two Numbers",
        "acceptance": "45.7",
        "difficulty": "Medium",
        "displayText": "2. Add Two Numbers"
    },
    "3": {
        "id": "3",
        "name": "Longest Substring Without Repeating Characters",
        "acceptance": "36.6",
        "difficulty": "Medium",
        "displayText": "3. Longest Substring Without Repeating Characters"
    },
    "4": {
        "id": "4",
        "name": "Median of Two Sorted Arrays",
        "acceptance": "43.3",
        "difficulty": "Hard",
        "displayText": "4. Median of Two Sorted Arrays"
    },
    "5": {
        "id": "5",
        "name": "Longest Palindromic Substring",
        "acceptance": "35.5",
        "difficulty": "Medium",
        "displayText": "5. Longest Palindromic Substring"
    },
    "6": {
        "id": "6",
        "name": "Zigzag Conversion",
        "acceptance": "51.1",
        "difficulty": "Medium",
        "displayText": "6. Zigzag Conversion"
    },
    "7": {
        "id": "7",
        "name": "Reverse Integer",
        "acceptance": "30.0",
        "difficulty": "Medium",
        "displayText": "7. Reverse Integer"
    },
    "8": {
        "id": "8",
        "name": "String to Integer (atoi)",
        "acceptance": "18.9",
        "difficulty": "Medium",
        "displayText": "8. String to Integer (atoi)"
    },
    "9": {
        "id": "9",
        "name": "Palindrome Number",
        "acceptance": "58.9",
        "difficulty": "Easy",
        "displayText": "9. Palindrome Number"
    },
    "10": {
        "id": "10",
        "name": "Regular Expression Matching",
        "acceptance": "29.1",
        "difficulty": "Hard",
        "displayText": "10. Regular Expression Matching"
    },
    "11": {
        "id": "11",
        "name": "Container With Most Water",
        "acceptance": "57.4",
        "difficulty": "Medium",
        "displayText": "11. Container With Most Water"
    },
    "12": {
        "id": "12",
        "name": "Integer to Roman",
        "acceptance": "68.1",
        "difficulty": "Medium",
        "displayText": "12. Integer to Roman"
    },
    "13": {
        "id": "13",
        "name": "Roman to Integer",
        "acceptance": "64.4",
        "difficulty": "Easy",
        "displayText": "13. Roman to Integer"
    },
    "14": {
        "id": "14",
        "name": "Longest Common Prefix",
        "acceptance": "45.1",
        "difficulty": "Easy",
        "displayText": "14. Longest Common Prefix"
    },
    "15": {
        "id": "15",
        "name": "3Sum",
        "acceptance": "36.7",
        "difficulty": "Medium",
        "displayText": "15. 3Sum"
    },
    "16": {
        "id": "16",
        "name": "3Sum Closest",
        "acceptance": "46.7",
        "difficulty": "Medium",
        "displayText": "16. 3Sum Closest"
    },
    "17": {
        "id": "17",
        "name": "Letter Combinations of a Phone Number",
        "acceptance": "63.4",
        "difficulty": "Medium",
        "displayText": "17. Letter Combinations of a Phone Number"
    },
    "18": {
        "id": "18",
        "name": "4Sum",
        "acceptance": "37.8",
        "difficulty": "Medium",
        "displayText": "18. 4Sum"
    },
    "19": {
        "id": "19",
        "name": "Remove Nth Node From End of List",
        "acceptance": "48.4",
        "difficulty": "Medium",
        "displayText": "19. Remove Nth Node From End of List"
    },
    "20": {
        "id": "20",
        "name": "Valid Parentheses",
        "acceptance": "42.0",
        "difficulty": "Easy",
        "displayText": "20. Valid Parentheses"
    },
    "21": {
        "id": "21",
        "name": "Merge Two Sorted Lists",
        "acceptance": "66.5",
        "difficulty": "Easy",
        "displayText": "21. Merge Two Sorted Lists"
    },
    "22": {
        "id": "22",
        "name": "Generate Parentheses",
        "acceptance": "76.8",
        "difficulty": "Medium",
        "displayText": "22. Generate Parentheses"
    },
    "23": {
        "id": "23",
        "name": "Merge k Sorted Lists",
        "acceptance": "56.2",
        "difficulty": "Hard",
        "displayText": "23. Merge k Sorted Lists"
    },
    "24": {
        "id": "24",
        "name": "Swap Nodes in Pairs",
        "acceptance": "66.8",
        "difficulty": "Medium",
        "displayText": "24. Swap Nodes in Pairs"
    },
    "25": {
        "id": "25",
        "name": "Reverse Nodes in k-Group",
        "acceptance": "62.4",
        "difficulty": "Hard",
        "displayText": "25. Reverse Nodes in k-Group"
    },
    "26": {
        "id": "26",
        "name": "Remove Duplicates from Sorted Array",
        "acceptance": "59.8",
        "difficulty": "Easy",
        "displayText": "26. Remove Duplicates from Sorted Array"
    },
    "27": {
        "id": "27",
        "name": "Remove Element",
        "acceptance": "59.7",
        "difficulty": "Easy",
        "displayText": "27. Remove Element"
    },
    "28": {
        "id": "28",
        "name": "Find the Index of the First Occurrence in a String",
        "acceptance": "44.7",
        "difficulty": "Easy",
        "displayText": "28. Find the Index of the First Occurrence in a String"
    },
    "29": {
        "id": "29",
        "name": "Divide Two Integers",
        "acceptance": "18.2",
        "difficulty": "Medium",
        "displayText": "29. Divide Two Integers"
    },
    "30": {
        "id": "30",
        "name": "Substring with Concatenation of All Words",
        "acceptance": "32.9",
        "difficulty": "Hard",
        "displayText": "30. Substring with Concatenation of All Words"
    },
    "31": {
        "id": "31",
        "name": "Next Permutation",
        "acceptance": "42.6",
        "difficulty": "Medium",
        "displayText": "31. Next Permutation"
    },
    "32": {
        "id": "32",
        "name": "Longest Valid Parentheses",
        "acceptance": "35.9",
        "difficulty": "Hard",
        "displayText": "32. Longest Valid Parentheses"
    },
    "33": {
        "id": "33",
        "name": "Search in Rotated Sorted Array",
        "acceptance": "42.5",
        "difficulty": "Medium",
        "displayText": "33. Search in Rotated Sorted Array"
    },
    "34": {
        "id": "34",
        "name": "Find First and Last Position of Element in Sorted Array",
        "acceptance": "46.4",
        "difficulty": "Medium",
        "displayText": "34. Find First and Last Position of Element in Sorted Array"
    },
    "35": {
        "id": "35",
        "name": "Search Insert Position",
        "acceptance": "48.6",
        "difficulty": "Easy",
        "displayText": "35. Search Insert Position"
    },
    "36": {
        "id": "36",
        "name": "Valid Sudoku",
        "acceptance": "61.9",
        "difficulty": "Medium",
        "displayText": "36. Valid Sudoku"
    },
    "37": {
        "id": "37",
        "name": "Sudoku Solver",
        "acceptance": "63.7",
        "difficulty": "Hard",
        "displayText": "37. Sudoku Solver"
    },
    "38": {
        "id": "38",
        "name": "Count and Say",
        "acceptance": "58.2",
        "difficulty": "Medium",
        "displayText": "38. Count and Say"
    },
    "39": {
        "id": "39",
        "name": "Combination Sum",
        "acceptance": "74.2",
        "difficulty": "Medium",
        "displayText": "39. Combination Sum"
    },
    "40": {
        "id": "40",
        "name": "Combination Sum II",
        "acceptance": "57.4",
        "difficulty": "Medium",
        "displayText": "40. Combination Sum II"
    },
    "41": {
        "id": "41",
        "name": "First Missing Positive",
        "acceptance": "40.8",
        "difficulty": "Hard",
        "displayText": "41. First Missing Positive"
    },
    "42": {
        "id": "42",
        "name": "Trapping Rain Water",
        "acceptance": "64.6",
        "difficulty": "Hard",
        "displayText": "42. Trapping Rain Water"
    },
    "43": {
        "id": "43",
        "name": "Multiply Strings",
        "acceptance": "42.0",
        "difficulty": "Medium",
        "displayText": "43. Multiply Strings"
    },
    "44": {
        "id": "44",
        "name": "Wildcard Matching",
        "acceptance": "29.6",
        "difficulty": "Hard",
        "displayText": "44. Wildcard Matching"
    },
    "45": {
        "id": "45",
        "name": "Jump Game II",
        "acceptance": "41.3",
        "difficulty": "Medium",
        "displayText": "45. Jump Game II"
    },
    "46": {
        "id": "46",
        "name": "Permutations",
        "acceptance": "80.4",
        "difficulty": "Medium",
        "displayText": "46. Permutations"
    },
    "47": {
        "id": "47",
        "name": "Permutations II",
        "acceptance": "61.2",
        "difficulty": "Medium",
        "displayText": "47. Permutations II"
    },
    "48": {
        "id": "48",
        "name": "Rotate Image",
        "acceptance": "77.5",
        "difficulty": "Medium",
        "displayText": "48. Rotate Image"
    },
    "49": {
        "id": "49",
        "name": "Group Anagrams",
        "acceptance": "70.6",
        "difficulty": "Medium",
        "displayText": "49. Group Anagrams"
    },
    "50": {
        "id": "50",
        "name": "Pow(x, n)",
        "acceptance": "36.7",
        "difficulty": "Medium",
        "displayText": "50. Pow(x, n)"
    },
    "51": {
        "id": "51",
        "name": "N-Queens",
        "acceptance": "72.1",
        "difficulty": "Hard",
        "displayText": "51. N-Queens"
    },
    "52": {
        "id": "52",
        "name": "N-Queens II",
        "acceptance": "76.3",
        "difficulty": "Hard",
        "displayText": "52. N-Queens II"
    },
    "53": {
        "id": "53",
        "name": "Maximum Subarray",
        "acceptance": "51.9",
        "difficulty": "Medium",
        "displayText": "53. Maximum Subarray"
    },
    "54": {
        "id": "54",
        "name": "Spiral Matrix",
        "acceptance": "53.3",
        "difficulty": "Medium",
        "displayText": "54. Spiral Matrix"
    },
    "55": {
        "id": "55",
        "name": "Jump Game",
        "acceptance": "39.2",
        "difficulty": "Medium",
        "displayText": "55. Jump Game"
    },
    "56": {
        "id": "56",
        "name": "Merge Intervals",
        "acceptance": "49.1",
        "difficulty": "Medium",
        "displayText": "56. Merge Intervals"
    },
    "57": {
        "id": "57",
        "name": "Insert Interval",
        "acceptance": "43.2",
        "difficulty": "Medium",
        "displayText": "57. Insert Interval"
    },
    "58": {
        "id": "58",
        "name": "Length of Last Word",
        "acceptance": "55.8",
        "difficulty": "Easy",
        "displayText": "58. Length of Last Word"
    },
    "59": {
        "id": "59",
        "name": "Spiral Matrix II",
        "acceptance": "73.2",
        "difficulty": "Medium",
        "displayText": "59. Spiral Matrix II"
    },
    "60": {
        "id": "60",
        "name": "Permutation Sequence",
        "acceptance": "49.5",
        "difficulty": "Hard",
        "displayText": "60. Permutation Sequence"
    },
    "61": {
        "id": "61",
        "name": "Rotate List",
        "acceptance": "39.6",
        "difficulty": "Medium",
        "displayText": "61. Rotate List"
    },
    "62": {
        "id": "62",
        "name": "Unique Paths",
        "acceptance": "65.6",
        "difficulty": "Medium",
        "displayText": "62. Unique Paths"
    },
    "63": {
        "id": "63",
        "name": "Unique Paths II",
        "acceptance": "42.9",
        "difficulty": "Medium",
        "displayText": "63. Unique Paths II"
    },
    "64": {
        "id": "64",
        "name": "Minimum Path Sum",
        "acceptance": "66.1",
        "difficulty": "Medium",
        "displayText": "64. Minimum Path Sum"
    },
    "65": {
        "id": "65",
        "name": "Valid Number",
        "acceptance": "21.3",
        "difficulty": "Hard",
        "displayText": "65. Valid Number"
    },
    "66": {
        "id": "66",
        "name": "Plus One",
        "acceptance": "47.3",
        "difficulty": "Easy",
        "displayText": "66. Plus One"
    },
    "67": {
        "id": "67",
        "name": "Add Binary",
        "acceptance": "55.4",
        "difficulty": "Easy",
        "displayText": "67. Add Binary"
    },
    "68": {
        "id": "68",
        "name": "Text Justification",
        "acceptance": "47.5",
        "difficulty": "Hard",
        "displayText": "68. Text Justification"
    },
    "69": {
        "id": "69",
        "name": "Sqrt(x)",
        "acceptance": "40.2",
        "difficulty": "Easy",
        "displayText": "69. Sqrt(x)"
    },
    "70": {
        "id": "70",
        "name": "Climbing Stairs",
        "acceptance": "53.4",
        "difficulty": "Easy",
        "displayText": "70. Climbing Stairs"
    },
    "71": {
        "id": "71",
        "name": "Simplify Path",
        "acceptance": "47.1",
        "difficulty": "Medium",
        "displayText": "71. Simplify Path"
    },
    "72": {
        "id": "72",
        "name": "Edit Distance",
        "acceptance": "58.4",
        "difficulty": "Medium",
        "displayText": "72. Edit Distance"
    },
    "73": {
        "id": "73",
        "name": "Set Matrix Zeroes",
        "acceptance": "59.3",
        "difficulty": "Medium",
        "displayText": "73. Set Matrix Zeroes"
    },
    "74": {
        "id": "74",
        "name": "Search a 2D Matrix",
        "acceptance": "52.0",
        "difficulty": "Medium",
        "displayText": "74. Search a 2D Matrix"
    },
    "75": {
        "id": "75",
        "name": "Sort Colors",
        "acceptance": "66.7",
        "difficulty": "Medium",
        "displayText": "75. Sort Colors"
    },
    "76": {
        "id": "76",
        "name": "Minimum Window Substring",
        "acceptance": "44.9",
        "difficulty": "Hard",
        "displayText": "76. Minimum Window Substring"
    },
    "77": {
        "id": "77",
        "name": "Combinations",
        "acceptance": "72.5",
        "difficulty": "Medium",
        "displayText": "77. Combinations"
    },
    "78": {
        "id": "78",
        "name": "Subsets",
        "acceptance": "80.5",
        "difficulty": "Medium",
        "displayText": "78. Subsets"
    },
    "79": {
        "id": "79",
        "name": "Word Search",
        "acceptance": "44.9",
        "difficulty": "Medium",
        "displayText": "79. Word Search"
    },
    "80": {
        "id": "80",
        "name": "Remove Duplicates from Sorted Array II",
        "acceptance": "62.5",
        "difficulty": "Medium",
        "displayText": "80. Remove Duplicates from Sorted Array II"
    },
    "81": {
        "id": "81",
        "name": "Search in Rotated Sorted Array II",
        "acceptance": "38.7",
        "difficulty": "Medium",
        "displayText": "81. Search in Rotated Sorted Array II"
    },
    "82": {
        "id": "82",
        "name": "Remove Duplicates from Sorted List II",
        "acceptance": "49.5",
        "difficulty": "Medium",
        "displayText": "82. Remove Duplicates from Sorted List II"
    },
    "83": {
        "id": "83",
        "name": "Remove Duplicates from Sorted List",
        "acceptance": "54.6",
        "difficulty": "Easy",
        "displayText": "83. Remove Duplicates from Sorted List"
    },
    "84": {
        "id": "84",
        "name": "Largest Rectangle in Histogram",
        "acceptance": "46.9",
        "difficulty": "Hard",
        "displayText": "84. Largest Rectangle in Histogram"
    },
    "85": {
        "id": "85",
        "name": "Maximal Rectangle",
        "acceptance": "53.2",
        "difficulty": "Hard",
        "displayText": "85. Maximal Rectangle"
    },
    "86": {
        "id": "86",
        "name": "Partition List",
        "acceptance": "58.6",
        "difficulty": "Medium",
        "displayText": "86. Partition List"
    },
    "87": {
        "id": "87",
        "name": "Scramble String",
        "acceptance": "41.9",
        "difficulty": "Hard",
        "displayText": "87. Scramble String"
    },
    "88": {
        "id": "88",
        "name": "Merge Sorted Array",
        "acceptance": "52.5",
        "difficulty": "Easy",
        "displayText": "88. Merge Sorted Array"
    },
    "89": {
        "id": "89",
        "name": "Gray Code",
        "acceptance": "61.4",
        "difficulty": "Medium",
        "displayText": "89. Gray Code"
    },
    "90": {
        "id": "90",
        "name": "Subsets II",
        "acceptance": "59.1",
        "difficulty": "Medium",
        "displayText": "90. Subsets II"
    },
    "91": {
        "id": "91",
        "name": "Decode Ways",
        "acceptance": "36.3",
        "difficulty": "Medium",
        "displayText": "91. Decode Ways"
    },
    "92": {
        "id": "92",
        "name": "Reverse Linked List II",
        "acceptance": "49.3",
        "difficulty": "Medium",
        "displayText": "92. Reverse Linked List II"
    },
    "93": {
        "id": "93",
        "name": "Restore IP Addresses",
        "acceptance": "52.7",
        "difficulty": "Medium",
        "displayText": "93. Restore IP Addresses"
    },
    "94": {
        "id": "94",
        "name": "Binary Tree Inorder Traversal",
        "acceptance": "78.2",
        "difficulty": "Easy",
        "displayText": "94. Binary Tree Inorder Traversal"
    },
    "95": {
        "id": "95",
        "name": "Unique Binary Search Trees II",
        "acceptance": "60.0",
        "difficulty": "Medium",
        "displayText": "95. Unique Binary Search Trees II"
    },
    "96": {
        "id": "96",
        "name": "Unique Binary Search Trees",
        "acceptance": "62.2",
        "difficulty": "Medium",
        "displayText": "96. Unique Binary Search Trees"
    },
    "97": {
        "id": "97",
        "name": "Interleaving String",
        "acceptance": "41.6",
        "difficulty": "Medium",
        "displayText": "97. Interleaving String"
    },
    "98": {
        "id": "98",
        "name": "Validate Binary Search Tree",
        "acceptance": "34.1",
        "difficulty": "Medium",
        "displayText": "98. Validate Binary Search Tree"
    },
    "99": {
        "id": "99",
        "name": "Recover Binary Search Tree",
        "acceptance": "55.8",
        "difficulty": "Medium",
        "displayText": "99. Recover Binary Search Tree"
    },
    "100": {
        "id": "100",
        "name": "Same Tree",
        "acceptance": "64.7",
        "difficulty": "Easy",
        "displayText": "100. Same Tree"
    },
    "101": {
        "id": "101",
        "name": "Symmetric Tree",
        "acceptance": "58.9",
        "difficulty": "Easy",
        "displayText": "101. Symmetric Tree"
    },
    "102": {
        "id": "102",
        "name": "Binary Tree Level Order Traversal",
        "acceptance": "70.1",
        "difficulty": "Medium",
        "displayText": "102. Binary Tree Level Order Traversal"
    },
    "103": {
        "id": "103",
        "name": "Binary Tree Zigzag Level Order Traversal",
        "acceptance": "61.3",
        "difficulty": "Medium",
        "displayText": "103. Binary Tree Zigzag Level Order Traversal"
    },
    "104": {
        "id": "104",
        "name": "Maximum Depth of Binary Tree",
        "acceptance": "76.9",
        "difficulty": "Easy",
        "displayText": "104. Maximum Depth of Binary Tree"
    },
    "105": {
        "id": "105",
        "name": "Construct Binary Tree from Preorder and Inorder Traversal",
        "acceptance": "66.4",
        "difficulty": "Medium",
        "displayText": "105. Construct Binary Tree from Preorder and Inorder Traversal"
    },
    "106": {
        "id": "106",
        "name": "Construct Binary Tree from Inorder and Postorder Traversal",
        "acceptance": "65.9",
        "difficulty": "Medium",
        "displayText": "106. Construct Binary Tree from Inorder and Postorder Traversal"
    },
    "107": {
        "id": "107",
        "name": "Binary Tree Level Order Traversal II",
        "acceptance": "65.6",
        "difficulty": "Medium",
        "displayText": "107. Binary Tree Level Order Traversal II"
    },
    "108": {
        "id": "108",
        "name": "Convert Sorted Array to Binary Search Tree",
        "acceptance": "73.8",
        "difficulty": "Easy",
        "displayText": "108. Convert Sorted Array to Binary Search Tree"
    },
    "109": {
        "id": "109",
        "name": "Convert Sorted List to Binary Search Tree",
        "acceptance": "64.1",
        "difficulty": "Medium",
        "displayText": "109. Convert Sorted List to Binary Search Tree"
    },
    "110": {
        "id": "110",
        "name": "Balanced Binary Tree",
        "acceptance": "54.9",
        "difficulty": "Easy",
        "displayText": "110. Balanced Binary Tree"
    },
    "111": {
        "id": "111",
        "name": "Minimum Depth of Binary Tree",
        "acceptance": "50.3",
        "difficulty": "Easy",
        "displayText": "111. Minimum Depth of Binary Tree"
    },
    "112": {
        "id": "112",
        "name": "Path Sum",
        "acceptance": "52.6",
        "difficulty": "Easy",
        "displayText": "112. Path Sum"
    },
    "113": {
        "id": "113",
        "name": "Path Sum II",
        "acceptance": "60.2",
        "difficulty": "Medium",
        "displayText": "113. Path Sum II"
    },
    "114": {
        "id": "114",
        "name": "Flatten Binary Tree to Linked List",
        "acceptance": "68.0",
        "difficulty": "Medium",
        "displayText": "114. Flatten Binary Tree to Linked List"
    },
    "115": {
        "id": "115",
        "name": "Distinct Subsequences",
        "acceptance": "49.7",
        "difficulty": "Hard",
        "displayText": "115. Distinct Subsequences"
    },
    "116": {
        "id": "116",
        "name": "Populating Next Right Pointers in Each Node",
        "acceptance": "65.1",
        "difficulty": "Medium",
        "displayText": "116. Populating Next Right Pointers in Each Node"
    },
    "117": {
        "id": "117",
        "name": "Populating Next Right Pointers in Each Node II",
        "acceptance": "55.2",
        "difficulty": "Medium",
        "displayText": "117. Populating Next Right Pointers in Each Node II"
    },
    "118": {
        "id": "118",
        "name": "Pascal's Triangle",
        "acceptance": "76.7",
        "difficulty": "Easy",
        "displayText": "118. Pascal's Triangle"
    },
    "119": {
        "id": "119",
        "name": "Pascal's Triangle II",
        "acceptance": "65.7",
        "difficulty": "Easy",
        "displayText": "119. Pascal's Triangle II"
    },
    "120": {
        "id": "120",
        "name": "Triangle",
        "acceptance": "58.9",
        "difficulty": "Medium",
        "displayText": "120. Triangle"
    },
    "121": {
        "id": "121",
        "name": "Best Time to Buy and Sell Stock",
        "acceptance": "54.9",
        "difficulty": "Easy",
        "displayText": "121. Best Time to Buy and Sell Stock"
    },
    "122": {
        "id": "122",
        "name": "Best Time to Buy and Sell Stock II",
        "acceptance": "69.1",
        "difficulty": "Medium",
        "displayText": "122. Best Time to Buy and Sell Stock II"
    },
    "123": {
        "id": "123",
        "name": "Best Time to Buy and Sell Stock III",
        "acceptance": "50.5",
        "difficulty": "Hard",
        "displayText": "123. Best Time to Buy and Sell Stock III"
    },
    "124": {
        "id": "124",
        "name": "Binary Tree Maximum Path Sum",
        "acceptance": "41.0",
        "difficulty": "Hard",
        "displayText": "124. Binary Tree Maximum Path Sum"
    },
    "125": {
        "id": "125",
        "name": "Valid Palindrome",
        "acceptance": "50.5",
        "difficulty": "Easy",
        "displayText": "125. Valid Palindrome"
    },
    "126": {
        "id": "126",
        "name": "Word Ladder II",
        "acceptance": "27.1",
        "difficulty": "Hard",
        "displayText": "126. Word Ladder II"
    },
    "127": {
        "id": "127",
        "name": "Word Ladder",
        "acceptance": "42.2",
        "difficulty": "Hard",
        "displayText": "127. Word Ladder"
    },
    "128": {
        "id": "128",
        "name": "Longest Consecutive Sequence",
        "acceptance": "47.1",
        "difficulty": "Medium",
        "displayText": "128. Longest Consecutive Sequence"
    },
    "129": {
        "id": "129",
        "name": "Sum Root to Leaf Numbers",
        "acceptance": "68.2",
        "difficulty": "Medium",
        "displayText": "129. Sum Root to Leaf Numbers"
    },
    "130": {
        "id": "130",
        "name": "Surrounded Regions",
        "acceptance": "42.4",
        "difficulty": "Medium",
        "displayText": "130. Surrounded Regions"
    },
    "131": {
        "id": "131",
        "name": "Palindrome Partitioning",
        "acceptance": "71.7",
        "difficulty": "Medium",
        "displayText": "131. Palindrome Partitioning"
    },
    "132": {
        "id": "132",
        "name": "Palindrome Partitioning II",
        "acceptance": "35.0",
        "difficulty": "Hard",
        "displayText": "132. Palindrome Partitioning II"
    },
    "133": {
        "id": "133",
        "name": "Clone Graph",
        "acceptance": "61.7",
        "difficulty": "Medium",
        "displayText": "133. Clone Graph"
    },
    "134": {
        "id": "134",
        "name": "Gas Station",
        "acceptance": "46.1",
        "difficulty": "Medium",
        "displayText": "134. Gas Station"
    },
    "135": {
        "id": "135",
        "name": "Candy",
        "acceptance": "44.5",
        "difficulty": "Hard",
        "displayText": "135. Candy"
    },
    "136": {
        "id": "136",
        "name": "Single Number",
        "acceptance": "75.6",
        "difficulty": "Easy",
        "displayText": "136. Single Number"
    },
    "137": {
        "id": "137",
        "name": "Single Number II",
        "acceptance": "64.9",
        "difficulty": "Medium",
        "displayText": "137. Single Number II"
    },
    "138": {
        "id": "138",
        "name": "Copy List with Random Pointer",
        "acceptance": "59.9",
        "difficulty": "Medium",
        "displayText": "138. Copy List with Random Pointer"
    },
    "139": {
        "id": "139",
        "name": "Word Break",
        "acceptance": "48.0",
        "difficulty": "Medium",
        "displayText": "139. Word Break"
    },
    "140": {
        "id": "140",
        "name": "Word Break II",
        "acceptance": "53.2",
        "difficulty": "Hard",
        "displayText": "140. Word Break II"
    },
    "141": {
        "id": "141",
        "name": "Linked List Cycle",
        "acceptance": "52.2",
        "difficulty": "Easy",
        "displayText": "141. Linked List Cycle"
    },
    "142": {
        "id": "142",
        "name": "Linked List Cycle II",
        "acceptance": "54.3",
        "difficulty": "Medium",
        "displayText": "142. Linked List Cycle II"
    },
    "143": {
        "id": "143",
        "name": "Reorder List",
        "acceptance": "61.9",
        "difficulty": "Medium",
        "displayText": "143. Reorder List"
    },
    "144": {
        "id": "144",
        "name": "Binary Tree Preorder Traversal",
        "acceptance": "72.7",
        "difficulty": "Easy",
        "displayText": "144. Binary Tree Preorder Traversal"
    },
    "145": {
        "id": "145",
        "name": "Binary Tree Postorder Traversal",
        "acceptance": "75.2",
        "difficulty": "Easy",
        "displayText": "145. Binary Tree Postorder Traversal"
    },
    "146": {
        "id": "146",
        "name": "LRU Cache",
        "acceptance": "44.7",
        "difficulty": "Medium",
        "displayText": "146. LRU Cache"
    },
    "147": {
        "id": "147",
        "name": "Insertion Sort List",
        "acceptance": "56.0",
        "difficulty": "Medium",
        "displayText": "147. Insertion Sort List"
    },
    "148": {
        "id": "148",
        "name": "Sort List",
        "acceptance": "61.2",
        "difficulty": "Medium",
        "displayText": "148. Sort List"
    },
    "149": {
        "id": "149",
        "name": "Max Points on a Line",
        "acceptance": "28.6",
        "difficulty": "Hard",
        "displayText": "149. Max Points on a Line"
    },
    "150": {
        "id": "150",
        "name": "Evaluate Reverse Polish Notation",
        "acceptance": "54.4",
        "difficulty": "Medium",
        "displayText": "150. Evaluate Reverse Polish Notation"
    },
    "151": {
        "id": "151",
        "name": "Reverse Words in a String",
        "acceptance": "50.9",
        "difficulty": "Medium",
        "displayText": "151. Reverse Words in a String"
    },
    "152": {
        "id": "152",
        "name": "Maximum Product Subarray",
        "acceptance": "34.7",
        "difficulty": "Medium",
        "displayText": "152. Maximum Product Subarray"
    },
    "153": {
        "id": "153",
        "name": "Find Minimum in Rotated Sorted Array",
        "acceptance": "52.3",
        "difficulty": "Medium",
        "displayText": "153. Find Minimum in Rotated Sorted Array"
    },
    "154": {
        "id": "154",
        "name": "Find Minimum in Rotated Sorted Array II",
        "acceptance": "44.0",
        "difficulty": "Hard",
        "displayText": "154. Find Minimum in Rotated Sorted Array II"
    },
    "155": {
        "id": "155",
        "name": "Min Stack",
        "acceptance": "56.1",
        "difficulty": "Medium",
        "displayText": "155. Min Stack"
    },
    "156": {
        "id": "156",
        "name": "Binary Tree Upside Down",
        "acceptance": "64.3",
        "difficulty": "Medium",
        "displayText": "156. Binary Tree Upside Down"
    },
    "157": {
        "id": "157",
        "name": "Read N Characters Given Read4",
        "acceptance": "42.1",
        "difficulty": "Easy",
        "displayText": "157. Read N Characters Given Read4"
    },
    "158": {
        "id": "158",
        "name": "Read N Characters Given read4 II - Call Multiple Times",
        "acceptance": "42.8",
        "difficulty": "Hard",
        "displayText": "158. Read N Characters Given read4 II - Call Multiple Times"
    },
    "159": {
        "id": "159",
        "name": "Longest Substring with At Most Two Distinct Characters",
        "acceptance": "56.2",
        "difficulty": "Medium",
        "displayText": "159. Longest Substring with At Most Two Distinct Characters"
    },
    "160": {
        "id": "160",
        "name": "Intersection of Two Linked Lists",
        "acceptance": "60.6",
        "difficulty": "Easy",
        "displayText": "160. Intersection of Two Linked Lists"
    },
    "161": {
        "id": "161",
        "name": "One Edit Distance",
        "acceptance": "34.5",
        "difficulty": "Medium",
        "displayText": "161. One Edit Distance"
    },
    "162": {
        "id": "162",
        "name": "Find Peak Element",
        "acceptance": "46.4",
        "difficulty": "Medium",
        "displayText": "162. Find Peak Element"
    },
    "163": {
        "id": "163",
        "name": "Missing Ranges",
        "acceptance": "35.1",
        "difficulty": "Easy",
        "displayText": "163. Missing Ranges"
    },
    "164": {
        "id": "164",
        "name": "Maximum Gap",
        "acceptance": "48.9",
        "difficulty": "Medium",
        "displayText": "164. Maximum Gap"
    },
    "165": {
        "id": "165",
        "name": "Compare Version Numbers",
        "acceptance": "42.1",
        "difficulty": "Medium",
        "displayText": "165. Compare Version Numbers"
    },
    "166": {
        "id": "166",
        "name": "Fraction to Recurring Decimal",
        "acceptance": "26.0",
        "difficulty": "Medium",
        "displayText": "166. Fraction to Recurring Decimal"
    },
    "167": {
        "id": "167",
        "name": "Two Sum II - Input Array Is Sorted",
        "acceptance": "63.1",
        "difficulty": "Medium",
        "displayText": "167. Two Sum II - Input Array Is Sorted"
    },
    "168": {
        "id": "168",
        "name": "Excel Sheet Column Title",
        "acceptance": "43.1",
        "difficulty": "Easy",
        "displayText": "168. Excel Sheet Column Title"
    },
    "169": {
        "id": "169",
        "name": "Majority Element",
        "acceptance": "65.6",
        "difficulty": "Easy",
        "displayText": "169. Majority Element"
    },
    "170": {
        "id": "170",
        "name": "Two Sum III - Data structure design",
        "acceptance": "38.6",
        "difficulty": "Easy",
        "displayText": "170. Two Sum III - Data structure design"
    },
    "171": {
        "id": "171",
        "name": "Excel Sheet Column Number",
        "acceptance": "65.4",
        "difficulty": "Easy",
        "displayText": "171. Excel Sheet Column Number"
    },
    "172": {
        "id": "172",
        "name": "Factorial Trailing Zeroes",
        "acceptance": "44.6",
        "difficulty": "Medium",
        "displayText": "172. Factorial Trailing Zeroes"
    },
    "173": {
        "id": "173",
        "name": "Binary Search Tree Iterator",
        "acceptance": "74.5",
        "difficulty": "Medium",
        "displayText": "173. Binary Search Tree Iterator"
    },
    "174": {
        "id": "174",
        "name": "Dungeon Game",
        "acceptance": "39.3",
        "difficulty": "Hard",
        "displayText": "174. Dungeon Game"
    },
    "175": {
        "id": "175",
        "name": "Combine Two Tables",
        "acceptance": "77.8",
        "difficulty": "Easy",
        "displayText": "175. Combine Two Tables"
    },
    "176": {
        "id": "176",
        "name": "Second Highest Salary",
        "acceptance": "43.3",
        "difficulty": "Medium",
        "displayText": "176. Second Highest Salary"
    },
    "177": {
        "id": "177",
        "name": "Nth Highest Salary",
        "acceptance": "37.9",
        "difficulty": "Medium",
        "displayText": "177. Nth Highest Salary"
    },
    "178": {
        "id": "178",
        "name": "Rank Scores",
        "acceptance": "64.8",
        "difficulty": "Medium",
        "displayText": "178. Rank Scores"
    },
    "179": {
        "id": "179",
        "name": "Largest Number",
        "acceptance": "41.0",
        "difficulty": "Medium",
        "displayText": "179. Largest Number"
    },
    "180": {
        "id": "180",
        "name": "Consecutive Numbers",
        "acceptance": "45.7",
        "difficulty": "Medium",
        "displayText": "180. Consecutive Numbers"
    },
    "181": {
        "id": "181",
        "name": "Employees Earning More Than Their Managers",
        "acceptance": "71.2",
        "difficulty": "Easy",
        "displayText": "181. Employees Earning More Than Their Managers"
    },
    "182": {
        "id": "182",
        "name": "Duplicate Emails",
        "acceptance": "72.2",
        "difficulty": "Easy",
        "displayText": "182. Duplicate Emails"
    },
    "183": {
        "id": "183",
        "name": "Customers Who Never Order",
        "acceptance": "70.4",
        "difficulty": "Easy",
        "displayText": "183. Customers Who Never Order"
    },
    "184": {
        "id": "184",
        "name": "Department Highest Salary",
        "acceptance": "54.2",
        "difficulty": "Medium",
        "displayText": "184. Department Highest Salary"
    },
    "185": {
        "id": "185",
        "name": "Department Top Three Salaries",
        "acceptance": "57.2",
        "difficulty": "Hard",
        "displayText": "185. Department Top Three Salaries"
    },
    "186": {
        "id": "186",
        "name": "Reverse Words in a String II",
        "acceptance": "55.9",
        "difficulty": "Medium",
        "displayText": "186. Reverse Words in a String II"
    },
    "187": {
        "id": "187",
        "name": "Repeated DNA Sequences",
        "acceptance": "50.9",
        "difficulty": "Medium",
        "displayText": "187. Repeated DNA Sequences"
    },
    "188": {
        "id": "188",
        "name": "Best Time to Buy and Sell Stock IV",
        "acceptance": "46.4",
        "difficulty": "Hard",
        "displayText": "188. Best Time to Buy and Sell Stock IV"
    },
    "189": {
        "id": "189",
        "name": "Rotate Array",
        "acceptance": "42.7",
        "difficulty": "Medium",
        "displayText": "189. Rotate Array"
    },
    "190": {
        "id": "190",
        "name": "Reverse Bits",
        "acceptance": "62.6",
        "difficulty": "Easy",
        "displayText": "190. Reverse Bits"
    },
    "191": {
        "id": "191",
        "name": "Number of 1 Bits",
        "acceptance": "74.0",
        "difficulty": "Easy",
        "displayText": "191. Number of 1 Bits"
    },
    "192": {
        "id": "192",
        "name": "Word Frequency",
        "acceptance": "27.0",
        "difficulty": "Medium",
        "displayText": "192. Word Frequency"
    },
    "193": {
        "id": "193",
        "name": "Valid Phone Numbers",
        "acceptance": "27.1",
        "difficulty": "Easy",
        "displayText": "193. Valid Phone Numbers"
    },
    "194": {
        "id": "194",
        "name": "Transpose File",
        "acceptance": "28.1",
        "difficulty": "Medium",
        "displayText": "194. Transpose File"
    },
    "195": {
        "id": "195",
        "name": "Tenth Line",
        "acceptance": "34.3",
        "difficulty": "Easy",
        "displayText": "195. Tenth Line"
    },
    "196": {
        "id": "196",
        "name": "Delete Duplicate Emails",
        "acceptance": "64.0",
        "difficulty": "Easy",
        "displayText": "196. Delete Duplicate Emails"
    },
    "197": {
        "id": "197",
        "name": "Rising Temperature",
        "acceptance": "50.0",
        "difficulty": "Easy",
        "displayText": "197. Rising Temperature"
    },
    "198": {
        "id": "198",
        "name": "House Robber",
        "acceptance": "52.1",
        "difficulty": "Medium",
        "displayText": "198. House Robber"
    },
    "199": {
        "id": "199",
        "name": "Binary Tree Right Side View",
        "acceptance": "66.2",
        "difficulty": "Medium",
        "displayText": "199. Binary Tree Right Side View"
    },
    "200": {
        "id": "200",
        "name": "Number of Islands",
        "acceptance": "61.9",
        "difficulty": "Medium",
        "displayText": "200. Number of Islands"
    },
    "201": {
        "id": "201",
        "name": "Bitwise AND of Numbers Range",
        "acceptance": "47.6",
        "difficulty": "Medium",
        "displayText": "201. Bitwise AND of Numbers Range"
    },
    "202": {
        "id": "202",
        "name": "Happy Number",
        "acceptance": "57.8",
        "difficulty": "Easy",
        "displayText": "202. Happy Number"
    },
    "203": {
        "id": "203",
        "name": "Remove Linked List Elements",
        "acceptance": "51.4",
        "difficulty": "Easy",
        "displayText": "203. Remove Linked List Elements"
    },
    "204": {
        "id": "204",
        "name": "Count Primes",
        "acceptance": "34.6",
        "difficulty": "Medium",
        "displayText": "204. Count Primes"
    },
    "205": {
        "id": "205",
        "name": "Isomorphic Strings",
        "acceptance": "46.6",
        "difficulty": "Easy",
        "displayText": "205. Isomorphic Strings"
    },
    "206": {
        "id": "206",
        "name": "Reverse Linked List",
        "acceptance": "78.9",
        "difficulty": "Easy",
        "displayText": "206. Reverse Linked List"
    },
    "207": {
        "id": "207",
        "name": "Course Schedule",
        "acceptance": "48.7",
        "difficulty": "Medium",
        "displayText": "207. Course Schedule"
    },
    "208": {
        "id": "208",
        "name": "Implement Trie (Prefix Tree)",
        "acceptance": "67.7",
        "difficulty": "Medium",
        "displayText": "208. Implement Trie (Prefix Tree)"
    },
    "209": {
        "id": "209",
        "name": "Minimum Size Subarray Sum",
        "acceptance": "49.0",
        "difficulty": "Medium",
        "displayText": "209. Minimum Size Subarray Sum"
    },
    "210": {
        "id": "210",
        "name": "Course Schedule II",
        "acceptance": "52.9",
        "difficulty": "Medium",
        "displayText": "210. Course Schedule II"
    },
    "211": {
        "id": "211",
        "name": "Design Add and Search Words Data Structure",
        "acceptance": "46.9",
        "difficulty": "Medium",
        "displayText": "211. Design Add and Search Words Data Structure"
    },
    "212": {
        "id": "212",
        "name": "Word Search II",
        "acceptance": "37.1",
        "difficulty": "Hard",
        "displayText": "212. Word Search II"
    },
    "213": {
        "id": "213",
        "name": "House Robber II",
        "acceptance": "43.3",
        "difficulty": "Medium",
        "displayText": "213. House Robber II"
    },
    "214": {
        "id": "214",
        "name": "Shortest Palindrome",
        "acceptance": "40.5",
        "difficulty": "Hard",
        "displayText": "214. Shortest Palindrome"
    },
    "215": {
        "id": "215",
        "name": "Kth Largest Element in an Array",
        "acceptance": "67.8",
        "difficulty": "Medium",
        "displayText": "215. Kth Largest Element in an Array"
    },
    "216": {
        "id": "216",
        "name": "Combination Sum III",
        "acceptance": "71.6",
        "difficulty": "Medium",
        "displayText": "216. Combination Sum III"
    },
    "217": {
        "id": "217",
        "name": "Contains Duplicate",
        "acceptance": "63.0",
        "difficulty": "Easy",
        "displayText": "217. Contains Duplicate"
    },
    "218": {
        "id": "218",
        "name": "The Skyline Problem",
        "acceptance": "43.8",
        "difficulty": "Hard",
        "displayText": "218. The Skyline Problem"
    },
    "219": {
        "id": "219",
        "name": "Contains Duplicate II",
        "acceptance": "48.5",
        "difficulty": "Easy",
        "displayText": "219. Contains Duplicate II"
    },
    "220": {
        "id": "220",
        "name": "Contains Duplicate III",
        "acceptance": "23.5",
        "difficulty": "Hard",
        "displayText": "220. Contains Duplicate III"
    },
    "221": {
        "id": "221",
        "name": "Maximal Square",
        "acceptance": "48.4",
        "difficulty": "Medium",
        "displayText": "221. Maximal Square"
    },
    "222": {
        "id": "222",
        "name": "Count Complete Tree Nodes",
        "acceptance": "69.3",
        "difficulty": "Easy",
        "displayText": "222. Count Complete Tree Nodes"
    },
    "223": {
        "id": "223",
        "name": "Rectangle Area",
        "acceptance": "47.1",
        "difficulty": "Medium",
        "displayText": "223. Rectangle Area"
    },
    "224": {
        "id": "224",
        "name": "Basic Calculator",
        "acceptance": "45.2",
        "difficulty": "Hard",
        "displayText": "224. Basic Calculator"
    },
    "225": {
        "id": "225",
        "name": "Implement Stack using Queues",
        "acceptance": "66.9",
        "difficulty": "Easy",
        "displayText": "225. Implement Stack using Queues"
    },
    "226": {
        "id": "226",
        "name": "Invert Binary Tree",
        "acceptance": "78.8",
        "difficulty": "Easy",
        "displayText": "226. Invert Binary Tree"
    },
    "227": {
        "id": "227",
        "name": "Basic Calculator II",
        "acceptance": "45.5",
        "difficulty": "Medium",
        "displayText": "227. Basic Calculator II"
    },
    "228": {
        "id": "228",
        "name": "Summary Ranges",
        "acceptance": "52.8",
        "difficulty": "Easy",
        "displayText": "228. Summary Ranges"
    },
    "229": {
        "id": "229",
        "name": "Majority Element II",
        "acceptance": "53.9",
        "difficulty": "Medium",
        "displayText": "229. Majority Element II"
    },
    "230": {
        "id": "230",
        "name": "Kth Smallest Element in a BST",
        "acceptance": "75.0",
        "difficulty": "Medium",
        "displayText": "230. Kth Smallest Element in a BST"
    },
    "231": {
        "id": "231",
        "name": "Power of Two",
        "acceptance": "48.3",
        "difficulty": "Easy",
        "displayText": "231. Power of Two"
    },
    "232": {
        "id": "232",
        "name": "Implement Queue using Stacks",
        "acceptance": "67.9",
        "difficulty": "Easy",
        "displayText": "232. Implement Queue using Stacks"
    },
    "233": {
        "id": "233",
        "name": "Number of Digit One",
        "acceptance": "35.8",
        "difficulty": "Hard",
        "displayText": "233. Number of Digit One"
    },
    "234": {
        "id": "234",
        "name": "Palindrome Linked List",
        "acceptance": "55.4",
        "difficulty": "Easy",
        "displayText": "234. Palindrome Linked List"
    },
    "235": {
        "id": "235",
        "name": "Lowest Common Ancestor of a Binary Search Tree",
        "acceptance": "67.8",
        "difficulty": "Medium",
        "displayText": "235. Lowest Common Ancestor of a Binary Search Tree"
    },
    "236": {
        "id": "236",
        "name": "Lowest Common Ancestor of a Binary Tree",
        "acceptance": "66.1",
        "difficulty": "Medium",
        "displayText": "236. Lowest Common Ancestor of a Binary Tree"
    },
    "237": {
        "id": "237",
        "name": "Delete Node in a Linked List",
        "acceptance": "81.9",
        "difficulty": "Medium",
        "displayText": "237. Delete Node in a Linked List"
    },
    "238": {
        "id": "238",
        "name": "Product of Array Except Self",
        "acceptance": "67.5",
        "difficulty": "Medium",
        "displayText": "238. Product of Array Except Self"
    },
    "239": {
        "id": "239",
        "name": "Sliding Window Maximum",
        "acceptance": "47.4",
        "difficulty": "Hard",
        "displayText": "239. Sliding Window Maximum"
    },
    "240": {
        "id": "240",
        "name": "Search a 2D Matrix II",
        "acceptance": "54.7",
        "difficulty": "Medium",
        "displayText": "240. Search a 2D Matrix II"
    },
    "241": {
        "id": "241",
        "name": "Different Ways to Add Parentheses",
        "acceptance": "72.2",
        "difficulty": "Medium",
        "displayText": "241. Different Ways to Add Parentheses"
    },
    "242": {
        "id": "242",
        "name": "Valid Anagram",
        "acceptance": "66.3",
        "difficulty": "Easy",
        "displayText": "242. Valid Anagram"
    },
    "243": {
        "id": "243",
        "name": "Shortest Word Distance",
        "acceptance": "65.9",
        "difficulty": "Easy",
        "displayText": "243. Shortest Word Distance"
    },
    "244": {
        "id": "244",
        "name": "Shortest Word Distance II",
        "acceptance": "62.0",
        "difficulty": "Medium",
        "displayText": "244. Shortest Word Distance II"
    },
    "245": {
        "id": "245",
        "name": "Shortest Word Distance III",
        "acceptance": "59.0",
        "difficulty": "Medium",
        "displayText": "245. Shortest Word Distance III"
    },
    "246": {
        "id": "246",
        "name": "Strobogrammatic Number",
        "acceptance": "47.6",
        "difficulty": "Easy",
        "displayText": "246. Strobogrammatic Number"
    },
    "247": {
        "id": "247",
        "name": "Strobogrammatic Number II",
        "acceptance": "53.1",
        "difficulty": "Medium",
        "displayText": "247. Strobogrammatic Number II"
    },
    "248": {
        "id": "248",
        "name": "Strobogrammatic Number III",
        "acceptance": "42.4",
        "difficulty": "Hard",
        "displayText": "248. Strobogrammatic Number III"
    },
    "249": {
        "id": "249",
        "name": "Group Shifted Strings",
        "acceptance": "67.2",
        "difficulty": "Medium",
        "displayText": "249. Group Shifted Strings"
    },
    "250": {
        "id": "250",
        "name": "Count Univalue Subtrees",
        "acceptance": "57.1",
        "difficulty": "Medium",
        "displayText": "250. Count Univalue Subtrees"
    },
    "251": {
        "id": "251",
        "name": "Flatten 2D Vector",
        "acceptance": "50.1",
        "difficulty": "Medium",
        "displayText": "251. Flatten 2D Vector"
    },
    "252": {
        "id": "252",
        "name": "Meeting Rooms",
        "acceptance": "58.8",
        "difficulty": "Easy",
        "displayText": "252. Meeting Rooms"
    },
    "253": {
        "id": "253",
        "name": "Meeting Rooms II",
        "acceptance": "52.0",
        "difficulty": "Medium",
        "displayText": "253. Meeting Rooms II"
    },
    "254": {
        "id": "254",
        "name": "Factor Combinations",
        "acceptance": "50.2",
        "difficulty": "Medium",
        "displayText": "254. Factor Combinations"
    },
    "255": {
        "id": "255",
        "name": "Verify Preorder Sequence in Binary Search Tree",
        "acceptance": "50.7",
        "difficulty": "Medium",
        "displayText": "255. Verify Preorder Sequence in Binary Search Tree"
    },
    "256": {
        "id": "256",
        "name": "Paint House",
        "acceptance": "63.6",
        "difficulty": "Medium",
        "displayText": "256. Paint House"
    },
    "257": {
        "id": "257",
        "name": "Binary Tree Paths",
        "acceptance": "66.1",
        "difficulty": "Easy",
        "displayText": "257. Binary Tree Paths"
    },
    "258": {
        "id": "258",
        "name": "Add Digits",
        "acceptance": "67.7",
        "difficulty": "Easy",
        "displayText": "258. Add Digits"
    },
    "259": {
        "id": "259",
        "name": "3Sum Smaller",
        "acceptance": "51.0",
        "difficulty": "Medium",
        "displayText": "259. 3Sum Smaller"
    },
    "260": {
        "id": "260",
        "name": "Single Number III",
        "acceptance": "70.7",
        "difficulty": "Medium",
        "displayText": "260. Single Number III"
    },
    "261": {
        "id": "261",
        "name": "Graph Valid Tree",
        "acceptance": "49.2",
        "difficulty": "Medium",
        "displayText": "261. Graph Valid Tree"
    },
    "262": {
        "id": "262",
        "name": "Trips and Users",
        "acceptance": "37.1",
        "difficulty": "Hard",
        "displayText": "262. Trips and Users"
    },
    "263": {
        "id": "263",
        "name": "Ugly Number",
        "acceptance": "42.2",
        "difficulty": "Easy",
        "displayText": "263. Ugly Number"
    },
    "264": {
        "id": "264",
        "name": "Ugly Number II",
        "acceptance": "49.2",
        "difficulty": "Medium",
        "displayText": "264. Ugly Number II"
    },
    "265": {
        "id": "265",
        "name": "Paint House II",
        "acceptance": "56.2",
        "difficulty": "Hard",
        "displayText": "265. Paint House II"
    },
    "266": {
        "id": "266",
        "name": "Palindrome Permutation",
        "acceptance": "68.4",
        "difficulty": "Easy",
        "displayText": "266. Palindrome Permutation"
    },
    "267": {
        "id": "267",
        "name": "Palindrome Permutation II",
        "acceptance": "42.1",
        "difficulty": "Medium",
        "displayText": "267. Palindrome Permutation II"
    },
    "268": {
        "id": "268",
        "name": "Missing Number",
        "acceptance": "69.6",
        "difficulty": "Easy",
        "displayText": "268. Missing Number"
    },
    "269": {
        "id": "269",
        "name": "Alien Dictionary",
        "acceptance": "36.5",
        "difficulty": "Hard",
        "displayText": "269. Alien Dictionary"
    },
    "270": {
        "id": "270",
        "name": "Closest Binary Search Tree Value",
        "acceptance": "50.0",
        "difficulty": "Easy",
        "displayText": "270. Closest Binary Search Tree Value"
    },
    "271": {
        "id": "271",
        "name": "Encode and Decode Strings",
        "acceptance": "49.2",
        "difficulty": "Medium",
        "displayText": "271. Encode and Decode Strings"
    },
    "272": {
        "id": "272",
        "name": "Closest Binary Search Tree Value II",
        "acceptance": "60.1",
        "difficulty": "Hard",
        "displayText": "272. Closest Binary Search Tree Value II"
    },
    "273": {
        "id": "273",
        "name": "Integer to English Words",
        "acceptance": "34.3",
        "difficulty": "Hard",
        "displayText": "273. Integer to English Words"
    },
    "274": {
        "id": "274",
        "name": "H-Index",
        "acceptance": "40.1",
        "difficulty": "Medium",
        "displayText": "274. H-Index"
    },
    "275": {
        "id": "275",
        "name": "H-Index II",
        "acceptance": "38.7",
        "difficulty": "Medium",
        "displayText": "275. H-Index II"
    },
    "276": {
        "id": "276",
        "name": "Paint Fence",
        "acceptance": "47.6",
        "difficulty": "Medium",
        "displayText": "276. Paint Fence"
    },
    "277": {
        "id": "277",
        "name": "Find the Celebrity",
        "acceptance": "48.3",
        "difficulty": "Medium",
        "displayText": "277. Find the Celebrity"
    },
    "278": {
        "id": "278",
        "name": "First Bad Version",
        "acceptance": "45.7",
        "difficulty": "Easy",
        "displayText": "278. First Bad Version"
    },
    "279": {
        "id": "279",
        "name": "Perfect Squares",
        "acceptance": "55.5",
        "difficulty": "Medium",
        "displayText": "279. Perfect Squares"
    },
    "280": {
        "id": "280",
        "name": "Wiggle Sort",
        "acceptance": "68.1",
        "difficulty": "Medium",
        "displayText": "280. Wiggle Sort"
    },
    "281": {
        "id": "281",
        "name": "Zigzag Iterator",
        "acceptance": "65.4",
        "difficulty": "Medium",
        "displayText": "281. Zigzag Iterator"
    },
    "282": {
        "id": "282",
        "name": "Expression Add Operators",
        "acceptance": "41.3",
        "difficulty": "Hard",
        "displayText": "282. Expression Add Operators"
    },
    "283": {
        "id": "283",
        "name": "Move Zeroes",
        "acceptance": "62.7",
        "difficulty": "Easy",
        "displayText": "283. Move Zeroes"
    },
    "284": {
        "id": "284",
        "name": "Peeking Iterator",
        "acceptance": "60.5",
        "difficulty": "Medium",
        "displayText": "284. Peeking Iterator"
    },
    "285": {
        "id": "285",
        "name": "Inorder Successor in BST",
        "acceptance": "50.6",
        "difficulty": "Medium",
        "displayText": "285. Inorder Successor in BST"
    },
    "286": {
        "id": "286",
        "name": "Walls and Gates",
        "acceptance": "62.7",
        "difficulty": "Medium",
        "displayText": "286. Walls and Gates"
    },
    "287": {
        "id": "287",
        "name": "Find the Duplicate Number",
        "acceptance": "62.5",
        "difficulty": "Medium",
        "displayText": "287. Find the Duplicate Number"
    },
    "288": {
        "id": "288",
        "name": "Unique Word Abbreviation",
        "acceptance": "26.9",
        "difficulty": "Medium",
        "displayText": "288. Unique Word Abbreviation"
    },
    "289": {
        "id": "289",
        "name": "Game of Life",
        "acceptance": "71.1",
        "difficulty": "Medium",
        "displayText": "289. Game of Life"
    },
    "290": {
        "id": "290",
        "name": "Word Pattern",
        "acceptance": "42.9",
        "difficulty": "Easy",
        "displayText": "290. Word Pattern"
    },
    "291": {
        "id": "291",
        "name": "Word Pattern II",
        "acceptance": "48.6",
        "difficulty": "Medium",
        "displayText": "291. Word Pattern II"
    },
    "292": {
        "id": "292",
        "name": "Nim Game",
        "acceptance": "57.9",
        "difficulty": "Easy",
        "displayText": "292. Nim Game"
    },
    "293": {
        "id": "293",
        "name": "Flip Game",
        "acceptance": "64.9",
        "difficulty": "Easy",
        "displayText": "293. Flip Game"
    },
    "294": {
        "id": "294",
        "name": "Flip Game II",
        "acceptance": "52.2",
        "difficulty": "Medium",
        "displayText": "294. Flip Game II"
    },
    "295": {
        "id": "295",
        "name": "Find Median from Data Stream",
        "acceptance": "53.1",
        "difficulty": "Hard",
        "displayText": "295. Find Median from Data Stream"
    },
    "296": {
        "id": "296",
        "name": "Best Meeting Point",
        "acceptance": "61.2",
        "difficulty": "Hard",
        "displayText": "296. Best Meeting Point"
    },
    "297": {
        "id": "297",
        "name": "Serialize and Deserialize Binary Tree",
        "acceptance": "58.6",
        "difficulty": "Hard",
        "displayText": "297. Serialize and Deserialize Binary Tree"
    },
    "298": {
        "id": "298",
        "name": "Binary Tree Longest Consecutive Sequence",
        "acceptance": "54.0",
        "difficulty": "Medium",
        "displayText": "298. Binary Tree Longest Consecutive Sequence"
    },
    "299": {
        "id": "299",
        "name": "Bulls and Cows",
        "acceptance": "51.2",
        "difficulty": "Medium",
        "displayText": "299. Bulls and Cows"
    },
    "300": {
        "id": "300",
        "name": "Longest Increasing Subsequence",
        "acceptance": "57.4",
        "difficulty": "Medium",
        "displayText": "300. Longest Increasing Subsequence"
    },
    "301": {
        "id": "301",
        "name": "Remove Invalid Parentheses",
        "acceptance": "49.0",
        "difficulty": "Hard",
        "displayText": "301. Remove Invalid Parentheses"
    },
    "302": {
        "id": "302",
        "name": "Smallest Rectangle Enclosing Black Pixels",
        "acceptance": "59.5",
        "difficulty": "Hard",
        "displayText": "302. Smallest Rectangle Enclosing Black Pixels"
    },
    "303": {
        "id": "303",
        "name": "Range Sum Query - Immutable",
        "acceptance": "67.8",
        "difficulty": "Easy",
        "displayText": "303. Range Sum Query - Immutable"
    },
    "304": {
        "id": "304",
        "name": "Range Sum Query 2D - Immutable",
        "acceptance": "56.2",
        "difficulty": "Medium",
        "displayText": "304. Range Sum Query 2D - Immutable"
    },
    "305": {
        "id": "305",
        "name": "Number of Islands II",
        "acceptance": "40.0",
        "difficulty": "Hard",
        "displayText": "305. Number of Islands II"
    },
    "306": {
        "id": "306",
        "name": "Additive Number",
        "acceptance": "32.4",
        "difficulty": "Medium",
        "displayText": "306. Additive Number"
    },
    "307": {
        "id": "307",
        "name": "Range Sum Query - Mutable",
        "acceptance": "41.7",
        "difficulty": "Medium",
        "displayText": "307. Range Sum Query - Mutable"
    },
    "308": {
        "id": "308",
        "name": "Range Sum Query 2D - Mutable",
        "acceptance": "44.8",
        "difficulty": "Medium",
        "displayText": "308. Range Sum Query 2D - Mutable"
    },
    "309": {
        "id": "309",
        "name": "Best Time to Buy and Sell Stock with Cooldown",
        "acceptance": "60.0",
        "difficulty": "Medium",
        "displayText": "309. Best Time to Buy and Sell Stock with Cooldown"
    },
    "310": {
        "id": "310",
        "name": "Minimum Height Trees",
        "acceptance": "41.9",
        "difficulty": "Medium",
        "displayText": "310. Minimum Height Trees"
    },
    "311": {
        "id": "311",
        "name": "Sparse Matrix Multiplication",
        "acceptance": "68.7",
        "difficulty": "Medium",
        "displayText": "311. Sparse Matrix Multiplication"
    },
    "312": {
        "id": "312",
        "name": "Burst Balloons",
        "acceptance": "60.9",
        "difficulty": "Hard",
        "displayText": "312. Burst Balloons"
    },
    "313": {
        "id": "313",
        "name": "Super Ugly Number",
        "acceptance": "45.4",
        "difficulty": "Medium",
        "displayText": "313. Super Ugly Number"
    },
    "314": {
        "id": "314",
        "name": "Binary Tree Vertical Order Traversal",
        "acceptance": "56.8",
        "difficulty": "Medium",
        "displayText": "314. Binary Tree Vertical Order Traversal"
    },
    "315": {
        "id": "315",
        "name": "Count of Smaller Numbers After Self",
        "acceptance": "42.8",
        "difficulty": "Hard",
        "displayText": "315. Count of Smaller Numbers After Self"
    },
    "316": {
        "id": "316",
        "name": "Remove Duplicate Letters",
        "acceptance": "51.0",
        "difficulty": "Medium",
        "displayText": "316. Remove Duplicate Letters"
    },
    "317": {
        "id": "317",
        "name": "Shortest Distance from All Buildings",
        "acceptance": "44.2",
        "difficulty": "Hard",
        "displayText": "317. Shortest Distance from All Buildings"
    },
    "318": {
        "id": "318",
        "name": "Maximum Product of Word Lengths",
        "acceptance": "60.4",
        "difficulty": "Medium",
        "displayText": "318. Maximum Product of Word Lengths"
    },
    "319": {
        "id": "319",
        "name": "Bulb Switcher",
        "acceptance": "53.9",
        "difficulty": "Medium",
        "displayText": "319. Bulb Switcher"
    },
    "320": {
        "id": "320",
        "name": "Generalized Abbreviation",
        "acceptance": "60.0",
        "difficulty": "Medium",
        "displayText": "320. Generalized Abbreviation"
    },
    "321": {
        "id": "321",
        "name": "Create Maximum Number",
        "acceptance": "32.0",
        "difficulty": "Hard",
        "displayText": "321. Create Maximum Number"
    },
    "322": {
        "id": "322",
        "name": "Coin Change",
        "acceptance": "46.1",
        "difficulty": "Medium",
        "displayText": "322. Coin Change"
    },
    "323": {
        "id": "323",
        "name": "Number of Connected Components in an Undirected Graph",
        "acceptance": "64.0",
        "difficulty": "Medium",
        "displayText": "323. Number of Connected Components in an Undirected Graph"
    },
    "324": {
        "id": "324",
        "name": "Wiggle Sort II",
        "acceptance": "35.4",
        "difficulty": "Medium",
        "displayText": "324. Wiggle Sort II"
    },
    "325": {
        "id": "325",
        "name": "Maximum Size Subarray Sum Equals k",
        "acceptance": "50.4",
        "difficulty": "Medium",
        "displayText": "325. Maximum Size Subarray Sum Equals k"
    },
    "326": {
        "id": "326",
        "name": "Power of Three",
        "acceptance": "47.7",
        "difficulty": "Easy",
        "displayText": "326. Power of Three"
    },
    "327": {
        "id": "327",
        "name": "Count of Range Sum",
        "acceptance": "36.8",
        "difficulty": "Hard",
        "displayText": "327. Count of Range Sum"
    },
    "328": {
        "id": "328",
        "name": "Odd Even Linked List",
        "acceptance": "61.9",
        "difficulty": "Medium",
        "displayText": "328. Odd Even Linked List"
    },
    "329": {
        "id": "329",
        "name": "Longest Increasing Path in a Matrix",
        "acceptance": "55.1",
        "difficulty": "Hard",
        "displayText": "329. Longest Increasing Path in a Matrix"
    },
    "330": {
        "id": "330",
        "name": "Patching Array",
        "acceptance": "53.4",
        "difficulty": "Hard",
        "displayText": "330. Patching Array"
    },
    "331": {
        "id": "331",
        "name": "Verify Preorder Serialization of a Binary Tree",
        "acceptance": "46.0",
        "difficulty": "Medium",
        "displayText": "331. Verify Preorder Serialization of a Binary Tree"
    },
    "332": {
        "id": "332",
        "name": "Reconstruct Itinerary",
        "acceptance": "43.5",
        "difficulty": "Hard",
        "displayText": "332. Reconstruct Itinerary"
    },
    "333": {
        "id": "333",
        "name": "Largest BST Subtree",
        "acceptance": "45.2",
        "difficulty": "Medium",
        "displayText": "333. Largest BST Subtree"
    },
    "334": {
        "id": "334",
        "name": "Increasing Triplet Subsequence",
        "acceptance": "39.1",
        "difficulty": "Medium",
        "displayText": "334. Increasing Triplet Subsequence"
    },
    "335": {
        "id": "335",
        "name": "Self Crossing",
        "acceptance": "31.8",
        "difficulty": "Hard",
        "displayText": "335. Self Crossing"
    },
    "336": {
        "id": "336",
        "name": "Palindrome Pairs",
        "acceptance": "36.1",
        "difficulty": "Hard",
        "displayText": "336. Palindrome Pairs"
    },
    "337": {
        "id": "337",
        "name": "House Robber III",
        "acceptance": "54.8",
        "difficulty": "Medium",
        "displayText": "337. House Robber III"
    },
    "338": {
        "id": "338",
        "name": "Counting Bits",
        "acceptance": "79.5",
        "difficulty": "Easy",
        "displayText": "338. Counting Bits"
    },
    "339": {
        "id": "339",
        "name": "Nested List Weight Sum",
        "acceptance": "85.3",
        "difficulty": "Medium",
        "displayText": "339. Nested List Weight Sum"
    },
    "340": {
        "id": "340",
        "name": "Longest Substring with At Most K Distinct Characters",
        "acceptance": "49.4",
        "difficulty": "Medium",
        "displayText": "340. Longest Substring with At Most K Distinct Characters"
    },
    "341": {
        "id": "341",
        "name": "Flatten Nested List Iterator",
        "acceptance": "65.3",
        "difficulty": "Medium",
        "displayText": "341. Flatten Nested List Iterator"
    },
    "342": {
        "id": "342",
        "name": "Power of Four",
        "acceptance": "49.2",
        "difficulty": "Easy",
        "displayText": "342. Power of Four"
    },
    "343": {
        "id": "343",
        "name": "Integer Break",
        "acceptance": "61.0",
        "difficulty": "Medium",
        "displayText": "343. Integer Break"
    },
    "344": {
        "id": "344",
        "name": "Reverse String",
        "acceptance": "79.6",
        "difficulty": "Easy",
        "displayText": "344. Reverse String"
    },
    "345": {
        "id": "345",
        "name": "Reverse Vowels of a String",
        "acceptance": "57.5",
        "difficulty": "Easy",
        "displayText": "345. Reverse Vowels of a String"
    },
    "346": {
        "id": "346",
        "name": "Moving Average from Data Stream",
        "acceptance": "79.8",
        "difficulty": "Easy",
        "displayText": "346. Moving Average from Data Stream"
    },
    "347": {
        "id": "347",
        "name": "Top K Frequent Elements",
        "acceptance": "64.3",
        "difficulty": "Medium",
        "displayText": "347. Top K Frequent Elements"
    },
    "348": {
        "id": "348",
        "name": "Design Tic-Tac-Toe",
        "acceptance": "58.5",
        "difficulty": "Medium",
        "displayText": "348. Design Tic-Tac-Toe"
    },
    "349": {
        "id": "349",
        "name": "Intersection of Two Arrays",
        "acceptance": "76.2",
        "difficulty": "Easy",
        "displayText": "349. Intersection of Two Arrays"
    },
    "350": {
        "id": "350",
        "name": "Intersection of Two Arrays II",
        "acceptance": "58.9",
        "difficulty": "Easy",
        "displayText": "350. Intersection of Two Arrays II"
    },
    "351": {
        "id": "351",
        "name": "Android Unlock Patterns",
        "acceptance": "53.3",
        "difficulty": "Medium",
        "displayText": "351. Android Unlock Patterns"
    },
    "352": {
        "id": "352",
        "name": "Data Stream as Disjoint Intervals",
        "acceptance": "60.4",
        "difficulty": "Hard",
        "displayText": "352. Data Stream as Disjoint Intervals"
    },
    "353": {
        "id": "353",
        "name": "Design Snake Game",
        "acceptance": "39.1",
        "difficulty": "Medium",
        "displayText": "353. Design Snake Game"
    },
    "354": {
        "id": "354",
        "name": "Russian Doll Envelopes",
        "acceptance": "37.2",
        "difficulty": "Hard",
        "displayText": "354. Russian Doll Envelopes"
    },
    "355": {
        "id": "355",
        "name": "Design Twitter",
        "acceptance": "41.8",
        "difficulty": "Medium",
        "displayText": "355. Design Twitter"
    },
    "356": {
        "id": "356",
        "name": "Line Reflection",
        "acceptance": "35.9",
        "difficulty": "Medium",
        "displayText": "356. Line Reflection"
    },
    "357": {
        "id": "357",
        "name": "Count Numbers with Unique Digits",
        "acceptance": "54.1",
        "difficulty": "Medium",
        "displayText": "357. Count Numbers with Unique Digits"
    },
    "358": {
        "id": "358",
        "name": "Rearrange String k Distance Apart",
        "acceptance": "39.3",
        "difficulty": "Hard",
        "displayText": "358. Rearrange String k Distance Apart"
    },
    "359": {
        "id": "359",
        "name": "Logger Rate Limiter",
        "acceptance": "76.4",
        "difficulty": "Easy",
        "displayText": "359. Logger Rate Limiter"
    },
    "360": {
        "id": "360",
        "name": "Sort Transformed Array",
        "acceptance": "56.9",
        "difficulty": "Medium",
        "displayText": "360. Sort Transformed Array"
    },
    "361": {
        "id": "361",
        "name": "Bomb Enemy",
        "acceptance": "52.0",
        "difficulty": "Medium",
        "displayText": "361. Bomb Enemy"
    },
    "362": {
        "id": "362",
        "name": "Design Hit Counter",
        "acceptance": "69.1",
        "difficulty": "Medium",
        "displayText": "362. Design Hit Counter"
    },
    "363": {
        "id": "363",
        "name": "Max Sum of Rectangle No Larger Than K",
        "acceptance": "44.6",
        "difficulty": "Hard",
        "displayText": "363. Max Sum of Rectangle No Larger Than K"
    },
    "364": {
        "id": "364",
        "name": "Nested List Weight Sum II",
        "acceptance": "65.3",
        "difficulty": "Medium",
        "displayText": "364. Nested List Weight Sum II"
    },
    "365": {
        "id": "365",
        "name": "Water and Jug Problem",
        "acceptance": "42.7",
        "difficulty": "Medium",
        "displayText": "365. Water and Jug Problem"
    },
    "366": {
        "id": "366",
        "name": "Find Leaves of Binary Tree",
        "acceptance": "81.0",
        "difficulty": "Medium",
        "displayText": "366. Find Leaves of Binary Tree"
    },
    "367": {
        "id": "367",
        "name": "Valid Perfect Square",
        "acceptance": "44.1",
        "difficulty": "Easy",
        "displayText": "367. Valid Perfect Square"
    },
    "368": {
        "id": "368",
        "name": "Largest Divisible Subset",
        "acceptance": "48.7",
        "difficulty": "Medium",
        "displayText": "368. Largest Divisible Subset"
    },
    "369": {
        "id": "369",
        "name": "Plus One Linked List",
        "acceptance": "61.1",
        "difficulty": "Medium",
        "displayText": "369. Plus One Linked List"
    },
    "370": {
        "id": "370",
        "name": "Range Addition",
        "acceptance": "72.2",
        "difficulty": "Medium",
        "displayText": "370. Range Addition"
    },
    "371": {
        "id": "371",
        "name": "Sum of Two Integers",
        "acceptance": "53.4",
        "difficulty": "Medium",
        "displayText": "371. Sum of Two Integers"
    },
    "372": {
        "id": "372",
        "name": "Super Pow",
        "acceptance": "35.4",
        "difficulty": "Medium",
        "displayText": "372. Super Pow"
    },
    "373": {
        "id": "373",
        "name": "Find K Pairs with Smallest Sums",
        "acceptance": "40.5",
        "difficulty": "Medium",
        "displayText": "373. Find K Pairs with Smallest Sums"
    },
    "374": {
        "id": "374",
        "name": "Guess Number Higher or Lower",
        "acceptance": "55.4",
        "difficulty": "Easy",
        "displayText": "374. Guess Number Higher or Lower"
    },
    "375": {
        "id": "375",
        "name": "Guess Number Higher or Lower II",
        "acceptance": "50.8",
        "difficulty": "Medium",
        "displayText": "375. Guess Number Higher or Lower II"
    },
    "376": {
        "id": "376",
        "name": "Wiggle Subsequence",
        "acceptance": "48.8",
        "difficulty": "Medium",
        "displayText": "376. Wiggle Subsequence"
    },
    "377": {
        "id": "377",
        "name": "Combination Sum IV",
        "acceptance": "54.6",
        "difficulty": "Medium",
        "displayText": "377. Combination Sum IV"
    },
    "378": {
        "id": "378",
        "name": "Kth Smallest Element in a Sorted Matrix",
        "acceptance": "63.4",
        "difficulty": "Medium",
        "displayText": "378. Kth Smallest Element in a Sorted Matrix"
    },
    "379": {
        "id": "379",
        "name": "Design Phone Directory",
        "acceptance": "52.3",
        "difficulty": "Medium",
        "displayText": "379. Design Phone Directory"
    },
    "380": {
        "id": "380",
        "name": "Insert Delete GetRandom O(1)",
        "acceptance": "55.0",
        "difficulty": "Medium",
        "displayText": "380. Insert Delete GetRandom O(1)"
    },
    "381": {
        "id": "381",
        "name": "Insert Delete GetRandom O(1) - Duplicates allowed",
        "acceptance": "35.8",
        "difficulty": "Hard",
        "displayText": "381. Insert Delete GetRandom O(1) - Duplicates allowed"
    },
    "382": {
        "id": "382",
        "name": "Linked List Random Node",
        "acceptance": "63.8",
        "difficulty": "Medium",
        "displayText": "382. Linked List Random Node"
    },
    "383": {
        "id": "383",
        "name": "Ransom Note",
        "acceptance": "64.2",
        "difficulty": "Easy",
        "displayText": "383. Ransom Note"
    },
    "384": {
        "id": "384",
        "name": "Shuffle an Array",
        "acceptance": "58.9",
        "difficulty": "Medium",
        "displayText": "384. Shuffle an Array"
    },
    "385": {
        "id": "385",
        "name": "Mini Parser",
        "acceptance": "39.8",
        "difficulty": "Medium",
        "displayText": "385. Mini Parser"
    },
    "386": {
        "id": "386",
        "name": "Lexicographical Numbers",
        "acceptance": "73.0",
        "difficulty": "Medium",
        "displayText": "386. Lexicographical Numbers"
    },
    "387": {
        "id": "387",
        "name": "First Unique Character in a String",
        "acceptance": "63.4",
        "difficulty": "Easy",
        "displayText": "387. First Unique Character in a String"
    },
    "388": {
        "id": "388",
        "name": "Longest Absolute File Path",
        "acceptance": "48.2",
        "difficulty": "Medium",
        "displayText": "388. Longest Absolute File Path"
    },
    "389": {
        "id": "389",
        "name": "Find the Difference",
        "acceptance": "59.6",
        "difficulty": "Easy",
        "displayText": "389. Find the Difference"
    },
    "390": {
        "id": "390",
        "name": "Elimination Game",
        "acceptance": "44.7",
        "difficulty": "Medium",
        "displayText": "390. Elimination Game"
    },
    "391": {
        "id": "391",
        "name": "Perfect Rectangle",
        "acceptance": "34.9",
        "difficulty": "Hard",
        "displayText": "391. Perfect Rectangle"
    },
    "392": {
        "id": "392",
        "name": "Is Subsequence",
        "acceptance": "48.3",
        "difficulty": "Easy",
        "displayText": "392. Is Subsequence"
    },
    "393": {
        "id": "393",
        "name": "UTF-8 Validation",
        "acceptance": "45.5",
        "difficulty": "Medium",
        "displayText": "393. UTF-8 Validation"
    },
    "394": {
        "id": "394",
        "name": "Decode String",
        "acceptance": "60.9",
        "difficulty": "Medium",
        "displayText": "394. Decode String"
    },
    "395": {
        "id": "395",
        "name": "Longest Substring with At Least K Repeating Characters",
        "acceptance": "45.4",
        "difficulty": "Medium",
        "displayText": "395. Longest Substring with At Least K Repeating Characters"
    },
    "396": {
        "id": "396",
        "name": "Rotate Function",
        "acceptance": "43.8",
        "difficulty": "Medium",
        "displayText": "396. Rotate Function"
    },
    "397": {
        "id": "397",
        "name": "Integer Replacement",
        "acceptance": "36.4",
        "difficulty": "Medium",
        "displayText": "397. Integer Replacement"
    },
    "398": {
        "id": "398",
        "name": "Random Pick Index",
        "acceptance": "64.4",
        "difficulty": "Medium",
        "displayText": "398. Random Pick Index"
    },
    "399": {
        "id": "399",
        "name": "Evaluate Division",
        "acceptance": "62.9",
        "difficulty": "Medium",
        "displayText": "399. Evaluate Division"
    },
    "400": {
        "id": "400",
        "name": "Nth Digit",
        "acceptance": "35.5",
        "difficulty": "Medium",
        "displayText": "400. Nth Digit"
    },
    "401": {
        "id": "401",
        "name": "Binary Watch",
        "acceptance": "56.2",
        "difficulty": "Easy",
        "displayText": "401. Binary Watch"
    },
    "402": {
        "id": "402",
        "name": "Remove K Digits",
        "acceptance": "34.6",
        "difficulty": "Medium",
        "displayText": "402. Remove K Digits"
    },
    "403": {
        "id": "403",
        "name": "Frog Jump",
        "acceptance": "46.4",
        "difficulty": "Hard",
        "displayText": "403. Frog Jump"
    },
    "404": {
        "id": "404",
        "name": "Sum of Left Leaves",
        "acceptance": "61.5",
        "difficulty": "Easy",
        "displayText": "404. Sum of Left Leaves"
    },
    "405": {
        "id": "405",
        "name": "Convert a Number to Hexadecimal",
        "acceptance": "50.5",
        "difficulty": "Easy",
        "displayText": "405. Convert a Number to Hexadecimal"
    },
    "406": {
        "id": "406",
        "name": "Queue Reconstruction by Height",
        "acceptance": "74.1",
        "difficulty": "Medium",
        "displayText": "406. Queue Reconstruction by Height"
    },
    "407": {
        "id": "407",
        "name": "Trapping Rain Water II",
        "acceptance": "58.7",
        "difficulty": "Hard",
        "displayText": "407. Trapping Rain Water II"
    },
    "408": {
        "id": "408",
        "name": "Valid Word Abbreviation",
        "acceptance": "36.7",
        "difficulty": "Easy",
        "displayText": "408. Valid Word Abbreviation"
    },
    "409": {
        "id": "409",
        "name": "Longest Palindrome",
        "acceptance": "55.5",
        "difficulty": "Easy",
        "displayText": "409. Longest Palindrome"
    },
    "410": {
        "id": "410",
        "name": "Split Array Largest Sum",
        "acceptance": "57.6",
        "difficulty": "Hard",
        "displayText": "410. Split Array Largest Sum"
    },
    "411": {
        "id": "411",
        "name": "Minimum Unique Word Abbreviation",
        "acceptance": "40.1",
        "difficulty": "Hard",
        "displayText": "411. Minimum Unique Word Abbreviation"
    },
    "412": {
        "id": "412",
        "name": "Fizz Buzz",
        "acceptance": "74.1",
        "difficulty": "Easy",
        "displayText": "412. Fizz Buzz"
    },
    "413": {
        "id": "413",
        "name": "Arithmetic Slices",
        "acceptance": "64.8",
        "difficulty": "Medium",
        "displayText": "413. Arithmetic Slices"
    },
    "414": {
        "id": "414",
        "name": "Third Maximum Number",
        "acceptance": "36.9",
        "difficulty": "Easy",
        "displayText": "414. Third Maximum Number"
    },
    "415": {
        "id": "415",
        "name": "Add Strings",
        "acceptance": "51.8",
        "difficulty": "Easy",
        "displayText": "415. Add Strings"
    },
    "416": {
        "id": "416",
        "name": "Partition Equal Subset Sum",
        "acceptance": "48.2",
        "difficulty": "Medium",
        "displayText": "416. Partition Equal Subset Sum"
    },
    "417": {
        "id": "417",
        "name": "Pacific Atlantic Water Flow",
        "acceptance": "57.1",
        "difficulty": "Medium",
        "displayText": "417. Pacific Atlantic Water Flow"
    },
    "418": {
        "id": "418",
        "name": "Sentence Screen Fitting",
        "acceptance": "36.3",
        "difficulty": "Medium",
        "displayText": "418. Sentence Screen Fitting"
    },
    "419": {
        "id": "419",
        "name": "Battleships in a Board",
        "acceptance": "76.4",
        "difficulty": "Medium",
        "displayText": "419. Battleships in a Board"
    },
    "420": {
        "id": "420",
        "name": "Strong Password Checker",
        "acceptance": "14.5",
        "difficulty": "Hard",
        "displayText": "420. Strong Password Checker"
    },
    "421": {
        "id": "421",
        "name": "Maximum XOR of Two Numbers in an Array",
        "acceptance": "53.2",
        "difficulty": "Medium",
        "displayText": "421. Maximum XOR of Two Numbers in an Array"
    },
    "422": {
        "id": "422",
        "name": "Valid Word Square",
        "acceptance": "41.9",
        "difficulty": "Easy",
        "displayText": "422. Valid Word Square"
    },
    "423": {
        "id": "423",
        "name": "Reconstruct Original Digits from English",
        "acceptance": "51.5",
        "difficulty": "Medium",
        "displayText": "423. Reconstruct Original Digits from English"
    },
    "424": {
        "id": "424",
        "name": "Longest Repeating Character Replacement",
        "acceptance": "56.7",
        "difficulty": "Medium",
        "displayText": "424. Longest Repeating Character Replacement"
    },
    "425": {
        "id": "425",
        "name": "Word Squares",
        "acceptance": "53.9",
        "difficulty": "Hard",
        "displayText": "425. Word Squares"
    },
    "426": {
        "id": "426",
        "name": "Convert Binary Search Tree to Sorted Doubly Linked List",
        "acceptance": "65.4",
        "difficulty": "Medium",
        "displayText": "426. Convert Binary Search Tree to Sorted Doubly Linked List"
    },
    "427": {
        "id": "427",
        "name": "Construct Quad Tree",
        "acceptance": "76.8",
        "difficulty": "Medium",
        "displayText": "427. Construct Quad Tree"
    },
    "428": {
        "id": "428",
        "name": "Serialize and Deserialize N-ary Tree",
        "acceptance": "68.1",
        "difficulty": "Hard",
        "displayText": "428. Serialize and Deserialize N-ary Tree"
    },
    "429": {
        "id": "429",
        "name": "N-ary Tree Level Order Traversal",
        "acceptance": "71.2",
        "difficulty": "Medium",
        "displayText": "429. N-ary Tree Level Order Traversal"
    },
    "430": {
        "id": "430",
        "name": "Flatten a Multilevel Doubly Linked List",
        "acceptance": "61.1",
        "difficulty": "Medium",
        "displayText": "430. Flatten a Multilevel Doubly Linked List"
    },
    "431": {
        "id": "431",
        "name": "Encode N-ary Tree to Binary Tree",
        "acceptance": "80.0",
        "difficulty": "Hard",
        "displayText": "431. Encode N-ary Tree to Binary Tree"
    },
    "432": {
        "id": "432",
        "name": "All O`one Data Structure",
        "acceptance": "44.7",
        "difficulty": "Hard",
        "displayText": "432. All O`one Data Structure"
    },
    "433": {
        "id": "433",
        "name": "Minimum Genetic Mutation",
        "acceptance": "55.2",
        "difficulty": "Medium",
        "displayText": "433. Minimum Genetic Mutation"
    },
    "434": {
        "id": "434",
        "name": "Number of Segments in a String",
        "acceptance": "36.3",
        "difficulty": "Easy",
        "displayText": "434. Number of Segments in a String"
    },
    "435": {
        "id": "435",
        "name": "Non-overlapping Intervals",
        "acceptance": "55.2",
        "difficulty": "Medium",
        "displayText": "435. Non-overlapping Intervals"
    },
    "436": {
        "id": "436",
        "name": "Find Right Interval",
        "acceptance": "53.5",
        "difficulty": "Medium",
        "displayText": "436. Find Right Interval"
    },
    "437": {
        "id": "437",
        "name": "Path Sum III",
        "acceptance": "46.1",
        "difficulty": "Medium",
        "displayText": "437. Path Sum III"
    },
    "438": {
        "id": "438",
        "name": "Find All Anagrams in a String",
        "acceptance": "52.0",
        "difficulty": "Medium",
        "displayText": "438. Find All Anagrams in a String"
    },
    "439": {
        "id": "439",
        "name": "Ternary Expression Parser",
        "acceptance": "61.9",
        "difficulty": "Medium",
        "displayText": "439. Ternary Expression Parser"
    },
    "440": {
        "id": "440",
        "name": "K-th Smallest in Lexicographical Order",
        "acceptance": "42.0",
        "difficulty": "Hard",
        "displayText": "440. K-th Smallest in Lexicographical Order"
    },
    "441": {
        "id": "441",
        "name": "Arranging Coins",
        "acceptance": "47.2",
        "difficulty": "Easy",
        "displayText": "441. Arranging Coins"
    },
    "442": {
        "id": "442",
        "name": "Find All Duplicates in an Array",
        "acceptance": "76.3",
        "difficulty": "Medium",
        "displayText": "442. Find All Duplicates in an Array"
    },
    "443": {
        "id": "443",
        "name": "String Compression",
        "acceptance": "57.6",
        "difficulty": "Medium",
        "displayText": "443. String Compression"
    },
    "444": {
        "id": "444",
        "name": "Sequence Reconstruction",
        "acceptance": "29.3",
        "difficulty": "Medium",
        "displayText": "444. Sequence Reconstruction"
    },
    "445": {
        "id": "445",
        "name": "Add Two Numbers II",
        "acceptance": "61.6",
        "difficulty": "Medium",
        "displayText": "445. Add Two Numbers II"
    },
    "446": {
        "id": "446",
        "name": "Arithmetic Slices II - Subsequence",
        "acceptance": "54.5",
        "difficulty": "Hard",
        "displayText": "446. Arithmetic Slices II - Subsequence"
    },
    "447": {
        "id": "447",
        "name": "Number of Boomerangs",
        "acceptance": "56.2",
        "difficulty": "Medium",
        "displayText": "447. Number of Boomerangs"
    },
    "448": {
        "id": "448",
        "name": "Find All Numbers Disappeared in an Array",
        "acceptance": "62.2",
        "difficulty": "Easy",
        "displayText": "448. Find All Numbers Disappeared in an Array"
    },
    "449": {
        "id": "449",
        "name": "Serialize and Deserialize BST",
        "acceptance": "58.4",
        "difficulty": "Medium",
        "displayText": "449. Serialize and Deserialize BST"
    },
    "450": {
        "id": "450",
        "name": "Delete Node in a BST",
        "acceptance": "52.7",
        "difficulty": "Medium",
        "displayText": "450. Delete Node in a BST"
    },
    "451": {
        "id": "451",
        "name": "Sort Characters By Frequency",
        "acceptance": "73.8",
        "difficulty": "Medium",
        "displayText": "451. Sort Characters By Frequency"
    },
    "452": {
        "id": "452",
        "name": "Minimum Number of Arrows to Burst Balloons",
        "acceptance": "60.2",
        "difficulty": "Medium",
        "displayText": "452. Minimum Number of Arrows to Burst Balloons"
    },
    "453": {
        "id": "453",
        "name": "Minimum Moves to Equal Array Elements",
        "acceptance": "57.6",
        "difficulty": "Medium",
        "displayText": "453. Minimum Moves to Equal Array Elements"
    },
    "454": {
        "id": "454",
        "name": "4Sum II",
        "acceptance": "57.5",
        "difficulty": "Medium",
        "displayText": "454. 4Sum II"
    },
    "455": {
        "id": "455",
        "name": "Assign Cookies",
        "acceptance": "53.6",
        "difficulty": "Easy",
        "displayText": "455. Assign Cookies"
    },
    "456": {
        "id": "456",
        "name": "132 Pattern",
        "acceptance": "34.0",
        "difficulty": "Medium",
        "displayText": "456. 132 Pattern"
    },
    "457": {
        "id": "457",
        "name": "Circular Array Loop",
        "acceptance": "35.3",
        "difficulty": "Medium",
        "displayText": "457. Circular Array Loop"
    },
    "458": {
        "id": "458",
        "name": "Poor Pigs",
        "acceptance": "59.3",
        "difficulty": "Hard",
        "displayText": "458. Poor Pigs"
    },
    "459": {
        "id": "459",
        "name": "Repeated Substring Pattern",
        "acceptance": "46.7",
        "difficulty": "Easy",
        "displayText": "459. Repeated Substring Pattern"
    },
    "460": {
        "id": "460",
        "name": "LFU Cache",
        "acceptance": "46.1",
        "difficulty": "Hard",
        "displayText": "460. LFU Cache"
    },
    "461": {
        "id": "461",
        "name": "Hamming Distance",
        "acceptance": "75.9",
        "difficulty": "Easy",
        "displayText": "461. Hamming Distance"
    },
    "462": {
        "id": "462",
        "name": "Minimum Moves to Equal Array Elements II",
        "acceptance": "60.8",
        "difficulty": "Medium",
        "displayText": "462. Minimum Moves to Equal Array Elements II"
    },
    "463": {
        "id": "463",
        "name": "Island Perimeter",
        "acceptance": "73.4",
        "difficulty": "Easy",
        "displayText": "463. Island Perimeter"
    },
    "464": {
        "id": "464",
        "name": "Can I Win",
        "acceptance": "30.2",
        "difficulty": "Medium",
        "displayText": "464. Can I Win"
    },
    "465": {
        "id": "465",
        "name": "Optimal Account Balancing",
        "acceptance": "49.8",
        "difficulty": "Hard",
        "displayText": "465. Optimal Account Balancing"
    },
    "466": {
        "id": "466",
        "name": "Count The Repetitions",
        "acceptance": "31.5",
        "difficulty": "Hard",
        "displayText": "466. Count The Repetitions"
    },
    "467": {
        "id": "467",
        "name": "Unique Substrings in Wraparound String",
        "acceptance": "40.9",
        "difficulty": "Medium",
        "displayText": "467. Unique Substrings in Wraparound String"
    },
    "468": {
        "id": "468",
        "name": "Validate IP Address",
        "acceptance": "27.7",
        "difficulty": "Medium",
        "displayText": "468. Validate IP Address"
    },
    "469": {
        "id": "469",
        "name": "Convex Polygon",
        "acceptance": "39.8",
        "difficulty": "Medium",
        "displayText": "469. Convex Polygon"
    },
    "470": {
        "id": "470",
        "name": "Implement Rand10() Using Rand7()",
        "acceptance": "45.8",
        "difficulty": "Medium",
        "displayText": "470. Implement Rand10() Using Rand7()"
    },
    "471": {
        "id": "471",
        "name": "Encode String with Shortest Length",
        "acceptance": "50.5",
        "difficulty": "Hard",
        "displayText": "471. Encode String with Shortest Length"
    },
    "472": {
        "id": "472",
        "name": "Concatenated Words",
        "acceptance": "49.4",
        "difficulty": "Hard",
        "displayText": "472. Concatenated Words"
    },
    "473": {
        "id": "473",
        "name": "Matchsticks to Square",
        "acceptance": "40.8",
        "difficulty": "Medium",
        "displayText": "473. Matchsticks to Square"
    },
    "474": {
        "id": "474",
        "name": "Ones and Zeroes",
        "acceptance": "48.6",
        "difficulty": "Medium",
        "displayText": "474. Ones and Zeroes"
    },
    "475": {
        "id": "475",
        "name": "Heaters",
        "acceptance": "39.6",
        "difficulty": "Medium",
        "displayText": "475. Heaters"
    },
    "476": {
        "id": "476",
        "name": "Number Complement",
        "acceptance": "70.3",
        "difficulty": "Easy",
        "displayText": "476. Number Complement"
    },
    "477": {
        "id": "477",
        "name": "Total Hamming Distance",
        "acceptance": "53.6",
        "difficulty": "Medium",
        "displayText": "477. Total Hamming Distance"
    },
    "478": {
        "id": "478",
        "name": "Generate Random Point in a Circle",
        "acceptance": "40.7",
        "difficulty": "Medium",
        "displayText": "478. Generate Random Point in a Circle"
    },
    "479": {
        "id": "479",
        "name": "Largest Palindrome Product",
        "acceptance": "34.8",
        "difficulty": "Hard",
        "displayText": "479. Largest Palindrome Product"
    },
    "480": {
        "id": "480",
        "name": "Sliding Window Median",
        "acceptance": "38.6",
        "difficulty": "Hard",
        "displayText": "480. Sliding Window Median"
    },
    "481": {
        "id": "481",
        "name": "Magical String",
        "acceptance": "52.2",
        "difficulty": "Medium",
        "displayText": "481. Magical String"
    },
    "482": {
        "id": "482",
        "name": "License Key Formatting",
        "acceptance": "44.5",
        "difficulty": "Easy",
        "displayText": "482. License Key Formatting"
    },
    "483": {
        "id": "483",
        "name": "Smallest Good Base",
        "acceptance": "42.9",
        "difficulty": "Hard",
        "displayText": "483. Smallest Good Base"
    },
    "484": {
        "id": "484",
        "name": "Find Permutation",
        "acceptance": "66.9",
        "difficulty": "Medium",
        "displayText": "484. Find Permutation"
    },
    "485": {
        "id": "485",
        "name": "Max Consecutive Ones",
        "acceptance": "62.0",
        "difficulty": "Easy",
        "displayText": "485. Max Consecutive Ones"
    },
    "486": {
        "id": "486",
        "name": "Predict the Winner",
        "acceptance": "55.6",
        "difficulty": "Medium",
        "displayText": "486. Predict the Winner"
    },
    "487": {
        "id": "487",
        "name": "Max Consecutive Ones II",
        "acceptance": "51.4",
        "difficulty": "Medium",
        "displayText": "487. Max Consecutive Ones II"
    },
    "488": {
        "id": "488",
        "name": "Zuma Game",
        "acceptance": "31.8",
        "difficulty": "Hard",
        "displayText": "488. Zuma Game"
    },
    "489": {
        "id": "489",
        "name": "Robot Room Cleaner",
        "acceptance": "77.3",
        "difficulty": "Hard",
        "displayText": "489. Robot Room Cleaner"
    },
    "490": {
        "id": "490",
        "name": "The Maze",
        "acceptance": "59.2",
        "difficulty": "Medium",
        "displayText": "490. The Maze"
    },
    "491": {
        "id": "491",
        "name": "Non-decreasing Subsequences",
        "acceptance": "61.5",
        "difficulty": "Medium",
        "displayText": "491. Non-decreasing Subsequences"
    },
    "492": {
        "id": "492",
        "name": "Construct the Rectangle",
        "acceptance": "60.2",
        "difficulty": "Easy",
        "displayText": "492. Construct the Rectangle"
    },
    "493": {
        "id": "493",
        "name": "Reverse Pairs",
        "acceptance": "31.8",
        "difficulty": "Hard",
        "displayText": "493. Reverse Pairs"
    },
    "494": {
        "id": "494",
        "name": "Target Sum",
        "acceptance": "50.5",
        "difficulty": "Medium",
        "displayText": "494. Target Sum"
    },
    "495": {
        "id": "495",
        "name": "Teemo Attacking",
        "acceptance": "56.9",
        "difficulty": "Easy",
        "displayText": "495. Teemo Attacking"
    },
    "496": {
        "id": "496",
        "name": "Next Greater Element I",
        "acceptance": "74.1",
        "difficulty": "Easy",
        "displayText": "496. Next Greater Element I"
    },
    "497": {
        "id": "497",
        "name": "Random Point in Non-overlapping Rectangles",
        "acceptance": "40.5",
        "difficulty": "Medium",
        "displayText": "497. Random Point in Non-overlapping Rectangles"
    },
    "498": {
        "id": "498",
        "name": "Diagonal Traverse",
        "acceptance": "62.8",
        "difficulty": "Medium",
        "displayText": "498. Diagonal Traverse"
    },
    "499": {
        "id": "499",
        "name": "The Maze III",
        "acceptance": "50.4",
        "difficulty": "Hard",
        "displayText": "499. The Maze III"
    },
    "500": {
        "id": "500",
        "name": "Keyboard Row",
        "acceptance": "72.2",
        "difficulty": "Easy",
        "displayText": "500. Keyboard Row"
    },
    "501": {
        "id": "501",
        "name": "Find Mode in Binary Search Tree",
        "acceptance": "57.3",
        "difficulty": "Easy",
        "displayText": "501. Find Mode in Binary Search Tree"
    },
    "502": {
        "id": "502",
        "name": "IPO",
        "acceptance": "53.0",
        "difficulty": "Hard",
        "displayText": "502. IPO"
    },
    "503": {
        "id": "503",
        "name": "Next Greater Element II",
        "acceptance": "65.8",
        "difficulty": "Medium",
        "displayText": "503. Next Greater Element II"
    },
    "504": {
        "id": "504",
        "name": "Base 7",
        "acceptance": "51.7",
        "difficulty": "Easy",
        "displayText": "504. Base 7"
    },
    "505": {
        "id": "505",
        "name": "The Maze II",
        "acceptance": "54.1",
        "difficulty": "Medium",
        "displayText": "505. The Maze II"
    },
    "506": {
        "id": "506",
        "name": "Relative Ranks",
        "acceptance": "73.0",
        "difficulty": "Easy",
        "displayText": "506. Relative Ranks"
    },
    "507": {
        "id": "507",
        "name": "Perfect Number",
        "acceptance": "44.3",
        "difficulty": "Easy",
        "displayText": "507. Perfect Number"
    },
    "508": {
        "id": "508",
        "name": "Most Frequent Subtree Sum",
        "acceptance": "67.6",
        "difficulty": "Medium",
        "displayText": "508. Most Frequent Subtree Sum"
    },
    "509": {
        "id": "509",
        "name": "Fibonacci Number",
        "acceptance": "72.7",
        "difficulty": "Easy",
        "displayText": "509. Fibonacci Number"
    },
    "510": {
        "id": "510",
        "name": "Inorder Successor in BST II",
        "acceptance": "61.0",
        "difficulty": "Medium",
        "displayText": "510. Inorder Successor in BST II"
    },
    "511": {
        "id": "511",
        "name": "Game Play Analysis I",
        "acceptance": "75.6",
        "difficulty": "Easy",
        "displayText": "511. Game Play Analysis I"
    },
    "512": {
        "id": "512",
        "name": "Game Play Analysis II",
        "acceptance": "53.8",
        "difficulty": "Easy",
        "displayText": "512. Game Play Analysis II"
    },
    "513": {
        "id": "513",
        "name": "Find Bottom Left Tree Value",
        "acceptance": "71.7",
        "difficulty": "Medium",
        "displayText": "513. Find Bottom Left Tree Value"
    },
    "514": {
        "id": "514",
        "name": "Freedom Trail",
        "acceptance": "58.8",
        "difficulty": "Hard",
        "displayText": "514. Freedom Trail"
    },
    "515": {
        "id": "515",
        "name": "Find Largest Value in Each Tree Row",
        "acceptance": "66.3",
        "difficulty": "Medium",
        "displayText": "515. Find Largest Value in Each Tree Row"
    },
    "516": {
        "id": "516",
        "name": "Longest Palindromic Subsequence",
        "acceptance": "63.8",
        "difficulty": "Medium",
        "displayText": "516. Longest Palindromic Subsequence"
    },
    "517": {
        "id": "517",
        "name": "Super Washing Machines",
        "acceptance": "42.2",
        "difficulty": "Hard",
        "displayText": "517. Super Washing Machines"
    },
    "518": {
        "id": "518",
        "name": "Coin Change II",
        "acceptance": "62.9",
        "difficulty": "Medium",
        "displayText": "518. Coin Change II"
    },
    "519": {
        "id": "519",
        "name": "Random Flip Matrix",
        "acceptance": "43.3",
        "difficulty": "Medium",
        "displayText": "519. Random Flip Matrix"
    },
    "520": {
        "id": "520",
        "name": "Detect Capital",
        "acceptance": "56.1",
        "difficulty": "Easy",
        "displayText": "520. Detect Capital"
    },
    "521": {
        "id": "521",
        "name": "Longest Uncommon Subsequence I",
        "acceptance": "61.2",
        "difficulty": "Easy",
        "displayText": "521. Longest Uncommon Subsequence I"
    },
    "522": {
        "id": "522",
        "name": "Longest Uncommon Subsequence II",
        "acceptance": "42.8",
        "difficulty": "Medium",
        "displayText": "522. Longest Uncommon Subsequence II"
    },
    "523": {
        "id": "523",
        "name": "Continuous Subarray Sum",
        "acceptance": "30.8",
        "difficulty": "Medium",
        "displayText": "523. Continuous Subarray Sum"
    },
    "524": {
        "id": "524",
        "name": "Longest Word in Dictionary through Deleting",
        "acceptance": "51.6",
        "difficulty": "Medium",
        "displayText": "524. Longest Word in Dictionary through Deleting"
    },
    "525": {
        "id": "525",
        "name": "Contiguous Array",
        "acceptance": "49.0",
        "difficulty": "Medium",
        "displayText": "525. Contiguous Array"
    },
    "526": {
        "id": "526",
        "name": "Beautiful Arrangement",
        "acceptance": "64.5",
        "difficulty": "Medium",
        "displayText": "526. Beautiful Arrangement"
    },
    "527": {
        "id": "527",
        "name": "Word Abbreviation",
        "acceptance": "61.7",
        "difficulty": "Hard",
        "displayText": "527. Word Abbreviation"
    },
    "528": {
        "id": "528",
        "name": "Random Pick with Weight",
        "acceptance": "48.3",
        "difficulty": "Medium",
        "displayText": "528. Random Pick with Weight"
    },
    "529": {
        "id": "529",
        "name": "Minesweeper",
        "acceptance": "67.9",
        "difficulty": "Medium",
        "displayText": "529. Minesweeper"
    },
    "530": {
        "id": "530",
        "name": "Minimum Absolute Difference in BST",
        "acceptance": "58.7",
        "difficulty": "Easy",
        "displayText": "530. Minimum Absolute Difference in BST"
    },
    "531": {
        "id": "531",
        "name": "Lonely Pixel I",
        "acceptance": "62.5",
        "difficulty": "Medium",
        "displayText": "531. Lonely Pixel I"
    },
    "532": {
        "id": "532",
        "name": "K-diff Pairs in an Array",
        "acceptance": "44.4",
        "difficulty": "Medium",
        "displayText": "532. K-diff Pairs in an Array"
    },
    "533": {
        "id": "533",
        "name": "Lonely Pixel II",
        "acceptance": "48.6",
        "difficulty": "Medium",
        "displayText": "533. Lonely Pixel II"
    },
    "534": {
        "id": "534",
        "name": "Game Play Analysis III",
        "acceptance": "81.2",
        "difficulty": "Medium",
        "displayText": "534. Game Play Analysis III"
    },
    "535": {
        "id": "535",
        "name": "Encode and Decode TinyURL",
        "acceptance": "86.6",
        "difficulty": "Medium",
        "displayText": "535. Encode and Decode TinyURL"
    },
    "536": {
        "id": "536",
        "name": "Construct Binary Tree from String",
        "acceptance": "58.2",
        "difficulty": "Medium",
        "displayText": "536. Construct Binary Tree from String"
    },
    "537": {
        "id": "537",
        "name": "Complex Number Multiplication",
        "acceptance": "72.3",
        "difficulty": "Medium",
        "displayText": "537. Complex Number Multiplication"
    },
    "538": {
        "id": "538",
        "name": "Convert BST to Greater Tree",
        "acceptance": "70.3",
        "difficulty": "Medium",
        "displayText": "538. Convert BST to Greater Tree"
    },
    "539": {
        "id": "539",
        "name": "Minimum Time Difference",
        "acceptance": "62.3",
        "difficulty": "Medium",
        "displayText": "539. Minimum Time Difference"
    },
    "540": {
        "id": "540",
        "name": "Single Element in a Sorted Array",
        "acceptance": "59.2",
        "difficulty": "Medium",
        "displayText": "540. Single Element in a Sorted Array"
    },
    "541": {
        "id": "541",
        "name": "Reverse String II",
        "acceptance": "51.9",
        "difficulty": "Easy",
        "displayText": "541. Reverse String II"
    },
    "542": {
        "id": "542",
        "name": "01 Matrix",
        "acceptance": "51.0",
        "difficulty": "Medium",
        "displayText": "542. 01 Matrix"
    },
    "543": {
        "id": "543",
        "name": "Diameter of Binary Tree",
        "acceptance": "63.1",
        "difficulty": "Easy",
        "displayText": "543. Diameter of Binary Tree"
    },
    "544": {
        "id": "544",
        "name": "Output Contest Matches",
        "acceptance": "77.4",
        "difficulty": "Medium",
        "displayText": "544. Output Contest Matches"
    },
    "545": {
        "id": "545",
        "name": "Boundary of Binary Tree",
        "acceptance": "46.9",
        "difficulty": "Medium",
        "displayText": "545. Boundary of Binary Tree"
    },
    "546": {
        "id": "546",
        "name": "Remove Boxes",
        "acceptance": "48.2",
        "difficulty": "Hard",
        "displayText": "546. Remove Boxes"
    },
    "547": {
        "id": "547",
        "name": "Number of Provinces",
        "acceptance": "68.2",
        "difficulty": "Medium",
        "displayText": "547. Number of Provinces"
    },
    "548": {
        "id": "548",
        "name": "Split Array with Equal Sum",
        "acceptance": "50.1",
        "difficulty": "Hard",
        "displayText": "548. Split Array with Equal Sum"
    },
    "549": {
        "id": "549",
        "name": "Binary Tree Longest Consecutive Sequence II",
        "acceptance": "49.6",
        "difficulty": "Medium",
        "displayText": "549. Binary Tree Longest Consecutive Sequence II"
    },
    "550": {
        "id": "550",
        "name": "Game Play Analysis IV",
        "acceptance": "39.1",
        "difficulty": "Medium",
        "displayText": "550. Game Play Analysis IV"
    },
    "551": {
        "id": "551",
        "name": "Student Attendance Record I",
        "acceptance": "49.5",
        "difficulty": "Easy",
        "displayText": "551. Student Attendance Record I"
    },
    "552": {
        "id": "552",
        "name": "Student Attendance Record II",
        "acceptance": "55.7",
        "difficulty": "Hard",
        "displayText": "552. Student Attendance Record II"
    },
    "553": {
        "id": "553",
        "name": "Optimal Division",
        "acceptance": "61.5",
        "difficulty": "Medium",
        "displayText": "553. Optimal Division"
    },
    "554": {
        "id": "554",
        "name": "Brick Wall",
        "acceptance": "55.8",
        "difficulty": "Medium",
        "displayText": "554. Brick Wall"
    },
    "555": {
        "id": "555",
        "name": "Split Concatenated Strings",
        "acceptance": "43.3",
        "difficulty": "Medium",
        "displayText": "555. Split Concatenated Strings"
    },
    "556": {
        "id": "556",
        "name": "Next Greater Element III",
        "acceptance": "34.5",
        "difficulty": "Medium",
        "displayText": "556. Next Greater Element III"
    },
    "557": {
        "id": "557",
        "name": "Reverse Words in a String III",
        "acceptance": "83.6",
        "difficulty": "Easy",
        "displayText": "557. Reverse Words in a String III"
    },
    "558": {
        "id": "558",
        "name": "Logical OR of Two Binary Grids Represented as Quad-Trees",
        "acceptance": "50.2",
        "difficulty": "Medium",
        "displayText": "558. Logical OR of Two Binary Grids Represented as Quad-Trees"
    },
    "559": {
        "id": "559",
        "name": "Maximum Depth of N-ary Tree",
        "acceptance": "72.8",
        "difficulty": "Easy",
        "displayText": "559. Maximum Depth of N-ary Tree"
    },
    "560": {
        "id": "560",
        "name": "Subarray Sum Equals K",
        "acceptance": "45.1",
        "difficulty": "Medium",
        "displayText": "560. Subarray Sum Equals K"
    },
    "561": {
        "id": "561",
        "name": "Array Partition",
        "acceptance": "80.2",
        "difficulty": "Easy",
        "displayText": "561. Array Partition"
    },
    "562": {
        "id": "562",
        "name": "Longest Line of Consecutive One in Matrix",
        "acceptance": "50.5",
        "difficulty": "Medium",
        "displayText": "562. Longest Line of Consecutive One in Matrix"
    },
    "563": {
        "id": "563",
        "name": "Binary Tree Tilt",
        "acceptance": "63.7",
        "difficulty": "Easy",
        "displayText": "563. Binary Tree Tilt"
    },
    "564": {
        "id": "564",
        "name": "Find the Closest Palindrome",
        "acceptance": "31.6",
        "difficulty": "Hard",
        "displayText": "564. Find the Closest Palindrome"
    },
    "565": {
        "id": "565",
        "name": "Array Nesting",
        "acceptance": "55.9",
        "difficulty": "Medium",
        "displayText": "565. Array Nesting"
    },
    "566": {
        "id": "566",
        "name": "Reshape the Matrix",
        "acceptance": "63.8",
        "difficulty": "Easy",
        "displayText": "566. Reshape the Matrix"
    },
    "567": {
        "id": "567",
        "name": "Permutation in String",
        "acceptance": "47.0",
        "difficulty": "Medium",
        "displayText": "567. Permutation in String"
    },
    "568": {
        "id": "568",
        "name": "Maximum Vacation Days",
        "acceptance": "46.3",
        "difficulty": "Hard",
        "displayText": "568. Maximum Vacation Days"
    },
    "569": {
        "id": "569",
        "name": "Median Employee Salary",
        "acceptance": "66.3",
        "difficulty": "Hard",
        "displayText": "569. Median Employee Salary"
    },
    "570": {
        "id": "570",
        "name": "Managers with at Least 5 Direct Reports",
        "acceptance": "49.0",
        "difficulty": "Medium",
        "displayText": "570. Managers with at Least 5 Direct Reports"
    },
    "571": {
        "id": "571",
        "name": "Find Median Given Frequency of Numbers",
        "acceptance": "42.5",
        "difficulty": "Hard",
        "displayText": "571. Find Median Given Frequency of Numbers"
    },
    "572": {
        "id": "572",
        "name": "Subtree of Another Tree",
        "acceptance": "49.7",
        "difficulty": "Easy",
        "displayText": "572. Subtree of Another Tree"
    },
    "573": {
        "id": "573",
        "name": "Squirrel Simulation",
        "acceptance": "57.2",
        "difficulty": "Medium",
        "displayText": "573. Squirrel Simulation"
    },
    "574": {
        "id": "574",
        "name": "Winning Candidate",
        "acceptance": "61.8",
        "difficulty": "Medium",
        "displayText": "574. Winning Candidate"
    },
    "575": {
        "id": "575",
        "name": "Distribute Candies",
        "acceptance": "69.3",
        "difficulty": "Easy",
        "displayText": "575. Distribute Candies"
    },
    "576": {
        "id": "576",
        "name": "Out of Boundary Paths",
        "acceptance": "48.1",
        "difficulty": "Medium",
        "displayText": "576. Out of Boundary Paths"
    },
    "577": {
        "id": "577",
        "name": "Employee Bonus",
        "acceptance": "77.1",
        "difficulty": "Easy",
        "displayText": "577. Employee Bonus"
    },
    "578": {
        "id": "578",
        "name": "Get Highest Answer Rate Question",
        "acceptance": "40.2",
        "difficulty": "Medium",
        "displayText": "578. Get Highest Answer Rate Question"
    },
    "579": {
        "id": "579",
        "name": "Find Cumulative Salary of an Employee",
        "acceptance": "48.6",
        "difficulty": "Hard",
        "displayText": "579. Find Cumulative Salary of an Employee"
    },
    "580": {
        "id": "580",
        "name": "Count Student Number in Departments",
        "acceptance": "59.7",
        "difficulty": "Medium",
        "displayText": "580. Count Student Number in Departments"
    },
    "581": {
        "id": "581",
        "name": "Shortest Unsorted Continuous Subarray",
        "acceptance": "37.3",
        "difficulty": "Medium",
        "displayText": "581. Shortest Unsorted Continuous Subarray"
    },
    "582": {
        "id": "582",
        "name": "Kill Process",
        "acceptance": "70.0",
        "difficulty": "Medium",
        "displayText": "582. Kill Process"
    },
    "583": {
        "id": "583",
        "name": "Delete Operation for Two Strings",
        "acceptance": "63.3",
        "difficulty": "Medium",
        "displayText": "583. Delete Operation for Two Strings"
    },
    "584": {
        "id": "584",
        "name": "Find Customer Referee",
        "acceptance": "71.7",
        "difficulty": "Easy",
        "displayText": "584. Find Customer Referee"
    },
    "585": {
        "id": "585",
        "name": "Investments in 2016",
        "acceptance": "49.9",
        "difficulty": "Medium",
        "displayText": "585. Investments in 2016"
    },
    "586": {
        "id": "586",
        "name": "Customer Placing the Largest Number of Orders",
        "acceptance": "64.5",
        "difficulty": "Easy",
        "displayText": "586. Customer Placing the Largest Number of Orders"
    },
    "587": {
        "id": "587",
        "name": "Erect the Fence",
        "acceptance": "52.1",
        "difficulty": "Hard",
        "displayText": "587. Erect the Fence"
    },
    "588": {
        "id": "588",
        "name": "Design In-Memory File System",
        "acceptance": "48.1",
        "difficulty": "Hard",
        "displayText": "588. Design In-Memory File System"
    },
    "589": {
        "id": "589",
        "name": "N-ary Tree Preorder Traversal",
        "acceptance": "76.1",
        "difficulty": "Easy",
        "displayText": "589. N-ary Tree Preorder Traversal"
    },
    "590": {
        "id": "590",
        "name": "N-ary Tree Postorder Traversal",
        "acceptance": "80.6",
        "difficulty": "Easy",
        "displayText": "590. N-ary Tree Postorder Traversal"
    },
    "591": {
        "id": "591",
        "name": "Tag Validator",
        "acceptance": "38.8",
        "difficulty": "Hard",
        "displayText": "591. Tag Validator"
    },
    "592": {
        "id": "592",
        "name": "Fraction Addition and Subtraction",
        "acceptance": "66.1",
        "difficulty": "Medium",
        "displayText": "592. Fraction Addition and Subtraction"
    },
    "593": {
        "id": "593",
        "name": "Valid Square",
        "acceptance": "44.2",
        "difficulty": "Medium",
        "displayText": "593. Valid Square"
    },
    "594": {
        "id": "594",
        "name": "Longest Harmonious Subsequence",
        "acceptance": "56.7",
        "difficulty": "Easy",
        "displayText": "594. Longest Harmonious Subsequence"
    },
    "595": {
        "id": "595",
        "name": "Big Countries",
        "acceptance": "68.2",
        "difficulty": "Easy",
        "displayText": "595. Big Countries"
    },
    "596": {
        "id": "596",
        "name": "Classes More Than 5 Students",
        "acceptance": "60.1",
        "difficulty": "Easy",
        "displayText": "596. Classes More Than 5 Students"
    },
    "597": {
        "id": "597",
        "name": "Friend Requests I: Overall Acceptance Rate",
        "acceptance": "41.5",
        "difficulty": "Easy",
        "displayText": "597. Friend Requests I: Overall Acceptance Rate"
    },
    "598": {
        "id": "598",
        "name": "Range Addition II",
        "acceptance": "57.1",
        "difficulty": "Easy",
        "displayText": "598. Range Addition II"
    },
    "599": {
        "id": "599",
        "name": "Minimum Index Sum of Two Lists",
        "acceptance": "57.6",
        "difficulty": "Easy",
        "displayText": "599. Minimum Index Sum of Two Lists"
    },
    "600": {
        "id": "600",
        "name": "Non-negative Integers without Consecutive Ones",
        "acceptance": "40.1",
        "difficulty": "Hard",
        "displayText": "600. Non-negative Integers without Consecutive Ones"
    },
    "601": {
        "id": "601",
        "name": "Human Traffic of Stadium",
        "acceptance": "49.6",
        "difficulty": "Hard",
        "displayText": "601. Human Traffic of Stadium"
    },
    "602": {
        "id": "602",
        "name": "Friend Requests II: Who Has the Most Friends",
        "acceptance": "60.4",
        "difficulty": "Medium",
        "displayText": "602. Friend Requests II: Who Has the Most Friends"
    },
    "603": {
        "id": "603",
        "name": "Consecutive Available Seats",
        "acceptance": "65.4",
        "difficulty": "Easy",
        "displayText": "603. Consecutive Available Seats"
    },
    "604": {
        "id": "604",
        "name": "Design Compressed String Iterator",
        "acceptance": "40.1",
        "difficulty": "Easy",
        "displayText": "604. Design Compressed String Iterator"
    },
    "605": {
        "id": "605",
        "name": "Can Place Flowers",
        "acceptance": "28.8",
        "difficulty": "Easy",
        "displayText": "605. Can Place Flowers"
    },
    "606": {
        "id": "606",
        "name": "Construct String from Binary Tree",
        "acceptance": "70.0",
        "difficulty": "Medium",
        "displayText": "606. Construct String from Binary Tree"
    },
    "607": {
        "id": "607",
        "name": "Sales Person",
        "acceptance": "65.8",
        "difficulty": "Easy",
        "displayText": "607. Sales Person"
    },
    "608": {
        "id": "608",
        "name": "Tree Node",
        "acceptance": "73.7",
        "difficulty": "Medium",
        "displayText": "608. Tree Node"
    },
    "609": {
        "id": "609",
        "name": "Find Duplicate File in System",
        "acceptance": "67.6",
        "difficulty": "Medium",
        "displayText": "609. Find Duplicate File in System"
    },
    "610": {
        "id": "610",
        "name": "Triangle Judgement",
        "acceptance": "73.4",
        "difficulty": "Easy",
        "displayText": "610. Triangle Judgement"
    },
    "611": {
        "id": "611",
        "name": "Valid Triangle Number",
        "acceptance": "52.1",
        "difficulty": "Medium",
        "displayText": "611. Valid Triangle Number"
    },
    "612": {
        "id": "612",
        "name": "Shortest Distance in a Plane",
        "acceptance": "61.3",
        "difficulty": "Medium",
        "displayText": "612. Shortest Distance in a Plane"
    },
    "613": {
        "id": "613",
        "name": "Shortest Distance in a Line",
        "acceptance": "80.0",
        "difficulty": "Easy",
        "displayText": "613. Shortest Distance in a Line"
    },
    "614": {
        "id": "614",
        "name": "Second Degree Follower",
        "acceptance": "39.8",
        "difficulty": "Medium",
        "displayText": "614. Second Degree Follower"
    },
    "615": {
        "id": "615",
        "name": "Average Salary: Departments VS Company",
        "acceptance": "56.6",
        "difficulty": "Hard",
        "displayText": "615. Average Salary: Departments VS Company"
    },
    "616": {
        "id": "616",
        "name": "Add Bold Tag in String",
        "acceptance": "50.8",
        "difficulty": "Medium",
        "displayText": "616. Add Bold Tag in String"
    },
    "617": {
        "id": "617",
        "name": "Merge Two Binary Trees",
        "acceptance": "79.2",
        "difficulty": "Easy",
        "displayText": "617. Merge Two Binary Trees"
    },
    "618": {
        "id": "618",
        "name": "Students Report By Geography",
        "acceptance": "63.7",
        "difficulty": "Hard",
        "displayText": "618. Students Report By Geography"
    },
    "619": {
        "id": "619",
        "name": "Biggest Single Number",
        "acceptance": "69.0",
        "difficulty": "Easy",
        "displayText": "619. Biggest Single Number"
    },
    "620": {
        "id": "620",
        "name": "Not Boring Movies",
        "acceptance": "74.8",
        "difficulty": "Easy",
        "displayText": "620. Not Boring Movies"
    },
    "621": {
        "id": "621",
        "name": "Task Scheduler",
        "acceptance": "61.1",
        "difficulty": "Medium",
        "displayText": "621. Task Scheduler"
    },
    "622": {
        "id": "622",
        "name": "Design Circular Queue",
        "acceptance": "52.5",
        "difficulty": "Medium",
        "displayText": "622. Design Circular Queue"
    },
    "623": {
        "id": "623",
        "name": "Add One Row to Tree",
        "acceptance": "64.0",
        "difficulty": "Medium",
        "displayText": "623. Add One Row to Tree"
    },
    "624": {
        "id": "624",
        "name": "Maximum Distance in Arrays",
        "acceptance": "45.6",
        "difficulty": "Medium",
        "displayText": "624. Maximum Distance in Arrays"
    },
    "625": {
        "id": "625",
        "name": "Minimum Factorization",
        "acceptance": "33.8",
        "difficulty": "Medium",
        "displayText": "625. Minimum Factorization"
    },
    "626": {
        "id": "626",
        "name": "Exchange Seats",
        "acceptance": "72.3",
        "difficulty": "Medium",
        "displayText": "626. Exchange Seats"
    },
    "627": {
        "id": "627",
        "name": "Swap Salary",
        "acceptance": "83.9",
        "difficulty": "Easy",
        "displayText": "627. Swap Salary"
    },
    "628": {
        "id": "628",
        "name": "Maximum Product of Three Numbers",
        "acceptance": "45.3",
        "difficulty": "Easy",
        "displayText": "628. Maximum Product of Three Numbers"
    },
    "629": {
        "id": "629",
        "name": "K Inverse Pairs Array",
        "acceptance": "49.1",
        "difficulty": "Hard",
        "displayText": "629. K Inverse Pairs Array"
    },
    "630": {
        "id": "630",
        "name": "Course Schedule III",
        "acceptance": "40.5",
        "difficulty": "Hard",
        "displayText": "630. Course Schedule III"
    },
    "631": {
        "id": "631",
        "name": "Design Excel Sum Formula",
        "acceptance": "43.6",
        "difficulty": "Hard",
        "displayText": "631. Design Excel Sum Formula"
    },
    "632": {
        "id": "632",
        "name": "Smallest Range Covering Elements from K Lists",
        "acceptance": "69.7",
        "difficulty": "Hard",
        "displayText": "632. Smallest Range Covering Elements from K Lists"
    },
    "633": {
        "id": "633",
        "name": "Sum of Square Numbers",
        "acceptance": "36.4",
        "difficulty": "Medium",
        "displayText": "633. Sum of Square Numbers"
    },
    "634": {
        "id": "634",
        "name": "Find the Derangement of An Array",
        "acceptance": "41.7",
        "difficulty": "Medium",
        "displayText": "634. Find the Derangement of An Array"
    },
    "635": {
        "id": "635",
        "name": "Design Log Storage System",
        "acceptance": "59.2",
        "difficulty": "Medium",
        "displayText": "635. Design Log Storage System"
    },
    "636": {
        "id": "636",
        "name": "Exclusive Time of Functions",
        "acceptance": "64.4",
        "difficulty": "Medium",
        "displayText": "636. Exclusive Time of Functions"
    },
    "637": {
        "id": "637",
        "name": "Average of Levels in Binary Tree",
        "acceptance": "73.9",
        "difficulty": "Easy",
        "displayText": "637. Average of Levels in Binary Tree"
    },
    "638": {
        "id": "638",
        "name": "Shopping Offers",
        "acceptance": "51.8",
        "difficulty": "Medium",
        "displayText": "638. Shopping Offers"
    },
    "639": {
        "id": "639",
        "name": "Decode Ways II",
        "acceptance": "31.1",
        "difficulty": "Hard",
        "displayText": "639. Decode Ways II"
    },
    "640": {
        "id": "640",
        "name": "Solve the Equation",
        "acceptance": "44.5",
        "difficulty": "Medium",
        "displayText": "640. Solve the Equation"
    },
    "641": {
        "id": "641",
        "name": "Design Circular Deque",
        "acceptance": "64.5",
        "difficulty": "Medium",
        "displayText": "641. Design Circular Deque"
    },
    "642": {
        "id": "642",
        "name": "Design Search Autocomplete System",
        "acceptance": "49.3",
        "difficulty": "Hard",
        "displayText": "642. Design Search Autocomplete System"
    },
    "643": {
        "id": "643",
        "name": "Maximum Average Subarray I",
        "acceptance": "45.0",
        "difficulty": "Easy",
        "displayText": "643. Maximum Average Subarray I"
    },
    "644": {
        "id": "644",
        "name": "Maximum Average Subarray II",
        "acceptance": "37.4",
        "difficulty": "Hard",
        "displayText": "644. Maximum Average Subarray II"
    },
    "645": {
        "id": "645",
        "name": "Set Mismatch",
        "acceptance": "44.9",
        "difficulty": "Easy",
        "displayText": "645. Set Mismatch"
    },
    "646": {
        "id": "646",
        "name": "Maximum Length of Pair Chain",
        "acceptance": "60.7",
        "difficulty": "Medium",
        "displayText": "646. Maximum Length of Pair Chain"
    },
    "647": {
        "id": "647",
        "name": "Palindromic Substrings",
        "acceptance": "71.4",
        "difficulty": "Medium",
        "displayText": "647. Palindromic Substrings"
    },
    "648": {
        "id": "648",
        "name": "Replace Words",
        "acceptance": "68.3",
        "difficulty": "Medium",
        "displayText": "648. Replace Words"
    },
    "649": {
        "id": "649",
        "name": "Dota2 Senate",
        "acceptance": "48.7",
        "difficulty": "Medium",
        "displayText": "649. Dota2 Senate"
    },
    "650": {
        "id": "650",
        "name": "2 Keys Keyboard",
        "acceptance": "59.5",
        "difficulty": "Medium",
        "displayText": "650. 2 Keys Keyboard"
    },
    "651": {
        "id": "651",
        "name": "4 Keys Keyboard",
        "acceptance": "55.9",
        "difficulty": "Medium",
        "displayText": "651. 4 Keys Keyboard"
    },
    "652": {
        "id": "652",
        "name": "Find Duplicate Subtrees",
        "acceptance": "60.0",
        "difficulty": "Medium",
        "displayText": "652. Find Duplicate Subtrees"
    },
    "653": {
        "id": "653",
        "name": "Two Sum IV - Input is a BST",
        "acceptance": "62.0",
        "difficulty": "Easy",
        "displayText": "653. Two Sum IV - Input is a BST"
    },
    "654": {
        "id": "654",
        "name": "Maximum Binary Tree",
        "acceptance": "85.8",
        "difficulty": "Medium",
        "displayText": "654. Maximum Binary Tree"
    },
    "655": {
        "id": "655",
        "name": "Print Binary Tree",
        "acceptance": "65.4",
        "difficulty": "Medium",
        "displayText": "655. Print Binary Tree"
    },
    "656": {
        "id": "656",
        "name": "Coin Path",
        "acceptance": "32.4",
        "difficulty": "Hard",
        "displayText": "656. Coin Path"
    },
    "657": {
        "id": "657",
        "name": "Robot Return to Origin",
        "acceptance": "76.1",
        "difficulty": "Easy",
        "displayText": "657. Robot Return to Origin"
    },
    "658": {
        "id": "658",
        "name": "Find K Closest Elements",
        "acceptance": "48.5",
        "difficulty": "Medium",
        "displayText": "658. Find K Closest Elements"
    },
    "659": {
        "id": "659",
        "name": "Split Array into Consecutive Subsequences",
        "acceptance": "51.4",
        "difficulty": "Medium",
        "displayText": "659. Split Array into Consecutive Subsequences"
    },
    "660": {
        "id": "660",
        "name": "Remove 9",
        "acceptance": "57.3",
        "difficulty": "Hard",
        "displayText": "660. Remove 9"
    },
    "661": {
        "id": "661",
        "name": "Image Smoother",
        "acceptance": "68.2",
        "difficulty": "Easy",
        "displayText": "661. Image Smoother"
    },
    "662": {
        "id": "662",
        "name": "Maximum Width of Binary Tree",
        "acceptance": "43.9",
        "difficulty": "Medium",
        "displayText": "662. Maximum Width of Binary Tree"
    },
    "663": {
        "id": "663",
        "name": "Equal Tree Partition",
        "acceptance": "41.5",
        "difficulty": "Medium",
        "displayText": "663. Equal Tree Partition"
    },
    "664": {
        "id": "664",
        "name": "Strange Printer",
        "acceptance": "60.8",
        "difficulty": "Hard",
        "displayText": "664. Strange Printer"
    },
    "665": {
        "id": "665",
        "name": "Non-decreasing Array",
        "acceptance": "25.0",
        "difficulty": "Medium",
        "displayText": "665. Non-decreasing Array"
    },
    "666": {
        "id": "666",
        "name": "Path Sum IV",
        "acceptance": "62.6",
        "difficulty": "Medium",
        "displayText": "666. Path Sum IV"
    },
    "667": {
        "id": "667",
        "name": "Beautiful Arrangement II",
        "acceptance": "60.3",
        "difficulty": "Medium",
        "displayText": "667. Beautiful Arrangement II"
    },
    "668": {
        "id": "668",
        "name": "Kth Smallest Number in Multiplication Table",
        "acceptance": "52.6",
        "difficulty": "Hard",
        "displayText": "668. Kth Smallest Number in Multiplication Table"
    },
    "669": {
        "id": "669",
        "name": "Trim a Binary Search Tree",
        "acceptance": "66.3",
        "difficulty": "Medium",
        "displayText": "669. Trim a Binary Search Tree"
    },
    "670": {
        "id": "670",
        "name": "Maximum Swap",
        "acceptance": "51.7",
        "difficulty": "Medium",
        "displayText": "670. Maximum Swap"
    },
    "671": {
        "id": "671",
        "name": "Second Minimum Node In a Binary Tree",
        "acceptance": "45.2",
        "difficulty": "Easy",
        "displayText": "671. Second Minimum Node In a Binary Tree"
    },
    "672": {
        "id": "672",
        "name": "Bulb Switcher II",
        "acceptance": "49.4",
        "difficulty": "Medium",
        "displayText": "672. Bulb Switcher II"
    },
    "673": {
        "id": "673",
        "name": "Number of Longest Increasing Subsequence",
        "acceptance": "49.5",
        "difficulty": "Medium",
        "displayText": "673. Number of Longest Increasing Subsequence"
    },
    "674": {
        "id": "674",
        "name": "Longest Continuous Increasing Subsequence",
        "acceptance": "51.0",
        "difficulty": "Easy",
        "displayText": "674. Longest Continuous Increasing Subsequence"
    },
    "675": {
        "id": "675",
        "name": "Cut Off Trees for Golf Event",
        "acceptance": "35.2",
        "difficulty": "Hard",
        "displayText": "675. Cut Off Trees for Golf Event"
    },
    "676": {
        "id": "676",
        "name": "Implement Magic Dictionary",
        "acceptance": "58.0",
        "difficulty": "Medium",
        "displayText": "676. Implement Magic Dictionary"
    },
    "677": {
        "id": "677",
        "name": "Map Sum Pairs",
        "acceptance": "57.0",
        "difficulty": "Medium",
        "displayText": "677. Map Sum Pairs"
    },
    "678": {
        "id": "678",
        "name": "Valid Parenthesis String",
        "acceptance": "38.7",
        "difficulty": "Medium",
        "displayText": "678. Valid Parenthesis String"
    },
    "679": {
        "id": "679",
        "name": "24 Game",
        "acceptance": "49.8",
        "difficulty": "Hard",
        "displayText": "679. 24 Game"
    },
    "680": {
        "id": "680",
        "name": "Valid Palindrome II",
        "acceptance": "42.7",
        "difficulty": "Easy",
        "displayText": "680. Valid Palindrome II"
    },
    "681": {
        "id": "681",
        "name": "Next Closest Time",
        "acceptance": "46.9",
        "difficulty": "Medium",
        "displayText": "681. Next Closest Time"
    },
    "682": {
        "id": "682",
        "name": "Baseball Game",
        "acceptance": "78.5",
        "difficulty": "Easy",
        "displayText": "682. Baseball Game"
    },
    "683": {
        "id": "683",
        "name": "K Empty Slots",
        "acceptance": "37.2",
        "difficulty": "Hard",
        "displayText": "683. K Empty Slots"
    },
    "684": {
        "id": "684",
        "name": "Redundant Connection",
        "acceptance": "66.2",
        "difficulty": "Medium",
        "displayText": "684. Redundant Connection"
    },
    "685": {
        "id": "685",
        "name": "Redundant Connection II",
        "acceptance": "34.9",
        "difficulty": "Hard",
        "displayText": "685. Redundant Connection II"
    },
    "686": {
        "id": "686",
        "name": "Repeated String Match",
        "acceptance": "36.4",
        "difficulty": "Medium",
        "displayText": "686. Repeated String Match"
    },
    "687": {
        "id": "687",
        "name": "Longest Univalue Path",
        "acceptance": "42.4",
        "difficulty": "Medium",
        "displayText": "687. Longest Univalue Path"
    },
    "688": {
        "id": "688",
        "name": "Knight Probability in Chessboard",
        "acceptance": "56.5",
        "difficulty": "Medium",
        "displayText": "688. Knight Probability in Chessboard"
    },
    "689": {
        "id": "689",
        "name": "Maximum Sum of 3 Non-Overlapping Subarrays",
        "acceptance": "59.4",
        "difficulty": "Hard",
        "displayText": "689. Maximum Sum of 3 Non-Overlapping Subarrays"
    },
    "690": {
        "id": "690",
        "name": "Employee Importance",
        "acceptance": "68.2",
        "difficulty": "Medium",
        "displayText": "690. Employee Importance"
    },
    "691": {
        "id": "691",
        "name": "Stickers to Spell Word",
        "acceptance": "49.9",
        "difficulty": "Hard",
        "displayText": "691. Stickers to Spell Word"
    },
    "692": {
        "id": "692",
        "name": "Top K Frequent Words",
        "acceptance": "59.1",
        "difficulty": "Medium",
        "displayText": "692. Top K Frequent Words"
    },
    "693": {
        "id": "693",
        "name": "Binary Number with Alternating Bits",
        "acceptance": "63.4",
        "difficulty": "Easy",
        "displayText": "693. Binary Number with Alternating Bits"
    },
    "694": {
        "id": "694",
        "name": "Number of Distinct Islands",
        "acceptance": "62.1",
        "difficulty": "Medium",
        "displayText": "694. Number of Distinct Islands"
    },
    "695": {
        "id": "695",
        "name": "Max Area of Island",
        "acceptance": "73.0",
        "difficulty": "Medium",
        "displayText": "695. Max Area of Island"
    },
    "696": {
        "id": "696",
        "name": "Count Binary Substrings",
        "acceptance": "65.8",
        "difficulty": "Easy",
        "displayText": "696. Count Binary Substrings"
    },
    "697": {
        "id": "697",
        "name": "Degree of an Array",
        "acceptance": "57.2",
        "difficulty": "Easy",
        "displayText": "697. Degree of an Array"
    },
    "698": {
        "id": "698",
        "name": "Partition to K Equal Sum Subsets",
        "acceptance": "38.1",
        "difficulty": "Medium",
        "displayText": "698. Partition to K Equal Sum Subsets"
    },
    "699": {
        "id": "699",
        "name": "Falling Squares",
        "acceptance": "46.0",
        "difficulty": "Hard",
        "displayText": "699. Falling Squares"
    },
    "700": {
        "id": "700",
        "name": "Search in a Binary Search Tree",
        "acceptance": "81.4",
        "difficulty": "Easy",
        "displayText": "700. Search in a Binary Search Tree"
    },
    "701": {
        "id": "701",
        "name": "Insert into a Binary Search Tree",
        "acceptance": "73.5",
        "difficulty": "Medium",
        "displayText": "701. Insert into a Binary Search Tree"
    },
    "702": {
        "id": "702",
        "name": "Search in a Sorted Array of Unknown Size",
        "acceptance": "72.7",
        "difficulty": "Medium",
        "displayText": "702. Search in a Sorted Array of Unknown Size"
    },
    "703": {
        "id": "703",
        "name": "Kth Largest Element in a Stream",
        "acceptance": "59.8",
        "difficulty": "Easy",
        "displayText": "703. Kth Largest Element in a Stream"
    },
    "704": {
        "id": "704",
        "name": "Binary Search",
        "acceptance": "59.3",
        "difficulty": "Easy",
        "displayText": "704. Binary Search"
    },
    "705": {
        "id": "705",
        "name": "Design HashSet",
        "acceptance": "67.3",
        "difficulty": "Easy",
        "displayText": "705. Design HashSet"
    },
    "706": {
        "id": "706",
        "name": "Design HashMap",
        "acceptance": "65.7",
        "difficulty": "Easy",
        "displayText": "706. Design HashMap"
    },
    "707": {
        "id": "707",
        "name": "Design Linked List",
        "acceptance": "29.0",
        "difficulty": "Medium",
        "displayText": "707. Design Linked List"
    },
    "708": {
        "id": "708",
        "name": "Insert into a Sorted Circular Linked List",
        "acceptance": "37.9",
        "difficulty": "Medium",
        "displayText": "708. Insert into a Sorted Circular Linked List"
    },
    "709": {
        "id": "709",
        "name": "To Lower Case",
        "acceptance": "84.1",
        "difficulty": "Easy",
        "displayText": "709. To Lower Case"
    },
    "710": {
        "id": "710",
        "name": "Random Pick with Blacklist",
        "acceptance": "33.8",
        "difficulty": "Hard",
        "displayText": "710. Random Pick with Blacklist"
    },
    "711": {
        "id": "711",
        "name": "Number of Distinct Islands II",
        "acceptance": "54.5",
        "difficulty": "Hard",
        "displayText": "711. Number of Distinct Islands II"
    },
    "712": {
        "id": "712",
        "name": "Minimum ASCII Delete Sum for Two Strings",
        "acceptance": "65.6",
        "difficulty": "Medium",
        "displayText": "712. Minimum ASCII Delete Sum for Two Strings"
    },
    "713": {
        "id": "713",
        "name": "Subarray Product Less Than K",
        "acceptance": "52.6",
        "difficulty": "Medium",
        "displayText": "713. Subarray Product Less Than K"
    },
    "714": {
        "id": "714",
        "name": "Best Time to Buy and Sell Stock with Transaction Fee",
        "acceptance": "70.1",
        "difficulty": "Medium",
        "displayText": "714. Best Time to Buy and Sell Stock with Transaction Fee"
    },
    "715": {
        "id": "715",
        "name": "Range Module",
        "acceptance": "44.1",
        "difficulty": "Hard",
        "displayText": "715. Range Module"
    },
    "716": {
        "id": "716",
        "name": "Max Stack",
        "acceptance": "45.4",
        "difficulty": "Hard",
        "displayText": "716. Max Stack"
    },
    "717": {
        "id": "717",
        "name": "1-bit and 2-bit Characters",
        "acceptance": "45.1",
        "difficulty": "Easy",
        "displayText": "717. 1-bit and 2-bit Characters"
    },
    "718": {
        "id": "718",
        "name": "Maximum Length of Repeated Subarray",
        "acceptance": "51.0",
        "difficulty": "Medium",
        "displayText": "718. Maximum Length of Repeated Subarray"
    },
    "719": {
        "id": "719",
        "name": "Find K-th Smallest Pair Distance",
        "acceptance": "45.7",
        "difficulty": "Hard",
        "displayText": "719. Find K-th Smallest Pair Distance"
    },
    "720": {
        "id": "720",
        "name": "Longest Word in Dictionary",
        "acceptance": "53.3",
        "difficulty": "Medium",
        "displayText": "720. Longest Word in Dictionary"
    },
    "721": {
        "id": "721",
        "name": "Accounts Merge",
        "acceptance": "59.1",
        "difficulty": "Medium",
        "displayText": "721. Accounts Merge"
    },
    "722": {
        "id": "722",
        "name": "Remove Comments",
        "acceptance": "39.3",
        "difficulty": "Medium",
        "displayText": "722. Remove Comments"
    },
    "723": {
        "id": "723",
        "name": "Candy Crush",
        "acceptance": "77.2",
        "difficulty": "Medium",
        "displayText": "723. Candy Crush"
    },
    "724": {
        "id": "724",
        "name": "Find Pivot Index",
        "acceptance": "60.2",
        "difficulty": "Easy",
        "displayText": "724. Find Pivot Index"
    },
    "725": {
        "id": "725",
        "name": "Split Linked List in Parts",
        "acceptance": "70.1",
        "difficulty": "Medium",
        "displayText": "725. Split Linked List in Parts"
    },
    "726": {
        "id": "726",
        "name": "Number of Atoms",
        "acceptance": "65.0",
        "difficulty": "Hard",
        "displayText": "726. Number of Atoms"
    },
    "727": {
        "id": "727",
        "name": "Minimum Window Subsequence",
        "acceptance": "43.6",
        "difficulty": "Hard",
        "displayText": "727. Minimum Window Subsequence"
    },
    "728": {
        "id": "728",
        "name": "Self Dividing Numbers",
        "acceptance": "79.5",
        "difficulty": "Easy",
        "displayText": "728. Self Dividing Numbers"
    },
    "729": {
        "id": "729",
        "name": "My Calendar I",
        "acceptance": "58.4",
        "difficulty": "Medium",
        "displayText": "729. My Calendar I"
    },
    "730": {
        "id": "730",
        "name": "Count Different Palindromic Subsequences",
        "acceptance": "46.2",
        "difficulty": "Hard",
        "displayText": "730. Count Different Palindromic Subsequences"
    },
    "731": {
        "id": "731",
        "name": "My Calendar II",
        "acceptance": "62.8",
        "difficulty": "Medium",
        "displayText": "731. My Calendar II"
    },
    "732": {
        "id": "732",
        "name": "My Calendar III",
        "acceptance": "72.1",
        "difficulty": "Hard",
        "displayText": "732. My Calendar III"
    },
    "733": {
        "id": "733",
        "name": "Flood Fill",
        "acceptance": "66.1",
        "difficulty": "Easy",
        "displayText": "733. Flood Fill"
    },
    "734": {
        "id": "734",
        "name": "Sentence Similarity",
        "acceptance": "44.6",
        "difficulty": "Easy",
        "displayText": "734. Sentence Similarity"
    },
    "735": {
        "id": "735",
        "name": "Asteroid Collision",
        "acceptance": "45.2",
        "difficulty": "Medium",
        "displayText": "735. Asteroid Collision"
    },
    "736": {
        "id": "736",
        "name": "Parse Lisp Expression",
        "acceptance": "52.4",
        "difficulty": "Hard",
        "displayText": "736. Parse Lisp Expression"
    },
    "737": {
        "id": "737",
        "name": "Sentence Similarity II",
        "acceptance": "50.6",
        "difficulty": "Medium",
        "displayText": "737. Sentence Similarity II"
    },
    "738": {
        "id": "738",
        "name": "Monotone Increasing Digits",
        "acceptance": "48.6",
        "difficulty": "Medium",
        "displayText": "738. Monotone Increasing Digits"
    },
    "739": {
        "id": "739",
        "name": "Daily Temperatures",
        "acceptance": "67.1",
        "difficulty": "Medium",
        "displayText": "739. Daily Temperatures"
    },
    "740": {
        "id": "740",
        "name": "Delete and Earn",
        "acceptance": "56.7",
        "difficulty": "Medium",
        "displayText": "740. Delete and Earn"
    },
    "741": {
        "id": "741",
        "name": "Cherry Pickup",
        "acceptance": "37.7",
        "difficulty": "Hard",
        "displayText": "741. Cherry Pickup"
    },
    "742": {
        "id": "742",
        "name": "Closest Leaf in a Binary Tree",
        "acceptance": "47.0",
        "difficulty": "Medium",
        "displayText": "742. Closest Leaf in a Binary Tree"
    },
    "743": {
        "id": "743",
        "name": "Network Delay Time",
        "acceptance": "56.8",
        "difficulty": "Medium",
        "displayText": "743. Network Delay Time"
    },
    "744": {
        "id": "744",
        "name": "Find Smallest Letter Greater Than Target",
        "acceptance": "53.8",
        "difficulty": "Easy",
        "displayText": "744. Find Smallest Letter Greater Than Target"
    },
    "745": {
        "id": "745",
        "name": "Prefix and Suffix Search",
        "acceptance": "41.2",
        "difficulty": "Hard",
        "displayText": "745. Prefix and Suffix Search"
    },
    "746": {
        "id": "746",
        "name": "Min Cost Climbing Stairs",
        "acceptance": "67.0",
        "difficulty": "Easy",
        "displayText": "746. Min Cost Climbing Stairs"
    },
    "747": {
        "id": "747",
        "name": "Largest Number At Least Twice of Others",
        "acceptance": "50.5",
        "difficulty": "Easy",
        "displayText": "747. Largest Number At Least Twice of Others"
    },
    "748": {
        "id": "748",
        "name": "Shortest Completing Word",
        "acceptance": "61.1",
        "difficulty": "Easy",
        "displayText": "748. Shortest Completing Word"
    },
    "749": {
        "id": "749",
        "name": "Contain Virus",
        "acceptance": "52.3",
        "difficulty": "Hard",
        "displayText": "749. Contain Virus"
    },
    "750": {
        "id": "750",
        "name": "Number Of Corner Rectangles",
        "acceptance": "67.8",
        "difficulty": "Medium",
        "displayText": "750. Number Of Corner Rectangles"
    },
    "751": {
        "id": "751",
        "name": "IP to CIDR",
        "acceptance": "55.3",
        "difficulty": "Medium",
        "displayText": "751. IP to CIDR"
    },
    "752": {
        "id": "752",
        "name": "Open the Lock",
        "acceptance": "60.6",
        "difficulty": "Medium",
        "displayText": "752. Open the Lock"
    },
    "753": {
        "id": "753",
        "name": "Cracking the Safe",
        "acceptance": "57.6",
        "difficulty": "Hard",
        "displayText": "753. Cracking the Safe"
    },
    "754": {
        "id": "754",
        "name": "Reach a Number",
        "acceptance": "43.8",
        "difficulty": "Medium",
        "displayText": "754. Reach a Number"
    },
    "755": {
        "id": "755",
        "name": "Pour Water",
        "acceptance": "47.7",
        "difficulty": "Medium",
        "displayText": "755. Pour Water"
    },
    "756": {
        "id": "756",
        "name": "Pyramid Transition Matrix",
        "acceptance": "52.8",
        "difficulty": "Medium",
        "displayText": "756. Pyramid Transition Matrix"
    },
    "757": {
        "id": "757",
        "name": "Set Intersection Size At Least Two",
        "acceptance": "45.0",
        "difficulty": "Hard",
        "displayText": "757. Set Intersection Size At Least Two"
    },
    "758": {
        "id": "758",
        "name": "Bold Words in String",
        "acceptance": "52.0",
        "difficulty": "Medium",
        "displayText": "758. Bold Words in String"
    },
    "759": {
        "id": "759",
        "name": "Employee Free Time",
        "acceptance": "72.5",
        "difficulty": "Hard",
        "displayText": "759. Employee Free Time"
    },
    "760": {
        "id": "760",
        "name": "Find Anagram Mappings",
        "acceptance": "83.8",
        "difficulty": "Easy",
        "displayText": "760. Find Anagram Mappings"
    },
    "761": {
        "id": "761",
        "name": "Special Binary String",
        "acceptance": "63.2",
        "difficulty": "Hard",
        "displayText": "761. Special Binary String"
    },
    "762": {
        "id": "762",
        "name": "Prime Number of Set Bits in Binary Representation",
        "acceptance": "70.7",
        "difficulty": "Easy",
        "displayText": "762. Prime Number of Set Bits in Binary Representation"
    },
    "763": {
        "id": "763",
        "name": "Partition Labels",
        "acceptance": "81.4",
        "difficulty": "Medium",
        "displayText": "763. Partition Labels"
    },
    "764": {
        "id": "764",
        "name": "Largest Plus Sign",
        "acceptance": "48.5",
        "difficulty": "Medium",
        "displayText": "764. Largest Plus Sign"
    },
    "765": {
        "id": "765",
        "name": "Couples Holding Hands",
        "acceptance": "58.2",
        "difficulty": "Hard",
        "displayText": "765. Couples Holding Hands"
    },
    "766": {
        "id": "766",
        "name": "Toeplitz Matrix",
        "acceptance": "69.5",
        "difficulty": "Easy",
        "displayText": "766. Toeplitz Matrix"
    },
    "767": {
        "id": "767",
        "name": "Reorganize String",
        "acceptance": "56.0",
        "difficulty": "Medium",
        "displayText": "767. Reorganize String"
    },
    "768": {
        "id": "768",
        "name": "Max Chunks To Make Sorted II",
        "acceptance": "54.0",
        "difficulty": "Hard",
        "displayText": "768. Max Chunks To Make Sorted II"
    },
    "769": {
        "id": "769",
        "name": "Max Chunks To Make Sorted",
        "acceptance": "64.0",
        "difficulty": "Medium",
        "displayText": "769. Max Chunks To Make Sorted"
    },
    "770": {
        "id": "770",
        "name": "Basic Calculator IV",
        "acceptance": "54.6",
        "difficulty": "Hard",
        "displayText": "770. Basic Calculator IV"
    },
    "771": {
        "id": "771",
        "name": "Jewels and Stones",
        "acceptance": "89.1",
        "difficulty": "Easy",
        "displayText": "771. Jewels and Stones"
    },
    "772": {
        "id": "772",
        "name": "Basic Calculator III",
        "acceptance": "52.2",
        "difficulty": "Hard",
        "displayText": "772. Basic Calculator III"
    },
    "773": {
        "id": "773",
        "name": "Sliding Puzzle",
        "acceptance": "73.0",
        "difficulty": "Hard",
        "displayText": "773. Sliding Puzzle"
    },
    "774": {
        "id": "774",
        "name": "Minimize Max Distance to Gas Station",
        "acceptance": "52.9",
        "difficulty": "Hard",
        "displayText": "774. Minimize Max Distance to Gas Station"
    },
    "775": {
        "id": "775",
        "name": "Global and Local Inversions",
        "acceptance": "42.3",
        "difficulty": "Medium",
        "displayText": "775. Global and Local Inversions"
    },
    "776": {
        "id": "776",
        "name": "Split BST",
        "acceptance": "82.4",
        "difficulty": "Medium",
        "displayText": "776. Split BST"
    },
    "777": {
        "id": "777",
        "name": "Swap Adjacent in LR String",
        "acceptance": "37.4",
        "difficulty": "Medium",
        "displayText": "777. Swap Adjacent in LR String"
    },
    "778": {
        "id": "778",
        "name": "Swim in Rising Water",
        "acceptance": "62.4",
        "difficulty": "Hard",
        "displayText": "778. Swim in Rising Water"
    },
    "779": {
        "id": "779",
        "name": "K-th Symbol in Grammar",
        "acceptance": "47.2",
        "difficulty": "Medium",
        "displayText": "779. K-th Symbol in Grammar"
    },
    "780": {
        "id": "780",
        "name": "Reaching Points",
        "acceptance": "33.5",
        "difficulty": "Hard",
        "displayText": "780. Reaching Points"
    },
    "781": {
        "id": "781",
        "name": "Rabbits in Forest",
        "acceptance": "52.7",
        "difficulty": "Medium",
        "displayText": "781. Rabbits in Forest"
    },
    "782": {
        "id": "782",
        "name": "Transform to Chessboard",
        "acceptance": "50.4",
        "difficulty": "Hard",
        "displayText": "782. Transform to Chessboard"
    },
    "783": {
        "id": "783",
        "name": "Minimum Distance Between BST Nodes",
        "acceptance": "60.2",
        "difficulty": "Easy",
        "displayText": "783. Minimum Distance Between BST Nodes"
    },
    "784": {
        "id": "784",
        "name": "Letter Case Permutation",
        "acceptance": "74.9",
        "difficulty": "Medium",
        "displayText": "784. Letter Case Permutation"
    },
    "785": {
        "id": "785",
        "name": "Is Graph Bipartite?",
        "acceptance": "57.4",
        "difficulty": "Medium",
        "displayText": "785. Is Graph Bipartite?"
    },
    "786": {
        "id": "786",
        "name": "K-th Smallest Prime Fraction",
        "acceptance": "68.4",
        "difficulty": "Medium",
        "displayText": "786. K-th Smallest Prime Fraction"
    },
    "787": {
        "id": "787",
        "name": "Cheapest Flights Within K Stops",
        "acceptance": "40.2",
        "difficulty": "Medium",
        "displayText": "787. Cheapest Flights Within K Stops"
    },
    "788": {
        "id": "788",
        "name": "Rotated Digits",
        "acceptance": "56.4",
        "difficulty": "Medium",
        "displayText": "788. Rotated Digits"
    },
    "789": {
        "id": "789",
        "name": "Escape The Ghosts",
        "acceptance": "62.5",
        "difficulty": "Medium",
        "displayText": "789. Escape The Ghosts"
    },
    "790": {
        "id": "790",
        "name": "Domino and Tromino Tiling",
        "acceptance": "48.5",
        "difficulty": "Medium",
        "displayText": "790. Domino and Tromino Tiling"
    },
    "791": {
        "id": "791",
        "name": "Custom Sort String",
        "acceptance": "71.8",
        "difficulty": "Medium",
        "displayText": "791. Custom Sort String"
    },
    "792": {
        "id": "792",
        "name": "Number of Matching Subsequences",
        "acceptance": "50.7",
        "difficulty": "Medium",
        "displayText": "792. Number of Matching Subsequences"
    },
    "793": {
        "id": "793",
        "name": "Preimage Size of Factorial Zeroes Function",
        "acceptance": "45.5",
        "difficulty": "Hard",
        "displayText": "793. Preimage Size of Factorial Zeroes Function"
    },
    "794": {
        "id": "794",
        "name": "Valid Tic-Tac-Toe State",
        "acceptance": "34.6",
        "difficulty": "Medium",
        "displayText": "794. Valid Tic-Tac-Toe State"
    },
    "795": {
        "id": "795",
        "name": "Number of Subarrays with Bounded Maximum",
        "acceptance": "53.6",
        "difficulty": "Medium",
        "displayText": "795. Number of Subarrays with Bounded Maximum"
    },
    "796": {
        "id": "796",
        "name": "Rotate String",
        "acceptance": "63.7",
        "difficulty": "Easy",
        "displayText": "796. Rotate String"
    },
    "797": {
        "id": "797",
        "name": "All Paths From Source to Target",
        "acceptance": "83.0",
        "difficulty": "Medium",
        "displayText": "797. All Paths From Source to Target"
    },
    "798": {
        "id": "798",
        "name": "Smallest Rotation with Highest Score",
        "acceptance": "51.9",
        "difficulty": "Hard",
        "displayText": "798. Smallest Rotation with Highest Score"
    },
    "799": {
        "id": "799",
        "name": "Champagne Tower",
        "acceptance": "58.2",
        "difficulty": "Medium",
        "displayText": "799. Champagne Tower"
    },
    "800": {
        "id": "800",
        "name": "Similar RGB Color",
        "acceptance": "67.8",
        "difficulty": "Easy",
        "displayText": "800. Similar RGB Color"
    },
    "801": {
        "id": "801",
        "name": "Minimum Swaps To Make Sequences Increasing",
        "acceptance": "40.6",
        "difficulty": "Hard",
        "displayText": "801. Minimum Swaps To Make Sequences Increasing"
    },
    "802": {
        "id": "802",
        "name": "Find Eventual Safe States",
        "acceptance": "68.2",
        "difficulty": "Medium",
        "displayText": "802. Find Eventual Safe States"
    },
    "803": {
        "id": "803",
        "name": "Bricks Falling When Hit",
        "acceptance": "35.4",
        "difficulty": "Hard",
        "displayText": "803. Bricks Falling When Hit"
    },
    "804": {
        "id": "804",
        "name": "Unique Morse Code Words",
        "acceptance": "83.2",
        "difficulty": "Easy",
        "displayText": "804. Unique Morse Code Words"
    },
    "805": {
        "id": "805",
        "name": "Split Array With Same Average",
        "acceptance": "25.9",
        "difficulty": "Hard",
        "displayText": "805. Split Array With Same Average"
    },
    "806": {
        "id": "806",
        "name": "Number of Lines To Write String",
        "acceptance": "70.4",
        "difficulty": "Easy",
        "displayText": "806. Number of Lines To Write String"
    },
    "807": {
        "id": "807",
        "name": "Max Increase to Keep City Skyline",
        "acceptance": "86.2",
        "difficulty": "Medium",
        "displayText": "807. Max Increase to Keep City Skyline"
    },
    "808": {
        "id": "808",
        "name": "Soup Servings",
        "acceptance": "53.3",
        "difficulty": "Medium",
        "displayText": "808. Soup Servings"
    },
    "809": {
        "id": "809",
        "name": "Expressive Words",
        "acceptance": "46.3",
        "difficulty": "Medium",
        "displayText": "809. Expressive Words"
    },
    "810": {
        "id": "810",
        "name": "Chalkboard XOR Game",
        "acceptance": "62.4",
        "difficulty": "Hard",
        "displayText": "810. Chalkboard XOR Game"
    },
    "811": {
        "id": "811",
        "name": "Subdomain Visit Count",
        "acceptance": "76.8",
        "difficulty": "Medium",
        "displayText": "811. Subdomain Visit Count"
    },
    "812": {
        "id": "812",
        "name": "Largest Triangle Area",
        "acceptance": "61.8",
        "difficulty": "Easy",
        "displayText": "812. Largest Triangle Area"
    },
    "813": {
        "id": "813",
        "name": "Largest Sum of Averages",
        "acceptance": "53.9",
        "difficulty": "Medium",
        "displayText": "813. Largest Sum of Averages"
    },
    "814": {
        "id": "814",
        "name": "Binary Tree Pruning",
        "acceptance": "72.3",
        "difficulty": "Medium",
        "displayText": "814. Binary Tree Pruning"
    },
    "815": {
        "id": "815",
        "name": "Bus Routes",
        "acceptance": "47.0",
        "difficulty": "Hard",
        "displayText": "815. Bus Routes"
    },
    "816": {
        "id": "816",
        "name": "Ambiguous Coordinates",
        "acceptance": "55.8",
        "difficulty": "Medium",
        "displayText": "816. Ambiguous Coordinates"
    },
    "817": {
        "id": "817",
        "name": "Linked List Components",
        "acceptance": "57.1",
        "difficulty": "Medium",
        "displayText": "817. Linked List Components"
    },
    "818": {
        "id": "818",
        "name": "Race Car",
        "acceptance": "44.0",
        "difficulty": "Hard",
        "displayText": "818. Race Car"
    },
    "819": {
        "id": "819",
        "name": "Most Common Word",
        "acceptance": "44.5",
        "difficulty": "Easy",
        "displayText": "819. Most Common Word"
    },
    "820": {
        "id": "820",
        "name": "Short Encoding of Words",
        "acceptance": "60.5",
        "difficulty": "Medium",
        "displayText": "820. Short Encoding of Words"
    },
    "821": {
        "id": "821",
        "name": "Shortest Distance to a Character",
        "acceptance": "72.1",
        "difficulty": "Easy",
        "displayText": "821. Shortest Distance to a Character"
    },
    "822": {
        "id": "822",
        "name": "Card Flipping Game",
        "acceptance": "48.1",
        "difficulty": "Medium",
        "displayText": "822. Card Flipping Game"
    },
    "823": {
        "id": "823",
        "name": "Binary Trees With Factors",
        "acceptance": "52.9",
        "difficulty": "Medium",
        "displayText": "823. Binary Trees With Factors"
    },
    "824": {
        "id": "824",
        "name": "Goat Latin",
        "acceptance": "69.2",
        "difficulty": "Easy",
        "displayText": "824. Goat Latin"
    },
    "825": {
        "id": "825",
        "name": "Friends Of Appropriate Ages",
        "acceptance": "48.9",
        "difficulty": "Medium",
        "displayText": "825. Friends Of Appropriate Ages"
    },
    "826": {
        "id": "826",
        "name": "Most Profit Assigning Work",
        "acceptance": "55.9",
        "difficulty": "Medium",
        "displayText": "826. Most Profit Assigning Work"
    },
    "827": {
        "id": "827",
        "name": "Making A Large Island",
        "acceptance": "54.4",
        "difficulty": "Hard",
        "displayText": "827. Making A Large Island"
    },
    "828": {
        "id": "828",
        "name": "Count Unique Characters of All Substrings of a Given String",
        "acceptance": "52.7",
        "difficulty": "Hard",
        "displayText": "828. Count Unique Characters of All Substrings of a Given String"
    },
    "829": {
        "id": "829",
        "name": "Consecutive Numbers Sum",
        "acceptance": "41.9",
        "difficulty": "Hard",
        "displayText": "829. Consecutive Numbers Sum"
    },
    "830": {
        "id": "830",
        "name": "Positions of Large Groups",
        "acceptance": "52.8",
        "difficulty": "Easy",
        "displayText": "830. Positions of Large Groups"
    },
    "831": {
        "id": "831",
        "name": "Masking Personal Information",
        "acceptance": "50.3",
        "difficulty": "Medium",
        "displayText": "831. Masking Personal Information"
    },
    "832": {
        "id": "832",
        "name": "Flipping an Image",
        "acceptance": "82.8",
        "difficulty": "Easy",
        "displayText": "832. Flipping an Image"
    },
    "833": {
        "id": "833",
        "name": "Find And Replace in String",
        "acceptance": "51.4",
        "difficulty": "Medium",
        "displayText": "833. Find And Replace in String"
    },
    "834": {
        "id": "834",
        "name": "Sum of Distances in Tree",
        "acceptance": "65.3",
        "difficulty": "Hard",
        "displayText": "834. Sum of Distances in Tree"
    },
    "835": {
        "id": "835",
        "name": "Image Overlap",
        "acceptance": "63.7",
        "difficulty": "Medium",
        "displayText": "835. Image Overlap"
    },
    "836": {
        "id": "836",
        "name": "Rectangle Overlap",
        "acceptance": "45.6",
        "difficulty": "Easy",
        "displayText": "836. Rectangle Overlap"
    },
    "837": {
        "id": "837",
        "name": "New 21 Game",
        "acceptance": "44.8",
        "difficulty": "Medium",
        "displayText": "837. New 21 Game"
    },
    "838": {
        "id": "838",
        "name": "Push Dominoes",
        "acceptance": "57.4",
        "difficulty": "Medium",
        "displayText": "838. Push Dominoes"
    },
    "839": {
        "id": "839",
        "name": "Similar String Groups",
        "acceptance": "55.2",
        "difficulty": "Hard",
        "displayText": "839. Similar String Groups"
    },
    "840": {
        "id": "840",
        "name": "Magic Squares In Grid",
        "acceptance": "51.5",
        "difficulty": "Medium",
        "displayText": "840. Magic Squares In Grid"
    },
    "841": {
        "id": "841",
        "name": "Keys and Rooms",
        "acceptance": "74.4",
        "difficulty": "Medium",
        "displayText": "841. Keys and Rooms"
    },
    "842": {
        "id": "842",
        "name": "Split Array into Fibonacci Sequence",
        "acceptance": "39.6",
        "difficulty": "Medium",
        "displayText": "842. Split Array into Fibonacci Sequence"
    },
    "843": {
        "id": "843",
        "name": "Guess the Word",
        "acceptance": "37.9",
        "difficulty": "Hard",
        "displayText": "843. Guess the Word"
    },
    "844": {
        "id": "844",
        "name": "Backspace String Compare",
        "acceptance": "49.4",
        "difficulty": "Easy",
        "displayText": "844. Backspace String Compare"
    },
    "845": {
        "id": "845",
        "name": "Longest Mountain in Array",
        "acceptance": "41.0",
        "difficulty": "Medium",
        "displayText": "845. Longest Mountain in Array"
    },
    "846": {
        "id": "846",
        "name": "Hand of Straights",
        "acceptance": "56.9",
        "difficulty": "Medium",
        "displayText": "846. Hand of Straights"
    },
    "847": {
        "id": "847",
        "name": "Shortest Path Visiting All Nodes",
        "acceptance": "65.4",
        "difficulty": "Hard",
        "displayText": "847. Shortest Path Visiting All Nodes"
    },
    "848": {
        "id": "848",
        "name": "Shifting Letters",
        "acceptance": "45.4",
        "difficulty": "Medium",
        "displayText": "848. Shifting Letters"
    },
    "849": {
        "id": "849",
        "name": "Maximize Distance to Closest Person",
        "acceptance": "48.8",
        "difficulty": "Medium",
        "displayText": "849. Maximize Distance to Closest Person"
    },
    "850": {
        "id": "850",
        "name": "Rectangle Area II",
        "acceptance": "54.5",
        "difficulty": "Hard",
        "displayText": "850. Rectangle Area II"
    },
    "851": {
        "id": "851",
        "name": "Loud and Rich",
        "acceptance": "61.1",
        "difficulty": "Medium",
        "displayText": "851. Loud and Rich"
    },
    "852": {
        "id": "852",
        "name": "Peak Index in a Mountain Array",
        "acceptance": "67.7",
        "difficulty": "Medium",
        "displayText": "852. Peak Index in a Mountain Array"
    },
    "853": {
        "id": "853",
        "name": "Car Fleet",
        "acceptance": "53.2",
        "difficulty": "Medium",
        "displayText": "853. Car Fleet"
    },
    "854": {
        "id": "854",
        "name": "K-Similar Strings",
        "acceptance": "40.0",
        "difficulty": "Hard",
        "displayText": "854. K-Similar Strings"
    },
    "855": {
        "id": "855",
        "name": "Exam Room",
        "acceptance": "43.6",
        "difficulty": "Medium",
        "displayText": "855. Exam Room"
    },
    "856": {
        "id": "856",
        "name": "Score of Parentheses",
        "acceptance": "63.8",
        "difficulty": "Medium",
        "displayText": "856. Score of Parentheses"
    },
    "857": {
        "id": "857",
        "name": "Minimum Cost to Hire K Workers",
        "acceptance": "63.4",
        "difficulty": "Hard",
        "displayText": "857. Minimum Cost to Hire K Workers"
    },
    "858": {
        "id": "858",
        "name": "Mirror Reflection",
        "acceptance": "62.0",
        "difficulty": "Medium",
        "displayText": "858. Mirror Reflection"
    },
    "859": {
        "id": "859",
        "name": "Buddy Strings",
        "acceptance": "33.6",
        "difficulty": "Easy",
        "displayText": "859. Buddy Strings"
    },
    "860": {
        "id": "860",
        "name": "Lemonade Change",
        "acceptance": "58.3",
        "difficulty": "Easy",
        "displayText": "860. Lemonade Change"
    },
    "861": {
        "id": "861",
        "name": "Score After Flipping Matrix",
        "acceptance": "80.2",
        "difficulty": "Medium",
        "displayText": "861. Score After Flipping Matrix"
    },
    "862": {
        "id": "862",
        "name": "Shortest Subarray with Sum at Least K",
        "acceptance": "32.2",
        "difficulty": "Hard",
        "displayText": "862. Shortest Subarray with Sum at Least K"
    },
    "863": {
        "id": "863",
        "name": "All Nodes Distance K in Binary Tree",
        "acceptance": "66.1",
        "difficulty": "Medium",
        "displayText": "863. All Nodes Distance K in Binary Tree"
    },
    "864": {
        "id": "864",
        "name": "Shortest Path to Get All Keys",
        "acceptance": "53.6",
        "difficulty": "Hard",
        "displayText": "864. Shortest Path to Get All Keys"
    },
    "865": {
        "id": "865",
        "name": "Smallest Subtree with all the Deepest Nodes",
        "acceptance": "72.3",
        "difficulty": "Medium",
        "displayText": "865. Smallest Subtree with all the Deepest Nodes"
    },
    "866": {
        "id": "866",
        "name": "Prime Palindrome",
        "acceptance": "26.7",
        "difficulty": "Medium",
        "displayText": "866. Prime Palindrome"
    },
    "867": {
        "id": "867",
        "name": "Transpose Matrix",
        "acceptance": "73.9",
        "difficulty": "Easy",
        "displayText": "867. Transpose Matrix"
    },
    "868": {
        "id": "868",
        "name": "Binary Gap",
        "acceptance": "64.3",
        "difficulty": "Easy",
        "displayText": "868. Binary Gap"
    },
    "869": {
        "id": "869",
        "name": "Reordered Power of 2",
        "acceptance": "62.2",
        "difficulty": "Medium",
        "displayText": "869. Reordered Power of 2"
    },
    "870": {
        "id": "870",
        "name": "Advantage Shuffle",
        "acceptance": "53.2",
        "difficulty": "Medium",
        "displayText": "870. Advantage Shuffle"
    },
    "871": {
        "id": "871",
        "name": "Minimum Number of Refueling Stops",
        "acceptance": "40.5",
        "difficulty": "Hard",
        "displayText": "871. Minimum Number of Refueling Stops"
    },
    "872": {
        "id": "872",
        "name": "Leaf-Similar Trees",
        "acceptance": "70.1",
        "difficulty": "Easy",
        "displayText": "872. Leaf-Similar Trees"
    },
    "873": {
        "id": "873",
        "name": "Length of Longest Fibonacci Subsequence",
        "acceptance": "57.6",
        "difficulty": "Medium",
        "displayText": "873. Length of Longest Fibonacci Subsequence"
    },
    "874": {
        "id": "874",
        "name": "Walking Robot Simulation",
        "acceptance": "58.2",
        "difficulty": "Medium",
        "displayText": "874. Walking Robot Simulation"
    },
    "875": {
        "id": "875",
        "name": "Koko Eating Bananas",
        "acceptance": "49.0",
        "difficulty": "Medium",
        "displayText": "875. Koko Eating Bananas"
    },
    "876": {
        "id": "876",
        "name": "Middle of the Linked List",
        "acceptance": "80.3",
        "difficulty": "Easy",
        "displayText": "876. Middle of the Linked List"
    },
    "877": {
        "id": "877",
        "name": "Stone Game",
        "acceptance": "71.5",
        "difficulty": "Medium",
        "displayText": "877. Stone Game"
    },
    "878": {
        "id": "878",
        "name": "Nth Magical Number",
        "acceptance": "35.7",
        "difficulty": "Hard",
        "displayText": "878. Nth Magical Number"
    },
    "879": {
        "id": "879",
        "name": "Profitable Schemes",
        "acceptance": "48.0",
        "difficulty": "Hard",
        "displayText": "879. Profitable Schemes"
    },
    "880": {
        "id": "880",
        "name": "Decoded String at Index",
        "acceptance": "36.6",
        "difficulty": "Medium",
        "displayText": "880. Decoded String at Index"
    },
    "881": {
        "id": "881",
        "name": "Boats to Save People",
        "acceptance": "60.0",
        "difficulty": "Medium",
        "displayText": "881. Boats to Save People"
    },
    "882": {
        "id": "882",
        "name": "Reachable Nodes In Subdivided Graph",
        "acceptance": "50.7",
        "difficulty": "Hard",
        "displayText": "882. Reachable Nodes In Subdivided Graph"
    },
    "883": {
        "id": "883",
        "name": "Projection Area of 3D Shapes",
        "acceptance": "73.9",
        "difficulty": "Easy",
        "displayText": "883. Projection Area of 3D Shapes"
    },
    "884": {
        "id": "884",
        "name": "Uncommon Words from Two Sentences",
        "acceptance": "75.3",
        "difficulty": "Easy",
        "displayText": "884. Uncommon Words from Two Sentences"
    },
    "885": {
        "id": "885",
        "name": "Spiral Matrix III",
        "acceptance": "84.5",
        "difficulty": "Medium",
        "displayText": "885. Spiral Matrix III"
    },
    "886": {
        "id": "886",
        "name": "Possible Bipartition",
        "acceptance": "51.3",
        "difficulty": "Medium",
        "displayText": "886. Possible Bipartition"
    },
    "887": {
        "id": "887",
        "name": "Super Egg Drop",
        "acceptance": "28.5",
        "difficulty": "Hard",
        "displayText": "887. Super Egg Drop"
    },
    "888": {
        "id": "888",
        "name": "Fair Candy Swap",
        "acceptance": "63.0",
        "difficulty": "Easy",
        "displayText": "888. Fair Candy Swap"
    },
    "889": {
        "id": "889",
        "name": "Construct Binary Tree from Preorder and Postorder Traversal",
        "acceptance": "78.0",
        "difficulty": "Medium",
        "displayText": "889. Construct Binary Tree from Preorder and Postorder Traversal"
    },
    "890": {
        "id": "890",
        "name": "Find and Replace Pattern",
        "acceptance": "76.8",
        "difficulty": "Medium",
        "displayText": "890. Find and Replace Pattern"
    },
    "891": {
        "id": "891",
        "name": "Sum of Subsequence Widths",
        "acceptance": "38.7",
        "difficulty": "Hard",
        "displayText": "891. Sum of Subsequence Widths"
    },
    "892": {
        "id": "892",
        "name": "Surface Area of 3D Shapes",
        "acceptance": "67.7",
        "difficulty": "Easy",
        "displayText": "892. Surface Area of 3D Shapes"
    },
    "893": {
        "id": "893",
        "name": "Groups of Special-Equivalent Strings",
        "acceptance": "72.6",
        "difficulty": "Medium",
        "displayText": "893. Groups of Special-Equivalent Strings"
    },
    "894": {
        "id": "894",
        "name": "All Possible Full Binary Trees",
        "acceptance": "82.7",
        "difficulty": "Medium",
        "displayText": "894. All Possible Full Binary Trees"
    },
    "895": {
        "id": "895",
        "name": "Maximum Frequency Stack",
        "acceptance": "66.8",
        "difficulty": "Hard",
        "displayText": "895. Maximum Frequency Stack"
    },
    "896": {
        "id": "896",
        "name": "Monotonic Array",
        "acceptance": "61.6",
        "difficulty": "Easy",
        "displayText": "896. Monotonic Array"
    },
    "897": {
        "id": "897",
        "name": "Increasing Order Search Tree",
        "acceptance": "78.6",
        "difficulty": "Easy",
        "displayText": "897. Increasing Order Search Tree"
    },
    "898": {
        "id": "898",
        "name": "Bitwise ORs of Subarrays",
        "acceptance": "40.5",
        "difficulty": "Medium",
        "displayText": "898. Bitwise ORs of Subarrays"
    },
    "899": {
        "id": "899",
        "name": "Orderly Queue",
        "acceptance": "66.1",
        "difficulty": "Hard",
        "displayText": "899. Orderly Queue"
    },
    "900": {
        "id": "900",
        "name": "RLE Iterator",
        "acceptance": "59.8",
        "difficulty": "Medium",
        "displayText": "900. RLE Iterator"
    },
    "901": {
        "id": "901",
        "name": "Online Stock Span",
        "acceptance": "67.4",
        "difficulty": "Medium",
        "displayText": "901. Online Stock Span"
    },
    "902": {
        "id": "902",
        "name": "Numbers At Most N Given Digit Set",
        "acceptance": "43.2",
        "difficulty": "Hard",
        "displayText": "902. Numbers At Most N Given Digit Set"
    },
    "903": {
        "id": "903",
        "name": "Valid Permutations for DI Sequence",
        "acceptance": "56.7",
        "difficulty": "Hard",
        "displayText": "903. Valid Permutations for DI Sequence"
    },
    "904": {
        "id": "904",
        "name": "Fruit Into Baskets",
        "acceptance": "45.9",
        "difficulty": "Medium",
        "displayText": "904. Fruit Into Baskets"
    },
    "905": {
        "id": "905",
        "name": "Sort Array By Parity",
        "acceptance": "76.3",
        "difficulty": "Easy",
        "displayText": "905. Sort Array By Parity"
    },
    "906": {
        "id": "906",
        "name": "Super Palindromes",
        "acceptance": "39.2",
        "difficulty": "Hard",
        "displayText": "906. Super Palindromes"
    },
    "907": {
        "id": "907",
        "name": "Sum of Subarray Minimums",
        "acceptance": "37.4",
        "difficulty": "Medium",
        "displayText": "907. Sum of Subarray Minimums"
    },
    "908": {
        "id": "908",
        "name": "Smallest Range I",
        "acceptance": "71.6",
        "difficulty": "Easy",
        "displayText": "908. Smallest Range I"
    },
    "909": {
        "id": "909",
        "name": "Snakes and Ladders",
        "acceptance": "44.1",
        "difficulty": "Medium",
        "displayText": "909. Snakes and Ladders"
    },
    "910": {
        "id": "910",
        "name": "Smallest Range II",
        "acceptance": "37.0",
        "difficulty": "Medium",
        "displayText": "910. Smallest Range II"
    },
    "911": {
        "id": "911",
        "name": "Online Election",
        "acceptance": "52.5",
        "difficulty": "Medium",
        "displayText": "911. Online Election"
    },
    "912": {
        "id": "912",
        "name": "Sort an Array",
        "acceptance": "56.9",
        "difficulty": "Medium",
        "displayText": "912. Sort an Array"
    },
    "913": {
        "id": "913",
        "name": "Cat and Mouse",
        "acceptance": "34.0",
        "difficulty": "Hard",
        "displayText": "913. Cat and Mouse"
    },
    "914": {
        "id": "914",
        "name": "X of a Kind in a Deck of Cards",
        "acceptance": "29.8",
        "difficulty": "Easy",
        "displayText": "914. X of a Kind in a Deck of Cards"
    },
    "915": {
        "id": "915",
        "name": "Partition Array into Disjoint Intervals",
        "acceptance": "49.0",
        "difficulty": "Medium",
        "displayText": "915. Partition Array into Disjoint Intervals"
    },
    "916": {
        "id": "916",
        "name": "Word Subsets",
        "acceptance": "55.7",
        "difficulty": "Medium",
        "displayText": "916. Word Subsets"
    },
    "917": {
        "id": "917",
        "name": "Reverse Only Letters",
        "acceptance": "66.6",
        "difficulty": "Easy",
        "displayText": "917. Reverse Only Letters"
    },
    "918": {
        "id": "918",
        "name": "Maximum Sum Circular Subarray",
        "acceptance": "47.2",
        "difficulty": "Medium",
        "displayText": "918. Maximum Sum Circular Subarray"
    },
    "919": {
        "id": "919",
        "name": "Complete Binary Tree Inserter",
        "acceptance": "66.3",
        "difficulty": "Medium",
        "displayText": "919. Complete Binary Tree Inserter"
    },
    "920": {
        "id": "920",
        "name": "Number of Music Playlists",
        "acceptance": "60.0",
        "difficulty": "Hard",
        "displayText": "920. Number of Music Playlists"
    },
    "921": {
        "id": "921",
        "name": "Minimum Add to Make Parentheses Valid",
        "acceptance": "74.7",
        "difficulty": "Medium",
        "displayText": "921. Minimum Add to Make Parentheses Valid"
    },
    "922": {
        "id": "922",
        "name": "Sort Array By Parity II",
        "acceptance": "71.0",
        "difficulty": "Easy",
        "displayText": "922. Sort Array By Parity II"
    },
    "923": {
        "id": "923",
        "name": "3Sum With Multiplicity",
        "acceptance": "45.7",
        "difficulty": "Medium",
        "displayText": "923. 3Sum With Multiplicity"
    },
    "924": {
        "id": "924",
        "name": "Minimize Malware Spread",
        "acceptance": "42.2",
        "difficulty": "Hard",
        "displayText": "924. Minimize Malware Spread"
    },
    "925": {
        "id": "925",
        "name": "Long Pressed Name",
        "acceptance": "32.4",
        "difficulty": "Easy",
        "displayText": "925. Long Pressed Name"
    },
    "926": {
        "id": "926",
        "name": "Flip String to Monotone Increasing",
        "acceptance": "61.6",
        "difficulty": "Medium",
        "displayText": "926. Flip String to Monotone Increasing"
    },
    "927": {
        "id": "927",
        "name": "Three Equal Parts",
        "acceptance": "40.6",
        "difficulty": "Hard",
        "displayText": "927. Three Equal Parts"
    },
    "928": {
        "id": "928",
        "name": "Minimize Malware Spread II",
        "acceptance": "44.4",
        "difficulty": "Hard",
        "displayText": "928. Minimize Malware Spread II"
    },
    "929": {
        "id": "929",
        "name": "Unique Email Addresses",
        "acceptance": "67.5",
        "difficulty": "Easy",
        "displayText": "929. Unique Email Addresses"
    },
    "930": {
        "id": "930",
        "name": "Binary Subarrays With Sum",
        "acceptance": "65.4",
        "difficulty": "Medium",
        "displayText": "930. Binary Subarrays With Sum"
    },
    "931": {
        "id": "931",
        "name": "Minimum Falling Path Sum",
        "acceptance": "61.8",
        "difficulty": "Medium",
        "displayText": "931. Minimum Falling Path Sum"
    },
    "932": {
        "id": "932",
        "name": "Beautiful Array",
        "acceptance": "66.8",
        "difficulty": "Medium",
        "displayText": "932. Beautiful Array"
    },
    "933": {
        "id": "933",
        "name": "Number of Recent Calls",
        "acceptance": "77.3",
        "difficulty": "Easy",
        "displayText": "933. Number of Recent Calls"
    },
    "934": {
        "id": "934",
        "name": "Shortest Bridge",
        "acceptance": "58.4",
        "difficulty": "Medium",
        "displayText": "934. Shortest Bridge"
    },
    "935": {
        "id": "935",
        "name": "Knight Dialer",
        "acceptance": "61.0",
        "difficulty": "Medium",
        "displayText": "935. Knight Dialer"
    },
    "936": {
        "id": "936",
        "name": "Stamping The Sequence",
        "acceptance": "61.9",
        "difficulty": "Hard",
        "displayText": "936. Stamping The Sequence"
    },
    "937": {
        "id": "937",
        "name": "Reorder Data in Log Files",
        "acceptance": "56.7",
        "difficulty": "Medium",
        "displayText": "937. Reorder Data in Log Files"
    },
    "938": {
        "id": "938",
        "name": "Range Sum of BST",
        "acceptance": "87.4",
        "difficulty": "Easy",
        "displayText": "938. Range Sum of BST"
    },
    "939": {
        "id": "939",
        "name": "Minimum Area Rectangle",
        "acceptance": "54.9",
        "difficulty": "Medium",
        "displayText": "939. Minimum Area Rectangle"
    },
    "940": {
        "id": "940",
        "name": "Distinct Subsequences II",
        "acceptance": "43.5",
        "difficulty": "Hard",
        "displayText": "940. Distinct Subsequences II"
    },
    "941": {
        "id": "941",
        "name": "Valid Mountain Array",
        "acceptance": "33.9",
        "difficulty": "Easy",
        "displayText": "941. Valid Mountain Array"
    },
    "942": {
        "id": "942",
        "name": "DI String Match",
        "acceptance": "79.8",
        "difficulty": "Easy",
        "displayText": "942. DI String Match"
    },
    "943": {
        "id": "943",
        "name": "Find the Shortest Superstring",
        "acceptance": "44.1",
        "difficulty": "Hard",
        "displayText": "943. Find the Shortest Superstring"
    },
    "944": {
        "id": "944",
        "name": "Delete Columns to Make Sorted",
        "acceptance": "74.7",
        "difficulty": "Easy",
        "displayText": "944. Delete Columns to Make Sorted"
    },
    "945": {
        "id": "945",
        "name": "Minimum Increment to Make Array Unique",
        "acceptance": "60.3",
        "difficulty": "Medium",
        "displayText": "945. Minimum Increment to Make Array Unique"
    },
    "946": {
        "id": "946",
        "name": "Validate Stack Sequences",
        "acceptance": "69.6",
        "difficulty": "Medium",
        "displayText": "946. Validate Stack Sequences"
    },
    "947": {
        "id": "947",
        "name": "Most Stones Removed with Same Row or Column",
        "acceptance": "62.1",
        "difficulty": "Medium",
        "displayText": "947. Most Stones Removed with Same Row or Column"
    },
    "948": {
        "id": "948",
        "name": "Bag of Tokens",
        "acceptance": "59.1",
        "difficulty": "Medium",
        "displayText": "948. Bag of Tokens"
    },
    "949": {
        "id": "949",
        "name": "Largest Time for Given Digits",
        "acceptance": "35.5",
        "difficulty": "Medium",
        "displayText": "949. Largest Time for Given Digits"
    },
    "950": {
        "id": "950",
        "name": "Reveal Cards In Increasing Order",
        "acceptance": "83.2",
        "difficulty": "Medium",
        "displayText": "950. Reveal Cards In Increasing Order"
    },
    "951": {
        "id": "951",
        "name": "Flip Equivalent Binary Trees",
        "acceptance": "69.7",
        "difficulty": "Medium",
        "displayText": "951. Flip Equivalent Binary Trees"
    },
    "952": {
        "id": "952",
        "name": "Largest Component Size by Common Factor",
        "acceptance": "41.0",
        "difficulty": "Hard",
        "displayText": "952. Largest Component Size by Common Factor"
    },
    "953": {
        "id": "953",
        "name": "Verifying an Alien Dictionary",
        "acceptance": "55.5",
        "difficulty": "Easy",
        "displayText": "953. Verifying an Alien Dictionary"
    },
    "954": {
        "id": "954",
        "name": "Array of Doubled Pairs",
        "acceptance": "39.3",
        "difficulty": "Medium",
        "displayText": "954. Array of Doubled Pairs"
    },
    "955": {
        "id": "955",
        "name": "Delete Columns to Make Sorted II",
        "acceptance": "35.5",
        "difficulty": "Medium",
        "displayText": "955. Delete Columns to Make Sorted II"
    },
    "956": {
        "id": "956",
        "name": "Tallest Billboard",
        "acceptance": "51.9",
        "difficulty": "Hard",
        "displayText": "956. Tallest Billboard"
    },
    "957": {
        "id": "957",
        "name": "Prison Cells After N Days",
        "acceptance": "38.9",
        "difficulty": "Medium",
        "displayText": "957. Prison Cells After N Days"
    },
    "958": {
        "id": "958",
        "name": "Check Completeness of a Binary Tree",
        "acceptance": "58.2",
        "difficulty": "Medium",
        "displayText": "958. Check Completeness of a Binary Tree"
    },
    "959": {
        "id": "959",
        "name": "Regions Cut By Slashes",
        "acceptance": "77.6",
        "difficulty": "Medium",
        "displayText": "959. Regions Cut By Slashes"
    },
    "960": {
        "id": "960",
        "name": "Delete Columns to Make Sorted III",
        "acceptance": "58.4",
        "difficulty": "Hard",
        "displayText": "960. Delete Columns to Make Sorted III"
    },
    "961": {
        "id": "961",
        "name": "N-Repeated Element in Size 2N Array",
        "acceptance": "77.3",
        "difficulty": "Easy",
        "displayText": "961. N-Repeated Element in Size 2N Array"
    },
    "962": {
        "id": "962",
        "name": "Maximum Width Ramp",
        "acceptance": "55.6",
        "difficulty": "Medium",
        "displayText": "962. Maximum Width Ramp"
    },
    "963": {
        "id": "963",
        "name": "Minimum Area Rectangle II",
        "acceptance": "55.5",
        "difficulty": "Medium",
        "displayText": "963. Minimum Area Rectangle II"
    },
    "964": {
        "id": "964",
        "name": "Least Operators to Express Number",
        "acceptance": "48.4",
        "difficulty": "Hard",
        "displayText": "964. Least Operators to Express Number"
    },
    "965": {
        "id": "965",
        "name": "Univalued Binary Tree",
        "acceptance": "71.9",
        "difficulty": "Easy",
        "displayText": "965. Univalued Binary Tree"
    },
    "966": {
        "id": "966",
        "name": "Vowel Spellchecker",
        "acceptance": "51.5",
        "difficulty": "Medium",
        "displayText": "966. Vowel Spellchecker"
    },
    "967": {
        "id": "967",
        "name": "Numbers With Same Consecutive Differences",
        "acceptance": "58.6",
        "difficulty": "Medium",
        "displayText": "967. Numbers With Same Consecutive Differences"
    },
    "968": {
        "id": "968",
        "name": "Binary Tree Cameras",
        "acceptance": "47.0",
        "difficulty": "Hard",
        "displayText": "968. Binary Tree Cameras"
    },
    "969": {
        "id": "969",
        "name": "Pancake Sorting",
        "acceptance": "71.1",
        "difficulty": "Medium",
        "displayText": "969. Pancake Sorting"
    },
    "970": {
        "id": "970",
        "name": "Powerful Integers",
        "acceptance": "44.0",
        "difficulty": "Medium",
        "displayText": "970. Powerful Integers"
    },
    "971": {
        "id": "971",
        "name": "Flip Binary Tree To Match Preorder Traversal",
        "acceptance": "50.9",
        "difficulty": "Medium",
        "displayText": "971. Flip Binary Tree To Match Preorder Traversal"
    },
    "972": {
        "id": "972",
        "name": "Equal Rational Numbers",
        "acceptance": "44.4",
        "difficulty": "Hard",
        "displayText": "972. Equal Rational Numbers"
    },
    "973": {
        "id": "973",
        "name": "K Closest Points to Origin",
        "acceptance": "67.7",
        "difficulty": "Medium",
        "displayText": "973. K Closest Points to Origin"
    },
    "974": {
        "id": "974",
        "name": "Subarray Sums Divisible by K",
        "acceptance": "55.6",
        "difficulty": "Medium",
        "displayText": "974. Subarray Sums Divisible by K"
    },
    "975": {
        "id": "975",
        "name": "Odd Even Jump",
        "acceptance": "40.6",
        "difficulty": "Hard",
        "displayText": "975. Odd Even Jump"
    },
    "976": {
        "id": "976",
        "name": "Largest Perimeter Triangle",
        "acceptance": "57.1",
        "difficulty": "Easy",
        "displayText": "976. Largest Perimeter Triangle"
    },
    "977": {
        "id": "977",
        "name": "Squares of a Sorted Array",
        "acceptance": "73.1",
        "difficulty": "Easy",
        "displayText": "977. Squares of a Sorted Array"
    },
    "978": {
        "id": "978",
        "name": "Longest Turbulent Subarray",
        "acceptance": "47.9",
        "difficulty": "Medium",
        "displayText": "978. Longest Turbulent Subarray"
    },
    "979": {
        "id": "979",
        "name": "Distribute Coins in Binary Tree",
        "acceptance": "77.1",
        "difficulty": "Medium",
        "displayText": "979. Distribute Coins in Binary Tree"
    },
    "980": {
        "id": "980",
        "name": "Unique Paths III",
        "acceptance": "82.3",
        "difficulty": "Hard",
        "displayText": "980. Unique Paths III"
    },
    "981": {
        "id": "981",
        "name": "Time Based Key-Value Store",
        "acceptance": "49.4",
        "difficulty": "Medium",
        "displayText": "981. Time Based Key-Value Store"
    },
    "982": {
        "id": "982",
        "name": "Triples with Bitwise AND Equal To Zero",
        "acceptance": "59.1",
        "difficulty": "Hard",
        "displayText": "982. Triples with Bitwise AND Equal To Zero"
    },
    "983": {
        "id": "983",
        "name": "Minimum Cost For Tickets",
        "acceptance": "67.4",
        "difficulty": "Medium",
        "displayText": "983. Minimum Cost For Tickets"
    },
    "984": {
        "id": "984",
        "name": "String Without AAA or BBB",
        "acceptance": "44.4",
        "difficulty": "Medium",
        "displayText": "984. String Without AAA or BBB"
    },
    "985": {
        "id": "985",
        "name": "Sum of Even Numbers After Queries",
        "acceptance": "68.4",
        "difficulty": "Medium",
        "displayText": "985. Sum of Even Numbers After Queries"
    },
    "986": {
        "id": "986",
        "name": "Interval List Intersections",
        "acceptance": "72.5",
        "difficulty": "Medium",
        "displayText": "986. Interval List Intersections"
    },
    "987": {
        "id": "987",
        "name": "Vertical Order Traversal of a Binary Tree",
        "acceptance": "50.7",
        "difficulty": "Hard",
        "displayText": "987. Vertical Order Traversal of a Binary Tree"
    },
    "988": {
        "id": "988",
        "name": "Smallest String Starting From Leaf",
        "acceptance": "60.7",
        "difficulty": "Medium",
        "displayText": "988. Smallest String Starting From Leaf"
    },
    "989": {
        "id": "989",
        "name": "Add to Array-Form of Integer",
        "acceptance": "45.0",
        "difficulty": "Easy",
        "displayText": "989. Add to Array-Form of Integer"
    },
    "990": {
        "id": "990",
        "name": "Satisfiability of Equality Equations",
        "acceptance": "50.9",
        "difficulty": "Medium",
        "displayText": "990. Satisfiability of Equality Equations"
    },
    "991": {
        "id": "991",
        "name": "Broken Calculator",
        "acceptance": "55.0",
        "difficulty": "Medium",
        "displayText": "991. Broken Calculator"
    },
    "992": {
        "id": "992",
        "name": "Subarrays with K Different Integers",
        "acceptance": "65.4",
        "difficulty": "Hard",
        "displayText": "992. Subarrays with K Different Integers"
    },
    "993": {
        "id": "993",
        "name": "Cousins in Binary Tree",
        "acceptance": "57.9",
        "difficulty": "Easy",
        "displayText": "993. Cousins in Binary Tree"
    },
    "994": {
        "id": "994",
        "name": "Rotting Oranges",
        "acceptance": "56.2",
        "difficulty": "Medium",
        "displayText": "994. Rotting Oranges"
    },
    "995": {
        "id": "995",
        "name": "Minimum Number of K Consecutive Bit Flips",
        "acceptance": "62.1",
        "difficulty": "Hard",
        "displayText": "995. Minimum Number of K Consecutive Bit Flips"
    },
    "996": {
        "id": "996",
        "name": "Number of Squareful Arrays",
        "acceptance": "50.4",
        "difficulty": "Hard",
        "displayText": "996. Number of Squareful Arrays"
    },
    "997": {
        "id": "997",
        "name": "Find the Town Judge",
        "acceptance": "49.9",
        "difficulty": "Easy",
        "displayText": "997. Find the Town Judge"
    },
    "998": {
        "id": "998",
        "name": "Maximum Binary Tree II",
        "acceptance": "69.0",
        "difficulty": "Medium",
        "displayText": "998. Maximum Binary Tree II"
    },
    "999": {
        "id": "999",
        "name": "Available Captures for Rook",
        "acceptance": "70.1",
        "difficulty": "Easy",
        "displayText": "999. Available Captures for Rook"
    },
    "1000": {
        "id": "1000",
        "name": "Minimum Cost to Merge Stones",
        "acceptance": "44.1",
        "difficulty": "Hard",
        "displayText": "1000. Minimum Cost to Merge Stones"
    },
    "1001": {
        "id": "1001",
        "name": "Grid Illumination",
        "acceptance": "37.8",
        "difficulty": "Hard",
        "displayText": "1001. Grid Illumination"
    },
    "1002": {
        "id": "1002",
        "name": "Find Common Characters",
        "acceptance": "74.5",
        "difficulty": "Easy",
        "displayText": "1002. Find Common Characters"
    },
    "1003": {
        "id": "1003",
        "name": "Check If Word Is Valid After Substitutions",
        "acceptance": "60.0",
        "difficulty": "Medium",
        "displayText": "1003. Check If Word Is Valid After Substitutions"
    },
    "1004": {
        "id": "1004",
        "name": "Max Consecutive Ones III",
        "acceptance": "65.5",
        "difficulty": "Medium",
        "displayText": "1004. Max Consecutive Ones III"
    },
    "1005": {
        "id": "1005",
        "name": "Maximize Sum Of Array After K Negations",
        "acceptance": "52.1",
        "difficulty": "Easy",
        "displayText": "1005. Maximize Sum Of Array After K Negations"
    },
    "1006": {
        "id": "1006",
        "name": "Clumsy Factorial",
        "acceptance": "58.9",
        "difficulty": "Medium",
        "displayText": "1006. Clumsy Factorial"
    },
    "1007": {
        "id": "1007",
        "name": "Minimum Domino Rotations For Equal Row",
        "acceptance": "52.3",
        "difficulty": "Medium",
        "displayText": "1007. Minimum Domino Rotations For Equal Row"
    },
    "1008": {
        "id": "1008",
        "name": "Construct Binary Search Tree from Preorder Traversal",
        "acceptance": "83.1",
        "difficulty": "Medium",
        "displayText": "1008. Construct Binary Search Tree from Preorder Traversal"
    },
    "1009": {
        "id": "1009",
        "name": "Complement of Base 10 Integer",
        "acceptance": "60.8",
        "difficulty": "Easy",
        "displayText": "1009. Complement of Base 10 Integer"
    },
    "1010": {
        "id": "1010",
        "name": "Pairs of Songs With Total Durations Divisible by 60",
        "acceptance": "53.2",
        "difficulty": "Medium",
        "displayText": "1010. Pairs of Songs With Total Durations Divisible by 60"
    },
    "1011": {
        "id": "1011",
        "name": "Capacity To Ship Packages Within D Days",
        "acceptance": "71.6",
        "difficulty": "Medium",
        "displayText": "1011. Capacity To Ship Packages Within D Days"
    },
    "1012": {
        "id": "1012",
        "name": "Numbers With Repeated Digits",
        "acceptance": "43.1",
        "difficulty": "Hard",
        "displayText": "1012. Numbers With Repeated Digits"
    },
    "1013": {
        "id": "1013",
        "name": "Partition Array Into Three Parts With Equal Sum",
        "acceptance": "42.0",
        "difficulty": "Easy",
        "displayText": "1013. Partition Array Into Three Parts With Equal Sum"
    },
    "1014": {
        "id": "1014",
        "name": "Best Sightseeing Pair",
        "acceptance": "62.6",
        "difficulty": "Medium",
        "displayText": "1014. Best Sightseeing Pair"
    },
    "1015": {
        "id": "1015",
        "name": "Smallest Integer Divisible by K",
        "acceptance": "46.5",
        "difficulty": "Medium",
        "displayText": "1015. Smallest Integer Divisible by K"
    },
    "1016": {
        "id": "1016",
        "name": "Binary String With Substrings Representing 1 To N",
        "acceptance": "57.9",
        "difficulty": "Medium",
        "displayText": "1016. Binary String With Substrings Representing 1 To N"
    },
    "1017": {
        "id": "1017",
        "name": "Convert to Base -2",
        "acceptance": "61.1",
        "difficulty": "Medium",
        "displayText": "1017. Convert to Base -2"
    },
    "1018": {
        "id": "1018",
        "name": "Binary Prefix Divisible By 5",
        "acceptance": "46.9",
        "difficulty": "Easy",
        "displayText": "1018. Binary Prefix Divisible By 5"
    },
    "1019": {
        "id": "1019",
        "name": "Next Greater Node In Linked List",
        "acceptance": "62.0",
        "difficulty": "Medium",
        "displayText": "1019. Next Greater Node In Linked List"
    },
    "1020": {
        "id": "1020",
        "name": "Number of Enclaves",
        "acceptance": "70.2",
        "difficulty": "Medium",
        "displayText": "1020. Number of Enclaves"
    },
    "1021": {
        "id": "1021",
        "name": "Remove Outermost Parentheses",
        "acceptance": "85.2",
        "difficulty": "Easy",
        "displayText": "1021. Remove Outermost Parentheses"
    },
    "1022": {
        "id": "1022",
        "name": "Sum of Root To Leaf Binary Numbers",
        "acceptance": "73.3",
        "difficulty": "Easy",
        "displayText": "1022. Sum of Root To Leaf Binary Numbers"
    },
    "1023": {
        "id": "1023",
        "name": "Camelcase Matching",
        "acceptance": "63.5",
        "difficulty": "Medium",
        "displayText": "1023. Camelcase Matching"
    },
    "1024": {
        "id": "1024",
        "name": "Video Stitching",
        "acceptance": "51.8",
        "difficulty": "Medium",
        "displayText": "1024. Video Stitching"
    },
    "1025": {
        "id": "1025",
        "name": "Divisor Game",
        "acceptance": "70.1",
        "difficulty": "Easy",
        "displayText": "1025. Divisor Game"
    },
    "1026": {
        "id": "1026",
        "name": "Maximum Difference Between Node and Ancestor",
        "acceptance": "78.0",
        "difficulty": "Medium",
        "displayText": "1026. Maximum Difference Between Node and Ancestor"
    },
    "1027": {
        "id": "1027",
        "name": "Longest Arithmetic Subsequence",
        "acceptance": "49.4",
        "difficulty": "Medium",
        "displayText": "1027. Longest Arithmetic Subsequence"
    },
    "1028": {
        "id": "1028",
        "name": "Recover a Tree From Preorder Traversal",
        "acceptance": "83.3",
        "difficulty": "Hard",
        "displayText": "1028. Recover a Tree From Preorder Traversal"
    },
    "1029": {
        "id": "1029",
        "name": "Two City Scheduling",
        "acceptance": "67.5",
        "difficulty": "Medium",
        "displayText": "1029. Two City Scheduling"
    },
    "1030": {
        "id": "1030",
        "name": "Matrix Cells in Distance Order",
        "acceptance": "72.5",
        "difficulty": "Easy",
        "displayText": "1030. Matrix Cells in Distance Order"
    },
    "1031": {
        "id": "1031",
        "name": "Maximum Sum of Two Non-Overlapping Subarrays",
        "acceptance": "60.1",
        "difficulty": "Medium",
        "displayText": "1031. Maximum Sum of Two Non-Overlapping Subarrays"
    },
    "1032": {
        "id": "1032",
        "name": "Stream of Characters",
        "acceptance": "52.4",
        "difficulty": "Hard",
        "displayText": "1032. Stream of Characters"
    },
    "1033": {
        "id": "1033",
        "name": "Moving Stones Until Consecutive",
        "acceptance": "49.2",
        "difficulty": "Medium",
        "displayText": "1033. Moving Stones Until Consecutive"
    },
    "1034": {
        "id": "1034",
        "name": "Coloring A Border",
        "acceptance": "49.6",
        "difficulty": "Medium",
        "displayText": "1034. Coloring A Border"
    },
    "1035": {
        "id": "1035",
        "name": "Uncrossed Lines",
        "acceptance": "64.1",
        "difficulty": "Medium",
        "displayText": "1035. Uncrossed Lines"
    },
    "1036": {
        "id": "1036",
        "name": "Escape a Large Maze",
        "acceptance": "35.2",
        "difficulty": "Hard",
        "displayText": "1036. Escape a Large Maze"
    },
    "1037": {
        "id": "1037",
        "name": "Valid Boomerang",
        "acceptance": "37.7",
        "difficulty": "Easy",
        "displayText": "1037. Valid Boomerang"
    },
    "1038": {
        "id": "1038",
        "name": "Binary Search Tree to Greater Sum Tree",
        "acceptance": "88.2",
        "difficulty": "Medium",
        "displayText": "1038. Binary Search Tree to Greater Sum Tree"
    },
    "1039": {
        "id": "1039",
        "name": "Minimum Score Triangulation of Polygon",
        "acceptance": "60.0",
        "difficulty": "Medium",
        "displayText": "1039. Minimum Score Triangulation of Polygon"
    },
    "1040": {
        "id": "1040",
        "name": "Moving Stones Until Consecutive II",
        "acceptance": "56.9",
        "difficulty": "Medium",
        "displayText": "1040. Moving Stones Until Consecutive II"
    },
    "1041": {
        "id": "1041",
        "name": "Robot Bounded In Circle",
        "acceptance": "56.2",
        "difficulty": "Medium",
        "displayText": "1041. Robot Bounded In Circle"
    },
    "1042": {
        "id": "1042",
        "name": "Flower Planting With No Adjacent",
        "acceptance": "52.1",
        "difficulty": "Medium",
        "displayText": "1042. Flower Planting With No Adjacent"
    },
    "1043": {
        "id": "1043",
        "name": "Partition Array for Maximum Sum",
        "acceptance": "76.9",
        "difficulty": "Medium",
        "displayText": "1043. Partition Array for Maximum Sum"
    },
    "1044": {
        "id": "1044",
        "name": "Longest Duplicate Substring",
        "acceptance": "30.7",
        "difficulty": "Hard",
        "displayText": "1044. Longest Duplicate Substring"
    },
    "1045": {
        "id": "1045",
        "name": "Customers Who Bought All Products",
        "acceptance": "63.0",
        "difficulty": "Medium",
        "displayText": "1045. Customers Who Bought All Products"
    },
    "1046": {
        "id": "1046",
        "name": "Last Stone Weight",
        "acceptance": "65.8",
        "difficulty": "Easy",
        "displayText": "1046. Last Stone Weight"
    },
    "1047": {
        "id": "1047",
        "name": "Remove All Adjacent Duplicates In String",
        "acceptance": "71.3",
        "difficulty": "Easy",
        "displayText": "1047. Remove All Adjacent Duplicates In String"
    },
    "1048": {
        "id": "1048",
        "name": "Longest String Chain",
        "acceptance": "61.8",
        "difficulty": "Medium",
        "displayText": "1048. Longest String Chain"
    },
    "1049": {
        "id": "1049",
        "name": "Last Stone Weight II",
        "acceptance": "57.2",
        "difficulty": "Medium",
        "displayText": "1049. Last Stone Weight II"
    },
    "1050": {
        "id": "1050",
        "name": "Actors and Directors Who Cooperated At Least Three Times",
        "acceptance": "70.5",
        "difficulty": "Easy",
        "displayText": "1050. Actors and Directors Who Cooperated At Least Three Times"
    },
    "1051": {
        "id": "1051",
        "name": "Height Checker",
        "acceptance": "81.1",
        "difficulty": "Easy",
        "displayText": "1051. Height Checker"
    },
    "1052": {
        "id": "1052",
        "name": "Grumpy Bookstore Owner",
        "acceptance": "64.1",
        "difficulty": "Medium",
        "displayText": "1052. Grumpy Bookstore Owner"
    },
    "1053": {
        "id": "1053",
        "name": "Previous Permutation With One Swap",
        "acceptance": "49.4",
        "difficulty": "Medium",
        "displayText": "1053. Previous Permutation With One Swap"
    },
    "1054": {
        "id": "1054",
        "name": "Distant Barcodes",
        "acceptance": "47.3",
        "difficulty": "Medium",
        "displayText": "1054. Distant Barcodes"
    },
    "1055": {
        "id": "1055",
        "name": "Shortest Way to Form String",
        "acceptance": "61.2",
        "difficulty": "Medium",
        "displayText": "1055. Shortest Way to Form String"
    },
    "1056": {
        "id": "1056",
        "name": "Confusing Number",
        "acceptance": "49.2",
        "difficulty": "Easy",
        "displayText": "1056. Confusing Number"
    },
    "1057": {
        "id": "1057",
        "name": "Campus Bikes",
        "acceptance": "58.9",
        "difficulty": "Medium",
        "displayText": "1057. Campus Bikes"
    },
    "1058": {
        "id": "1058",
        "name": "Minimize Rounding Error to Meet Target",
        "acceptance": "45.4",
        "difficulty": "Medium",
        "displayText": "1058. Minimize Rounding Error to Meet Target"
    },
    "1059": {
        "id": "1059",
        "name": "All Paths from Source Lead to Destination",
        "acceptance": "37.1",
        "difficulty": "Medium",
        "displayText": "1059. All Paths from Source Lead to Destination"
    },
    "1060": {
        "id": "1060",
        "name": "Missing Element in Sorted Array",
        "acceptance": "58.4",
        "difficulty": "Medium",
        "displayText": "1060. Missing Element in Sorted Array"
    },
    "1061": {
        "id": "1061",
        "name": "Lexicographically Smallest Equivalent String",
        "acceptance": "76.6",
        "difficulty": "Medium",
        "displayText": "1061. Lexicographically Smallest Equivalent String"
    },
    "1062": {
        "id": "1062",
        "name": "Longest Repeating Substring",
        "acceptance": "62.9",
        "difficulty": "Medium",
        "displayText": "1062. Longest Repeating Substring"
    },
    "1063": {
        "id": "1063",
        "name": "Number of Valid Subarrays",
        "acceptance": "79.1",
        "difficulty": "Hard",
        "displayText": "1063. Number of Valid Subarrays"
    },
    "1064": {
        "id": "1064",
        "name": "Fixed Point",
        "acceptance": "63.9",
        "difficulty": "Easy",
        "displayText": "1064. Fixed Point"
    },
    "1065": {
        "id": "1065",
        "name": "Index Pairs of a String",
        "acceptance": "68.1",
        "difficulty": "Easy",
        "displayText": "1065. Index Pairs of a String"
    },
    "1066": {
        "id": "1066",
        "name": "Campus Bikes II",
        "acceptance": "55.3",
        "difficulty": "Medium",
        "displayText": "1066. Campus Bikes II"
    },
    "1067": {
        "id": "1067",
        "name": "Digit Count in Range",
        "acceptance": "46.0",
        "difficulty": "Hard",
        "displayText": "1067. Digit Count in Range"
    },
    "1068": {
        "id": "1068",
        "name": "Product Sales Analysis I",
        "acceptance": "84.3",
        "difficulty": "Easy",
        "displayText": "1068. Product Sales Analysis I"
    },
    "1069": {
        "id": "1069",
        "name": "Product Sales Analysis II",
        "acceptance": "82.1",
        "difficulty": "Easy",
        "displayText": "1069. Product Sales Analysis II"
    },
    "1070": {
        "id": "1070",
        "name": "Product Sales Analysis III",
        "acceptance": "44.1",
        "difficulty": "Medium",
        "displayText": "1070. Product Sales Analysis III"
    },
    "1071": {
        "id": "1071",
        "name": "Greatest Common Divisor of Strings",
        "acceptance": "52.7",
        "difficulty": "Easy",
        "displayText": "1071. Greatest Common Divisor of Strings"
    },
    "1072": {
        "id": "1072",
        "name": "Flip Columns For Maximum Number of Equal Rows",
        "acceptance": "78.5",
        "difficulty": "Medium",
        "displayText": "1072. Flip Columns For Maximum Number of Equal Rows"
    },
    "1073": {
        "id": "1073",
        "name": "Adding Two Negabinary Numbers",
        "acceptance": "36.8",
        "difficulty": "Medium",
        "displayText": "1073. Adding Two Negabinary Numbers"
    },
    "1074": {
        "id": "1074",
        "name": "Number of Submatrices That Sum to Target",
        "acceptance": "74.4",
        "difficulty": "Hard",
        "displayText": "1074. Number of Submatrices That Sum to Target"
    },
    "1075": {
        "id": "1075",
        "name": "Project Employees I",
        "acceptance": "65.3",
        "difficulty": "Easy",
        "displayText": "1075. Project Employees I"
    },
    "1076": {
        "id": "1076",
        "name": "Project Employees II",
        "acceptance": "50.2",
        "difficulty": "Easy",
        "displayText": "1076. Project Employees II"
    },
    "1077": {
        "id": "1077",
        "name": "Project Employees III",
        "acceptance": "77.1",
        "difficulty": "Medium",
        "displayText": "1077. Project Employees III"
    },
    "1078": {
        "id": "1078",
        "name": "Occurrences After Bigram",
        "acceptance": "63.6",
        "difficulty": "Easy",
        "displayText": "1078. Occurrences After Bigram"
    },
    "1079": {
        "id": "1079",
        "name": "Letter Tile Possibilities",
        "acceptance": "83.5",
        "difficulty": "Medium",
        "displayText": "1079. Letter Tile Possibilities"
    },
    "1080": {
        "id": "1080",
        "name": "Insufficient Nodes in Root to Leaf Paths",
        "acceptance": "57.6",
        "difficulty": "Medium",
        "displayText": "1080. Insufficient Nodes in Root to Leaf Paths"
    },
    "1081": {
        "id": "1081",
        "name": "Smallest Subsequence of Distinct Characters",
        "acceptance": "61.7",
        "difficulty": "Medium",
        "displayText": "1081. Smallest Subsequence of Distinct Characters"
    },
    "1082": {
        "id": "1082",
        "name": "Sales Analysis I",
        "acceptance": "74.7",
        "difficulty": "Easy",
        "displayText": "1082. Sales Analysis I"
    },
    "1083": {
        "id": "1083",
        "name": "Sales Analysis II",
        "acceptance": "49.9",
        "difficulty": "Easy",
        "displayText": "1083. Sales Analysis II"
    },
    "1084": {
        "id": "1084",
        "name": "Sales Analysis III",
        "acceptance": "46.7",
        "difficulty": "Easy",
        "displayText": "1084. Sales Analysis III"
    },
    "1085": {
        "id": "1085",
        "name": "Sum of Digits in the Minimum Number",
        "acceptance": "76.6",
        "difficulty": "Easy",
        "displayText": "1085. Sum of Digits in the Minimum Number"
    },
    "1086": {
        "id": "1086",
        "name": "High Five",
        "acceptance": "74.4",
        "difficulty": "Easy",
        "displayText": "1086. High Five"
    },
    "1087": {
        "id": "1087",
        "name": "Brace Expansion",
        "acceptance": "66.6",
        "difficulty": "Medium",
        "displayText": "1087. Brace Expansion"
    },
    "1088": {
        "id": "1088",
        "name": "Confusing Number II",
        "acceptance": "47.1",
        "difficulty": "Hard",
        "displayText": "1088. Confusing Number II"
    },
    "1089": {
        "id": "1089",
        "name": "Duplicate Zeros",
        "acceptance": "52.7",
        "difficulty": "Easy",
        "displayText": "1089. Duplicate Zeros"
    },
    "1090": {
        "id": "1090",
        "name": "Largest Values From Labels",
        "acceptance": "62.9",
        "difficulty": "Medium",
        "displayText": "1090. Largest Values From Labels"
    },
    "1091": {
        "id": "1091",
        "name": "Shortest Path in Binary Matrix",
        "acceptance": "49.4",
        "difficulty": "Medium",
        "displayText": "1091. Shortest Path in Binary Matrix"
    },
    "1092": {
        "id": "1092",
        "name": "Shortest Common Supersequence",
        "acceptance": "61.2",
        "difficulty": "Hard",
        "displayText": "1092. Shortest Common Supersequence"
    },
    "1093": {
        "id": "1093",
        "name": "Statistics from a Large Sample",
        "acceptance": "42.2",
        "difficulty": "Medium",
        "displayText": "1093. Statistics from a Large Sample"
    },
    "1094": {
        "id": "1094",
        "name": "Car Pooling",
        "acceptance": "56.0",
        "difficulty": "Medium",
        "displayText": "1094. Car Pooling"
    },
    "1095": {
        "id": "1095",
        "name": "Find in Mountain Array",
        "acceptance": "40.3",
        "difficulty": "Hard",
        "displayText": "1095. Find in Mountain Array"
    },
    "1096": {
        "id": "1096",
        "name": "Brace Expansion II",
        "acceptance": "63.1",
        "difficulty": "Hard",
        "displayText": "1096. Brace Expansion II"
    },
    "1097": {
        "id": "1097",
        "name": "Game Play Analysis V",
        "acceptance": "50.8",
        "difficulty": "Hard",
        "displayText": "1097. Game Play Analysis V"
    },
    "1098": {
        "id": "1098",
        "name": "Unpopular Books",
        "acceptance": "43.3",
        "difficulty": "Medium",
        "displayText": "1098. Unpopular Books"
    },
    "1099": {
        "id": "1099",
        "name": "Two Sum Less Than K",
        "acceptance": "62.0",
        "difficulty": "Easy",
        "displayText": "1099. Two Sum Less Than K"
    },
    "1100": {
        "id": "1100",
        "name": "Find K-Length Substrings With No Repeated Characters",
        "acceptance": "76.2",
        "difficulty": "Medium",
        "displayText": "1100. Find K-Length Substrings With No Repeated Characters"
    },
    "1101": {
        "id": "1101",
        "name": "The Earliest Moment When Everyone Become Friends",
        "acceptance": "65.6",
        "difficulty": "Medium",
        "displayText": "1101. The Earliest Moment When Everyone Become Friends"
    },
    "1102": {
        "id": "1102",
        "name": "Path With Maximum Minimum Value",
        "acceptance": "53.9",
        "difficulty": "Medium",
        "displayText": "1102. Path With Maximum Minimum Value"
    },
    "1103": {
        "id": "1103",
        "name": "Distribute Candies to People",
        "acceptance": "66.2",
        "difficulty": "Easy",
        "displayText": "1103. Distribute Candies to People"
    },
    "1104": {
        "id": "1104",
        "name": "Path In Zigzag Labelled Binary Tree",
        "acceptance": "75.4",
        "difficulty": "Medium",
        "displayText": "1104. Path In Zigzag Labelled Binary Tree"
    },
    "1105": {
        "id": "1105",
        "name": "Filling Bookcase Shelves",
        "acceptance": "68.7",
        "difficulty": "Medium",
        "displayText": "1105. Filling Bookcase Shelves"
    },
    "1106": {
        "id": "1106",
        "name": "Parsing A Boolean Expression",
        "acceptance": "70.0",
        "difficulty": "Hard",
        "displayText": "1106. Parsing A Boolean Expression"
    },
    "1107": {
        "id": "1107",
        "name": "New Users Daily Count",
        "acceptance": "44.9",
        "difficulty": "Medium",
        "displayText": "1107. New Users Daily Count"
    },
    "1108": {
        "id": "1108",
        "name": "Defanging an IP Address",
        "acceptance": "89.6",
        "difficulty": "Easy",
        "displayText": "1108. Defanging an IP Address"
    },
    "1109": {
        "id": "1109",
        "name": "Corporate Flight Bookings",
        "acceptance": "63.8",
        "difficulty": "Medium",
        "displayText": "1109. Corporate Flight Bookings"
    },
    "1110": {
        "id": "1110",
        "name": "Delete Nodes And Return Forest",
        "acceptance": "72.4",
        "difficulty": "Medium",
        "displayText": "1110. Delete Nodes And Return Forest"
    },
    "1111": {
        "id": "1111",
        "name": "Maximum Nesting Depth of Two Valid Parentheses Strings",
        "acceptance": "71.3",
        "difficulty": "Medium",
        "displayText": "1111. Maximum Nesting Depth of Two Valid Parentheses Strings"
    },
    "1112": {
        "id": "1112",
        "name": "Highest Grade For Each Student",
        "acceptance": "71.1",
        "difficulty": "Medium",
        "displayText": "1112. Highest Grade For Each Student"
    },
    "1113": {
        "id": "1113",
        "name": "Reported Posts",
        "acceptance": "65.1",
        "difficulty": "Easy",
        "displayText": "1113. Reported Posts"
    },
    "1114": {
        "id": "1114",
        "name": "Print in Order",
        "acceptance": "70.9",
        "difficulty": "Easy",
        "displayText": "1114. Print in Order"
    },
    "1115": {
        "id": "1115",
        "name": "Print FooBar Alternately",
        "acceptance": "69.0",
        "difficulty": "Medium",
        "displayText": "1115. Print FooBar Alternately"
    },
    "1116": {
        "id": "1116",
        "name": "Print Zero Even Odd",
        "acceptance": "63.1",
        "difficulty": "Medium",
        "displayText": "1116. Print Zero Even Odd"
    },
    "1117": {
        "id": "1117",
        "name": "Building H2O",
        "acceptance": "57.5",
        "difficulty": "Medium",
        "displayText": "1117. Building H2O"
    },
    "1118": {
        "id": "1118",
        "name": "Number of Days in a Month",
        "acceptance": "58.9",
        "difficulty": "Easy",
        "displayText": "1118. Number of Days in a Month"
    },
    "1119": {
        "id": "1119",
        "name": "Remove Vowels from a String",
        "acceptance": "91.2",
        "difficulty": "Easy",
        "displayText": "1119. Remove Vowels from a String"
    },
    "1120": {
        "id": "1120",
        "name": "Maximum Average Subtree",
        "acceptance": "66.8",
        "difficulty": "Medium",
        "displayText": "1120. Maximum Average Subtree"
    },
    "1121": {
        "id": "1121",
        "name": "Divide Array Into Increasing Sequences",
        "acceptance": "60.5",
        "difficulty": "Hard",
        "displayText": "1121. Divide Array Into Increasing Sequences"
    },
    "1122": {
        "id": "1122",
        "name": "Relative Sort Array",
        "acceptance": "74.9",
        "difficulty": "Easy",
        "displayText": "1122. Relative Sort Array"
    },
    "1123": {
        "id": "1123",
        "name": "Lowest Common Ancestor of Deepest Leaves",
        "acceptance": "78.8",
        "difficulty": "Medium",
        "displayText": "1123. Lowest Common Ancestor of Deepest Leaves"
    },
    "1124": {
        "id": "1124",
        "name": "Longest Well-Performing Interval",
        "acceptance": "35.7",
        "difficulty": "Medium",
        "displayText": "1124. Longest Well-Performing Interval"
    },
    "1125": {
        "id": "1125",
        "name": "Smallest Sufficient Team",
        "acceptance": "55.3",
        "difficulty": "Hard",
        "displayText": "1125. Smallest Sufficient Team"
    },
    "1126": {
        "id": "1126",
        "name": "Active Businesses",
        "acceptance": "65.9",
        "difficulty": "Medium",
        "displayText": "1126. Active Businesses"
    },
    "1127": {
        "id": "1127",
        "name": "User Purchase Platform",
        "acceptance": "47.1",
        "difficulty": "Hard",
        "displayText": "1127. User Purchase Platform"
    },
    "1128": {
        "id": "1128",
        "name": "Number of Equivalent Domino Pairs",
        "acceptance": "49.1",
        "difficulty": "Easy",
        "displayText": "1128. Number of Equivalent Domino Pairs"
    },
    "1129": {
        "id": "1129",
        "name": "Shortest Path with Alternating Colors",
        "acceptance": "47.2",
        "difficulty": "Medium",
        "displayText": "1129. Shortest Path with Alternating Colors"
    },
    "1130": {
        "id": "1130",
        "name": "Minimum Cost Tree From Leaf Values",
        "acceptance": "67.6",
        "difficulty": "Medium",
        "displayText": "1130. Minimum Cost Tree From Leaf Values"
    },
    "1131": {
        "id": "1131",
        "name": "Maximum of Absolute Value Expression",
        "acceptance": "48.2",
        "difficulty": "Medium",
        "displayText": "1131. Maximum of Absolute Value Expression"
    },
    "1132": {
        "id": "1132",
        "name": "Reported Posts II",
        "acceptance": "32.2",
        "difficulty": "Medium",
        "displayText": "1132. Reported Posts II"
    },
    "1133": {
        "id": "1133",
        "name": "Largest Unique Number",
        "acceptance": "70.7",
        "difficulty": "Easy",
        "displayText": "1133. Largest Unique Number"
    },
    "1134": {
        "id": "1134",
        "name": "Armstrong Number",
        "acceptance": "77.8",
        "difficulty": "Easy",
        "displayText": "1134. Armstrong Number"
    },
    "1135": {
        "id": "1135",
        "name": "Connecting Cities With Minimum Cost",
        "acceptance": "62.5",
        "difficulty": "Medium",
        "displayText": "1135. Connecting Cities With Minimum Cost"
    },
    "1136": {
        "id": "1136",
        "name": "Parallel Courses",
        "acceptance": "61.8",
        "difficulty": "Medium",
        "displayText": "1136. Parallel Courses"
    },
    "1137": {
        "id": "1137",
        "name": "N-th Tribonacci Number",
        "acceptance": "63.6",
        "difficulty": "Easy",
        "displayText": "1137. N-th Tribonacci Number"
    },
    "1138": {
        "id": "1138",
        "name": "Alphabet Board Path",
        "acceptance": "51.6",
        "difficulty": "Medium",
        "displayText": "1138. Alphabet Board Path"
    },
    "1139": {
        "id": "1139",
        "name": "Largest 1-Bordered Square",
        "acceptance": "50.6",
        "difficulty": "Medium",
        "displayText": "1139. Largest 1-Bordered Square"
    },
    "1140": {
        "id": "1140",
        "name": "Stone Game II",
        "acceptance": "73.0",
        "difficulty": "Medium",
        "displayText": "1140. Stone Game II"
    },
    "1141": {
        "id": "1141",
        "name": "User Activity for the Past 30 Days I",
        "acceptance": "49.4",
        "difficulty": "Easy",
        "displayText": "1141. User Activity for the Past 30 Days I"
    },
    "1142": {
        "id": "1142",
        "name": "User Activity for the Past 30 Days II",
        "acceptance": "35.7",
        "difficulty": "Easy",
        "displayText": "1142. User Activity for the Past 30 Days II"
    },
    "1143": {
        "id": "1143",
        "name": "Longest Common Subsequence",
        "acceptance": "58.1",
        "difficulty": "Medium",
        "displayText": "1143. Longest Common Subsequence"
    },
    "1144": {
        "id": "1144",
        "name": "Decrease Elements To Make Array Zigzag",
        "acceptance": "48.3",
        "difficulty": "Medium",
        "displayText": "1144. Decrease Elements To Make Array Zigzag"
    },
    "1145": {
        "id": "1145",
        "name": "Binary Tree Coloring Game",
        "acceptance": "52.4",
        "difficulty": "Medium",
        "displayText": "1145. Binary Tree Coloring Game"
    },
    "1146": {
        "id": "1146",
        "name": "Snapshot Array",
        "acceptance": "36.7",
        "difficulty": "Medium",
        "displayText": "1146. Snapshot Array"
    },
    "1147": {
        "id": "1147",
        "name": "Longest Chunked Palindrome Decomposition",
        "acceptance": "58.8",
        "difficulty": "Hard",
        "displayText": "1147. Longest Chunked Palindrome Decomposition"
    },
    "1148": {
        "id": "1148",
        "name": "Article Views I",
        "acceptance": "77.2",
        "difficulty": "Easy",
        "displayText": "1148. Article Views I"
    },
    "1149": {
        "id": "1149",
        "name": "Article Views II",
        "acceptance": "47.2",
        "difficulty": "Medium",
        "displayText": "1149. Article Views II"
    },
    "1150": {
        "id": "1150",
        "name": "Check If a Number Is Majority Element in a Sorted Array",
        "acceptance": "59.0",
        "difficulty": "Easy",
        "displayText": "1150. Check If a Number Is Majority Element in a Sorted Array"
    },
    "1151": {
        "id": "1151",
        "name": "Minimum Swaps to Group All 1's Together",
        "acceptance": "61.1",
        "difficulty": "Medium",
        "displayText": "1151. Minimum Swaps to Group All 1's Together"
    },
    "1152": {
        "id": "1152",
        "name": "Analyze User Website Visit Pattern",
        "acceptance": "43.4",
        "difficulty": "Medium",
        "displayText": "1152. Analyze User Website Visit Pattern"
    },
    "1153": {
        "id": "1153",
        "name": "String Transforms Into Another String",
        "acceptance": "34.8",
        "difficulty": "Hard",
        "displayText": "1153. String Transforms Into Another String"
    },
    "1154": {
        "id": "1154",
        "name": "Day of the Year",
        "acceptance": "47.9",
        "difficulty": "Easy",
        "displayText": "1154. Day of the Year"
    },
    "1155": {
        "id": "1155",
        "name": "Number of Dice Rolls With Target Sum",
        "acceptance": "61.5",
        "difficulty": "Medium",
        "displayText": "1155. Number of Dice Rolls With Target Sum"
    },
    "1156": {
        "id": "1156",
        "name": "Swap For Longest Repeated Character Substring",
        "acceptance": "43.6",
        "difficulty": "Medium",
        "displayText": "1156. Swap For Longest Repeated Character Substring"
    },
    "1157": {
        "id": "1157",
        "name": "Online Majority Element In Subarray",
        "acceptance": "42.4",
        "difficulty": "Hard",
        "displayText": "1157. Online Majority Element In Subarray"
    },
    "1158": {
        "id": "1158",
        "name": "Market Analysis I",
        "acceptance": "57.2",
        "difficulty": "Medium",
        "displayText": "1158. Market Analysis I"
    },
    "1159": {
        "id": "1159",
        "name": "Market Analysis II",
        "acceptance": "57.7",
        "difficulty": "Hard",
        "displayText": "1159. Market Analysis II"
    },
    "1160": {
        "id": "1160",
        "name": "Find Words That Can Be Formed by Characters",
        "acceptance": "70.9",
        "difficulty": "Easy",
        "displayText": "1160. Find Words That Can Be Formed by Characters"
    },
    "1161": {
        "id": "1161",
        "name": "Maximum Level Sum of a Binary Tree",
        "acceptance": "67.3",
        "difficulty": "Medium",
        "displayText": "1161. Maximum Level Sum of a Binary Tree"
    },
    "1162": {
        "id": "1162",
        "name": "As Far from Land as Possible",
        "acceptance": "51.8",
        "difficulty": "Medium",
        "displayText": "1162. As Far from Land as Possible"
    },
    "1163": {
        "id": "1163",
        "name": "Last Substring in Lexicographical Order",
        "acceptance": "34.4",
        "difficulty": "Hard",
        "displayText": "1163. Last Substring in Lexicographical Order"
    },
    "1164": {
        "id": "1164",
        "name": "Product Price at a Given Date",
        "acceptance": "57.2",
        "difficulty": "Medium",
        "displayText": "1164. Product Price at a Given Date"
    },
    "1165": {
        "id": "1165",
        "name": "Single-Row Keyboard",
        "acceptance": "87.7",
        "difficulty": "Easy",
        "displayText": "1165. Single-Row Keyboard"
    },
    "1166": {
        "id": "1166",
        "name": "Design File System",
        "acceptance": "63.9",
        "difficulty": "Medium",
        "displayText": "1166. Design File System"
    },
    "1167": {
        "id": "1167",
        "name": "Minimum Cost to Connect Sticks",
        "acceptance": "71.0",
        "difficulty": "Medium",
        "displayText": "1167. Minimum Cost to Connect Sticks"
    },
    "1168": {
        "id": "1168",
        "name": "Optimize Water Distribution in a Village",
        "acceptance": "65.1",
        "difficulty": "Hard",
        "displayText": "1168. Optimize Water Distribution in a Village"
    },
    "1169": {
        "id": "1169",
        "name": "Invalid Transactions",
        "acceptance": "31.2",
        "difficulty": "Medium",
        "displayText": "1169. Invalid Transactions"
    },
    "1170": {
        "id": "1170",
        "name": "Compare Strings by Frequency of the Smallest Character",
        "acceptance": "62.6",
        "difficulty": "Medium",
        "displayText": "1170. Compare Strings by Frequency of the Smallest Character"
    },
    "1171": {
        "id": "1171",
        "name": "Remove Zero Sum Consecutive Nodes from Linked List",
        "acceptance": "52.8",
        "difficulty": "Medium",
        "displayText": "1171. Remove Zero Sum Consecutive Nodes from Linked List"
    },
    "1172": {
        "id": "1172",
        "name": "Dinner Plate Stacks",
        "acceptance": "32.8",
        "difficulty": "Hard",
        "displayText": "1172. Dinner Plate Stacks"
    },
    "1173": {
        "id": "1173",
        "name": "Immediate Food Delivery I",
        "acceptance": "80.9",
        "difficulty": "Easy",
        "displayText": "1173. Immediate Food Delivery I"
    },
    "1174": {
        "id": "1174",
        "name": "Immediate Food Delivery II",
        "acceptance": "54.0",
        "difficulty": "Medium",
        "displayText": "1174. Immediate Food Delivery II"
    },
    "1175": {
        "id": "1175",
        "name": "Prime Arrangements",
        "acceptance": "59.2",
        "difficulty": "Easy",
        "displayText": "1175. Prime Arrangements"
    },
    "1176": {
        "id": "1176",
        "name": "Diet Plan Performance",
        "acceptance": "54.0",
        "difficulty": "Easy",
        "displayText": "1176. Diet Plan Performance"
    },
    "1177": {
        "id": "1177",
        "name": "Can Make Palindrome from Substring",
        "acceptance": "40.0",
        "difficulty": "Medium",
        "displayText": "1177. Can Make Palindrome from Substring"
    },
    "1178": {
        "id": "1178",
        "name": "Number of Valid Words for Each Puzzle",
        "acceptance": "47.0",
        "difficulty": "Hard",
        "displayText": "1178. Number of Valid Words for Each Puzzle"
    },
    "1179": {
        "id": "1179",
        "name": "Reformat Department Table",
        "acceptance": "76.8",
        "difficulty": "Easy",
        "displayText": "1179. Reformat Department Table"
    },
    "1180": {
        "id": "1180",
        "name": "Count Substrings with Only One Distinct Letter",
        "acceptance": "80.5",
        "difficulty": "Easy",
        "displayText": "1180. Count Substrings with Only One Distinct Letter"
    },
    "1181": {
        "id": "1181",
        "name": "Before and After Puzzle",
        "acceptance": "46.5",
        "difficulty": "Medium",
        "displayText": "1181. Before and After Puzzle"
    },
    "1182": {
        "id": "1182",
        "name": "Shortest Distance to Target Color",
        "acceptance": "55.4",
        "difficulty": "Medium",
        "displayText": "1182. Shortest Distance to Target Color"
    },
    "1183": {
        "id": "1183",
        "name": "Maximum Number of Ones",
        "acceptance": "68.6",
        "difficulty": "Hard",
        "displayText": "1183. Maximum Number of Ones"
    },
    "1184": {
        "id": "1184",
        "name": "Distance Between Bus Stops",
        "acceptance": "54.5",
        "difficulty": "Easy",
        "displayText": "1184. Distance Between Bus Stops"
    },
    "1185": {
        "id": "1185",
        "name": "Day of the Week",
        "acceptance": "58.4",
        "difficulty": "Easy",
        "displayText": "1185. Day of the Week"
    },
    "1186": {
        "id": "1186",
        "name": "Maximum Subarray Sum with One Deletion",
        "acceptance": "44.8",
        "difficulty": "Medium",
        "displayText": "1186. Maximum Subarray Sum with One Deletion"
    },
    "1187": {
        "id": "1187",
        "name": "Make Array Strictly Increasing",
        "acceptance": "57.8",
        "difficulty": "Hard",
        "displayText": "1187. Make Array Strictly Increasing"
    },
    "1188": {
        "id": "1188",
        "name": "Design Bounded Blocking Queue",
        "acceptance": "73.0",
        "difficulty": "Medium",
        "displayText": "1188. Design Bounded Blocking Queue"
    },
    "1189": {
        "id": "1189",
        "name": "Maximum Number of Balloons",
        "acceptance": "59.7",
        "difficulty": "Easy",
        "displayText": "1189. Maximum Number of Balloons"
    },
    "1190": {
        "id": "1190",
        "name": "Reverse Substrings Between Each Pair of Parentheses",
        "acceptance": "71.7",
        "difficulty": "Medium",
        "displayText": "1190. Reverse Substrings Between Each Pair of Parentheses"
    },
    "1191": {
        "id": "1191",
        "name": "K-Concatenation Maximum Sum",
        "acceptance": "24.1",
        "difficulty": "Medium",
        "displayText": "1191. K-Concatenation Maximum Sum"
    },
    "1192": {
        "id": "1192",
        "name": "Critical Connections in a Network",
        "acceptance": "57.4",
        "difficulty": "Hard",
        "displayText": "1192. Critical Connections in a Network"
    },
    "1193": {
        "id": "1193",
        "name": "Monthly Transactions I",
        "acceptance": "58.3",
        "difficulty": "Medium",
        "displayText": "1193. Monthly Transactions I"
    },
    "1194": {
        "id": "1194",
        "name": "Tournament Winners",
        "acceptance": "49.7",
        "difficulty": "Hard",
        "displayText": "1194. Tournament Winners"
    },
    "1195": {
        "id": "1195",
        "name": "Fizz Buzz Multithreaded",
        "acceptance": "73.7",
        "difficulty": "Medium",
        "displayText": "1195. Fizz Buzz Multithreaded"
    },
    "1196": {
        "id": "1196",
        "name": "How Many Apples Can You Put into the Basket",
        "acceptance": "67.1",
        "difficulty": "Easy",
        "displayText": "1196. How Many Apples Can You Put into the Basket"
    },
    "1197": {
        "id": "1197",
        "name": "Minimum Knight Moves",
        "acceptance": "41.2",
        "difficulty": "Medium",
        "displayText": "1197. Minimum Knight Moves"
    },
    "1198": {
        "id": "1198",
        "name": "Find Smallest Common Element in All Rows",
        "acceptance": "76.4",
        "difficulty": "Medium",
        "displayText": "1198. Find Smallest Common Element in All Rows"
    },
    "1199": {
        "id": "1199",
        "name": "Minimum Time to Build Blocks",
        "acceptance": "46.1",
        "difficulty": "Hard",
        "displayText": "1199. Minimum Time to Build Blocks"
    },
    "1200": {
        "id": "1200",
        "name": "Minimum Absolute Difference",
        "acceptance": "70.4",
        "difficulty": "Easy",
        "displayText": "1200. Minimum Absolute Difference"
    },
    "1201": {
        "id": "1201",
        "name": "Ugly Number III",
        "acceptance": "30.3",
        "difficulty": "Medium",
        "displayText": "1201. Ugly Number III"
    },
    "1202": {
        "id": "1202",
        "name": "Smallest String With Swaps",
        "acceptance": "59.2",
        "difficulty": "Medium",
        "displayText": "1202. Smallest String With Swaps"
    },
    "1203": {
        "id": "1203",
        "name": "Sort Items by Groups Respecting Dependencies",
        "acceptance": "65.7",
        "difficulty": "Hard",
        "displayText": "1203. Sort Items by Groups Respecting Dependencies"
    },
    "1204": {
        "id": "1204",
        "name": "Last Person to Fit in the Bus",
        "acceptance": "68.3",
        "difficulty": "Medium",
        "displayText": "1204. Last Person to Fit in the Bus"
    },
    "1205": {
        "id": "1205",
        "name": "Monthly Transactions II",
        "acceptance": "42.0",
        "difficulty": "Medium",
        "displayText": "1205. Monthly Transactions II"
    },
    "1206": {
        "id": "1206",
        "name": "Design Skiplist",
        "acceptance": "61.9",
        "difficulty": "Hard",
        "displayText": "1206. Design Skiplist"
    },
    "1207": {
        "id": "1207",
        "name": "Unique Number of Occurrences",
        "acceptance": "78.1",
        "difficulty": "Easy",
        "displayText": "1207. Unique Number of Occurrences"
    },
    "1208": {
        "id": "1208",
        "name": "Get Equal Substrings Within Budget",
        "acceptance": "58.8",
        "difficulty": "Medium",
        "displayText": "1208. Get Equal Substrings Within Budget"
    },
    "1209": {
        "id": "1209",
        "name": "Remove All Adjacent Duplicates in String II",
        "acceptance": "59.3",
        "difficulty": "Medium",
        "displayText": "1209. Remove All Adjacent Duplicates in String II"
    },
    "1210": {
        "id": "1210",
        "name": "Minimum Moves to Reach Target with Rotations",
        "acceptance": "50.3",
        "difficulty": "Hard",
        "displayText": "1210. Minimum Moves to Reach Target with Rotations"
    },
    "1211": {
        "id": "1211",
        "name": "Queries Quality and Percentage",
        "acceptance": "47.1",
        "difficulty": "Easy",
        "displayText": "1211. Queries Quality and Percentage"
    },
    "1212": {
        "id": "1212",
        "name": "Team Scores in Football Tournament",
        "acceptance": "55.8",
        "difficulty": "Medium",
        "displayText": "1212. Team Scores in Football Tournament"
    },
    "1213": {
        "id": "1213",
        "name": "Intersection of Three Sorted Arrays",
        "acceptance": "80.1",
        "difficulty": "Easy",
        "displayText": "1213. Intersection of Three Sorted Arrays"
    },
    "1214": {
        "id": "1214",
        "name": "Two Sum BSTs",
        "acceptance": "67.3",
        "difficulty": "Medium",
        "displayText": "1214. Two Sum BSTs"
    },
    "1215": {
        "id": "1215",
        "name": "Stepping Numbers",
        "acceptance": "47.6",
        "difficulty": "Medium",
        "displayText": "1215. Stepping Numbers"
    },
    "1216": {
        "id": "1216",
        "name": "Valid Palindrome III",
        "acceptance": "49.0",
        "difficulty": "Hard",
        "displayText": "1216. Valid Palindrome III"
    },
    "1217": {
        "id": "1217",
        "name": "Minimum Cost to Move Chips to The Same Position",
        "acceptance": "72.1",
        "difficulty": "Easy",
        "displayText": "1217. Minimum Cost to Move Chips to The Same Position"
    },
    "1218": {
        "id": "1218",
        "name": "Longest Arithmetic Subsequence of Given Difference",
        "acceptance": "54.5",
        "difficulty": "Medium",
        "displayText": "1218. Longest Arithmetic Subsequence of Given Difference"
    },
    "1219": {
        "id": "1219",
        "name": "Path with Maximum Gold",
        "acceptance": "68.1",
        "difficulty": "Medium",
        "displayText": "1219. Path with Maximum Gold"
    },
    "1220": {
        "id": "1220",
        "name": "Count Vowels Permutation",
        "acceptance": "61.5",
        "difficulty": "Hard",
        "displayText": "1220. Count Vowels Permutation"
    },
    "1221": {
        "id": "1221",
        "name": "Split a String in Balanced Strings",
        "acceptance": "86.7",
        "difficulty": "Easy",
        "displayText": "1221. Split a String in Balanced Strings"
    },
    "1222": {
        "id": "1222",
        "name": "Queens That Can Attack the King",
        "acceptance": "72.1",
        "difficulty": "Medium",
        "displayText": "1222. Queens That Can Attack the King"
    },
    "1223": {
        "id": "1223",
        "name": "Dice Roll Simulation",
        "acceptance": "49.8",
        "difficulty": "Hard",
        "displayText": "1223. Dice Roll Simulation"
    },
    "1224": {
        "id": "1224",
        "name": "Maximum Equal Frequency",
        "acceptance": "37.3",
        "difficulty": "Hard",
        "displayText": "1224. Maximum Equal Frequency"
    },
    "1225": {
        "id": "1225",
        "name": "Report Contiguous Dates",
        "acceptance": "57.4",
        "difficulty": "Hard",
        "displayText": "1225. Report Contiguous Dates"
    },
    "1226": {
        "id": "1226",
        "name": "The Dining Philosophers",
        "acceptance": "54.6",
        "difficulty": "Medium",
        "displayText": "1226. The Dining Philosophers"
    },
    "1227": {
        "id": "1227",
        "name": "Airplane Seat Assignment Probability",
        "acceptance": "66.6",
        "difficulty": "Medium",
        "displayText": "1227. Airplane Seat Assignment Probability"
    },
    "1228": {
        "id": "1228",
        "name": "Missing Number In Arithmetic Progression",
        "acceptance": "52.1",
        "difficulty": "Easy",
        "displayText": "1228. Missing Number In Arithmetic Progression"
    },
    "1229": {
        "id": "1229",
        "name": "Meeting Scheduler",
        "acceptance": "55.2",
        "difficulty": "Medium",
        "displayText": "1229. Meeting Scheduler"
    },
    "1230": {
        "id": "1230",
        "name": "Toss Strange Coins",
        "acceptance": "58.1",
        "difficulty": "Medium",
        "displayText": "1230. Toss Strange Coins"
    },
    "1231": {
        "id": "1231",
        "name": "Divide Chocolate",
        "acceptance": "59.8",
        "difficulty": "Hard",
        "displayText": "1231. Divide Chocolate"
    },
    "1232": {
        "id": "1232",
        "name": "Check If It Is a Straight Line",
        "acceptance": "39.6",
        "difficulty": "Easy",
        "displayText": "1232. Check If It Is a Straight Line"
    },
    "1233": {
        "id": "1233",
        "name": "Remove Sub-Folders from the Filesystem",
        "acceptance": "75.7",
        "difficulty": "Medium",
        "displayText": "1233. Remove Sub-Folders from the Filesystem"
    },
    "1234": {
        "id": "1234",
        "name": "Replace the Substring for Balanced String",
        "acceptance": "39.3",
        "difficulty": "Medium",
        "displayText": "1234. Replace the Substring for Balanced String"
    },
    "1235": {
        "id": "1235",
        "name": "Maximum Profit in Job Scheduling",
        "acceptance": "54.3",
        "difficulty": "Hard",
        "displayText": "1235. Maximum Profit in Job Scheduling"
    },
    "1236": {
        "id": "1236",
        "name": "Web Crawler",
        "acceptance": "68.6",
        "difficulty": "Medium",
        "displayText": "1236. Web Crawler"
    },
    "1237": {
        "id": "1237",
        "name": "Find Positive Integer Solution for a Given Equation",
        "acceptance": "69.4",
        "difficulty": "Medium",
        "displayText": "1237. Find Positive Integer Solution for a Given Equation"
    },
    "1238": {
        "id": "1238",
        "name": "Circular Permutation in Binary Representation",
        "acceptance": "71.4",
        "difficulty": "Medium",
        "displayText": "1238. Circular Permutation in Binary Representation"
    },
    "1239": {
        "id": "1239",
        "name": "Maximum Length of a Concatenated String with Unique Characters",
        "acceptance": "54.2",
        "difficulty": "Medium",
        "displayText": "1239. Maximum Length of a Concatenated String with Unique Characters"
    },
    "1240": {
        "id": "1240",
        "name": "Tiling a Rectangle with the Fewest Squares",
        "acceptance": "54.3",
        "difficulty": "Hard",
        "displayText": "1240. Tiling a Rectangle with the Fewest Squares"
    },
    "1241": {
        "id": "1241",
        "name": "Number of Comments per Post",
        "acceptance": "66.0",
        "difficulty": "Easy",
        "displayText": "1241. Number of Comments per Post"
    },
    "1242": {
        "id": "1242",
        "name": "Web Crawler Multithreaded",
        "acceptance": "49.8",
        "difficulty": "Medium",
        "displayText": "1242. Web Crawler Multithreaded"
    },
    "1243": {
        "id": "1243",
        "name": "Array Transformation",
        "acceptance": "53.0",
        "difficulty": "Easy",
        "displayText": "1243. Array Transformation"
    },
    "1244": {
        "id": "1244",
        "name": "Design A Leaderboard",
        "acceptance": "67.9",
        "difficulty": "Medium",
        "displayText": "1244. Design A Leaderboard"
    },
    "1245": {
        "id": "1245",
        "name": "Tree Diameter",
        "acceptance": "61.0",
        "difficulty": "Medium",
        "displayText": "1245. Tree Diameter"
    },
    "1246": {
        "id": "1246",
        "name": "Palindrome Removal",
        "acceptance": "46.3",
        "difficulty": "Hard",
        "displayText": "1246. Palindrome Removal"
    },
    "1247": {
        "id": "1247",
        "name": "Minimum Swaps to Make Strings Equal",
        "acceptance": "64.5",
        "difficulty": "Medium",
        "displayText": "1247. Minimum Swaps to Make Strings Equal"
    },
    "1248": {
        "id": "1248",
        "name": "Count Number of Nice Subarrays",
        "acceptance": "72.7",
        "difficulty": "Medium",
        "displayText": "1248. Count Number of Nice Subarrays"
    },
    "1249": {
        "id": "1249",
        "name": "Minimum Remove to Make Valid Parentheses",
        "acceptance": "70.5",
        "difficulty": "Medium",
        "displayText": "1249. Minimum Remove to Make Valid Parentheses"
    },
    "1250": {
        "id": "1250",
        "name": "Check If It Is a Good Array",
        "acceptance": "60.9",
        "difficulty": "Hard",
        "displayText": "1250. Check If It Is a Good Array"
    },
    "1251": {
        "id": "1251",
        "name": "Average Selling Price",
        "acceptance": "36.9",
        "difficulty": "Easy",
        "displayText": "1251. Average Selling Price"
    },
    "1252": {
        "id": "1252",
        "name": "Cells with Odd Values in a Matrix",
        "acceptance": "79.2",
        "difficulty": "Easy",
        "displayText": "1252. Cells with Odd Values in a Matrix"
    },
    "1253": {
        "id": "1253",
        "name": "Reconstruct a 2-Row Binary Matrix",
        "acceptance": "47.5",
        "difficulty": "Medium",
        "displayText": "1253. Reconstruct a 2-Row Binary Matrix"
    },
    "1254": {
        "id": "1254",
        "name": "Number of Closed Islands",
        "acceptance": "66.7",
        "difficulty": "Medium",
        "displayText": "1254. Number of Closed Islands"
    },
    "1255": {
        "id": "1255",
        "name": "Maximum Score Words Formed by Letters",
        "acceptance": "81.6",
        "difficulty": "Hard",
        "displayText": "1255. Maximum Score Words Formed by Letters"
    },
    "1256": {
        "id": "1256",
        "name": "Encode Number",
        "acceptance": "70.1",
        "difficulty": "Medium",
        "displayText": "1256. Encode Number"
    },
    "1257": {
        "id": "1257",
        "name": "Smallest Common Region",
        "acceptance": "67.9",
        "difficulty": "Medium",
        "displayText": "1257. Smallest Common Region"
    },
    "1258": {
        "id": "1258",
        "name": "Synonymous Sentences",
        "acceptance": "56.5",
        "difficulty": "Medium",
        "displayText": "1258. Synonymous Sentences"
    },
    "1259": {
        "id": "1259",
        "name": "Handshakes That Don't Cross",
        "acceptance": "60.0",
        "difficulty": "Hard",
        "displayText": "1259. Handshakes That Don't Cross"
    },
    "1260": {
        "id": "1260",
        "name": "Shift 2D Grid",
        "acceptance": "67.6",
        "difficulty": "Easy",
        "displayText": "1260. Shift 2D Grid"
    },
    "1261": {
        "id": "1261",
        "name": "Find Elements in a Contaminated Binary Tree",
        "acceptance": "84.8",
        "difficulty": "Medium",
        "displayText": "1261. Find Elements in a Contaminated Binary Tree"
    },
    "1262": {
        "id": "1262",
        "name": "Greatest Sum Divisible by Three",
        "acceptance": "50.7",
        "difficulty": "Medium",
        "displayText": "1262. Greatest Sum Divisible by Three"
    },
    "1263": {
        "id": "1263",
        "name": "Minimum Moves to Move a Box to Their Target Location",
        "acceptance": "48.9",
        "difficulty": "Hard",
        "displayText": "1263. Minimum Moves to Move a Box to Their Target Location"
    },
    "1264": {
        "id": "1264",
        "name": "Page Recommendations",
        "acceptance": "65.4",
        "difficulty": "Medium",
        "displayText": "1264. Page Recommendations"
    },
    "1265": {
        "id": "1265",
        "name": "Print Immutable Linked List in Reverse",
        "acceptance": "94.0",
        "difficulty": "Medium",
        "displayText": "1265. Print Immutable Linked List in Reverse"
    },
    "1266": {
        "id": "1266",
        "name": "Minimum Time Visiting All Points",
        "acceptance": "82.5",
        "difficulty": "Easy",
        "displayText": "1266. Minimum Time Visiting All Points"
    },
    "1267": {
        "id": "1267",
        "name": "Count Servers that Communicate",
        "acceptance": "73.5",
        "difficulty": "Medium",
        "displayText": "1267. Count Servers that Communicate"
    },
    "1268": {
        "id": "1268",
        "name": "Search Suggestions System",
        "acceptance": "65.0",
        "difficulty": "Medium",
        "displayText": "1268. Search Suggestions System"
    },
    "1269": {
        "id": "1269",
        "name": "Number of Ways to Stay in the Same Place After Some Steps",
        "acceptance": "50.1",
        "difficulty": "Hard",
        "displayText": "1269. Number of Ways to Stay in the Same Place After Some Steps"
    },
    "1270": {
        "id": "1270",
        "name": "All People Report to the Given Manager",
        "acceptance": "84.5",
        "difficulty": "Medium",
        "displayText": "1270. All People Report to the Given Manager"
    },
    "1271": {
        "id": "1271",
        "name": "Hexspeak",
        "acceptance": "58.3",
        "difficulty": "Easy",
        "displayText": "1271. Hexspeak"
    },
    "1272": {
        "id": "1272",
        "name": "Remove Interval",
        "acceptance": "66.7",
        "difficulty": "Medium",
        "displayText": "1272. Remove Interval"
    },
    "1273": {
        "id": "1273",
        "name": "Delete Tree Nodes",
        "acceptance": "61.2",
        "difficulty": "Medium",
        "displayText": "1273. Delete Tree Nodes"
    },
    "1274": {
        "id": "1274",
        "name": "Number of Ships in a Rectangle",
        "acceptance": "68.8",
        "difficulty": "Hard",
        "displayText": "1274. Number of Ships in a Rectangle"
    },
    "1275": {
        "id": "1275",
        "name": "Find Winner on a Tic Tac Toe Game",
        "acceptance": "54.1",
        "difficulty": "Easy",
        "displayText": "1275. Find Winner on a Tic Tac Toe Game"
    },
    "1276": {
        "id": "1276",
        "name": "Number of Burgers with No Waste of Ingredients",
        "acceptance": "50.3",
        "difficulty": "Medium",
        "displayText": "1276. Number of Burgers with No Waste of Ingredients"
    },
    "1277": {
        "id": "1277",
        "name": "Count Square Submatrices with All Ones",
        "acceptance": "78.6",
        "difficulty": "Medium",
        "displayText": "1277. Count Square Submatrices with All Ones"
    },
    "1278": {
        "id": "1278",
        "name": "Palindrome Partitioning III",
        "acceptance": "61.4",
        "difficulty": "Hard",
        "displayText": "1278. Palindrome Partitioning III"
    },
    "1279": {
        "id": "1279",
        "name": "Traffic Light Controlled Intersection",
        "acceptance": "72.9",
        "difficulty": "Easy",
        "displayText": "1279. Traffic Light Controlled Intersection"
    },
    "1280": {
        "id": "1280",
        "name": "Students and Examinations",
        "acceptance": "60.4",
        "difficulty": "Easy",
        "displayText": "1280. Students and Examinations"
    },
    "1281": {
        "id": "1281",
        "name": "Subtract the Product and Sum of Digits of an Integer",
        "acceptance": "86.7",
        "difficulty": "Easy",
        "displayText": "1281. Subtract the Product and Sum of Digits of an Integer"
    },
    "1282": {
        "id": "1282",
        "name": "Group the People Given the Group Size They Belong To",
        "acceptance": "87.3",
        "difficulty": "Medium",
        "displayText": "1282. Group the People Given the Group Size They Belong To"
    },
    "1283": {
        "id": "1283",
        "name": "Find the Smallest Divisor Given a Threshold",
        "acceptance": "63.0",
        "difficulty": "Medium",
        "displayText": "1283. Find the Smallest Divisor Given a Threshold"
    },
    "1284": {
        "id": "1284",
        "name": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix",
        "acceptance": "71.9",
        "difficulty": "Hard",
        "displayText": "1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix"
    },
    "1285": {
        "id": "1285",
        "name": "Find the Start and End Number of Continuous Ranges",
        "acceptance": "81.9",
        "difficulty": "Medium",
        "displayText": "1285. Find the Start and End Number of Continuous Ranges"
    },
    "1286": {
        "id": "1286",
        "name": "Iterator for Combination",
        "acceptance": "73.5",
        "difficulty": "Medium",
        "displayText": "1286. Iterator for Combination"
    },
    "1287": {
        "id": "1287",
        "name": "Element Appearing More Than 25% In Sorted Array",
        "acceptance": "61.0",
        "difficulty": "Easy",
        "displayText": "1287. Element Appearing More Than 25% In Sorted Array"
    },
    "1288": {
        "id": "1288",
        "name": "Remove Covered Intervals",
        "acceptance": "56.2",
        "difficulty": "Medium",
        "displayText": "1288. Remove Covered Intervals"
    },
    "1289": {
        "id": "1289",
        "name": "Minimum Falling Path Sum II",
        "acceptance": "64.0",
        "difficulty": "Hard",
        "displayText": "1289. Minimum Falling Path Sum II"
    },
    "1290": {
        "id": "1290",
        "name": "Convert Binary Number in a Linked List to Integer",
        "acceptance": "81.2",
        "difficulty": "Easy",
        "displayText": "1290. Convert Binary Number in a Linked List to Integer"
    },
    "1291": {
        "id": "1291",
        "name": "Sequential Digits",
        "acceptance": "65.3",
        "difficulty": "Medium",
        "displayText": "1291. Sequential Digits"
    },
    "1292": {
        "id": "1292",
        "name": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold",
        "acceptance": "53.5",
        "difficulty": "Medium",
        "displayText": "1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold"
    },
    "1293": {
        "id": "1293",
        "name": "Shortest Path in a Grid with Obstacles Elimination",
        "acceptance": "45.5",
        "difficulty": "Hard",
        "displayText": "1293. Shortest Path in a Grid with Obstacles Elimination"
    },
    "1294": {
        "id": "1294",
        "name": "Weather Type in Each Country",
        "acceptance": "67.0",
        "difficulty": "Easy",
        "displayText": "1294. Weather Type in Each Country"
    },
    "1295": {
        "id": "1295",
        "name": "Find Numbers with Even Number of Digits",
        "acceptance": "77.8",
        "difficulty": "Easy",
        "displayText": "1295. Find Numbers with Even Number of Digits"
    },
    "1296": {
        "id": "1296",
        "name": "Divide Array in Sets of K Consecutive Numbers",
        "acceptance": "58.6",
        "difficulty": "Medium",
        "displayText": "1296. Divide Array in Sets of K Consecutive Numbers"
    },
    "1297": {
        "id": "1297",
        "name": "Maximum Number of Occurrences of a Substring",
        "acceptance": "53.1",
        "difficulty": "Medium",
        "displayText": "1297. Maximum Number of Occurrences of a Substring"
    },
    "1298": {
        "id": "1298",
        "name": "Maximum Candies You Can Get from Boxes",
        "acceptance": "57.5",
        "difficulty": "Hard",
        "displayText": "1298. Maximum Candies You Can Get from Boxes"
    },
    "1299": {
        "id": "1299",
        "name": "Replace Elements with Greatest Element on Right Side",
        "acceptance": "71.4",
        "difficulty": "Easy",
        "displayText": "1299. Replace Elements with Greatest Element on Right Side"
    },
    "1300": {
        "id": "1300",
        "name": "Sum of Mutated Array Closest to Target",
        "acceptance": "45.0",
        "difficulty": "Medium",
        "displayText": "1300. Sum of Mutated Array Closest to Target"
    },
    "1301": {
        "id": "1301",
        "name": "Number of Paths with Max Score",
        "acceptance": "40.8",
        "difficulty": "Hard",
        "displayText": "1301. Number of Paths with Max Score"
    },
    "1302": {
        "id": "1302",
        "name": "Deepest Leaves Sum",
        "acceptance": "86.3",
        "difficulty": "Medium",
        "displayText": "1302. Deepest Leaves Sum"
    },
    "1303": {
        "id": "1303",
        "name": "Find the Team Size",
        "acceptance": "89.7",
        "difficulty": "Easy",
        "displayText": "1303. Find the Team Size"
    },
    "1304": {
        "id": "1304",
        "name": "Find N Unique Integers Sum up to Zero",
        "acceptance": "76.1",
        "difficulty": "Easy",
        "displayText": "1304. Find N Unique Integers Sum up to Zero"
    },
    "1305": {
        "id": "1305",
        "name": "All Elements in Two Binary Search Trees",
        "acceptance": "80.0",
        "difficulty": "Medium",
        "displayText": "1305. All Elements in Two Binary Search Trees"
    },
    "1306": {
        "id": "1306",
        "name": "Jump Game III",
        "acceptance": "65.9",
        "difficulty": "Medium",
        "displayText": "1306. Jump Game III"
    },
    "1307": {
        "id": "1307",
        "name": "Verbal Arithmetic Puzzle",
        "acceptance": "34.7",
        "difficulty": "Hard",
        "displayText": "1307. Verbal Arithmetic Puzzle"
    },
    "1308": {
        "id": "1308",
        "name": "Running Total for Different Genders",
        "acceptance": "86.4",
        "difficulty": "Medium",
        "displayText": "1308. Running Total for Different Genders"
    },
    "1309": {
        "id": "1309",
        "name": "Decrypt String from Alphabet to Integer Mapping",
        "acceptance": "80.1",
        "difficulty": "Easy",
        "displayText": "1309. Decrypt String from Alphabet to Integer Mapping"
    },
    "1310": {
        "id": "1310",
        "name": "XOR Queries of a Subarray",
        "acceptance": "78.4",
        "difficulty": "Medium",
        "displayText": "1310. XOR Queries of a Subarray"
    },
    "1311": {
        "id": "1311",
        "name": "Get Watched Videos by Your Friends",
        "acceptance": "49.0",
        "difficulty": "Medium",
        "displayText": "1311. Get Watched Videos by Your Friends"
    },
    "1312": {
        "id": "1312",
        "name": "Minimum Insertion Steps to Make a String Palindrome",
        "acceptance": "72.1",
        "difficulty": "Hard",
        "displayText": "1312. Minimum Insertion Steps to Make a String Palindrome"
    },
    "1313": {
        "id": "1313",
        "name": "Decompress Run-Length Encoded List",
        "acceptance": "86.0",
        "difficulty": "Easy",
        "displayText": "1313. Decompress Run-Length Encoded List"
    },
    "1314": {
        "id": "1314",
        "name": "Matrix Block Sum",
        "acceptance": "75.8",
        "difficulty": "Medium",
        "displayText": "1314. Matrix Block Sum"
    },
    "1315": {
        "id": "1315",
        "name": "Sum of Nodes with Even-Valued Grandparent",
        "acceptance": "85.7",
        "difficulty": "Medium",
        "displayText": "1315. Sum of Nodes with Even-Valued Grandparent"
    },
    "1316": {
        "id": "1316",
        "name": "Distinct Echo Substrings",
        "acceptance": "51.7",
        "difficulty": "Hard",
        "displayText": "1316. Distinct Echo Substrings"
    },
    "1317": {
        "id": "1317",
        "name": "Convert Integer to the Sum of Two No-Zero Integers",
        "acceptance": "54.1",
        "difficulty": "Easy",
        "displayText": "1317. Convert Integer to the Sum of Two No-Zero Integers"
    },
    "1318": {
        "id": "1318",
        "name": "Minimum Flips to Make a OR b Equal to c",
        "acceptance": "71.5",
        "difficulty": "Medium",
        "displayText": "1318. Minimum Flips to Make a OR b Equal to c"
    },
    "1319": {
        "id": "1319",
        "name": "Number of Operations to Make Network Connected",
        "acceptance": "64.2",
        "difficulty": "Medium",
        "displayText": "1319. Number of Operations to Make Network Connected"
    },
    "1320": {
        "id": "1320",
        "name": "Minimum Distance to Type a Word Using Two Fingers",
        "acceptance": "59.0",
        "difficulty": "Hard",
        "displayText": "1320. Minimum Distance to Type a Word Using Two Fingers"
    },
    "1321": {
        "id": "1321",
        "name": "Restaurant Growth",
        "acceptance": "56.1",
        "difficulty": "Medium",
        "displayText": "1321. Restaurant Growth"
    },
    "1322": {
        "id": "1322",
        "name": "Ads Performance",
        "acceptance": "59.3",
        "difficulty": "Easy",
        "displayText": "1322. Ads Performance"
    },
    "1323": {
        "id": "1323",
        "name": "Maximum 69 Number",
        "acceptance": "82.5",
        "difficulty": "Easy",
        "displayText": "1323. Maximum 69 Number"
    },
    "1324": {
        "id": "1324",
        "name": "Print Words Vertically",
        "acceptance": "65.9",
        "difficulty": "Medium",
        "displayText": "1324. Print Words Vertically"
    },
    "1325": {
        "id": "1325",
        "name": "Delete Leaves With a Given Value",
        "acceptance": "77.3",
        "difficulty": "Medium",
        "displayText": "1325. Delete Leaves With a Given Value"
    },
    "1326": {
        "id": "1326",
        "name": "Minimum Number of Taps to Open to Water a Garden",
        "acceptance": "50.7",
        "difficulty": "Hard",
        "displayText": "1326. Minimum Number of Taps to Open to Water a Garden"
    },
    "1327": {
        "id": "1327",
        "name": "List the Products Ordered in a Period",
        "acceptance": "71.8",
        "difficulty": "Easy",
        "displayText": "1327. List the Products Ordered in a Period"
    },
    "1328": {
        "id": "1328",
        "name": "Break a Palindrome",
        "acceptance": "51.5",
        "difficulty": "Medium",
        "displayText": "1328. Break a Palindrome"
    },
    "1329": {
        "id": "1329",
        "name": "Sort the Matrix Diagonally",
        "acceptance": "82.9",
        "difficulty": "Medium",
        "displayText": "1329. Sort the Matrix Diagonally"
    },
    "1330": {
        "id": "1330",
        "name": "Reverse Subarray To Maximize Array Value",
        "acceptance": "42.2",
        "difficulty": "Hard",
        "displayText": "1330. Reverse Subarray To Maximize Array Value"
    },
    "1331": {
        "id": "1331",
        "name": "Rank Transform of an Array",
        "acceptance": "70.6",
        "difficulty": "Easy",
        "displayText": "1331. Rank Transform of an Array"
    },
    "1332": {
        "id": "1332",
        "name": "Remove Palindromic Subsequences",
        "acceptance": "76.6",
        "difficulty": "Easy",
        "displayText": "1332. Remove Palindromic Subsequences"
    },
    "1333": {
        "id": "1333",
        "name": "Filter Restaurants by Vegan-Friendly, Price and Distance",
        "acceptance": "63.0",
        "difficulty": "Medium",
        "displayText": "1333. Filter Restaurants by Vegan-Friendly, Price and Distance"
    },
    "1334": {
        "id": "1334",
        "name": "Find the City With the Smallest Number of Neighbors at a Threshold Distance",
        "acceptance": "69.6",
        "difficulty": "Medium",
        "displayText": "1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance"
    },
    "1335": {
        "id": "1335",
        "name": "Minimum Difficulty of a Job Schedule",
        "acceptance": "59.6",
        "difficulty": "Hard",
        "displayText": "1335. Minimum Difficulty of a Job Schedule"
    },
    "1336": {
        "id": "1336",
        "name": "Number of Transactions per Visit",
        "acceptance": "48.1",
        "difficulty": "Hard",
        "displayText": "1336. Number of Transactions per Visit"
    },
    "1337": {
        "id": "1337",
        "name": "The K Weakest Rows in a Matrix",
        "acceptance": "73.9",
        "difficulty": "Easy",
        "displayText": "1337. The K Weakest Rows in a Matrix"
    },
    "1338": {
        "id": "1338",
        "name": "Reduce Array Size to The Half",
        "acceptance": "69.1",
        "difficulty": "Medium",
        "displayText": "1338. Reduce Array Size to The Half"
    },
    "1339": {
        "id": "1339",
        "name": "Maximum Product of Splitted Binary Tree",
        "acceptance": "47.8",
        "difficulty": "Medium",
        "displayText": "1339. Maximum Product of Splitted Binary Tree"
    },
    "1340": {
        "id": "1340",
        "name": "Jump Game V",
        "acceptance": "63.9",
        "difficulty": "Hard",
        "displayText": "1340. Jump Game V"
    },
    "1341": {
        "id": "1341",
        "name": "Movie Rating",
        "acceptance": "41.3",
        "difficulty": "Medium",
        "displayText": "1341. Movie Rating"
    },
    "1342": {
        "id": "1342",
        "name": "Number of Steps to Reduce a Number to Zero",
        "acceptance": "85.6",
        "difficulty": "Easy",
        "displayText": "1342. Number of Steps to Reduce a Number to Zero"
    },
    "1343": {
        "id": "1343",
        "name": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold",
        "acceptance": "69.9",
        "difficulty": "Medium",
        "displayText": "1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold"
    },
    "1344": {
        "id": "1344",
        "name": "Angle Between Hands of a Clock",
        "acceptance": "64.1",
        "difficulty": "Medium",
        "displayText": "1344. Angle Between Hands of a Clock"
    },
    "1345": {
        "id": "1345",
        "name": "Jump Game IV",
        "acceptance": "46.1",
        "difficulty": "Hard",
        "displayText": "1345. Jump Game IV"
    },
    "1346": {
        "id": "1346",
        "name": "Check If N and Its Double Exist",
        "acceptance": "41.1",
        "difficulty": "Easy",
        "displayText": "1346. Check If N and Its Double Exist"
    },
    "1347": {
        "id": "1347",
        "name": "Minimum Number of Steps to Make Two Strings Anagram",
        "acceptance": "82.1",
        "difficulty": "Medium",
        "displayText": "1347. Minimum Number of Steps to Make Two Strings Anagram"
    },
    "1348": {
        "id": "1348",
        "name": "Tweet Counts Per Frequency",
        "acceptance": "45.2",
        "difficulty": "Medium",
        "displayText": "1348. Tweet Counts Per Frequency"
    },
    "1349": {
        "id": "1349",
        "name": "Maximum Students Taking Exam",
        "acceptance": "51.9",
        "difficulty": "Hard",
        "displayText": "1349. Maximum Students Taking Exam"
    },
    "1350": {
        "id": "1350",
        "name": "Students With Invalid Departments",
        "acceptance": "89.9",
        "difficulty": "Easy",
        "displayText": "1350. Students With Invalid Departments"
    },
    "1351": {
        "id": "1351",
        "name": "Count Negative Numbers in a Sorted Matrix",
        "acceptance": "77.6",
        "difficulty": "Easy",
        "displayText": "1351. Count Negative Numbers in a Sorted Matrix"
    },
    "1352": {
        "id": "1352",
        "name": "Product of the Last K Numbers",
        "acceptance": "62.9",
        "difficulty": "Medium",
        "displayText": "1352. Product of the Last K Numbers"
    },
    "1353": {
        "id": "1353",
        "name": "Maximum Number of Events That Can Be Attended",
        "acceptance": "32.8",
        "difficulty": "Medium",
        "displayText": "1353. Maximum Number of Events That Can Be Attended"
    },
    "1354": {
        "id": "1354",
        "name": "Construct Target Array With Multiple Sums",
        "acceptance": "36.2",
        "difficulty": "Hard",
        "displayText": "1354. Construct Target Array With Multiple Sums"
    },
    "1355": {
        "id": "1355",
        "name": "Activity Participants",
        "acceptance": "72.4",
        "difficulty": "Medium",
        "displayText": "1355. Activity Participants"
    },
    "1356": {
        "id": "1356",
        "name": "Sort Integers by The Number of 1 Bits",
        "acceptance": "78.6",
        "difficulty": "Easy",
        "displayText": "1356. Sort Integers by The Number of 1 Bits"
    },
    "1357": {
        "id": "1357",
        "name": "Apply Discount Every n Orders",
        "acceptance": "71.6",
        "difficulty": "Medium",
        "displayText": "1357. Apply Discount Every n Orders"
    },
    "1358": {
        "id": "1358",
        "name": "Number of Substrings Containing All Three Characters",
        "acceptance": "73.0",
        "difficulty": "Medium",
        "displayText": "1358. Number of Substrings Containing All Three Characters"
    },
    "1359": {
        "id": "1359",
        "name": "Count All Valid Pickup and Delivery Options",
        "acceptance": "64.9",
        "difficulty": "Hard",
        "displayText": "1359. Count All Valid Pickup and Delivery Options"
    },
    "1360": {
        "id": "1360",
        "name": "Number of Days Between Two Dates",
        "acceptance": "51.1",
        "difficulty": "Easy",
        "displayText": "1360. Number of Days Between Two Dates"
    },
    "1361": {
        "id": "1361",
        "name": "Validate Binary Tree Nodes",
        "acceptance": "43.9",
        "difficulty": "Medium",
        "displayText": "1361. Validate Binary Tree Nodes"
    },
    "1362": {
        "id": "1362",
        "name": "Closest Divisors",
        "acceptance": "61.2",
        "difficulty": "Medium",
        "displayText": "1362. Closest Divisors"
    },
    "1363": {
        "id": "1363",
        "name": "Largest Multiple of Three",
        "acceptance": "32.7",
        "difficulty": "Hard",
        "displayText": "1363. Largest Multiple of Three"
    },
    "1364": {
        "id": "1364",
        "name": "Number of Trusted Contacts of a Customer",
        "acceptance": "75.2",
        "difficulty": "Medium",
        "displayText": "1364. Number of Trusted Contacts of a Customer"
    },
    "1365": {
        "id": "1365",
        "name": "How Many Numbers Are Smaller Than the Current Number",
        "acceptance": "87.1",
        "difficulty": "Easy",
        "displayText": "1365. How Many Numbers Are Smaller Than the Current Number"
    },
    "1366": {
        "id": "1366",
        "name": "Rank Teams by Votes",
        "acceptance": "59.2",
        "difficulty": "Medium",
        "displayText": "1366. Rank Teams by Votes"
    },
    "1367": {
        "id": "1367",
        "name": "Linked List in Binary Tree",
        "acceptance": "51.9",
        "difficulty": "Medium",
        "displayText": "1367. Linked List in Binary Tree"
    },
    "1368": {
        "id": "1368",
        "name": "Minimum Cost to Make at Least One Valid Path in a Grid",
        "acceptance": "70.7",
        "difficulty": "Hard",
        "displayText": "1368. Minimum Cost to Make at Least One Valid Path in a Grid"
    },
    "1369": {
        "id": "1369",
        "name": "Get the Second Most Recent Activity",
        "acceptance": "67.5",
        "difficulty": "Hard",
        "displayText": "1369. Get the Second Most Recent Activity"
    },
    "1370": {
        "id": "1370",
        "name": "Increasing Decreasing String",
        "acceptance": "76.6",
        "difficulty": "Easy",
        "displayText": "1370. Increasing Decreasing String"
    },
    "1371": {
        "id": "1371",
        "name": "Find the Longest Substring Containing Vowels in Even Counts",
        "acceptance": "75.8",
        "difficulty": "Medium",
        "displayText": "1371. Find the Longest Substring Containing Vowels in Even Counts"
    },
    "1372": {
        "id": "1372",
        "name": "Longest ZigZag Path in a Binary Tree",
        "acceptance": "66.4",
        "difficulty": "Medium",
        "displayText": "1372. Longest ZigZag Path in a Binary Tree"
    },
    "1373": {
        "id": "1373",
        "name": "Maximum Sum BST in Binary Tree",
        "acceptance": "43.6",
        "difficulty": "Hard",
        "displayText": "1373. Maximum Sum BST in Binary Tree"
    },
    "1374": {
        "id": "1374",
        "name": "Generate a String With Characters That Have Odd Counts",
        "acceptance": "78.0",
        "difficulty": "Easy",
        "displayText": "1374. Generate a String With Characters That Have Odd Counts"
    },
    "1375": {
        "id": "1375",
        "name": "Number of Times Binary String Is Prefix-Aligned",
        "acceptance": "65.7",
        "difficulty": "Medium",
        "displayText": "1375. Number of Times Binary String Is Prefix-Aligned"
    },
    "1376": {
        "id": "1376",
        "name": "Time Needed to Inform All Employees",
        "acceptance": "60.2",
        "difficulty": "Medium",
        "displayText": "1376. Time Needed to Inform All Employees"
    },
    "1377": {
        "id": "1377",
        "name": "Frog Position After T Seconds",
        "acceptance": "35.7",
        "difficulty": "Hard",
        "displayText": "1377. Frog Position After T Seconds"
    },
    "1378": {
        "id": "1378",
        "name": "Replace Employee ID With The Unique Identifier",
        "acceptance": "83.6",
        "difficulty": "Easy",
        "displayText": "1378. Replace Employee ID With The Unique Identifier"
    },
    "1379": {
        "id": "1379",
        "name": "Find a Corresponding Node of a Binary Tree in a Clone of That Tree",
        "acceptance": "85.7",
        "difficulty": "Easy",
        "displayText": "1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree"
    },
    "1380": {
        "id": "1380",
        "name": "Lucky Numbers in a Matrix",
        "acceptance": "79.9",
        "difficulty": "Easy",
        "displayText": "1380. Lucky Numbers in a Matrix"
    },
    "1381": {
        "id": "1381",
        "name": "Design a Stack With Increment Operation",
        "acceptance": "80.4",
        "difficulty": "Medium",
        "displayText": "1381. Design a Stack With Increment Operation"
    },
    "1382": {
        "id": "1382",
        "name": "Balance a Binary Search Tree",
        "acceptance": "84.6",
        "difficulty": "Medium",
        "displayText": "1382. Balance a Binary Search Tree"
    },
    "1383": {
        "id": "1383",
        "name": "Maximum Performance of a Team",
        "acceptance": "47.5",
        "difficulty": "Hard",
        "displayText": "1383. Maximum Performance of a Team"
    },
    "1384": {
        "id": "1384",
        "name": "Total Sales Amount by Year",
        "acceptance": "61.4",
        "difficulty": "Hard",
        "displayText": "1384. Total Sales Amount by Year"
    },
    "1385": {
        "id": "1385",
        "name": "Find the Distance Value Between Two Arrays",
        "acceptance": "69.9",
        "difficulty": "Easy",
        "displayText": "1385. Find the Distance Value Between Two Arrays"
    },
    "1386": {
        "id": "1386",
        "name": "Cinema Seat Allocation",
        "acceptance": "42.6",
        "difficulty": "Medium",
        "displayText": "1386. Cinema Seat Allocation"
    },
    "1387": {
        "id": "1387",
        "name": "Sort Integers by The Power Value",
        "acceptance": "70.6",
        "difficulty": "Medium",
        "displayText": "1387. Sort Integers by The Power Value"
    },
    "1388": {
        "id": "1388",
        "name": "Pizza With 3n Slices",
        "acceptance": "52.7",
        "difficulty": "Hard",
        "displayText": "1388. Pizza With 3n Slices"
    },
    "1389": {
        "id": "1389",
        "name": "Create Target Array in the Given Order",
        "acceptance": "86.2",
        "difficulty": "Easy",
        "displayText": "1389. Create Target Array in the Given Order"
    },
    "1390": {
        "id": "1390",
        "name": "Four Divisors",
        "acceptance": "44.5",
        "difficulty": "Medium",
        "displayText": "1390. Four Divisors"
    },
    "1391": {
        "id": "1391",
        "name": "Check if There is a Valid Path in a Grid",
        "acceptance": "48.7",
        "difficulty": "Medium",
        "displayText": "1391. Check if There is a Valid Path in a Grid"
    },
    "1392": {
        "id": "1392",
        "name": "Longest Happy Prefix",
        "acceptance": "48.4",
        "difficulty": "Hard",
        "displayText": "1392. Longest Happy Prefix"
    },
    "1393": {
        "id": "1393",
        "name": "Capital Gain/Loss",
        "acceptance": "85.0",
        "difficulty": "Medium",
        "displayText": "1393. Capital Gain/Loss"
    },
    "1394": {
        "id": "1394",
        "name": "Find Lucky Integer in an Array",
        "acceptance": "69.0",
        "difficulty": "Easy",
        "displayText": "1394. Find Lucky Integer in an Array"
    },
    "1395": {
        "id": "1395",
        "name": "Count Number of Teams",
        "acceptance": "70.1",
        "difficulty": "Medium",
        "displayText": "1395. Count Number of Teams"
    },
    "1396": {
        "id": "1396",
        "name": "Design Underground System",
        "acceptance": "74.8",
        "difficulty": "Medium",
        "displayText": "1396. Design Underground System"
    },
    "1397": {
        "id": "1397",
        "name": "Find All Good Strings",
        "acceptance": "43.4",
        "difficulty": "Hard",
        "displayText": "1397. Find All Good Strings"
    },
    "1398": {
        "id": "1398",
        "name": "Customers Who Bought Products A and B but Not C",
        "acceptance": "72.0",
        "difficulty": "Medium",
        "displayText": "1398. Customers Who Bought Products A and B but Not C"
    },
    "1399": {
        "id": "1399",
        "name": "Count Largest Group",
        "acceptance": "66.5",
        "difficulty": "Easy",
        "displayText": "1399. Count Largest Group"
    },
    "1400": {
        "id": "1400",
        "name": "Construct K Palindrome Strings",
        "acceptance": "68.7",
        "difficulty": "Medium",
        "displayText": "1400. Construct K Palindrome Strings"
    },
    "1401": {
        "id": "1401",
        "name": "Circle and Rectangle Overlapping",
        "acceptance": "48.6",
        "difficulty": "Medium",
        "displayText": "1401. Circle and Rectangle Overlapping"
    },
    "1402": {
        "id": "1402",
        "name": "Reducing Dishes",
        "acceptance": "76.3",
        "difficulty": "Hard",
        "displayText": "1402. Reducing Dishes"
    },
    "1403": {
        "id": "1403",
        "name": "Minimum Subsequence in Non-Increasing Order",
        "acceptance": "72.8",
        "difficulty": "Easy",
        "displayText": "1403. Minimum Subsequence in Non-Increasing Order"
    },
    "1404": {
        "id": "1404",
        "name": "Number of Steps to Reduce a Number in Binary Representation to One",
        "acceptance": "61.4",
        "difficulty": "Medium",
        "displayText": "1404. Number of Steps to Reduce a Number in Binary Representation to One"
    },
    "1405": {
        "id": "1405",
        "name": "Longest Happy String",
        "acceptance": "65.5",
        "difficulty": "Medium",
        "displayText": "1405. Longest Happy String"
    },
    "1406": {
        "id": "1406",
        "name": "Stone Game III",
        "acceptance": "63.2",
        "difficulty": "Hard",
        "displayText": "1406. Stone Game III"
    },
    "1407": {
        "id": "1407",
        "name": "Top Travellers",
        "acceptance": "57.1",
        "difficulty": "Easy",
        "displayText": "1407. Top Travellers"
    },
    "1408": {
        "id": "1408",
        "name": "String Matching in an Array",
        "acceptance": "69.8",
        "difficulty": "Easy",
        "displayText": "1408. String Matching in an Array"
    },
    "1409": {
        "id": "1409",
        "name": "Queries on a Permutation With Key",
        "acceptance": "84.5",
        "difficulty": "Medium",
        "displayText": "1409. Queries on a Permutation With Key"
    },
    "1410": {
        "id": "1410",
        "name": "HTML Entity Parser",
        "acceptance": "50.2",
        "difficulty": "Medium",
        "displayText": "1410. HTML Entity Parser"
    },
    "1411": {
        "id": "1411",
        "name": "Number of Ways to Paint N \u00d7 3 Grid",
        "acceptance": "64.2",
        "difficulty": "Hard",
        "displayText": "1411. Number of Ways to Paint N \u00d7 3 Grid"
    },
    "1412": {
        "id": "1412",
        "name": "Find the Quiet Students in All Exams",
        "acceptance": "58.5",
        "difficulty": "Hard",
        "displayText": "1412. Find the Quiet Students in All Exams"
    },
    "1413": {
        "id": "1413",
        "name": "Minimum Value to Get Positive Step by Step Sum",
        "acceptance": "64.8",
        "difficulty": "Easy",
        "displayText": "1413. Minimum Value to Get Positive Step by Step Sum"
    },
    "1414": {
        "id": "1414",
        "name": "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K",
        "acceptance": "64.2",
        "difficulty": "Medium",
        "displayText": "1414. Find the Minimum Number of Fibonacci Numbers Whose Sum Is K"
    },
    "1415": {
        "id": "1415",
        "name": "The k-th Lexicographical String of All Happy Strings of Length n",
        "acceptance": "85.1",
        "difficulty": "Medium",
        "displayText": "1415. The k-th Lexicographical String of All Happy Strings of Length n"
    },
    "1416": {
        "id": "1416",
        "name": "Restore The Array",
        "acceptance": "47.0",
        "difficulty": "Hard",
        "displayText": "1416. Restore The Array"
    },
    "1417": {
        "id": "1417",
        "name": "Reformat The String",
        "acceptance": "52.0",
        "difficulty": "Easy",
        "displayText": "1417. Reformat The String"
    },
    "1418": {
        "id": "1418",
        "name": "Display Table of Food Orders in a Restaurant",
        "acceptance": "75.5",
        "difficulty": "Medium",
        "displayText": "1418. Display Table of Food Orders in a Restaurant"
    },
    "1419": {
        "id": "1419",
        "name": "Minimum Number of Frogs Croaking",
        "acceptance": "50.7",
        "difficulty": "Medium",
        "displayText": "1419. Minimum Number of Frogs Croaking"
    },
    "1420": {
        "id": "1420",
        "name": "Build Array Where You Can Find The Maximum Exactly K Comparisons",
        "acceptance": "67.0",
        "difficulty": "Hard",
        "displayText": "1420. Build Array Where You Can Find The Maximum Exactly K Comparisons"
    },
    "1421": {
        "id": "1421",
        "name": "NPV Queries",
        "acceptance": "83.0",
        "difficulty": "Easy",
        "displayText": "1421. NPV Queries"
    },
    "1422": {
        "id": "1422",
        "name": "Maximum Score After Splitting a String",
        "acceptance": "65.2",
        "difficulty": "Easy",
        "displayText": "1422. Maximum Score After Splitting a String"
    },
    "1423": {
        "id": "1423",
        "name": "Maximum Points You Can Obtain from Cards",
        "acceptance": "55.1",
        "difficulty": "Medium",
        "displayText": "1423. Maximum Points You Can Obtain from Cards"
    },
    "1424": {
        "id": "1424",
        "name": "Diagonal Traverse II",
        "acceptance": "57.8",
        "difficulty": "Medium",
        "displayText": "1424. Diagonal Traverse II"
    },
    "1425": {
        "id": "1425",
        "name": "Constrained Subsequence Sum",
        "acceptance": "56.4",
        "difficulty": "Hard",
        "displayText": "1425. Constrained Subsequence Sum"
    },
    "1426": {
        "id": "1426",
        "name": "Counting Elements",
        "acceptance": "60.4",
        "difficulty": "Easy",
        "displayText": "1426. Counting Elements"
    },
    "1427": {
        "id": "1427",
        "name": "Perform String Shifts",
        "acceptance": "55.8",
        "difficulty": "Easy",
        "displayText": "1427. Perform String Shifts"
    },
    "1428": {
        "id": "1428",
        "name": "Leftmost Column with at Least a One",
        "acceptance": "54.9",
        "difficulty": "Medium",
        "displayText": "1428. Leftmost Column with at Least a One"
    },
    "1429": {
        "id": "1429",
        "name": "First Unique Number",
        "acceptance": "55.2",
        "difficulty": "Medium",
        "displayText": "1429. First Unique Number"
    },
    "1430": {
        "id": "1430",
        "name": "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree",
        "acceptance": "47.2",
        "difficulty": "Medium",
        "displayText": "1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree"
    },
    "1431": {
        "id": "1431",
        "name": "Kids With the Greatest Number of Candies",
        "acceptance": "88.1",
        "difficulty": "Easy",
        "displayText": "1431. Kids With the Greatest Number of Candies"
    },
    "1432": {
        "id": "1432",
        "name": "Max Difference You Can Get From Changing an Integer",
        "acceptance": "40.3",
        "difficulty": "Medium",
        "displayText": "1432. Max Difference You Can Get From Changing an Integer"
    },
    "1433": {
        "id": "1433",
        "name": "Check If a String Can Break Another String",
        "acceptance": "70.1",
        "difficulty": "Medium",
        "displayText": "1433. Check If a String Can Break Another String"
    },
    "1434": {
        "id": "1434",
        "name": "Number of Ways to Wear Different Hats to Each Other",
        "acceptance": "44.2",
        "difficulty": "Hard",
        "displayText": "1434. Number of Ways to Wear Different Hats to Each Other"
    },
    "1435": {
        "id": "1435",
        "name": "Create a Session Bar Chart",
        "acceptance": "75.0",
        "difficulty": "Easy",
        "displayText": "1435. Create a Session Bar Chart"
    },
    "1436": {
        "id": "1436",
        "name": "Destination City",
        "acceptance": "79.4",
        "difficulty": "Easy",
        "displayText": "1436. Destination City"
    },
    "1437": {
        "id": "1437",
        "name": "Check If All 1's Are at Least Length K Places Away",
        "acceptance": "58.0",
        "difficulty": "Easy",
        "displayText": "1437. Check If All 1's Are at Least Length K Places Away"
    },
    "1438": {
        "id": "1438",
        "name": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit",
        "acceptance": "56.6",
        "difficulty": "Medium",
        "displayText": "1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit"
    },
    "1439": {
        "id": "1439",
        "name": "Find the Kth Smallest Sum of a Matrix With Sorted Rows",
        "acceptance": "61.9",
        "difficulty": "Hard",
        "displayText": "1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows"
    },
    "1440": {
        "id": "1440",
        "name": "Evaluate Boolean Expression",
        "acceptance": "72.3",
        "difficulty": "Medium",
        "displayText": "1440. Evaluate Boolean Expression"
    },
    "1441": {
        "id": "1441",
        "name": "Build an Array With Stack Operations",
        "acceptance": "80.1",
        "difficulty": "Medium",
        "displayText": "1441. Build an Array With Stack Operations"
    },
    "1442": {
        "id": "1442",
        "name": "Count Triplets That Can Form Two Arrays of Equal XOR",
        "acceptance": "84.8",
        "difficulty": "Medium",
        "displayText": "1442. Count Triplets That Can Form Two Arrays of Equal XOR"
    },
    "1443": {
        "id": "1443",
        "name": "Minimum Time to Collect All Apples in a Tree",
        "acceptance": "62.8",
        "difficulty": "Medium",
        "displayText": "1443. Minimum Time to Collect All Apples in a Tree"
    },
    "1444": {
        "id": "1444",
        "name": "Number of Ways of Cutting a Pizza",
        "acceptance": "61.6",
        "difficulty": "Hard",
        "displayText": "1444. Number of Ways of Cutting a Pizza"
    },
    "1445": {
        "id": "1445",
        "name": "Apples & Oranges",
        "acceptance": "86.1",
        "difficulty": "Medium",
        "displayText": "1445. Apples & Oranges"
    },
    "1446": {
        "id": "1446",
        "name": "Consecutive Characters",
        "acceptance": "60.1",
        "difficulty": "Easy",
        "displayText": "1446. Consecutive Characters"
    },
    "1447": {
        "id": "1447",
        "name": "Simplified Fractions",
        "acceptance": "68.0",
        "difficulty": "Medium",
        "displayText": "1447. Simplified Fractions"
    },
    "1448": {
        "id": "1448",
        "name": "Count Good Nodes in Binary Tree",
        "acceptance": "73.4",
        "difficulty": "Medium",
        "displayText": "1448. Count Good Nodes in Binary Tree"
    },
    "1449": {
        "id": "1449",
        "name": "Form Largest Integer With Digits That Add up to Target",
        "acceptance": "48.5",
        "difficulty": "Hard",
        "displayText": "1449. Form Largest Integer With Digits That Add up to Target"
    },
    "1450": {
        "id": "1450",
        "name": "Number of Students Doing Homework at a Given Time",
        "acceptance": "75.6",
        "difficulty": "Easy",
        "displayText": "1450. Number of Students Doing Homework at a Given Time"
    },
    "1451": {
        "id": "1451",
        "name": "Rearrange Words in a Sentence",
        "acceptance": "65.6",
        "difficulty": "Medium",
        "displayText": "1451. Rearrange Words in a Sentence"
    },
    "1452": {
        "id": "1452",
        "name": "People Whose List of Favorite Companies Is Not a Subset of Another List",
        "acceptance": "59.0",
        "difficulty": "Medium",
        "displayText": "1452. People Whose List of Favorite Companies Is Not a Subset of Another List"
    },
    "1453": {
        "id": "1453",
        "name": "Maximum Number of Darts Inside of a Circular Dartboard",
        "acceptance": "37.7",
        "difficulty": "Hard",
        "displayText": "1453. Maximum Number of Darts Inside of a Circular Dartboard"
    },
    "1454": {
        "id": "1454",
        "name": "Active Users",
        "acceptance": "36.6",
        "difficulty": "Medium",
        "displayText": "1454. Active Users"
    },
    "1455": {
        "id": "1455",
        "name": "Check If a Word Occurs As a Prefix of Any Word in a Sentence",
        "acceptance": "68.8",
        "difficulty": "Easy",
        "displayText": "1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence"
    },
    "1456": {
        "id": "1456",
        "name": "Maximum Number of Vowels in a Substring of Given Length",
        "acceptance": "60.0",
        "difficulty": "Medium",
        "displayText": "1456. Maximum Number of Vowels in a Substring of Given Length"
    },
    "1457": {
        "id": "1457",
        "name": "Pseudo-Palindromic Paths in a Binary Tree",
        "acceptance": "68.3",
        "difficulty": "Medium",
        "displayText": "1457. Pseudo-Palindromic Paths in a Binary Tree"
    },
    "1458": {
        "id": "1458",
        "name": "Max Dot Product of Two Subsequences",
        "acceptance": "62.3",
        "difficulty": "Hard",
        "displayText": "1458. Max Dot Product of Two Subsequences"
    },
    "1459": {
        "id": "1459",
        "name": "Rectangles Area",
        "acceptance": "68.7",
        "difficulty": "Medium",
        "displayText": "1459. Rectangles Area"
    },
    "1460": {
        "id": "1460",
        "name": "Make Two Arrays Equal by Reversing Subarrays",
        "acceptance": "75.8",
        "difficulty": "Easy",
        "displayText": "1460. Make Two Arrays Equal by Reversing Subarrays"
    },
    "1461": {
        "id": "1461",
        "name": "Check If a String Contains All Binary Codes of Size K",
        "acceptance": "56.6",
        "difficulty": "Medium",
        "displayText": "1461. Check If a String Contains All Binary Codes of Size K"
    },
    "1462": {
        "id": "1462",
        "name": "Course Schedule IV",
        "acceptance": "59.5",
        "difficulty": "Medium",
        "displayText": "1462. Course Schedule IV"
    },
    "1463": {
        "id": "1463",
        "name": "Cherry Pickup II",
        "acceptance": "71.9",
        "difficulty": "Hard",
        "displayText": "1463. Cherry Pickup II"
    },
    "1464": {
        "id": "1464",
        "name": "Maximum Product of Two Elements in an Array",
        "acceptance": "83.1",
        "difficulty": "Easy",
        "displayText": "1464. Maximum Product of Two Elements in an Array"
    },
    "1465": {
        "id": "1465",
        "name": "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts",
        "acceptance": "41.2",
        "difficulty": "Medium",
        "displayText": "1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts"
    },
    "1466": {
        "id": "1466",
        "name": "Reorder Routes to Make All Paths Lead to the City Zero",
        "acceptance": "64.8",
        "difficulty": "Medium",
        "displayText": "1466. Reorder Routes to Make All Paths Lead to the City Zero"
    },
    "1467": {
        "id": "1467",
        "name": "Probability of a Two Boxes Having The Same Number of Distinct Balls",
        "acceptance": "59.9",
        "difficulty": "Hard",
        "displayText": "1467. Probability of a Two Boxes Having The Same Number of Distinct Balls"
    },
    "1468": {
        "id": "1468",
        "name": "Calculate Salaries",
        "acceptance": "78.1",
        "difficulty": "Medium",
        "displayText": "1468. Calculate Salaries"
    },
    "1469": {
        "id": "1469",
        "name": "Find All The Lonely Nodes",
        "acceptance": "84.0",
        "difficulty": "Easy",
        "displayText": "1469. Find All The Lonely Nodes"
    },
    "1470": {
        "id": "1470",
        "name": "Shuffle the Array",
        "acceptance": "88.8",
        "difficulty": "Easy",
        "displayText": "1470. Shuffle the Array"
    },
    "1471": {
        "id": "1471",
        "name": "The k Strongest Values in an Array",
        "acceptance": "61.7",
        "difficulty": "Medium",
        "displayText": "1471. The k Strongest Values in an Array"
    },
    "1472": {
        "id": "1472",
        "name": "Design Browser History",
        "acceptance": "78.0",
        "difficulty": "Medium",
        "displayText": "1472. Design Browser History"
    },
    "1473": {
        "id": "1473",
        "name": "Paint House III",
        "acceptance": "61.0",
        "difficulty": "Hard",
        "displayText": "1473. Paint House III"
    },
    "1474": {
        "id": "1474",
        "name": "Delete N Nodes After M Nodes of a Linked List",
        "acceptance": "73.5",
        "difficulty": "Easy",
        "displayText": "1474. Delete N Nodes After M Nodes of a Linked List"
    },
    "1475": {
        "id": "1475",
        "name": "Final Prices With a Special Discount in a Shop",
        "acceptance": "83.2",
        "difficulty": "Easy",
        "displayText": "1475. Final Prices With a Special Discount in a Shop"
    },
    "1476": {
        "id": "1476",
        "name": "Subrectangle Queries",
        "acceptance": "88.3",
        "difficulty": "Medium",
        "displayText": "1476. Subrectangle Queries"
    },
    "1477": {
        "id": "1477",
        "name": "Find Two Non-overlapping Sub-arrays Each With Target Sum",
        "acceptance": "36.4",
        "difficulty": "Medium",
        "displayText": "1477. Find Two Non-overlapping Sub-arrays Each With Target Sum"
    },
    "1478": {
        "id": "1478",
        "name": "Allocate Mailboxes",
        "acceptance": "55.7",
        "difficulty": "Hard",
        "displayText": "1478. Allocate Mailboxes"
    },
    "1479": {
        "id": "1479",
        "name": "Sales by Day of the Week",
        "acceptance": "77.3",
        "difficulty": "Hard",
        "displayText": "1479. Sales by Day of the Week"
    },
    "1480": {
        "id": "1480",
        "name": "Running Sum of 1d Array",
        "acceptance": "87.0",
        "difficulty": "Easy",
        "displayText": "1480. Running Sum of 1d Array"
    },
    "1481": {
        "id": "1481",
        "name": "Least Number of Unique Integers after K Removals",
        "acceptance": "63.3",
        "difficulty": "Medium",
        "displayText": "1481. Least Number of Unique Integers after K Removals"
    },
    "1482": {
        "id": "1482",
        "name": "Minimum Number of Days to Make m Bouquets",
        "acceptance": "55.3",
        "difficulty": "Medium",
        "displayText": "1482. Minimum Number of Days to Make m Bouquets"
    },
    "1483": {
        "id": "1483",
        "name": "Kth Ancestor of a Tree Node",
        "acceptance": "35.5",
        "difficulty": "Hard",
        "displayText": "1483. Kth Ancestor of a Tree Node"
    },
    "1484": {
        "id": "1484",
        "name": "Group Sold Products By The Date",
        "acceptance": "77.6",
        "difficulty": "Easy",
        "displayText": "1484. Group Sold Products By The Date"
    },
    "1485": {
        "id": "1485",
        "name": "Clone Binary Tree With Random Pointer",
        "acceptance": "80.8",
        "difficulty": "Medium",
        "displayText": "1485. Clone Binary Tree With Random Pointer"
    },
    "1486": {
        "id": "1486",
        "name": "XOR Operation in an Array",
        "acceptance": "86.7",
        "difficulty": "Easy",
        "displayText": "1486. XOR Operation in an Array"
    },
    "1487": {
        "id": "1487",
        "name": "Making File Names Unique",
        "acceptance": "37.7",
        "difficulty": "Medium",
        "displayText": "1487. Making File Names Unique"
    },
    "1488": {
        "id": "1488",
        "name": "Avoid Flood in The City",
        "acceptance": "27.3",
        "difficulty": "Medium",
        "displayText": "1488. Avoid Flood in The City"
    },
    "1489": {
        "id": "1489",
        "name": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree",
        "acceptance": "66.5",
        "difficulty": "Hard",
        "displayText": "1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree"
    },
    "1490": {
        "id": "1490",
        "name": "Clone N-ary Tree",
        "acceptance": "83.2",
        "difficulty": "Medium",
        "displayText": "1490. Clone N-ary Tree"
    },
    "1491": {
        "id": "1491",
        "name": "Average Salary Excluding the Minimum and Maximum Salary",
        "acceptance": "63.4",
        "difficulty": "Easy",
        "displayText": "1491. Average Salary Excluding the Minimum and Maximum Salary"
    },
    "1492": {
        "id": "1492",
        "name": "The kth Factor of n",
        "acceptance": "69.4",
        "difficulty": "Medium",
        "displayText": "1492. The kth Factor of n"
    },
    "1493": {
        "id": "1493",
        "name": "Longest Subarray of 1's After Deleting One Element",
        "acceptance": "69.0",
        "difficulty": "Medium",
        "displayText": "1493. Longest Subarray of 1's After Deleting One Element"
    },
    "1494": {
        "id": "1494",
        "name": "Parallel Courses II",
        "acceptance": "29.5",
        "difficulty": "Hard",
        "displayText": "1494. Parallel Courses II"
    },
    "1495": {
        "id": "1495",
        "name": "Friendly Movies Streamed Last Month",
        "acceptance": "49.0",
        "difficulty": "Easy",
        "displayText": "1495. Friendly Movies Streamed Last Month"
    },
    "1496": {
        "id": "1496",
        "name": "Path Crossing",
        "acceptance": "62.5",
        "difficulty": "Easy",
        "displayText": "1496. Path Crossing"
    },
    "1497": {
        "id": "1497",
        "name": "Check If Array Pairs Are Divisible by k",
        "acceptance": "46.2",
        "difficulty": "Medium",
        "displayText": "1497. Check If Array Pairs Are Divisible by k"
    },
    "1498": {
        "id": "1498",
        "name": "Number of Subsequences That Satisfy the Given Sum Condition",
        "acceptance": "43.8",
        "difficulty": "Medium",
        "displayText": "1498. Number of Subsequences That Satisfy the Given Sum Condition"
    },
    "1499": {
        "id": "1499",
        "name": "Max Value of Equation",
        "acceptance": "44.4",
        "difficulty": "Hard",
        "displayText": "1499. Max Value of Equation"
    },
    "1500": {
        "id": "1500",
        "name": "Design a File Sharing System",
        "acceptance": "41.7",
        "difficulty": "Medium",
        "displayText": "1500. Design a File Sharing System"
    },
    "1501": {
        "id": "1501",
        "name": "Countries You Can Safely Invest In",
        "acceptance": "50.4",
        "difficulty": "Medium",
        "displayText": "1501. Countries You Can Safely Invest In"
    },
    "1502": {
        "id": "1502",
        "name": "Can Make Arithmetic Progression From Sequence",
        "acceptance": "69.4",
        "difficulty": "Easy",
        "displayText": "1502. Can Make Arithmetic Progression From Sequence"
    },
    "1503": {
        "id": "1503",
        "name": "Last Moment Before All Ants Fall Out of a Plank",
        "acceptance": "68.2",
        "difficulty": "Medium",
        "displayText": "1503. Last Moment Before All Ants Fall Out of a Plank"
    },
    "1504": {
        "id": "1504",
        "name": "Count Submatrices With All Ones",
        "acceptance": "57.2",
        "difficulty": "Medium",
        "displayText": "1504. Count Submatrices With All Ones"
    },
    "1505": {
        "id": "1505",
        "name": "Minimum Possible Integer After at Most K Adjacent Swaps On Digits",
        "acceptance": "39.8",
        "difficulty": "Hard",
        "displayText": "1505. Minimum Possible Integer After at Most K Adjacent Swaps On Digits"
    },
    "1506": {
        "id": "1506",
        "name": "Find Root of N-Ary Tree",
        "acceptance": "78.4",
        "difficulty": "Medium",
        "displayText": "1506. Find Root of N-Ary Tree"
    },
    "1507": {
        "id": "1507",
        "name": "Reformat Date",
        "acceptance": "67.2",
        "difficulty": "Easy",
        "displayText": "1507. Reformat Date"
    },
    "1508": {
        "id": "1508",
        "name": "Range Sum of Sorted Subarray Sums",
        "acceptance": "63.1",
        "difficulty": "Medium",
        "displayText": "1508. Range Sum of Sorted Subarray Sums"
    },
    "1509": {
        "id": "1509",
        "name": "Minimum Difference Between Largest and Smallest Value in Three Moves",
        "acceptance": "59.2",
        "difficulty": "Medium",
        "displayText": "1509. Minimum Difference Between Largest and Smallest Value in Three Moves"
    },
    "1510": {
        "id": "1510",
        "name": "Stone Game IV",
        "acceptance": "59.5",
        "difficulty": "Hard",
        "displayText": "1510. Stone Game IV"
    },
    "1511": {
        "id": "1511",
        "name": "Customer Order Frequency",
        "acceptance": "66.9",
        "difficulty": "Easy",
        "displayText": "1511. Customer Order Frequency"
    },
    "1512": {
        "id": "1512",
        "name": "Number of Good Pairs",
        "acceptance": "89.5",
        "difficulty": "Easy",
        "displayText": "1512. Number of Good Pairs"
    },
    "1513": {
        "id": "1513",
        "name": "Number of Substrings With Only 1s",
        "acceptance": "47.6",
        "difficulty": "Medium",
        "displayText": "1513. Number of Substrings With Only 1s"
    },
    "1514": {
        "id": "1514",
        "name": "Path with Maximum Probability",
        "acceptance": "65.3",
        "difficulty": "Medium",
        "displayText": "1514. Path with Maximum Probability"
    },
    "1515": {
        "id": "1515",
        "name": "Best Position for a Service Centre",
        "acceptance": "34.7",
        "difficulty": "Hard",
        "displayText": "1515. Best Position for a Service Centre"
    },
    "1516": {
        "id": "1516",
        "name": "Move Sub-Tree of N-Ary Tree",
        "acceptance": "60.1",
        "difficulty": "Hard",
        "displayText": "1516. Move Sub-Tree of N-Ary Tree"
    },
    "1517": {
        "id": "1517",
        "name": "Find Users With Valid E-Mails",
        "acceptance": "44.3",
        "difficulty": "Easy",
        "displayText": "1517. Find Users With Valid E-Mails"
    },
    "1518": {
        "id": "1518",
        "name": "Water Bottles",
        "acceptance": "70.8",
        "difficulty": "Easy",
        "displayText": "1518. Water Bottles"
    },
    "1519": {
        "id": "1519",
        "name": "Number of Nodes in the Sub-Tree With the Same Label",
        "acceptance": "55.0",
        "difficulty": "Medium",
        "displayText": "1519. Number of Nodes in the Sub-Tree With the Same Label"
    },
    "1520": {
        "id": "1520",
        "name": "Maximum Number of Non-Overlapping Substrings",
        "acceptance": "39.6",
        "difficulty": "Hard",
        "displayText": "1520. Maximum Number of Non-Overlapping Substrings"
    },
    "1521": {
        "id": "1521",
        "name": "Find a Value of a Mysterious Function Closest to Target",
        "acceptance": "45.5",
        "difficulty": "Hard",
        "displayText": "1521. Find a Value of a Mysterious Function Closest to Target"
    },
    "1522": {
        "id": "1522",
        "name": "Diameter of N-Ary Tree",
        "acceptance": "74.9",
        "difficulty": "Medium",
        "displayText": "1522. Diameter of N-Ary Tree"
    },
    "1523": {
        "id": "1523",
        "name": "Count Odd Numbers in an Interval Range",
        "acceptance": "50.3",
        "difficulty": "Easy",
        "displayText": "1523. Count Odd Numbers in an Interval Range"
    },
    "1524": {
        "id": "1524",
        "name": "Number of Sub-arrays With Odd Sum",
        "acceptance": "56.1",
        "difficulty": "Medium",
        "displayText": "1524. Number of Sub-arrays With Odd Sum"
    },
    "1525": {
        "id": "1525",
        "name": "Number of Good Ways to Split a String",
        "acceptance": "68.3",
        "difficulty": "Medium",
        "displayText": "1525. Number of Good Ways to Split a String"
    },
    "1526": {
        "id": "1526",
        "name": "Minimum Number of Increments on Subarrays to Form a Target Array",
        "acceptance": "72.1",
        "difficulty": "Hard",
        "displayText": "1526. Minimum Number of Increments on Subarrays to Form a Target Array"
    },
    "1527": {
        "id": "1527",
        "name": "Patients With a Condition",
        "acceptance": "39.3",
        "difficulty": "Easy",
        "displayText": "1527. Patients With a Condition"
    },
    "1528": {
        "id": "1528",
        "name": "Shuffle String",
        "acceptance": "85.1",
        "difficulty": "Easy",
        "displayText": "1528. Shuffle String"
    },
    "1529": {
        "id": "1529",
        "name": "Minimum Suffix Flips",
        "acceptance": "73.4",
        "difficulty": "Medium",
        "displayText": "1529. Minimum Suffix Flips"
    },
    "1530": {
        "id": "1530",
        "name": "Number of Good Leaf Nodes Pairs",
        "acceptance": "71.8",
        "difficulty": "Medium",
        "displayText": "1530. Number of Good Leaf Nodes Pairs"
    },
    "1531": {
        "id": "1531",
        "name": "String Compression II",
        "acceptance": "52.0",
        "difficulty": "Hard",
        "displayText": "1531. String Compression II"
    },
    "1532": {
        "id": "1532",
        "name": "The Most Recent Three Orders",
        "acceptance": "68.9",
        "difficulty": "Medium",
        "displayText": "1532. The Most Recent Three Orders"
    },
    "1533": {
        "id": "1533",
        "name": "Find the Index of the Large Integer",
        "acceptance": "56.2",
        "difficulty": "Medium",
        "displayText": "1533. Find the Index of the Large Integer"
    },
    "1534": {
        "id": "1534",
        "name": "Count Good Triplets",
        "acceptance": "85.4",
        "difficulty": "Easy",
        "displayText": "1534. Count Good Triplets"
    },
    "1535": {
        "id": "1535",
        "name": "Find the Winner of an Array Game",
        "acceptance": "56.7",
        "difficulty": "Medium",
        "displayText": "1535. Find the Winner of an Array Game"
    },
    "1536": {
        "id": "1536",
        "name": "Minimum Swaps to Arrange a Binary Grid",
        "acceptance": "47.8",
        "difficulty": "Medium",
        "displayText": "1536. Minimum Swaps to Arrange a Binary Grid"
    },
    "1537": {
        "id": "1537",
        "name": "Get the Maximum Score",
        "acceptance": "39.8",
        "difficulty": "Hard",
        "displayText": "1537. Get the Maximum Score"
    },
    "1538": {
        "id": "1538",
        "name": "Guess the Majority in a Hidden Array",
        "acceptance": "69.4",
        "difficulty": "Medium",
        "displayText": "1538. Guess the Majority in a Hidden Array"
    },
    "1539": {
        "id": "1539",
        "name": "Kth Missing Positive Number",
        "acceptance": "62.0",
        "difficulty": "Easy",
        "displayText": "1539. Kth Missing Positive Number"
    },
    "1540": {
        "id": "1540",
        "name": "Can Convert String in K Moves",
        "acceptance": "35.8",
        "difficulty": "Medium",
        "displayText": "1540. Can Convert String in K Moves"
    },
    "1541": {
        "id": "1541",
        "name": "Minimum Insertions to Balance a Parentheses String",
        "acceptance": "53.1",
        "difficulty": "Medium",
        "displayText": "1541. Minimum Insertions to Balance a Parentheses String"
    },
    "1542": {
        "id": "1542",
        "name": "Find Longest Awesome Substring",
        "acceptance": "44.9",
        "difficulty": "Hard",
        "displayText": "1542. Find Longest Awesome Substring"
    },
    "1543": {
        "id": "1543",
        "name": "Fix Product Name Format",
        "acceptance": "59.0",
        "difficulty": "Easy",
        "displayText": "1543. Fix Product Name Format"
    },
    "1544": {
        "id": "1544",
        "name": "Make The String Great",
        "acceptance": "68.2",
        "difficulty": "Easy",
        "displayText": "1544. Make The String Great"
    },
    "1545": {
        "id": "1545",
        "name": "Find Kth Bit in Nth Binary String",
        "acceptance": "70.2",
        "difficulty": "Medium",
        "displayText": "1545. Find Kth Bit in Nth Binary String"
    },
    "1546": {
        "id": "1546",
        "name": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target",
        "acceptance": "47.8",
        "difficulty": "Medium",
        "displayText": "1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target"
    },
    "1547": {
        "id": "1547",
        "name": "Minimum Cost to Cut a Stick",
        "acceptance": "61.8",
        "difficulty": "Hard",
        "displayText": "1547. Minimum Cost to Cut a Stick"
    },
    "1548": {
        "id": "1548",
        "name": "The Most Similar Path in a Graph",
        "acceptance": "59.3",
        "difficulty": "Hard",
        "displayText": "1548. The Most Similar Path in a Graph"
    },
    "1549": {
        "id": "1549",
        "name": "The Most Recent Orders for Each Product",
        "acceptance": "64.8",
        "difficulty": "Medium",
        "displayText": "1549. The Most Recent Orders for Each Product"
    },
    "1550": {
        "id": "1550",
        "name": "Three Consecutive Odds",
        "acceptance": "68.0",
        "difficulty": "Easy",
        "displayText": "1550. Three Consecutive Odds"
    },
    "1551": {
        "id": "1551",
        "name": "Minimum Operations to Make Array Equal",
        "acceptance": "82.2",
        "difficulty": "Medium",
        "displayText": "1551. Minimum Operations to Make Array Equal"
    },
    "1552": {
        "id": "1552",
        "name": "Magnetic Force Between Two Balls",
        "acceptance": "71.2",
        "difficulty": "Medium",
        "displayText": "1552. Magnetic Force Between Two Balls"
    },
    "1553": {
        "id": "1553",
        "name": "Minimum Number of Days to Eat N Oranges",
        "acceptance": "35.6",
        "difficulty": "Hard",
        "displayText": "1553. Minimum Number of Days to Eat N Oranges"
    },
    "1554": {
        "id": "1554",
        "name": "Strings Differ by One Character",
        "acceptance": "41.2",
        "difficulty": "Medium",
        "displayText": "1554. Strings Differ by One Character"
    },
    "1555": {
        "id": "1555",
        "name": "Bank Account Summary",
        "acceptance": "51.9",
        "difficulty": "Medium",
        "displayText": "1555. Bank Account Summary"
    },
    "1556": {
        "id": "1556",
        "name": "Thousand Separator",
        "acceptance": "53.5",
        "difficulty": "Easy",
        "displayText": "1556. Thousand Separator"
    },
    "1557": {
        "id": "1557",
        "name": "Minimum Number of Vertices to Reach All Nodes",
        "acceptance": "81.1",
        "difficulty": "Medium",
        "displayText": "1557. Minimum Number of Vertices to Reach All Nodes"
    },
    "1558": {
        "id": "1558",
        "name": "Minimum Numbers of Function Calls to Make Target Array",
        "acceptance": "62.5",
        "difficulty": "Medium",
        "displayText": "1558. Minimum Numbers of Function Calls to Make Target Array"
    },
    "1559": {
        "id": "1559",
        "name": "Detect Cycles in 2D Grid",
        "acceptance": "49.8",
        "difficulty": "Medium",
        "displayText": "1559. Detect Cycles in 2D Grid"
    },
    "1560": {
        "id": "1560",
        "name": "Most Visited Sector in a Circular Track",
        "acceptance": "59.0",
        "difficulty": "Easy",
        "displayText": "1560. Most Visited Sector in a Circular Track"
    },
    "1561": {
        "id": "1561",
        "name": "Maximum Number of Coins You Can Get",
        "acceptance": "84.4",
        "difficulty": "Medium",
        "displayText": "1561. Maximum Number of Coins You Can Get"
    },
    "1562": {
        "id": "1562",
        "name": "Find Latest Group of Size M",
        "acceptance": "42.9",
        "difficulty": "Medium",
        "displayText": "1562. Find Latest Group of Size M"
    },
    "1563": {
        "id": "1563",
        "name": "Stone Game V",
        "acceptance": "41.0",
        "difficulty": "Hard",
        "displayText": "1563. Stone Game V"
    },
    "1564": {
        "id": "1564",
        "name": "Put Boxes Into the Warehouse I",
        "acceptance": "67.1",
        "difficulty": "Medium",
        "displayText": "1564. Put Boxes Into the Warehouse I"
    },
    "1565": {
        "id": "1565",
        "name": "Unique Orders and Customers Per Month",
        "acceptance": "82.2",
        "difficulty": "Easy",
        "displayText": "1565. Unique Orders and Customers Per Month"
    },
    "1566": {
        "id": "1566",
        "name": "Detect Pattern of Length M Repeated K or More Times",
        "acceptance": "43.4",
        "difficulty": "Easy",
        "displayText": "1566. Detect Pattern of Length M Repeated K or More Times"
    },
    "1567": {
        "id": "1567",
        "name": "Maximum Length of Subarray With Positive Product",
        "acceptance": "44.3",
        "difficulty": "Medium",
        "displayText": "1567. Maximum Length of Subarray With Positive Product"
    },
    "1568": {
        "id": "1568",
        "name": "Minimum Number of Days to Disconnect Island",
        "acceptance": "59.1",
        "difficulty": "Hard",
        "displayText": "1568. Minimum Number of Days to Disconnect Island"
    },
    "1569": {
        "id": "1569",
        "name": "Number of Ways to Reorder Array to Get Same BST",
        "acceptance": "53.5",
        "difficulty": "Hard",
        "displayText": "1569. Number of Ways to Reorder Array to Get Same BST"
    },
    "1570": {
        "id": "1570",
        "name": "Dot Product of Two Sparse Vectors",
        "acceptance": "89.9",
        "difficulty": "Medium",
        "displayText": "1570. Dot Product of Two Sparse Vectors"
    },
    "1571": {
        "id": "1571",
        "name": "Warehouse Manager",
        "acceptance": "87.5",
        "difficulty": "Easy",
        "displayText": "1571. Warehouse Manager"
    },
    "1572": {
        "id": "1572",
        "name": "Matrix Diagonal Sum",
        "acceptance": "83.6",
        "difficulty": "Easy",
        "displayText": "1572. Matrix Diagonal Sum"
    },
    "1573": {
        "id": "1573",
        "name": "Number of Ways to Split a String",
        "acceptance": "33.7",
        "difficulty": "Medium",
        "displayText": "1573. Number of Ways to Split a String"
    },
    "1574": {
        "id": "1574",
        "name": "Shortest Subarray to be Removed to Make Array Sorted",
        "acceptance": "51.5",
        "difficulty": "Medium",
        "displayText": "1574. Shortest Subarray to be Removed to Make Array Sorted"
    },
    "1575": {
        "id": "1575",
        "name": "Count All Possible Routes",
        "acceptance": "64.9",
        "difficulty": "Hard",
        "displayText": "1575. Count All Possible Routes"
    },
    "1576": {
        "id": "1576",
        "name": "Replace All ?'s to Avoid Consecutive Repeating Characters",
        "acceptance": "45.2",
        "difficulty": "Easy",
        "displayText": "1576. Replace All ?'s to Avoid Consecutive Repeating Characters"
    },
    "1577": {
        "id": "1577",
        "name": "Number of Ways Where Square of Number Is Equal to Product of Two Numbers",
        "acceptance": "41.8",
        "difficulty": "Medium",
        "displayText": "1577. Number of Ways Where Square of Number Is Equal to Product of Two Numbers"
    },
    "1578": {
        "id": "1578",
        "name": "Minimum Time to Make Rope Colorful",
        "acceptance": "63.5",
        "difficulty": "Medium",
        "displayText": "1578. Minimum Time to Make Rope Colorful"
    },
    "1579": {
        "id": "1579",
        "name": "Remove Max Number of Edges to Keep Graph Fully Traversable",
        "acceptance": "70.5",
        "difficulty": "Hard",
        "displayText": "1579. Remove Max Number of Edges to Keep Graph Fully Traversable"
    },
    "1580": {
        "id": "1580",
        "name": "Put Boxes Into the Warehouse II",
        "acceptance": "65.5",
        "difficulty": "Medium",
        "displayText": "1580. Put Boxes Into the Warehouse II"
    },
    "1581": {
        "id": "1581",
        "name": "Customer Who Visited but Did Not Make Any Transactions",
        "acceptance": "67.4",
        "difficulty": "Easy",
        "displayText": "1581. Customer Who Visited but Did Not Make Any Transactions"
    },
    "1582": {
        "id": "1582",
        "name": "Special Positions in a Binary Matrix",
        "acceptance": "68.7",
        "difficulty": "Easy",
        "displayText": "1582. Special Positions in a Binary Matrix"
    },
    "1583": {
        "id": "1583",
        "name": "Count Unhappy Friends",
        "acceptance": "61.9",
        "difficulty": "Medium",
        "displayText": "1583. Count Unhappy Friends"
    },
    "1584": {
        "id": "1584",
        "name": "Min Cost to Connect All Points",
        "acceptance": "68.6",
        "difficulty": "Medium",
        "displayText": "1584. Min Cost to Connect All Points"
    },
    "1585": {
        "id": "1585",
        "name": "Check If String Is Transformable With Substring Sort Operations",
        "acceptance": "48.2",
        "difficulty": "Hard",
        "displayText": "1585. Check If String Is Transformable With Substring Sort Operations"
    },
    "1586": {
        "id": "1586",
        "name": "Binary Search Tree Iterator II",
        "acceptance": "63.2",
        "difficulty": "Medium",
        "displayText": "1586. Binary Search Tree Iterator II"
    },
    "1587": {
        "id": "1587",
        "name": "Bank Account Summary II",
        "acceptance": "83.3",
        "difficulty": "Easy",
        "displayText": "1587. Bank Account Summary II"
    },
    "1588": {
        "id": "1588",
        "name": "Sum of All Odd Length Subarrays",
        "acceptance": "83.4",
        "difficulty": "Easy",
        "displayText": "1588. Sum of All Odd Length Subarrays"
    },
    "1589": {
        "id": "1589",
        "name": "Maximum Sum Obtained of Any Permutation",
        "acceptance": "39.0",
        "difficulty": "Medium",
        "displayText": "1589. Maximum Sum Obtained of Any Permutation"
    },
    "1590": {
        "id": "1590",
        "name": "Make Sum Divisible by P",
        "acceptance": "39.5",
        "difficulty": "Medium",
        "displayText": "1590. Make Sum Divisible by P"
    },
    "1591": {
        "id": "1591",
        "name": "Strange Printer II",
        "acceptance": "59.6",
        "difficulty": "Hard",
        "displayText": "1591. Strange Printer II"
    },
    "1592": {
        "id": "1592",
        "name": "Rearrange Spaces Between Words",
        "acceptance": "43.9",
        "difficulty": "Easy",
        "displayText": "1592. Rearrange Spaces Between Words"
    },
    "1593": {
        "id": "1593",
        "name": "Split a String Into the Max Number of Unique Substrings",
        "acceptance": "68.3",
        "difficulty": "Medium",
        "displayText": "1593. Split a String Into the Max Number of Unique Substrings"
    },
    "1594": {
        "id": "1594",
        "name": "Maximum Non Negative Product in a Matrix",
        "acceptance": "34.5",
        "difficulty": "Medium",
        "displayText": "1594. Maximum Non Negative Product in a Matrix"
    },
    "1595": {
        "id": "1595",
        "name": "Minimum Cost to Connect Two Groups of Points",
        "acceptance": "48.1",
        "difficulty": "Hard",
        "displayText": "1595. Minimum Cost to Connect Two Groups of Points"
    },
    "1596": {
        "id": "1596",
        "name": "The Most Frequently Ordered Products for Each Customer",
        "acceptance": "77.8",
        "difficulty": "Medium",
        "displayText": "1596. The Most Frequently Ordered Products for Each Customer"
    },
    "1597": {
        "id": "1597",
        "name": "Build Binary Expression Tree From Infix Expression",
        "acceptance": "62.4",
        "difficulty": "Hard",
        "displayText": "1597. Build Binary Expression Tree From Infix Expression"
    },
    "1598": {
        "id": "1598",
        "name": "Crawler Log Folder",
        "acceptance": "71.6",
        "difficulty": "Easy",
        "displayText": "1598. Crawler Log Folder"
    },
    "1599": {
        "id": "1599",
        "name": "Maximum Profit of Operating a Centennial Wheel",
        "acceptance": "43.8",
        "difficulty": "Medium",
        "displayText": "1599. Maximum Profit of Operating a Centennial Wheel"
    },
    "1600": {
        "id": "1600",
        "name": "Throne Inheritance",
        "acceptance": "66.7",
        "difficulty": "Medium",
        "displayText": "1600. Throne Inheritance"
    },
    "1601": {
        "id": "1601",
        "name": "Maximum Number of Achievable Transfer Requests",
        "acceptance": "64.4",
        "difficulty": "Hard",
        "displayText": "1601. Maximum Number of Achievable Transfer Requests"
    },
    "1602": {
        "id": "1602",
        "name": "Find Nearest Right Node in Binary Tree",
        "acceptance": "75.0",
        "difficulty": "Medium",
        "displayText": "1602. Find Nearest Right Node in Binary Tree"
    },
    "1603": {
        "id": "1603",
        "name": "Design Parking System",
        "acceptance": "88.0",
        "difficulty": "Easy",
        "displayText": "1603. Design Parking System"
    },
    "1604": {
        "id": "1604",
        "name": "Alert Using Same Key-Card Three or More Times in a One Hour Period",
        "acceptance": "45.9",
        "difficulty": "Medium",
        "displayText": "1604. Alert Using Same Key-Card Three or More Times in a One Hour Period"
    },
    "1605": {
        "id": "1605",
        "name": "Find Valid Matrix Given Row and Column Sums",
        "acceptance": "82.9",
        "difficulty": "Medium",
        "displayText": "1605. Find Valid Matrix Given Row and Column Sums"
    },
    "1606": {
        "id": "1606",
        "name": "Find Servers That Handled Most Number of Requests",
        "acceptance": "43.8",
        "difficulty": "Hard",
        "displayText": "1606. Find Servers That Handled Most Number of Requests"
    },
    "1607": {
        "id": "1607",
        "name": "Sellers With No Sales",
        "acceptance": "54.4",
        "difficulty": "Easy",
        "displayText": "1607. Sellers With No Sales"
    },
    "1608": {
        "id": "1608",
        "name": "Special Array With X Elements Greater Than or Equal X",
        "acceptance": "66.6",
        "difficulty": "Easy",
        "displayText": "1608. Special Array With X Elements Greater Than or Equal X"
    },
    "1609": {
        "id": "1609",
        "name": "Even Odd Tree",
        "acceptance": "66.5",
        "difficulty": "Medium",
        "displayText": "1609. Even Odd Tree"
    },
    "1610": {
        "id": "1610",
        "name": "Maximum Number of Visible Points",
        "acceptance": "37.5",
        "difficulty": "Hard",
        "displayText": "1610. Maximum Number of Visible Points"
    },
    "1611": {
        "id": "1611",
        "name": "Minimum One Bit Operations to Make Integers Zero",
        "acceptance": "73.3",
        "difficulty": "Hard",
        "displayText": "1611. Minimum One Bit Operations to Make Integers Zero"
    },
    "1612": {
        "id": "1612",
        "name": "Check If Two Expression Trees are Equivalent",
        "acceptance": "71.0",
        "difficulty": "Medium",
        "displayText": "1612. Check If Two Expression Trees are Equivalent"
    },
    "1613": {
        "id": "1613",
        "name": "Find the Missing IDs",
        "acceptance": "73.1",
        "difficulty": "Medium",
        "displayText": "1613. Find the Missing IDs"
    },
    "1614": {
        "id": "1614",
        "name": "Maximum Nesting Depth of the Parentheses",
        "acceptance": "84.2",
        "difficulty": "Easy",
        "displayText": "1614. Maximum Nesting Depth of the Parentheses"
    },
    "1615": {
        "id": "1615",
        "name": "Maximal Network Rank",
        "acceptance": "65.4",
        "difficulty": "Medium",
        "displayText": "1615. Maximal Network Rank"
    },
    "1616": {
        "id": "1616",
        "name": "Split Two Strings to Make Palindrome",
        "acceptance": "31.3",
        "difficulty": "Medium",
        "displayText": "1616. Split Two Strings to Make Palindrome"
    },
    "1617": {
        "id": "1617",
        "name": "Count Subtrees With Max Distance Between Cities",
        "acceptance": "66.7",
        "difficulty": "Hard",
        "displayText": "1617. Count Subtrees With Max Distance Between Cities"
    },
    "1618": {
        "id": "1618",
        "name": "Maximum Font to Fit a Sentence in a Screen",
        "acceptance": "61.2",
        "difficulty": "Medium",
        "displayText": "1618. Maximum Font to Fit a Sentence in a Screen"
    },
    "1619": {
        "id": "1619",
        "name": "Mean of Array After Removing Some Elements",
        "acceptance": "70.2",
        "difficulty": "Easy",
        "displayText": "1619. Mean of Array After Removing Some Elements"
    },
    "1620": {
        "id": "1620",
        "name": "Coordinate With Maximum Network Quality",
        "acceptance": "38.2",
        "difficulty": "Medium",
        "displayText": "1620. Coordinate With Maximum Network Quality"
    },
    "1621": {
        "id": "1621",
        "name": "Number of Sets of K Non-Overlapping Line Segments",
        "acceptance": "44.5",
        "difficulty": "Medium",
        "displayText": "1621. Number of Sets of K Non-Overlapping Line Segments"
    },
    "1622": {
        "id": "1622",
        "name": "Fancy Sequence",
        "acceptance": "18.1",
        "difficulty": "Hard",
        "displayText": "1622. Fancy Sequence"
    },
    "1623": {
        "id": "1623",
        "name": "All Valid Triplets That Can Represent a Country",
        "acceptance": "80.9",
        "difficulty": "Easy",
        "displayText": "1623. All Valid Triplets That Can Represent a Country"
    },
    "1624": {
        "id": "1624",
        "name": "Largest Substring Between Two Equal Characters",
        "acceptance": "68.2",
        "difficulty": "Easy",
        "displayText": "1624. Largest Substring Between Two Equal Characters"
    },
    "1625": {
        "id": "1625",
        "name": "Lexicographically Smallest String After Applying Operations",
        "acceptance": "64.9",
        "difficulty": "Medium",
        "displayText": "1625. Lexicographically Smallest String After Applying Operations"
    },
    "1626": {
        "id": "1626",
        "name": "Best Team With No Conflicts",
        "acceptance": "50.4",
        "difficulty": "Medium",
        "displayText": "1626. Best Team With No Conflicts"
    },
    "1627": {
        "id": "1627",
        "name": "Graph Connectivity With Threshold",
        "acceptance": "48.0",
        "difficulty": "Hard",
        "displayText": "1627. Graph Connectivity With Threshold"
    },
    "1628": {
        "id": "1628",
        "name": "Design an Expression Tree With Evaluate Function",
        "acceptance": "82.4",
        "difficulty": "Medium",
        "displayText": "1628. Design an Expression Tree With Evaluate Function"
    },
    "1629": {
        "id": "1629",
        "name": "Slowest Key",
        "acceptance": "59.2",
        "difficulty": "Easy",
        "displayText": "1629. Slowest Key"
    },
    "1630": {
        "id": "1630",
        "name": "Arithmetic Subarrays",
        "acceptance": "83.7",
        "difficulty": "Medium",
        "displayText": "1630. Arithmetic Subarrays"
    },
    "1631": {
        "id": "1631",
        "name": "Path With Minimum Effort",
        "acceptance": "61.0",
        "difficulty": "Medium",
        "displayText": "1631. Path With Minimum Effort"
    },
    "1632": {
        "id": "1632",
        "name": "Rank Transform of a Matrix",
        "acceptance": "41.3",
        "difficulty": "Hard",
        "displayText": "1632. Rank Transform of a Matrix"
    },
    "1633": {
        "id": "1633",
        "name": "Percentage of Users Attended a Contest",
        "acceptance": "58.6",
        "difficulty": "Easy",
        "displayText": "1633. Percentage of Users Attended a Contest"
    },
    "1634": {
        "id": "1634",
        "name": "Add Two Polynomials Represented as Linked Lists",
        "acceptance": "60.7",
        "difficulty": "Medium",
        "displayText": "1634. Add Two Polynomials Represented as Linked Lists"
    },
    "1635": {
        "id": "1635",
        "name": "Hopper Company Queries I",
        "acceptance": "48.1",
        "difficulty": "Hard",
        "displayText": "1635. Hopper Company Queries I"
    },
    "1636": {
        "id": "1636",
        "name": "Sort Array by Increasing Frequency",
        "acceptance": "80.1",
        "difficulty": "Easy",
        "displayText": "1636. Sort Array by Increasing Frequency"
    },
    "1637": {
        "id": "1637",
        "name": "Widest Vertical Area Between Two Points Containing No Points",
        "acceptance": "87.1",
        "difficulty": "Easy",
        "displayText": "1637. Widest Vertical Area Between Two Points Containing No Points"
    },
    "1638": {
        "id": "1638",
        "name": "Count Substrings That Differ by One Character",
        "acceptance": "71.6",
        "difficulty": "Medium",
        "displayText": "1638. Count Substrings That Differ by One Character"
    },
    "1639": {
        "id": "1639",
        "name": "Number of Ways to Form a Target String Given a Dictionary",
        "acceptance": "57.2",
        "difficulty": "Hard",
        "displayText": "1639. Number of Ways to Form a Target String Given a Dictionary"
    },
    "1640": {
        "id": "1640",
        "name": "Check Array Formation Through Concatenation",
        "acceptance": "56.9",
        "difficulty": "Easy",
        "displayText": "1640. Check Array Formation Through Concatenation"
    },
    "1641": {
        "id": "1641",
        "name": "Count Sorted Vowel Strings",
        "acceptance": "78.8",
        "difficulty": "Medium",
        "displayText": "1641. Count Sorted Vowel Strings"
    },
    "1642": {
        "id": "1642",
        "name": "Furthest Building You Can Reach",
        "acceptance": "50.2",
        "difficulty": "Medium",
        "displayText": "1642. Furthest Building You Can Reach"
    },
    "1643": {
        "id": "1643",
        "name": "Kth Smallest Instructions",
        "acceptance": "45.6",
        "difficulty": "Hard",
        "displayText": "1643. Kth Smallest Instructions"
    },
    "1644": {
        "id": "1644",
        "name": "Lowest Common Ancestor of a Binary Tree II",
        "acceptance": "68.3",
        "difficulty": "Medium",
        "displayText": "1644. Lowest Common Ancestor of a Binary Tree II"
    },
    "1645": {
        "id": "1645",
        "name": "Hopper Company Queries II",
        "acceptance": "39.4",
        "difficulty": "Hard",
        "displayText": "1645. Hopper Company Queries II"
    },
    "1646": {
        "id": "1646",
        "name": "Get Maximum in Generated Array",
        "acceptance": "50.9",
        "difficulty": "Easy",
        "displayText": "1646. Get Maximum in Generated Array"
    },
    "1647": {
        "id": "1647",
        "name": "Minimum Deletions to Make Character Frequencies Unique",
        "acceptance": "61.3",
        "difficulty": "Medium",
        "displayText": "1647. Minimum Deletions to Make Character Frequencies Unique"
    },
    "1648": {
        "id": "1648",
        "name": "Sell Diminishing-Valued Colored Balls",
        "acceptance": "29.9",
        "difficulty": "Medium",
        "displayText": "1648. Sell Diminishing-Valued Colored Balls"
    },
    "1649": {
        "id": "1649",
        "name": "Create Sorted Array through Instructions",
        "acceptance": "39.8",
        "difficulty": "Hard",
        "displayText": "1649. Create Sorted Array through Instructions"
    },
    "1650": {
        "id": "1650",
        "name": "Lowest Common Ancestor of a Binary Tree III",
        "acceptance": "82.2",
        "difficulty": "Medium",
        "displayText": "1650. Lowest Common Ancestor of a Binary Tree III"
    },
    "1651": {
        "id": "1651",
        "name": "Hopper Company Queries III",
        "acceptance": "65.8",
        "difficulty": "Hard",
        "displayText": "1651. Hopper Company Queries III"
    },
    "1652": {
        "id": "1652",
        "name": "Defuse the Bomb",
        "acceptance": "79.2",
        "difficulty": "Easy",
        "displayText": "1652. Defuse the Bomb"
    },
    "1653": {
        "id": "1653",
        "name": "Minimum Deletions to Make String Balanced",
        "acceptance": "65.6",
        "difficulty": "Medium",
        "displayText": "1653. Minimum Deletions to Make String Balanced"
    },
    "1654": {
        "id": "1654",
        "name": "Minimum Jumps to Reach Home",
        "acceptance": "30.0",
        "difficulty": "Medium",
        "displayText": "1654. Minimum Jumps to Reach Home"
    },
    "1655": {
        "id": "1655",
        "name": "Distribute Repeating Integers",
        "acceptance": "39.6",
        "difficulty": "Hard",
        "displayText": "1655. Distribute Repeating Integers"
    },
    "1656": {
        "id": "1656",
        "name": "Design an Ordered Stream",
        "acceptance": "84.5",
        "difficulty": "Easy",
        "displayText": "1656. Design an Ordered Stream"
    },
    "1657": {
        "id": "1657",
        "name": "Determine if Two Strings Are Close",
        "acceptance": "54.1",
        "difficulty": "Medium",
        "displayText": "1657. Determine if Two Strings Are Close"
    },
    "1658": {
        "id": "1658",
        "name": "Minimum Operations to Reduce X to Zero",
        "acceptance": "40.0",
        "difficulty": "Medium",
        "displayText": "1658. Minimum Operations to Reduce X to Zero"
    },
    "1659": {
        "id": "1659",
        "name": "Maximize Grid Happiness",
        "acceptance": "39.6",
        "difficulty": "Hard",
        "displayText": "1659. Maximize Grid Happiness"
    },
    "1660": {
        "id": "1660",
        "name": "Correct a Binary Tree",
        "acceptance": "74.3",
        "difficulty": "Medium",
        "displayText": "1660. Correct a Binary Tree"
    },
    "1661": {
        "id": "1661",
        "name": "Average Time of Process per Machine",
        "acceptance": "68.9",
        "difficulty": "Easy",
        "displayText": "1661. Average Time of Process per Machine"
    },
    "1662": {
        "id": "1662",
        "name": "Check If Two String Arrays are Equivalent",
        "acceptance": "85.7",
        "difficulty": "Easy",
        "displayText": "1662. Check If Two String Arrays are Equivalent"
    },
    "1663": {
        "id": "1663",
        "name": "Smallest String With A Given Numeric Value",
        "acceptance": "67.0",
        "difficulty": "Medium",
        "displayText": "1663. Smallest String With A Given Numeric Value"
    },
    "1664": {
        "id": "1664",
        "name": "Ways to Make a Fair Array",
        "acceptance": "64.3",
        "difficulty": "Medium",
        "displayText": "1664. Ways to Make a Fair Array"
    },
    "1665": {
        "id": "1665",
        "name": "Minimum Initial Energy to Finish Tasks",
        "acceptance": "59.0",
        "difficulty": "Hard",
        "displayText": "1665. Minimum Initial Energy to Finish Tasks"
    },
    "1666": {
        "id": "1666",
        "name": "Change the Root of a Binary Tree",
        "acceptance": "74.5",
        "difficulty": "Medium",
        "displayText": "1666. Change the Root of a Binary Tree"
    },
    "1667": {
        "id": "1667",
        "name": "Fix Names in a Table",
        "acceptance": "61.0",
        "difficulty": "Easy",
        "displayText": "1667. Fix Names in a Table"
    },
    "1668": {
        "id": "1668",
        "name": "Maximum Repeating Substring",
        "acceptance": "39.4",
        "difficulty": "Easy",
        "displayText": "1668. Maximum Repeating Substring"
    },
    "1669": {
        "id": "1669",
        "name": "Merge In Between Linked Lists",
        "acceptance": "82.2",
        "difficulty": "Medium",
        "displayText": "1669. Merge In Between Linked Lists"
    },
    "1670": {
        "id": "1670",
        "name": "Design Front Middle Back Queue",
        "acceptance": "57.0",
        "difficulty": "Medium",
        "displayText": "1670. Design Front Middle Back Queue"
    },
    "1671": {
        "id": "1671",
        "name": "Minimum Number of Removals to Make Mountain Array",
        "acceptance": "55.0",
        "difficulty": "Hard",
        "displayText": "1671. Minimum Number of Removals to Make Mountain Array"
    },
    "1672": {
        "id": "1672",
        "name": "Richest Customer Wealth",
        "acceptance": "88.5",
        "difficulty": "Easy",
        "displayText": "1672. Richest Customer Wealth"
    },
    "1673": {
        "id": "1673",
        "name": "Find the Most Competitive Subsequence",
        "acceptance": "51.6",
        "difficulty": "Medium",
        "displayText": "1673. Find the Most Competitive Subsequence"
    },
    "1674": {
        "id": "1674",
        "name": "Minimum Moves to Make Array Complementary",
        "acceptance": "41.4",
        "difficulty": "Medium",
        "displayText": "1674. Minimum Moves to Make Array Complementary"
    },
    "1675": {
        "id": "1675",
        "name": "Minimize Deviation in Array",
        "acceptance": "53.9",
        "difficulty": "Hard",
        "displayText": "1675. Minimize Deviation in Array"
    },
    "1676": {
        "id": "1676",
        "name": "Lowest Common Ancestor of a Binary Tree IV",
        "acceptance": "78.9",
        "difficulty": "Medium",
        "displayText": "1676. Lowest Common Ancestor of a Binary Tree IV"
    },
    "1677": {
        "id": "1677",
        "name": "Product's Worth Over Invoices",
        "acceptance": "38.4",
        "difficulty": "Easy",
        "displayText": "1677. Product's Worth Over Invoices"
    },
    "1678": {
        "id": "1678",
        "name": "Goal Parser Interpretation",
        "acceptance": "87.6",
        "difficulty": "Easy",
        "displayText": "1678. Goal Parser Interpretation"
    },
    "1679": {
        "id": "1679",
        "name": "Max Number of K-Sum Pairs",
        "acceptance": "56.0",
        "difficulty": "Medium",
        "displayText": "1679. Max Number of K-Sum Pairs"
    },
    "1680": {
        "id": "1680",
        "name": "Concatenation of Consecutive Binary Numbers",
        "acceptance": "56.6",
        "difficulty": "Medium",
        "displayText": "1680. Concatenation of Consecutive Binary Numbers"
    },
    "1681": {
        "id": "1681",
        "name": "Minimum Incompatibility",
        "acceptance": "39.6",
        "difficulty": "Hard",
        "displayText": "1681. Minimum Incompatibility"
    },
    "1682": {
        "id": "1682",
        "name": "Longest Palindromic Subsequence II",
        "acceptance": "50.2",
        "difficulty": "Medium",
        "displayText": "1682. Longest Palindromic Subsequence II"
    },
    "1683": {
        "id": "1683",
        "name": "Invalid Tweets",
        "acceptance": "85.6",
        "difficulty": "Easy",
        "displayText": "1683. Invalid Tweets"
    },
    "1684": {
        "id": "1684",
        "name": "Count the Number of Consistent Strings",
        "acceptance": "88.2",
        "difficulty": "Easy",
        "displayText": "1684. Count the Number of Consistent Strings"
    },
    "1685": {
        "id": "1685",
        "name": "Sum of Absolute Differences in a Sorted Array",
        "acceptance": "68.2",
        "difficulty": "Medium",
        "displayText": "1685. Sum of Absolute Differences in a Sorted Array"
    },
    "1686": {
        "id": "1686",
        "name": "Stone Game VI",
        "acceptance": "58.5",
        "difficulty": "Medium",
        "displayText": "1686. Stone Game VI"
    },
    "1687": {
        "id": "1687",
        "name": "Delivering Boxes from Storage to Ports",
        "acceptance": "39.2",
        "difficulty": "Hard",
        "displayText": "1687. Delivering Boxes from Storage to Ports"
    },
    "1688": {
        "id": "1688",
        "name": "Count of Matches in Tournament",
        "acceptance": "85.9",
        "difficulty": "Easy",
        "displayText": "1688. Count of Matches in Tournament"
    },
    "1689": {
        "id": "1689",
        "name": "Partitioning Into Minimum Number Of Deci-Binary Numbers",
        "acceptance": "88.6",
        "difficulty": "Medium",
        "displayText": "1689. Partitioning Into Minimum Number Of Deci-Binary Numbers"
    },
    "1690": {
        "id": "1690",
        "name": "Stone Game VII",
        "acceptance": "58.2",
        "difficulty": "Medium",
        "displayText": "1690. Stone Game VII"
    },
    "1691": {
        "id": "1691",
        "name": "Maximum Height by Stacking Cuboids",
        "acceptance": "59.7",
        "difficulty": "Hard",
        "displayText": "1691. Maximum Height by Stacking Cuboids"
    },
    "1692": {
        "id": "1692",
        "name": "Count Ways to Distribute Candies",
        "acceptance": "63.0",
        "difficulty": "Hard",
        "displayText": "1692. Count Ways to Distribute Candies"
    },
    "1693": {
        "id": "1693",
        "name": "Daily Leads and Partners",
        "acceptance": "86.6",
        "difficulty": "Easy",
        "displayText": "1693. Daily Leads and Partners"
    },
    "1694": {
        "id": "1694",
        "name": "Reformat Phone Number",
        "acceptance": "66.8",
        "difficulty": "Easy",
        "displayText": "1694. Reformat Phone Number"
    },
    "1695": {
        "id": "1695",
        "name": "Maximum Erasure Value",
        "acceptance": "59.1",
        "difficulty": "Medium",
        "displayText": "1695. Maximum Erasure Value"
    },
    "1696": {
        "id": "1696",
        "name": "Jump Game VI",
        "acceptance": "45.9",
        "difficulty": "Medium",
        "displayText": "1696. Jump Game VI"
    },
    "1697": {
        "id": "1697",
        "name": "Checking Existence of Edge Length Limited Paths",
        "acceptance": "62.7",
        "difficulty": "Hard",
        "displayText": "1697. Checking Existence of Edge Length Limited Paths"
    },
    "1698": {
        "id": "1698",
        "name": "Number of Distinct Substrings in a String",
        "acceptance": "64.4",
        "difficulty": "Medium",
        "displayText": "1698. Number of Distinct Substrings in a String"
    },
    "1699": {
        "id": "1699",
        "name": "Number of Calls Between Two Persons",
        "acceptance": "81.0",
        "difficulty": "Medium",
        "displayText": "1699. Number of Calls Between Two Persons"
    },
    "1700": {
        "id": "1700",
        "name": "Number of Students Unable to Eat Lunch",
        "acceptance": "78.6",
        "difficulty": "Easy",
        "displayText": "1700. Number of Students Unable to Eat Lunch"
    },
    "1701": {
        "id": "1701",
        "name": "Average Waiting Time",
        "acceptance": "73.1",
        "difficulty": "Medium",
        "displayText": "1701. Average Waiting Time"
    },
    "1702": {
        "id": "1702",
        "name": "Maximum Binary String After Change",
        "acceptance": "46.8",
        "difficulty": "Medium",
        "displayText": "1702. Maximum Binary String After Change"
    },
    "1703": {
        "id": "1703",
        "name": "Minimum Adjacent Swaps for K Consecutive Ones",
        "acceptance": "42.1",
        "difficulty": "Hard",
        "displayText": "1703. Minimum Adjacent Swaps for K Consecutive Ones"
    },
    "1704": {
        "id": "1704",
        "name": "Determine if String Halves Are Alike",
        "acceptance": "78.6",
        "difficulty": "Easy",
        "displayText": "1704. Determine if String Halves Are Alike"
    },
    "1705": {
        "id": "1705",
        "name": "Maximum Number of Eaten Apples",
        "acceptance": "40.3",
        "difficulty": "Medium",
        "displayText": "1705. Maximum Number of Eaten Apples"
    },
    "1706": {
        "id": "1706",
        "name": "Where Will the Ball Fall",
        "acceptance": "72.0",
        "difficulty": "Medium",
        "displayText": "1706. Where Will the Ball Fall"
    },
    "1707": {
        "id": "1707",
        "name": "Maximum XOR With an Element From Array",
        "acceptance": "54.2",
        "difficulty": "Hard",
        "displayText": "1707. Maximum XOR With an Element From Array"
    },
    "1708": {
        "id": "1708",
        "name": "Largest Subarray Length K",
        "acceptance": "65.1",
        "difficulty": "Easy",
        "displayText": "1708. Largest Subarray Length K"
    },
    "1709": {
        "id": "1709",
        "name": "Biggest Window Between Visits",
        "acceptance": "70.3",
        "difficulty": "Medium",
        "displayText": "1709. Biggest Window Between Visits"
    },
    "1710": {
        "id": "1710",
        "name": "Maximum Units on a Truck",
        "acceptance": "74.1",
        "difficulty": "Easy",
        "displayText": "1710. Maximum Units on a Truck"
    },
    "1711": {
        "id": "1711",
        "name": "Count Good Meals",
        "acceptance": "31.4",
        "difficulty": "Medium",
        "displayText": "1711. Count Good Meals"
    },
    "1712": {
        "id": "1712",
        "name": "Ways to Split Array Into Three Subarrays",
        "acceptance": "33.3",
        "difficulty": "Medium",
        "displayText": "1712. Ways to Split Array Into Three Subarrays"
    },
    "1713": {
        "id": "1713",
        "name": "Minimum Operations to Make a Subsequence",
        "acceptance": "48.5",
        "difficulty": "Hard",
        "displayText": "1713. Minimum Operations to Make a Subsequence"
    },
    "1714": {
        "id": "1714",
        "name": "Sum Of Special Evenly-Spaced Elements In Array",
        "acceptance": "49.1",
        "difficulty": "Hard",
        "displayText": "1714. Sum Of Special Evenly-Spaced Elements In Array"
    },
    "1715": {
        "id": "1715",
        "name": "Count Apples and Oranges",
        "acceptance": "75.9",
        "difficulty": "Medium",
        "displayText": "1715. Count Apples and Oranges"
    },
    "1716": {
        "id": "1716",
        "name": "Calculate Money in Leetcode Bank",
        "acceptance": "78.4",
        "difficulty": "Easy",
        "displayText": "1716. Calculate Money in Leetcode Bank"
    },
    "1717": {
        "id": "1717",
        "name": "Maximum Score From Removing Substrings",
        "acceptance": "62.8",
        "difficulty": "Medium",
        "displayText": "1717. Maximum Score From Removing Substrings"
    },
    "1718": {
        "id": "1718",
        "name": "Construct the Lexicographically Largest Valid Sequence",
        "acceptance": "73.2",
        "difficulty": "Medium",
        "displayText": "1718. Construct the Lexicographically Largest Valid Sequence"
    },
    "1719": {
        "id": "1719",
        "name": "Number Of Ways To Reconstruct A Tree",
        "acceptance": "44.0",
        "difficulty": "Hard",
        "displayText": "1719. Number Of Ways To Reconstruct A Tree"
    },
    "1720": {
        "id": "1720",
        "name": "Decode XORed Array",
        "acceptance": "86.9",
        "difficulty": "Easy",
        "displayText": "1720. Decode XORed Array"
    },
    "1721": {
        "id": "1721",
        "name": "Swapping Nodes in a Linked List",
        "acceptance": "68.3",
        "difficulty": "Medium",
        "displayText": "1721. Swapping Nodes in a Linked List"
    },
    "1722": {
        "id": "1722",
        "name": "Minimize Hamming Distance After Swap Operations",
        "acceptance": "47.9",
        "difficulty": "Medium",
        "displayText": "1722. Minimize Hamming Distance After Swap Operations"
    },
    "1723": {
        "id": "1723",
        "name": "Find Minimum Time to Finish All Jobs",
        "acceptance": "43.1",
        "difficulty": "Hard",
        "displayText": "1723. Find Minimum Time to Finish All Jobs"
    },
    "1724": {
        "id": "1724",
        "name": "Checking Existence of Edge Length Limited Paths II",
        "acceptance": "51.3",
        "difficulty": "Hard",
        "displayText": "1724. Checking Existence of Edge Length Limited Paths II"
    },
    "1725": {
        "id": "1725",
        "name": "Number Of Rectangles That Can Form The Largest Square",
        "acceptance": "78.9",
        "difficulty": "Easy",
        "displayText": "1725. Number Of Rectangles That Can Form The Largest Square"
    },
    "1726": {
        "id": "1726",
        "name": "Tuple with Same Product",
        "acceptance": "70.2",
        "difficulty": "Medium",
        "displayText": "1726. Tuple with Same Product"
    },
    "1727": {
        "id": "1727",
        "name": "Largest Submatrix With Rearrangements",
        "acceptance": "75.2",
        "difficulty": "Medium",
        "displayText": "1727. Largest Submatrix With Rearrangements"
    },
    "1728": {
        "id": "1728",
        "name": "Cat and Mouse II",
        "acceptance": "39.5",
        "difficulty": "Hard",
        "displayText": "1728. Cat and Mouse II"
    },
    "1729": {
        "id": "1729",
        "name": "Find Followers Count",
        "acceptance": "69.5",
        "difficulty": "Easy",
        "displayText": "1729. Find Followers Count"
    },
    "1730": {
        "id": "1730",
        "name": "Shortest Path to Get Food",
        "acceptance": "56.6",
        "difficulty": "Medium",
        "displayText": "1730. Shortest Path to Get Food"
    },
    "1731": {
        "id": "1731",
        "name": "The Number of Employees Which Report to Each Employee",
        "acceptance": "51.8",
        "difficulty": "Easy",
        "displayText": "1731. The Number of Employees Which Report to Each Employee"
    },
    "1732": {
        "id": "1732",
        "name": "Find the Highest Altitude",
        "acceptance": "83.8",
        "difficulty": "Easy",
        "displayText": "1732. Find the Highest Altitude"
    },
    "1733": {
        "id": "1733",
        "name": "Minimum Number of People to Teach",
        "acceptance": "43.3",
        "difficulty": "Medium",
        "displayText": "1733. Minimum Number of People to Teach"
    },
    "1734": {
        "id": "1734",
        "name": "Decode XORed Permutation",
        "acceptance": "65.6",
        "difficulty": "Medium",
        "displayText": "1734. Decode XORed Permutation"
    },
    "1735": {
        "id": "1735",
        "name": "Count Ways to Make Array With Product",
        "acceptance": "52.4",
        "difficulty": "Hard",
        "displayText": "1735. Count Ways to Make Array With Product"
    },
    "1736": {
        "id": "1736",
        "name": "Latest Time by Replacing Hidden Digits",
        "acceptance": "43.0",
        "difficulty": "Easy",
        "displayText": "1736. Latest Time by Replacing Hidden Digits"
    },
    "1737": {
        "id": "1737",
        "name": "Change Minimum Characters to Satisfy One of Three Conditions",
        "acceptance": "37.0",
        "difficulty": "Medium",
        "displayText": "1737. Change Minimum Characters to Satisfy One of Three Conditions"
    },
    "1738": {
        "id": "1738",
        "name": "Find Kth Largest XOR Coordinate Value",
        "acceptance": "62.6",
        "difficulty": "Medium",
        "displayText": "1738. Find Kth Largest XOR Coordinate Value"
    },
    "1739": {
        "id": "1739",
        "name": "Building Boxes",
        "acceptance": "51.7",
        "difficulty": "Hard",
        "displayText": "1739. Building Boxes"
    },
    "1740": {
        "id": "1740",
        "name": "Find Distance in a Binary Tree",
        "acceptance": "73.9",
        "difficulty": "Medium",
        "displayText": "1740. Find Distance in a Binary Tree"
    },
    "1741": {
        "id": "1741",
        "name": "Find Total Time Spent by Each Employee",
        "acceptance": "86.9",
        "difficulty": "Easy",
        "displayText": "1741. Find Total Time Spent by Each Employee"
    },
    "1742": {
        "id": "1742",
        "name": "Maximum Number of Balls in a Box",
        "acceptance": "74.1",
        "difficulty": "Easy",
        "displayText": "1742. Maximum Number of Balls in a Box"
    },
    "1743": {
        "id": "1743",
        "name": "Restore the Array From Adjacent Pairs",
        "acceptance": "74.7",
        "difficulty": "Medium",
        "displayText": "1743. Restore the Array From Adjacent Pairs"
    },
    "1744": {
        "id": "1744",
        "name": "Can You Eat Your Favorite Candy on Your Favorite Day?",
        "acceptance": "34.5",
        "difficulty": "Medium",
        "displayText": "1744. Can You Eat Your Favorite Candy on Your Favorite Day?"
    },
    "1745": {
        "id": "1745",
        "name": "Palindrome Partitioning IV",
        "acceptance": "44.6",
        "difficulty": "Hard",
        "displayText": "1745. Palindrome Partitioning IV"
    },
    "1746": {
        "id": "1746",
        "name": "Maximum Subarray Sum After One Operation",
        "acceptance": "65.2",
        "difficulty": "Medium",
        "displayText": "1746. Maximum Subarray Sum After One Operation"
    },
    "1747": {
        "id": "1747",
        "name": "Leetflex Banned Accounts",
        "acceptance": "62.3",
        "difficulty": "Medium",
        "displayText": "1747. Leetflex Banned Accounts"
    },
    "1748": {
        "id": "1748",
        "name": "Sum of Unique Elements",
        "acceptance": "78.9",
        "difficulty": "Easy",
        "displayText": "1748. Sum of Unique Elements"
    },
    "1749": {
        "id": "1749",
        "name": "Maximum Absolute Sum of Any Subarray",
        "acceptance": "71.5",
        "difficulty": "Medium",
        "displayText": "1749. Maximum Absolute Sum of Any Subarray"
    },
    "1750": {
        "id": "1750",
        "name": "Minimum Length of String After Deleting Similar Ends",
        "acceptance": "55.9",
        "difficulty": "Medium",
        "displayText": "1750. Minimum Length of String After Deleting Similar Ends"
    },
    "1751": {
        "id": "1751",
        "name": "Maximum Number of Events That Can Be Attended II",
        "acceptance": "60.9",
        "difficulty": "Hard",
        "displayText": "1751. Maximum Number of Events That Can Be Attended II"
    },
    "1752": {
        "id": "1752",
        "name": "Check if Array Is Sorted and Rotated",
        "acceptance": "55.0",
        "difficulty": "Easy",
        "displayText": "1752. Check if Array Is Sorted and Rotated"
    },
    "1753": {
        "id": "1753",
        "name": "Maximum Score From Removing Stones",
        "acceptance": "67.6",
        "difficulty": "Medium",
        "displayText": "1753. Maximum Score From Removing Stones"
    },
    "1754": {
        "id": "1754",
        "name": "Largest Merge Of Two Strings",
        "acceptance": "50.7",
        "difficulty": "Medium",
        "displayText": "1754. Largest Merge Of Two Strings"
    },
    "1755": {
        "id": "1755",
        "name": "Closest Subsequence Sum",
        "acceptance": "41.3",
        "difficulty": "Hard",
        "displayText": "1755. Closest Subsequence Sum"
    },
    "1756": {
        "id": "1756",
        "name": "Design Most Recently Used Queue",
        "acceptance": "77.7",
        "difficulty": "Medium",
        "displayText": "1756. Design Most Recently Used Queue"
    },
    "1757": {
        "id": "1757",
        "name": "Recyclable and Low Fat Products",
        "acceptance": "89.3",
        "difficulty": "Easy",
        "displayText": "1757. Recyclable and Low Fat Products"
    },
    "1758": {
        "id": "1758",
        "name": "Minimum Changes To Make Alternating Binary String",
        "acceptance": "63.7",
        "difficulty": "Easy",
        "displayText": "1758. Minimum Changes To Make Alternating Binary String"
    },
    "1759": {
        "id": "1759",
        "name": "Count Number of Homogenous Substrings",
        "acceptance": "57.4",
        "difficulty": "Medium",
        "displayText": "1759. Count Number of Homogenous Substrings"
    },
    "1760": {
        "id": "1760",
        "name": "Minimum Limit of Balls in a Bag",
        "acceptance": "67.6",
        "difficulty": "Medium",
        "displayText": "1760. Minimum Limit of Balls in a Bag"
    },
    "1761": {
        "id": "1761",
        "name": "Minimum Degree of a Connected Trio in a Graph",
        "acceptance": "43.1",
        "difficulty": "Hard",
        "displayText": "1761. Minimum Degree of a Connected Trio in a Graph"
    },
    "1762": {
        "id": "1762",
        "name": "Buildings With an Ocean View",
        "acceptance": "80.6",
        "difficulty": "Medium",
        "displayText": "1762. Buildings With an Ocean View"
    },
    "1763": {
        "id": "1763",
        "name": "Longest Nice Substring",
        "acceptance": "62.0",
        "difficulty": "Easy",
        "displayText": "1763. Longest Nice Substring"
    },
    "1764": {
        "id": "1764",
        "name": "Form Array by Concatenating Subarrays of Another Array",
        "acceptance": "53.6",
        "difficulty": "Medium",
        "displayText": "1764. Form Array by Concatenating Subarrays of Another Array"
    },
    "1765": {
        "id": "1765",
        "name": "Map of Highest Peak",
        "acceptance": "75.0",
        "difficulty": "Medium",
        "displayText": "1765. Map of Highest Peak"
    },
    "1766": {
        "id": "1766",
        "name": "Tree of Coprimes",
        "acceptance": "41.8",
        "difficulty": "Hard",
        "displayText": "1766. Tree of Coprimes"
    },
    "1767": {
        "id": "1767",
        "name": "Find the Subtasks That Did Not Execute",
        "acceptance": "78.1",
        "difficulty": "Hard",
        "displayText": "1767. Find the Subtasks That Did Not Execute"
    },
    "1768": {
        "id": "1768",
        "name": "Merge Strings Alternately",
        "acceptance": "82.1",
        "difficulty": "Easy",
        "displayText": "1768. Merge Strings Alternately"
    },
    "1769": {
        "id": "1769",
        "name": "Minimum Number of Operations to Move All Balls to Each Box",
        "acceptance": "90.1",
        "difficulty": "Medium",
        "displayText": "1769. Minimum Number of Operations to Move All Balls to Each Box"
    },
    "1770": {
        "id": "1770",
        "name": "Maximum Score from Performing Multiplication Operations",
        "acceptance": "42.0",
        "difficulty": "Hard",
        "displayText": "1770. Maximum Score from Performing Multiplication Operations"
    },
    "1771": {
        "id": "1771",
        "name": "Maximize Palindrome Length From Subsequences",
        "acceptance": "37.0",
        "difficulty": "Hard",
        "displayText": "1771. Maximize Palindrome Length From Subsequences"
    },
    "1772": {
        "id": "1772",
        "name": "Sort Features by Popularity",
        "acceptance": "65.8",
        "difficulty": "Medium",
        "displayText": "1772. Sort Features by Popularity"
    },
    "1773": {
        "id": "1773",
        "name": "Count Items Matching a Rule",
        "acceptance": "84.9",
        "difficulty": "Easy",
        "displayText": "1773. Count Items Matching a Rule"
    },
    "1774": {
        "id": "1774",
        "name": "Closest Dessert Cost",
        "acceptance": "47.5",
        "difficulty": "Medium",
        "displayText": "1774. Closest Dessert Cost"
    },
    "1775": {
        "id": "1775",
        "name": "Equal Sum Arrays With Minimum Number of Operations",
        "acceptance": "53.8",
        "difficulty": "Medium",
        "displayText": "1775. Equal Sum Arrays With Minimum Number of Operations"
    },
    "1776": {
        "id": "1776",
        "name": "Car Fleet II",
        "acceptance": "56.1",
        "difficulty": "Hard",
        "displayText": "1776. Car Fleet II"
    },
    "1777": {
        "id": "1777",
        "name": "Product's Price for Each Store",
        "acceptance": "82.5",
        "difficulty": "Easy",
        "displayText": "1777. Product's Price for Each Store"
    },
    "1778": {
        "id": "1778",
        "name": "Shortest Path in a Hidden Grid",
        "acceptance": "44.1",
        "difficulty": "Medium",
        "displayText": "1778. Shortest Path in a Hidden Grid"
    },
    "1779": {
        "id": "1779",
        "name": "Find Nearest Point That Has the Same X or Y Coordinate",
        "acceptance": "69.3",
        "difficulty": "Easy",
        "displayText": "1779. Find Nearest Point That Has the Same X or Y Coordinate"
    },
    "1780": {
        "id": "1780",
        "name": "Check if Number is a Sum of Powers of Three",
        "acceptance": "79.3",
        "difficulty": "Medium",
        "displayText": "1780. Check if Number is a Sum of Powers of Three"
    },
    "1781": {
        "id": "1781",
        "name": "Sum of Beauty of All Substrings",
        "acceptance": "70.0",
        "difficulty": "Medium",
        "displayText": "1781. Sum of Beauty of All Substrings"
    },
    "1782": {
        "id": "1782",
        "name": "Count Pairs Of Nodes",
        "acceptance": "40.5",
        "difficulty": "Hard",
        "displayText": "1782. Count Pairs Of Nodes"
    },
    "1783": {
        "id": "1783",
        "name": "Grand Slam Titles",
        "acceptance": "83.2",
        "difficulty": "Medium",
        "displayText": "1783. Grand Slam Titles"
    },
    "1784": {
        "id": "1784",
        "name": "Check if Binary String Has at Most One Segment of Ones",
        "acceptance": "39.0",
        "difficulty": "Easy",
        "displayText": "1784. Check if Binary String Has at Most One Segment of Ones"
    },
    "1785": {
        "id": "1785",
        "name": "Minimum Elements to Add to Form a Given Sum",
        "acceptance": "44.2",
        "difficulty": "Medium",
        "displayText": "1785. Minimum Elements to Add to Form a Given Sum"
    },
    "1786": {
        "id": "1786",
        "name": "Number of Restricted Paths From First to Last Node",
        "acceptance": "39.8",
        "difficulty": "Medium",
        "displayText": "1786. Number of Restricted Paths From First to Last Node"
    },
    "1787": {
        "id": "1787",
        "name": "Make the XOR of All Segments Equal to Zero",
        "acceptance": "39.7",
        "difficulty": "Hard",
        "displayText": "1787. Make the XOR of All Segments Equal to Zero"
    },
    "1788": {
        "id": "1788",
        "name": "Maximize the Beauty of the Garden",
        "acceptance": "63.6",
        "difficulty": "Hard",
        "displayText": "1788. Maximize the Beauty of the Garden"
    },
    "1789": {
        "id": "1789",
        "name": "Primary Department for Each Employee",
        "acceptance": "70.9",
        "difficulty": "Easy",
        "displayText": "1789. Primary Department for Each Employee"
    },
    "1790": {
        "id": "1790",
        "name": "Check if One String Swap Can Make Strings Equal",
        "acceptance": "49.4",
        "difficulty": "Easy",
        "displayText": "1790. Check if One String Swap Can Make Strings Equal"
    },
    "1791": {
        "id": "1791",
        "name": "Find Center of Star Graph",
        "acceptance": "86.6",
        "difficulty": "Easy",
        "displayText": "1791. Find Center of Star Graph"
    },
    "1792": {
        "id": "1792",
        "name": "Maximum Average Pass Ratio",
        "acceptance": "71.6",
        "difficulty": "Medium",
        "displayText": "1792. Maximum Average Pass Ratio"
    },
    "1793": {
        "id": "1793",
        "name": "Maximum Score of a Good Subarray",
        "acceptance": "64.2",
        "difficulty": "Hard",
        "displayText": "1793. Maximum Score of a Good Subarray"
    },
    "1794": {
        "id": "1794",
        "name": "Count Pairs of Equal Substrings With Minimum Difference",
        "acceptance": "63.6",
        "difficulty": "Medium",
        "displayText": "1794. Count Pairs of Equal Substrings With Minimum Difference"
    },
    "1795": {
        "id": "1795",
        "name": "Rearrange Products Table",
        "acceptance": "85.6",
        "difficulty": "Easy",
        "displayText": "1795. Rearrange Products Table"
    },
    "1796": {
        "id": "1796",
        "name": "Second Largest Digit in a String",
        "acceptance": "51.6",
        "difficulty": "Easy",
        "displayText": "1796. Second Largest Digit in a String"
    },
    "1797": {
        "id": "1797",
        "name": "Design Authentication Manager",
        "acceptance": "58.0",
        "difficulty": "Medium",
        "displayText": "1797. Design Authentication Manager"
    },
    "1798": {
        "id": "1798",
        "name": "Maximum Number of Consecutive Values You Can Make",
        "acceptance": "61.7",
        "difficulty": "Medium",
        "displayText": "1798. Maximum Number of Consecutive Values You Can Make"
    },
    "1799": {
        "id": "1799",
        "name": "Maximize Score After N Operations",
        "acceptance": "57.8",
        "difficulty": "Hard",
        "displayText": "1799. Maximize Score After N Operations"
    },
    "1800": {
        "id": "1800",
        "name": "Maximum Ascending Subarray Sum",
        "acceptance": "66.5",
        "difficulty": "Easy",
        "displayText": "1800. Maximum Ascending Subarray Sum"
    },
    "1801": {
        "id": "1801",
        "name": "Number of Orders in the Backlog",
        "acceptance": "51.4",
        "difficulty": "Medium",
        "displayText": "1801. Number of Orders in the Backlog"
    },
    "1802": {
        "id": "1802",
        "name": "Maximum Value at a Given Index in a Bounded Array",
        "acceptance": "38.8",
        "difficulty": "Medium",
        "displayText": "1802. Maximum Value at a Given Index in a Bounded Array"
    },
    "1803": {
        "id": "1803",
        "name": "Count Pairs With XOR in a Range",
        "acceptance": "45.8",
        "difficulty": "Hard",
        "displayText": "1803. Count Pairs With XOR in a Range"
    },
    "1804": {
        "id": "1804",
        "name": "Implement Trie II (Prefix Tree)",
        "acceptance": "63.0",
        "difficulty": "Medium",
        "displayText": "1804. Implement Trie II (Prefix Tree)"
    },
    "1805": {
        "id": "1805",
        "name": "Number of Different Integers in a String",
        "acceptance": "38.9",
        "difficulty": "Easy",
        "displayText": "1805. Number of Different Integers in a String"
    },
    "1806": {
        "id": "1806",
        "name": "Minimum Number of Operations to Reinitialize a Permutation",
        "acceptance": "72.0",
        "difficulty": "Medium",
        "displayText": "1806. Minimum Number of Operations to Reinitialize a Permutation"
    },
    "1807": {
        "id": "1807",
        "name": "Evaluate the Bracket Pairs of a String",
        "acceptance": "67.9",
        "difficulty": "Medium",
        "displayText": "1807. Evaluate the Bracket Pairs of a String"
    },
    "1808": {
        "id": "1808",
        "name": "Maximize Number of Nice Divisors",
        "acceptance": "32.7",
        "difficulty": "Hard",
        "displayText": "1808. Maximize Number of Nice Divisors"
    },
    "1809": {
        "id": "1809",
        "name": "Ad-Free Sessions",
        "acceptance": "58.6",
        "difficulty": "Easy",
        "displayText": "1809. Ad-Free Sessions"
    },
    "1810": {
        "id": "1810",
        "name": "Minimum Path Cost in a Hidden Grid",
        "acceptance": "58.1",
        "difficulty": "Medium",
        "displayText": "1810. Minimum Path Cost in a Hidden Grid"
    },
    "1811": {
        "id": "1811",
        "name": "Find Interview Candidates",
        "acceptance": "60.6",
        "difficulty": "Medium",
        "displayText": "1811. Find Interview Candidates"
    },
    "1812": {
        "id": "1812",
        "name": "Determine Color of a Chessboard Square",
        "acceptance": "79.1",
        "difficulty": "Easy",
        "displayText": "1812. Determine Color of a Chessboard Square"
    },
    "1813": {
        "id": "1813",
        "name": "Sentence Similarity III",
        "acceptance": "48.7",
        "difficulty": "Medium",
        "displayText": "1813. Sentence Similarity III"
    },
    "1814": {
        "id": "1814",
        "name": "Count Nice Pairs in an Array",
        "acceptance": "48.6",
        "difficulty": "Medium",
        "displayText": "1814. Count Nice Pairs in an Array"
    },
    "1815": {
        "id": "1815",
        "name": "Maximum Number of Groups Getting Fresh Donuts",
        "acceptance": "40.2",
        "difficulty": "Hard",
        "displayText": "1815. Maximum Number of Groups Getting Fresh Donuts"
    },
    "1816": {
        "id": "1816",
        "name": "Truncate Sentence",
        "acceptance": "85.9",
        "difficulty": "Easy",
        "displayText": "1816. Truncate Sentence"
    },
    "1817": {
        "id": "1817",
        "name": "Finding the Users Active Minutes",
        "acceptance": "80.4",
        "difficulty": "Medium",
        "displayText": "1817. Finding the Users Active Minutes"
    },
    "1818": {
        "id": "1818",
        "name": "Minimum Absolute Sum Difference",
        "acceptance": "31.1",
        "difficulty": "Medium",
        "displayText": "1818. Minimum Absolute Sum Difference"
    },
    "1819": {
        "id": "1819",
        "name": "Number of Different Subsequences GCDs",
        "acceptance": "41.5",
        "difficulty": "Hard",
        "displayText": "1819. Number of Different Subsequences GCDs"
    },
    "1820": {
        "id": "1820",
        "name": "Maximum Number of Accepted Invitations",
        "acceptance": "51.6",
        "difficulty": "Medium",
        "displayText": "1820. Maximum Number of Accepted Invitations"
    },
    "1821": {
        "id": "1821",
        "name": "Find Customers With Positive Revenue this Year",
        "acceptance": "87.7",
        "difficulty": "Easy",
        "displayText": "1821. Find Customers With Positive Revenue this Year"
    },
    "1822": {
        "id": "1822",
        "name": "Sign of the Product of an Array",
        "acceptance": "65.2",
        "difficulty": "Easy",
        "displayText": "1822. Sign of the Product of an Array"
    },
    "1823": {
        "id": "1823",
        "name": "Find the Winner of the Circular Game",
        "acceptance": "82.0",
        "difficulty": "Medium",
        "displayText": "1823. Find the Winner of the Circular Game"
    },
    "1824": {
        "id": "1824",
        "name": "Minimum Sideway Jumps",
        "acceptance": "50.6",
        "difficulty": "Medium",
        "displayText": "1824. Minimum Sideway Jumps"
    },
    "1825": {
        "id": "1825",
        "name": "Finding MK Average",
        "acceptance": "38.1",
        "difficulty": "Hard",
        "displayText": "1825. Finding MK Average"
    },
    "1826": {
        "id": "1826",
        "name": "Faulty Sensor",
        "acceptance": "50.3",
        "difficulty": "Easy",
        "displayText": "1826. Faulty Sensor"
    },
    "1827": {
        "id": "1827",
        "name": "Minimum Operations to Make the Array Increasing",
        "acceptance": "80.9",
        "difficulty": "Easy",
        "displayText": "1827. Minimum Operations to Make the Array Increasing"
    },
    "1828": {
        "id": "1828",
        "name": "Queries on Number of Points Inside a Circle",
        "acceptance": "86.3",
        "difficulty": "Medium",
        "displayText": "1828. Queries on Number of Points Inside a Circle"
    },
    "1829": {
        "id": "1829",
        "name": "Maximum XOR for Each Query",
        "acceptance": "84.8",
        "difficulty": "Medium",
        "displayText": "1829. Maximum XOR for Each Query"
    },
    "1830": {
        "id": "1830",
        "name": "Minimum Number of Operations to Make String Sorted",
        "acceptance": "49.8",
        "difficulty": "Hard",
        "displayText": "1830. Minimum Number of Operations to Make String Sorted"
    },
    "1831": {
        "id": "1831",
        "name": "Maximum Transaction Each Day",
        "acceptance": "82.4",
        "difficulty": "Medium",
        "displayText": "1831. Maximum Transaction Each Day"
    },
    "1832": {
        "id": "1832",
        "name": "Check if the Sentence Is Pangram",
        "acceptance": "83.8",
        "difficulty": "Easy",
        "displayText": "1832. Check if the Sentence Is Pangram"
    },
    "1833": {
        "id": "1833",
        "name": "Maximum Ice Cream Bars",
        "acceptance": "73.8",
        "difficulty": "Medium",
        "displayText": "1833. Maximum Ice Cream Bars"
    },
    "1834": {
        "id": "1834",
        "name": "Single-Threaded CPU",
        "acceptance": "46.2",
        "difficulty": "Medium",
        "displayText": "1834. Single-Threaded CPU"
    },
    "1835": {
        "id": "1835",
        "name": "Find XOR Sum of All Pairs Bitwise AND",
        "acceptance": "61.4",
        "difficulty": "Hard",
        "displayText": "1835. Find XOR Sum of All Pairs Bitwise AND"
    },
    "1836": {
        "id": "1836",
        "name": "Remove Duplicates From an Unsorted Linked List",
        "acceptance": "75.2",
        "difficulty": "Medium",
        "displayText": "1836. Remove Duplicates From an Unsorted Linked List"
    },
    "1837": {
        "id": "1837",
        "name": "Sum of Digits in Base K",
        "acceptance": "77.9",
        "difficulty": "Easy",
        "displayText": "1837. Sum of Digits in Base K"
    },
    "1838": {
        "id": "1838",
        "name": "Frequency of the Most Frequent Element",
        "acceptance": "44.0",
        "difficulty": "Medium",
        "displayText": "1838. Frequency of the Most Frequent Element"
    },
    "1839": {
        "id": "1839",
        "name": "Longest Substring Of All Vowels in Order",
        "acceptance": "50.2",
        "difficulty": "Medium",
        "displayText": "1839. Longest Substring Of All Vowels in Order"
    },
    "1840": {
        "id": "1840",
        "name": "Maximum Building Height",
        "acceptance": "37.2",
        "difficulty": "Hard",
        "displayText": "1840. Maximum Building Height"
    },
    "1841": {
        "id": "1841",
        "name": "League Statistics",
        "acceptance": "53.4",
        "difficulty": "Medium",
        "displayText": "1841. League Statistics"
    },
    "1842": {
        "id": "1842",
        "name": "Next Palindrome Using Same Digits",
        "acceptance": "53.7",
        "difficulty": "Hard",
        "displayText": "1842. Next Palindrome Using Same Digits"
    },
    "1843": {
        "id": "1843",
        "name": "Suspicious Bank Accounts",
        "acceptance": "45.0",
        "difficulty": "Medium",
        "displayText": "1843. Suspicious Bank Accounts"
    },
    "1844": {
        "id": "1844",
        "name": "Replace All Digits with Characters",
        "acceptance": "82.0",
        "difficulty": "Easy",
        "displayText": "1844. Replace All Digits with Characters"
    },
    "1845": {
        "id": "1845",
        "name": "Seat Reservation Manager",
        "acceptance": "70.2",
        "difficulty": "Medium",
        "displayText": "1845. Seat Reservation Manager"
    },
    "1846": {
        "id": "1846",
        "name": "Maximum Element After Decreasing and Rearranging",
        "acceptance": "65.7",
        "difficulty": "Medium",
        "displayText": "1846. Maximum Element After Decreasing and Rearranging"
    },
    "1847": {
        "id": "1847",
        "name": "Closest Room",
        "acceptance": "39.4",
        "difficulty": "Hard",
        "displayText": "1847. Closest Room"
    },
    "1848": {
        "id": "1848",
        "name": "Minimum Distance to the Target Element",
        "acceptance": "54.3",
        "difficulty": "Easy",
        "displayText": "1848. Minimum Distance to the Target Element"
    },
    "1849": {
        "id": "1849",
        "name": "Splitting a String Into Descending Consecutive Values",
        "acceptance": "36.7",
        "difficulty": "Medium",
        "displayText": "1849. Splitting a String Into Descending Consecutive Values"
    },
    "1850": {
        "id": "1850",
        "name": "Minimum Adjacent Swaps to Reach the Kth Smallest Number",
        "acceptance": "71.1",
        "difficulty": "Medium",
        "displayText": "1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number"
    },
    "1851": {
        "id": "1851",
        "name": "Minimum Interval to Include Each Query",
        "acceptance": "51.9",
        "difficulty": "Hard",
        "displayText": "1851. Minimum Interval to Include Each Query"
    },
    "1852": {
        "id": "1852",
        "name": "Distinct Numbers in Each Subarray",
        "acceptance": "76.9",
        "difficulty": "Medium",
        "displayText": "1852. Distinct Numbers in Each Subarray"
    },
    "1853": {
        "id": "1853",
        "name": "Convert Date Format",
        "acceptance": "85.6",
        "difficulty": "Easy",
        "displayText": "1853. Convert Date Format"
    },
    "1854": {
        "id": "1854",
        "name": "Maximum Population Year",
        "acceptance": "62.4",
        "difficulty": "Easy",
        "displayText": "1854. Maximum Population Year"
    },
    "1855": {
        "id": "1855",
        "name": "Maximum Distance Between a Pair of Values",
        "acceptance": "53.6",
        "difficulty": "Medium",
        "displayText": "1855. Maximum Distance Between a Pair of Values"
    },
    "1856": {
        "id": "1856",
        "name": "Maximum Subarray Min-Product",
        "acceptance": "38.7",
        "difficulty": "Medium",
        "displayText": "1856. Maximum Subarray Min-Product"
    },
    "1857": {
        "id": "1857",
        "name": "Largest Color Value in a Directed Graph",
        "acceptance": "49.4",
        "difficulty": "Hard",
        "displayText": "1857. Largest Color Value in a Directed Graph"
    },
    "1858": {
        "id": "1858",
        "name": "Longest Word With All Prefixes",
        "acceptance": "71.4",
        "difficulty": "Medium",
        "displayText": "1858. Longest Word With All Prefixes"
    },
    "1859": {
        "id": "1859",
        "name": "Sorting the Sentence",
        "acceptance": "83.7",
        "difficulty": "Easy",
        "displayText": "1859. Sorting the Sentence"
    },
    "1860": {
        "id": "1860",
        "name": "Incremental Memory Leak",
        "acceptance": "72.4",
        "difficulty": "Medium",
        "displayText": "1860. Incremental Memory Leak"
    },
    "1861": {
        "id": "1861",
        "name": "Rotating the Box",
        "acceptance": "79.0",
        "difficulty": "Medium",
        "displayText": "1861. Rotating the Box"
    },
    "1862": {
        "id": "1862",
        "name": "Sum of Floored Pairs",
        "acceptance": "29.5",
        "difficulty": "Hard",
        "displayText": "1862. Sum of Floored Pairs"
    },
    "1863": {
        "id": "1863",
        "name": "Sum of All Subset XOR Totals",
        "acceptance": "90.1",
        "difficulty": "Easy",
        "displayText": "1863. Sum of All Subset XOR Totals"
    },
    "1864": {
        "id": "1864",
        "name": "Minimum Number of Swaps to Make the Binary String Alternating",
        "acceptance": "43.3",
        "difficulty": "Medium",
        "displayText": "1864. Minimum Number of Swaps to Make the Binary String Alternating"
    },
    "1865": {
        "id": "1865",
        "name": "Finding Pairs With a Certain Sum",
        "acceptance": "51.8",
        "difficulty": "Medium",
        "displayText": "1865. Finding Pairs With a Certain Sum"
    },
    "1866": {
        "id": "1866",
        "name": "Number of Ways to Rearrange Sticks With K Sticks Visible",
        "acceptance": "57.6",
        "difficulty": "Hard",
        "displayText": "1866. Number of Ways to Rearrange Sticks With K Sticks Visible"
    },
    "1867": {
        "id": "1867",
        "name": "Orders With Maximum Quantity Above Average",
        "acceptance": "70.8",
        "difficulty": "Medium",
        "displayText": "1867. Orders With Maximum Quantity Above Average"
    },
    "1868": {
        "id": "1868",
        "name": "Product of Two Run-Length Encoded Arrays",
        "acceptance": "59.2",
        "difficulty": "Medium",
        "displayText": "1868. Product of Two Run-Length Encoded Arrays"
    },
    "1869": {
        "id": "1869",
        "name": "Longer Contiguous Segments of Ones than Zeros",
        "acceptance": "61.5",
        "difficulty": "Easy",
        "displayText": "1869. Longer Contiguous Segments of Ones than Zeros"
    },
    "1870": {
        "id": "1870",
        "name": "Minimum Speed to Arrive on Time",
        "acceptance": "47.1",
        "difficulty": "Medium",
        "displayText": "1870. Minimum Speed to Arrive on Time"
    },
    "1871": {
        "id": "1871",
        "name": "Jump Game VII",
        "acceptance": "25.4",
        "difficulty": "Medium",
        "displayText": "1871. Jump Game VII"
    },
    "1872": {
        "id": "1872",
        "name": "Stone Game VIII",
        "acceptance": "52.8",
        "difficulty": "Hard",
        "displayText": "1872. Stone Game VIII"
    },
    "1873": {
        "id": "1873",
        "name": "Calculate Special Bonus",
        "acceptance": "57.4",
        "difficulty": "Easy",
        "displayText": "1873. Calculate Special Bonus"
    },
    "1874": {
        "id": "1874",
        "name": "Minimize Product Sum of Two Arrays",
        "acceptance": "89.0",
        "difficulty": "Medium",
        "displayText": "1874. Minimize Product Sum of Two Arrays"
    },
    "1875": {
        "id": "1875",
        "name": "Group Employees of the Same Salary",
        "acceptance": "66.6",
        "difficulty": "Medium",
        "displayText": "1875. Group Employees of the Same Salary"
    },
    "1876": {
        "id": "1876",
        "name": "Substrings of Size Three with Distinct Characters",
        "acceptance": "75.1",
        "difficulty": "Easy",
        "displayText": "1876. Substrings of Size Three with Distinct Characters"
    },
    "1877": {
        "id": "1877",
        "name": "Minimize Maximum Pair Sum in Array",
        "acceptance": "81.4",
        "difficulty": "Medium",
        "displayText": "1877. Minimize Maximum Pair Sum in Array"
    },
    "1878": {
        "id": "1878",
        "name": "Get Biggest Three Rhombus Sums in a Grid",
        "acceptance": "49.0",
        "difficulty": "Medium",
        "displayText": "1878. Get Biggest Three Rhombus Sums in a Grid"
    },
    "1879": {
        "id": "1879",
        "name": "Minimum XOR Sum of Two Arrays",
        "acceptance": "48.7",
        "difficulty": "Hard",
        "displayText": "1879. Minimum XOR Sum of Two Arrays"
    },
    "1880": {
        "id": "1880",
        "name": "Check if Word Equals Summation of Two Words",
        "acceptance": "74.6",
        "difficulty": "Easy",
        "displayText": "1880. Check if Word Equals Summation of Two Words"
    },
    "1881": {
        "id": "1881",
        "name": "Maximum Value after Insertion",
        "acceptance": "38.4",
        "difficulty": "Medium",
        "displayText": "1881. Maximum Value after Insertion"
    },
    "1882": {
        "id": "1882",
        "name": "Process Tasks Using Servers",
        "acceptance": "40.9",
        "difficulty": "Medium",
        "displayText": "1882. Process Tasks Using Servers"
    },
    "1883": {
        "id": "1883",
        "name": "Minimum Skips to Arrive at Meeting On Time",
        "acceptance": "38.1",
        "difficulty": "Hard",
        "displayText": "1883. Minimum Skips to Arrive at Meeting On Time"
    },
    "1884": {
        "id": "1884",
        "name": "Egg Drop With 2 Eggs and N Floors",
        "acceptance": "73.5",
        "difficulty": "Medium",
        "displayText": "1884. Egg Drop With 2 Eggs and N Floors"
    },
    "1885": {
        "id": "1885",
        "name": "Count Pairs in Two Arrays",
        "acceptance": "60.1",
        "difficulty": "Medium",
        "displayText": "1885. Count Pairs in Two Arrays"
    },
    "1886": {
        "id": "1886",
        "name": "Determine Whether Matrix Can Be Obtained By Rotation",
        "acceptance": "57.8",
        "difficulty": "Easy",
        "displayText": "1886. Determine Whether Matrix Can Be Obtained By Rotation"
    },
    "1887": {
        "id": "1887",
        "name": "Reduction Operations to Make the Array Elements Equal",
        "acceptance": "72.3",
        "difficulty": "Medium",
        "displayText": "1887. Reduction Operations to Make the Array Elements Equal"
    },
    "1888": {
        "id": "1888",
        "name": "Minimum Number of Flips to Make the Binary String Alternating",
        "acceptance": "40.4",
        "difficulty": "Medium",
        "displayText": "1888. Minimum Number of Flips to Make the Binary String Alternating"
    },
    "1889": {
        "id": "1889",
        "name": "Minimum Space Wasted From Packaging",
        "acceptance": "32.4",
        "difficulty": "Hard",
        "displayText": "1889. Minimum Space Wasted From Packaging"
    },
    "1890": {
        "id": "1890",
        "name": "The Latest Login in 2020",
        "acceptance": "77.4",
        "difficulty": "Easy",
        "displayText": "1890. The Latest Login in 2020"
    },
    "1891": {
        "id": "1891",
        "name": "Cutting Ribbons",
        "acceptance": "52.1",
        "difficulty": "Medium",
        "displayText": "1891. Cutting Ribbons"
    },
    "1892": {
        "id": "1892",
        "name": "Page Recommendations II",
        "acceptance": "44.4",
        "difficulty": "Hard",
        "displayText": "1892. Page Recommendations II"
    },
    "1893": {
        "id": "1893",
        "name": "Check if All the Integers in a Range Are Covered",
        "acceptance": "50.3",
        "difficulty": "Easy",
        "displayText": "1893. Check if All the Integers in a Range Are Covered"
    },
    "1894": {
        "id": "1894",
        "name": "Find the Student that Will Replace the Chalk",
        "acceptance": "53.2",
        "difficulty": "Medium",
        "displayText": "1894. Find the Student that Will Replace the Chalk"
    },
    "1895": {
        "id": "1895",
        "name": "Largest Magic Square",
        "acceptance": "52.3",
        "difficulty": "Medium",
        "displayText": "1895. Largest Magic Square"
    },
    "1896": {
        "id": "1896",
        "name": "Minimum Cost to Change the Final Value of Expression",
        "acceptance": "50.6",
        "difficulty": "Hard",
        "displayText": "1896. Minimum Cost to Change the Final Value of Expression"
    },
    "1897": {
        "id": "1897",
        "name": "Redistribute Characters to Make All Strings Equal",
        "acceptance": "66.8",
        "difficulty": "Easy",
        "displayText": "1897. Redistribute Characters to Make All Strings Equal"
    },
    "1898": {
        "id": "1898",
        "name": "Maximum Number of Removable Characters",
        "acceptance": "45.4",
        "difficulty": "Medium",
        "displayText": "1898. Maximum Number of Removable Characters"
    },
    "1899": {
        "id": "1899",
        "name": "Merge Triplets to Form Target Triplet",
        "acceptance": "67.3",
        "difficulty": "Medium",
        "displayText": "1899. Merge Triplets to Form Target Triplet"
    },
    "1900": {
        "id": "1900",
        "name": "The Earliest and Latest Rounds Where Players Compete",
        "acceptance": "47.8",
        "difficulty": "Hard",
        "displayText": "1900. The Earliest and Latest Rounds Where Players Compete"
    },
    "1901": {
        "id": "1901",
        "name": "Find a Peak Element II",
        "acceptance": "52.9",
        "difficulty": "Medium",
        "displayText": "1901. Find a Peak Element II"
    },
    "1902": {
        "id": "1902",
        "name": "Depth of BST Given Insertion Order",
        "acceptance": "42.4",
        "difficulty": "Medium",
        "displayText": "1902. Depth of BST Given Insertion Order"
    },
    "1903": {
        "id": "1903",
        "name": "Largest Odd Number in String",
        "acceptance": "64.7",
        "difficulty": "Easy",
        "displayText": "1903. Largest Odd Number in String"
    },
    "1904": {
        "id": "1904",
        "name": "The Number of Full Rounds You Have Played",
        "acceptance": "43.4",
        "difficulty": "Medium",
        "displayText": "1904. The Number of Full Rounds You Have Played"
    },
    "1905": {
        "id": "1905",
        "name": "Count Sub Islands",
        "acceptance": "72.8",
        "difficulty": "Medium",
        "displayText": "1905. Count Sub Islands"
    },
    "1906": {
        "id": "1906",
        "name": "Minimum Absolute Difference Queries",
        "acceptance": "44.6",
        "difficulty": "Medium",
        "displayText": "1906. Minimum Absolute Difference Queries"
    },
    "1907": {
        "id": "1907",
        "name": "Count Salary Categories",
        "acceptance": "61.9",
        "difficulty": "Medium",
        "displayText": "1907. Count Salary Categories"
    },
    "1908": {
        "id": "1908",
        "name": "Game of Nim",
        "acceptance": "62.9",
        "difficulty": "Medium",
        "displayText": "1908. Game of Nim"
    },
    "1909": {
        "id": "1909",
        "name": "Remove One Element to Make the Array Strictly Increasing",
        "acceptance": "28.5",
        "difficulty": "Easy",
        "displayText": "1909. Remove One Element to Make the Array Strictly Increasing"
    },
    "1910": {
        "id": "1910",
        "name": "Remove All Occurrences of a Substring",
        "acceptance": "78.0",
        "difficulty": "Medium",
        "displayText": "1910. Remove All Occurrences of a Substring"
    },
    "1911": {
        "id": "1911",
        "name": "Maximum Alternating Subsequence Sum",
        "acceptance": "58.7",
        "difficulty": "Medium",
        "displayText": "1911. Maximum Alternating Subsequence Sum"
    },
    "1912": {
        "id": "1912",
        "name": "Design Movie Rental System",
        "acceptance": "37.1",
        "difficulty": "Hard",
        "displayText": "1912. Design Movie Rental System"
    },
    "1913": {
        "id": "1913",
        "name": "Maximum Product Difference Between Two Pairs",
        "acceptance": "82.9",
        "difficulty": "Easy",
        "displayText": "1913. Maximum Product Difference Between Two Pairs"
    },
    "1914": {
        "id": "1914",
        "name": "Cyclically Rotating a Grid",
        "acceptance": "50.1",
        "difficulty": "Medium",
        "displayText": "1914. Cyclically Rotating a Grid"
    },
    "1915": {
        "id": "1915",
        "name": "Number of Wonderful Substrings",
        "acceptance": "66.7",
        "difficulty": "Medium",
        "displayText": "1915. Number of Wonderful Substrings"
    },
    "1916": {
        "id": "1916",
        "name": "Count Ways to Build Rooms in an Ant Colony",
        "acceptance": "48.2",
        "difficulty": "Hard",
        "displayText": "1916. Count Ways to Build Rooms in an Ant Colony"
    },
    "1917": {
        "id": "1917",
        "name": "Leetcodify Friends Recommendations",
        "acceptance": "27.8",
        "difficulty": "Hard",
        "displayText": "1917. Leetcodify Friends Recommendations"
    },
    "1918": {
        "id": "1918",
        "name": "Kth Smallest Subarray Sum",
        "acceptance": "52.8",
        "difficulty": "Medium",
        "displayText": "1918. Kth Smallest Subarray Sum"
    },
    "1919": {
        "id": "1919",
        "name": "Leetcodify Similar Friends",
        "acceptance": "42.5",
        "difficulty": "Hard",
        "displayText": "1919. Leetcodify Similar Friends"
    },
    "1920": {
        "id": "1920",
        "name": "Build Array from Permutation",
        "acceptance": "90.2",
        "difficulty": "Easy",
        "displayText": "1920. Build Array from Permutation"
    },
    "1921": {
        "id": "1921",
        "name": "Eliminate Maximum Number of Monsters",
        "acceptance": "50.8",
        "difficulty": "Medium",
        "displayText": "1921. Eliminate Maximum Number of Monsters"
    },
    "1922": {
        "id": "1922",
        "name": "Count Good Numbers",
        "acceptance": "56.4",
        "difficulty": "Medium",
        "displayText": "1922. Count Good Numbers"
    },
    "1923": {
        "id": "1923",
        "name": "Longest Common Subpath",
        "acceptance": "27.9",
        "difficulty": "Hard",
        "displayText": "1923. Longest Common Subpath"
    },
    "1924": {
        "id": "1924",
        "name": "Erect the Fence II",
        "acceptance": "49.5",
        "difficulty": "Hard",
        "displayText": "1924. Erect the Fence II"
    },
    "1925": {
        "id": "1925",
        "name": "Count Square Sum Triples",
        "acceptance": "68.7",
        "difficulty": "Easy",
        "displayText": "1925. Count Square Sum Triples"
    },
    "1926": {
        "id": "1926",
        "name": "Nearest Exit from Entrance in Maze",
        "acceptance": "47.3",
        "difficulty": "Medium",
        "displayText": "1926. Nearest Exit from Entrance in Maze"
    },
    "1927": {
        "id": "1927",
        "name": "Sum Game",
        "acceptance": "48.1",
        "difficulty": "Medium",
        "displayText": "1927. Sum Game"
    },
    "1928": {
        "id": "1928",
        "name": "Minimum Cost to Reach Destination in Time",
        "acceptance": "39.3",
        "difficulty": "Hard",
        "displayText": "1928. Minimum Cost to Reach Destination in Time"
    },
    "1929": {
        "id": "1929",
        "name": "Concatenation of Array",
        "acceptance": "90.4",
        "difficulty": "Easy",
        "displayText": "1929. Concatenation of Array"
    },
    "1930": {
        "id": "1930",
        "name": "Unique Length-3 Palindromic Subsequences",
        "acceptance": "70.9",
        "difficulty": "Medium",
        "displayText": "1930. Unique Length-3 Palindromic Subsequences"
    },
    "1931": {
        "id": "1931",
        "name": "Painting a Grid With Three Different Colors",
        "acceptance": "56.8",
        "difficulty": "Hard",
        "displayText": "1931. Painting a Grid With Three Different Colors"
    },
    "1932": {
        "id": "1932",
        "name": "Merge BSTs to Create Single BST",
        "acceptance": "39.2",
        "difficulty": "Hard",
        "displayText": "1932. Merge BSTs to Create Single BST"
    },
    "1933": {
        "id": "1933",
        "name": "Check if String Is Decomposable Into Value-Equal Substrings",
        "acceptance": "50.7",
        "difficulty": "Easy",
        "displayText": "1933. Check if String Is Decomposable Into Value-Equal Substrings"
    },
    "1934": {
        "id": "1934",
        "name": "Confirmation Rate",
        "acceptance": "60.8",
        "difficulty": "Medium",
        "displayText": "1934. Confirmation Rate"
    },
    "1935": {
        "id": "1935",
        "name": "Maximum Number of Words You Can Type",
        "acceptance": "74.5",
        "difficulty": "Easy",
        "displayText": "1935. Maximum Number of Words You Can Type"
    },
    "1936": {
        "id": "1936",
        "name": "Add Minimum Number of Rungs",
        "acceptance": "43.2",
        "difficulty": "Medium",
        "displayText": "1936. Add Minimum Number of Rungs"
    },
    "1937": {
        "id": "1937",
        "name": "Maximum Number of Points with Cost",
        "acceptance": "42.4",
        "difficulty": "Medium",
        "displayText": "1937. Maximum Number of Points with Cost"
    },
    "1938": {
        "id": "1938",
        "name": "Maximum Genetic Difference Query",
        "acceptance": "43.8",
        "difficulty": "Hard",
        "displayText": "1938. Maximum Genetic Difference Query"
    },
    "1939": {
        "id": "1939",
        "name": "Users That Actively Request Confirmation Messages",
        "acceptance": "56.6",
        "difficulty": "Easy",
        "displayText": "1939. Users That Actively Request Confirmation Messages"
    },
    "1940": {
        "id": "1940",
        "name": "Longest Common Subsequence Between Sorted Arrays",
        "acceptance": "81.3",
        "difficulty": "Medium",
        "displayText": "1940. Longest Common Subsequence Between Sorted Arrays"
    },
    "1941": {
        "id": "1941",
        "name": "Check if All Characters Have Equal Number of Occurrences",
        "acceptance": "78.5",
        "difficulty": "Easy",
        "displayText": "1941. Check if All Characters Have Equal Number of Occurrences"
    },
    "1942": {
        "id": "1942",
        "name": "The Number of the Smallest Unoccupied Chair",
        "acceptance": "60.5",
        "difficulty": "Medium",
        "displayText": "1942. The Number of the Smallest Unoccupied Chair"
    },
    "1943": {
        "id": "1943",
        "name": "Describe the Painting",
        "acceptance": "50.8",
        "difficulty": "Medium",
        "displayText": "1943. Describe the Painting"
    },
    "1944": {
        "id": "1944",
        "name": "Number of Visible People in a Queue",
        "acceptance": "70.8",
        "difficulty": "Hard",
        "displayText": "1944. Number of Visible People in a Queue"
    },
    "1945": {
        "id": "1945",
        "name": "Sum of Digits of String After Convert",
        "acceptance": "74.7",
        "difficulty": "Easy",
        "displayText": "1945. Sum of Digits of String After Convert"
    },
    "1946": {
        "id": "1946",
        "name": "Largest Number After Mutating Substring",
        "acceptance": "36.6",
        "difficulty": "Medium",
        "displayText": "1946. Largest Number After Mutating Substring"
    },
    "1947": {
        "id": "1947",
        "name": "Maximum Compatibility Score Sum",
        "acceptance": "63.0",
        "difficulty": "Medium",
        "displayText": "1947. Maximum Compatibility Score Sum"
    },
    "1948": {
        "id": "1948",
        "name": "Delete Duplicate Folders in System",
        "acceptance": "53.5",
        "difficulty": "Hard",
        "displayText": "1948. Delete Duplicate Folders in System"
    },
    "1949": {
        "id": "1949",
        "name": "Strong Friendship",
        "acceptance": "54.5",
        "difficulty": "Medium",
        "displayText": "1949. Strong Friendship"
    },
    "1950": {
        "id": "1950",
        "name": "Maximum of Minimum Values in All Subarrays",
        "acceptance": "47.9",
        "difficulty": "Medium",
        "displayText": "1950. Maximum of Minimum Values in All Subarrays"
    },
    "1951": {
        "id": "1951",
        "name": "All the Pairs With the Maximum Number of Common Followers",
        "acceptance": "69.2",
        "difficulty": "Medium",
        "displayText": "1951. All the Pairs With the Maximum Number of Common Followers"
    },
    "1952": {
        "id": "1952",
        "name": "Three Divisors",
        "acceptance": "62.3",
        "difficulty": "Easy",
        "displayText": "1952. Three Divisors"
    },
    "1953": {
        "id": "1953",
        "name": "Maximum Number of Weeks for Which You Can Work",
        "acceptance": "41.1",
        "difficulty": "Medium",
        "displayText": "1953. Maximum Number of Weeks for Which You Can Work"
    },
    "1954": {
        "id": "1954",
        "name": "Minimum Garden Perimeter to Collect Enough Apples",
        "acceptance": "54.2",
        "difficulty": "Medium",
        "displayText": "1954. Minimum Garden Perimeter to Collect Enough Apples"
    },
    "1955": {
        "id": "1955",
        "name": "Count Number of Special Subsequences",
        "acceptance": "51.6",
        "difficulty": "Hard",
        "displayText": "1955. Count Number of Special Subsequences"
    },
    "1956": {
        "id": "1956",
        "name": "Minimum Time For K Virus Variants to Spread",
        "acceptance": "49.0",
        "difficulty": "Hard",
        "displayText": "1956. Minimum Time For K Virus Variants to Spread"
    },
    "1957": {
        "id": "1957",
        "name": "Delete Characters to Make Fancy String",
        "acceptance": "71.6",
        "difficulty": "Easy",
        "displayText": "1957. Delete Characters to Make Fancy String"
    },
    "1958": {
        "id": "1958",
        "name": "Check if Move is Legal",
        "acceptance": "49.1",
        "difficulty": "Medium",
        "displayText": "1958. Check if Move is Legal"
    },
    "1959": {
        "id": "1959",
        "name": "Minimum Total Space Wasted With K Resizing Operations",
        "acceptance": "42.7",
        "difficulty": "Medium",
        "displayText": "1959. Minimum Total Space Wasted With K Resizing Operations"
    },
    "1960": {
        "id": "1960",
        "name": "Maximum Product of the Length of Two Palindromic Substrings",
        "acceptance": "30.4",
        "difficulty": "Hard",
        "displayText": "1960. Maximum Product of the Length of Two Palindromic Substrings"
    },
    "1961": {
        "id": "1961",
        "name": "Check If String Is a Prefix of Array",
        "acceptance": "52.4",
        "difficulty": "Easy",
        "displayText": "1961. Check If String Is a Prefix of Array"
    },
    "1962": {
        "id": "1962",
        "name": "Remove Stones to Minimize the Total",
        "acceptance": "64.4",
        "difficulty": "Medium",
        "displayText": "1962. Remove Stones to Minimize the Total"
    },
    "1963": {
        "id": "1963",
        "name": "Minimum Number of Swaps to Make the String Balanced",
        "acceptance": "77.9",
        "difficulty": "Medium",
        "displayText": "1963. Minimum Number of Swaps to Make the String Balanced"
    },
    "1964": {
        "id": "1964",
        "name": "Find the Longest Valid Obstacle Course at Each Position",
        "acceptance": "62.5",
        "difficulty": "Hard",
        "displayText": "1964. Find the Longest Valid Obstacle Course at Each Position"
    },
    "1965": {
        "id": "1965",
        "name": "Employees With Missing Information",
        "acceptance": "72.8",
        "difficulty": "Easy",
        "displayText": "1965. Employees With Missing Information"
    },
    "1966": {
        "id": "1966",
        "name": "Binary Searchable Numbers in an Unsorted Array",
        "acceptance": "62.4",
        "difficulty": "Medium",
        "displayText": "1966. Binary Searchable Numbers in an Unsorted Array"
    },
    "1967": {
        "id": "1967",
        "name": "Number of Strings That Appear as Substrings in Word",
        "acceptance": "81.7",
        "difficulty": "Easy",
        "displayText": "1967. Number of Strings That Appear as Substrings in Word"
    },
    "1968": {
        "id": "1968",
        "name": "Array With Elements Not Equal to Average of Neighbors",
        "acceptance": "50.0",
        "difficulty": "Medium",
        "displayText": "1968. Array With Elements Not Equal to Average of Neighbors"
    },
    "1969": {
        "id": "1969",
        "name": "Minimum Non-Zero Product of the Array Elements",
        "acceptance": "36.2",
        "difficulty": "Medium",
        "displayText": "1969. Minimum Non-Zero Product of the Array Elements"
    },
    "1970": {
        "id": "1970",
        "name": "Last Day Where You Can Still Cross",
        "acceptance": "62.1",
        "difficulty": "Hard",
        "displayText": "1970. Last Day Where You Can Still Cross"
    },
    "1971": {
        "id": "1971",
        "name": "Find if Path Exists in Graph",
        "acceptance": "53.9",
        "difficulty": "Easy",
        "displayText": "1971. Find if Path Exists in Graph"
    },
    "1972": {
        "id": "1972",
        "name": "First and Last Call On the Same Day",
        "acceptance": "51.0",
        "difficulty": "Hard",
        "displayText": "1972. First and Last Call On the Same Day"
    },
    "1973": {
        "id": "1973",
        "name": "Count Nodes Equal to Sum of Descendants",
        "acceptance": "77.0",
        "difficulty": "Medium",
        "displayText": "1973. Count Nodes Equal to Sum of Descendants"
    },
    "1974": {
        "id": "1974",
        "name": "Minimum Time to Type Word Using Special Typewriter",
        "acceptance": "77.1",
        "difficulty": "Easy",
        "displayText": "1974. Minimum Time to Type Word Using Special Typewriter"
    },
    "1975": {
        "id": "1975",
        "name": "Maximum Matrix Sum",
        "acceptance": "66.0",
        "difficulty": "Medium",
        "displayText": "1975. Maximum Matrix Sum"
    },
    "1976": {
        "id": "1976",
        "name": "Number of Ways to Arrive at Destination",
        "acceptance": "37.8",
        "difficulty": "Medium",
        "displayText": "1976. Number of Ways to Arrive at Destination"
    },
    "1977": {
        "id": "1977",
        "name": "Number of Ways to Separate Numbers",
        "acceptance": "20.9",
        "difficulty": "Hard",
        "displayText": "1977. Number of Ways to Separate Numbers"
    },
    "1978": {
        "id": "1978",
        "name": "Employees Whose Manager Left the Company",
        "acceptance": "48.8",
        "difficulty": "Easy",
        "displayText": "1978. Employees Whose Manager Left the Company"
    },
    "1979": {
        "id": "1979",
        "name": "Find Greatest Common Divisor of Array",
        "acceptance": "78.4",
        "difficulty": "Easy",
        "displayText": "1979. Find Greatest Common Divisor of Array"
    },
    "1980": {
        "id": "1980",
        "name": "Find Unique Binary String",
        "acceptance": "79.4",
        "difficulty": "Medium",
        "displayText": "1980. Find Unique Binary String"
    },
    "1981": {
        "id": "1981",
        "name": "Minimize the Difference Between Target and Chosen Elements",
        "acceptance": "35.7",
        "difficulty": "Medium",
        "displayText": "1981. Minimize the Difference Between Target and Chosen Elements"
    },
    "1982": {
        "id": "1982",
        "name": "Find Array Given Subset Sums",
        "acceptance": "48.5",
        "difficulty": "Hard",
        "displayText": "1982. Find Array Given Subset Sums"
    },
    "1983": {
        "id": "1983",
        "name": "Widest Pair of Indices With Equal Range Sum",
        "acceptance": "53.0",
        "difficulty": "Medium",
        "displayText": "1983. Widest Pair of Indices With Equal Range Sum"
    },
    "1984": {
        "id": "1984",
        "name": "Minimum Difference Between Highest and Lowest of K Scores",
        "acceptance": "58.2",
        "difficulty": "Easy",
        "displayText": "1984. Minimum Difference Between Highest and Lowest of K Scores"
    },
    "1985": {
        "id": "1985",
        "name": "Find the Kth Largest Integer in the Array",
        "acceptance": "46.6",
        "difficulty": "Medium",
        "displayText": "1985. Find the Kth Largest Integer in the Array"
    },
    "1986": {
        "id": "1986",
        "name": "Minimum Number of Work Sessions to Finish the Tasks",
        "acceptance": "33.5",
        "difficulty": "Medium",
        "displayText": "1986. Minimum Number of Work Sessions to Finish the Tasks"
    },
    "1987": {
        "id": "1987",
        "name": "Number of Unique Good Subsequences",
        "acceptance": "52.0",
        "difficulty": "Hard",
        "displayText": "1987. Number of Unique Good Subsequences"
    },
    "1988": {
        "id": "1988",
        "name": "Find Cutoff Score for Each School",
        "acceptance": "66.9",
        "difficulty": "Medium",
        "displayText": "1988. Find Cutoff Score for Each School"
    },
    "1989": {
        "id": "1989",
        "name": "Maximum Number of People That Can Be Caught in Tag",
        "acceptance": "49.7",
        "difficulty": "Medium",
        "displayText": "1989. Maximum Number of People That Can Be Caught in Tag"
    },
    "1990": {
        "id": "1990",
        "name": "Count the Number of Experiments",
        "acceptance": "49.1",
        "difficulty": "Medium",
        "displayText": "1990. Count the Number of Experiments"
    },
    "1991": {
        "id": "1991",
        "name": "Find the Middle Index in Array",
        "acceptance": "67.9",
        "difficulty": "Easy",
        "displayText": "1991. Find the Middle Index in Array"
    },
    "1992": {
        "id": "1992",
        "name": "Find All Groups of Farmland",
        "acceptance": "75.5",
        "difficulty": "Medium",
        "displayText": "1992. Find All Groups of Farmland"
    },
    "1993": {
        "id": "1993",
        "name": "Operations on Tree",
        "acceptance": "47.1",
        "difficulty": "Medium",
        "displayText": "1993. Operations on Tree"
    },
    "1994": {
        "id": "1994",
        "name": "The Number of Good Subsets",
        "acceptance": "35.7",
        "difficulty": "Hard",
        "displayText": "1994. The Number of Good Subsets"
    },
    "1995": {
        "id": "1995",
        "name": "Count Special Quadruplets",
        "acceptance": "62.9",
        "difficulty": "Easy",
        "displayText": "1995. Count Special Quadruplets"
    },
    "1996": {
        "id": "1996",
        "name": "The Number of Weak Characters in the Game",
        "acceptance": "44.1",
        "difficulty": "Medium",
        "displayText": "1996. The Number of Weak Characters in the Game"
    },
    "1997": {
        "id": "1997",
        "name": "First Day Where You Have Been in All the Rooms",
        "acceptance": "39.4",
        "difficulty": "Medium",
        "displayText": "1997. First Day Where You Have Been in All the Rooms"
    },
    "1998": {
        "id": "1998",
        "name": "GCD Sort of an Array",
        "acceptance": "46.2",
        "difficulty": "Hard",
        "displayText": "1998. GCD Sort of an Array"
    },
    "1999": {
        "id": "1999",
        "name": "Smallest Greater Multiple Made of Two Digits",
        "acceptance": "47.9",
        "difficulty": "Medium",
        "displayText": "1999. Smallest Greater Multiple Made of Two Digits"
    },
    "2000": {
        "id": "2000",
        "name": "Reverse Prefix of Word",
        "acceptance": "86.4",
        "difficulty": "Easy",
        "displayText": "2000. Reverse Prefix of Word"
    },
    "2001": {
        "id": "2001",
        "name": "Number of Pairs of Interchangeable Rectangles",
        "acceptance": "51.4",
        "difficulty": "Medium",
        "displayText": "2001. Number of Pairs of Interchangeable Rectangles"
    },
    "2002": {
        "id": "2002",
        "name": "Maximum Product of the Length of Two Palindromic Subsequences",
        "acceptance": "61.1",
        "difficulty": "Medium",
        "displayText": "2002. Maximum Product of the Length of Two Palindromic Subsequences"
    },
    "2003": {
        "id": "2003",
        "name": "Smallest Missing Genetic Value in Each Subtree",
        "acceptance": "46.3",
        "difficulty": "Hard",
        "displayText": "2003. Smallest Missing Genetic Value in Each Subtree"
    },
    "2004": {
        "id": "2004",
        "name": "The Number of Seniors and Juniors to Join the Company",
        "acceptance": "44.9",
        "difficulty": "Hard",
        "displayText": "2004. The Number of Seniors and Juniors to Join the Company"
    },
    "2005": {
        "id": "2005",
        "name": "Subtree Removal Game with Fibonacci Tree",
        "acceptance": "57.1",
        "difficulty": "Hard",
        "displayText": "2005. Subtree Removal Game with Fibonacci Tree"
    },
    "2006": {
        "id": "2006",
        "name": "Count Number of Pairs With Absolute Difference K",
        "acceptance": "84.6",
        "difficulty": "Easy",
        "displayText": "2006. Count Number of Pairs With Absolute Difference K"
    },
    "2007": {
        "id": "2007",
        "name": "Find Original Array From Doubled Array",
        "acceptance": "40.4",
        "difficulty": "Medium",
        "displayText": "2007. Find Original Array From Doubled Array"
    },
    "2008": {
        "id": "2008",
        "name": "Maximum Earnings From Taxi",
        "acceptance": "44.6",
        "difficulty": "Medium",
        "displayText": "2008. Maximum Earnings From Taxi"
    },
    "2009": {
        "id": "2009",
        "name": "Minimum Number of Operations to Make Array Continuous",
        "acceptance": "52.2",
        "difficulty": "Hard",
        "displayText": "2009. Minimum Number of Operations to Make Array Continuous"
    },
    "2010": {
        "id": "2010",
        "name": "The Number of Seniors and Juniors to Join the Company II",
        "acceptance": "64.3",
        "difficulty": "Hard",
        "displayText": "2010. The Number of Seniors and Juniors to Join the Company II"
    },
    "2011": {
        "id": "2011",
        "name": "Final Value of Variable After Performing Operations",
        "acceptance": "89.5",
        "difficulty": "Easy",
        "displayText": "2011. Final Value of Variable After Performing Operations"
    },
    "2012": {
        "id": "2012",
        "name": "Sum of Beauty in the Array",
        "acceptance": "49.9",
        "difficulty": "Medium",
        "displayText": "2012. Sum of Beauty in the Array"
    },
    "2013": {
        "id": "2013",
        "name": "Detect Squares",
        "acceptance": "52.0",
        "difficulty": "Medium",
        "displayText": "2013. Detect Squares"
    },
    "2014": {
        "id": "2014",
        "name": "Longest Subsequence Repeated k Times",
        "acceptance": "53.9",
        "difficulty": "Hard",
        "displayText": "2014. Longest Subsequence Repeated k Times"
    },
    "2015": {
        "id": "2015",
        "name": "Average Height of Buildings in Each Segment",
        "acceptance": "57.3",
        "difficulty": "Medium",
        "displayText": "2015. Average Height of Buildings in Each Segment"
    },
    "2016": {
        "id": "2016",
        "name": "Maximum Difference Between Increasing Elements",
        "acceptance": "58.9",
        "difficulty": "Easy",
        "displayText": "2016. Maximum Difference Between Increasing Elements"
    },
    "2017": {
        "id": "2017",
        "name": "Grid Game",
        "acceptance": "61.0",
        "difficulty": "Medium",
        "displayText": "2017. Grid Game"
    },
    "2018": {
        "id": "2018",
        "name": "Check if Word Can Be Placed In Crossword",
        "acceptance": "49.9",
        "difficulty": "Medium",
        "displayText": "2018. Check if Word Can Be Placed In Crossword"
    },
    "2019": {
        "id": "2019",
        "name": "The Score of Students Solving Math Expression",
        "acceptance": "33.0",
        "difficulty": "Hard",
        "displayText": "2019. The Score of Students Solving Math Expression"
    },
    "2020": {
        "id": "2020",
        "name": "Number of Accounts That Did Not Stream",
        "acceptance": "72.3",
        "difficulty": "Medium",
        "displayText": "2020. Number of Accounts That Did Not Stream"
    },
    "2021": {
        "id": "2021",
        "name": "Brightest Position on Street",
        "acceptance": "60.9",
        "difficulty": "Medium",
        "displayText": "2021. Brightest Position on Street"
    },
    "2022": {
        "id": "2022",
        "name": "Convert 1D Array Into 2D Array",
        "acceptance": "71.7",
        "difficulty": "Easy",
        "displayText": "2022. Convert 1D Array Into 2D Array"
    },
    "2023": {
        "id": "2023",
        "name": "Number of Pairs of Strings With Concatenation Equal to Target",
        "acceptance": "74.8",
        "difficulty": "Medium",
        "displayText": "2023. Number of Pairs of Strings With Concatenation Equal to Target"
    },
    "2024": {
        "id": "2024",
        "name": "Maximize the Confusion of an Exam",
        "acceptance": "68.3",
        "difficulty": "Medium",
        "displayText": "2024. Maximize the Confusion of an Exam"
    },
    "2025": {
        "id": "2025",
        "name": "Maximum Number of Ways to Partition an Array",
        "acceptance": "34.5",
        "difficulty": "Hard",
        "displayText": "2025. Maximum Number of Ways to Partition an Array"
    },
    "2026": {
        "id": "2026",
        "name": "Low-Quality Problems",
        "acceptance": "84.6",
        "difficulty": "Easy",
        "displayText": "2026. Low-Quality Problems"
    },
    "2027": {
        "id": "2027",
        "name": "Minimum Moves to Convert String",
        "acceptance": "56.2",
        "difficulty": "Easy",
        "displayText": "2027. Minimum Moves to Convert String"
    },
    "2028": {
        "id": "2028",
        "name": "Find Missing Observations",
        "acceptance": "57.4",
        "difficulty": "Medium",
        "displayText": "2028. Find Missing Observations"
    },
    "2029": {
        "id": "2029",
        "name": "Stone Game IX",
        "acceptance": "28.7",
        "difficulty": "Medium",
        "displayText": "2029. Stone Game IX"
    },
    "2030": {
        "id": "2030",
        "name": "Smallest K-Length Subsequence With Occurrences of a Letter",
        "acceptance": "38.7",
        "difficulty": "Hard",
        "displayText": "2030. Smallest K-Length Subsequence With Occurrences of a Letter"
    },
    "2031": {
        "id": "2031",
        "name": "Count Subarrays With More Ones Than Zeros",
        "acceptance": "51.2",
        "difficulty": "Medium",
        "displayText": "2031. Count Subarrays With More Ones Than Zeros"
    },
    "2032": {
        "id": "2032",
        "name": "Two Out of Three",
        "acceptance": "76.3",
        "difficulty": "Easy",
        "displayText": "2032. Two Out of Three"
    },
    "2033": {
        "id": "2033",
        "name": "Minimum Operations to Make a Uni-Value Grid",
        "acceptance": "67.4",
        "difficulty": "Medium",
        "displayText": "2033. Minimum Operations to Make a Uni-Value Grid"
    },
    "2034": {
        "id": "2034",
        "name": "Stock Price Fluctuation",
        "acceptance": "48.8",
        "difficulty": "Medium",
        "displayText": "2034. Stock Price Fluctuation"
    },
    "2035": {
        "id": "2035",
        "name": "Partition Array Into Two Arrays to Minimize Sum Difference",
        "acceptance": "21.4",
        "difficulty": "Hard",
        "displayText": "2035. Partition Array Into Two Arrays to Minimize Sum Difference"
    },
    "2036": {
        "id": "2036",
        "name": "Maximum Alternating Subarray Sum",
        "acceptance": "39.6",
        "difficulty": "Medium",
        "displayText": "2036. Maximum Alternating Subarray Sum"
    },
    "2037": {
        "id": "2037",
        "name": "Minimum Number of Moves to Seat Everyone",
        "acceptance": "87.3",
        "difficulty": "Easy",
        "displayText": "2037. Minimum Number of Moves to Seat Everyone"
    },
    "2038": {
        "id": "2038",
        "name": "Remove Colored Pieces if Both Neighbors are the Same Color",
        "acceptance": "62.8",
        "difficulty": "Medium",
        "displayText": "2038. Remove Colored Pieces if Both Neighbors are the Same Color"
    },
    "2039": {
        "id": "2039",
        "name": "The Time When the Network Becomes Idle",
        "acceptance": "53.3",
        "difficulty": "Medium",
        "displayText": "2039. The Time When the Network Becomes Idle"
    },
    "2040": {
        "id": "2040",
        "name": "Kth Smallest Product of Two Sorted Arrays",
        "acceptance": "30.4",
        "difficulty": "Hard",
        "displayText": "2040. Kth Smallest Product of Two Sorted Arrays"
    },
    "2041": {
        "id": "2041",
        "name": "Accepted Candidates From the Interviews",
        "acceptance": "78.7",
        "difficulty": "Medium",
        "displayText": "2041. Accepted Candidates From the Interviews"
    },
    "2042": {
        "id": "2042",
        "name": "Check if Numbers Are Ascending in a Sentence",
        "acceptance": "71.4",
        "difficulty": "Easy",
        "displayText": "2042. Check if Numbers Are Ascending in a Sentence"
    },
    "2043": {
        "id": "2043",
        "name": "Simple Bank System",
        "acceptance": "63.4",
        "difficulty": "Medium",
        "displayText": "2043. Simple Bank System"
    },
    "2044": {
        "id": "2044",
        "name": "Count Number of Maximum Bitwise-OR Subsets",
        "acceptance": "87.9",
        "difficulty": "Medium",
        "displayText": "2044. Count Number of Maximum Bitwise-OR Subsets"
    },
    "2045": {
        "id": "2045",
        "name": "Second Minimum Time to Reach Destination",
        "acceptance": "62.6",
        "difficulty": "Hard",
        "displayText": "2045. Second Minimum Time to Reach Destination"
    },
    "2046": {
        "id": "2046",
        "name": "Sort Linked List Already Sorted Using Absolute Values",
        "acceptance": "66.9",
        "difficulty": "Medium",
        "displayText": "2046. Sort Linked List Already Sorted Using Absolute Values"
    },
    "2047": {
        "id": "2047",
        "name": "Number of Valid Words in a Sentence",
        "acceptance": "29.8",
        "difficulty": "Easy",
        "displayText": "2047. Number of Valid Words in a Sentence"
    },
    "2048": {
        "id": "2048",
        "name": "Next Greater Numerically Balanced Number",
        "acceptance": "48.9",
        "difficulty": "Medium",
        "displayText": "2048. Next Greater Numerically Balanced Number"
    },
    "2049": {
        "id": "2049",
        "name": "Count Nodes With the Highest Score",
        "acceptance": "50.9",
        "difficulty": "Medium",
        "displayText": "2049. Count Nodes With the Highest Score"
    },
    "2050": {
        "id": "2050",
        "name": "Parallel Courses III",
        "acceptance": "66.7",
        "difficulty": "Hard",
        "displayText": "2050. Parallel Courses III"
    },
    "2051": {
        "id": "2051",
        "name": "The Category of Each Member in the Store",
        "acceptance": "70.6",
        "difficulty": "Medium",
        "displayText": "2051. The Category of Each Member in the Store"
    },
    "2052": {
        "id": "2052",
        "name": "Minimum Cost to Separate Sentence Into Rows",
        "acceptance": "50.3",
        "difficulty": "Medium",
        "displayText": "2052. Minimum Cost to Separate Sentence Into Rows"
    },
    "2053": {
        "id": "2053",
        "name": "Kth Distinct String in an Array",
        "acceptance": "82.0",
        "difficulty": "Easy",
        "displayText": "2053. Kth Distinct String in an Array"
    },
    "2054": {
        "id": "2054",
        "name": "Two Best Non-Overlapping Events",
        "acceptance": "61.1",
        "difficulty": "Medium",
        "displayText": "2054. Two Best Non-Overlapping Events"
    },
    "2055": {
        "id": "2055",
        "name": "Plates Between Candles",
        "acceptance": "46.4",
        "difficulty": "Medium",
        "displayText": "2055. Plates Between Candles"
    },
    "2056": {
        "id": "2056",
        "name": "Number of Valid Move Combinations On Chessboard",
        "acceptance": "47.5",
        "difficulty": "Hard",
        "displayText": "2056. Number of Valid Move Combinations On Chessboard"
    },
    "2057": {
        "id": "2057",
        "name": "Smallest Index With Equal Value",
        "acceptance": "72.4",
        "difficulty": "Easy",
        "displayText": "2057. Smallest Index With Equal Value"
    },
    "2058": {
        "id": "2058",
        "name": "Find the Minimum and Maximum Number of Nodes Between Critical Points",
        "acceptance": "69.4",
        "difficulty": "Medium",
        "displayText": "2058. Find the Minimum and Maximum Number of Nodes Between Critical Points"
    },
    "2059": {
        "id": "2059",
        "name": "Minimum Operations to Convert Number",
        "acceptance": "50.3",
        "difficulty": "Medium",
        "displayText": "2059. Minimum Operations to Convert Number"
    },
    "2060": {
        "id": "2060",
        "name": "Check if an Original String Exists Given Two Encoded Strings",
        "acceptance": "43.0",
        "difficulty": "Hard",
        "displayText": "2060. Check if an Original String Exists Given Two Encoded Strings"
    },
    "2061": {
        "id": "2061",
        "name": "Number of Spaces Cleaning Robot Cleaned",
        "acceptance": "61.9",
        "difficulty": "Medium",
        "displayText": "2061. Number of Spaces Cleaning Robot Cleaned"
    },
    "2062": {
        "id": "2062",
        "name": "Count Vowel Substrings of a String",
        "acceptance": "70.7",
        "difficulty": "Easy",
        "displayText": "2062. Count Vowel Substrings of a String"
    },
    "2063": {
        "id": "2063",
        "name": "Vowels of All Substrings",
        "acceptance": "54.6",
        "difficulty": "Medium",
        "displayText": "2063. Vowels of All Substrings"
    },
    "2064": {
        "id": "2064",
        "name": "Minimized Maximum of Products Distributed to Any Store",
        "acceptance": "62.5",
        "difficulty": "Medium",
        "displayText": "2064. Minimized Maximum of Products Distributed to Any Store"
    },
    "2065": {
        "id": "2065",
        "name": "Maximum Path Quality of a Graph",
        "acceptance": "59.4",
        "difficulty": "Hard",
        "displayText": "2065. Maximum Path Quality of a Graph"
    },
    "2066": {
        "id": "2066",
        "name": "Account Balance",
        "acceptance": "82.3",
        "difficulty": "Medium",
        "displayText": "2066. Account Balance"
    },
    "2067": {
        "id": "2067",
        "name": "Number of Equal Count Substrings",
        "acceptance": "44.6",
        "difficulty": "Medium",
        "displayText": "2067. Number of Equal Count Substrings"
    },
    "2068": {
        "id": "2068",
        "name": "Check Whether Two Strings are Almost Equivalent",
        "acceptance": "63.6",
        "difficulty": "Easy",
        "displayText": "2068. Check Whether Two Strings are Almost Equivalent"
    },
    "2069": {
        "id": "2069",
        "name": "Walking Robot Simulation II",
        "acceptance": "26.7",
        "difficulty": "Medium",
        "displayText": "2069. Walking Robot Simulation II"
    },
    "2070": {
        "id": "2070",
        "name": "Most Beautiful Item for Each Query",
        "acceptance": "62.0",
        "difficulty": "Medium",
        "displayText": "2070. Most Beautiful Item for Each Query"
    },
    "2071": {
        "id": "2071",
        "name": "Maximum Number of Tasks You Can Assign",
        "acceptance": "34.6",
        "difficulty": "Hard",
        "displayText": "2071. Maximum Number of Tasks You Can Assign"
    },
    "2072": {
        "id": "2072",
        "name": "The Winner University",
        "acceptance": "75.3",
        "difficulty": "Easy",
        "displayText": "2072. The Winner University"
    },
    "2073": {
        "id": "2073",
        "name": "Time Needed to Buy Tickets",
        "acceptance": "70.5",
        "difficulty": "Easy",
        "displayText": "2073. Time Needed to Buy Tickets"
    },
    "2074": {
        "id": "2074",
        "name": "Reverse Nodes in Even Length Groups",
        "acceptance": "60.3",
        "difficulty": "Medium",
        "displayText": "2074. Reverse Nodes in Even Length Groups"
    },
    "2075": {
        "id": "2075",
        "name": "Decode the Slanted Ciphertext",
        "acceptance": "49.0",
        "difficulty": "Medium",
        "displayText": "2075. Decode the Slanted Ciphertext"
    },
    "2076": {
        "id": "2076",
        "name": "Process Restricted Friend Requests",
        "acceptance": "56.7",
        "difficulty": "Hard",
        "displayText": "2076. Process Restricted Friend Requests"
    },
    "2077": {
        "id": "2077",
        "name": "Paths in Maze That Lead to Same Room",
        "acceptance": "55.9",
        "difficulty": "Medium",
        "displayText": "2077. Paths in Maze That Lead to Same Room"
    },
    "2078": {
        "id": "2078",
        "name": "Two Furthest Houses With Different Colors",
        "acceptance": "65.5",
        "difficulty": "Easy",
        "displayText": "2078. Two Furthest Houses With Different Colors"
    },
    "2079": {
        "id": "2079",
        "name": "Watering Plants",
        "acceptance": "79.9",
        "difficulty": "Medium",
        "displayText": "2079. Watering Plants"
    },
    "2080": {
        "id": "2080",
        "name": "Range Frequency Queries",
        "acceptance": "41.5",
        "difficulty": "Medium",
        "displayText": "2080. Range Frequency Queries"
    },
    "2081": {
        "id": "2081",
        "name": "Sum of k-Mirror Numbers",
        "acceptance": "41.4",
        "difficulty": "Hard",
        "displayText": "2081. Sum of k-Mirror Numbers"
    },
    "2082": {
        "id": "2082",
        "name": "The Number of Rich Customers",
        "acceptance": "77.5",
        "difficulty": "Easy",
        "displayText": "2082. The Number of Rich Customers"
    },
    "2083": {
        "id": "2083",
        "name": "Substrings That Begin and End With the Same Letter",
        "acceptance": "74.2",
        "difficulty": "Medium",
        "displayText": "2083. Substrings That Begin and End With the Same Letter"
    },
    "2084": {
        "id": "2084",
        "name": "Drop Type 1 Orders for Customers With Type 0 Orders",
        "acceptance": "87.2",
        "difficulty": "Medium",
        "displayText": "2084. Drop Type 1 Orders for Customers With Type 0 Orders"
    },
    "2085": {
        "id": "2085",
        "name": "Count Common Words With One Occurrence",
        "acceptance": "72.1",
        "difficulty": "Easy",
        "displayText": "2085. Count Common Words With One Occurrence"
    },
    "2086": {
        "id": "2086",
        "name": "Minimum Number of Food Buckets to Feed the Hamsters",
        "acceptance": "46.8",
        "difficulty": "Medium",
        "displayText": "2086. Minimum Number of Food Buckets to Feed the Hamsters"
    },
    "2087": {
        "id": "2087",
        "name": "Minimum Cost Homecoming of a Robot in a Grid",
        "acceptance": "51.0",
        "difficulty": "Medium",
        "displayText": "2087. Minimum Cost Homecoming of a Robot in a Grid"
    },
    "2088": {
        "id": "2088",
        "name": "Count Fertile Pyramids in a Land",
        "acceptance": "65.2",
        "difficulty": "Hard",
        "displayText": "2088. Count Fertile Pyramids in a Land"
    },
    "2089": {
        "id": "2089",
        "name": "Find Target Indices After Sorting Array",
        "acceptance": "77.1",
        "difficulty": "Easy",
        "displayText": "2089. Find Target Indices After Sorting Array"
    },
    "2090": {
        "id": "2090",
        "name": "K Radius Subarray Averages",
        "acceptance": "46.0",
        "difficulty": "Medium",
        "displayText": "2090. K Radius Subarray Averages"
    },
    "2091": {
        "id": "2091",
        "name": "Removing Minimum and Maximum From Array",
        "acceptance": "55.0",
        "difficulty": "Medium",
        "displayText": "2091. Removing Minimum and Maximum From Array"
    },
    "2092": {
        "id": "2092",
        "name": "Find All People With Secret",
        "acceptance": "45.3",
        "difficulty": "Hard",
        "displayText": "2092. Find All People With Secret"
    },
    "2093": {
        "id": "2093",
        "name": "Minimum Cost to Reach City With Discounts",
        "acceptance": "59.9",
        "difficulty": "Medium",
        "displayText": "2093. Minimum Cost to Reach City With Discounts"
    },
    "2094": {
        "id": "2094",
        "name": "Finding 3-Digit Even Numbers",
        "acceptance": "63.7",
        "difficulty": "Easy",
        "displayText": "2094. Finding 3-Digit Even Numbers"
    },
    "2095": {
        "id": "2095",
        "name": "Delete the Middle Node of a Linked List",
        "acceptance": "59.6",
        "difficulty": "Medium",
        "displayText": "2095. Delete the Middle Node of a Linked List"
    },
    "2096": {
        "id": "2096",
        "name": "Step-By-Step Directions From a Binary Tree Node to Another",
        "acceptance": "56.3",
        "difficulty": "Medium",
        "displayText": "2096. Step-By-Step Directions From a Binary Tree Node to Another"
    },
    "2097": {
        "id": "2097",
        "name": "Valid Arrangement of Pairs",
        "acceptance": "66.3",
        "difficulty": "Hard",
        "displayText": "2097. Valid Arrangement of Pairs"
    },
    "2098": {
        "id": "2098",
        "name": "Subsequence of Size K With the Largest Even Sum",
        "acceptance": "35.6",
        "difficulty": "Medium",
        "displayText": "2098. Subsequence of Size K With the Largest Even Sum"
    },
    "2099": {
        "id": "2099",
        "name": "Find Subsequence of Length K With the Largest Sum",
        "acceptance": "45.1",
        "difficulty": "Easy",
        "displayText": "2099. Find Subsequence of Length K With the Largest Sum"
    },
    "2100": {
        "id": "2100",
        "name": "Find Good Days to Rob the Bank",
        "acceptance": "50.1",
        "difficulty": "Medium",
        "displayText": "2100. Find Good Days to Rob the Bank"
    },
    "2101": {
        "id": "2101",
        "name": "Detonate the Maximum Bombs",
        "acceptance": "49.0",
        "difficulty": "Medium",
        "displayText": "2101. Detonate the Maximum Bombs"
    },
    "2102": {
        "id": "2102",
        "name": "Sequentially Ordinal Rank Tracker",
        "acceptance": "64.4",
        "difficulty": "Hard",
        "displayText": "2102. Sequentially Ordinal Rank Tracker"
    },
    "2103": {
        "id": "2103",
        "name": "Rings and Rods",
        "acceptance": "81.0",
        "difficulty": "Easy",
        "displayText": "2103. Rings and Rods"
    },
    "2104": {
        "id": "2104",
        "name": "Sum of Subarray Ranges",
        "acceptance": "60.1",
        "difficulty": "Medium",
        "displayText": "2104. Sum of Subarray Ranges"
    },
    "2105": {
        "id": "2105",
        "name": "Watering Plants II",
        "acceptance": "48.1",
        "difficulty": "Medium",
        "displayText": "2105. Watering Plants II"
    },
    "2106": {
        "id": "2106",
        "name": "Maximum Fruits Harvested After at Most K Steps",
        "acceptance": "36.1",
        "difficulty": "Hard",
        "displayText": "2106. Maximum Fruits Harvested After at Most K Steps"
    },
    "2107": {
        "id": "2107",
        "name": "Number of Unique Flavors After Sharing K Candies",
        "acceptance": "59.7",
        "difficulty": "Medium",
        "displayText": "2107. Number of Unique Flavors After Sharing K Candies"
    },
    "2108": {
        "id": "2108",
        "name": "Find First Palindromic String in the Array",
        "acceptance": "83.9",
        "difficulty": "Easy",
        "displayText": "2108. Find First Palindromic String in the Array"
    },
    "2109": {
        "id": "2109",
        "name": "Adding Spaces to a String",
        "acceptance": "71.7",
        "difficulty": "Medium",
        "displayText": "2109. Adding Spaces to a String"
    },
    "2110": {
        "id": "2110",
        "name": "Number of Smooth Descent Periods of a Stock",
        "acceptance": "59.1",
        "difficulty": "Medium",
        "displayText": "2110. Number of Smooth Descent Periods of a Stock"
    },
    "2111": {
        "id": "2111",
        "name": "Minimum Operations to Make the Array K-Increasing",
        "acceptance": "38.8",
        "difficulty": "Hard",
        "displayText": "2111. Minimum Operations to Make the Array K-Increasing"
    },
    "2112": {
        "id": "2112",
        "name": "The Airport With the Most Traffic",
        "acceptance": "71.3",
        "difficulty": "Medium",
        "displayText": "2112. The Airport With the Most Traffic"
    },
    "2113": {
        "id": "2113",
        "name": "Elements in Array After Removing and Replacing Elements",
        "acceptance": "69.7",
        "difficulty": "Medium",
        "displayText": "2113. Elements in Array After Removing and Replacing Elements"
    },
    "2114": {
        "id": "2114",
        "name": "Maximum Number of Words Found in Sentences",
        "acceptance": "86.6",
        "difficulty": "Easy",
        "displayText": "2114. Maximum Number of Words Found in Sentences"
    },
    "2115": {
        "id": "2115",
        "name": "Find All Possible Recipes from Given Supplies",
        "acceptance": "56.4",
        "difficulty": "Medium",
        "displayText": "2115. Find All Possible Recipes from Given Supplies"
    },
    "2116": {
        "id": "2116",
        "name": "Check if a Parentheses String Can Be Valid",
        "acceptance": "44.8",
        "difficulty": "Medium",
        "displayText": "2116. Check if a Parentheses String Can Be Valid"
    },
    "2117": {
        "id": "2117",
        "name": "Abbreviating the Product of a Range",
        "acceptance": "24.3",
        "difficulty": "Hard",
        "displayText": "2117. Abbreviating the Product of a Range"
    },
    "2118": {
        "id": "2118",
        "name": "Build the Equation",
        "acceptance": "56.4",
        "difficulty": "Hard",
        "displayText": "2118. Build the Equation"
    },
    "2119": {
        "id": "2119",
        "name": "A Number After a Double Reversal",
        "acceptance": "81.0",
        "difficulty": "Easy",
        "displayText": "2119. A Number After a Double Reversal"
    },
    "2120": {
        "id": "2120",
        "name": "Execution of All Suffix Instructions Staying in a Grid",
        "acceptance": "81.5",
        "difficulty": "Medium",
        "displayText": "2120. Execution of All Suffix Instructions Staying in a Grid"
    },
    "2121": {
        "id": "2121",
        "name": "Intervals Between Identical Elements",
        "acceptance": "44.8",
        "difficulty": "Medium",
        "displayText": "2121. Intervals Between Identical Elements"
    },
    "2122": {
        "id": "2122",
        "name": "Recover the Original Array",
        "acceptance": "39.7",
        "difficulty": "Hard",
        "displayText": "2122. Recover the Original Array"
    },
    "2123": {
        "id": "2123",
        "name": "Minimum Operations to Remove Adjacent Ones in Matrix",
        "acceptance": "40.6",
        "difficulty": "Hard",
        "displayText": "2123. Minimum Operations to Remove Adjacent Ones in Matrix"
    },
    "2124": {
        "id": "2124",
        "name": "Check if All A's Appears Before All B's",
        "acceptance": "72.3",
        "difficulty": "Easy",
        "displayText": "2124. Check if All A's Appears Before All B's"
    },
    "2125": {
        "id": "2125",
        "name": "Number of Laser Beams in a Bank",
        "acceptance": "85.4",
        "difficulty": "Medium",
        "displayText": "2125. Number of Laser Beams in a Bank"
    },
    "2126": {
        "id": "2126",
        "name": "Destroying Asteroids",
        "acceptance": "52.5",
        "difficulty": "Medium",
        "displayText": "2126. Destroying Asteroids"
    },
    "2127": {
        "id": "2127",
        "name": "Maximum Employees to Be Invited to a Meeting",
        "acceptance": "62.2",
        "difficulty": "Hard",
        "displayText": "2127. Maximum Employees to Be Invited to a Meeting"
    },
    "2128": {
        "id": "2128",
        "name": "Remove All Ones With Row and Column Flips",
        "acceptance": "76.2",
        "difficulty": "Medium",
        "displayText": "2128. Remove All Ones With Row and Column Flips"
    },
    "2129": {
        "id": "2129",
        "name": "Capitalize the Title",
        "acceptance": "66.2",
        "difficulty": "Easy",
        "displayText": "2129. Capitalize the Title"
    },
    "2130": {
        "id": "2130",
        "name": "Maximum Twin Sum of a Linked List",
        "acceptance": "81.3",
        "difficulty": "Medium",
        "displayText": "2130. Maximum Twin Sum of a Linked List"
    },
    "2131": {
        "id": "2131",
        "name": "Longest Palindrome by Concatenating Two Letter Words",
        "acceptance": "47.8",
        "difficulty": "Medium",
        "displayText": "2131. Longest Palindrome by Concatenating Two Letter Words"
    },
    "2132": {
        "id": "2132",
        "name": "Stamping the Grid",
        "acceptance": "32.8",
        "difficulty": "Hard",
        "displayText": "2132. Stamping the Grid"
    },
    "2133": {
        "id": "2133",
        "name": "Check if Every Row and Column Contains All Numbers",
        "acceptance": "52.6",
        "difficulty": "Easy",
        "displayText": "2133. Check if Every Row and Column Contains All Numbers"
    },
    "2134": {
        "id": "2134",
        "name": "Minimum Swaps to Group All 1's Together II",
        "acceptance": "65.5",
        "difficulty": "Medium",
        "displayText": "2134. Minimum Swaps to Group All 1's Together II"
    },
    "2135": {
        "id": "2135",
        "name": "Count Words Obtained After Adding a Letter",
        "acceptance": "43.4",
        "difficulty": "Medium",
        "displayText": "2135. Count Words Obtained After Adding a Letter"
    },
    "2136": {
        "id": "2136",
        "name": "Earliest Possible Day of Full Bloom",
        "acceptance": "71.1",
        "difficulty": "Hard",
        "displayText": "2136. Earliest Possible Day of Full Bloom"
    },
    "2137": {
        "id": "2137",
        "name": "Pour Water Between Buckets to Make Water Levels Equal",
        "acceptance": "66.9",
        "difficulty": "Medium",
        "displayText": "2137. Pour Water Between Buckets to Make Water Levels Equal"
    },
    "2138": {
        "id": "2138",
        "name": "Divide a String Into Groups of Size k",
        "acceptance": "67.3",
        "difficulty": "Easy",
        "displayText": "2138. Divide a String Into Groups of Size k"
    },
    "2139": {
        "id": "2139",
        "name": "Minimum Moves to Reach Target Score",
        "acceptance": "51.4",
        "difficulty": "Medium",
        "displayText": "2139. Minimum Moves to Reach Target Score"
    },
    "2140": {
        "id": "2140",
        "name": "Solving Questions With Brainpower",
        "acceptance": "60.4",
        "difficulty": "Medium",
        "displayText": "2140. Solving Questions With Brainpower"
    },
    "2141": {
        "id": "2141",
        "name": "Maximum Running Time of N Computers",
        "acceptance": "49.8",
        "difficulty": "Hard",
        "displayText": "2141. Maximum Running Time of N Computers"
    },
    "2142": {
        "id": "2142",
        "name": "The Number of Passengers in Each Bus I",
        "acceptance": "48.8",
        "difficulty": "Medium",
        "displayText": "2142. The Number of Passengers in Each Bus I"
    },
    "2143": {
        "id": "2143",
        "name": "Choose Numbers From Two Arrays in Range",
        "acceptance": "52.3",
        "difficulty": "Hard",
        "displayText": "2143. Choose Numbers From Two Arrays in Range"
    },
    "2144": {
        "id": "2144",
        "name": "Minimum Cost of Buying Candies With Discount",
        "acceptance": "61.9",
        "difficulty": "Easy",
        "displayText": "2144. Minimum Cost of Buying Candies With Discount"
    },
    "2145": {
        "id": "2145",
        "name": "Count the Hidden Sequences",
        "acceptance": "39.3",
        "difficulty": "Medium",
        "displayText": "2145. Count the Hidden Sequences"
    },
    "2146": {
        "id": "2146",
        "name": "K Highest Ranked Items Within a Price Range",
        "acceptance": "44.3",
        "difficulty": "Medium",
        "displayText": "2146. K Highest Ranked Items Within a Price Range"
    },
    "2147": {
        "id": "2147",
        "name": "Number of Ways to Divide a Long Corridor",
        "acceptance": "48.8",
        "difficulty": "Hard",
        "displayText": "2147. Number of Ways to Divide a Long Corridor"
    },
    "2148": {
        "id": "2148",
        "name": "Count Elements With Strictly Smaller and Greater Elements",
        "acceptance": "59.1",
        "difficulty": "Easy",
        "displayText": "2148. Count Elements With Strictly Smaller and Greater Elements"
    },
    "2149": {
        "id": "2149",
        "name": "Rearrange Array Elements by Sign",
        "acceptance": "84.3",
        "difficulty": "Medium",
        "displayText": "2149. Rearrange Array Elements by Sign"
    },
    "2150": {
        "id": "2150",
        "name": "Find All Lonely Numbers in the Array",
        "acceptance": "61.3",
        "difficulty": "Medium",
        "displayText": "2150. Find All Lonely Numbers in the Array"
    },
    "2151": {
        "id": "2151",
        "name": "Maximum Good People Based on Statements",
        "acceptance": "50.7",
        "difficulty": "Hard",
        "displayText": "2151. Maximum Good People Based on Statements"
    },
    "2152": {
        "id": "2152",
        "name": "Minimum Number of Lines to Cover Points",
        "acceptance": "42.6",
        "difficulty": "Medium",
        "displayText": "2152. Minimum Number of Lines to Cover Points"
    },
    "2153": {
        "id": "2153",
        "name": "The Number of Passengers in Each Bus II",
        "acceptance": "39.8",
        "difficulty": "Hard",
        "displayText": "2153. The Number of Passengers in Each Bus II"
    },
    "2154": {
        "id": "2154",
        "name": "Keep Multiplying Found Values by Two",
        "acceptance": "71.3",
        "difficulty": "Easy",
        "displayText": "2154. Keep Multiplying Found Values by Two"
    },
    "2155": {
        "id": "2155",
        "name": "All Divisions With the Highest Score of a Binary Array",
        "acceptance": "64.2",
        "difficulty": "Medium",
        "displayText": "2155. All Divisions With the Highest Score of a Binary Array"
    },
    "2156": {
        "id": "2156",
        "name": "Find Substring With Given Hash Value",
        "acceptance": "24.5",
        "difficulty": "Hard",
        "displayText": "2156. Find Substring With Given Hash Value"
    },
    "2157": {
        "id": "2157",
        "name": "Groups of Strings",
        "acceptance": "26.5",
        "difficulty": "Hard",
        "displayText": "2157. Groups of Strings"
    },
    "2158": {
        "id": "2158",
        "name": "Amount of New Area Painted Each Day",
        "acceptance": "55.4",
        "difficulty": "Hard",
        "displayText": "2158. Amount of New Area Painted Each Day"
    },
    "2159": {
        "id": "2159",
        "name": "Order Two Columns Independently",
        "acceptance": "60.8",
        "difficulty": "Medium",
        "displayText": "2159. Order Two Columns Independently"
    },
    "2160": {
        "id": "2160",
        "name": "Minimum Sum of Four Digit Number After Splitting Digits",
        "acceptance": "86.0",
        "difficulty": "Easy",
        "displayText": "2160. Minimum Sum of Four Digit Number After Splitting Digits"
    },
    "2161": {
        "id": "2161",
        "name": "Partition Array According to Given Pivot",
        "acceptance": "89.9",
        "difficulty": "Medium",
        "displayText": "2161. Partition Array According to Given Pivot"
    },
    "2162": {
        "id": "2162",
        "name": "Minimum Cost to Set Cooking Time",
        "acceptance": "40.8",
        "difficulty": "Medium",
        "displayText": "2162. Minimum Cost to Set Cooking Time"
    },
    "2163": {
        "id": "2163",
        "name": "Minimum Difference in Sums After Removal of Elements",
        "acceptance": "48.7",
        "difficulty": "Hard",
        "displayText": "2163. Minimum Difference in Sums After Removal of Elements"
    },
    "2164": {
        "id": "2164",
        "name": "Sort Even and Odd Indices Independently",
        "acceptance": "62.5",
        "difficulty": "Easy",
        "displayText": "2164. Sort Even and Odd Indices Independently"
    },
    "2165": {
        "id": "2165",
        "name": "Smallest Value of the Rearranged Number",
        "acceptance": "52.5",
        "difficulty": "Medium",
        "displayText": "2165. Smallest Value of the Rearranged Number"
    },
    "2166": {
        "id": "2166",
        "name": "Design Bitset",
        "acceptance": "33.0",
        "difficulty": "Medium",
        "displayText": "2166. Design Bitset"
    },
    "2167": {
        "id": "2167",
        "name": "Minimum Time to Remove All Cars Containing Illegal Goods",
        "acceptance": "41.1",
        "difficulty": "Hard",
        "displayText": "2167. Minimum Time to Remove All Cars Containing Illegal Goods"
    },
    "2168": {
        "id": "2168",
        "name": "Unique Substrings With Equal Digit Frequency",
        "acceptance": "64.0",
        "difficulty": "Medium",
        "displayText": "2168. Unique Substrings With Equal Digit Frequency"
    },
    "2169": {
        "id": "2169",
        "name": "Count Operations to Obtain Zero",
        "acceptance": "74.7",
        "difficulty": "Easy",
        "displayText": "2169. Count Operations to Obtain Zero"
    },
    "2170": {
        "id": "2170",
        "name": "Minimum Operations to Make the Array Alternating",
        "acceptance": "33.8",
        "difficulty": "Medium",
        "displayText": "2170. Minimum Operations to Make the Array Alternating"
    },
    "2171": {
        "id": "2171",
        "name": "Removing Minimum Number of Magic Beans",
        "acceptance": "43.4",
        "difficulty": "Medium",
        "displayText": "2171. Removing Minimum Number of Magic Beans"
    },
    "2172": {
        "id": "2172",
        "name": "Maximum AND Sum of Array",
        "acceptance": "49.6",
        "difficulty": "Hard",
        "displayText": "2172. Maximum AND Sum of Array"
    },
    "2173": {
        "id": "2173",
        "name": "Longest Winning Streak",
        "acceptance": "53.7",
        "difficulty": "Hard",
        "displayText": "2173. Longest Winning Streak"
    },
    "2174": {
        "id": "2174",
        "name": "Remove All Ones With Row and Column Flips II",
        "acceptance": "66.9",
        "difficulty": "Medium",
        "displayText": "2174. Remove All Ones With Row and Column Flips II"
    },
    "2175": {
        "id": "2175",
        "name": "The Change in Global Rankings",
        "acceptance": "60.6",
        "difficulty": "Medium",
        "displayText": "2175. The Change in Global Rankings"
    },
    "2176": {
        "id": "2176",
        "name": "Count Equal and Divisible Pairs in an Array",
        "acceptance": "79.5",
        "difficulty": "Easy",
        "displayText": "2176. Count Equal and Divisible Pairs in an Array"
    },
    "2177": {
        "id": "2177",
        "name": "Find Three Consecutive Integers That Sum to a Given Number",
        "acceptance": "64.5",
        "difficulty": "Medium",
        "displayText": "2177. Find Three Consecutive Integers That Sum to a Given Number"
    },
    "2178": {
        "id": "2178",
        "name": "Maximum Split of Positive Even Integers",
        "acceptance": "59.3",
        "difficulty": "Medium",
        "displayText": "2178. Maximum Split of Positive Even Integers"
    },
    "2179": {
        "id": "2179",
        "name": "Count Good Triplets in an Array",
        "acceptance": "62.3",
        "difficulty": "Hard",
        "displayText": "2179. Count Good Triplets in an Array"
    },
    "2180": {
        "id": "2180",
        "name": "Count Integers With Even Digit Sum",
        "acceptance": "68.4",
        "difficulty": "Easy",
        "displayText": "2180. Count Integers With Even Digit Sum"
    },
    "2181": {
        "id": "2181",
        "name": "Merge Nodes in Between Zeros",
        "acceptance": "89.6",
        "difficulty": "Medium",
        "displayText": "2181. Merge Nodes in Between Zeros"
    },
    "2182": {
        "id": "2182",
        "name": "Construct String With Repeat Limit",
        "acceptance": "70.9",
        "difficulty": "Medium",
        "displayText": "2182. Construct String With Repeat Limit"
    },
    "2183": {
        "id": "2183",
        "name": "Count Array Pairs Divisible by K",
        "acceptance": "29.7",
        "difficulty": "Hard",
        "displayText": "2183. Count Array Pairs Divisible by K"
    },
    "2184": {
        "id": "2184",
        "name": "Number of Ways to Build Sturdy Brick Wall",
        "acceptance": "49.5",
        "difficulty": "Medium",
        "displayText": "2184. Number of Ways to Build Sturdy Brick Wall"
    },
    "2185": {
        "id": "2185",
        "name": "Counting Words With a Given Prefix",
        "acceptance": "84.5",
        "difficulty": "Easy",
        "displayText": "2185. Counting Words With a Given Prefix"
    },
    "2186": {
        "id": "2186",
        "name": "Minimum Number of Steps to Make Two Strings Anagram II",
        "acceptance": "72.6",
        "difficulty": "Medium",
        "displayText": "2186. Minimum Number of Steps to Make Two Strings Anagram II"
    },
    "2187": {
        "id": "2187",
        "name": "Minimum Time to Complete Trips",
        "acceptance": "39.0",
        "difficulty": "Medium",
        "displayText": "2187. Minimum Time to Complete Trips"
    },
    "2188": {
        "id": "2188",
        "name": "Minimum Time to Finish the Race",
        "acceptance": "41.9",
        "difficulty": "Hard",
        "displayText": "2188. Minimum Time to Finish the Race"
    },
    "2189": {
        "id": "2189",
        "name": "Number of Ways to Build House of Cards",
        "acceptance": "61.9",
        "difficulty": "Medium",
        "displayText": "2189. Number of Ways to Build House of Cards"
    },
    "2190": {
        "id": "2190",
        "name": "Most Frequent Number Following Key In an Array",
        "acceptance": "59.1",
        "difficulty": "Easy",
        "displayText": "2190. Most Frequent Number Following Key In an Array"
    },
    "2191": {
        "id": "2191",
        "name": "Sort the Jumbled Numbers",
        "acceptance": "60.0",
        "difficulty": "Medium",
        "displayText": "2191. Sort the Jumbled Numbers"
    },
    "2192": {
        "id": "2192",
        "name": "All Ancestors of a Node in a Directed Acyclic Graph",
        "acceptance": "61.9",
        "difficulty": "Medium",
        "displayText": "2192. All Ancestors of a Node in a Directed Acyclic Graph"
    },
    "2193": {
        "id": "2193",
        "name": "Minimum Number of Moves to Make Palindrome",
        "acceptance": "51.8",
        "difficulty": "Hard",
        "displayText": "2193. Minimum Number of Moves to Make Palindrome"
    },
    "2194": {
        "id": "2194",
        "name": "Cells in a Range on an Excel Sheet",
        "acceptance": "83.8",
        "difficulty": "Easy",
        "displayText": "2194. Cells in a Range on an Excel Sheet"
    },
    "2195": {
        "id": "2195",
        "name": "Append K Integers With Minimal Sum",
        "acceptance": "26.0",
        "difficulty": "Medium",
        "displayText": "2195. Append K Integers With Minimal Sum"
    },
    "2196": {
        "id": "2196",
        "name": "Create Binary Tree From Descriptions",
        "acceptance": "81.6",
        "difficulty": "Medium",
        "displayText": "2196. Create Binary Tree From Descriptions"
    },
    "2197": {
        "id": "2197",
        "name": "Replace Non-Coprime Numbers in Array",
        "acceptance": "40.2",
        "difficulty": "Hard",
        "displayText": "2197. Replace Non-Coprime Numbers in Array"
    },
    "2198": {
        "id": "2198",
        "name": "Number of Single Divisor Triplets",
        "acceptance": "54.1",
        "difficulty": "Medium",
        "displayText": "2198. Number of Single Divisor Triplets"
    },
    "2199": {
        "id": "2199",
        "name": "Finding the Topic of Each Post",
        "acceptance": "50.1",
        "difficulty": "Hard",
        "displayText": "2199. Finding the Topic of Each Post"
    },
    "2200": {
        "id": "2200",
        "name": "Find All K-Distant Indices in an Array",
        "acceptance": "67.0",
        "difficulty": "Easy",
        "displayText": "2200. Find All K-Distant Indices in an Array"
    },
    "2201": {
        "id": "2201",
        "name": "Count Artifacts That Can Be Extracted",
        "acceptance": "56.2",
        "difficulty": "Medium",
        "displayText": "2201. Count Artifacts That Can Be Extracted"
    },
    "2202": {
        "id": "2202",
        "name": "Maximize the Topmost Element After K Moves",
        "acceptance": "23.3",
        "difficulty": "Medium",
        "displayText": "2202. Maximize the Topmost Element After K Moves"
    },
    "2203": {
        "id": "2203",
        "name": "Minimum Weighted Subgraph With the Required Paths",
        "acceptance": "37.9",
        "difficulty": "Hard",
        "displayText": "2203. Minimum Weighted Subgraph With the Required Paths"
    },
    "2204": {
        "id": "2204",
        "name": "Distance to a Cycle in Undirected Graph",
        "acceptance": "72.8",
        "difficulty": "Hard",
        "displayText": "2204. Distance to a Cycle in Undirected Graph"
    },
    "2205": {
        "id": "2205",
        "name": "The Number of Users That Are Eligible for Discount",
        "acceptance": "50.8",
        "difficulty": "Easy",
        "displayText": "2205. The Number of Users That Are Eligible for Discount"
    },
    "2206": {
        "id": "2206",
        "name": "Divide Array Into Equal Pairs",
        "acceptance": "79.3",
        "difficulty": "Easy",
        "displayText": "2206. Divide Array Into Equal Pairs"
    },
    "2207": {
        "id": "2207",
        "name": "Maximize Number of Subsequences in a String",
        "acceptance": "35.0",
        "difficulty": "Medium",
        "displayText": "2207. Maximize Number of Subsequences in a String"
    },
    "2208": {
        "id": "2208",
        "name": "Minimum Operations to Halve Array Sum",
        "acceptance": "48.7",
        "difficulty": "Medium",
        "displayText": "2208. Minimum Operations to Halve Array Sum"
    },
    "2209": {
        "id": "2209",
        "name": "Minimum White Tiles After Covering With Carpets",
        "acceptance": "36.8",
        "difficulty": "Hard",
        "displayText": "2209. Minimum White Tiles After Covering With Carpets"
    },
    "2210": {
        "id": "2210",
        "name": "Count Hills and Valleys in an Array",
        "acceptance": "61.5",
        "difficulty": "Easy",
        "displayText": "2210. Count Hills and Valleys in an Array"
    },
    "2211": {
        "id": "2211",
        "name": "Count Collisions on a Road",
        "acceptance": "44.2",
        "difficulty": "Medium",
        "displayText": "2211. Count Collisions on a Road"
    },
    "2212": {
        "id": "2212",
        "name": "Maximum Points in an Archery Competition",
        "acceptance": "50.1",
        "difficulty": "Medium",
        "displayText": "2212. Maximum Points in an Archery Competition"
    },
    "2213": {
        "id": "2213",
        "name": "Longest Substring of One Repeating Character",
        "acceptance": "32.7",
        "difficulty": "Hard",
        "displayText": "2213. Longest Substring of One Repeating Character"
    },
    "2214": {
        "id": "2214",
        "name": "Minimum Health to Beat Game",
        "acceptance": "58.6",
        "difficulty": "Medium",
        "displayText": "2214. Minimum Health to Beat Game"
    },
    "2215": {
        "id": "2215",
        "name": "Find the Difference of Two Arrays",
        "acceptance": "80.6",
        "difficulty": "Easy",
        "displayText": "2215. Find the Difference of Two Arrays"
    },
    "2216": {
        "id": "2216",
        "name": "Minimum Deletions to Make Array Beautiful",
        "acceptance": "48.7",
        "difficulty": "Medium",
        "displayText": "2216. Minimum Deletions to Make Array Beautiful"
    },
    "2217": {
        "id": "2217",
        "name": "Find Palindrome With Fixed Length",
        "acceptance": "37.4",
        "difficulty": "Medium",
        "displayText": "2217. Find Palindrome With Fixed Length"
    },
    "2218": {
        "id": "2218",
        "name": "Maximum Value of K Coins From Piles",
        "acceptance": "60.4",
        "difficulty": "Hard",
        "displayText": "2218. Maximum Value of K Coins From Piles"
    },
    "2219": {
        "id": "2219",
        "name": "Maximum Sum Score of Array",
        "acceptance": "61.9",
        "difficulty": "Medium",
        "displayText": "2219. Maximum Sum Score of Array"
    },
    "2220": {
        "id": "2220",
        "name": "Minimum Bit Flips to Convert Number",
        "acceptance": "87.5",
        "difficulty": "Easy",
        "displayText": "2220. Minimum Bit Flips to Convert Number"
    },
    "2221": {
        "id": "2221",
        "name": "Find Triangular Sum of an Array",
        "acceptance": "78.8",
        "difficulty": "Medium",
        "displayText": "2221. Find Triangular Sum of an Array"
    },
    "2222": {
        "id": "2222",
        "name": "Number of Ways to Select Buildings",
        "acceptance": "50.4",
        "difficulty": "Medium",
        "displayText": "2222. Number of Ways to Select Buildings"
    },
    "2223": {
        "id": "2223",
        "name": "Sum of Scores of Built Strings",
        "acceptance": "41.7",
        "difficulty": "Hard",
        "displayText": "2223. Sum of Scores of Built Strings"
    },
    "2224": {
        "id": "2224",
        "name": "Minimum Number of Operations to Convert Time",
        "acceptance": "65.4",
        "difficulty": "Easy",
        "displayText": "2224. Minimum Number of Operations to Convert Time"
    },
    "2225": {
        "id": "2225",
        "name": "Find Players With Zero or One Losses",
        "acceptance": "72.7",
        "difficulty": "Medium",
        "displayText": "2225. Find Players With Zero or One Losses"
    },
    "2226": {
        "id": "2226",
        "name": "Maximum Candies Allocated to K Children",
        "acceptance": "50.2",
        "difficulty": "Medium",
        "displayText": "2226. Maximum Candies Allocated to K Children"
    },
    "2227": {
        "id": "2227",
        "name": "Encrypt and Decrypt Strings",
        "acceptance": "41.3",
        "difficulty": "Hard",
        "displayText": "2227. Encrypt and Decrypt Strings"
    },
    "2228": {
        "id": "2228",
        "name": "Users With Two Purchases Within Seven Days",
        "acceptance": "45.9",
        "difficulty": "Medium",
        "displayText": "2228. Users With Two Purchases Within Seven Days"
    },
    "2229": {
        "id": "2229",
        "name": "Check if an Array Is Consecutive",
        "acceptance": "61.7",
        "difficulty": "Easy",
        "displayText": "2229. Check if an Array Is Consecutive"
    },
    "2230": {
        "id": "2230",
        "name": "The Users That Are Eligible for Discount",
        "acceptance": "50.7",
        "difficulty": "Easy",
        "displayText": "2230. The Users That Are Eligible for Discount"
    },
    "2231": {
        "id": "2231",
        "name": "Largest Number After Digit Swaps by Parity",
        "acceptance": "63.4",
        "difficulty": "Easy",
        "displayText": "2231. Largest Number After Digit Swaps by Parity"
    },
    "2232": {
        "id": "2232",
        "name": "Minimize Result by Adding Parentheses to Expression",
        "acceptance": "67.4",
        "difficulty": "Medium",
        "displayText": "2232. Minimize Result by Adding Parentheses to Expression"
    },
    "2233": {
        "id": "2233",
        "name": "Maximum Product After K Increments",
        "acceptance": "42.1",
        "difficulty": "Medium",
        "displayText": "2233. Maximum Product After K Increments"
    },
    "2234": {
        "id": "2234",
        "name": "Maximum Total Beauty of the Gardens",
        "acceptance": "29.9",
        "difficulty": "Hard",
        "displayText": "2234. Maximum Total Beauty of the Gardens"
    },
    "2235": {
        "id": "2235",
        "name": "Add Two Integers",
        "acceptance": "88.1",
        "difficulty": "Easy",
        "displayText": "2235. Add Two Integers"
    },
    "2236": {
        "id": "2236",
        "name": "Root Equals Sum of Children",
        "acceptance": "84.9",
        "difficulty": "Easy",
        "displayText": "2236. Root Equals Sum of Children"
    },
    "2237": {
        "id": "2237",
        "name": "Count Positions on Street With Required Brightness",
        "acceptance": "62.0",
        "difficulty": "Medium",
        "displayText": "2237. Count Positions on Street With Required Brightness"
    },
    "2238": {
        "id": "2238",
        "name": "Number of Times a Driver Was a Passenger",
        "acceptance": "72.0",
        "difficulty": "Medium",
        "displayText": "2238. Number of Times a Driver Was a Passenger"
    },
    "2239": {
        "id": "2239",
        "name": "Find Closest Number to Zero",
        "acceptance": "47.0",
        "difficulty": "Easy",
        "displayText": "2239. Find Closest Number to Zero"
    },
    "2240": {
        "id": "2240",
        "name": "Number of Ways to Buy Pens and Pencils",
        "acceptance": "55.7",
        "difficulty": "Medium",
        "displayText": "2240. Number of Ways to Buy Pens and Pencils"
    },
    "2241": {
        "id": "2241",
        "name": "Design an ATM Machine",
        "acceptance": "44.1",
        "difficulty": "Medium",
        "displayText": "2241. Design an ATM Machine"
    },
    "2242": {
        "id": "2242",
        "name": "Maximum Score of a Node Sequence",
        "acceptance": "38.8",
        "difficulty": "Hard",
        "displayText": "2242. Maximum Score of a Node Sequence"
    },
    "2243": {
        "id": "2243",
        "name": "Calculate Digit Sum of a String",
        "acceptance": "66.4",
        "difficulty": "Easy",
        "displayText": "2243. Calculate Digit Sum of a String"
    },
    "2244": {
        "id": "2244",
        "name": "Minimum Rounds to Complete All Tasks",
        "acceptance": "62.9",
        "difficulty": "Medium",
        "displayText": "2244. Minimum Rounds to Complete All Tasks"
    },
    "2245": {
        "id": "2245",
        "name": "Maximum Trailing Zeros in a Cornered Path",
        "acceptance": "36.5",
        "difficulty": "Medium",
        "displayText": "2245. Maximum Trailing Zeros in a Cornered Path"
    },
    "2246": {
        "id": "2246",
        "name": "Longest Path With Different Adjacent Characters",
        "acceptance": "53.9",
        "difficulty": "Hard",
        "displayText": "2246. Longest Path With Different Adjacent Characters"
    },
    "2247": {
        "id": "2247",
        "name": "Maximum Cost of Trip With K Highways",
        "acceptance": "50.0",
        "difficulty": "Hard",
        "displayText": "2247. Maximum Cost of Trip With K Highways"
    },
    "2248": {
        "id": "2248",
        "name": "Intersection of Multiple Arrays",
        "acceptance": "68.4",
        "difficulty": "Easy",
        "displayText": "2248. Intersection of Multiple Arrays"
    },
    "2249": {
        "id": "2249",
        "name": "Count Lattice Points Inside a Circle",
        "acceptance": "54.8",
        "difficulty": "Medium",
        "displayText": "2249. Count Lattice Points Inside a Circle"
    },
    "2250": {
        "id": "2250",
        "name": "Count Number of Rectangles Containing Each Point",
        "acceptance": "35.8",
        "difficulty": "Medium",
        "displayText": "2250. Count Number of Rectangles Containing Each Point"
    },
    "2251": {
        "id": "2251",
        "name": "Number of Flowers in Full Bloom",
        "acceptance": "57.0",
        "difficulty": "Hard",
        "displayText": "2251. Number of Flowers in Full Bloom"
    },
    "2252": {
        "id": "2252",
        "name": "Dynamic Pivoting of a Table",
        "acceptance": "57.0",
        "difficulty": "Hard",
        "displayText": "2252. Dynamic Pivoting of a Table"
    },
    "2253": {
        "id": "2253",
        "name": "Dynamic Unpivoting of a Table",
        "acceptance": "68.0",
        "difficulty": "Hard",
        "displayText": "2253. Dynamic Unpivoting of a Table"
    },
    "2254": {
        "id": "2254",
        "name": "Design Video Sharing Platform",
        "acceptance": "63.7",
        "difficulty": "Hard",
        "displayText": "2254. Design Video Sharing Platform"
    },
    "2255": {
        "id": "2255",
        "name": "Count Prefixes of a Given String",
        "acceptance": "73.7",
        "difficulty": "Easy",
        "displayText": "2255. Count Prefixes of a Given String"
    },
    "2256": {
        "id": "2256",
        "name": "Minimum Average Difference",
        "acceptance": "43.4",
        "difficulty": "Medium",
        "displayText": "2256. Minimum Average Difference"
    },
    "2257": {
        "id": "2257",
        "name": "Count Unguarded Cells in the Grid",
        "acceptance": "65.8",
        "difficulty": "Medium",
        "displayText": "2257. Count Unguarded Cells in the Grid"
    },
    "2258": {
        "id": "2258",
        "name": "Escape the Spreading Fire",
        "acceptance": "36.0",
        "difficulty": "Hard",
        "displayText": "2258. Escape the Spreading Fire"
    },
    "2259": {
        "id": "2259",
        "name": "Remove Digit From Number to Maximize Result",
        "acceptance": "47.0",
        "difficulty": "Easy",
        "displayText": "2259. Remove Digit From Number to Maximize Result"
    },
    "2260": {
        "id": "2260",
        "name": "Minimum Consecutive Cards to Pick Up",
        "acceptance": "52.4",
        "difficulty": "Medium",
        "displayText": "2260. Minimum Consecutive Cards to Pick Up"
    },
    "2261": {
        "id": "2261",
        "name": "K Divisible Elements Subarrays",
        "acceptance": "53.4",
        "difficulty": "Medium",
        "displayText": "2261. K Divisible Elements Subarrays"
    },
    "2262": {
        "id": "2262",
        "name": "Total Appeal of A String",
        "acceptance": "55.7",
        "difficulty": "Hard",
        "displayText": "2262. Total Appeal of A String"
    },
    "2263": {
        "id": "2263",
        "name": "Make Array Non-decreasing or Non-increasing",
        "acceptance": "65.3",
        "difficulty": "Hard",
        "displayText": "2263. Make Array Non-decreasing or Non-increasing"
    },
    "2264": {
        "id": "2264",
        "name": "Largest 3-Same-Digit Number in String",
        "acceptance": "69.0",
        "difficulty": "Easy",
        "displayText": "2264. Largest 3-Same-Digit Number in String"
    },
    "2265": {
        "id": "2265",
        "name": "Count Nodes Equal to Average of Subtree",
        "acceptance": "86.3",
        "difficulty": "Medium",
        "displayText": "2265. Count Nodes Equal to Average of Subtree"
    },
    "2266": {
        "id": "2266",
        "name": "Count Number of Texts",
        "acceptance": "48.6",
        "difficulty": "Medium",
        "displayText": "2266. Count Number of Texts"
    },
    "2267": {
        "id": "2267",
        "name": "Check if There Is a Valid Parentheses String Path",
        "acceptance": "39.2",
        "difficulty": "Hard",
        "displayText": "2267. Check if There Is a Valid Parentheses String Path"
    },
    "2268": {
        "id": "2268",
        "name": "Minimum Number of Keypresses",
        "acceptance": "71.2",
        "difficulty": "Medium",
        "displayText": "2268. Minimum Number of Keypresses"
    },
    "2269": {
        "id": "2269",
        "name": "Find the K-Beauty of a Number",
        "acceptance": "61.4",
        "difficulty": "Easy",
        "displayText": "2269. Find the K-Beauty of a Number"
    },
    "2270": {
        "id": "2270",
        "name": "Number of Ways to Split Array",
        "acceptance": "56.1",
        "difficulty": "Medium",
        "displayText": "2270. Number of Ways to Split Array"
    },
    "2271": {
        "id": "2271",
        "name": "Maximum White Tiles Covered by a Carpet",
        "acceptance": "34.7",
        "difficulty": "Medium",
        "displayText": "2271. Maximum White Tiles Covered by a Carpet"
    },
    "2272": {
        "id": "2272",
        "name": "Substring With Largest Variance",
        "acceptance": "45.9",
        "difficulty": "Hard",
        "displayText": "2272. Substring With Largest Variance"
    },
    "2273": {
        "id": "2273",
        "name": "Find Resultant Array After Removing Anagrams",
        "acceptance": "59.2",
        "difficulty": "Easy",
        "displayText": "2273. Find Resultant Array After Removing Anagrams"
    },
    "2274": {
        "id": "2274",
        "name": "Maximum Consecutive Floors Without Special Floors",
        "acceptance": "51.9",
        "difficulty": "Medium",
        "displayText": "2274. Maximum Consecutive Floors Without Special Floors"
    },
    "2275": {
        "id": "2275",
        "name": "Largest Combination With Bitwise AND Greater Than Zero",
        "acceptance": "80.9",
        "difficulty": "Medium",
        "displayText": "2275. Largest Combination With Bitwise AND Greater Than Zero"
    },
    "2276": {
        "id": "2276",
        "name": "Count Integers in Intervals",
        "acceptance": "36.1",
        "difficulty": "Hard",
        "displayText": "2276. Count Integers in Intervals"
    },
    "2277": {
        "id": "2277",
        "name": "Closest Node to Path in Tree",
        "acceptance": "62.4",
        "difficulty": "Hard",
        "displayText": "2277. Closest Node to Path in Tree"
    },
    "2278": {
        "id": "2278",
        "name": "Percentage of Letter in String",
        "acceptance": "74.4",
        "difficulty": "Easy",
        "displayText": "2278. Percentage of Letter in String"
    },
    "2279": {
        "id": "2279",
        "name": "Maximum Bags With Full Capacity of Rocks",
        "acceptance": "67.5",
        "difficulty": "Medium",
        "displayText": "2279. Maximum Bags With Full Capacity of Rocks"
    },
    "2280": {
        "id": "2280",
        "name": "Minimum Lines to Represent a Line Chart",
        "acceptance": "25.9",
        "difficulty": "Medium",
        "displayText": "2280. Minimum Lines to Represent a Line Chart"
    },
    "2281": {
        "id": "2281",
        "name": "Sum of Total Strength of Wizards",
        "acceptance": "28.2",
        "difficulty": "Hard",
        "displayText": "2281. Sum of Total Strength of Wizards"
    },
    "2282": {
        "id": "2282",
        "name": "Number of People That Can Be Seen in a Grid",
        "acceptance": "47.1",
        "difficulty": "Medium",
        "displayText": "2282. Number of People That Can Be Seen in a Grid"
    },
    "2283": {
        "id": "2283",
        "name": "Check if Number Has Equal Digit Count and Digit Value",
        "acceptance": "72.3",
        "difficulty": "Easy",
        "displayText": "2283. Check if Number Has Equal Digit Count and Digit Value"
    },
    "2284": {
        "id": "2284",
        "name": "Sender With Largest Word Count",
        "acceptance": "58.1",
        "difficulty": "Medium",
        "displayText": "2284. Sender With Largest Word Count"
    },
    "2285": {
        "id": "2285",
        "name": "Maximum Total Importance of Roads",
        "acceptance": "69.2",
        "difficulty": "Medium",
        "displayText": "2285. Maximum Total Importance of Roads"
    },
    "2286": {
        "id": "2286",
        "name": "Booking Concert Tickets in Groups",
        "acceptance": "18.5",
        "difficulty": "Hard",
        "displayText": "2286. Booking Concert Tickets in Groups"
    },
    "2287": {
        "id": "2287",
        "name": "Rearrange Characters to Make Target String",
        "acceptance": "59.9",
        "difficulty": "Easy",
        "displayText": "2287. Rearrange Characters to Make Target String"
    },
    "2288": {
        "id": "2288",
        "name": "Apply Discount to Prices",
        "acceptance": "32.5",
        "difficulty": "Medium",
        "displayText": "2288. Apply Discount to Prices"
    },
    "2289": {
        "id": "2289",
        "name": "Steps to Make Array Non-decreasing",
        "acceptance": "22.9",
        "difficulty": "Medium",
        "displayText": "2289. Steps to Make Array Non-decreasing"
    },
    "2290": {
        "id": "2290",
        "name": "Minimum Obstacle Removal to Reach Corner",
        "acceptance": "70.0",
        "difficulty": "Hard",
        "displayText": "2290. Minimum Obstacle Removal to Reach Corner"
    },
    "2291": {
        "id": "2291",
        "name": "Maximum Profit From Trading Stocks",
        "acceptance": "46.3",
        "difficulty": "Medium",
        "displayText": "2291. Maximum Profit From Trading Stocks"
    },
    "2292": {
        "id": "2292",
        "name": "Products With Three or More Orders in Two Consecutive Years",
        "acceptance": "40.1",
        "difficulty": "Medium",
        "displayText": "2292. Products With Three or More Orders in Two Consecutive Years"
    },
    "2293": {
        "id": "2293",
        "name": "Min Max Game",
        "acceptance": "63.6",
        "difficulty": "Easy",
        "displayText": "2293. Min Max Game"
    },
    "2294": {
        "id": "2294",
        "name": "Partition Array Such That Maximum Difference Is K",
        "acceptance": "74.3",
        "difficulty": "Medium",
        "displayText": "2294. Partition Array Such That Maximum Difference Is K"
    },
    "2295": {
        "id": "2295",
        "name": "Replace Elements in an Array",
        "acceptance": "58.6",
        "difficulty": "Medium",
        "displayText": "2295. Replace Elements in an Array"
    },
    "2296": {
        "id": "2296",
        "name": "Design a Text Editor",
        "acceptance": "47.8",
        "difficulty": "Hard",
        "displayText": "2296. Design a Text Editor"
    },
    "2297": {
        "id": "2297",
        "name": "Jump Game VIII",
        "acceptance": "45.0",
        "difficulty": "Medium",
        "displayText": "2297. Jump Game VIII"
    },
    "2298": {
        "id": "2298",
        "name": "Tasks Count in the Weekend",
        "acceptance": "82.3",
        "difficulty": "Medium",
        "displayText": "2298. Tasks Count in the Weekend"
    },
    "2299": {
        "id": "2299",
        "name": "Strong Password Checker II",
        "acceptance": "54.8",
        "difficulty": "Easy",
        "displayText": "2299. Strong Password Checker II"
    },
    "2300": {
        "id": "2300",
        "name": "Successful Pairs of Spells and Potions",
        "acceptance": "45.1",
        "difficulty": "Medium",
        "displayText": "2300. Successful Pairs of Spells and Potions"
    },
    "2301": {
        "id": "2301",
        "name": "Match Substring After Replacement",
        "acceptance": "41.9",
        "difficulty": "Hard",
        "displayText": "2301. Match Substring After Replacement"
    },
    "2302": {
        "id": "2302",
        "name": "Count Subarrays With Score Less Than K",
        "acceptance": "55.8",
        "difficulty": "Hard",
        "displayText": "2302. Count Subarrays With Score Less Than K"
    },
    "2303": {
        "id": "2303",
        "name": "Calculate Amount Paid in Taxes",
        "acceptance": "67.0",
        "difficulty": "Easy",
        "displayText": "2303. Calculate Amount Paid in Taxes"
    },
    "2304": {
        "id": "2304",
        "name": "Minimum Path Cost in a Grid",
        "acceptance": "67.0",
        "difficulty": "Medium",
        "displayText": "2304. Minimum Path Cost in a Grid"
    },
    "2305": {
        "id": "2305",
        "name": "Fair Distribution of Cookies",
        "acceptance": "69.3",
        "difficulty": "Medium",
        "displayText": "2305. Fair Distribution of Cookies"
    },
    "2306": {
        "id": "2306",
        "name": "Naming a Company",
        "acceptance": "46.3",
        "difficulty": "Hard",
        "displayText": "2306. Naming a Company"
    },
    "2307": {
        "id": "2307",
        "name": "Check for Contradictions in Equations",
        "acceptance": "43.2",
        "difficulty": "Hard",
        "displayText": "2307. Check for Contradictions in Equations"
    },
    "2308": {
        "id": "2308",
        "name": "Arrange Table by Gender",
        "acceptance": "70.3",
        "difficulty": "Medium",
        "displayText": "2308. Arrange Table by Gender"
    },
    "2309": {
        "id": "2309",
        "name": "Greatest English Letter in Upper and Lower Case",
        "acceptance": "70.9",
        "difficulty": "Easy",
        "displayText": "2309. Greatest English Letter in Upper and Lower Case"
    },
    "2310": {
        "id": "2310",
        "name": "Sum of Numbers With Units Digit K",
        "acceptance": "27.2",
        "difficulty": "Medium",
        "displayText": "2310. Sum of Numbers With Units Digit K"
    },
    "2311": {
        "id": "2311",
        "name": "Longest Binary Subsequence Less Than or Equal to K",
        "acceptance": "38.1",
        "difficulty": "Medium",
        "displayText": "2311. Longest Binary Subsequence Less Than or Equal to K"
    },
    "2312": {
        "id": "2312",
        "name": "Selling Pieces of Wood",
        "acceptance": "51.4",
        "difficulty": "Hard",
        "displayText": "2312. Selling Pieces of Wood"
    },
    "2313": {
        "id": "2313",
        "name": "Minimum Flips in Binary Tree to Get Result",
        "acceptance": "56.7",
        "difficulty": "Hard",
        "displayText": "2313. Minimum Flips in Binary Tree to Get Result"
    },
    "2314": {
        "id": "2314",
        "name": "The First Day of the Maximum Recorded Degree in Each City",
        "acceptance": "73.1",
        "difficulty": "Medium",
        "displayText": "2314. The First Day of the Maximum Recorded Degree in Each City"
    },
    "2315": {
        "id": "2315",
        "name": "Count Asterisks",
        "acceptance": "82.6",
        "difficulty": "Easy",
        "displayText": "2315. Count Asterisks"
    },
    "2316": {
        "id": "2316",
        "name": "Count Unreachable Pairs of Nodes in an Undirected Graph",
        "acceptance": "49.2",
        "difficulty": "Medium",
        "displayText": "2316. Count Unreachable Pairs of Nodes in an Undirected Graph"
    },
    "2317": {
        "id": "2317",
        "name": "Maximum XOR After Operations",
        "acceptance": "79.2",
        "difficulty": "Medium",
        "displayText": "2317. Maximum XOR After Operations"
    },
    "2318": {
        "id": "2318",
        "name": "Number of Distinct Roll Sequences",
        "acceptance": "57.1",
        "difficulty": "Hard",
        "displayText": "2318. Number of Distinct Roll Sequences"
    },
    "2319": {
        "id": "2319",
        "name": "Check if Matrix Is X-Matrix",
        "acceptance": "65.4",
        "difficulty": "Easy",
        "displayText": "2319. Check if Matrix Is X-Matrix"
    },
    "2320": {
        "id": "2320",
        "name": "Count Number of Ways to Place Houses",
        "acceptance": "42.6",
        "difficulty": "Medium",
        "displayText": "2320. Count Number of Ways to Place Houses"
    },
    "2321": {
        "id": "2321",
        "name": "Maximum Score Of Spliced Array",
        "acceptance": "57.3",
        "difficulty": "Hard",
        "displayText": "2321. Maximum Score Of Spliced Array"
    },
    "2322": {
        "id": "2322",
        "name": "Minimum Score After Removals on a Tree",
        "acceptance": "52.0",
        "difficulty": "Hard",
        "displayText": "2322. Minimum Score After Removals on a Tree"
    },
    "2323": {
        "id": "2323",
        "name": "Find Minimum Time to Finish All Jobs II",
        "acceptance": "65.5",
        "difficulty": "Medium",
        "displayText": "2323. Find Minimum Time to Finish All Jobs II"
    },
    "2324": {
        "id": "2324",
        "name": "Product Sales Analysis IV",
        "acceptance": "75.3",
        "difficulty": "Medium",
        "displayText": "2324. Product Sales Analysis IV"
    },
    "2325": {
        "id": "2325",
        "name": "Decode the Message",
        "acceptance": "85.3",
        "difficulty": "Easy",
        "displayText": "2325. Decode the Message"
    },
    "2326": {
        "id": "2326",
        "name": "Spiral Matrix IV",
        "acceptance": "82.2",
        "difficulty": "Medium",
        "displayText": "2326. Spiral Matrix IV"
    },
    "2327": {
        "id": "2327",
        "name": "Number of People Aware of a Secret",
        "acceptance": "46.1",
        "difficulty": "Medium",
        "displayText": "2327. Number of People Aware of a Secret"
    },
    "2328": {
        "id": "2328",
        "name": "Number of Increasing Paths in a Grid",
        "acceptance": "57.7",
        "difficulty": "Hard",
        "displayText": "2328. Number of Increasing Paths in a Grid"
    },
    "2329": {
        "id": "2329",
        "name": "Product Sales Analysis V",
        "acceptance": "70.4",
        "difficulty": "Easy",
        "displayText": "2329. Product Sales Analysis V"
    },
    "2330": {
        "id": "2330",
        "name": "Valid Palindrome IV",
        "acceptance": "75.8",
        "difficulty": "Medium",
        "displayText": "2330. Valid Palindrome IV"
    },
    "2331": {
        "id": "2331",
        "name": "Evaluate Boolean Binary Tree",
        "acceptance": "82.4",
        "difficulty": "Easy",
        "displayText": "2331. Evaluate Boolean Binary Tree"
    },
    "2332": {
        "id": "2332",
        "name": "The Latest Time to Catch a Bus",
        "acceptance": "28.1",
        "difficulty": "Medium",
        "displayText": "2332. The Latest Time to Catch a Bus"
    },
    "2333": {
        "id": "2333",
        "name": "Minimum Sum of Squared Difference",
        "acceptance": "25.8",
        "difficulty": "Medium",
        "displayText": "2333. Minimum Sum of Squared Difference"
    },
    "2334": {
        "id": "2334",
        "name": "Subarray With Elements Greater Than Varying Threshold",
        "acceptance": "44.3",
        "difficulty": "Hard",
        "displayText": "2334. Subarray With Elements Greater Than Varying Threshold"
    },
    "2335": {
        "id": "2335",
        "name": "Minimum Amount of Time to Fill Cups",
        "acceptance": "58.6",
        "difficulty": "Easy",
        "displayText": "2335. Minimum Amount of Time to Fill Cups"
    },
    "2336": {
        "id": "2336",
        "name": "Smallest Number in Infinite Set",
        "acceptance": "71.4",
        "difficulty": "Medium",
        "displayText": "2336. Smallest Number in Infinite Set"
    },
    "2337": {
        "id": "2337",
        "name": "Move Pieces to Obtain a String",
        "acceptance": "56.9",
        "difficulty": "Medium",
        "displayText": "2337. Move Pieces to Obtain a String"
    },
    "2338": {
        "id": "2338",
        "name": "Count the Number of Ideal Arrays",
        "acceptance": "27.4",
        "difficulty": "Hard",
        "displayText": "2338. Count the Number of Ideal Arrays"
    },
    "2339": {
        "id": "2339",
        "name": "All the Matches of the League",
        "acceptance": "88.4",
        "difficulty": "Easy",
        "displayText": "2339. All the Matches of the League"
    },
    "2340": {
        "id": "2340",
        "name": "Minimum Adjacent Swaps to Make a Valid Array",
        "acceptance": "72.2",
        "difficulty": "Medium",
        "displayText": "2340. Minimum Adjacent Swaps to Make a Valid Array"
    },
    "2341": {
        "id": "2341",
        "name": "Maximum Number of Pairs in Array",
        "acceptance": "75.4",
        "difficulty": "Easy",
        "displayText": "2341. Maximum Number of Pairs in Array"
    },
    "2342": {
        "id": "2342",
        "name": "Max Sum of a Pair With Equal Sum of Digits",
        "acceptance": "66.0",
        "difficulty": "Medium",
        "displayText": "2342. Max Sum of a Pair With Equal Sum of Digits"
    },
    "2343": {
        "id": "2343",
        "name": "Query Kth Smallest Trimmed Number",
        "acceptance": "45.2",
        "difficulty": "Medium",
        "displayText": "2343. Query Kth Smallest Trimmed Number"
    },
    "2344": {
        "id": "2344",
        "name": "Minimum Deletions to Make Array Divisible",
        "acceptance": "57.2",
        "difficulty": "Hard",
        "displayText": "2344. Minimum Deletions to Make Array Divisible"
    },
    "2345": {
        "id": "2345",
        "name": "Finding the Number of Visible Mountains",
        "acceptance": "36.6",
        "difficulty": "Medium",
        "displayText": "2345. Finding the Number of Visible Mountains"
    },
    "2346": {
        "id": "2346",
        "name": "Compute the Rank as a Percentage",
        "acceptance": "33.8",
        "difficulty": "Medium",
        "displayText": "2346. Compute the Rank as a Percentage"
    },
    "2347": {
        "id": "2347",
        "name": "Best Poker Hand",
        "acceptance": "61.1",
        "difficulty": "Easy",
        "displayText": "2347. Best Poker Hand"
    },
    "2348": {
        "id": "2348",
        "name": "Number of Zero-Filled Subarrays",
        "acceptance": "66.7",
        "difficulty": "Medium",
        "displayText": "2348. Number of Zero-Filled Subarrays"
    },
    "2349": {
        "id": "2349",
        "name": "Design a Number Container System",
        "acceptance": "58.1",
        "difficulty": "Medium",
        "displayText": "2349. Design a Number Container System"
    },
    "2350": {
        "id": "2350",
        "name": "Shortest Impossible Sequence of Rolls",
        "acceptance": "68.5",
        "difficulty": "Hard",
        "displayText": "2350. Shortest Impossible Sequence of Rolls"
    },
    "2351": {
        "id": "2351",
        "name": "First Letter to Appear Twice",
        "acceptance": "74.0",
        "difficulty": "Easy",
        "displayText": "2351. First Letter to Appear Twice"
    },
    "2352": {
        "id": "2352",
        "name": "Equal Row and Column Pairs",
        "acceptance": "70.4",
        "difficulty": "Medium",
        "displayText": "2352. Equal Row and Column Pairs"
    },
    "2353": {
        "id": "2353",
        "name": "Design a Food Rating System",
        "acceptance": "45.3",
        "difficulty": "Medium",
        "displayText": "2353. Design a Food Rating System"
    },
    "2354": {
        "id": "2354",
        "name": "Number of Excellent Pairs",
        "acceptance": "47.8",
        "difficulty": "Hard",
        "displayText": "2354. Number of Excellent Pairs"
    },
    "2355": {
        "id": "2355",
        "name": "Maximum Number of Books You Can Take",
        "acceptance": "39.3",
        "difficulty": "Hard",
        "displayText": "2355. Maximum Number of Books You Can Take"
    },
    "2356": {
        "id": "2356",
        "name": "Number of Unique Subjects Taught by Each Teacher",
        "acceptance": "89.3",
        "difficulty": "Easy",
        "displayText": "2356. Number of Unique Subjects Taught by Each Teacher"
    },
    "2357": {
        "id": "2357",
        "name": "Make Array Zero by Subtracting Equal Amounts",
        "acceptance": "73.2",
        "difficulty": "Easy",
        "displayText": "2357. Make Array Zero by Subtracting Equal Amounts"
    },
    "2358": {
        "id": "2358",
        "name": "Maximum Number of Groups Entering a Competition",
        "acceptance": "68.0",
        "difficulty": "Medium",
        "displayText": "2358. Maximum Number of Groups Entering a Competition"
    },
    "2359": {
        "id": "2359",
        "name": "Find Closest Node to Given Two Nodes",
        "acceptance": "45.7",
        "difficulty": "Medium",
        "displayText": "2359. Find Closest Node to Given Two Nodes"
    },
    "2360": {
        "id": "2360",
        "name": "Longest Cycle in a Graph",
        "acceptance": "49.8",
        "difficulty": "Hard",
        "displayText": "2360. Longest Cycle in a Graph"
    },
    "2361": {
        "id": "2361",
        "name": "Minimum Costs Using the Train Line",
        "acceptance": "77.5",
        "difficulty": "Hard",
        "displayText": "2361. Minimum Costs Using the Train Line"
    },
    "2362": {
        "id": "2362",
        "name": "Generate the Invoice",
        "acceptance": "76.2",
        "difficulty": "Hard",
        "displayText": "2362. Generate the Invoice"
    },
    "2363": {
        "id": "2363",
        "name": "Merge Similar Items",
        "acceptance": "76.6",
        "difficulty": "Easy",
        "displayText": "2363. Merge Similar Items"
    },
    "2364": {
        "id": "2364",
        "name": "Count Number of Bad Pairs",
        "acceptance": "54.5",
        "difficulty": "Medium",
        "displayText": "2364. Count Number of Bad Pairs"
    },
    "2365": {
        "id": "2365",
        "name": "Task Scheduler II",
        "acceptance": "53.8",
        "difficulty": "Medium",
        "displayText": "2365. Task Scheduler II"
    },
    "2366": {
        "id": "2366",
        "name": "Minimum Replacements to Sort the Array",
        "acceptance": "53.3",
        "difficulty": "Hard",
        "displayText": "2366. Minimum Replacements to Sort the Array"
    },
    "2367": {
        "id": "2367",
        "name": "Number of Arithmetic Triplets",
        "acceptance": "84.8",
        "difficulty": "Easy",
        "displayText": "2367. Number of Arithmetic Triplets"
    },
    "2368": {
        "id": "2368",
        "name": "Reachable Nodes With Restrictions",
        "acceptance": "59.3",
        "difficulty": "Medium",
        "displayText": "2368. Reachable Nodes With Restrictions"
    },
    "2369": {
        "id": "2369",
        "name": "Check if There is a Valid Partition For The Array",
        "acceptance": "51.9",
        "difficulty": "Medium",
        "displayText": "2369. Check if There is a Valid Partition For The Array"
    },
    "2370": {
        "id": "2370",
        "name": "Longest Ideal Subsequence",
        "acceptance": "46.9",
        "difficulty": "Medium",
        "displayText": "2370. Longest Ideal Subsequence"
    },
    "2371": {
        "id": "2371",
        "name": "Minimize Maximum Value in a Grid",
        "acceptance": "70.7",
        "difficulty": "Hard",
        "displayText": "2371. Minimize Maximum Value in a Grid"
    },
    "2372": {
        "id": "2372",
        "name": "Calculate the Influence of Each Salesperson",
        "acceptance": "83.6",
        "difficulty": "Medium",
        "displayText": "2372. Calculate the Influence of Each Salesperson"
    },
    "2373": {
        "id": "2373",
        "name": "Largest Local Values in a Matrix",
        "acceptance": "87.8",
        "difficulty": "Easy",
        "displayText": "2373. Largest Local Values in a Matrix"
    },
    "2374": {
        "id": "2374",
        "name": "Node With Highest Edge Score",
        "acceptance": "48.3",
        "difficulty": "Medium",
        "displayText": "2374. Node With Highest Edge Score"
    },
    "2375": {
        "id": "2375",
        "name": "Construct Smallest Number From DI String",
        "acceptance": "85.8",
        "difficulty": "Medium",
        "displayText": "2375. Construct Smallest Number From DI String"
    },
    "2376": {
        "id": "2376",
        "name": "Count Special Integers",
        "acceptance": "39.5",
        "difficulty": "Hard",
        "displayText": "2376. Count Special Integers"
    },
    "2377": {
        "id": "2377",
        "name": "Sort the Olympic Table",
        "acceptance": "79.5",
        "difficulty": "Easy",
        "displayText": "2377. Sort the Olympic Table"
    },
    "2378": {
        "id": "2378",
        "name": "Choose Edges to Maximize Score in a Tree",
        "acceptance": "56.1",
        "difficulty": "Medium",
        "displayText": "2378. Choose Edges to Maximize Score in a Tree"
    },
    "2379": {
        "id": "2379",
        "name": "Minimum Recolors to Get K Consecutive Black Blocks",
        "acceptance": "68.5",
        "difficulty": "Easy",
        "displayText": "2379. Minimum Recolors to Get K Consecutive Black Blocks"
    },
    "2380": {
        "id": "2380",
        "name": "Time Needed to Rearrange a Binary String",
        "acceptance": "51.4",
        "difficulty": "Medium",
        "displayText": "2380. Time Needed to Rearrange a Binary String"
    },
    "2381": {
        "id": "2381",
        "name": "Shifting Letters II",
        "acceptance": "53.2",
        "difficulty": "Medium",
        "displayText": "2381. Shifting Letters II"
    },
    "2382": {
        "id": "2382",
        "name": "Maximum Segment Sum After Removals",
        "acceptance": "48.1",
        "difficulty": "Hard",
        "displayText": "2382. Maximum Segment Sum After Removals"
    },
    "2383": {
        "id": "2383",
        "name": "Minimum Hours of Training to Win a Competition",
        "acceptance": "41.7",
        "difficulty": "Easy",
        "displayText": "2383. Minimum Hours of Training to Win a Competition"
    },
    "2384": {
        "id": "2384",
        "name": "Largest Palindromic Number",
        "acceptance": "36.3",
        "difficulty": "Medium",
        "displayText": "2384. Largest Palindromic Number"
    },
    "2385": {
        "id": "2385",
        "name": "Amount of Time for Binary Tree to Be Infected",
        "acceptance": "63.3",
        "difficulty": "Medium",
        "displayText": "2385. Amount of Time for Binary Tree to Be Infected"
    },
    "2386": {
        "id": "2386",
        "name": "Find the K-Sum of an Array",
        "acceptance": "39.4",
        "difficulty": "Hard",
        "displayText": "2386. Find the K-Sum of an Array"
    },
    "2387": {
        "id": "2387",
        "name": "Median of a Row Wise Sorted Matrix",
        "acceptance": "69.4",
        "difficulty": "Medium",
        "displayText": "2387. Median of a Row Wise Sorted Matrix"
    },
    "2388": {
        "id": "2388",
        "name": "Change Null Values in a Table to the Previous Value",
        "acceptance": "51.4",
        "difficulty": "Medium",
        "displayText": "2388. Change Null Values in a Table to the Previous Value"
    },
    "2389": {
        "id": "2389",
        "name": "Longest Subsequence With Limited Sum",
        "acceptance": "72.6",
        "difficulty": "Easy",
        "displayText": "2389. Longest Subsequence With Limited Sum"
    },
    "2390": {
        "id": "2390",
        "name": "Removing Stars From a String",
        "acceptance": "77.6",
        "difficulty": "Medium",
        "displayText": "2390. Removing Stars From a String"
    },
    "2391": {
        "id": "2391",
        "name": "Minimum Amount of Time to Collect Garbage",
        "acceptance": "85.1",
        "difficulty": "Medium",
        "displayText": "2391. Minimum Amount of Time to Collect Garbage"
    },
    "2392": {
        "id": "2392",
        "name": "Build a Matrix With Conditions",
        "acceptance": "79.2",
        "difficulty": "Hard",
        "displayText": "2392. Build a Matrix With Conditions"
    },
    "2393": {
        "id": "2393",
        "name": "Count Strictly Increasing Subarrays",
        "acceptance": "71.2",
        "difficulty": "Medium",
        "displayText": "2393. Count Strictly Increasing Subarrays"
    },
    "2394": {
        "id": "2394",
        "name": "Employees With Deductions",
        "acceptance": "41.9",
        "difficulty": "Medium",
        "displayText": "2394. Employees With Deductions"
    },
    "2395": {
        "id": "2395",
        "name": "Find Subarrays With Equal Sum",
        "acceptance": "66.1",
        "difficulty": "Easy",
        "displayText": "2395. Find Subarrays With Equal Sum"
    },
    "2396": {
        "id": "2396",
        "name": "Strictly Palindromic Number",
        "acceptance": "88.0",
        "difficulty": "Medium",
        "displayText": "2396. Strictly Palindromic Number"
    },
    "2397": {
        "id": "2397",
        "name": "Maximum Rows Covered by Columns",
        "acceptance": "56.2",
        "difficulty": "Medium",
        "displayText": "2397. Maximum Rows Covered by Columns"
    },
    "2398": {
        "id": "2398",
        "name": "Maximum Number of Robots Within Budget",
        "acceptance": "36.4",
        "difficulty": "Hard",
        "displayText": "2398. Maximum Number of Robots Within Budget"
    },
    "2399": {
        "id": "2399",
        "name": "Check Distances Between Same Letters",
        "acceptance": "70.7",
        "difficulty": "Easy",
        "displayText": "2399. Check Distances Between Same Letters"
    },
    "2400": {
        "id": "2400",
        "name": "Number of Ways to Reach a Position After Exactly k Steps",
        "acceptance": "36.0",
        "difficulty": "Medium",
        "displayText": "2400. Number of Ways to Reach a Position After Exactly k Steps"
    },
    "2401": {
        "id": "2401",
        "name": "Longest Nice Subarray",
        "acceptance": "64.8",
        "difficulty": "Medium",
        "displayText": "2401. Longest Nice Subarray"
    },
    "2402": {
        "id": "2402",
        "name": "Meeting Rooms III",
        "acceptance": "43.9",
        "difficulty": "Hard",
        "displayText": "2402. Meeting Rooms III"
    },
    "2403": {
        "id": "2403",
        "name": "Minimum Time to Kill All Monsters",
        "acceptance": "55.8",
        "difficulty": "Hard",
        "displayText": "2403. Minimum Time to Kill All Monsters"
    },
    "2404": {
        "id": "2404",
        "name": "Most Frequent Even Element",
        "acceptance": "51.5",
        "difficulty": "Easy",
        "displayText": "2404. Most Frequent Even Element"
    },
    "2405": {
        "id": "2405",
        "name": "Optimal Partition of String",
        "acceptance": "78.2",
        "difficulty": "Medium",
        "displayText": "2405. Optimal Partition of String"
    },
    "2406": {
        "id": "2406",
        "name": "Divide Intervals Into Minimum Number of Groups",
        "acceptance": "63.7",
        "difficulty": "Medium",
        "displayText": "2406. Divide Intervals Into Minimum Number of Groups"
    },
    "2407": {
        "id": "2407",
        "name": "Longest Increasing Subsequence II",
        "acceptance": "25.4",
        "difficulty": "Hard",
        "displayText": "2407. Longest Increasing Subsequence II"
    },
    "2408": {
        "id": "2408",
        "name": "Design SQL",
        "acceptance": "71.4",
        "difficulty": "Medium",
        "displayText": "2408. Design SQL"
    },
    "2409": {
        "id": "2409",
        "name": "Count Days Spent Together",
        "acceptance": "46.2",
        "difficulty": "Easy",
        "displayText": "2409. Count Days Spent Together"
    },
    "2410": {
        "id": "2410",
        "name": "Maximum Matching of Players With Trainers",
        "acceptance": "66.5",
        "difficulty": "Medium",
        "displayText": "2410. Maximum Matching of Players With Trainers"
    },
    "2411": {
        "id": "2411",
        "name": "Smallest Subarrays With Maximum Bitwise OR",
        "acceptance": "44.9",
        "difficulty": "Medium",
        "displayText": "2411. Smallest Subarrays With Maximum Bitwise OR"
    },
    "2412": {
        "id": "2412",
        "name": "Minimum Money Required Before Transactions",
        "acceptance": "40.9",
        "difficulty": "Hard",
        "displayText": "2412. Minimum Money Required Before Transactions"
    },
    "2413": {
        "id": "2413",
        "name": "Smallest Even Multiple",
        "acceptance": "88.0",
        "difficulty": "Easy",
        "displayText": "2413. Smallest Even Multiple"
    },
    "2414": {
        "id": "2414",
        "name": "Length of the Longest Alphabetical Continuous Substring",
        "acceptance": "59.1",
        "difficulty": "Medium",
        "displayText": "2414. Length of the Longest Alphabetical Continuous Substring"
    },
    "2415": {
        "id": "2415",
        "name": "Reverse Odd Levels of Binary Tree",
        "acceptance": "86.6",
        "difficulty": "Medium",
        "displayText": "2415. Reverse Odd Levels of Binary Tree"
    },
    "2416": {
        "id": "2416",
        "name": "Sum of Prefix Scores of Strings",
        "acceptance": "60.7",
        "difficulty": "Hard",
        "displayText": "2416. Sum of Prefix Scores of Strings"
    },
    "2417": {
        "id": "2417",
        "name": "Closest Fair Integer",
        "acceptance": "45.0",
        "difficulty": "Medium",
        "displayText": "2417. Closest Fair Integer"
    },
    "2418": {
        "id": "2418",
        "name": "Sort the People",
        "acceptance": "84.8",
        "difficulty": "Easy",
        "displayText": "2418. Sort the People"
    },
    "2419": {
        "id": "2419",
        "name": "Longest Subarray With Maximum Bitwise AND",
        "acceptance": "61.8",
        "difficulty": "Medium",
        "displayText": "2419. Longest Subarray With Maximum Bitwise AND"
    },
    "2420": {
        "id": "2420",
        "name": "Find All Good Indices",
        "acceptance": "39.6",
        "difficulty": "Medium",
        "displayText": "2420. Find All Good Indices"
    },
    "2421": {
        "id": "2421",
        "name": "Number of Good Paths",
        "acceptance": "55.9",
        "difficulty": "Hard",
        "displayText": "2421. Number of Good Paths"
    },
    "2422": {
        "id": "2422",
        "name": "Merge Operations to Turn Array Into a Palindrome",
        "acceptance": "69.0",
        "difficulty": "Medium",
        "displayText": "2422. Merge Operations to Turn Array Into a Palindrome"
    },
    "2423": {
        "id": "2423",
        "name": "Remove Letter To Equalize Frequency",
        "acceptance": "18.0",
        "difficulty": "Easy",
        "displayText": "2423. Remove Letter To Equalize Frequency"
    },
    "2424": {
        "id": "2424",
        "name": "Longest Uploaded Prefix",
        "acceptance": "56.3",
        "difficulty": "Medium",
        "displayText": "2424. Longest Uploaded Prefix"
    },
    "2425": {
        "id": "2425",
        "name": "Bitwise XOR of All Pairings",
        "acceptance": "67.0",
        "difficulty": "Medium",
        "displayText": "2425. Bitwise XOR of All Pairings"
    },
    "2426": {
        "id": "2426",
        "name": "Number of Pairs Satisfying Inequality",
        "acceptance": "45.1",
        "difficulty": "Hard",
        "displayText": "2426. Number of Pairs Satisfying Inequality"
    },
    "2427": {
        "id": "2427",
        "name": "Number of Common Factors",
        "acceptance": "79.4",
        "difficulty": "Easy",
        "displayText": "2427. Number of Common Factors"
    },
    "2428": {
        "id": "2428",
        "name": "Maximum Sum of an Hourglass",
        "acceptance": "75.8",
        "difficulty": "Medium",
        "displayText": "2428. Maximum Sum of an Hourglass"
    },
    "2429": {
        "id": "2429",
        "name": "Minimize XOR",
        "acceptance": "62.4",
        "difficulty": "Medium",
        "displayText": "2429. Minimize XOR"
    },
    "2430": {
        "id": "2430",
        "name": "Maximum Deletions on a String",
        "acceptance": "34.4",
        "difficulty": "Hard",
        "displayText": "2430. Maximum Deletions on a String"
    },
    "2431": {
        "id": "2431",
        "name": "Maximize Total Tastiness of Purchased Fruits",
        "acceptance": "64.3",
        "difficulty": "Medium",
        "displayText": "2431. Maximize Total Tastiness of Purchased Fruits"
    },
    "2432": {
        "id": "2432",
        "name": "The Employee That Worked on the Longest Task",
        "acceptance": "50.4",
        "difficulty": "Easy",
        "displayText": "2432. The Employee That Worked on the Longest Task"
    },
    "2433": {
        "id": "2433",
        "name": "Find The Original Array of Prefix Xor",
        "acceptance": "88.1",
        "difficulty": "Medium",
        "displayText": "2433. Find The Original Array of Prefix Xor"
    },
    "2434": {
        "id": "2434",
        "name": "Using a Robot to Print the Lexicographically Smallest String",
        "acceptance": "41.4",
        "difficulty": "Medium",
        "displayText": "2434. Using a Robot to Print the Lexicographically Smallest String"
    },
    "2435": {
        "id": "2435",
        "name": "Paths in Matrix Whose Sum Is Divisible by K",
        "acceptance": "43.9",
        "difficulty": "Hard",
        "displayText": "2435. Paths in Matrix Whose Sum Is Divisible by K"
    },
    "2436": {
        "id": "2436",
        "name": "Minimum Split Into Subarrays With GCD Greater Than One",
        "acceptance": "70.0",
        "difficulty": "Medium",
        "displayText": "2436. Minimum Split Into Subarrays With GCD Greater Than One"
    },
    "2437": {
        "id": "2437",
        "name": "Number of Valid Clock Times",
        "acceptance": "47.3",
        "difficulty": "Easy",
        "displayText": "2437. Number of Valid Clock Times"
    },
    "2438": {
        "id": "2438",
        "name": "Range Product Queries of Powers",
        "acceptance": "41.7",
        "difficulty": "Medium",
        "displayText": "2438. Range Product Queries of Powers"
    },
    "2439": {
        "id": "2439",
        "name": "Minimize Maximum of Array",
        "acceptance": "46.4",
        "difficulty": "Medium",
        "displayText": "2439. Minimize Maximum of Array"
    },
    "2440": {
        "id": "2440",
        "name": "Create Components With Same Value",
        "acceptance": "51.9",
        "difficulty": "Hard",
        "displayText": "2440. Create Components With Same Value"
    },
    "2441": {
        "id": "2441",
        "name": "Largest Positive Integer That Exists With Its Negative",
        "acceptance": "74.7",
        "difficulty": "Easy",
        "displayText": "2441. Largest Positive Integer That Exists With Its Negative"
    },
    "2442": {
        "id": "2442",
        "name": "Count Number of Distinct Integers After Reverse Operations",
        "acceptance": "80.0",
        "difficulty": "Medium",
        "displayText": "2442. Count Number of Distinct Integers After Reverse Operations"
    },
    "2443": {
        "id": "2443",
        "name": "Sum of Number and Its Reverse",
        "acceptance": "48.0",
        "difficulty": "Medium",
        "displayText": "2443. Sum of Number and Its Reverse"
    },
    "2444": {
        "id": "2444",
        "name": "Count Subarrays With Fixed Bounds",
        "acceptance": "67.7",
        "difficulty": "Hard",
        "displayText": "2444. Count Subarrays With Fixed Bounds"
    },
    "2445": {
        "id": "2445",
        "name": "Number of Nodes With Value One",
        "acceptance": "65.6",
        "difficulty": "Medium",
        "displayText": "2445. Number of Nodes With Value One"
    },
    "2446": {
        "id": "2446",
        "name": "Determine if Two Events Have Conflict",
        "acceptance": "52.1",
        "difficulty": "Easy",
        "displayText": "2446. Determine if Two Events Have Conflict"
    },
    "2447": {
        "id": "2447",
        "name": "Number of Subarrays With GCD Equal to K",
        "acceptance": "50.8",
        "difficulty": "Medium",
        "displayText": "2447. Number of Subarrays With GCD Equal to K"
    },
    "2448": {
        "id": "2448",
        "name": "Minimum Cost to Make Array Equal",
        "acceptance": "46.2",
        "difficulty": "Hard",
        "displayText": "2448. Minimum Cost to Make Array Equal"
    },
    "2449": {
        "id": "2449",
        "name": "Minimum Number of Operations to Make Arrays Similar",
        "acceptance": "60.2",
        "difficulty": "Hard",
        "displayText": "2449. Minimum Number of Operations to Make Arrays Similar"
    },
    "2450": {
        "id": "2450",
        "name": "Number of Distinct Binary Strings After Applying Operations",
        "acceptance": "63.5",
        "difficulty": "Medium",
        "displayText": "2450. Number of Distinct Binary Strings After Applying Operations"
    },
    "2451": {
        "id": "2451",
        "name": "Odd String Difference",
        "acceptance": "60.9",
        "difficulty": "Easy",
        "displayText": "2451. Odd String Difference"
    },
    "2452": {
        "id": "2452",
        "name": "Words Within Two Edits of Dictionary",
        "acceptance": "61.2",
        "difficulty": "Medium",
        "displayText": "2452. Words Within Two Edits of Dictionary"
    },
    "2453": {
        "id": "2453",
        "name": "Destroy Sequential Targets",
        "acceptance": "40.4",
        "difficulty": "Medium",
        "displayText": "2453. Destroy Sequential Targets"
    },
    "2454": {
        "id": "2454",
        "name": "Next Greater Element IV",
        "acceptance": "39.7",
        "difficulty": "Hard",
        "displayText": "2454. Next Greater Element IV"
    },
    "2455": {
        "id": "2455",
        "name": "Average Value of Even Numbers That Are Divisible by Three",
        "acceptance": "61.2",
        "difficulty": "Easy",
        "displayText": "2455. Average Value of Even Numbers That Are Divisible by Three"
    },
    "2456": {
        "id": "2456",
        "name": "Most Popular Video Creator",
        "acceptance": "44.3",
        "difficulty": "Medium",
        "displayText": "2456. Most Popular Video Creator"
    },
    "2457": {
        "id": "2457",
        "name": "Minimum Addition to Make Integer Beautiful",
        "acceptance": "37.8",
        "difficulty": "Medium",
        "displayText": "2457. Minimum Addition to Make Integer Beautiful"
    },
    "2458": {
        "id": "2458",
        "name": "Height of Binary Tree After Subtree Removal Queries",
        "acceptance": "54.9",
        "difficulty": "Hard",
        "displayText": "2458. Height of Binary Tree After Subtree Removal Queries"
    },
    "2459": {
        "id": "2459",
        "name": "Sort Array by Moving Items to Empty Space",
        "acceptance": "44.6",
        "difficulty": "Hard",
        "displayText": "2459. Sort Array by Moving Items to Empty Space"
    },
    "2460": {
        "id": "2460",
        "name": "Apply Operations to an Array",
        "acceptance": "74.9",
        "difficulty": "Easy",
        "displayText": "2460. Apply Operations to an Array"
    },
    "2461": {
        "id": "2461",
        "name": "Maximum Sum of Distinct Subarrays With Length K",
        "acceptance": "42.7",
        "difficulty": "Medium",
        "displayText": "2461. Maximum Sum of Distinct Subarrays With Length K"
    },
    "2462": {
        "id": "2462",
        "name": "Total Cost to Hire K Workers",
        "acceptance": "43.0",
        "difficulty": "Medium",
        "displayText": "2462. Total Cost to Hire K Workers"
    },
    "2463": {
        "id": "2463",
        "name": "Minimum Total Distance Traveled",
        "acceptance": "59.0",
        "difficulty": "Hard",
        "displayText": "2463. Minimum Total Distance Traveled"
    },
    "2464": {
        "id": "2464",
        "name": "Minimum Subarrays in a Valid Split",
        "acceptance": "54.5",
        "difficulty": "Medium",
        "displayText": "2464. Minimum Subarrays in a Valid Split"
    },
    "2465": {
        "id": "2465",
        "name": "Number of Distinct Averages",
        "acceptance": "58.3",
        "difficulty": "Easy",
        "displayText": "2465. Number of Distinct Averages"
    },
    "2466": {
        "id": "2466",
        "name": "Count Ways To Build Good Strings",
        "acceptance": "59.3",
        "difficulty": "Medium",
        "displayText": "2466. Count Ways To Build Good Strings"
    },
    "2467": {
        "id": "2467",
        "name": "Most Profitable Path in a Tree",
        "acceptance": "67.8",
        "difficulty": "Medium",
        "displayText": "2467. Most Profitable Path in a Tree"
    },
    "2468": {
        "id": "2468",
        "name": "Split Message Based on Limit",
        "acceptance": "42.9",
        "difficulty": "Hard",
        "displayText": "2468. Split Message Based on Limit"
    },
    "2469": {
        "id": "2469",
        "name": "Convert the Temperature",
        "acceptance": "90.1",
        "difficulty": "Easy",
        "displayText": "2469. Convert the Temperature"
    },
    "2470": {
        "id": "2470",
        "name": "Number of Subarrays With LCM Equal to K",
        "acceptance": "39.6",
        "difficulty": "Medium",
        "displayText": "2470. Number of Subarrays With LCM Equal to K"
    },
    "2471": {
        "id": "2471",
        "name": "Minimum Number of Operations to Sort a Binary Tree by Level",
        "acceptance": "74.3",
        "difficulty": "Medium",
        "displayText": "2471. Minimum Number of Operations to Sort a Binary Tree by Level"
    },
    "2472": {
        "id": "2472",
        "name": "Maximum Number of Non-overlapping Palindrome Substrings",
        "acceptance": "41.3",
        "difficulty": "Hard",
        "displayText": "2472. Maximum Number of Non-overlapping Palindrome Substrings"
    },
    "2473": {
        "id": "2473",
        "name": "Minimum Cost to Buy Apples",
        "acceptance": "67.2",
        "difficulty": "Medium",
        "displayText": "2473. Minimum Cost to Buy Apples"
    },
    "2474": {
        "id": "2474",
        "name": "Customers With Strictly Increasing Purchases",
        "acceptance": "48.0",
        "difficulty": "Hard",
        "displayText": "2474. Customers With Strictly Increasing Purchases"
    },
    "2475": {
        "id": "2475",
        "name": "Number of Unequal Triplets in Array",
        "acceptance": "72.4",
        "difficulty": "Easy",
        "displayText": "2475. Number of Unequal Triplets in Array"
    },
    "2476": {
        "id": "2476",
        "name": "Closest Nodes Queries in a Binary Search Tree",
        "acceptance": "42.2",
        "difficulty": "Medium",
        "displayText": "2476. Closest Nodes Queries in a Binary Search Tree"
    },
    "2477": {
        "id": "2477",
        "name": "Minimum Fuel Cost to Report to the Capital",
        "acceptance": "64.3",
        "difficulty": "Medium",
        "displayText": "2477. Minimum Fuel Cost to Report to the Capital"
    },
    "2478": {
        "id": "2478",
        "name": "Number of Beautiful Partitions",
        "acceptance": "32.0",
        "difficulty": "Hard",
        "displayText": "2478. Number of Beautiful Partitions"
    },
    "2479": {
        "id": "2479",
        "name": "Maximum XOR of Two Non-Overlapping Subtrees",
        "acceptance": "49.5",
        "difficulty": "Hard",
        "displayText": "2479. Maximum XOR of Two Non-Overlapping Subtrees"
    },
    "2480": {
        "id": "2480",
        "name": "Form a Chemical Bond",
        "acceptance": "78.6",
        "difficulty": "Easy",
        "displayText": "2480. Form a Chemical Bond"
    },
    "2481": {
        "id": "2481",
        "name": "Minimum Cuts to Divide a Circle",
        "acceptance": "54.9",
        "difficulty": "Easy",
        "displayText": "2481. Minimum Cuts to Divide a Circle"
    },
    "2482": {
        "id": "2482",
        "name": "Difference Between Ones and Zeros in Row and Column",
        "acceptance": "84.3",
        "difficulty": "Medium",
        "displayText": "2482. Difference Between Ones and Zeros in Row and Column"
    },
    "2483": {
        "id": "2483",
        "name": "Minimum Penalty for a Shop",
        "acceptance": "67.5",
        "difficulty": "Medium",
        "displayText": "2483. Minimum Penalty for a Shop"
    },
    "2484": {
        "id": "2484",
        "name": "Count Palindromic Subsequences",
        "acceptance": "39.0",
        "difficulty": "Hard",
        "displayText": "2484. Count Palindromic Subsequences"
    },
    "2485": {
        "id": "2485",
        "name": "Find the Pivot Integer",
        "acceptance": "83.7",
        "difficulty": "Easy",
        "displayText": "2485. Find the Pivot Integer"
    },
    "2486": {
        "id": "2486",
        "name": "Append Characters to String to Make Subsequence",
        "acceptance": "73.0",
        "difficulty": "Medium",
        "displayText": "2486. Append Characters to String to Make Subsequence"
    },
    "2487": {
        "id": "2487",
        "name": "Remove Nodes From Linked List",
        "acceptance": "74.3",
        "difficulty": "Medium",
        "displayText": "2487. Remove Nodes From Linked List"
    },
    "2488": {
        "id": "2488",
        "name": "Count Subarrays With Median K",
        "acceptance": "45.0",
        "difficulty": "Hard",
        "displayText": "2488. Count Subarrays With Median K"
    },
    "2489": {
        "id": "2489",
        "name": "Number of Substrings With Fixed Ratio",
        "acceptance": "55.5",
        "difficulty": "Medium",
        "displayText": "2489. Number of Substrings With Fixed Ratio"
    },
    "2490": {
        "id": "2490",
        "name": "Circular Sentence",
        "acceptance": "70.5",
        "difficulty": "Easy",
        "displayText": "2490. Circular Sentence"
    },
    "2491": {
        "id": "2491",
        "name": "Divide Players Into Teams of Equal Skill",
        "acceptance": "69.0",
        "difficulty": "Medium",
        "displayText": "2491. Divide Players Into Teams of Equal Skill"
    },
    "2492": {
        "id": "2492",
        "name": "Minimum Score of a Path Between Two Cities",
        "acceptance": "57.7",
        "difficulty": "Medium",
        "displayText": "2492. Minimum Score of a Path Between Two Cities"
    },
    "2493": {
        "id": "2493",
        "name": "Divide Nodes Into the Maximum Number of Groups",
        "acceptance": "67.5",
        "difficulty": "Hard",
        "displayText": "2493. Divide Nodes Into the Maximum Number of Groups"
    },
    "2494": {
        "id": "2494",
        "name": "Merge Overlapping Events in the Same Hall",
        "acceptance": "34.5",
        "difficulty": "Hard",
        "displayText": "2494. Merge Overlapping Events in the Same Hall"
    },
    "2495": {
        "id": "2495",
        "name": "Number of Subarrays Having Even Product",
        "acceptance": "61.1",
        "difficulty": "Medium",
        "displayText": "2495. Number of Subarrays Having Even Product"
    },
    "2496": {
        "id": "2496",
        "name": "Maximum Value of a String in an Array",
        "acceptance": "73.3",
        "difficulty": "Easy",
        "displayText": "2496. Maximum Value of a String in an Array"
    },
    "2497": {
        "id": "2497",
        "name": "Maximum Star Sum of a Graph",
        "acceptance": "40.6",
        "difficulty": "Medium",
        "displayText": "2497. Maximum Star Sum of a Graph"
    },
    "2498": {
        "id": "2498",
        "name": "Frog Jump II",
        "acceptance": "62.1",
        "difficulty": "Medium",
        "displayText": "2498. Frog Jump II"
    },
    "2499": {
        "id": "2499",
        "name": "Minimum Total Cost to Make Arrays Unequal",
        "acceptance": "40.5",
        "difficulty": "Hard",
        "displayText": "2499. Minimum Total Cost to Make Arrays Unequal"
    },
    "2500": {
        "id": "2500",
        "name": "Delete Greatest Value in Each Row",
        "acceptance": "78.8",
        "difficulty": "Easy",
        "displayText": "2500. Delete Greatest Value in Each Row"
    },
    "2501": {
        "id": "2501",
        "name": "Longest Square Streak in an Array",
        "acceptance": "53.1",
        "difficulty": "Medium",
        "displayText": "2501. Longest Square Streak in an Array"
    },
    "2502": {
        "id": "2502",
        "name": "Design Memory Allocator",
        "acceptance": "53.0",
        "difficulty": "Medium",
        "displayText": "2502. Design Memory Allocator"
    },
    "2503": {
        "id": "2503",
        "name": "Maximum Number of Points From Grid Queries",
        "acceptance": "59.6",
        "difficulty": "Hard",
        "displayText": "2503. Maximum Number of Points From Grid Queries"
    },
    "2504": {
        "id": "2504",
        "name": "Concatenate the Name and the Profession",
        "acceptance": "78.7",
        "difficulty": "Easy",
        "displayText": "2504. Concatenate the Name and the Profession"
    },
    "2505": {
        "id": "2505",
        "name": "Bitwise OR of All Subsequence Sums",
        "acceptance": "64.9",
        "difficulty": "Medium",
        "displayText": "2505. Bitwise OR of All Subsequence Sums"
    },
    "2506": {
        "id": "2506",
        "name": "Count Pairs Of Similar Strings",
        "acceptance": "72.2",
        "difficulty": "Easy",
        "displayText": "2506. Count Pairs Of Similar Strings"
    },
    "2507": {
        "id": "2507",
        "name": "Smallest Value After Replacing With Sum of Prime Factors",
        "acceptance": "49.0",
        "difficulty": "Medium",
        "displayText": "2507. Smallest Value After Replacing With Sum of Prime Factors"
    },
    "2508": {
        "id": "2508",
        "name": "Add Edges to Make Degrees of All Nodes Even",
        "acceptance": "33.3",
        "difficulty": "Hard",
        "displayText": "2508. Add Edges to Make Degrees of All Nodes Even"
    },
    "2509": {
        "id": "2509",
        "name": "Cycle Length Queries in a Tree",
        "acceptance": "57.9",
        "difficulty": "Hard",
        "displayText": "2509. Cycle Length Queries in a Tree"
    },
    "2510": {
        "id": "2510",
        "name": "Check if There is a Path With Equal Number of 0's And 1's",
        "acceptance": "51.3",
        "difficulty": "Medium",
        "displayText": "2510. Check if There is a Path With Equal Number of 0's And 1's"
    },
    "2511": {
        "id": "2511",
        "name": "Maximum Enemy Forts That Can Be Captured",
        "acceptance": "39.8",
        "difficulty": "Easy",
        "displayText": "2511. Maximum Enemy Forts That Can Be Captured"
    },
    "2512": {
        "id": "2512",
        "name": "Reward Top K Students",
        "acceptance": "45.7",
        "difficulty": "Medium",
        "displayText": "2512. Reward Top K Students"
    },
    "2513": {
        "id": "2513",
        "name": "Minimize the Maximum of Two Arrays",
        "acceptance": "31.1",
        "difficulty": "Medium",
        "displayText": "2513. Minimize the Maximum of Two Arrays"
    },
    "2514": {
        "id": "2514",
        "name": "Count Anagrams",
        "acceptance": "34.8",
        "difficulty": "Hard",
        "displayText": "2514. Count Anagrams"
    },
    "2515": {
        "id": "2515",
        "name": "Shortest Distance to Target String in a Circular Array",
        "acceptance": "50.3",
        "difficulty": "Easy",
        "displayText": "2515. Shortest Distance to Target String in a Circular Array"
    },
    "2516": {
        "id": "2516",
        "name": "Take K of Each Character From Left and Right",
        "acceptance": "51.7",
        "difficulty": "Medium",
        "displayText": "2516. Take K of Each Character From Left and Right"
    },
    "2517": {
        "id": "2517",
        "name": "Maximum Tastiness of Candy Basket",
        "acceptance": "65.7",
        "difficulty": "Medium",
        "displayText": "2517. Maximum Tastiness of Candy Basket"
    },
    "2518": {
        "id": "2518",
        "name": "Number of Great Partitions",
        "acceptance": "32.2",
        "difficulty": "Hard",
        "displayText": "2518. Number of Great Partitions"
    },
    "2519": {
        "id": "2519",
        "name": "Count the Number of K-Big Indices",
        "acceptance": "53.1",
        "difficulty": "Hard",
        "displayText": "2519. Count the Number of K-Big Indices"
    },
    "2520": {
        "id": "2520",
        "name": "Count the Digits That Divide a Number",
        "acceptance": "85.6",
        "difficulty": "Easy",
        "displayText": "2520. Count the Digits That Divide a Number"
    },
    "2521": {
        "id": "2521",
        "name": "Distinct Prime Factors of Product of Array",
        "acceptance": "52.6",
        "difficulty": "Medium",
        "displayText": "2521. Distinct Prime Factors of Product of Array"
    },
    "2522": {
        "id": "2522",
        "name": "Partition String Into Substrings With Values at Most K",
        "acceptance": "46.4",
        "difficulty": "Medium",
        "displayText": "2522. Partition String Into Substrings With Values at Most K"
    },
    "2523": {
        "id": "2523",
        "name": "Closest Prime Numbers in Range",
        "acceptance": "51.5",
        "difficulty": "Medium",
        "displayText": "2523. Closest Prime Numbers in Range"
    },
    "2524": {
        "id": "2524",
        "name": "Maximum Frequency Score of a Subarray",
        "acceptance": "34.5",
        "difficulty": "Hard",
        "displayText": "2524. Maximum Frequency Score of a Subarray"
    },
    "2525": {
        "id": "2525",
        "name": "Categorize Box According to Criteria",
        "acceptance": "37.2",
        "difficulty": "Easy",
        "displayText": "2525. Categorize Box According to Criteria"
    },
    "2526": {
        "id": "2526",
        "name": "Find Consecutive Integers from a Data Stream",
        "acceptance": "50.5",
        "difficulty": "Medium",
        "displayText": "2526. Find Consecutive Integers from a Data Stream"
    },
    "2527": {
        "id": "2527",
        "name": "Find Xor-Beauty of Array",
        "acceptance": "69.0",
        "difficulty": "Medium",
        "displayText": "2527. Find Xor-Beauty of Array"
    },
    "2528": {
        "id": "2528",
        "name": "Maximize the Minimum Powered City",
        "acceptance": "32.9",
        "difficulty": "Hard",
        "displayText": "2528. Maximize the Minimum Powered City"
    },
    "2529": {
        "id": "2529",
        "name": "Maximum Count of Positive Integer and Negative Integer",
        "acceptance": "74.5",
        "difficulty": "Easy",
        "displayText": "2529. Maximum Count of Positive Integer and Negative Integer"
    },
    "2530": {
        "id": "2530",
        "name": "Maximal Score After Applying K Operations",
        "acceptance": "63.8",
        "difficulty": "Medium",
        "displayText": "2530. Maximal Score After Applying K Operations"
    },
    "2531": {
        "id": "2531",
        "name": "Make Number of Distinct Characters Equal",
        "acceptance": "26.8",
        "difficulty": "Medium",
        "displayText": "2531. Make Number of Distinct Characters Equal"
    },
    "2532": {
        "id": "2532",
        "name": "Time to Cross a Bridge",
        "acceptance": "43.4",
        "difficulty": "Hard",
        "displayText": "2532. Time to Cross a Bridge"
    },
    "2533": {
        "id": "2533",
        "name": "Number of Good Binary Strings",
        "acceptance": "52.4",
        "difficulty": "Medium",
        "displayText": "2533. Number of Good Binary Strings"
    },
    "2534": {
        "id": "2534",
        "name": "Time Taken to Cross the Door",
        "acceptance": "48.9",
        "difficulty": "Hard",
        "displayText": "2534. Time Taken to Cross the Door"
    },
    "2535": {
        "id": "2535",
        "name": "Difference Between Element Sum and Digit Sum of an Array",
        "acceptance": "84.7",
        "difficulty": "Easy",
        "displayText": "2535. Difference Between Element Sum and Digit Sum of an Array"
    },
    "2536": {
        "id": "2536",
        "name": "Increment Submatrices by One",
        "acceptance": "51.3",
        "difficulty": "Medium",
        "displayText": "2536. Increment Submatrices by One"
    },
    "2537": {
        "id": "2537",
        "name": "Count the Number of Good Subarrays",
        "acceptance": "53.0",
        "difficulty": "Medium",
        "displayText": "2537. Count the Number of Good Subarrays"
    },
    "2538": {
        "id": "2538",
        "name": "Difference Between Maximum and Minimum Price Sum",
        "acceptance": "31.6",
        "difficulty": "Hard",
        "displayText": "2538. Difference Between Maximum and Minimum Price Sum"
    },
    "2539": {
        "id": "2539",
        "name": "Count the Number of Good Subsequences",
        "acceptance": "51.3",
        "difficulty": "Medium",
        "displayText": "2539. Count the Number of Good Subsequences"
    },
    "2540": {
        "id": "2540",
        "name": "Minimum Common Value",
        "acceptance": "58.3",
        "difficulty": "Easy",
        "displayText": "2540. Minimum Common Value"
    },
    "2541": {
        "id": "2541",
        "name": "Minimum Operations to Make Array Equal II",
        "acceptance": "32.2",
        "difficulty": "Medium",
        "displayText": "2541. Minimum Operations to Make Array Equal II"
    },
    "2542": {
        "id": "2542",
        "name": "Maximum Subsequence Score",
        "acceptance": "54.2",
        "difficulty": "Medium",
        "displayText": "2542. Maximum Subsequence Score"
    },
    "2543": {
        "id": "2543",
        "name": "Check if Point Is Reachable",
        "acceptance": "43.1",
        "difficulty": "Hard",
        "displayText": "2543. Check if Point Is Reachable"
    },
    "2544": {
        "id": "2544",
        "name": "Alternating Digit Sum",
        "acceptance": "68.4",
        "difficulty": "Easy",
        "displayText": "2544. Alternating Digit Sum"
    },
    "2545": {
        "id": "2545",
        "name": "Sort the Students by Their Kth Score",
        "acceptance": "85.6",
        "difficulty": "Medium",
        "displayText": "2545. Sort the Students by Their Kth Score"
    },
    "2546": {
        "id": "2546",
        "name": "Apply Bitwise Operations to Make Strings Equal",
        "acceptance": "41.5",
        "difficulty": "Medium",
        "displayText": "2546. Apply Bitwise Operations to Make Strings Equal"
    },
    "2547": {
        "id": "2547",
        "name": "Minimum Cost to Split an Array",
        "acceptance": "41.8",
        "difficulty": "Hard",
        "displayText": "2547. Minimum Cost to Split an Array"
    },
    "2548": {
        "id": "2548",
        "name": "Maximum Price to Fill a Bag",
        "acceptance": "63.5",
        "difficulty": "Medium",
        "displayText": "2548. Maximum Price to Fill a Bag"
    },
    "2549": {
        "id": "2549",
        "name": "Count Distinct Numbers on Board",
        "acceptance": "61.2",
        "difficulty": "Easy",
        "displayText": "2549. Count Distinct Numbers on Board"
    },
    "2550": {
        "id": "2550",
        "name": "Count Collisions of Monkeys on a Polygon",
        "acceptance": "28.7",
        "difficulty": "Medium",
        "displayText": "2550. Count Collisions of Monkeys on a Polygon"
    },
    "2551": {
        "id": "2551",
        "name": "Put Marbles in Bags",
        "acceptance": "72.6",
        "difficulty": "Hard",
        "displayText": "2551. Put Marbles in Bags"
    },
    "2552": {
        "id": "2552",
        "name": "Count Increasing Quadruplets",
        "acceptance": "34.0",
        "difficulty": "Hard",
        "displayText": "2552. Count Increasing Quadruplets"
    },
    "2553": {
        "id": "2553",
        "name": "Separate the Digits in an Array",
        "acceptance": "80.1",
        "difficulty": "Easy",
        "displayText": "2553. Separate the Digits in an Array"
    },
    "2554": {
        "id": "2554",
        "name": "Maximum Number of Integers to Choose From a Range I",
        "acceptance": "67.9",
        "difficulty": "Medium",
        "displayText": "2554. Maximum Number of Integers to Choose From a Range I"
    },
    "2555": {
        "id": "2555",
        "name": "Maximize Win From Two Segments",
        "acceptance": "34.8",
        "difficulty": "Medium",
        "displayText": "2555. Maximize Win From Two Segments"
    },
    "2556": {
        "id": "2556",
        "name": "Disconnect Path in a Binary Matrix by at Most One Flip",
        "acceptance": "27.2",
        "difficulty": "Medium",
        "displayText": "2556. Disconnect Path in a Binary Matrix by at Most One Flip"
    },
    "2557": {
        "id": "2557",
        "name": "Maximum Number of Integers to Choose From a Range II",
        "acceptance": "35.2",
        "difficulty": "Medium",
        "displayText": "2557. Maximum Number of Integers to Choose From a Range II"
    },
    "2558": {
        "id": "2558",
        "name": "Take Gifts From the Richest Pile",
        "acceptance": "75.7",
        "difficulty": "Easy",
        "displayText": "2558. Take Gifts From the Richest Pile"
    },
    "2559": {
        "id": "2559",
        "name": "Count Vowel Strings in Ranges",
        "acceptance": "67.9",
        "difficulty": "Medium",
        "displayText": "2559. Count Vowel Strings in Ranges"
    },
    "2560": {
        "id": "2560",
        "name": "House Robber IV",
        "acceptance": "65.2",
        "difficulty": "Medium",
        "displayText": "2560. House Robber IV"
    },
    "2561": {
        "id": "2561",
        "name": "Rearranging Fruits",
        "acceptance": "34.9",
        "difficulty": "Hard",
        "displayText": "2561. Rearranging Fruits"
    },
    "2562": {
        "id": "2562",
        "name": "Find the Array Concatenation Value",
        "acceptance": "70.8",
        "difficulty": "Easy",
        "displayText": "2562. Find the Array Concatenation Value"
    },
    "2563": {
        "id": "2563",
        "name": "Count the Number of Fair Pairs",
        "acceptance": "48.8",
        "difficulty": "Medium",
        "displayText": "2563. Count the Number of Fair Pairs"
    },
    "2564": {
        "id": "2564",
        "name": "Substring XOR Queries",
        "acceptance": "34.3",
        "difficulty": "Medium",
        "displayText": "2564. Substring XOR Queries"
    },
    "2565": {
        "id": "2565",
        "name": "Subsequence With the Minimum Score",
        "acceptance": "32.5",
        "difficulty": "Hard",
        "displayText": "2565. Subsequence With the Minimum Score"
    },
    "2566": {
        "id": "2566",
        "name": "Maximum Difference by Remapping a Digit",
        "acceptance": "60.3",
        "difficulty": "Easy",
        "displayText": "2566. Maximum Difference by Remapping a Digit"
    },
    "2567": {
        "id": "2567",
        "name": "Minimum Score by Changing Two Elements",
        "acceptance": "48.7",
        "difficulty": "Medium",
        "displayText": "2567. Minimum Score by Changing Two Elements"
    },
    "2568": {
        "id": "2568",
        "name": "Minimum Impossible OR",
        "acceptance": "57.5",
        "difficulty": "Medium",
        "displayText": "2568. Minimum Impossible OR"
    },
    "2569": {
        "id": "2569",
        "name": "Handling Sum Queries After Update",
        "acceptance": "29.1",
        "difficulty": "Hard",
        "displayText": "2569. Handling Sum Queries After Update"
    },
    "2570": {
        "id": "2570",
        "name": "Merge Two 2D Arrays by Summing Values",
        "acceptance": "82.1",
        "difficulty": "Easy",
        "displayText": "2570. Merge Two 2D Arrays by Summing Values"
    },
    "2571": {
        "id": "2571",
        "name": "Minimum Operations to Reduce an Integer to 0",
        "acceptance": "56.8",
        "difficulty": "Medium",
        "displayText": "2571. Minimum Operations to Reduce an Integer to 0"
    },
    "2572": {
        "id": "2572",
        "name": "Count the Number of Square-Free Subsets",
        "acceptance": "24.7",
        "difficulty": "Medium",
        "displayText": "2572. Count the Number of Square-Free Subsets"
    },
    "2573": {
        "id": "2573",
        "name": "Find the String with LCP",
        "acceptance": "31.2",
        "difficulty": "Hard",
        "displayText": "2573. Find the String with LCP"
    },
    "2574": {
        "id": "2574",
        "name": "Left and Right Sum Differences",
        "acceptance": "87.3",
        "difficulty": "Easy",
        "displayText": "2574. Left and Right Sum Differences"
    },
    "2575": {
        "id": "2575",
        "name": "Find the Divisibility Array of a String",
        "acceptance": "34.4",
        "difficulty": "Medium",
        "displayText": "2575. Find the Divisibility Array of a String"
    },
    "2576": {
        "id": "2576",
        "name": "Find the Maximum Number of Marked Indices",
        "acceptance": "39.7",
        "difficulty": "Medium",
        "displayText": "2576. Find the Maximum Number of Marked Indices"
    },
    "2577": {
        "id": "2577",
        "name": "Minimum Time to Visit a Cell In a Grid",
        "acceptance": "57.0",
        "difficulty": "Hard",
        "displayText": "2577. Minimum Time to Visit a Cell In a Grid"
    },
    "2578": {
        "id": "2578",
        "name": "Split With Minimum Sum",
        "acceptance": "71.9",
        "difficulty": "Easy",
        "displayText": "2578. Split With Minimum Sum"
    },
    "2579": {
        "id": "2579",
        "name": "Count Total Number of Colored Cells",
        "acceptance": "66.2",
        "difficulty": "Medium",
        "displayText": "2579. Count Total Number of Colored Cells"
    },
    "2580": {
        "id": "2580",
        "name": "Count Ways to Group Overlapping Ranges",
        "acceptance": "37.8",
        "difficulty": "Medium",
        "displayText": "2580. Count Ways to Group Overlapping Ranges"
    },
    "2581": {
        "id": "2581",
        "name": "Count Number of Possible Root Nodes",
        "acceptance": "46.0",
        "difficulty": "Hard",
        "displayText": "2581. Count Number of Possible Root Nodes"
    },
    "2582": {
        "id": "2582",
        "name": "Pass the Pillow",
        "acceptance": "56.6",
        "difficulty": "Easy",
        "displayText": "2582. Pass the Pillow"
    },
    "2583": {
        "id": "2583",
        "name": "Kth Largest Sum in a Binary Tree",
        "acceptance": "59.3",
        "difficulty": "Medium",
        "displayText": "2583. Kth Largest Sum in a Binary Tree"
    },
    "2584": {
        "id": "2584",
        "name": "Split the Array to Make Coprime Products",
        "acceptance": "23.2",
        "difficulty": "Hard",
        "displayText": "2584. Split the Array to Make Coprime Products"
    },
    "2585": {
        "id": "2585",
        "name": "Number of Ways to Earn Points",
        "acceptance": "58.4",
        "difficulty": "Hard",
        "displayText": "2585. Number of Ways to Earn Points"
    },
    "2586": {
        "id": "2586",
        "name": "Count the Number of Vowel Strings in Range",
        "acceptance": "73.4",
        "difficulty": "Easy",
        "displayText": "2586. Count the Number of Vowel Strings in Range"
    },
    "2587": {
        "id": "2587",
        "name": "Rearrange Array to Maximize Prefix Score",
        "acceptance": "41.2",
        "difficulty": "Medium",
        "displayText": "2587. Rearrange Array to Maximize Prefix Score"
    },
    "2588": {
        "id": "2588",
        "name": "Count the Number of Beautiful Subarrays",
        "acceptance": "51.4",
        "difficulty": "Medium",
        "displayText": "2588. Count the Number of Beautiful Subarrays"
    },
    "2589": {
        "id": "2589",
        "name": "Minimum Time to Complete All Tasks",
        "acceptance": "37.0",
        "difficulty": "Hard",
        "displayText": "2589. Minimum Time to Complete All Tasks"
    },
    "2590": {
        "id": "2590",
        "name": "Design a Todo List",
        "acceptance": "58.8",
        "difficulty": "Medium",
        "displayText": "2590. Design a Todo List"
    },
    "2591": {
        "id": "2591",
        "name": "Distribute Money to Maximum Children",
        "acceptance": "19.3",
        "difficulty": "Easy",
        "displayText": "2591. Distribute Money to Maximum Children"
    },
    "2592": {
        "id": "2592",
        "name": "Maximize Greatness of an Array",
        "acceptance": "58.1",
        "difficulty": "Medium",
        "displayText": "2592. Maximize Greatness of an Array"
    },
    "2593": {
        "id": "2593",
        "name": "Find Score of an Array After Marking All Elements",
        "acceptance": "64.7",
        "difficulty": "Medium",
        "displayText": "2593. Find Score of an Array After Marking All Elements"
    },
    "2594": {
        "id": "2594",
        "name": "Minimum Time to Repair Cars",
        "acceptance": "60.0",
        "difficulty": "Medium",
        "displayText": "2594. Minimum Time to Repair Cars"
    },
    "2595": {
        "id": "2595",
        "name": "Number of Even and Odd Bits",
        "acceptance": "72.3",
        "difficulty": "Easy",
        "displayText": "2595. Number of Even and Odd Bits"
    },
    "2596": {
        "id": "2596",
        "name": "Check Knight Tour Configuration",
        "acceptance": "57.3",
        "difficulty": "Medium",
        "displayText": "2596. Check Knight Tour Configuration"
    },
    "2597": {
        "id": "2597",
        "name": "The Number of Beautiful Subsets",
        "acceptance": "50.7",
        "difficulty": "Medium",
        "displayText": "2597. The Number of Beautiful Subsets"
    },
    "2598": {
        "id": "2598",
        "name": "Smallest Missing Non-negative Integer After Operations",
        "acceptance": "39.6",
        "difficulty": "Medium",
        "displayText": "2598. Smallest Missing Non-negative Integer After Operations"
    },
    "2599": {
        "id": "2599",
        "name": "Make the Prefix Sum Non-negative",
        "acceptance": "51.6",
        "difficulty": "Medium",
        "displayText": "2599. Make the Prefix Sum Non-negative"
    },
    "2600": {
        "id": "2600",
        "name": "K Items With the Maximum Sum",
        "acceptance": "60.7",
        "difficulty": "Easy",
        "displayText": "2600. K Items With the Maximum Sum"
    },
    "2601": {
        "id": "2601",
        "name": "Prime Subtraction Operation",
        "acceptance": "55.6",
        "difficulty": "Medium",
        "displayText": "2601. Prime Subtraction Operation"
    },
    "2602": {
        "id": "2602",
        "name": "Minimum Operations to Make All Array Elements Equal",
        "acceptance": "36.6",
        "difficulty": "Medium",
        "displayText": "2602. Minimum Operations to Make All Array Elements Equal"
    },
    "2603": {
        "id": "2603",
        "name": "Collect Coins in a Tree",
        "acceptance": "35.5",
        "difficulty": "Hard",
        "displayText": "2603. Collect Coins in a Tree"
    },
    "2604": {
        "id": "2604",
        "name": "Minimum Time to Eat All Grains",
        "acceptance": "39.4",
        "difficulty": "Hard",
        "displayText": "2604. Minimum Time to Eat All Grains"
    },
    "2605": {
        "id": "2605",
        "name": "Form Smallest Number From Two Digit Arrays",
        "acceptance": "54.1",
        "difficulty": "Easy",
        "displayText": "2605. Form Smallest Number From Two Digit Arrays"
    },
    "2606": {
        "id": "2606",
        "name": "Find the Substring With Maximum Cost",
        "acceptance": "56.5",
        "difficulty": "Medium",
        "displayText": "2606. Find the Substring With Maximum Cost"
    },
    "2607": {
        "id": "2607",
        "name": "Make K-Subarray Sums Equal",
        "acceptance": "36.2",
        "difficulty": "Medium",
        "displayText": "2607. Make K-Subarray Sums Equal"
    },
    "2608": {
        "id": "2608",
        "name": "Shortest Cycle in a Graph",
        "acceptance": "37.1",
        "difficulty": "Hard",
        "displayText": "2608. Shortest Cycle in a Graph"
    },
    "2609": {
        "id": "2609",
        "name": "Find the Longest Balanced Substring of a Binary String",
        "acceptance": "45.2",
        "difficulty": "Easy",
        "displayText": "2609. Find the Longest Balanced Substring of a Binary String"
    },
    "2610": {
        "id": "2610",
        "name": "Convert an Array Into a 2D Array With Conditions",
        "acceptance": "86.3",
        "difficulty": "Medium",
        "displayText": "2610. Convert an Array Into a 2D Array With Conditions"
    },
    "2611": {
        "id": "2611",
        "name": "Mice and Cheese",
        "acceptance": "47.0",
        "difficulty": "Medium",
        "displayText": "2611. Mice and Cheese"
    },
    "2612": {
        "id": "2612",
        "name": "Minimum Reverse Operations",
        "acceptance": "16.0",
        "difficulty": "Hard",
        "displayText": "2612. Minimum Reverse Operations"
    },
    "2613": {
        "id": "2613",
        "name": "Beautiful Pairs",
        "acceptance": "40.3",
        "difficulty": "Hard",
        "displayText": "2613. Beautiful Pairs"
    },
    "2614": {
        "id": "2614",
        "name": "Prime In Diagonal",
        "acceptance": "35.9",
        "difficulty": "Easy",
        "displayText": "2614. Prime In Diagonal"
    },
    "2615": {
        "id": "2615",
        "name": "Sum of Distances",
        "acceptance": "31.0",
        "difficulty": "Medium",
        "displayText": "2615. Sum of Distances"
    },
    "2616": {
        "id": "2616",
        "name": "Minimize the Maximum Difference of Pairs",
        "acceptance": "43.7",
        "difficulty": "Medium",
        "displayText": "2616. Minimize the Maximum Difference of Pairs"
    },
    "2617": {
        "id": "2617",
        "name": "Minimum Number of Visited Cells in a Grid",
        "acceptance": "22.5",
        "difficulty": "Hard",
        "displayText": "2617. Minimum Number of Visited Cells in a Grid"
    },
    "2618": {
        "id": "2618",
        "name": "Check if Object Instance of Class",
        "acceptance": "27.9",
        "difficulty": "Medium",
        "displayText": "2618. Check if Object Instance of Class"
    },
    "2619": {
        "id": "2619",
        "name": "Array Prototype Last",
        "acceptance": "74.5",
        "difficulty": "Easy",
        "displayText": "2619. Array Prototype Last"
    },
    "2620": {
        "id": "2620",
        "name": "Counter",
        "acceptance": "82.1",
        "difficulty": "Easy",
        "displayText": "2620. Counter"
    },
    "2621": {
        "id": "2621",
        "name": "Sleep",
        "acceptance": "87.7",
        "difficulty": "Easy",
        "displayText": "2621. Sleep"
    },
    "2622": {
        "id": "2622",
        "name": "Cache With Time Limit",
        "acceptance": "75.6",
        "difficulty": "Medium",
        "displayText": "2622. Cache With Time Limit"
    },
    "2623": {
        "id": "2623",
        "name": "Memoize",
        "acceptance": "63.3",
        "difficulty": "Medium",
        "displayText": "2623. Memoize"
    },
    "2624": {
        "id": "2624",
        "name": "Snail Traversal",
        "acceptance": "67.0",
        "difficulty": "Medium",
        "displayText": "2624. Snail Traversal"
    },
    "2625": {
        "id": "2625",
        "name": "Flatten Deeply Nested Array",
        "acceptance": "64.1",
        "difficulty": "Medium",
        "displayText": "2625. Flatten Deeply Nested Array"
    },
    "2626": {
        "id": "2626",
        "name": "Array Reduce Transformation",
        "acceptance": "85.4",
        "difficulty": "Easy",
        "displayText": "2626. Array Reduce Transformation"
    },
    "2627": {
        "id": "2627",
        "name": "Debounce",
        "acceptance": "91.8",
        "difficulty": "Medium",
        "displayText": "2627. Debounce"
    },
    "2628": {
        "id": "2628",
        "name": "JSON Deep Equal",
        "acceptance": "39.1",
        "difficulty": "Medium",
        "displayText": "2628. JSON Deep Equal"
    },
    "2629": {
        "id": "2629",
        "name": "Function Composition",
        "acceptance": "87.0",
        "difficulty": "Easy",
        "displayText": "2629. Function Composition"
    },
    "2630": {
        "id": "2630",
        "name": "Memoize II",
        "acceptance": "32.2",
        "difficulty": "Hard",
        "displayText": "2630. Memoize II"
    },
    "2631": {
        "id": "2631",
        "name": "Group By",
        "acceptance": "81.1",
        "difficulty": "Medium",
        "displayText": "2631. Group By"
    },
    "2632": {
        "id": "2632",
        "name": "Curry",
        "acceptance": "89.4",
        "difficulty": "Medium",
        "displayText": "2632. Curry"
    },
    "2633": {
        "id": "2633",
        "name": "Convert Object to JSON String",
        "acceptance": "77.9",
        "difficulty": "Medium",
        "displayText": "2633. Convert Object to JSON String"
    },
    "2634": {
        "id": "2634",
        "name": "Filter Elements from Array",
        "acceptance": "85.4",
        "difficulty": "Easy",
        "displayText": "2634. Filter Elements from Array"
    },
    "2635": {
        "id": "2635",
        "name": "Apply Transform Over Each Element in Array",
        "acceptance": "86.1",
        "difficulty": "Easy",
        "displayText": "2635. Apply Transform Over Each Element in Array"
    },
    "2636": {
        "id": "2636",
        "name": "Promise Pool",
        "acceptance": "79.9",
        "difficulty": "Medium",
        "displayText": "2636. Promise Pool"
    },
    "2637": {
        "id": "2637",
        "name": "Promise Time Limit",
        "acceptance": "82.6",
        "difficulty": "Medium",
        "displayText": "2637. Promise Time Limit"
    },
    "2638": {
        "id": "2638",
        "name": "Count the Number of K-Free Subsets",
        "acceptance": "46.5",
        "difficulty": "Medium",
        "displayText": "2638. Count the Number of K-Free Subsets"
    },
    "2639": {
        "id": "2639",
        "name": "Find the Width of Columns of a Grid",
        "acceptance": "69.0",
        "difficulty": "Easy",
        "displayText": "2639. Find the Width of Columns of a Grid"
    },
    "2640": {
        "id": "2640",
        "name": "Find the Score of All Prefixes of an Array",
        "acceptance": "71.8",
        "difficulty": "Medium",
        "displayText": "2640. Find the Score of All Prefixes of an Array"
    },
    "2641": {
        "id": "2641",
        "name": "Cousins in Binary Tree II",
        "acceptance": "75.4",
        "difficulty": "Medium",
        "displayText": "2641. Cousins in Binary Tree II"
    },
    "2642": {
        "id": "2642",
        "name": "Design Graph With Shortest Path Calculator",
        "acceptance": "70.5",
        "difficulty": "Hard",
        "displayText": "2642. Design Graph With Shortest Path Calculator"
    },
    "2643": {
        "id": "2643",
        "name": "Row With Maximum Ones",
        "acceptance": "74.7",
        "difficulty": "Easy",
        "displayText": "2643. Row With Maximum Ones"
    },
    "2644": {
        "id": "2644",
        "name": "Find the Maximum Divisibility Score",
        "acceptance": "50.2",
        "difficulty": "Easy",
        "displayText": "2644. Find the Maximum Divisibility Score"
    },
    "2645": {
        "id": "2645",
        "name": "Minimum Additions to Make Valid String",
        "acceptance": "50.1",
        "difficulty": "Medium",
        "displayText": "2645. Minimum Additions to Make Valid String"
    },
    "2646": {
        "id": "2646",
        "name": "Minimize the Total Price of the Trips",
        "acceptance": "45.6",
        "difficulty": "Hard",
        "displayText": "2646. Minimize the Total Price of the Trips"
    },
    "2647": {
        "id": "2647",
        "name": "Color the Triangle Red",
        "acceptance": "59.1",
        "difficulty": "Hard",
        "displayText": "2647. Color the Triangle Red"
    },
    "2648": {
        "id": "2648",
        "name": "Generate Fibonacci Sequence",
        "acceptance": "83.6",
        "difficulty": "Easy",
        "displayText": "2648. Generate Fibonacci Sequence"
    },
    "2649": {
        "id": "2649",
        "name": "Nested Array Generator",
        "acceptance": "79.6",
        "difficulty": "Medium",
        "displayText": "2649. Nested Array Generator"
    },
    "2650": {
        "id": "2650",
        "name": "Design Cancellable Function",
        "acceptance": "51.4",
        "difficulty": "Hard",
        "displayText": "2650. Design Cancellable Function"
    },
    "2651": {
        "id": "2651",
        "name": "Calculate Delayed Arrival Time",
        "acceptance": "77.0",
        "difficulty": "Easy",
        "displayText": "2651. Calculate Delayed Arrival Time"
    },
    "2652": {
        "id": "2652",
        "name": "Sum Multiples",
        "acceptance": "85.0",
        "difficulty": "Easy",
        "displayText": "2652. Sum Multiples"
    },
    "2653": {
        "id": "2653",
        "name": "Sliding Subarray Beauty",
        "acceptance": "33.6",
        "difficulty": "Medium",
        "displayText": "2653. Sliding Subarray Beauty"
    },
    "2654": {
        "id": "2654",
        "name": "Minimum Number of Operations to Make All Array Elements Equal to 1",
        "acceptance": "33.5",
        "difficulty": "Medium",
        "displayText": "2654. Minimum Number of Operations to Make All Array Elements Equal to 1"
    },
    "2655": {
        "id": "2655",
        "name": "Find Maximal Uncovered Ranges",
        "acceptance": "48.7",
        "difficulty": "Medium",
        "displayText": "2655. Find Maximal Uncovered Ranges"
    },
    "2656": {
        "id": "2656",
        "name": "Maximum Sum With Exactly K Elements",
        "acceptance": "79.6",
        "difficulty": "Easy",
        "displayText": "2656. Maximum Sum With Exactly K Elements"
    },
    "2657": {
        "id": "2657",
        "name": "Find the Prefix Common Array of Two Arrays",
        "acceptance": "87.1",
        "difficulty": "Medium",
        "displayText": "2657. Find the Prefix Common Array of Two Arrays"
    },
    "2658": {
        "id": "2658",
        "name": "Maximum Number of Fish in a Grid",
        "acceptance": "70.5",
        "difficulty": "Medium",
        "displayText": "2658. Maximum Number of Fish in a Grid"
    },
    "2659": {
        "id": "2659",
        "name": "Make Array Empty",
        "acceptance": "25.3",
        "difficulty": "Hard",
        "displayText": "2659. Make Array Empty"
    },
    "2660": {
        "id": "2660",
        "name": "Determine the Winner of a Bowling Game",
        "acceptance": "35.4",
        "difficulty": "Easy",
        "displayText": "2660. Determine the Winner of a Bowling Game"
    },
    "2661": {
        "id": "2661",
        "name": "First Completely Painted Row or Column",
        "acceptance": "64.0",
        "difficulty": "Medium",
        "displayText": "2661. First Completely Painted Row or Column"
    },
    "2662": {
        "id": "2662",
        "name": "Minimum Cost of a Path With Special Roads",
        "acceptance": "40.0",
        "difficulty": "Medium",
        "displayText": "2662. Minimum Cost of a Path With Special Roads"
    },
    "2663": {
        "id": "2663",
        "name": "Lexicographically Smallest Beautiful String",
        "acceptance": "38.9",
        "difficulty": "Hard",
        "displayText": "2663. Lexicographically Smallest Beautiful String"
    },
    "2664": {
        "id": "2664",
        "name": "The Knight\u2019s Tour",
        "acceptance": "73.0",
        "difficulty": "Medium",
        "displayText": "2664. The Knight\u2019s Tour"
    },
    "2665": {
        "id": "2665",
        "name": "Counter II",
        "acceptance": "81.0",
        "difficulty": "Easy",
        "displayText": "2665. Counter II"
    },
    "2666": {
        "id": "2666",
        "name": "Allow One Function Call",
        "acceptance": "86.6",
        "difficulty": "Easy",
        "displayText": "2666. Allow One Function Call"
    },
    "2667": {
        "id": "2667",
        "name": "Create Hello World Function",
        "acceptance": "82.1",
        "difficulty": "Easy",
        "displayText": "2667. Create Hello World Function"
    },
    "2668": {
        "id": "2668",
        "name": "Find Latest Salaries",
        "acceptance": "74.6",
        "difficulty": "Easy",
        "displayText": "2668. Find Latest Salaries"
    },
    "2669": {
        "id": "2669",
        "name": "Count Artist Occurrences On Spotify Ranking List",
        "acceptance": "74.2",
        "difficulty": "Easy",
        "displayText": "2669. Count Artist Occurrences On Spotify Ranking List"
    },
    "2670": {
        "id": "2670",
        "name": "Find the Distinct Difference Array",
        "acceptance": "75.9",
        "difficulty": "Easy",
        "displayText": "2670. Find the Distinct Difference Array"
    },
    "2671": {
        "id": "2671",
        "name": "Frequency Tracker",
        "acceptance": "30.9",
        "difficulty": "Medium",
        "displayText": "2671. Frequency Tracker"
    },
    "2672": {
        "id": "2672",
        "name": "Number of Adjacent Elements With the Same Color",
        "acceptance": "54.5",
        "difficulty": "Medium",
        "displayText": "2672. Number of Adjacent Elements With the Same Color"
    },
    "2673": {
        "id": "2673",
        "name": "Make Costs of Paths Equal in a Binary Tree",
        "acceptance": "56.2",
        "difficulty": "Medium",
        "displayText": "2673. Make Costs of Paths Equal in a Binary Tree"
    },
    "2674": {
        "id": "2674",
        "name": "Split a Circular Linked List",
        "acceptance": "76.3",
        "difficulty": "Medium",
        "displayText": "2674. Split a Circular Linked List"
    },
    "2675": {
        "id": "2675",
        "name": "Array of Objects to Matrix",
        "acceptance": "68.7",
        "difficulty": "Hard",
        "displayText": "2675. Array of Objects to Matrix"
    },
    "2676": {
        "id": "2676",
        "name": "Throttle",
        "acceptance": "83.2",
        "difficulty": "Medium",
        "displayText": "2676. Throttle"
    },
    "2677": {
        "id": "2677",
        "name": "Chunk Array",
        "acceptance": "84.5",
        "difficulty": "Easy",
        "displayText": "2677. Chunk Array"
    },
    "2678": {
        "id": "2678",
        "name": "Number of Senior Citizens",
        "acceptance": "81.3",
        "difficulty": "Easy",
        "displayText": "2678. Number of Senior Citizens"
    },
    "2679": {
        "id": "2679",
        "name": "Sum in a Matrix",
        "acceptance": "58.8",
        "difficulty": "Medium",
        "displayText": "2679. Sum in a Matrix"
    },
    "2680": {
        "id": "2680",
        "name": "Maximum OR",
        "acceptance": "40.9",
        "difficulty": "Medium",
        "displayText": "2680. Maximum OR"
    },
    "2681": {
        "id": "2681",
        "name": "Power of Heroes",
        "acceptance": "29.4",
        "difficulty": "Hard",
        "displayText": "2681. Power of Heroes"
    },
    "2682": {
        "id": "2682",
        "name": "Find the Losers of the Circular Game",
        "acceptance": "48.7",
        "difficulty": "Easy",
        "displayText": "2682. Find the Losers of the Circular Game"
    },
    "2683": {
        "id": "2683",
        "name": "Neighboring Bitwise XOR",
        "acceptance": "79.7",
        "difficulty": "Medium",
        "displayText": "2683. Neighboring Bitwise XOR"
    },
    "2684": {
        "id": "2684",
        "name": "Maximum Number of Moves in a Grid",
        "acceptance": "58.9",
        "difficulty": "Medium",
        "displayText": "2684. Maximum Number of Moves in a Grid"
    },
    "2685": {
        "id": "2685",
        "name": "Count the Number of Complete Components",
        "acceptance": "77.7",
        "difficulty": "Medium",
        "displayText": "2685. Count the Number of Complete Components"
    },
    "2686": {
        "id": "2686",
        "name": "Immediate Food Delivery III",
        "acceptance": "69.3",
        "difficulty": "Medium",
        "displayText": "2686. Immediate Food Delivery III"
    },
    "2687": {
        "id": "2687",
        "name": "Bikes Last Time Used",
        "acceptance": "81.3",
        "difficulty": "Easy",
        "displayText": "2687. Bikes Last Time Used"
    },
    "2688": {
        "id": "2688",
        "name": "Find Active Users",
        "acceptance": "44.4",
        "difficulty": "Medium",
        "displayText": "2688. Find Active Users"
    },
    "2689": {
        "id": "2689",
        "name": "Extract Kth Character From The Rope Tree",
        "acceptance": "74.0",
        "difficulty": "Easy",
        "displayText": "2689. Extract Kth Character From The Rope Tree"
    },
    "2690": {
        "id": "2690",
        "name": "Infinite Method Object",
        "acceptance": "93.0",
        "difficulty": "Easy",
        "displayText": "2690. Infinite Method Object"
    },
    "2691": {
        "id": "2691",
        "name": "Immutability Helper",
        "acceptance": "41.1",
        "difficulty": "Hard",
        "displayText": "2691. Immutability Helper"
    },
    "2692": {
        "id": "2692",
        "name": "Make Object Immutable",
        "acceptance": "65.0",
        "difficulty": "Medium",
        "displayText": "2692. Make Object Immutable"
    },
    "2693": {
        "id": "2693",
        "name": "Call Function with Custom Context",
        "acceptance": "78.7",
        "difficulty": "Medium",
        "displayText": "2693. Call Function with Custom Context"
    },
    "2694": {
        "id": "2694",
        "name": "Event Emitter",
        "acceptance": "74.4",
        "difficulty": "Medium",
        "displayText": "2694. Event Emitter"
    },
    "2695": {
        "id": "2695",
        "name": "Array Wrapper",
        "acceptance": "89.1",
        "difficulty": "Easy",
        "displayText": "2695. Array Wrapper"
    },
    "2696": {
        "id": "2696",
        "name": "Minimum String Length After Removing Substrings",
        "acceptance": "77.1",
        "difficulty": "Easy",
        "displayText": "2696. Minimum String Length After Removing Substrings"
    },
    "2697": {
        "id": "2697",
        "name": "Lexicographically Smallest Palindrome",
        "acceptance": "79.0",
        "difficulty": "Easy",
        "displayText": "2697. Lexicographically Smallest Palindrome"
    },
    "2698": {
        "id": "2698",
        "name": "Find the Punishment Number of an Integer",
        "acceptance": "81.8",
        "difficulty": "Medium",
        "displayText": "2698. Find the Punishment Number of an Integer"
    },
    "2699": {
        "id": "2699",
        "name": "Modify Graph Edge Weights",
        "acceptance": "56.1",
        "difficulty": "Hard",
        "displayText": "2699. Modify Graph Edge Weights"
    },
    "2700": {
        "id": "2700",
        "name": "Differences Between Two Objects",
        "acceptance": "75.2",
        "difficulty": "Medium",
        "displayText": "2700. Differences Between Two Objects"
    },
    "2701": {
        "id": "2701",
        "name": "Consecutive Transactions with Increasing Amounts",
        "acceptance": "34.0",
        "difficulty": "Hard",
        "displayText": "2701. Consecutive Transactions with Increasing Amounts"
    },
    "2702": {
        "id": "2702",
        "name": "Minimum Operations to Make Numbers Non-positive",
        "acceptance": "41.6",
        "difficulty": "Hard",
        "displayText": "2702. Minimum Operations to Make Numbers Non-positive"
    },
    "2703": {
        "id": "2703",
        "name": "Return Length of Arguments Passed",
        "acceptance": "94.5",
        "difficulty": "Easy",
        "displayText": "2703. Return Length of Arguments Passed"
    },
    "2704": {
        "id": "2704",
        "name": "To Be Or Not To Be",
        "acceptance": "62.9",
        "difficulty": "Easy",
        "displayText": "2704. To Be Or Not To Be"
    },
    "2705": {
        "id": "2705",
        "name": "Compact Object",
        "acceptance": "66.7",
        "difficulty": "Medium",
        "displayText": "2705. Compact Object"
    },
    "2706": {
        "id": "2706",
        "name": "Buy Two Chocolates",
        "acceptance": "68.2",
        "difficulty": "Easy",
        "displayText": "2706. Buy Two Chocolates"
    },
    "2707": {
        "id": "2707",
        "name": "Extra Characters in a String",
        "acceptance": "57.0",
        "difficulty": "Medium",
        "displayText": "2707. Extra Characters in a String"
    },
    "2708": {
        "id": "2708",
        "name": "Maximum Strength of a Group",
        "acceptance": "24.6",
        "difficulty": "Medium",
        "displayText": "2708. Maximum Strength of a Group"
    },
    "2709": {
        "id": "2709",
        "name": "Greatest Common Divisor Traversal",
        "acceptance": "41.8",
        "difficulty": "Hard",
        "displayText": "2709. Greatest Common Divisor Traversal"
    },
    "2710": {
        "id": "2710",
        "name": "Remove Trailing Zeros From a String",
        "acceptance": "78.5",
        "difficulty": "Easy",
        "displayText": "2710. Remove Trailing Zeros From a String"
    },
    "2711": {
        "id": "2711",
        "name": "Difference of Number of Distinct Values on Diagonals",
        "acceptance": "67.6",
        "difficulty": "Medium",
        "displayText": "2711. Difference of Number of Distinct Values on Diagonals"
    },
    "2712": {
        "id": "2712",
        "name": "Minimum Cost to Make All Characters Equal",
        "acceptance": "53.1",
        "difficulty": "Medium",
        "displayText": "2712. Minimum Cost to Make All Characters Equal"
    },
    "2713": {
        "id": "2713",
        "name": "Maximum Strictly Increasing Cells in a Matrix",
        "acceptance": "30.5",
        "difficulty": "Hard",
        "displayText": "2713. Maximum Strictly Increasing Cells in a Matrix"
    },
    "2714": {
        "id": "2714",
        "name": "Find Shortest Path with K Hops",
        "acceptance": "61.8",
        "difficulty": "Hard",
        "displayText": "2714. Find Shortest Path with K Hops"
    },
    "2715": {
        "id": "2715",
        "name": "Timeout Cancellation",
        "acceptance": "89.5",
        "difficulty": "Easy",
        "displayText": "2715. Timeout Cancellation"
    },
    "2716": {
        "id": "2716",
        "name": "Minimize String Length",
        "acceptance": "76.9",
        "difficulty": "Easy",
        "displayText": "2716. Minimize String Length"
    },
    "2717": {
        "id": "2717",
        "name": "Semi-Ordered Permutation",
        "acceptance": "63.1",
        "difficulty": "Easy",
        "displayText": "2717. Semi-Ordered Permutation"
    },
    "2718": {
        "id": "2718",
        "name": "Sum of Matrix After Queries",
        "acceptance": "31.1",
        "difficulty": "Medium",
        "displayText": "2718. Sum of Matrix After Queries"
    },
    "2719": {
        "id": "2719",
        "name": "Count of Integers",
        "acceptance": "37.6",
        "difficulty": "Hard",
        "displayText": "2719. Count of Integers"
    },
    "2720": {
        "id": "2720",
        "name": "Popularity Percentage",
        "acceptance": "54.9",
        "difficulty": "Hard",
        "displayText": "2720. Popularity Percentage"
    },
    "2721": {
        "id": "2721",
        "name": "Execute Asynchronous Functions in Parallel",
        "acceptance": "77.3",
        "difficulty": "Medium",
        "displayText": "2721. Execute Asynchronous Functions in Parallel"
    },
    "2722": {
        "id": "2722",
        "name": "Join Two Arrays by ID",
        "acceptance": "55.9",
        "difficulty": "Medium",
        "displayText": "2722. Join Two Arrays by ID"
    },
    "2723": {
        "id": "2723",
        "name": "Add Two Promises",
        "acceptance": "91.8",
        "difficulty": "Easy",
        "displayText": "2723. Add Two Promises"
    },
    "2724": {
        "id": "2724",
        "name": "Sort By",
        "acceptance": "83.1",
        "difficulty": "Easy",
        "displayText": "2724. Sort By"
    },
    "2725": {
        "id": "2725",
        "name": "Interval Cancellation",
        "acceptance": "83.6",
        "difficulty": "Easy",
        "displayText": "2725. Interval Cancellation"
    },
    "2726": {
        "id": "2726",
        "name": "Calculator with Method Chaining",
        "acceptance": "77.2",
        "difficulty": "Easy",
        "displayText": "2726. Calculator with Method Chaining"
    },
    "2727": {
        "id": "2727",
        "name": "Is Object Empty",
        "acceptance": "81.3",
        "difficulty": "Easy",
        "displayText": "2727. Is Object Empty"
    },
    "2728": {
        "id": "2728",
        "name": "Count Houses in a Circular Street",
        "acceptance": "85.1",
        "difficulty": "Easy",
        "displayText": "2728. Count Houses in a Circular Street"
    },
    "2729": {
        "id": "2729",
        "name": "Check if The Number is Fascinating",
        "acceptance": "52.2",
        "difficulty": "Easy",
        "displayText": "2729. Check if The Number is Fascinating"
    },
    "2730": {
        "id": "2730",
        "name": "Find the Longest Semi-Repetitive Substring",
        "acceptance": "36.8",
        "difficulty": "Medium",
        "displayText": "2730. Find the Longest Semi-Repetitive Substring"
    },
    "2731": {
        "id": "2731",
        "name": "Movement of Robots",
        "acceptance": "26.9",
        "difficulty": "Medium",
        "displayText": "2731. Movement of Robots"
    },
    "2732": {
        "id": "2732",
        "name": "Find a Good Subset of the Matrix",
        "acceptance": "45.7",
        "difficulty": "Hard",
        "displayText": "2732. Find a Good Subset of the Matrix"
    },
    "2733": {
        "id": "2733",
        "name": "Neither Minimum nor Maximum",
        "acceptance": "75.8",
        "difficulty": "Easy",
        "displayText": "2733. Neither Minimum nor Maximum"
    },
    "2734": {
        "id": "2734",
        "name": "Lexicographically Smallest String After Substring Operation",
        "acceptance": "31.9",
        "difficulty": "Medium",
        "displayText": "2734. Lexicographically Smallest String After Substring Operation"
    },
    "2735": {
        "id": "2735",
        "name": "Collecting Chocolates",
        "acceptance": "33.4",
        "difficulty": "Medium",
        "displayText": "2735. Collecting Chocolates"
    },
    "2736": {
        "id": "2736",
        "name": "Maximum Sum Queries",
        "acceptance": "27.7",
        "difficulty": "Hard",
        "displayText": "2736. Maximum Sum Queries"
    },
    "2737": {
        "id": "2737",
        "name": "Find the Closest Marked Node",
        "acceptance": "64.6",
        "difficulty": "Medium",
        "displayText": "2737. Find the Closest Marked Node"
    },
    "2738": {
        "id": "2738",
        "name": "Count Occurrences in Text",
        "acceptance": "55.5",
        "difficulty": "Medium",
        "displayText": "2738. Count Occurrences in Text"
    },
    "2739": {
        "id": "2739",
        "name": "Total Distance Traveled",
        "acceptance": "39.9",
        "difficulty": "Easy",
        "displayText": "2739. Total Distance Traveled"
    },
    "2740": {
        "id": "2740",
        "name": "Find the Value of the Partition",
        "acceptance": "64.2",
        "difficulty": "Medium",
        "displayText": "2740. Find the Value of the Partition"
    },
    "2741": {
        "id": "2741",
        "name": "Special Permutations",
        "acceptance": "28.3",
        "difficulty": "Medium",
        "displayText": "2741. Special Permutations"
    },
    "2742": {
        "id": "2742",
        "name": "Painting the Walls",
        "acceptance": "49.8",
        "difficulty": "Hard",
        "displayText": "2742. Painting the Walls"
    },
    "2743": {
        "id": "2743",
        "name": "Count Substrings Without Repeating Character",
        "acceptance": "76.0",
        "difficulty": "Medium",
        "displayText": "2743. Count Substrings Without Repeating Character"
    },
    "2744": {
        "id": "2744",
        "name": "Find Maximum Number of String Pairs",
        "acceptance": "81.4",
        "difficulty": "Easy",
        "displayText": "2744. Find Maximum Number of String Pairs"
    },
    "2745": {
        "id": "2745",
        "name": "Construct the Longest New String",
        "acceptance": "53.6",
        "difficulty": "Medium",
        "displayText": "2745. Construct the Longest New String"
    },
    "2746": {
        "id": "2746",
        "name": "Decremental String Concatenation",
        "acceptance": "26.0",
        "difficulty": "Medium",
        "displayText": "2746. Decremental String Concatenation"
    },
    "2747": {
        "id": "2747",
        "name": "Count Zero Request Servers",
        "acceptance": "32.6",
        "difficulty": "Medium",
        "displayText": "2747. Count Zero Request Servers"
    },
    "2748": {
        "id": "2748",
        "name": "Number of Beautiful Pairs",
        "acceptance": "50.5",
        "difficulty": "Easy",
        "displayText": "2748. Number of Beautiful Pairs"
    },
    "2749": {
        "id": "2749",
        "name": "Minimum Operations to Make the Integer Zero",
        "acceptance": "29.9",
        "difficulty": "Medium",
        "displayText": "2749. Minimum Operations to Make the Integer Zero"
    },
    "2750": {
        "id": "2750",
        "name": "Ways to Split Array Into Good Subarrays",
        "acceptance": "33.6",
        "difficulty": "Medium",
        "displayText": "2750. Ways to Split Array Into Good Subarrays"
    },
    "2751": {
        "id": "2751",
        "name": "Robot Collisions",
        "acceptance": "56.1",
        "difficulty": "Hard",
        "displayText": "2751. Robot Collisions"
    },
    "2752": {
        "id": "2752",
        "name": "Customers with Maximum Number of Transactions on Consecutive Days",
        "acceptance": "40.8",
        "difficulty": "Hard",
        "displayText": "2752. Customers with Maximum Number of Transactions on Consecutive Days"
    },
    "2753": {
        "id": "2753",
        "name": "Count Houses in a Circular Street II",
        "acceptance": "61.2",
        "difficulty": "Hard",
        "displayText": "2753. Count Houses in a Circular Street II"
    },
    "2754": {
        "id": "2754",
        "name": "Bind Function to Context",
        "acceptance": "86.8",
        "difficulty": "Medium",
        "displayText": "2754. Bind Function to Context"
    },
    "2755": {
        "id": "2755",
        "name": "Deep Merge of Two Objects",
        "acceptance": "65.9",
        "difficulty": "Medium",
        "displayText": "2755. Deep Merge of Two Objects"
    },
    "2756": {
        "id": "2756",
        "name": "Query Batching",
        "acceptance": "66.4",
        "difficulty": "Hard",
        "displayText": "2756. Query Batching"
    },
    "2757": {
        "id": "2757",
        "name": "Generate Circular Array Values",
        "acceptance": "73.4",
        "difficulty": "Medium",
        "displayText": "2757. Generate Circular Array Values"
    },
    "2758": {
        "id": "2758",
        "name": "Next Day",
        "acceptance": "85.0",
        "difficulty": "Easy",
        "displayText": "2758. Next Day"
    },
    "2759": {
        "id": "2759",
        "name": "Convert JSON String to Object",
        "acceptance": "62.0",
        "difficulty": "Hard",
        "displayText": "2759. Convert JSON String to Object"
    },
    "2760": {
        "id": "2760",
        "name": "Longest Even Odd Subarray With Threshold",
        "acceptance": "30.0",
        "difficulty": "Easy",
        "displayText": "2760. Longest Even Odd Subarray With Threshold"
    },
    "2761": {
        "id": "2761",
        "name": "Prime Pairs With Target Sum",
        "acceptance": "35.2",
        "difficulty": "Medium",
        "displayText": "2761. Prime Pairs With Target Sum"
    },
    "2762": {
        "id": "2762",
        "name": "Continuous Subarrays",
        "acceptance": "58.0",
        "difficulty": "Medium",
        "displayText": "2762. Continuous Subarrays"
    },
    "2763": {
        "id": "2763",
        "name": "Sum of Imbalance Numbers of All Subarrays",
        "acceptance": "41.9",
        "difficulty": "Hard",
        "displayText": "2763. Sum of Imbalance Numbers of All Subarrays"
    },
    "2764": {
        "id": "2764",
        "name": "Is Array a Preorder of Some \u200cBinary Tree",
        "acceptance": "65.9",
        "difficulty": "Medium",
        "displayText": "2764. Is Array a Preorder of Some \u200cBinary Tree"
    },
    "2765": {
        "id": "2765",
        "name": "Longest Alternating Subarray",
        "acceptance": "34.3",
        "difficulty": "Easy",
        "displayText": "2765. Longest Alternating Subarray"
    },
    "2766": {
        "id": "2766",
        "name": "Relocate Marbles",
        "acceptance": "50.0",
        "difficulty": "Medium",
        "displayText": "2766. Relocate Marbles"
    },
    "2767": {
        "id": "2767",
        "name": "Partition String Into Minimum Beautiful Substrings",
        "acceptance": "52.3",
        "difficulty": "Medium",
        "displayText": "2767. Partition String Into Minimum Beautiful Substrings"
    },
    "2768": {
        "id": "2768",
        "name": "Number of Black Blocks",
        "acceptance": "37.5",
        "difficulty": "Medium",
        "displayText": "2768. Number of Black Blocks"
    },
    "2769": {
        "id": "2769",
        "name": "Find the Maximum Achievable Number",
        "acceptance": "90.8",
        "difficulty": "Easy",
        "displayText": "2769. Find the Maximum Achievable Number"
    },
    "2770": {
        "id": "2770",
        "name": "Maximum Number of Jumps to Reach the Last Index",
        "acceptance": "31.0",
        "difficulty": "Medium",
        "displayText": "2770. Maximum Number of Jumps to Reach the Last Index"
    },
    "2771": {
        "id": "2771",
        "name": "Longest Non-decreasing Subarray From Two Arrays",
        "acceptance": "29.7",
        "difficulty": "Medium",
        "displayText": "2771. Longest Non-decreasing Subarray From Two Arrays"
    },
    "2772": {
        "id": "2772",
        "name": "Apply Operations to Make All Array Elements Equal to Zero",
        "acceptance": "32.4",
        "difficulty": "Medium",
        "displayText": "2772. Apply Operations to Make All Array Elements Equal to Zero"
    },
    "2773": {
        "id": "2773",
        "name": "Height of Special Binary Tree",
        "acceptance": "73.5",
        "difficulty": "Medium",
        "displayText": "2773. Height of Special Binary Tree"
    },
    "2774": {
        "id": "2774",
        "name": "Array Upper Bound",
        "acceptance": "82.7",
        "difficulty": "Easy",
        "displayText": "2774. Array Upper Bound"
    },
    "2775": {
        "id": "2775",
        "name": "Undefined to Null",
        "acceptance": "70.6",
        "difficulty": "Medium",
        "displayText": "2775. Undefined to Null"
    },
    "2776": {
        "id": "2776",
        "name": "Convert Callback Based Function to Promise Based Function",
        "acceptance": "92.3",
        "difficulty": "Medium",
        "displayText": "2776. Convert Callback Based Function to Promise Based Function"
    },
    "2777": {
        "id": "2777",
        "name": "Date Range Generator",
        "acceptance": "82.1",
        "difficulty": "Medium",
        "displayText": "2777. Date Range Generator"
    },
    "2778": {
        "id": "2778",
        "name": "Sum of Squares of Special Elements",
        "acceptance": "80.9",
        "difficulty": "Easy",
        "displayText": "2778. Sum of Squares of Special Elements"
    },
    "2779": {
        "id": "2779",
        "name": "Maximum Beauty of an Array After Applying Operation",
        "acceptance": "58.0",
        "difficulty": "Medium",
        "displayText": "2779. Maximum Beauty of an Array After Applying Operation"
    },
    "2780": {
        "id": "2780",
        "name": "Minimum Index of a Valid Split",
        "acceptance": "75.8",
        "difficulty": "Medium",
        "displayText": "2780. Minimum Index of a Valid Split"
    },
    "2781": {
        "id": "2781",
        "name": "Length of the Longest Valid Substring",
        "acceptance": "37.6",
        "difficulty": "Hard",
        "displayText": "2781. Length of the Longest Valid Substring"
    },
    "2782": {
        "id": "2782",
        "name": "Number of Unique Categories",
        "acceptance": "82.8",
        "difficulty": "Medium",
        "displayText": "2782. Number of Unique Categories"
    },
    "2783": {
        "id": "2783",
        "name": "Flight Occupancy and Waitlist Analysis",
        "acceptance": "38.3",
        "difficulty": "Medium",
        "displayText": "2783. Flight Occupancy and Waitlist Analysis"
    },
    "2784": {
        "id": "2784",
        "name": "Check if Array is Good",
        "acceptance": "48.3",
        "difficulty": "Easy",
        "displayText": "2784. Check if Array is Good"
    },
    "2785": {
        "id": "2785",
        "name": "Sort Vowels in a String",
        "acceptance": "79.9",
        "difficulty": "Medium",
        "displayText": "2785. Sort Vowels in a String"
    },
    "2786": {
        "id": "2786",
        "name": "Visit Array Positions to Maximize Score",
        "acceptance": "36.3",
        "difficulty": "Medium",
        "displayText": "2786. Visit Array Positions to Maximize Score"
    },
    "2787": {
        "id": "2787",
        "name": "Ways to Express an Integer as Sum of Powers",
        "acceptance": "33.5",
        "difficulty": "Medium",
        "displayText": "2787. Ways to Express an Integer as Sum of Powers"
    },
    "2788": {
        "id": "2788",
        "name": "Split Strings by Separator",
        "acceptance": "74.6",
        "difficulty": "Easy",
        "displayText": "2788. Split Strings by Separator"
    },
    "2789": {
        "id": "2789",
        "name": "Largest Element in an Array after Merge Operations",
        "acceptance": "46.4",
        "difficulty": "Medium",
        "displayText": "2789. Largest Element in an Array after Merge Operations"
    },
    "2790": {
        "id": "2790",
        "name": "Maximum Number of Groups With Increasing Length",
        "acceptance": "21.7",
        "difficulty": "Hard",
        "displayText": "2790. Maximum Number of Groups With Increasing Length"
    },
    "2791": {
        "id": "2791",
        "name": "Count Paths That Can Form a Palindrome in a Tree",
        "acceptance": "45.1",
        "difficulty": "Hard",
        "displayText": "2791. Count Paths That Can Form a Palindrome in a Tree"
    },
    "2792": {
        "id": "2792",
        "name": "Count Nodes That Are Great Enough",
        "acceptance": "57.7",
        "difficulty": "Hard",
        "displayText": "2792. Count Nodes That Are Great Enough"
    },
    "2793": {
        "id": "2793",
        "name": "Status of Flight Tickets",
        "acceptance": "78.7",
        "difficulty": "Hard",
        "displayText": "2793. Status of Flight Tickets"
    },
    "2794": {
        "id": "2794",
        "name": "Create Object from Two Arrays",
        "acceptance": "65.2",
        "difficulty": "Easy",
        "displayText": "2794. Create Object from Two Arrays"
    },
    "2795": {
        "id": "2795",
        "name": "Parallel Execution of Promises for Individual Results Retrieval",
        "acceptance": "89.9",
        "difficulty": "Medium",
        "displayText": "2795. Parallel Execution of Promises for Individual Results Retrieval"
    },
    "2796": {
        "id": "2796",
        "name": "Repeat String",
        "acceptance": "93.0",
        "difficulty": "Easy",
        "displayText": "2796. Repeat String"
    },
    "2797": {
        "id": "2797",
        "name": "Partial Function with Placeholders",
        "acceptance": "89.4",
        "difficulty": "Easy",
        "displayText": "2797. Partial Function with Placeholders"
    },
    "2798": {
        "id": "2798",
        "name": "Number of Employees Who Met the Target",
        "acceptance": "87.6",
        "difficulty": "Easy",
        "displayText": "2798. Number of Employees Who Met the Target"
    },
    "2799": {
        "id": "2799",
        "name": "Count Complete Subarrays in an Array",
        "acceptance": "64.6",
        "difficulty": "Medium",
        "displayText": "2799. Count Complete Subarrays in an Array"
    },
    "2800": {
        "id": "2800",
        "name": "Shortest String That Contains Three Strings",
        "acceptance": "30.5",
        "difficulty": "Medium",
        "displayText": "2800. Shortest String That Contains Three Strings"
    },
    "2801": {
        "id": "2801",
        "name": "Count Stepping Numbers in Range",
        "acceptance": "25.7",
        "difficulty": "Hard",
        "displayText": "2801. Count Stepping Numbers in Range"
    },
    "2802": {
        "id": "2802",
        "name": "Find The K-th Lucky Number",
        "acceptance": "76.0",
        "difficulty": "Medium",
        "displayText": "2802. Find The K-th Lucky Number"
    },
    "2803": {
        "id": "2803",
        "name": "Factorial Generator",
        "acceptance": "86.9",
        "difficulty": "Easy",
        "displayText": "2803. Factorial Generator"
    },
    "2804": {
        "id": "2804",
        "name": "Array Prototype ForEach",
        "acceptance": "89.4",
        "difficulty": "Easy",
        "displayText": "2804. Array Prototype ForEach"
    },
    "2805": {
        "id": "2805",
        "name": "Custom Interval",
        "acceptance": "82.7",
        "difficulty": "Medium",
        "displayText": "2805. Custom Interval"
    },
    "2806": {
        "id": "2806",
        "name": "Account Balance After Rounded Purchase",
        "acceptance": "54.8",
        "difficulty": "Easy",
        "displayText": "2806. Account Balance After Rounded Purchase"
    },
    "2807": {
        "id": "2807",
        "name": "Insert Greatest Common Divisors in Linked List",
        "acceptance": "91.5",
        "difficulty": "Medium",
        "displayText": "2807. Insert Greatest Common Divisors in Linked List"
    },
    "2808": {
        "id": "2808",
        "name": "Minimum Seconds to Equalize a Circular Array",
        "acceptance": "27.2",
        "difficulty": "Medium",
        "displayText": "2808. Minimum Seconds to Equalize a Circular Array"
    },
    "2809": {
        "id": "2809",
        "name": "Minimum Time to Make Array Sum At Most x",
        "acceptance": "25.0",
        "difficulty": "Hard",
        "displayText": "2809. Minimum Time to Make Array Sum At Most x"
    },
    "2810": {
        "id": "2810",
        "name": "Faulty Keyboard",
        "acceptance": "82.7",
        "difficulty": "Easy",
        "displayText": "2810. Faulty Keyboard"
    },
    "2811": {
        "id": "2811",
        "name": "Check if it is Possible to Split Array",
        "acceptance": "33.8",
        "difficulty": "Medium",
        "displayText": "2811. Check if it is Possible to Split Array"
    },
    "2812": {
        "id": "2812",
        "name": "Find the Safest Path in a Grid",
        "acceptance": "48.3",
        "difficulty": "Medium",
        "displayText": "2812. Find the Safest Path in a Grid"
    },
    "2813": {
        "id": "2813",
        "name": "Maximum Elegance of a K-Length Subsequence",
        "acceptance": "29.4",
        "difficulty": "Hard",
        "displayText": "2813. Maximum Elegance of a K-Length Subsequence"
    },
    "2814": {
        "id": "2814",
        "name": "Minimum Time Takes to Reach Destination Without Drowning",
        "acceptance": "55.2",
        "difficulty": "Hard",
        "displayText": "2814. Minimum Time Takes to Reach Destination Without Drowning"
    },
    "2815": {
        "id": "2815",
        "name": "Max Pair Sum in an Array",
        "acceptance": "58.8",
        "difficulty": "Easy",
        "displayText": "2815. Max Pair Sum in an Array"
    },
    "2816": {
        "id": "2816",
        "name": "Double a Number Represented as a Linked List",
        "acceptance": "61.2",
        "difficulty": "Medium",
        "displayText": "2816. Double a Number Represented as a Linked List"
    },
    "2817": {
        "id": "2817",
        "name": "Minimum Absolute Difference Between Elements With Constraint",
        "acceptance": "33.7",
        "difficulty": "Medium",
        "displayText": "2817. Minimum Absolute Difference Between Elements With Constraint"
    },
    "2818": {
        "id": "2818",
        "name": "Apply Operations to Maximize Score",
        "acceptance": "54.4",
        "difficulty": "Hard",
        "displayText": "2818. Apply Operations to Maximize Score"
    },
    "2819": {
        "id": "2819",
        "name": "Minimum Relative Loss After Buying Chocolates",
        "acceptance": "41.9",
        "difficulty": "Hard",
        "displayText": "2819. Minimum Relative Loss After Buying Chocolates"
    },
    "2820": {
        "id": "2820",
        "name": "Election Results",
        "acceptance": "68.3",
        "difficulty": "Medium",
        "displayText": "2820. Election Results"
    },
    "2821": {
        "id": "2821",
        "name": "Delay the Resolution of Each Promise",
        "acceptance": "71.5",
        "difficulty": "Medium",
        "displayText": "2821. Delay the Resolution of Each Promise"
    },
    "2822": {
        "id": "2822",
        "name": "Inversion of Object",
        "acceptance": "59.5",
        "difficulty": "Easy",
        "displayText": "2822. Inversion of Object"
    },
    "2823": {
        "id": "2823",
        "name": "Deep Object Filter",
        "acceptance": "55.5",
        "difficulty": "Medium",
        "displayText": "2823. Deep Object Filter"
    },
    "2824": {
        "id": "2824",
        "name": "Count Pairs Whose Sum is Less than Target",
        "acceptance": "87.4",
        "difficulty": "Easy",
        "displayText": "2824. Count Pairs Whose Sum is Less than Target"
    },
    "2825": {
        "id": "2825",
        "name": "Make String a Subsequence Using Cyclic Increments",
        "acceptance": "65.7",
        "difficulty": "Medium",
        "displayText": "2825. Make String a Subsequence Using Cyclic Increments"
    },
    "2826": {
        "id": "2826",
        "name": "Sorting Three Groups",
        "acceptance": "41.6",
        "difficulty": "Medium",
        "displayText": "2826. Sorting Three Groups"
    },
    "2827": {
        "id": "2827",
        "name": "Number of Beautiful Integers in the Range",
        "acceptance": "19.2",
        "difficulty": "Hard",
        "displayText": "2827. Number of Beautiful Integers in the Range"
    },
    "2828": {
        "id": "2828",
        "name": "Check if a String Is an Acronym of Words",
        "acceptance": "82.5",
        "difficulty": "Easy",
        "displayText": "2828. Check if a String Is an Acronym of Words"
    },
    "2829": {
        "id": "2829",
        "name": "Determine the Minimum Sum of a k-avoiding Array",
        "acceptance": "59.7",
        "difficulty": "Medium",
        "displayText": "2829. Determine the Minimum Sum of a k-avoiding Array"
    },
    "2830": {
        "id": "2830",
        "name": "Maximize the Profit as the Salesman",
        "acceptance": "36.8",
        "difficulty": "Medium",
        "displayText": "2830. Maximize the Profit as the Salesman"
    },
    "2831": {
        "id": "2831",
        "name": "Find the Longest Equal Subarray",
        "acceptance": "35.8",
        "difficulty": "Medium",
        "displayText": "2831. Find the Longest Equal Subarray"
    },
    "2832": {
        "id": "2832",
        "name": "Maximal Range That Each Element Is Maximum in It",
        "acceptance": "75.3",
        "difficulty": "Medium",
        "displayText": "2832. Maximal Range That Each Element Is Maximum in It"
    },
    "2833": {
        "id": "2833",
        "name": "Furthest Point From Origin",
        "acceptance": "64.2",
        "difficulty": "Easy",
        "displayText": "2833. Furthest Point From Origin"
    },
    "2834": {
        "id": "2834",
        "name": "Find the Minimum Possible Sum of a Beautiful Array",
        "acceptance": "36.1",
        "difficulty": "Medium",
        "displayText": "2834. Find the Minimum Possible Sum of a Beautiful Array"
    },
    "2835": {
        "id": "2835",
        "name": "Minimum Operations to Form Subsequence With Target Sum",
        "acceptance": "31.1",
        "difficulty": "Hard",
        "displayText": "2835. Minimum Operations to Form Subsequence With Target Sum"
    },
    "2836": {
        "id": "2836",
        "name": "Maximize Value of Function in a Ball Passing Game",
        "acceptance": "28.2",
        "difficulty": "Hard",
        "displayText": "2836. Maximize Value of Function in a Ball Passing Game"
    },
    "2837": {
        "id": "2837",
        "name": "Total Traveled Distance",
        "acceptance": "77.4",
        "difficulty": "Easy",
        "displayText": "2837. Total Traveled Distance"
    },
    "2838": {
        "id": "2838",
        "name": "Maximum Coins Heroes Can Collect",
        "acceptance": "68.5",
        "difficulty": "Medium",
        "displayText": "2838. Maximum Coins Heroes Can Collect"
    },
    "2839": {
        "id": "2839",
        "name": "Check if Strings Can be Made Equal With Operations I",
        "acceptance": "46.9",
        "difficulty": "Easy",
        "displayText": "2839. Check if Strings Can be Made Equal With Operations I"
    },
    "2840": {
        "id": "2840",
        "name": "Check if Strings Can be Made Equal With Operations II",
        "acceptance": "55.0",
        "difficulty": "Medium",
        "displayText": "2840. Check if Strings Can be Made Equal With Operations II"
    },
    "2841": {
        "id": "2841",
        "name": "Maximum Sum of Almost Unique Subarray",
        "acceptance": "39.0",
        "difficulty": "Medium",
        "displayText": "2841. Maximum Sum of Almost Unique Subarray"
    },
    "2842": {
        "id": "2842",
        "name": "Count K-Subsequences of a String With Maximum Beauty",
        "acceptance": "29.4",
        "difficulty": "Hard",
        "displayText": "2842. Count K-Subsequences of a String With Maximum Beauty"
    },
    "2843": {
        "id": "2843",
        "name": "Count Symmetric Integers",
        "acceptance": "83.1",
        "difficulty": "Easy",
        "displayText": "2843. Count Symmetric Integers"
    },
    "2844": {
        "id": "2844",
        "name": "Minimum Operations to Make a Special Number",
        "acceptance": "37.9",
        "difficulty": "Medium",
        "displayText": "2844. Minimum Operations to Make a Special Number"
    },
    "2845": {
        "id": "2845",
        "name": "Count of Interesting Subarrays",
        "acceptance": "35.6",
        "difficulty": "Medium",
        "displayText": "2845. Count of Interesting Subarrays"
    },
    "2846": {
        "id": "2846",
        "name": "Minimum Edge Weight Equilibrium Queries in a Tree",
        "acceptance": "42.0",
        "difficulty": "Hard",
        "displayText": "2846. Minimum Edge Weight Equilibrium Queries in a Tree"
    },
    "2847": {
        "id": "2847",
        "name": "Smallest Number With Given Digit Product",
        "acceptance": "43.3",
        "difficulty": "Medium",
        "displayText": "2847. Smallest Number With Given Digit Product"
    },
    "2848": {
        "id": "2848",
        "name": "Points That Intersect With Cars",
        "acceptance": "72.7",
        "difficulty": "Easy",
        "displayText": "2848. Points That Intersect With Cars"
    },
    "2849": {
        "id": "2849",
        "name": "Determine if a Cell Is Reachable at a Given Time",
        "acceptance": "35.7",
        "difficulty": "Medium",
        "displayText": "2849. Determine if a Cell Is Reachable at a Given Time"
    },
    "2850": {
        "id": "2850",
        "name": "Minimum Moves to Spread Stones Over Grid",
        "acceptance": "44.1",
        "difficulty": "Medium",
        "displayText": "2850. Minimum Moves to Spread Stones Over Grid"
    },
    "2851": {
        "id": "2851",
        "name": "String Transformation",
        "acceptance": "28.9",
        "difficulty": "Hard",
        "displayText": "2851. String Transformation"
    },
    "2852": {
        "id": "2852",
        "name": "Sum of Remoteness of All Cells",
        "acceptance": "70.7",
        "difficulty": "Medium",
        "displayText": "2852. Sum of Remoteness of All Cells"
    },
    "2853": {
        "id": "2853",
        "name": "Highest Salaries Difference",
        "acceptance": "74.1",
        "difficulty": "Easy",
        "displayText": "2853. Highest Salaries Difference"
    },
    "2854": {
        "id": "2854",
        "name": "Rolling Average Steps",
        "acceptance": "69.8",
        "difficulty": "Medium",
        "displayText": "2854. Rolling Average Steps"
    },
    "2855": {
        "id": "2855",
        "name": "Minimum Right Shifts to Sort the Array",
        "acceptance": "56.4",
        "difficulty": "Easy",
        "displayText": "2855. Minimum Right Shifts to Sort the Array"
    },
    "2856": {
        "id": "2856",
        "name": "Minimum Array Length After Pair Removals",
        "acceptance": "24.6",
        "difficulty": "Medium",
        "displayText": "2856. Minimum Array Length After Pair Removals"
    },
    "2857": {
        "id": "2857",
        "name": "Count Pairs of Points With Distance k",
        "acceptance": "31.9",
        "difficulty": "Medium",
        "displayText": "2857. Count Pairs of Points With Distance k"
    },
    "2858": {
        "id": "2858",
        "name": "Minimum Edge Reversals So Every Node Is Reachable",
        "acceptance": "55.3",
        "difficulty": "Hard",
        "displayText": "2858. Minimum Edge Reversals So Every Node Is Reachable"
    },
    "2859": {
        "id": "2859",
        "name": "Sum of Values at Indices With K Set Bits",
        "acceptance": "85.6",
        "difficulty": "Easy",
        "displayText": "2859. Sum of Values at Indices With K Set Bits"
    },
    "2860": {
        "id": "2860",
        "name": "Happy Students",
        "acceptance": "50.0",
        "difficulty": "Medium",
        "displayText": "2860. Happy Students"
    },
    "2861": {
        "id": "2861",
        "name": "Maximum Number of Alloys",
        "acceptance": "38.5",
        "difficulty": "Medium",
        "displayText": "2861. Maximum Number of Alloys"
    },
    "2862": {
        "id": "2862",
        "name": "Maximum Element-Sum of a Complete Subset of Indices",
        "acceptance": "41.3",
        "difficulty": "Hard",
        "displayText": "2862. Maximum Element-Sum of a Complete Subset of Indices"
    },
    "2863": {
        "id": "2863",
        "name": "Maximum Length of Semi-Decreasing Subarrays",
        "acceptance": "70.0",
        "difficulty": "Medium",
        "displayText": "2863. Maximum Length of Semi-Decreasing Subarrays"
    },
    "2864": {
        "id": "2864",
        "name": "Maximum Odd Binary Number",
        "acceptance": "82.6",
        "difficulty": "Easy",
        "displayText": "2864. Maximum Odd Binary Number"
    },
    "2865": {
        "id": "2865",
        "name": "Beautiful Towers I",
        "acceptance": "43.1",
        "difficulty": "Medium",
        "displayText": "2865. Beautiful Towers I"
    },
    "2866": {
        "id": "2866",
        "name": "Beautiful Towers II",
        "acceptance": "34.2",
        "difficulty": "Medium",
        "displayText": "2866. Beautiful Towers II"
    },
    "2867": {
        "id": "2867",
        "name": "Count Valid Paths in a Tree",
        "acceptance": "34.3",
        "difficulty": "Hard",
        "displayText": "2867. Count Valid Paths in a Tree"
    },
    "2868": {
        "id": "2868",
        "name": "The Wording Game",
        "acceptance": "53.5",
        "difficulty": "Hard",
        "displayText": "2868. The Wording Game"
    },
    "2869": {
        "id": "2869",
        "name": "Minimum Operations to Collect Elements",
        "acceptance": "60.6",
        "difficulty": "Easy",
        "displayText": "2869. Minimum Operations to Collect Elements"
    },
    "2870": {
        "id": "2870",
        "name": "Minimum Number of Operations to Make Array Empty",
        "acceptance": "61.8",
        "difficulty": "Medium",
        "displayText": "2870. Minimum Number of Operations to Make Array Empty"
    },
    "2871": {
        "id": "2871",
        "name": "Split Array Into Maximum Number of Subarrays",
        "acceptance": "41.4",
        "difficulty": "Medium",
        "displayText": "2871. Split Array Into Maximum Number of Subarrays"
    },
    "2872": {
        "id": "2872",
        "name": "Maximum Number of K-Divisible Components",
        "acceptance": "69.8",
        "difficulty": "Hard",
        "displayText": "2872. Maximum Number of K-Divisible Components"
    },
    "2873": {
        "id": "2873",
        "name": "Maximum Value of an Ordered Triplet I",
        "acceptance": "58.3",
        "difficulty": "Easy",
        "displayText": "2873. Maximum Value of an Ordered Triplet I"
    },
    "2874": {
        "id": "2874",
        "name": "Maximum Value of an Ordered Triplet II",
        "acceptance": "56.8",
        "difficulty": "Medium",
        "displayText": "2874. Maximum Value of an Ordered Triplet II"
    },
    "2875": {
        "id": "2875",
        "name": "Minimum Size Subarray in Infinite Array",
        "acceptance": "31.0",
        "difficulty": "Medium",
        "displayText": "2875. Minimum Size Subarray in Infinite Array"
    },
    "2876": {
        "id": "2876",
        "name": "Count Visited Nodes in a Directed Graph",
        "acceptance": "31.6",
        "difficulty": "Hard",
        "displayText": "2876. Count Visited Nodes in a Directed Graph"
    },
    "2877": {
        "id": "2877",
        "name": "Create a DataFrame from List",
        "acceptance": "81.5",
        "difficulty": "Easy",
        "displayText": "2877. Create a DataFrame from List"
    },
    "2878": {
        "id": "2878",
        "name": "Get the Size of a DataFrame",
        "acceptance": "85.2",
        "difficulty": "Easy",
        "displayText": "2878. Get the Size of a DataFrame"
    },
    "2879": {
        "id": "2879",
        "name": "Display the First Three Rows",
        "acceptance": "93.1",
        "difficulty": "Easy",
        "displayText": "2879. Display the First Three Rows"
    },
    "2880": {
        "id": "2880",
        "name": "Select Data",
        "acceptance": "79.3",
        "difficulty": "Easy",
        "displayText": "2880. Select Data"
    },
    "2881": {
        "id": "2881",
        "name": "Create a New Column",
        "acceptance": "90.3",
        "difficulty": "Easy",
        "displayText": "2881. Create a New Column"
    },
    "2882": {
        "id": "2882",
        "name": "Drop Duplicate Rows",
        "acceptance": "85.6",
        "difficulty": "Easy",
        "displayText": "2882. Drop Duplicate Rows"
    },
    "2883": {
        "id": "2883",
        "name": "Drop Missing Data",
        "acceptance": "64.3",
        "difficulty": "Easy",
        "displayText": "2883. Drop Missing Data"
    },
    "2884": {
        "id": "2884",
        "name": "Modify Columns",
        "acceptance": "92.5",
        "difficulty": "Easy",
        "displayText": "2884. Modify Columns"
    },
    "2885": {
        "id": "2885",
        "name": "Rename Columns",
        "acceptance": "85.6",
        "difficulty": "Easy",
        "displayText": "2885. Rename Columns"
    },
    "2886": {
        "id": "2886",
        "name": "Change Data Type",
        "acceptance": "87.5",
        "difficulty": "Easy",
        "displayText": "2886. Change Data Type"
    },
    "2887": {
        "id": "2887",
        "name": "Fill Missing Data",
        "acceptance": "72.3",
        "difficulty": "Easy",
        "displayText": "2887. Fill Missing Data"
    },
    "2888": {
        "id": "2888",
        "name": "Reshape Data: Concatenate",
        "acceptance": "90.8",
        "difficulty": "Easy",
        "displayText": "2888. Reshape Data: Concatenate"
    },
    "2889": {
        "id": "2889",
        "name": "Reshape Data: Pivot",
        "acceptance": "83.6",
        "difficulty": "Easy",
        "displayText": "2889. Reshape Data: Pivot"
    },
    "2890": {
        "id": "2890",
        "name": "Reshape Data: Melt",
        "acceptance": "86.2",
        "difficulty": "Easy",
        "displayText": "2890. Reshape Data: Melt"
    },
    "2891": {
        "id": "2891",
        "name": "Method Chaining",
        "acceptance": "76.7",
        "difficulty": "Easy",
        "displayText": "2891. Method Chaining"
    },
    "2892": {
        "id": "2892",
        "name": "Minimizing Array After Replacing Pairs With Their Product",
        "acceptance": "39.3",
        "difficulty": "Medium",
        "displayText": "2892. Minimizing Array After Replacing Pairs With Their Product"
    },
    "2893": {
        "id": "2893",
        "name": "Calculate Orders Within Each Interval",
        "acceptance": "68.1",
        "difficulty": "Medium",
        "displayText": "2893. Calculate Orders Within Each Interval"
    },
    "2894": {
        "id": "2894",
        "name": "Divisible and Non-divisible Sums Difference",
        "acceptance": "88.3",
        "difficulty": "Easy",
        "displayText": "2894. Divisible and Non-divisible Sums Difference"
    },
    "2895": {
        "id": "2895",
        "name": "Minimum Processing Time",
        "acceptance": "68.9",
        "difficulty": "Medium",
        "displayText": "2895. Minimum Processing Time"
    },
    "2896": {
        "id": "2896",
        "name": "Apply Operations to Make Two Strings Equal",
        "acceptance": "27.1",
        "difficulty": "Medium",
        "displayText": "2896. Apply Operations to Make Two Strings Equal"
    },
    "2897": {
        "id": "2897",
        "name": "Apply Operations on Array to Maximize Sum of Squares",
        "acceptance": "43.0",
        "difficulty": "Hard",
        "displayText": "2897. Apply Operations on Array to Maximize Sum of Squares"
    },
    "2898": {
        "id": "2898",
        "name": "Maximum Linear Stock Score",
        "acceptance": "58.7",
        "difficulty": "Medium",
        "displayText": "2898. Maximum Linear Stock Score"
    },
    "2899": {
        "id": "2899",
        "name": "Last Visited Integers",
        "acceptance": "63.4",
        "difficulty": "Easy",
        "displayText": "2899. Last Visited Integers"
    },
    "2900": {
        "id": "2900",
        "name": "Longest Unequal Adjacent Groups Subsequence I",
        "acceptance": "59.7",
        "difficulty": "Easy",
        "displayText": "2900. Longest Unequal Adjacent Groups Subsequence I"
    },
    "2901": {
        "id": "2901",
        "name": "Longest Unequal Adjacent Groups Subsequence II",
        "acceptance": "27.8",
        "difficulty": "Medium",
        "displayText": "2901. Longest Unequal Adjacent Groups Subsequence II"
    },
    "2902": {
        "id": "2902",
        "name": "Count of Sub-Multisets With Bounded Sum",
        "acceptance": "20.3",
        "difficulty": "Hard",
        "displayText": "2902. Count of Sub-Multisets With Bounded Sum"
    },
    "2903": {
        "id": "2903",
        "name": "Find Indices With Index and Value Difference I",
        "acceptance": "60.3",
        "difficulty": "Easy",
        "displayText": "2903. Find Indices With Index and Value Difference I"
    },
    "2904": {
        "id": "2904",
        "name": "Shortest and Lexicographically Smallest Beautiful String",
        "acceptance": "39.6",
        "difficulty": "Medium",
        "displayText": "2904. Shortest and Lexicographically Smallest Beautiful String"
    },
    "2905": {
        "id": "2905",
        "name": "Find Indices With Index and Value Difference II",
        "acceptance": "31.6",
        "difficulty": "Medium",
        "displayText": "2905. Find Indices With Index and Value Difference II"
    },
    "2906": {
        "id": "2906",
        "name": "Construct Product Matrix",
        "acceptance": "30.7",
        "difficulty": "Medium",
        "displayText": "2906. Construct Product Matrix"
    },
    "2907": {
        "id": "2907",
        "name": "Maximum Profitable Triplets With Increasing Prices I",
        "acceptance": "54.6",
        "difficulty": "Medium",
        "displayText": "2907. Maximum Profitable Triplets With Increasing Prices I"
    },
    "2908": {
        "id": "2908",
        "name": "Minimum Sum of Mountain Triplets I",
        "acceptance": "65.7",
        "difficulty": "Easy",
        "displayText": "2908. Minimum Sum of Mountain Triplets I"
    },
    "2909": {
        "id": "2909",
        "name": "Minimum Sum of Mountain Triplets II",
        "acceptance": "53.4",
        "difficulty": "Medium",
        "displayText": "2909. Minimum Sum of Mountain Triplets II"
    },
    "2910": {
        "id": "2910",
        "name": "Minimum Number of Groups to Create a Valid Assignment",
        "acceptance": "23.9",
        "difficulty": "Medium",
        "displayText": "2910. Minimum Number of Groups to Create a Valid Assignment"
    },
    "2911": {
        "id": "2911",
        "name": "Minimum Changes to Make K Semi-palindromes",
        "acceptance": "34.6",
        "difficulty": "Hard",
        "displayText": "2911. Minimum Changes to Make K Semi-palindromes"
    },
    "2912": {
        "id": "2912",
        "name": "Number of Ways to Reach Destination in the Grid",
        "acceptance": "58.7",
        "difficulty": "Hard",
        "displayText": "2912. Number of Ways to Reach Destination in the Grid"
    },
    "2913": {
        "id": "2913",
        "name": "Subarrays Distinct Element Sum of Squares I",
        "acceptance": "79.4",
        "difficulty": "Easy",
        "displayText": "2913. Subarrays Distinct Element Sum of Squares I"
    },
    "2914": {
        "id": "2914",
        "name": "Minimum Number of Changes to Make Binary String Beautiful",
        "acceptance": "76.5",
        "difficulty": "Medium",
        "displayText": "2914. Minimum Number of Changes to Make Binary String Beautiful"
    },
    "2915": {
        "id": "2915",
        "name": "Length of the Longest Subsequence That Sums to Target",
        "acceptance": "36.8",
        "difficulty": "Medium",
        "displayText": "2915. Length of the Longest Subsequence That Sums to Target"
    },
    "2916": {
        "id": "2916",
        "name": "Subarrays Distinct Element Sum of Squares II",
        "acceptance": "20.5",
        "difficulty": "Hard",
        "displayText": "2916. Subarrays Distinct Element Sum of Squares II"
    },
    "2917": {
        "id": "2917",
        "name": "Find the K-or of an Array",
        "acceptance": "72.0",
        "difficulty": "Easy",
        "displayText": "2917. Find the K-or of an Array"
    },
    "2918": {
        "id": "2918",
        "name": "Minimum Equal Sum of Two Arrays After Replacing Zeros",
        "acceptance": "36.5",
        "difficulty": "Medium",
        "displayText": "2918. Minimum Equal Sum of Two Arrays After Replacing Zeros"
    },
    "2919": {
        "id": "2919",
        "name": "Minimum Increment Operations to Make Array Beautiful",
        "acceptance": "33.7",
        "difficulty": "Medium",
        "displayText": "2919. Minimum Increment Operations to Make Array Beautiful"
    },
    "2920": {
        "id": "2920",
        "name": "Maximum Points After Collecting Coins From All Nodes",
        "acceptance": "35.4",
        "difficulty": "Hard",
        "displayText": "2920. Maximum Points After Collecting Coins From All Nodes"
    },
    "2921": {
        "id": "2921",
        "name": "Maximum Profitable Triplets With Increasing Prices II",
        "acceptance": "46.0",
        "difficulty": "Hard",
        "displayText": "2921. Maximum Profitable Triplets With Increasing Prices II"
    },
    "2922": {
        "id": "2922",
        "name": "Market Analysis III",
        "acceptance": "41.5",
        "difficulty": "Medium",
        "displayText": "2922. Market Analysis III"
    },
    "2923": {
        "id": "2923",
        "name": "Find Champion I",
        "acceptance": "72.2",
        "difficulty": "Easy",
        "displayText": "2923. Find Champion I"
    },
    "2924": {
        "id": "2924",
        "name": "Find Champion II",
        "acceptance": "70.0",
        "difficulty": "Medium",
        "displayText": "2924. Find Champion II"
    },
    "2925": {
        "id": "2925",
        "name": "Maximum Score After Applying Operations on a Tree",
        "acceptance": "46.7",
        "difficulty": "Medium",
        "displayText": "2925. Maximum Score After Applying Operations on a Tree"
    },
    "2926": {
        "id": "2926",
        "name": "Maximum Balanced Subsequence Sum",
        "acceptance": "24.7",
        "difficulty": "Hard",
        "displayText": "2926. Maximum Balanced Subsequence Sum"
    },
    "2927": {
        "id": "2927",
        "name": "Distribute Candies Among Children III",
        "acceptance": "43.8",
        "difficulty": "Hard",
        "displayText": "2927. Distribute Candies Among Children III"
    },
    "2928": {
        "id": "2928",
        "name": "Distribute Candies Among Children I",
        "acceptance": "73.0",
        "difficulty": "Easy",
        "displayText": "2928. Distribute Candies Among Children I"
    },
    "2929": {
        "id": "2929",
        "name": "Distribute Candies Among Children II",
        "acceptance": "34.8",
        "difficulty": "Medium",
        "displayText": "2929. Distribute Candies Among Children II"
    },
    "2930": {
        "id": "2930",
        "name": "Number of Strings Which Can Be Rearranged to Contain Substring",
        "acceptance": "56.0",
        "difficulty": "Medium",
        "displayText": "2930. Number of Strings Which Can Be Rearranged to Contain Substring"
    },
    "2931": {
        "id": "2931",
        "name": "Maximum Spending After Buying Items",
        "acceptance": "59.6",
        "difficulty": "Hard",
        "displayText": "2931. Maximum Spending After Buying Items"
    },
    "2932": {
        "id": "2932",
        "name": "Maximum Strong Pair XOR I",
        "acceptance": "74.5",
        "difficulty": "Easy",
        "displayText": "2932. Maximum Strong Pair XOR I"
    },
    "2933": {
        "id": "2933",
        "name": "High-Access Employees",
        "acceptance": "45.7",
        "difficulty": "Medium",
        "displayText": "2933. High-Access Employees"
    },
    "2934": {
        "id": "2934",
        "name": "Minimum Operations to Maximize Last Elements in Arrays",
        "acceptance": "43.0",
        "difficulty": "Medium",
        "displayText": "2934. Minimum Operations to Maximize Last Elements in Arrays"
    },
    "2935": {
        "id": "2935",
        "name": "Maximum Strong Pair XOR II",
        "acceptance": "30.4",
        "difficulty": "Hard",
        "displayText": "2935. Maximum Strong Pair XOR II"
    },
    "2936": {
        "id": "2936",
        "name": "Number of Equal Numbers Blocks",
        "acceptance": "62.6",
        "difficulty": "Medium",
        "displayText": "2936. Number of Equal Numbers Blocks"
    },
    "2937": {
        "id": "2937",
        "name": "Make Three Strings Equal",
        "acceptance": "42.9",
        "difficulty": "Easy",
        "displayText": "2937. Make Three Strings Equal"
    },
    "2938": {
        "id": "2938",
        "name": "Separate Black and White Balls",
        "acceptance": "64.7",
        "difficulty": "Medium",
        "displayText": "2938. Separate Black and White Balls"
    },
    "2939": {
        "id": "2939",
        "name": "Maximum Xor Product",
        "acceptance": "26.7",
        "difficulty": "Medium",
        "displayText": "2939. Maximum Xor Product"
    },
    "2940": {
        "id": "2940",
        "name": "Find Building Where Alice and Bob Can Meet",
        "acceptance": "52.4",
        "difficulty": "Hard",
        "displayText": "2940. Find Building Where Alice and Bob Can Meet"
    },
    "2941": {
        "id": "2941",
        "name": "Maximum GCD-Sum of a Subarray",
        "acceptance": "36.3",
        "difficulty": "Hard",
        "displayText": "2941. Maximum GCD-Sum of a Subarray"
    },
    "2942": {
        "id": "2942",
        "name": "Find Words Containing Character",
        "acceptance": "88.4",
        "difficulty": "Easy",
        "displayText": "2942. Find Words Containing Character"
    },
    "2943": {
        "id": "2943",
        "name": "Maximize Area of Square Hole in Grid",
        "acceptance": "36.7",
        "difficulty": "Medium",
        "displayText": "2943. Maximize Area of Square Hole in Grid"
    },
    "2944": {
        "id": "2944",
        "name": "Minimum Number of Coins for Fruits",
        "acceptance": "46.4",
        "difficulty": "Medium",
        "displayText": "2944. Minimum Number of Coins for Fruits"
    },
    "2945": {
        "id": "2945",
        "name": "Find Maximum Non-decreasing Array Length",
        "acceptance": "16.8",
        "difficulty": "Hard",
        "displayText": "2945. Find Maximum Non-decreasing Array Length"
    },
    "2946": {
        "id": "2946",
        "name": "Matrix Similarity After Cyclic Shifts",
        "acceptance": "57.9",
        "difficulty": "Easy",
        "displayText": "2946. Matrix Similarity After Cyclic Shifts"
    },
    "2947": {
        "id": "2947",
        "name": "Count Beautiful Substrings I",
        "acceptance": "59.3",
        "difficulty": "Medium",
        "displayText": "2947. Count Beautiful Substrings I"
    },
    "2948": {
        "id": "2948",
        "name": "Make Lexicographically Smallest Array by Swapping Elements",
        "acceptance": "60.2",
        "difficulty": "Medium",
        "displayText": "2948. Make Lexicographically Smallest Array by Swapping Elements"
    },
    "2949": {
        "id": "2949",
        "name": "Count Beautiful Substrings II",
        "acceptance": "24.5",
        "difficulty": "Hard",
        "displayText": "2949. Count Beautiful Substrings II"
    },
    "2950": {
        "id": "2950",
        "name": "Number of Divisible Substrings",
        "acceptance": "73.4",
        "difficulty": "Medium",
        "displayText": "2950. Number of Divisible Substrings"
    },
    "2951": {
        "id": "2951",
        "name": "Find the Peaks",
        "acceptance": "73.9",
        "difficulty": "Easy",
        "displayText": "2951. Find the Peaks"
    },
    "2952": {
        "id": "2952",
        "name": "Minimum Number of Coins to be Added",
        "acceptance": "56.4",
        "difficulty": "Medium",
        "displayText": "2952. Minimum Number of Coins to be Added"
    },
    "2953": {
        "id": "2953",
        "name": "Count Complete Substrings",
        "acceptance": "28.2",
        "difficulty": "Hard",
        "displayText": "2953. Count Complete Substrings"
    },
    "2954": {
        "id": "2954",
        "name": "Count the Number of Infection Sequences",
        "acceptance": "33.0",
        "difficulty": "Hard",
        "displayText": "2954. Count the Number of Infection Sequences"
    },
    "2955": {
        "id": "2955",
        "name": "Number of Same-End Substrings",
        "acceptance": "61.3",
        "difficulty": "Medium",
        "displayText": "2955. Number of Same-End Substrings"
    },
    "2956": {
        "id": "2956",
        "name": "Find Common Elements Between Two Arrays",
        "acceptance": "83.4",
        "difficulty": "Easy",
        "displayText": "2956. Find Common Elements Between Two Arrays"
    },
    "2957": {
        "id": "2957",
        "name": "Remove Adjacent Almost-Equal Characters",
        "acceptance": "51.4",
        "difficulty": "Medium",
        "displayText": "2957. Remove Adjacent Almost-Equal Characters"
    },
    "2958": {
        "id": "2958",
        "name": "Length of Longest Subarray With at Most K Frequency",
        "acceptance": "55.6",
        "difficulty": "Medium",
        "displayText": "2958. Length of Longest Subarray With at Most K Frequency"
    },
    "2959": {
        "id": "2959",
        "name": "Number of Possible Sets of Closing Branches",
        "acceptance": "47.9",
        "difficulty": "Hard",
        "displayText": "2959. Number of Possible Sets of Closing Branches"
    },
    "2960": {
        "id": "2960",
        "name": "Count Tested Devices After Test Operations",
        "acceptance": "78.3",
        "difficulty": "Easy",
        "displayText": "2960. Count Tested Devices After Test Operations"
    },
    "2961": {
        "id": "2961",
        "name": "Double Modular Exponentiation",
        "acceptance": "46.9",
        "difficulty": "Medium",
        "displayText": "2961. Double Modular Exponentiation"
    },
    "2962": {
        "id": "2962",
        "name": "Count Subarrays Where Max Element Appears at Least K Times",
        "acceptance": "58.4",
        "difficulty": "Medium",
        "displayText": "2962. Count Subarrays Where Max Element Appears at Least K Times"
    },
    "2963": {
        "id": "2963",
        "name": "Count the Number of Good Partitions",
        "acceptance": "46.3",
        "difficulty": "Hard",
        "displayText": "2963. Count the Number of Good Partitions"
    },
    "2964": {
        "id": "2964",
        "name": "Number of Divisible Triplet Sums",
        "acceptance": "67.2",
        "difficulty": "Medium",
        "displayText": "2964. Number of Divisible Triplet Sums"
    },
    "2965": {
        "id": "2965",
        "name": "Find Missing and Repeated Values",
        "acceptance": "83.7",
        "difficulty": "Easy",
        "displayText": "2965. Find Missing and Repeated Values"
    },
    "2966": {
        "id": "2966",
        "name": "Divide Array Into Arrays With Max Difference",
        "acceptance": "71.7",
        "difficulty": "Medium",
        "displayText": "2966. Divide Array Into Arrays With Max Difference"
    },
    "2967": {
        "id": "2967",
        "name": "Minimum Cost to Make Array Equalindromic",
        "acceptance": "22.3",
        "difficulty": "Medium",
        "displayText": "2967. Minimum Cost to Make Array Equalindromic"
    },
    "2968": {
        "id": "2968",
        "name": "Apply Operations to Maximize Frequency Score",
        "acceptance": "36.0",
        "difficulty": "Hard",
        "displayText": "2968. Apply Operations to Maximize Frequency Score"
    },
    "2969": {
        "id": "2969",
        "name": "Minimum Number of Coins for Fruits II",
        "acceptance": "45.1",
        "difficulty": "Hard",
        "displayText": "2969. Minimum Number of Coins for Fruits II"
    },
    "2970": {
        "id": "2970",
        "name": "Count the Number of Incremovable Subarrays I",
        "acceptance": "54.3",
        "difficulty": "Easy",
        "displayText": "2970. Count the Number of Incremovable Subarrays I"
    },
    "2971": {
        "id": "2971",
        "name": "Find Polygon With the Largest Perimeter",
        "acceptance": "65.3",
        "difficulty": "Medium",
        "displayText": "2971. Find Polygon With the Largest Perimeter"
    },
    "2972": {
        "id": "2972",
        "name": "Count the Number of Incremovable Subarrays II",
        "acceptance": "38.6",
        "difficulty": "Hard",
        "displayText": "2972. Count the Number of Incremovable Subarrays II"
    },
    "2973": {
        "id": "2973",
        "name": "Find Number of Coins to Place in Tree Nodes",
        "acceptance": "35.9",
        "difficulty": "Hard",
        "displayText": "2973. Find Number of Coins to Place in Tree Nodes"
    },
    "2974": {
        "id": "2974",
        "name": "Minimum Number Game",
        "acceptance": "84.7",
        "difficulty": "Easy",
        "displayText": "2974. Minimum Number Game"
    },
    "2975": {
        "id": "2975",
        "name": "Maximum Square Area by Removing Fences From a Field",
        "acceptance": "23.9",
        "difficulty": "Medium",
        "displayText": "2975. Maximum Square Area by Removing Fences From a Field"
    },
    "2976": {
        "id": "2976",
        "name": "Minimum Cost to Convert String I",
        "acceptance": "57.7",
        "difficulty": "Medium",
        "displayText": "2976. Minimum Cost to Convert String I"
    },
    "2977": {
        "id": "2977",
        "name": "Minimum Cost to Convert String II",
        "acceptance": "25.3",
        "difficulty": "Hard",
        "displayText": "2977. Minimum Cost to Convert String II"
    },
    "2978": {
        "id": "2978",
        "name": "Symmetric Coordinates",
        "acceptance": "40.7",
        "difficulty": "Medium",
        "displayText": "2978. Symmetric Coordinates"
    },
    "2979": {
        "id": "2979",
        "name": "Most Expensive Item That Can Not Be Bought",
        "acceptance": "80.3",
        "difficulty": "Medium",
        "displayText": "2979. Most Expensive Item That Can Not Be Bought"
    },
    "2980": {
        "id": "2980",
        "name": "Check if Bitwise OR Has Trailing Zeros",
        "acceptance": "69.5",
        "difficulty": "Easy",
        "displayText": "2980. Check if Bitwise OR Has Trailing Zeros"
    },
    "2981": {
        "id": "2981",
        "name": "Find Longest Special Substring That Occurs Thrice I",
        "acceptance": "61.9",
        "difficulty": "Medium",
        "displayText": "2981. Find Longest Special Substring That Occurs Thrice I"
    },
    "2982": {
        "id": "2982",
        "name": "Find Longest Special Substring That Occurs Thrice II",
        "acceptance": "38.2",
        "difficulty": "Medium",
        "displayText": "2982. Find Longest Special Substring That Occurs Thrice II"
    },
    "2983": {
        "id": "2983",
        "name": "Palindrome Rearrangement Queries",
        "acceptance": "22.9",
        "difficulty": "Hard",
        "displayText": "2983. Palindrome Rearrangement Queries"
    },
    "2984": {
        "id": "2984",
        "name": "Find Peak Calling Hours for Each City",
        "acceptance": "61.9",
        "difficulty": "Medium",
        "displayText": "2984. Find Peak Calling Hours for Each City"
    },
    "2985": {
        "id": "2985",
        "name": "Calculate Compressed Mean",
        "acceptance": "88.2",
        "difficulty": "Easy",
        "displayText": "2985. Calculate Compressed Mean"
    },
    "2986": {
        "id": "2986",
        "name": "Find Third Transaction",
        "acceptance": "53.7",
        "difficulty": "Medium",
        "displayText": "2986. Find Third Transaction"
    },
    "2987": {
        "id": "2987",
        "name": "Find Expensive Cities",
        "acceptance": "80.0",
        "difficulty": "Easy",
        "displayText": "2987. Find Expensive Cities"
    },
    "2988": {
        "id": "2988",
        "name": "Manager of the Largest Department",
        "acceptance": "80.8",
        "difficulty": "Medium",
        "displayText": "2988. Manager of the Largest Department"
    },
    "2989": {
        "id": "2989",
        "name": "Class Performance",
        "acceptance": "89.4",
        "difficulty": "Medium",
        "displayText": "2989. Class Performance"
    },
    "2990": {
        "id": "2990",
        "name": "Loan Types",
        "acceptance": "63.7",
        "difficulty": "Easy",
        "displayText": "2990. Loan Types"
    },
    "2991": {
        "id": "2991",
        "name": "Top Three Wineries",
        "acceptance": "57.1",
        "difficulty": "Hard",
        "displayText": "2991. Top Three Wineries"
    },
    "2992": {
        "id": "2992",
        "name": "Number of Self-Divisible Permutations",
        "acceptance": "71.9",
        "difficulty": "Medium",
        "displayText": "2992. Number of Self-Divisible Permutations"
    },
    "2993": {
        "id": "2993",
        "name": "Friday Purchases I",
        "acceptance": "81.1",
        "difficulty": "Medium",
        "displayText": "2993. Friday Purchases I"
    },
    "2994": {
        "id": "2994",
        "name": "Friday Purchases II",
        "acceptance": "76.6",
        "difficulty": "Hard",
        "displayText": "2994. Friday Purchases II"
    },
    "2995": {
        "id": "2995",
        "name": "Viewers Turned Streamers",
        "acceptance": "43.1",
        "difficulty": "Hard",
        "displayText": "2995. Viewers Turned Streamers"
    },
    "2996": {
        "id": "2996",
        "name": "Smallest Missing Integer Greater Than Sequential Prefix Sum",
        "acceptance": "33.4",
        "difficulty": "Easy",
        "displayText": "2996. Smallest Missing Integer Greater Than Sequential Prefix Sum"
    },
    "2997": {
        "id": "2997",
        "name": "Minimum Number of Operations to Make Array XOR Equal to K",
        "acceptance": "85.7",
        "difficulty": "Medium",
        "displayText": "2997. Minimum Number of Operations to Make Array XOR Equal to K"
    },
    "2998": {
        "id": "2998",
        "name": "Minimum Number of Operations to Make X and Y Equal",
        "acceptance": "47.0",
        "difficulty": "Medium",
        "displayText": "2998. Minimum Number of Operations to Make X and Y Equal"
    },
    "2999": {
        "id": "2999",
        "name": "Count the Number of Powerful Integers",
        "acceptance": "46.7",
        "difficulty": "Hard",
        "displayText": "2999. Count the Number of Powerful Integers"
    },
    "3000": {
        "id": "3000",
        "name": "Maximum Area of Longest Diagonal Rectangle",
        "acceptance": "36.3",
        "difficulty": "Easy",
        "displayText": "3000. Maximum Area of Longest Diagonal Rectangle"
    },
    "3001": {
        "id": "3001",
        "name": "Minimum Moves to Capture The Queen",
        "acceptance": "21.3",
        "difficulty": "Medium",
        "displayText": "3001. Minimum Moves to Capture The Queen"
    },
    "3002": {
        "id": "3002",
        "name": "Maximum Size of a Set After Removals",
        "acceptance": "44.6",
        "difficulty": "Medium",
        "displayText": "3002. Maximum Size of a Set After Removals"
    },
    "3003": {
        "id": "3003",
        "name": "Maximize the Number of Partitions After Operations",
        "acceptance": "27.2",
        "difficulty": "Hard",
        "displayText": "3003. Maximize the Number of Partitions After Operations"
    },
    "3004": {
        "id": "3004",
        "name": "Maximum Subtree of the Same Color",
        "acceptance": "56.7",
        "difficulty": "Medium",
        "displayText": "3004. Maximum Subtree of the Same Color"
    },
    "3005": {
        "id": "3005",
        "name": "Count Elements With Maximum Frequency",
        "acceptance": "77.9",
        "difficulty": "Easy",
        "displayText": "3005. Count Elements With Maximum Frequency"
    },
    "3006": {
        "id": "3006",
        "name": "Find Beautiful Indices in the Given Array I",
        "acceptance": "37.9",
        "difficulty": "Medium",
        "displayText": "3006. Find Beautiful Indices in the Given Array I"
    },
    "3007": {
        "id": "3007",
        "name": "Maximum Number That Sum of the Prices Is Less Than or Equal to K",
        "acceptance": "37.0",
        "difficulty": "Medium",
        "displayText": "3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K"
    },
    "3008": {
        "id": "3008",
        "name": "Find Beautiful Indices in the Given Array II",
        "acceptance": "26.1",
        "difficulty": "Hard",
        "displayText": "3008. Find Beautiful Indices in the Given Array II"
    },
    "3009": {
        "id": "3009",
        "name": "Maximum Number of Intersections on the Chart",
        "acceptance": "45.0",
        "difficulty": "Hard",
        "displayText": "3009. Maximum Number of Intersections on the Chart"
    },
    "3010": {
        "id": "3010",
        "name": "Divide an Array Into Subarrays With Minimum Cost I",
        "acceptance": "65.5",
        "difficulty": "Easy",
        "displayText": "3010. Divide an Array Into Subarrays With Minimum Cost I"
    },
    "3011": {
        "id": "3011",
        "name": "Find if Array Can Be Sorted",
        "acceptance": "66.5",
        "difficulty": "Medium",
        "displayText": "3011. Find if Array Can Be Sorted"
    },
    "3012": {
        "id": "3012",
        "name": "Minimize Length of Array Using Operations",
        "acceptance": "34.6",
        "difficulty": "Medium",
        "displayText": "3012. Minimize Length of Array Using Operations"
    },
    "3013": {
        "id": "3013",
        "name": "Divide an Array Into Subarrays With Minimum Cost II",
        "acceptance": "29.7",
        "difficulty": "Hard",
        "displayText": "3013. Divide an Array Into Subarrays With Minimum Cost II"
    },
    "3014": {
        "id": "3014",
        "name": "Minimum Number of Pushes to Type Word I",
        "acceptance": "66.0",
        "difficulty": "Easy",
        "displayText": "3014. Minimum Number of Pushes to Type Word I"
    },
    "3015": {
        "id": "3015",
        "name": "Count the Number of Houses at a Certain Distance I",
        "acceptance": "56.6",
        "difficulty": "Medium",
        "displayText": "3015. Count the Number of Houses at a Certain Distance I"
    },
    "3016": {
        "id": "3016",
        "name": "Minimum Number of Pushes to Type Word II",
        "acceptance": "79.9",
        "difficulty": "Medium",
        "displayText": "3016. Minimum Number of Pushes to Type Word II"
    },
    "3017": {
        "id": "3017",
        "name": "Count the Number of Houses at a Certain Distance II",
        "acceptance": "21.4",
        "difficulty": "Hard",
        "displayText": "3017. Count the Number of Houses at a Certain Distance II"
    },
    "3018": {
        "id": "3018",
        "name": "Maximum Number of Removal Queries That Can Be Processed I",
        "acceptance": "43.1",
        "difficulty": "Hard",
        "displayText": "3018. Maximum Number of Removal Queries That Can Be Processed I"
    },
    "3019": {
        "id": "3019",
        "name": "Number of Changing Keys",
        "acceptance": "79.5",
        "difficulty": "Easy",
        "displayText": "3019. Number of Changing Keys"
    },
    "3020": {
        "id": "3020",
        "name": "Find the Maximum Number of Elements in Subset",
        "acceptance": "26.3",
        "difficulty": "Medium",
        "displayText": "3020. Find the Maximum Number of Elements in Subset"
    },
    "3021": {
        "id": "3021",
        "name": "Alice and Bob Playing Flower Game",
        "acceptance": "47.0",
        "difficulty": "Medium",
        "displayText": "3021. Alice and Bob Playing Flower Game"
    },
    "3022": {
        "id": "3022",
        "name": "Minimize OR of Remaining Elements Using Operations",
        "acceptance": "28.7",
        "difficulty": "Hard",
        "displayText": "3022. Minimize OR of Remaining Elements Using Operations"
    },
    "3023": {
        "id": "3023",
        "name": "Find Pattern in Infinite Stream I",
        "acceptance": "56.5",
        "difficulty": "Medium",
        "displayText": "3023. Find Pattern in Infinite Stream I"
    },
    "3024": {
        "id": "3024",
        "name": "Type of Triangle",
        "acceptance": "38.0",
        "difficulty": "Easy",
        "displayText": "3024. Type of Triangle"
    },
    "3025": {
        "id": "3025",
        "name": "Find the Number of Ways to Place People I",
        "acceptance": "40.5",
        "difficulty": "Medium",
        "displayText": "3025. Find the Number of Ways to Place People I"
    },
    "3026": {
        "id": "3026",
        "name": "Maximum Good Subarray Sum",
        "acceptance": "20.0",
        "difficulty": "Medium",
        "displayText": "3026. Maximum Good Subarray Sum"
    },
    "3027": {
        "id": "3027",
        "name": "Find the Number of Ways to Place People II",
        "acceptance": "45.7",
        "difficulty": "Hard",
        "displayText": "3027. Find the Number of Ways to Place People II"
    },
    "3028": {
        "id": "3028",
        "name": "Ant on the Boundary",
        "acceptance": "73.5",
        "difficulty": "Easy",
        "displayText": "3028. Ant on the Boundary"
    },
    "3029": {
        "id": "3029",
        "name": "Minimum Time to Revert Word to Initial State I",
        "acceptance": "41.1",
        "difficulty": "Medium",
        "displayText": "3029. Minimum Time to Revert Word to Initial State I"
    },
    "3030": {
        "id": "3030",
        "name": "Find the Grid of Region Average",
        "acceptance": "42.0",
        "difficulty": "Medium",
        "displayText": "3030. Find the Grid of Region Average"
    },
    "3031": {
        "id": "3031",
        "name": "Minimum Time to Revert Word to Initial State II",
        "acceptance": "34.2",
        "difficulty": "Hard",
        "displayText": "3031. Minimum Time to Revert Word to Initial State II"
    },
    "3032": {
        "id": "3032",
        "name": "Count Numbers With Unique Digits II",
        "acceptance": "88.0",
        "difficulty": "Easy",
        "displayText": "3032. Count Numbers With Unique Digits II"
    },
    "3033": {
        "id": "3033",
        "name": "Modify the Matrix",
        "acceptance": "68.2",
        "difficulty": "Easy",
        "displayText": "3033. Modify the Matrix"
    },
    "3034": {
        "id": "3034",
        "name": "Number of Subarrays That Match a Pattern I",
        "acceptance": "66.3",
        "difficulty": "Medium",
        "displayText": "3034. Number of Subarrays That Match a Pattern I"
    },
    "3035": {
        "id": "3035",
        "name": "Maximum Palindromes After Operations",
        "acceptance": "42.9",
        "difficulty": "Medium",
        "displayText": "3035. Maximum Palindromes After Operations"
    },
    "3036": {
        "id": "3036",
        "name": "Number of Subarrays That Match a Pattern II",
        "acceptance": "31.8",
        "difficulty": "Hard",
        "displayText": "3036. Number of Subarrays That Match a Pattern II"
    },
    "3037": {
        "id": "3037",
        "name": "Find Pattern in Infinite Stream II",
        "acceptance": "68.3",
        "difficulty": "Hard",
        "displayText": "3037. Find Pattern in Infinite Stream II"
    },
    "3038": {
        "id": "3038",
        "name": "Maximum Number of Operations With the Same Score I",
        "acceptance": "51.7",
        "difficulty": "Easy",
        "displayText": "3038. Maximum Number of Operations With the Same Score I"
    },
    "3039": {
        "id": "3039",
        "name": "Apply Operations to Make String Empty",
        "acceptance": "55.9",
        "difficulty": "Medium",
        "displayText": "3039. Apply Operations to Make String Empty"
    },
    "3040": {
        "id": "3040",
        "name": "Maximum Number of Operations With the Same Score II",
        "acceptance": "32.9",
        "difficulty": "Medium",
        "displayText": "3040. Maximum Number of Operations With the Same Score II"
    },
    "3041": {
        "id": "3041",
        "name": "Maximize Consecutive Elements in an Array After Modification",
        "acceptance": "32.0",
        "difficulty": "Hard",
        "displayText": "3041. Maximize Consecutive Elements in an Array After Modification"
    },
    "3042": {
        "id": "3042",
        "name": "Count Prefix and Suffix Pairs I",
        "acceptance": "77.6",
        "difficulty": "Easy",
        "displayText": "3042. Count Prefix and Suffix Pairs I"
    },
    "3043": {
        "id": "3043",
        "name": "Find the Length of the Longest Common Prefix",
        "acceptance": "56.3",
        "difficulty": "Medium",
        "displayText": "3043. Find the Length of the Longest Common Prefix"
    },
    "3044": {
        "id": "3044",
        "name": "Most Frequent Prime",
        "acceptance": "44.7",
        "difficulty": "Medium",
        "displayText": "3044. Most Frequent Prime"
    },
    "3045": {
        "id": "3045",
        "name": "Count Prefix and Suffix Pairs II",
        "acceptance": "26.9",
        "difficulty": "Hard",
        "displayText": "3045. Count Prefix and Suffix Pairs II"
    },
    "3046": {
        "id": "3046",
        "name": "Split the Array",
        "acceptance": "58.9",
        "difficulty": "Easy",
        "displayText": "3046. Split the Array"
    },
    "3047": {
        "id": "3047",
        "name": "Find the Largest Area of Square Inside Two Rectangles",
        "acceptance": "44.8",
        "difficulty": "Medium",
        "displayText": "3047. Find the Largest Area of Square Inside Two Rectangles"
    },
    "3048": {
        "id": "3048",
        "name": "Earliest Second to Mark Indices I",
        "acceptance": "34.2",
        "difficulty": "Medium",
        "displayText": "3048. Earliest Second to Mark Indices I"
    },
    "3049": {
        "id": "3049",
        "name": "Earliest Second to Mark Indices II",
        "acceptance": "20.1",
        "difficulty": "Hard",
        "displayText": "3049. Earliest Second to Mark Indices II"
    },
    "3050": {
        "id": "3050",
        "name": "Pizza Toppings Cost Analysis",
        "acceptance": "67.7",
        "difficulty": "Medium",
        "displayText": "3050. Pizza Toppings Cost Analysis"
    },
    "3051": {
        "id": "3051",
        "name": "Find Candidates for Data Scientist Position",
        "acceptance": "76.0",
        "difficulty": "Easy",
        "displayText": "3051. Find Candidates for Data Scientist Position"
    },
    "3052": {
        "id": "3052",
        "name": "Maximize Items",
        "acceptance": "74.8",
        "difficulty": "Hard",
        "displayText": "3052. Maximize Items"
    },
    "3053": {
        "id": "3053",
        "name": "Classifying Triangles by Lengths",
        "acceptance": "50.5",
        "difficulty": "Easy",
        "displayText": "3053. Classifying Triangles by Lengths"
    },
    "3054": {
        "id": "3054",
        "name": "Binary Tree Nodes",
        "acceptance": "79.2",
        "difficulty": "Medium",
        "displayText": "3054. Binary Tree Nodes"
    },
    "3055": {
        "id": "3055",
        "name": "Top Percentile Fraud",
        "acceptance": "58.4",
        "difficulty": "Medium",
        "displayText": "3055. Top Percentile Fraud"
    },
    "3056": {
        "id": "3056",
        "name": "Snaps Analysis",
        "acceptance": "58.4",
        "difficulty": "Medium",
        "displayText": "3056. Snaps Analysis"
    },
    "3057": {
        "id": "3057",
        "name": "Employees Project Allocation",
        "acceptance": "68.5",
        "difficulty": "Hard",
        "displayText": "3057. Employees Project Allocation"
    },
    "3058": {
        "id": "3058",
        "name": "Friends With No Mutual Friends",
        "acceptance": "48.5",
        "difficulty": "Medium",
        "displayText": "3058. Friends With No Mutual Friends"
    },
    "3059": {
        "id": "3059",
        "name": "Find All Unique Email Domains",
        "acceptance": "70.3",
        "difficulty": "Easy",
        "displayText": "3059. Find All Unique Email Domains"
    },
    "3060": {
        "id": "3060",
        "name": "User Activities within Time Bounds",
        "acceptance": "39.5",
        "difficulty": "Hard",
        "displayText": "3060. User Activities within Time Bounds"
    },
    "3061": {
        "id": "3061",
        "name": "Calculate Trapping Rain Water",
        "acceptance": "82.1",
        "difficulty": "Hard",
        "displayText": "3061. Calculate Trapping Rain Water"
    },
    "3062": {
        "id": "3062",
        "name": "Winner of the Linked List Game",
        "acceptance": "79.0",
        "difficulty": "Easy",
        "displayText": "3062. Winner of the Linked List Game"
    },
    "3063": {
        "id": "3063",
        "name": "Linked List Frequency",
        "acceptance": "85.7",
        "difficulty": "Easy",
        "displayText": "3063. Linked List Frequency"
    },
    "3064": {
        "id": "3064",
        "name": "Guess the Number Using Bitwise Questions I",
        "acceptance": "90.1",
        "difficulty": "Medium",
        "displayText": "3064. Guess the Number Using Bitwise Questions I"
    },
    "3065": {
        "id": "3065",
        "name": "Minimum Operations to Exceed Threshold Value I",
        "acceptance": "85.9",
        "difficulty": "Easy",
        "displayText": "3065. Minimum Operations to Exceed Threshold Value I"
    },
    "3066": {
        "id": "3066",
        "name": "Minimum Operations to Exceed Threshold Value II",
        "acceptance": "45.7",
        "difficulty": "Medium",
        "displayText": "3066. Minimum Operations to Exceed Threshold Value II"
    },
    "3067": {
        "id": "3067",
        "name": "Count Pairs of Connectable Servers in a Weighted Tree Network",
        "acceptance": "53.8",
        "difficulty": "Medium",
        "displayText": "3067. Count Pairs of Connectable Servers in a Weighted Tree Network"
    },
    "3068": {
        "id": "3068",
        "name": "Find the Maximum Sum of Node Values",
        "acceptance": "65.2",
        "difficulty": "Hard",
        "displayText": "3068. Find the Maximum Sum of Node Values"
    },
    "3069": {
        "id": "3069",
        "name": "Distribute Elements Into Two Arrays I",
        "acceptance": "72.8",
        "difficulty": "Easy",
        "displayText": "3069. Distribute Elements Into Two Arrays I"
    },
    "3070": {
        "id": "3070",
        "name": "Count Submatrices with Top-Left Element and Sum Less Than k",
        "acceptance": "56.9",
        "difficulty": "Medium",
        "displayText": "3070. Count Submatrices with Top-Left Element and Sum Less Than k"
    },
    "3071": {
        "id": "3071",
        "name": "Minimum Operations to Write the Letter Y on a Grid",
        "acceptance": "61.2",
        "difficulty": "Medium",
        "displayText": "3071. Minimum Operations to Write the Letter Y on a Grid"
    },
    "3072": {
        "id": "3072",
        "name": "Distribute Elements Into Two Arrays II",
        "acceptance": "29.0",
        "difficulty": "Hard",
        "displayText": "3072. Distribute Elements Into Two Arrays II"
    },
    "3073": {
        "id": "3073",
        "name": "Maximum Increasing Triplet Value",
        "acceptance": "35.3",
        "difficulty": "Medium",
        "displayText": "3073. Maximum Increasing Triplet Value"
    },
    "3074": {
        "id": "3074",
        "name": "Apple Redistribution into Boxes",
        "acceptance": "67.9",
        "difficulty": "Easy",
        "displayText": "3074. Apple Redistribution into Boxes"
    },
    "3075": {
        "id": "3075",
        "name": "Maximize Happiness of Selected Children",
        "acceptance": "54.8",
        "difficulty": "Medium",
        "displayText": "3075. Maximize Happiness of Selected Children"
    },
    "3076": {
        "id": "3076",
        "name": "Shortest Uncommon Substring in an Array",
        "acceptance": "47.5",
        "difficulty": "Medium",
        "displayText": "3076. Shortest Uncommon Substring in an Array"
    },
    "3077": {
        "id": "3077",
        "name": "Maximum Strength of K Disjoint Subarrays",
        "acceptance": "26.6",
        "difficulty": "Hard",
        "displayText": "3077. Maximum Strength of K Disjoint Subarrays"
    },
    "3078": {
        "id": "3078",
        "name": "Match Alphanumerical Pattern in Matrix I",
        "acceptance": "63.6",
        "difficulty": "Medium",
        "displayText": "3078. Match Alphanumerical Pattern in Matrix I"
    },
    "3079": {
        "id": "3079",
        "name": "Find the Sum of Encrypted Integers",
        "acceptance": "73.3",
        "difficulty": "Easy",
        "displayText": "3079. Find the Sum of Encrypted Integers"
    },
    "3080": {
        "id": "3080",
        "name": "Mark Elements on Array by Performing Queries",
        "acceptance": "47.4",
        "difficulty": "Medium",
        "displayText": "3080. Mark Elements on Array by Performing Queries"
    },
    "3081": {
        "id": "3081",
        "name": "Replace Question Marks in String to Minimize Its Value",
        "acceptance": "27.6",
        "difficulty": "Medium",
        "displayText": "3081. Replace Question Marks in String to Minimize Its Value"
    },
    "3082": {
        "id": "3082",
        "name": "Find the Sum of the Power of All Subsequences",
        "acceptance": "36.2",
        "difficulty": "Hard",
        "displayText": "3082. Find the Sum of the Power of All Subsequences"
    },
    "3083": {
        "id": "3083",
        "name": "Existence of a Substring in a String and Its Reverse",
        "acceptance": "65.5",
        "difficulty": "Easy",
        "displayText": "3083. Existence of a Substring in a String and Its Reverse"
    },
    "3084": {
        "id": "3084",
        "name": "Count Substrings Starting and Ending with Given Character",
        "acceptance": "48.7",
        "difficulty": "Medium",
        "displayText": "3084. Count Substrings Starting and Ending with Given Character"
    },
    "3085": {
        "id": "3085",
        "name": "Minimum Deletions to Make String K-Special",
        "acceptance": "44.2",
        "difficulty": "Medium",
        "displayText": "3085. Minimum Deletions to Make String K-Special"
    },
    "3086": {
        "id": "3086",
        "name": "Minimum Moves to Pick K Ones",
        "acceptance": "20.6",
        "difficulty": "Hard",
        "displayText": "3086. Minimum Moves to Pick K Ones"
    },
    "3087": {
        "id": "3087",
        "name": "Find Trending Hashtags",
        "acceptance": "61.5",
        "difficulty": "Medium",
        "displayText": "3087. Find Trending Hashtags"
    },
    "3088": {
        "id": "3088",
        "name": "Make String Anti-palindrome",
        "acceptance": "42.2",
        "difficulty": "Hard",
        "displayText": "3088. Make String Anti-palindrome"
    },
    "3089": {
        "id": "3089",
        "name": "Find Bursty Behavior",
        "acceptance": "39.2",
        "difficulty": "Medium",
        "displayText": "3089. Find Bursty Behavior"
    },
    "3090": {
        "id": "3090",
        "name": "Maximum Length Substring With Two Occurrences",
        "acceptance": "63.1",
        "difficulty": "Easy",
        "displayText": "3090. Maximum Length Substring With Two Occurrences"
    },
    "3091": {
        "id": "3091",
        "name": "Apply Operations to Make Sum of Array Greater Than or Equal to k",
        "acceptance": "43.2",
        "difficulty": "Medium",
        "displayText": "3091. Apply Operations to Make Sum of Array Greater Than or Equal to k"
    },
    "3092": {
        "id": "3092",
        "name": "Most Frequent IDs",
        "acceptance": "41.4",
        "difficulty": "Medium",
        "displayText": "3092. Most Frequent IDs"
    },
    "3093": {
        "id": "3093",
        "name": "Longest Common Suffix Queries",
        "acceptance": "36.8",
        "difficulty": "Hard",
        "displayText": "3093. Longest Common Suffix Queries"
    },
    "3094": {
        "id": "3094",
        "name": "Guess the Number Using Bitwise Questions II",
        "acceptance": "83.0",
        "difficulty": "Medium",
        "displayText": "3094. Guess the Number Using Bitwise Questions II"
    },
    "3095": {
        "id": "3095",
        "name": "Shortest Subarray With OR at Least K I",
        "acceptance": "42.5",
        "difficulty": "Easy",
        "displayText": "3095. Shortest Subarray With OR at Least K I"
    },
    "3096": {
        "id": "3096",
        "name": "Minimum Levels to Gain More Points",
        "acceptance": "38.9",
        "difficulty": "Medium",
        "displayText": "3096. Minimum Levels to Gain More Points"
    },
    "3097": {
        "id": "3097",
        "name": "Shortest Subarray With OR at Least K II",
        "acceptance": "50.2",
        "difficulty": "Medium",
        "displayText": "3097. Shortest Subarray With OR at Least K II"
    },
    "3098": {
        "id": "3098",
        "name": "Find the Sum of Subsequence Powers",
        "acceptance": "23.1",
        "difficulty": "Hard",
        "displayText": "3098. Find the Sum of Subsequence Powers"
    },
    "3099": {
        "id": "3099",
        "name": "Harshad Number",
        "acceptance": "83.1",
        "difficulty": "Easy",
        "displayText": "3099. Harshad Number"
    },
    "3100": {
        "id": "3100",
        "name": "Water Bottles II",
        "acceptance": "62.1",
        "difficulty": "Medium",
        "displayText": "3100. Water Bottles II"
    },
    "3101": {
        "id": "3101",
        "name": "Count Alternating Subarrays",
        "acceptance": "56.8",
        "difficulty": "Medium",
        "displayText": "3101. Count Alternating Subarrays"
    },
    "3102": {
        "id": "3102",
        "name": "Minimize Manhattan Distances",
        "acceptance": "31.2",
        "difficulty": "Hard",
        "displayText": "3102. Minimize Manhattan Distances"
    },
    "3103": {
        "id": "3103",
        "name": "Find Trending Hashtags II",
        "acceptance": "65.7",
        "difficulty": "Hard",
        "displayText": "3103. Find Trending Hashtags II"
    },
    "3104": {
        "id": "3104",
        "name": "Find Longest Self-Contained Substring",
        "acceptance": "59.1",
        "difficulty": "Hard",
        "displayText": "3104. Find Longest Self-Contained Substring"
    },
    "3105": {
        "id": "3105",
        "name": "Longest Strictly Increasing or Strictly Decreasing Subarray",
        "acceptance": "65.1",
        "difficulty": "Easy",
        "displayText": "3105. Longest Strictly Increasing or Strictly Decreasing Subarray"
    },
    "3106": {
        "id": "3106",
        "name": "Lexicographically Smallest String After Operations With Constraint",
        "acceptance": "62.1",
        "difficulty": "Medium",
        "displayText": "3106. Lexicographically Smallest String After Operations With Constraint"
    },
    "3107": {
        "id": "3107",
        "name": "Minimum Operations to Make Median of Array Equal to K",
        "acceptance": "46.5",
        "difficulty": "Medium",
        "displayText": "3107. Minimum Operations to Make Median of Array Equal to K"
    },
    "3108": {
        "id": "3108",
        "name": "Minimum Cost Walk in Weighted Graph",
        "acceptance": "68.6",
        "difficulty": "Hard",
        "displayText": "3108. Minimum Cost Walk in Weighted Graph"
    },
    "3109": {
        "id": "3109",
        "name": "Find the Index of Permutation",
        "acceptance": "36.7",
        "difficulty": "Medium",
        "displayText": "3109. Find the Index of Permutation"
    },
    "3110": {
        "id": "3110",
        "name": "Score of a String",
        "acceptance": "92.0",
        "difficulty": "Easy",
        "displayText": "3110. Score of a String"
    },
    "3111": {
        "id": "3111",
        "name": "Minimum Rectangles to Cover Points",
        "acceptance": "62.1",
        "difficulty": "Medium",
        "displayText": "3111. Minimum Rectangles to Cover Points"
    },
    "3112": {
        "id": "3112",
        "name": "Minimum Time to Visit Disappearing Nodes",
        "acceptance": "35.2",
        "difficulty": "Medium",
        "displayText": "3112. Minimum Time to Visit Disappearing Nodes"
    },
    "3113": {
        "id": "3113",
        "name": "Find the Number of Subarrays Where Boundary Elements Are Maximum",
        "acceptance": "29.6",
        "difficulty": "Hard",
        "displayText": "3113. Find the Number of Subarrays Where Boundary Elements Are Maximum"
    },
    "3114": {
        "id": "3114",
        "name": "Latest Time You Can Obtain After Replacing Characters",
        "acceptance": "35.4",
        "difficulty": "Easy",
        "displayText": "3114. Latest Time You Can Obtain After Replacing Characters"
    },
    "3115": {
        "id": "3115",
        "name": "Maximum Prime Difference",
        "acceptance": "57.2",
        "difficulty": "Medium",
        "displayText": "3115. Maximum Prime Difference"
    },
    "3116": {
        "id": "3116",
        "name": "Kth Smallest Amount With Single Denomination Combination",
        "acceptance": "18.2",
        "difficulty": "Hard",
        "displayText": "3116. Kth Smallest Amount With Single Denomination Combination"
    },
    "3117": {
        "id": "3117",
        "name": "Minimum Sum of Values by Dividing Array",
        "acceptance": "26.9",
        "difficulty": "Hard",
        "displayText": "3117. Minimum Sum of Values by Dividing Array"
    },
    "3118": {
        "id": "3118",
        "name": "Friday Purchase III",
        "acceptance": "56.2",
        "difficulty": "Medium",
        "displayText": "3118. Friday Purchase III"
    },
    "3119": {
        "id": "3119",
        "name": "Maximum Number of Potholes That Can Be Fixed",
        "acceptance": "54.0",
        "difficulty": "Medium",
        "displayText": "3119. Maximum Number of Potholes That Can Be Fixed"
    },
    "3120": {
        "id": "3120",
        "name": "Count the Number of Special Characters I",
        "acceptance": "65.1",
        "difficulty": "Easy",
        "displayText": "3120. Count the Number of Special Characters I"
    },
    "3121": {
        "id": "3121",
        "name": "Count the Number of Special Characters II",
        "acceptance": "41.8",
        "difficulty": "Medium",
        "displayText": "3121. Count the Number of Special Characters II"
    },
    "3122": {
        "id": "3122",
        "name": "Minimum Number of Operations to Satisfy Conditions",
        "acceptance": "40.1",
        "difficulty": "Medium",
        "displayText": "3122. Minimum Number of Operations to Satisfy Conditions"
    },
    "3123": {
        "id": "3123",
        "name": "Find Edges in Shortest Paths",
        "acceptance": "45.3",
        "difficulty": "Hard",
        "displayText": "3123. Find Edges in Shortest Paths"
    },
    "3124": {
        "id": "3124",
        "name": "Find Longest Calls",
        "acceptance": "61.6",
        "difficulty": "Medium",
        "displayText": "3124. Find Longest Calls"
    },
    "3125": {
        "id": "3125",
        "name": "Maximum Number That Makes Result of Bitwise AND Zero",
        "acceptance": "68.0",
        "difficulty": "Medium",
        "displayText": "3125. Maximum Number That Makes Result of Bitwise AND Zero"
    },
    "3126": {
        "id": "3126",
        "name": "Server Utilization Time",
        "acceptance": "60.8",
        "difficulty": "Medium",
        "displayText": "3126. Server Utilization Time"
    },
    "3127": {
        "id": "3127",
        "name": "Make a Square with the Same Color",
        "acceptance": "51.6",
        "difficulty": "Easy",
        "displayText": "3127. Make a Square with the Same Color"
    },
    "3128": {
        "id": "3128",
        "name": "Right Triangles",
        "acceptance": "46.6",
        "difficulty": "Medium",
        "displayText": "3128. Right Triangles"
    },
    "3129": {
        "id": "3129",
        "name": "Find All Possible Stable Binary Arrays I",
        "acceptance": "26.0",
        "difficulty": "Medium",
        "displayText": "3129. Find All Possible Stable Binary Arrays I"
    },
    "3130": {
        "id": "3130",
        "name": "Find All Possible Stable Binary Arrays II",
        "acceptance": "25.5",
        "difficulty": "Hard",
        "displayText": "3130. Find All Possible Stable Binary Arrays II"
    },
    "3131": {
        "id": "3131",
        "name": "Find the Integer Added to Array I",
        "acceptance": "81.9",
        "difficulty": "Easy",
        "displayText": "3131. Find the Integer Added to Array I"
    },
    "3132": {
        "id": "3132",
        "name": "Find the Integer Added to Array II",
        "acceptance": "31.6",
        "difficulty": "Medium",
        "displayText": "3132. Find the Integer Added to Array II"
    },
    "3133": {
        "id": "3133",
        "name": "Minimum Array End",
        "acceptance": "55.5",
        "difficulty": "Medium",
        "displayText": "3133. Minimum Array End"
    },
    "3134": {
        "id": "3134",
        "name": "Find the Median of the Uniqueness Array",
        "acceptance": "27.7",
        "difficulty": "Hard",
        "displayText": "3134. Find the Median of the Uniqueness Array"
    },
    "3135": {
        "id": "3135",
        "name": "Equalize Strings by Adding or Removing Characters at Ends",
        "acceptance": "55.0",
        "difficulty": "Medium",
        "displayText": "3135. Equalize Strings by Adding or Removing Characters at Ends"
    },
    "3136": {
        "id": "3136",
        "name": "Valid Word",
        "acceptance": "38.5",
        "difficulty": "Easy",
        "displayText": "3136. Valid Word"
    },
    "3137": {
        "id": "3137",
        "name": "Minimum Number of Operations to Make Word K-Periodic",
        "acceptance": "59.5",
        "difficulty": "Medium",
        "displayText": "3137. Minimum Number of Operations to Make Word K-Periodic"
    },
    "3138": {
        "id": "3138",
        "name": "Minimum Length of Anagram Concatenation",
        "acceptance": "40.5",
        "difficulty": "Medium",
        "displayText": "3138. Minimum Length of Anagram Concatenation"
    },
    "3139": {
        "id": "3139",
        "name": "Minimum Cost to Equalize Array",
        "acceptance": "17.6",
        "difficulty": "Hard",
        "displayText": "3139. Minimum Cost to Equalize Array"
    },
    "3140": {
        "id": "3140",
        "name": "Consecutive Available Seats II",
        "acceptance": "57.0",
        "difficulty": "Medium",
        "displayText": "3140. Consecutive Available Seats II"
    },
    "3141": {
        "id": "3141",
        "name": "Maximum Hamming Distances",
        "acceptance": "46.8",
        "difficulty": "Hard",
        "displayText": "3141. Maximum Hamming Distances"
    },
    "3142": {
        "id": "3142",
        "name": "Check if Grid Satisfies Conditions",
        "acceptance": "43.3",
        "difficulty": "Easy",
        "displayText": "3142. Check if Grid Satisfies Conditions"
    },
    "3143": {
        "id": "3143",
        "name": "Maximum Points Inside the Square",
        "acceptance": "37.9",
        "difficulty": "Medium",
        "displayText": "3143. Maximum Points Inside the Square"
    },
    "3144": {
        "id": "3144",
        "name": "Minimum Substring Partition of Equal Character Frequency",
        "acceptance": "38.8",
        "difficulty": "Medium",
        "displayText": "3144. Minimum Substring Partition of Equal Character Frequency"
    },
    "3145": {
        "id": "3145",
        "name": "Find Products of Elements of Big Array",
        "acceptance": "21.5",
        "difficulty": "Hard",
        "displayText": "3145. Find Products of Elements of Big Array"
    },
    "3146": {
        "id": "3146",
        "name": "Permutation Difference between Two Strings",
        "acceptance": "87.1",
        "difficulty": "Easy",
        "displayText": "3146. Permutation Difference between Two Strings"
    },
    "3147": {
        "id": "3147",
        "name": "Taking Maximum Energy From the Mystic Dungeon",
        "acceptance": "40.9",
        "difficulty": "Medium",
        "displayText": "3147. Taking Maximum Energy From the Mystic Dungeon"
    },
    "3148": {
        "id": "3148",
        "name": "Maximum Difference Score in a Grid",
        "acceptance": "46.5",
        "difficulty": "Medium",
        "displayText": "3148. Maximum Difference Score in a Grid"
    },
    "3149": {
        "id": "3149",
        "name": "Find the Minimum Cost Array Permutation",
        "acceptance": "23.0",
        "difficulty": "Hard",
        "displayText": "3149. Find the Minimum Cost Array Permutation"
    },
    "3150": {
        "id": "3150",
        "name": "Invalid Tweets II",
        "acceptance": "86.7",
        "difficulty": "Easy",
        "displayText": "3150. Invalid Tweets II"
    },
    "3151": {
        "id": "3151",
        "name": "Special Array I",
        "acceptance": "81.8",
        "difficulty": "Easy",
        "displayText": "3151. Special Array I"
    },
    "3152": {
        "id": "3152",
        "name": "Special Array II",
        "acceptance": "45.7",
        "difficulty": "Medium",
        "displayText": "3152. Special Array II"
    },
    "3153": {
        "id": "3153",
        "name": "Sum of Digit Differences of All Pairs",
        "acceptance": "42.3",
        "difficulty": "Medium",
        "displayText": "3153. Sum of Digit Differences of All Pairs"
    },
    "3154": {
        "id": "3154",
        "name": "Find Number of Ways to Reach the K-th Stair",
        "acceptance": "35.9",
        "difficulty": "Hard",
        "displayText": "3154. Find Number of Ways to Reach the K-th Stair"
    },
    "3155": {
        "id": "3155",
        "name": "Maximum Number of Upgradable Servers",
        "acceptance": "40.3",
        "difficulty": "Medium",
        "displayText": "3155. Maximum Number of Upgradable Servers"
    },
    "3156": {
        "id": "3156",
        "name": "Employee Task Duration and Concurrent Tasks",
        "acceptance": "45.3",
        "difficulty": "Hard",
        "displayText": "3156. Employee Task Duration and Concurrent Tasks"
    },
    "3157": {
        "id": "3157",
        "name": "Find the Level of Tree with Minimum Sum",
        "acceptance": "68.6",
        "difficulty": "Medium",
        "displayText": "3157. Find the Level of Tree with Minimum Sum"
    },
    "3158": {
        "id": "3158",
        "name": "Find the XOR of Numbers Which Appear Twice",
        "acceptance": "79.5",
        "difficulty": "Easy",
        "displayText": "3158. Find the XOR of Numbers Which Appear Twice"
    },
    "3159": {
        "id": "3159",
        "name": "Find Occurrences of an Element in an Array",
        "acceptance": "72.3",
        "difficulty": "Medium",
        "displayText": "3159. Find Occurrences of an Element in an Array"
    },
    "3160": {
        "id": "3160",
        "name": "Find the Number of Distinct Colors Among the Balls",
        "acceptance": "54.2",
        "difficulty": "Medium",
        "displayText": "3160. Find the Number of Distinct Colors Among the Balls"
    },
    "3161": {
        "id": "3161",
        "name": "Block Placement Queries",
        "acceptance": "16.1",
        "difficulty": "Hard",
        "displayText": "3161. Block Placement Queries"
    },
    "3162": {
        "id": "3162",
        "name": "Find the Number of Good Pairs I",
        "acceptance": "85.5",
        "difficulty": "Easy",
        "displayText": "3162. Find the Number of Good Pairs I"
    },
    "3163": {
        "id": "3163",
        "name": "String Compression III",
        "acceptance": "68.0",
        "difficulty": "Medium",
        "displayText": "3163. String Compression III"
    },
    "3164": {
        "id": "3164",
        "name": "Find the Number of Good Pairs II",
        "acceptance": "26.0",
        "difficulty": "Medium",
        "displayText": "3164. Find the Number of Good Pairs II"
    },
    "3165": {
        "id": "3165",
        "name": "Maximum Sum of Subsequence With Non-adjacent Elements",
        "acceptance": "15.9",
        "difficulty": "Hard",
        "displayText": "3165. Maximum Sum of Subsequence With Non-adjacent Elements"
    },
    "3166": {
        "id": "3166",
        "name": "Calculate Parking Fees and Duration",
        "acceptance": "52.4",
        "difficulty": "Medium",
        "displayText": "3166. Calculate Parking Fees and Duration"
    },
    "3167": {
        "id": "3167",
        "name": "Better Compression of String",
        "acceptance": "75.5",
        "difficulty": "Medium",
        "displayText": "3167. Better Compression of String"
    },
    "3168": {
        "id": "3168",
        "name": "Minimum Number of Chairs in a Waiting Room",
        "acceptance": "78.7",
        "difficulty": "Easy",
        "displayText": "3168. Minimum Number of Chairs in a Waiting Room"
    },
    "3169": {
        "id": "3169",
        "name": "Count Days Without Meetings",
        "acceptance": "47.8",
        "difficulty": "Medium",
        "displayText": "3169. Count Days Without Meetings"
    },
    "3170": {
        "id": "3170",
        "name": "Lexicographically Minimum String After Removing Stars",
        "acceptance": "35.2",
        "difficulty": "Medium",
        "displayText": "3170. Lexicographically Minimum String After Removing Stars"
    },
    "3171": {
        "id": "3171",
        "name": "Find Subarray With Bitwise OR Closest to K",
        "acceptance": "29.4",
        "difficulty": "Hard",
        "displayText": "3171. Find Subarray With Bitwise OR Closest to K"
    },
    "3172": {
        "id": "3172",
        "name": "Second Day Verification",
        "acceptance": "68.2",
        "difficulty": "Easy",
        "displayText": "3172. Second Day Verification"
    },
    "3173": {
        "id": "3173",
        "name": "Bitwise OR of Adjacent Elements",
        "acceptance": "95.3",
        "difficulty": "Easy",
        "displayText": "3173. Bitwise OR of Adjacent Elements"
    },
    "3174": {
        "id": "3174",
        "name": "Clear Digits",
        "acceptance": "82.6",
        "difficulty": "Easy",
        "displayText": "3174. Clear Digits"
    },
    "3175": {
        "id": "3175",
        "name": "Find The First Player to win K Games in a Row",
        "acceptance": "39.3",
        "difficulty": "Medium",
        "displayText": "3175. Find The First Player to win K Games in a Row"
    },
    "3176": {
        "id": "3176",
        "name": "Find the Maximum Length of a Good Subsequence I",
        "acceptance": "31.2",
        "difficulty": "Medium",
        "displayText": "3176. Find the Maximum Length of a Good Subsequence I"
    },
    "3177": {
        "id": "3177",
        "name": "Find the Maximum Length of a Good Subsequence II",
        "acceptance": "23.7",
        "difficulty": "Hard",
        "displayText": "3177. Find the Maximum Length of a Good Subsequence II"
    },
    "3178": {
        "id": "3178",
        "name": "Find the Child Who Has the Ball After K Seconds",
        "acceptance": "61.5",
        "difficulty": "Easy",
        "displayText": "3178. Find the Child Who Has the Ball After K Seconds"
    },
    "3179": {
        "id": "3179",
        "name": "Find the N-th Value After K Seconds",
        "acceptance": "53.6",
        "difficulty": "Medium",
        "displayText": "3179. Find the N-th Value After K Seconds"
    },
    "3180": {
        "id": "3180",
        "name": "Maximum Total Reward Using Operations I",
        "acceptance": "29.7",
        "difficulty": "Medium",
        "displayText": "3180. Maximum Total Reward Using Operations I"
    },
    "3181": {
        "id": "3181",
        "name": "Maximum Total Reward Using Operations II",
        "acceptance": "20.5",
        "difficulty": "Hard",
        "displayText": "3181. Maximum Total Reward Using Operations II"
    },
    "3182": {
        "id": "3182",
        "name": "Find Top Scoring Students",
        "acceptance": "49.8",
        "difficulty": "Medium",
        "displayText": "3182. Find Top Scoring Students"
    },
    "3183": {
        "id": "3183",
        "name": "The Number of Ways to Make the Sum",
        "acceptance": "52.3",
        "difficulty": "Medium",
        "displayText": "3183. The Number of Ways to Make the Sum"
    },
    "3184": {
        "id": "3184",
        "name": "Count Pairs That Form a Complete Day I",
        "acceptance": "77.4",
        "difficulty": "Easy",
        "displayText": "3184. Count Pairs That Form a Complete Day I"
    },
    "3185": {
        "id": "3185",
        "name": "Count Pairs That Form a Complete Day II",
        "acceptance": "42.9",
        "difficulty": "Medium",
        "displayText": "3185. Count Pairs That Form a Complete Day II"
    },
    "3186": {
        "id": "3186",
        "name": "Maximum Total Damage With Spell Casting",
        "acceptance": "27.5",
        "difficulty": "Medium",
        "displayText": "3186. Maximum Total Damage With Spell Casting"
    },
    "3187": {
        "id": "3187",
        "name": "Peaks in Array",
        "acceptance": "25.9",
        "difficulty": "Hard",
        "displayText": "3187. Peaks in Array"
    },
    "3188": {
        "id": "3188",
        "name": "Find Top Scoring Students II",
        "acceptance": "38.4",
        "difficulty": "Hard",
        "displayText": "3188. Find Top Scoring Students II"
    },
    "3189": {
        "id": "3189",
        "name": "Minimum Moves to Get a Peaceful Board",
        "acceptance": "76.0",
        "difficulty": "Medium",
        "displayText": "3189. Minimum Moves to Get a Peaceful Board"
    },
    "3190": {
        "id": "3190",
        "name": "Find Minimum Operations to Make All Elements Divisible by Three",
        "acceptance": "88.7",
        "difficulty": "Easy",
        "displayText": "3190. Find Minimum Operations to Make All Elements Divisible by Three"
    },
    "3191": {
        "id": "3191",
        "name": "Minimum Operations to Make Binary Array Elements Equal to One I",
        "acceptance": "80.5",
        "difficulty": "Medium",
        "displayText": "3191. Minimum Operations to Make Binary Array Elements Equal to One I"
    },
    "3192": {
        "id": "3192",
        "name": "Minimum Operations to Make Binary Array Elements Equal to One II",
        "acceptance": "63.8",
        "difficulty": "Medium",
        "displayText": "3192. Minimum Operations to Make Binary Array Elements Equal to One II"
    },
    "3193": {
        "id": "3193",
        "name": "Count the Number of Inversions",
        "acceptance": "32.5",
        "difficulty": "Hard",
        "displayText": "3193. Count the Number of Inversions"
    },
    "3194": {
        "id": "3194",
        "name": "Minimum Average of Smallest and Largest Elements",
        "acceptance": "84.7",
        "difficulty": "Easy",
        "displayText": "3194. Minimum Average of Smallest and Largest Elements"
    },
    "3195": {
        "id": "3195",
        "name": "Find the Minimum Area to Cover All Ones I",
        "acceptance": "71.1",
        "difficulty": "Medium",
        "displayText": "3195. Find the Minimum Area to Cover All Ones I"
    },
    "3196": {
        "id": "3196",
        "name": "Maximize Total Cost of Alternating Subarrays",
        "acceptance": "28.5",
        "difficulty": "Medium",
        "displayText": "3196. Maximize Total Cost of Alternating Subarrays"
    },
    "3197": {
        "id": "3197",
        "name": "Find the Minimum Area to Cover All Ones II",
        "acceptance": "35.7",
        "difficulty": "Hard",
        "displayText": "3197. Find the Minimum Area to Cover All Ones II"
    },
    "3198": {
        "id": "3198",
        "name": "Find Cities in Each State",
        "acceptance": "83.1",
        "difficulty": "Easy",
        "displayText": "3198. Find Cities in Each State"
    },
    "3199": {
        "id": "3199",
        "name": "Count Triplets with Even XOR Set Bits I",
        "acceptance": "82.8",
        "difficulty": "Easy",
        "displayText": "3199. Count Triplets with Even XOR Set Bits I"
    },
    "3200": {
        "id": "3200",
        "name": "Maximum Height of a Triangle",
        "acceptance": "43.0",
        "difficulty": "Easy",
        "displayText": "3200. Maximum Height of a Triangle"
    },
    "3201": {
        "id": "3201",
        "name": "Find the Maximum Length of Valid Subsequence I",
        "acceptance": "37.5",
        "difficulty": "Medium",
        "displayText": "3201. Find the Maximum Length of Valid Subsequence I"
    },
    "3202": {
        "id": "3202",
        "name": "Find the Maximum Length of Valid Subsequence II",
        "acceptance": "39.3",
        "difficulty": "Medium",
        "displayText": "3202. Find the Maximum Length of Valid Subsequence II"
    },
    "3203": {
        "id": "3203",
        "name": "Find Minimum Diameter After Merging Two Trees",
        "acceptance": "57.6",
        "difficulty": "Hard",
        "displayText": "3203. Find Minimum Diameter After Merging Two Trees"
    },
    "3204": {
        "id": "3204",
        "name": "Bitwise User Permissions Analysis",
        "acceptance": "93.5",
        "difficulty": "Medium",
        "displayText": "3204. Bitwise User Permissions Analysis"
    },
    "3205": {
        "id": "3205",
        "name": "Maximum Array Hopping Score I",
        "acceptance": "77.1",
        "difficulty": "Medium",
        "displayText": "3205. Maximum Array Hopping Score I"
    },
    "3206": {
        "id": "3206",
        "name": "Alternating Groups I",
        "acceptance": "67.4",
        "difficulty": "Easy",
        "displayText": "3206. Alternating Groups I"
    },
    "3207": {
        "id": "3207",
        "name": "Maximum Points After Enemy Battles",
        "acceptance": "32.4",
        "difficulty": "Medium",
        "displayText": "3207. Maximum Points After Enemy Battles"
    },
    "3208": {
        "id": "3208",
        "name": "Alternating Groups II",
        "acceptance": "59.8",
        "difficulty": "Medium",
        "displayText": "3208. Alternating Groups II"
    },
    "3209": {
        "id": "3209",
        "name": "Number of Subarrays With AND Value of K",
        "acceptance": "33.6",
        "difficulty": "Hard",
        "displayText": "3209. Number of Subarrays With AND Value of K"
    },
    "3210": {
        "id": "3210",
        "name": "Find the Encrypted String",
        "acceptance": "67.8",
        "difficulty": "Easy",
        "displayText": "3210. Find the Encrypted String"
    },
    "3211": {
        "id": "3211",
        "name": "Generate Binary Strings Without Adjacent Zeros",
        "acceptance": "86.9",
        "difficulty": "Medium",
        "displayText": "3211. Generate Binary Strings Without Adjacent Zeros"
    },
    "3212": {
        "id": "3212",
        "name": "Count Submatrices With Equal Frequency of X and Y",
        "acceptance": "50.3",
        "difficulty": "Medium",
        "displayText": "3212. Count Submatrices With Equal Frequency of X and Y"
    },
    "3213": {
        "id": "3213",
        "name": "Construct String with Minimum Cost",
        "acceptance": "19.3",
        "difficulty": "Hard",
        "displayText": "3213. Construct String with Minimum Cost"
    },
    "3214": {
        "id": "3214",
        "name": "Year on Year Growth Rate",
        "acceptance": "52.7",
        "difficulty": "Hard",
        "displayText": "3214. Year on Year Growth Rate"
    },
    "3215": {
        "id": "3215",
        "name": "Count Triplets with Even XOR Set Bits II",
        "acceptance": "59.3",
        "difficulty": "Medium",
        "displayText": "3215. Count Triplets with Even XOR Set Bits II"
    },
    "3216": {
        "id": "3216",
        "name": "Lexicographically Smallest String After a Swap",
        "acceptance": "53.5",
        "difficulty": "Easy",
        "displayText": "3216. Lexicographically Smallest String After a Swap"
    },
    "3217": {
        "id": "3217",
        "name": "Delete Nodes From Linked List Present in Array",
        "acceptance": "67.9",
        "difficulty": "Medium",
        "displayText": "3217. Delete Nodes From Linked List Present in Array"
    },
    "3218": {
        "id": "3218",
        "name": "Minimum Cost for Cutting Cake I",
        "acceptance": "57.5",
        "difficulty": "Medium",
        "displayText": "3218. Minimum Cost for Cutting Cake I"
    },
    "3219": {
        "id": "3219",
        "name": "Minimum Cost for Cutting Cake II",
        "acceptance": "54.5",
        "difficulty": "Hard",
        "displayText": "3219. Minimum Cost for Cutting Cake II"
    },
    "3220": {
        "id": "3220",
        "name": "Odd and Even Transactions",
        "acceptance": "69.9",
        "difficulty": "Medium",
        "displayText": "3220. Odd and Even Transactions"
    },
    "3221": {
        "id": "3221",
        "name": "Maximum Array Hopping Score II",
        "acceptance": "56.6",
        "difficulty": "Medium",
        "displayText": "3221. Maximum Array Hopping Score II"
    },
    "3222": {
        "id": "3222",
        "name": "Find the Winning Player in Coin Game",
        "acceptance": "52.4",
        "difficulty": "Easy",
        "displayText": "3222. Find the Winning Player in Coin Game"
    },
    "3223": {
        "id": "3223",
        "name": "Minimum Length of String After Operations",
        "acceptance": "74.9",
        "difficulty": "Medium",
        "displayText": "3223. Minimum Length of String After Operations"
    },
    "3224": {
        "id": "3224",
        "name": "Minimum Array Changes to Make Differences Equal",
        "acceptance": "23.1",
        "difficulty": "Medium",
        "displayText": "3224. Minimum Array Changes to Make Differences Equal"
    },
    "3225": {
        "id": "3225",
        "name": "Maximum Score From Grid Operations",
        "acceptance": "23.4",
        "difficulty": "Hard",
        "displayText": "3225. Maximum Score From Grid Operations"
    },
    "3226": {
        "id": "3226",
        "name": "Number of Bit Changes to Make Two Integers Equal",
        "acceptance": "63.7",
        "difficulty": "Easy",
        "displayText": "3226. Number of Bit Changes to Make Two Integers Equal"
    },
    "3227": {
        "id": "3227",
        "name": "Vowels Game in a String",
        "acceptance": "61.9",
        "difficulty": "Medium",
        "displayText": "3227. Vowels Game in a String"
    },
    "3228": {
        "id": "3228",
        "name": "Maximum Number of Operations to Move Ones to the End",
        "acceptance": "53.0",
        "difficulty": "Medium",
        "displayText": "3228. Maximum Number of Operations to Move Ones to the End"
    },
    "3229": {
        "id": "3229",
        "name": "Minimum Operations to Make Array Equal to Target",
        "acceptance": "38.5",
        "difficulty": "Hard",
        "displayText": "3229. Minimum Operations to Make Array Equal to Target"
    },
    "3230": {
        "id": "3230",
        "name": "Customer Purchasing Behavior Analysis",
        "acceptance": "37.4",
        "difficulty": "Medium",
        "displayText": "3230. Customer Purchasing Behavior Analysis"
    },
    "3231": {
        "id": "3231",
        "name": "Minimum Number of Increasing Subsequence to Be Removed",
        "acceptance": "42.5",
        "difficulty": "Hard",
        "displayText": "3231. Minimum Number of Increasing Subsequence to Be Removed"
    },
    "3232": {
        "id": "3232",
        "name": "Find if Digit Game Can Be Won",
        "acceptance": "81.1",
        "difficulty": "Easy",
        "displayText": "3232. Find if Digit Game Can Be Won"
    },
    "3233": {
        "id": "3233",
        "name": "Find the Count of Numbers Which Are Not Special",
        "acceptance": "26.8",
        "difficulty": "Medium",
        "displayText": "3233. Find the Count of Numbers Which Are Not Special"
    },
    "3234": {
        "id": "3234",
        "name": "Count the Number of Substrings With Dominant Ones",
        "acceptance": "16.6",
        "difficulty": "Medium",
        "displayText": "3234. Count the Number of Substrings With Dominant Ones"
    },
    "3235": {
        "id": "3235",
        "name": "Check if the Rectangle Corner Is Reachable",
        "acceptance": "26.6",
        "difficulty": "Hard",
        "displayText": "3235. Check if the Rectangle Corner Is Reachable"
    },
    "3236": {
        "id": "3236",
        "name": "CEO Subordinate Hierarchy",
        "acceptance": "71.9",
        "difficulty": "Hard",
        "displayText": "3236. CEO Subordinate Hierarchy"
    },
    "3237": {
        "id": "3237",
        "name": "Alt and Tab Simulation",
        "acceptance": "48.0",
        "difficulty": "Medium",
        "displayText": "3237. Alt and Tab Simulation"
    },
    "3238": {
        "id": "3238",
        "name": "Find the Number of Winning Players",
        "acceptance": "59.6",
        "difficulty": "Easy",
        "displayText": "3238. Find the Number of Winning Players"
    },
    "3239": {
        "id": "3239",
        "name": "Minimum Number of Flips to Make Binary Grid Palindromic I",
        "acceptance": "74.2",
        "difficulty": "Medium",
        "displayText": "3239. Minimum Number of Flips to Make Binary Grid Palindromic I"
    },
    "3240": {
        "id": "3240",
        "name": "Minimum Number of Flips to Make Binary Grid Palindromic II",
        "acceptance": "24.0",
        "difficulty": "Medium",
        "displayText": "3240. Minimum Number of Flips to Make Binary Grid Palindromic II"
    },
    "3241": {
        "id": "3241",
        "name": "Time Taken to Mark All Nodes",
        "acceptance": "23.8",
        "difficulty": "Hard",
        "displayText": "3241. Time Taken to Mark All Nodes"
    },
    "3242": {
        "id": "3242",
        "name": "Design Neighbor Sum Service",
        "acceptance": "82.6",
        "difficulty": "Easy",
        "displayText": "3242. Design Neighbor Sum Service"
    },
    "3243": {
        "id": "3243",
        "name": "Shortest Distance After Road Addition Queries I",
        "acceptance": "62.1",
        "difficulty": "Medium",
        "displayText": "3243. Shortest Distance After Road Addition Queries I"
    },
    "3244": {
        "id": "3244",
        "name": "Shortest Distance After Road Addition Queries II",
        "acceptance": "25.0",
        "difficulty": "Hard",
        "displayText": "3244. Shortest Distance After Road Addition Queries II"
    },
    "3245": {
        "id": "3245",
        "name": "Alternating Groups III",
        "acceptance": "14.5",
        "difficulty": "Hard",
        "displayText": "3245. Alternating Groups III"
    },
    "3246": {
        "id": "3246",
        "name": "Premier League Table Ranking",
        "acceptance": "81.9",
        "difficulty": "Easy",
        "displayText": "3246. Premier League Table Ranking"
    },
    "3247": {
        "id": "3247",
        "name": "Number of Subsequences with Odd Sum",
        "acceptance": "47.1",
        "difficulty": "Medium",
        "displayText": "3247. Number of Subsequences with Odd Sum"
    },
    "3248": {
        "id": "3248",
        "name": "Snake in Matrix",
        "acceptance": "81.4",
        "difficulty": "Easy",
        "displayText": "3248. Snake in Matrix"
    },
    "3249": {
        "id": "3249",
        "name": "Count the Number of Good Nodes",
        "acceptance": "54.5",
        "difficulty": "Medium",
        "displayText": "3249. Count the Number of Good Nodes"
    },
    "3250": {
        "id": "3250",
        "name": "Find the Count of Monotonic Pairs I",
        "acceptance": "45.5",
        "difficulty": "Hard",
        "displayText": "3250. Find the Count of Monotonic Pairs I"
    },
    "3251": {
        "id": "3251",
        "name": "Find the Count of Monotonic Pairs II",
        "acceptance": "22.7",
        "difficulty": "Hard",
        "displayText": "3251. Find the Count of Monotonic Pairs II"
    },
    "3252": {
        "id": "3252",
        "name": "Premier League Table Ranking II",
        "acceptance": "59.7",
        "difficulty": "Medium",
        "displayText": "3252. Premier League Table Ranking II"
    },
    "3253": {
        "id": "3253",
        "name": "Construct String with Minimum Cost (Easy)",
        "acceptance": "58.4",
        "difficulty": "Medium",
        "displayText": "3253. Construct String with Minimum Cost (Easy)"
    },
    "3254": {
        "id": "3254",
        "name": "Find the Power of K-Size Subarrays I",
        "acceptance": "62.5",
        "difficulty": "Medium",
        "displayText": "3254. Find the Power of K-Size Subarrays I"
    },
    "3255": {
        "id": "3255",
        "name": "Find the Power of K-Size Subarrays II",
        "acceptance": "29.0",
        "difficulty": "Medium",
        "displayText": "3255. Find the Power of K-Size Subarrays II"
    },
    "3256": {
        "id": "3256",
        "name": "Maximum Value Sum by Placing Three Rooks I",
        "acceptance": "15.0",
        "difficulty": "Hard",
        "displayText": "3256. Maximum Value Sum by Placing Three Rooks I"
    },
    "3257": {
        "id": "3257",
        "name": "Maximum Value Sum by Placing Three Rooks II",
        "acceptance": "26.3",
        "difficulty": "Hard",
        "displayText": "3257. Maximum Value Sum by Placing Three Rooks II"
    },
    "3258": {
        "id": "3258",
        "name": "Count Substrings That Satisfy K-Constraint I",
        "acceptance": "77.6",
        "difficulty": "Easy",
        "displayText": "3258. Count Substrings That Satisfy K-Constraint I"
    },
    "3259": {
        "id": "3259",
        "name": "Maximum Energy Boost From Two Drinks",
        "acceptance": "49.2",
        "difficulty": "Medium",
        "displayText": "3259. Maximum Energy Boost From Two Drinks"
    },
    "3260": {
        "id": "3260",
        "name": "Find the Largest Palindrome Divisible by K",
        "acceptance": "15.2",
        "difficulty": "Hard",
        "displayText": "3260. Find the Largest Palindrome Divisible by K"
    },
    "3261": {
        "id": "3261",
        "name": "Count Substrings That Satisfy K-Constraint II",
        "acceptance": "21.3",
        "difficulty": "Hard",
        "displayText": "3261. Count Substrings That Satisfy K-Constraint II"
    },
    "3262": {
        "id": "3262",
        "name": "Find Overlapping Shifts",
        "acceptance": "61.4",
        "difficulty": "Medium",
        "displayText": "3262. Find Overlapping Shifts"
    },
    "3263": {
        "id": "3263",
        "name": "Convert Doubly Linked List to Array I",
        "acceptance": "94.8",
        "difficulty": "Easy",
        "displayText": "3263. Convert Doubly Linked List to Array I"
    },
    "3264": {
        "id": "3264",
        "name": "Final Array State After K Multiplication Operations I",
        "acceptance": "87.2",
        "difficulty": "Easy",
        "displayText": "3264. Final Array State After K Multiplication Operations I"
    },
    "3265": {
        "id": "3265",
        "name": "Count Almost Equal Pairs I",
        "acceptance": "37.4",
        "difficulty": "Medium",
        "displayText": "3265. Count Almost Equal Pairs I"
    },
    "3266": {
        "id": "3266",
        "name": "Final Array State After K Multiplication Operations II",
        "acceptance": "11.6",
        "difficulty": "Hard",
        "displayText": "3266. Final Array State After K Multiplication Operations II"
    },
    "3267": {
        "id": "3267",
        "name": "Count Almost Equal Pairs II",
        "acceptance": "21.0",
        "difficulty": "Hard",
        "displayText": "3267. Count Almost Equal Pairs II"
    },
    "3268": {
        "id": "3268",
        "name": "Find Overlapping Shifts II",
        "acceptance": "59.1",
        "difficulty": "Hard",
        "displayText": "3268. Find Overlapping Shifts II"
    },
    "3269": {
        "id": "3269",
        "name": "Constructing Two Increasing Arrays",
        "acceptance": "63.8",
        "difficulty": "Hard",
        "displayText": "3269. Constructing Two Increasing Arrays"
    },
    "3270": {
        "id": "3270",
        "name": "Find the Key of the Numbers",
        "acceptance": "75.9",
        "difficulty": "Easy",
        "displayText": "3270. Find the Key of the Numbers"
    },
    "3271": {
        "id": "3271",
        "name": "Hash Divided String",
        "acceptance": "82.9",
        "difficulty": "Medium",
        "displayText": "3271. Hash Divided String"
    },
    "3272": {
        "id": "3272",
        "name": "Find the Count of Good Integers",
        "acceptance": "69.8",
        "difficulty": "Hard",
        "displayText": "3272. Find the Count of Good Integers"
    },
    "3273": {
        "id": "3273",
        "name": "Minimum Amount of Damage Dealt to Bob",
        "acceptance": "37.7",
        "difficulty": "Hard",
        "displayText": "3273. Minimum Amount of Damage Dealt to Bob"
    },
    "3274": {
        "id": "3274",
        "name": "Check if Two Chessboard Squares Have the Same Color",
        "acceptance": "70.8",
        "difficulty": "Easy",
        "displayText": "3274. Check if Two Chessboard Squares Have the Same Color"
    },
    "3275": {
        "id": "3275",
        "name": "K-th Nearest Obstacle Queries",
        "acceptance": "47.9",
        "difficulty": "Medium",
        "displayText": "3275. K-th Nearest Obstacle Queries"
    },
    "3276": {
        "id": "3276",
        "name": "Select Cells in Grid With Maximum Score",
        "acceptance": "14.3",
        "difficulty": "Hard",
        "displayText": "3276. Select Cells in Grid With Maximum Score"
    },
    "3277": {
        "id": "3277",
        "name": "Maximum XOR Score Subarray Queries",
        "acceptance": "41.8",
        "difficulty": "Hard",
        "displayText": "3277. Maximum XOR Score Subarray Queries"
    },
    "3278": {
        "id": "3278",
        "name": "Find Candidates for Data Scientist Position II",
        "acceptance": "43.9",
        "difficulty": "Medium",
        "displayText": "3278. Find Candidates for Data Scientist Position II"
    },
    "3279": {
        "id": "3279",
        "name": "Maximum Total Area Occupied by Pistons",
        "acceptance": "54.8",
        "difficulty": "Hard",
        "displayText": "3279. Maximum Total Area Occupied by Pistons"
    },
    "3280": {
        "id": "3280",
        "name": "Convert Date to Binary",
        "acceptance": "88.8",
        "difficulty": "Easy",
        "displayText": "3280. Convert Date to Binary"
    },
    "3281": {
        "id": "3281",
        "name": "Maximize Score of Numbers in Ranges",
        "acceptance": "34.4",
        "difficulty": "Medium",
        "displayText": "3281. Maximize Score of Numbers in Ranges"
    },
    "3282": {
        "id": "3282",
        "name": "Reach End of Array With Max Score",
        "acceptance": "32.5",
        "difficulty": "Medium",
        "displayText": "3282. Reach End of Array With Max Score"
    },
    "3283": {
        "id": "3283",
        "name": "Maximum Number of Moves to Kill All Pawns",
        "acceptance": "31.9",
        "difficulty": "Hard",
        "displayText": "3283. Maximum Number of Moves to Kill All Pawns"
    },
    "3284": {
        "id": "3284",
        "name": "Sum of Consecutive Subarrays",
        "acceptance": "41.3",
        "difficulty": "Medium",
        "displayText": "3284. Sum of Consecutive Subarrays"
    },
    "3285": {
        "id": "3285",
        "name": "Find Indices of Stable Mountains",
        "acceptance": "85.9",
        "difficulty": "Easy",
        "displayText": "3285. Find Indices of Stable Mountains"
    },
    "3286": {
        "id": "3286",
        "name": "Find a Safe Walk Through a Grid",
        "acceptance": "29.9",
        "difficulty": "Medium",
        "displayText": "3286. Find a Safe Walk Through a Grid"
    },
    "3287": {
        "id": "3287",
        "name": "Find the Maximum Sequence Value of Array",
        "acceptance": "18.3",
        "difficulty": "Hard",
        "displayText": "3287. Find the Maximum Sequence Value of Array"
    },
    "3288": {
        "id": "3288",
        "name": "Length of the Longest Increasing Path",
        "acceptance": "16.8",
        "difficulty": "Hard",
        "displayText": "3288. Length of the Longest Increasing Path"
    },
    "3289": {
        "id": "3289",
        "name": "The Two Sneaky Numbers of Digitville",
        "acceptance": "88.2",
        "difficulty": "Easy",
        "displayText": "3289. The Two Sneaky Numbers of Digitville"
    },
    "3290": {
        "id": "3290",
        "name": "Maximum Multiplication Score",
        "acceptance": "40.9",
        "difficulty": "Medium",
        "displayText": "3290. Maximum Multiplication Score"
    },
    "3291": {
        "id": "3291",
        "name": "Minimum Number of Valid Strings to Form Target I",
        "acceptance": "19.8",
        "difficulty": "Medium",
        "displayText": "3291. Minimum Number of Valid Strings to Form Target I"
    },
    "3292": {
        "id": "3292",
        "name": "Minimum Number of Valid Strings to Form Target II",
        "acceptance": "17.8",
        "difficulty": "Hard",
        "displayText": "3292. Minimum Number of Valid Strings to Form Target II"
    },
    "3293": {
        "id": "3293",
        "name": "Calculate Product Final Price",
        "acceptance": "80.6",
        "difficulty": "Medium",
        "displayText": "3293. Calculate Product Final Price"
    },
    "3294": {
        "id": "3294",
        "name": "Convert Doubly Linked List to Array II",
        "acceptance": "81.5",
        "difficulty": "Medium",
        "displayText": "3294. Convert Doubly Linked List to Array II"
    },
    "3295": {
        "id": "3295",
        "name": "Report Spam Message",
        "acceptance": "47.4",
        "difficulty": "Medium",
        "displayText": "3295. Report Spam Message"
    },
    "3296": {
        "id": "3296",
        "name": "Minimum Number of Seconds to Make Mountain Height Zero",
        "acceptance": "35.7",
        "difficulty": "Medium",
        "displayText": "3296. Minimum Number of Seconds to Make Mountain Height Zero"
    },
    "3297": {
        "id": "3297",
        "name": "Count Substrings That Can Be Rearranged to Contain a String I",
        "acceptance": "41.2",
        "difficulty": "Medium",
        "displayText": "3297. Count Substrings That Can Be Rearranged to Contain a String I"
    },
    "3298": {
        "id": "3298",
        "name": "Count Substrings That Can Be Rearranged to Contain a String II",
        "acceptance": "55.3",
        "difficulty": "Hard",
        "displayText": "3298. Count Substrings That Can Be Rearranged to Contain a String II"
    },
    "3299": {
        "id": "3299",
        "name": "Sum of Consecutive Subsequences",
        "acceptance": "39.9",
        "difficulty": "Hard",
        "displayText": "3299. Sum of Consecutive Subsequences"
    },
    "3300": {
        "id": "3300",
        "name": "Minimum Element After Replacement With Digit Sum",
        "acceptance": "83.3",
        "difficulty": "Easy",
        "displayText": "3300. Minimum Element After Replacement With Digit Sum"
    },
    "3301": {
        "id": "3301",
        "name": "Maximize the Total Height of Unique Towers",
        "acceptance": "36.1",
        "difficulty": "Medium",
        "displayText": "3301. Maximize the Total Height of Unique Towers"
    },
    "3302": {
        "id": "3302",
        "name": "Find the Lexicographically Smallest Valid Sequence",
        "acceptance": "20.0",
        "difficulty": "Medium",
        "displayText": "3302. Find the Lexicographically Smallest Valid Sequence"
    },
    "3303": {
        "id": "3303",
        "name": "Find the Occurrence of First Almost Equal Substring",
        "acceptance": "13.6",
        "difficulty": "Hard",
        "displayText": "3303. Find the Occurrence of First Almost Equal Substring"
    },
    "3304": {
        "id": "3304",
        "name": "Find the K-th Character in String Game I",
        "acceptance": "72.8",
        "difficulty": "Easy",
        "displayText": "3304. Find the K-th Character in String Game I"
    },
    "3305": {
        "id": "3305",
        "name": "Count of Substrings Containing Every Vowel and K Consonants I",
        "acceptance": "41.0",
        "difficulty": "Medium",
        "displayText": "3305. Count of Substrings Containing Every Vowel and K Consonants I"
    },
    "3306": {
        "id": "3306",
        "name": "Count of Substrings Containing Every Vowel and K Consonants II",
        "acceptance": "40.7",
        "difficulty": "Medium",
        "displayText": "3306. Count of Substrings Containing Every Vowel and K Consonants II"
    },
    "3307": {
        "id": "3307",
        "name": "Find the K-th Character in String Game II",
        "acceptance": "28.9",
        "difficulty": "Hard",
        "displayText": "3307. Find the K-th Character in String Game II"
    },
    "3308": {
        "id": "3308",
        "name": "Find Top Performing Driver",
        "acceptance": "50.0",
        "difficulty": "Medium",
        "displayText": "3308. Find Top Performing Driver"
    },
    "3309": {
        "id": "3309",
        "name": "Maximum Possible Number by Binary Concatenation",
        "acceptance": "64.9",
        "difficulty": "Medium",
        "displayText": "3309. Maximum Possible Number by Binary Concatenation"
    },
    "3310": {
        "id": "3310",
        "name": "Remove Methods From Project",
        "acceptance": "49.1",
        "difficulty": "Medium",
        "displayText": "3310. Remove Methods From Project"
    },
    "3311": {
        "id": "3311",
        "name": "Construct 2D Grid Matching Graph Layout",
        "acceptance": "29.0",
        "difficulty": "Hard",
        "displayText": "3311. Construct 2D Grid Matching Graph Layout"
    },
    "3312": {
        "id": "3312",
        "name": "Sorted GCD Pair Queries",
        "acceptance": "20.0",
        "difficulty": "Hard",
        "displayText": "3312. Sorted GCD Pair Queries"
    },
    "3313": {
        "id": "3313",
        "name": "Find the Last Marked Nodes in Tree",
        "acceptance": "51.4",
        "difficulty": "Hard",
        "displayText": "3313. Find the Last Marked Nodes in Tree"
    },
    "3314": {
        "id": "3314",
        "name": "Construct the Minimum Bitwise Array I",
        "acceptance": "73.7",
        "difficulty": "Easy",
        "displayText": "3314. Construct the Minimum Bitwise Array I"
    },
    "3315": {
        "id": "3315",
        "name": "Construct the Minimum Bitwise Array II",
        "acceptance": "34.5",
        "difficulty": "Medium",
        "displayText": "3315. Construct the Minimum Bitwise Array II"
    },
    "3316": {
        "id": "3316",
        "name": "Find Maximum Removals From Source String",
        "acceptance": "38.7",
        "difficulty": "Medium",
        "displayText": "3316. Find Maximum Removals From Source String"
    },
    "3317": {
        "id": "3317",
        "name": "Find the Number of Possible Ways for an Event",
        "acceptance": "32.7",
        "difficulty": "Hard",
        "displayText": "3317. Find the Number of Possible Ways for an Event"
    },
    "3318": {
        "id": "3318",
        "name": "Find X-Sum of All K-Long Subarrays I",
        "acceptance": "63.3",
        "difficulty": "Easy",
        "displayText": "3318. Find X-Sum of All K-Long Subarrays I"
    },
    "3319": {
        "id": "3319",
        "name": "K-th Largest Perfect Subtree Size in Binary Tree",
        "acceptance": "60.8",
        "difficulty": "Medium",
        "displayText": "3319. K-th Largest Perfect Subtree Size in Binary Tree"
    },
    "3320": {
        "id": "3320",
        "name": "Count The Number of Winning Sequences",
        "acceptance": "31.6",
        "difficulty": "Hard",
        "displayText": "3320. Count The Number of Winning Sequences"
    },
    "3321": {
        "id": "3321",
        "name": "Find X-Sum of All K-Long Subarrays II",
        "acceptance": "15.6",
        "difficulty": "Hard",
        "displayText": "3321. Find X-Sum of All K-Long Subarrays II"
    },
    "3322": {
        "id": "3322",
        "name": "Premier League Table Ranking III",
        "acceptance": "72.2",
        "difficulty": "Medium",
        "displayText": "3322. Premier League Table Ranking III"
    },
    "3323": {
        "id": "3323",
        "name": "Minimize Connected Groups by Inserting Interval",
        "acceptance": "51.0",
        "difficulty": "Medium",
        "displayText": "3323. Minimize Connected Groups by Inserting Interval"
    },
    "3324": {
        "id": "3324",
        "name": "Find the Sequence of Strings Appeared on the Screen",
        "acceptance": "79.0",
        "difficulty": "Medium",
        "displayText": "3324. Find the Sequence of Strings Appeared on the Screen"
    },
    "3325": {
        "id": "3325",
        "name": "Count Substrings With K-Frequency Characters I",
        "acceptance": "54.3",
        "difficulty": "Medium",
        "displayText": "3325. Count Substrings With K-Frequency Characters I"
    },
    "3326": {
        "id": "3326",
        "name": "Minimum Division Operations to Make Array Non Decreasing",
        "acceptance": "28.4",
        "difficulty": "Medium",
        "displayText": "3326. Minimum Division Operations to Make Array Non Decreasing"
    },
    "3327": {
        "id": "3327",
        "name": "Check if DFS Strings Are Palindromes",
        "acceptance": "20.7",
        "difficulty": "Hard",
        "displayText": "3327. Check if DFS Strings Are Palindromes"
    },
    "3328": {
        "id": "3328",
        "name": "Find Cities in Each State II",
        "acceptance": "69.9",
        "difficulty": "Medium",
        "displayText": "3328. Find Cities in Each State II"
    },
    "3329": {
        "id": "3329",
        "name": "Count Substrings With K-Frequency Characters II",
        "acceptance": "70.2",
        "difficulty": "Hard",
        "displayText": "3329. Count Substrings With K-Frequency Characters II"
    },
    "3330": {
        "id": "3330",
        "name": "Find the Original Typed String I",
        "acceptance": "56.4",
        "difficulty": "Easy",
        "displayText": "3330. Find the Original Typed String I"
    },
    "3331": {
        "id": "3331",
        "name": "Find Subtree Sizes After Changes",
        "acceptance": "54.4",
        "difficulty": "Medium",
        "displayText": "3331. Find Subtree Sizes After Changes"
    },
    "3332": {
        "id": "3332",
        "name": "Maximum Points Tourist Can Earn",
        "acceptance": "49.6",
        "difficulty": "Medium",
        "displayText": "3332. Maximum Points Tourist Can Earn"
    },
    "3333": {
        "id": "3333",
        "name": "Find the Original Typed String II",
        "acceptance": "16.3",
        "difficulty": "Hard",
        "displayText": "3333. Find the Original Typed String II"
    },
    "3334": {
        "id": "3334",
        "name": "Find the Maximum Factor Score of Array",
        "acceptance": "40.2",
        "difficulty": "Medium",
        "displayText": "3334. Find the Maximum Factor Score of Array"
    },
    "3335": {
        "id": "3335",
        "name": "Total Characters in String After Transformations I",
        "acceptance": "26.4",
        "difficulty": "Medium",
        "displayText": "3335. Total Characters in String After Transformations I"
    },
    "3336": {
        "id": "3336",
        "name": "Find the Number of Subsequences With Equal GCD",
        "acceptance": "37.8",
        "difficulty": "Hard",
        "displayText": "3336. Find the Number of Subsequences With Equal GCD"
    },
    "3337": {
        "id": "3337",
        "name": "Total Characters in String After Transformations II",
        "acceptance": "32.9",
        "difficulty": "Hard",
        "displayText": "3337. Total Characters in String After Transformations II"
    },
    "3338": {
        "id": "3338",
        "name": "Second Highest Salary II",
        "acceptance": "89.7",
        "difficulty": "Medium",
        "displayText": "3338. Second Highest Salary II"
    },
    "3339": {
        "id": "3339",
        "name": "Find the Number of K-Even Arrays",
        "acceptance": "56.9",
        "difficulty": "Medium",
        "displayText": "3339. Find the Number of K-Even Arrays"
    },
    "3340": {
        "id": "3340",
        "name": "Check Balanced String",
        "acceptance": "84.1",
        "difficulty": "Easy",
        "displayText": "3340. Check Balanced String"
    },
    "3341": {
        "id": "3341",
        "name": "Find Minimum Time to Reach Last Room I",
        "acceptance": "35.7",
        "difficulty": "Medium",
        "displayText": "3341. Find Minimum Time to Reach Last Room I"
    },
    "3342": {
        "id": "3342",
        "name": "Find Minimum Time to Reach Last Room II",
        "acceptance": "49.9",
        "difficulty": "Medium",
        "displayText": "3342. Find Minimum Time to Reach Last Room II"
    },
    "3343": {
        "id": "3343",
        "name": "Count Number of Balanced Permutations",
        "acceptance": "15.8",
        "difficulty": "Hard",
        "displayText": "3343. Count Number of Balanced Permutations"
    },
    "3344": {
        "id": "3344",
        "name": "Maximum Sized Array",
        "acceptance": "52.4",
        "difficulty": "Medium",
        "displayText": "3344. Maximum Sized Array"
    },
    "3345": {
        "id": "3345",
        "name": "Smallest Divisible Digit Product I",
        "acceptance": "63.7",
        "difficulty": "Easy",
        "displayText": "3345. Smallest Divisible Digit Product I"
    },
    "3346": {
        "id": "3346",
        "name": "Maximum Frequency of an Element After Performing Operations I",
        "acceptance": "20.7",
        "difficulty": "Medium",
        "displayText": "3346. Maximum Frequency of an Element After Performing Operations I"
    },
    "3347": {
        "id": "3347",
        "name": "Maximum Frequency of an Element After Performing Operations II",
        "acceptance": "37.2",
        "difficulty": "Hard",
        "displayText": "3347. Maximum Frequency of an Element After Performing Operations II"
    },
    "3348": {
        "id": "3348",
        "name": "Smallest Divisible Digit Product II",
        "acceptance": "10.0",
        "difficulty": "Hard",
        "displayText": "3348. Smallest Divisible Digit Product II"
    },
    "3349": {
        "id": "3349",
        "name": "Adjacent Increasing Subarrays Detection I",
        "acceptance": "39.7",
        "difficulty": "Easy",
        "displayText": "3349. Adjacent Increasing Subarrays Detection I"
    },
    "3350": {
        "id": "3350",
        "name": "Adjacent Increasing Subarrays Detection II",
        "acceptance": "40.7",
        "difficulty": "Medium",
        "displayText": "3350. Adjacent Increasing Subarrays Detection II"
    },
    "3351": {
        "id": "3351",
        "name": "Sum of Good Subsequences",
        "acceptance": "29.4",
        "difficulty": "Hard",
        "displayText": "3351. Sum of Good Subsequences"
    },
    "3352": {
        "id": "3352",
        "name": "Count K-Reducible Numbers Less Than N",
        "acceptance": "28.2",
        "difficulty": "Hard",
        "displayText": "3352. Count K-Reducible Numbers Less Than N"
    },
    "3353": {
        "id": "3353",
        "name": "Minimum Total Operations",
        "acceptance": "63.7",
        "difficulty": "Easy",
        "displayText": "3353. Minimum Total Operations"
    },
    "3354": {
        "id": "3354",
        "name": "Make Array Elements Equal to Zero",
        "acceptance": "55.4",
        "difficulty": "Easy",
        "displayText": "3354. Make Array Elements Equal to Zero"
    },
    "3355": {
        "id": "3355",
        "name": "Zero Array Transformation I",
        "acceptance": "45.8",
        "difficulty": "Medium",
        "displayText": "3355. Zero Array Transformation I"
    },
    "3356": {
        "id": "3356",
        "name": "Zero Array Transformation II",
        "acceptance": "43.8",
        "difficulty": "Medium",
        "displayText": "3356. Zero Array Transformation II"
    },
    "3357": {
        "id": "3357",
        "name": "Minimize the Maximum Adjacent Element Difference",
        "acceptance": "15.1",
        "difficulty": "Hard",
        "displayText": "3357. Minimize the Maximum Adjacent Element Difference"
    },
    "3358": {
        "id": "3358",
        "name": "Books with NULL Ratings",
        "acceptance": "92.5",
        "difficulty": "Easy",
        "displayText": "3358. Books with NULL Ratings"
    },
    "3359": {
        "id": "3359",
        "name": "Find Sorted Submatrices With Maximum Element at Most K",
        "acceptance": "49.9",
        "difficulty": "Hard",
        "displayText": "3359. Find Sorted Submatrices With Maximum Element at Most K"
    },
    "3360": {
        "id": "3360",
        "name": "Stone Removal Game",
        "acceptance": "41.4",
        "difficulty": "Easy",
        "displayText": "3360. Stone Removal Game"
    },
    "3361": {
        "id": "3361",
        "name": "Shift Distance Between Two Strings",
        "acceptance": "52.4",
        "difficulty": "Medium",
        "displayText": "3361. Shift Distance Between Two Strings"
    },
    "3362": {
        "id": "3362",
        "name": "Zero Array Transformation III",
        "acceptance": "26.0",
        "difficulty": "Medium",
        "displayText": "3362. Zero Array Transformation III"
    },
    "3363": {
        "id": "3363",
        "name": "Find the Maximum Number of Fruits Collected",
        "acceptance": "39.3",
        "difficulty": "Hard",
        "displayText": "3363. Find the Maximum Number of Fruits Collected"
    },
    "3364": {
        "id": "3364",
        "name": "Minimum Positive Sum Subarray",
        "acceptance": "45.1",
        "difficulty": "Easy",
        "displayText": "3364. Minimum Positive Sum Subarray"
    },
    "3365": {
        "id": "3365",
        "name": "Rearrange K Substrings to Form Target String",
        "acceptance": "52.1",
        "difficulty": "Medium",
        "displayText": "3365. Rearrange K Substrings to Form Target String"
    },
    "3366": {
        "id": "3366",
        "name": "Minimum Array Sum",
        "acceptance": "29.3",
        "difficulty": "Medium",
        "displayText": "3366. Minimum Array Sum"
    },
    "3367": {
        "id": "3367",
        "name": "Maximize Sum of Weights after Edge Removals",
        "acceptance": "28.6",
        "difficulty": "Hard",
        "displayText": "3367. Maximize Sum of Weights after Edge Removals"
    },
    "3368": {
        "id": "3368",
        "name": "First Letter Capitalization",
        "acceptance": "87.7",
        "difficulty": "Hard",
        "displayText": "3368. First Letter Capitalization"
    },
    "3369": {
        "id": "3369",
        "name": "Design an Array Statistics Tracker",
        "acceptance": "34.1",
        "difficulty": "Hard",
        "displayText": "3369. Design an Array Statistics Tracker"
    },
    "3370": {
        "id": "3370",
        "name": "Smallest Number With All Set Bits",
        "acceptance": "75.5",
        "difficulty": "Easy",
        "displayText": "3370. Smallest Number With All Set Bits"
    },
    "3371": {
        "id": "3371",
        "name": "Identify the Largest Outlier in an Array",
        "acceptance": "34.8",
        "difficulty": "Medium",
        "displayText": "3371. Identify the Largest Outlier in an Array"
    },
    "3372": {
        "id": "3372",
        "name": "Maximize the Number of Target Nodes After Connecting Trees I",
        "acceptance": "47.9",
        "difficulty": "Medium",
        "displayText": "3372. Maximize the Number of Target Nodes After Connecting Trees I"
    },
    "3373": {
        "id": "3373",
        "name": "Maximize the Number of Target Nodes After Connecting Trees II",
        "acceptance": "53.7",
        "difficulty": "Hard",
        "displayText": "3373. Maximize the Number of Target Nodes After Connecting Trees II"
    },
    "3374": {
        "id": "3374",
        "name": "First Letter Capitalization II",
        "acceptance": "76.4",
        "difficulty": "Hard",
        "displayText": "3374. First Letter Capitalization II"
    },
    "3375": {
        "id": "3375",
        "name": "Minimum Operations to Make Array Values Equal to K",
        "acceptance": "74.0",
        "difficulty": "Easy",
        "displayText": "3375. Minimum Operations to Make Array Values Equal to K"
    },
    "3376": {
        "id": "3376",
        "name": "Minimum Time to Break Locks I",
        "acceptance": "30.4",
        "difficulty": "Medium",
        "displayText": "3376. Minimum Time to Break Locks I"
    },
    "3377": {
        "id": "3377",
        "name": "Digit Operations to Make Two Integers Equal",
        "acceptance": "31.2",
        "difficulty": "Medium",
        "displayText": "3377. Digit Operations to Make Two Integers Equal"
    },
    "3378": {
        "id": "3378",
        "name": "Count Connected Components in LCM Graph",
        "acceptance": "27.8",
        "difficulty": "Hard",
        "displayText": "3378. Count Connected Components in LCM Graph"
    },
    "3379": {
        "id": "3379",
        "name": "Transformed Array",
        "acceptance": "56.3",
        "difficulty": "Easy",
        "displayText": "3379. Transformed Array"
    },
    "3380": {
        "id": "3380",
        "name": "Maximum Area Rectangle With Point Constraints I",
        "acceptance": "51.1",
        "difficulty": "Medium",
        "displayText": "3380. Maximum Area Rectangle With Point Constraints I"
    },
    "3381": {
        "id": "3381",
        "name": "Maximum Subarray Sum With Length Divisible by K",
        "acceptance": "27.9",
        "difficulty": "Medium",
        "displayText": "3381. Maximum Subarray Sum With Length Divisible by K"
    },
    "3382": {
        "id": "3382",
        "name": "Maximum Area Rectangle With Point Constraints II",
        "acceptance": "20.2",
        "difficulty": "Hard",
        "displayText": "3382. Maximum Area Rectangle With Point Constraints II"
    },
    "3383": {
        "id": "3383",
        "name": "Minimum Runes to Add to Cast Spell",
        "acceptance": "46.0",
        "difficulty": "Hard",
        "displayText": "3383. Minimum Runes to Add to Cast Spell"
    },
    "3384": {
        "id": "3384",
        "name": "Team Dominance by Pass Success",
        "acceptance": "77.3",
        "difficulty": "Hard",
        "displayText": "3384. Team Dominance by Pass Success"
    },
    "3385": {
        "id": "3385",
        "name": "Minimum Time to Break Locks II",
        "acceptance": "46.5",
        "difficulty": "Hard",
        "displayText": "3385. Minimum Time to Break Locks II"
    },
    "3386": {
        "id": "3386",
        "name": "Button with Longest Push Time",
        "acceptance": "40.4",
        "difficulty": "Easy",
        "displayText": "3386. Button with Longest Push Time"
    },
    "3387": {
        "id": "3387",
        "name": "Maximize Amount After Two Days of Conversions",
        "acceptance": "60.0",
        "difficulty": "Medium",
        "displayText": "3387. Maximize Amount After Two Days of Conversions"
    },
    "3388": {
        "id": "3388",
        "name": "Count Beautiful Splits in an Array",
        "acceptance": "15.7",
        "difficulty": "Medium",
        "displayText": "3388. Count Beautiful Splits in an Array"
    },
    "3389": {
        "id": "3389",
        "name": "Minimum Operations to Make Character Frequencies Equal",
        "acceptance": "24.3",
        "difficulty": "Hard",
        "displayText": "3389. Minimum Operations to Make Character Frequencies Equal"
    },
    "3390": {
        "id": "3390",
        "name": "Longest Team Pass Streak",
        "acceptance": "43.3",
        "difficulty": "Hard",
        "displayText": "3390. Longest Team Pass Streak"
    },
    "3391": {
        "id": "3391",
        "name": "Design a 3D Binary Matrix with Efficient Layer Tracking",
        "acceptance": "67.7",
        "difficulty": "Medium",
        "displayText": "3391. Design a 3D Binary Matrix with Efficient Layer Tracking"
    },
    "3392": {
        "id": "3392",
        "name": "Count Subarrays of Length Three With a Condition",
        "acceptance": "51.7",
        "difficulty": "Easy",
        "displayText": "3392. Count Subarrays of Length Three With a Condition"
    },
    "3393": {
        "id": "3393",
        "name": "Count Paths With the Given XOR Value",
        "acceptance": "39.8",
        "difficulty": "Medium",
        "displayText": "3393. Count Paths With the Given XOR Value"
    },
    "3394": {
        "id": "3394",
        "name": "Check if Grid can be Cut into Sections",
        "acceptance": "69.1",
        "difficulty": "Medium",
        "displayText": "3394. Check if Grid can be Cut into Sections"
    },
    "3395": {
        "id": "3395",
        "name": "Subsequences with a Unique Middle Mode I",
        "acceptance": "16.7",
        "difficulty": "Hard",
        "displayText": "3395. Subsequences with a Unique Middle Mode I"
    },
    "3396": {
        "id": "3396",
        "name": "Minimum Number of Operations to Make Elements in Array Distinct",
        "acceptance": "71.5",
        "difficulty": "Easy",
        "displayText": "3396. Minimum Number of Operations to Make Elements in Array Distinct"
    },
    "3397": {
        "id": "3397",
        "name": "Maximum Number of Distinct Elements After Operations",
        "acceptance": "31.2",
        "difficulty": "Medium",
        "displayText": "3397. Maximum Number of Distinct Elements After Operations"
    },
    "3398": {
        "id": "3398",
        "name": "Smallest Substring With Identical Characters I",
        "acceptance": "18.9",
        "difficulty": "Hard",
        "displayText": "3398. Smallest Substring With Identical Characters I"
    },
    "3399": {
        "id": "3399",
        "name": "Smallest Substring With Identical Characters II",
        "acceptance": "40.6",
        "difficulty": "Hard",
        "displayText": "3399. Smallest Substring With Identical Characters II"
    },
    "3400": {
        "id": "3400",
        "name": "Maximum Number of Matching Indices After Right Shifts",
        "acceptance": "85.7",
        "difficulty": "Medium",
        "displayText": "3400. Maximum Number of Matching Indices After Right Shifts"
    },
    "3401": {
        "id": "3401",
        "name": "Find Circular Gift Exchange Chains",
        "acceptance": "55.2",
        "difficulty": "Hard",
        "displayText": "3401. Find Circular Gift Exchange Chains"
    },
    "3402": {
        "id": "3402",
        "name": "Minimum Operations to Make Columns Strictly Increasing",
        "acceptance": "73.1",
        "difficulty": "Easy",
        "displayText": "3402. Minimum Operations to Make Columns Strictly Increasing"
    },
    "3403": {
        "id": "3403",
        "name": "Find the Lexicographically Largest String From the Box I",
        "acceptance": "23.7",
        "difficulty": "Medium",
        "displayText": "3403. Find the Lexicographically Largest String From the Box I"
    },
    "3404": {
        "id": "3404",
        "name": "Count Special Subsequences",
        "acceptance": "28.5",
        "difficulty": "Medium",
        "displayText": "3404. Count Special Subsequences"
    },
    "3405": {
        "id": "3405",
        "name": "Count the Number of Arrays with K Matching Adjacent Elements",
        "acceptance": "37.8",
        "difficulty": "Hard",
        "displayText": "3405. Count the Number of Arrays with K Matching Adjacent Elements"
    },
    "3406": {
        "id": "3406",
        "name": "Find the Lexicographically Largest String From the Box II",
        "acceptance": "51.4",
        "difficulty": "Hard",
        "displayText": "3406. Find the Lexicographically Largest String From the Box II"
    },
    "3407": {
        "id": "3407",
        "name": "Substring Matching Pattern",
        "acceptance": "26.4",
        "difficulty": "Easy",
        "displayText": "3407. Substring Matching Pattern"
    },
    "3408": {
        "id": "3408",
        "name": "Design Task Manager",
        "acceptance": "34.2",
        "difficulty": "Medium",
        "displayText": "3408. Design Task Manager"
    },
    "3409": {
        "id": "3409",
        "name": "Longest Subsequence With Decreasing Adjacent Difference",
        "acceptance": "14.3",
        "difficulty": "Medium",
        "displayText": "3409. Longest Subsequence With Decreasing Adjacent Difference"
    },
    "3410": {
        "id": "3410",
        "name": "Maximize Subarray Sum After Removing All Occurrences of One Element",
        "acceptance": "20.3",
        "difficulty": "Hard",
        "displayText": "3410. Maximize Subarray Sum After Removing All Occurrences of One Element"
    },
    "3411": {
        "id": "3411",
        "name": "Maximum Subarray With Equal Products",
        "acceptance": "46.1",
        "difficulty": "Easy",
        "displayText": "3411. Maximum Subarray With Equal Products"
    },
    "3412": {
        "id": "3412",
        "name": "Find Mirror Score of a String",
        "acceptance": "36.2",
        "difficulty": "Medium",
        "displayText": "3412. Find Mirror Score of a String"
    },
    "3413": {
        "id": "3413",
        "name": "Maximum Coins From K Consecutive Bags",
        "acceptance": "23.6",
        "difficulty": "Medium",
        "displayText": "3413. Maximum Coins From K Consecutive Bags"
    },
    "3414": {
        "id": "3414",
        "name": "Maximum Score of Non-overlapping Intervals",
        "acceptance": "32.3",
        "difficulty": "Hard",
        "displayText": "3414. Maximum Score of Non-overlapping Intervals"
    },
    "3415": {
        "id": "3415",
        "name": "Find Products with Three Consecutive Digits",
        "acceptance": "82.5",
        "difficulty": "Easy",
        "displayText": "3415. Find Products with Three Consecutive Digits"
    },
    "3416": {
        "id": "3416",
        "name": "Subsequences with a Unique Middle Mode II",
        "acceptance": "43.8",
        "difficulty": "Hard",
        "displayText": "3416. Subsequences with a Unique Middle Mode II"
    },
    "3417": {
        "id": "3417",
        "name": "Zigzag Grid Traversal With Skip",
        "acceptance": "64.1",
        "difficulty": "Easy",
        "displayText": "3417. Zigzag Grid Traversal With Skip"
    },
    "3418": {
        "id": "3418",
        "name": "Maximum Amount of Money Robot Can Earn",
        "acceptance": "29.8",
        "difficulty": "Medium",
        "displayText": "3418. Maximum Amount of Money Robot Can Earn"
    },
    "3419": {
        "id": "3419",
        "name": "Minimize the Maximum Edge Weight of Graph",
        "acceptance": "43.2",
        "difficulty": "Medium",
        "displayText": "3419. Minimize the Maximum Edge Weight of Graph"
    },
    "3420": {
        "id": "3420",
        "name": "Count Non-Decreasing Subarrays After K Operations",
        "acceptance": "21.9",
        "difficulty": "Hard",
        "displayText": "3420. Count Non-Decreasing Subarrays After K Operations"
    },
    "3421": {
        "id": "3421",
        "name": "Find Students Who Improved",
        "acceptance": "48.4",
        "difficulty": "Medium",
        "displayText": "3421. Find Students Who Improved"
    },
    "3422": {
        "id": "3422",
        "name": "Minimum Operations to Make Subarray Elements Equal",
        "acceptance": "49.9",
        "difficulty": "Medium",
        "displayText": "3422. Minimum Operations to Make Subarray Elements Equal"
    },
    "3423": {
        "id": "3423",
        "name": "Maximum Difference Between Adjacent Elements in a Circular Array",
        "acceptance": "73.7",
        "difficulty": "Easy",
        "displayText": "3423. Maximum Difference Between Adjacent Elements in a Circular Array"
    },
    "3424": {
        "id": "3424",
        "name": "Minimum Cost to Make Arrays Identical",
        "acceptance": "36.7",
        "difficulty": "Medium",
        "displayText": "3424. Minimum Cost to Make Arrays Identical"
    },
    "3425": {
        "id": "3425",
        "name": "Longest Special Path",
        "acceptance": "20.1",
        "difficulty": "Hard",
        "displayText": "3425. Longest Special Path"
    },
    "3426": {
        "id": "3426",
        "name": "Manhattan Distances of All Arrangements of Pieces",
        "acceptance": "35.7",
        "difficulty": "Hard",
        "displayText": "3426. Manhattan Distances of All Arrangements of Pieces"
    },
    "3427": {
        "id": "3427",
        "name": "Sum of Variable Length Subarrays",
        "acceptance": "85.9",
        "difficulty": "Easy",
        "displayText": "3427. Sum of Variable Length Subarrays"
    },
    "3428": {
        "id": "3428",
        "name": "Maximum and Minimum Sums of at Most Size K Subsequences",
        "acceptance": "21.0",
        "difficulty": "Medium",
        "displayText": "3428. Maximum and Minimum Sums of at Most Size K Subsequences"
    },
    "3429": {
        "id": "3429",
        "name": "Paint House IV",
        "acceptance": "45.3",
        "difficulty": "Medium",
        "displayText": "3429. Paint House IV"
    },
    "3430": {
        "id": "3430",
        "name": "Maximum and Minimum Sums of at Most Size K Subarrays",
        "acceptance": "23.4",
        "difficulty": "Hard",
        "displayText": "3430. Maximum and Minimum Sums of at Most Size K Subarrays"
    },
    "3431": {
        "id": "3431",
        "name": "Minimum Unlocked Indices to Sort Nums",
        "acceptance": "59.7",
        "difficulty": "Medium",
        "displayText": "3431. Minimum Unlocked Indices to Sort Nums"
    },
    "3432": {
        "id": "3432",
        "name": "Count Partitions with Even Sum Difference",
        "acceptance": "80.7",
        "difficulty": "Easy",
        "displayText": "3432. Count Partitions with Even Sum Difference"
    },
    "3433": {
        "id": "3433",
        "name": "Count Mentions Per User",
        "acceptance": "30.1",
        "difficulty": "Medium",
        "displayText": "3433. Count Mentions Per User"
    },
    "3434": {
        "id": "3434",
        "name": "Maximum Frequency After Subarray Operation",
        "acceptance": "23.5",
        "difficulty": "Medium",
        "displayText": "3434. Maximum Frequency After Subarray Operation"
    },
    "3435": {
        "id": "3435",
        "name": "Frequencies of Shortest Supersequences",
        "acceptance": "24.7",
        "difficulty": "Hard",
        "displayText": "3435. Frequencies of Shortest Supersequences"
    },
    "3436": {
        "id": "3436",
        "name": "Find Valid Emails",
        "acceptance": "58.2",
        "difficulty": "Easy",
        "displayText": "3436. Find Valid Emails"
    },
    "3437": {
        "id": "3437",
        "name": "Permutations III",
        "acceptance": "86.0",
        "difficulty": "Medium",
        "displayText": "3437. Permutations III"
    },
    "3438": {
        "id": "3438",
        "name": "Find Valid Pair of Adjacent Digits in String",
        "acceptance": "61.6",
        "difficulty": "Easy",
        "displayText": "3438. Find Valid Pair of Adjacent Digits in String"
    },
    "3439": {
        "id": "3439",
        "name": "Reschedule Meetings for Maximum Free Time I",
        "acceptance": "31.5",
        "difficulty": "Medium",
        "displayText": "3439. Reschedule Meetings for Maximum Free Time I"
    },
    "3440": {
        "id": "3440",
        "name": "Reschedule Meetings for Maximum Free Time II",
        "acceptance": "40.2",
        "difficulty": "Medium",
        "displayText": "3440. Reschedule Meetings for Maximum Free Time II"
    },
    "3441": {
        "id": "3441",
        "name": "Minimum Cost Good Caption",
        "acceptance": "19.3",
        "difficulty": "Hard",
        "displayText": "3441. Minimum Cost Good Caption"
    },
    "3442": {
        "id": "3442",
        "name": "Maximum Difference Between Even and Odd Frequency I",
        "acceptance": "49.1",
        "difficulty": "Easy",
        "displayText": "3442. Maximum Difference Between Even and Odd Frequency I"
    },
    "3443": {
        "id": "3443",
        "name": "Maximum Manhattan Distance After K Changes",
        "acceptance": "31.0",
        "difficulty": "Medium",
        "displayText": "3443. Maximum Manhattan Distance After K Changes"
    },
    "3444": {
        "id": "3444",
        "name": "Minimum Increments for Target Multiples in an Array",
        "acceptance": "25.6",
        "difficulty": "Hard",
        "displayText": "3444. Minimum Increments for Target Multiples in an Array"
    },
    "3445": {
        "id": "3445",
        "name": "Maximum Difference Between Even and Odd Frequency II",
        "acceptance": "19.4",
        "difficulty": "Hard",
        "displayText": "3445. Maximum Difference Between Even and Odd Frequency II"
    },
    "3446": {
        "id": "3446",
        "name": "Sort Matrix by Diagonals",
        "acceptance": "72.5",
        "difficulty": "Medium",
        "displayText": "3446. Sort Matrix by Diagonals"
    },
    "3447": {
        "id": "3447",
        "name": "Assign Elements to Groups with Constraints",
        "acceptance": "27.1",
        "difficulty": "Medium",
        "displayText": "3447. Assign Elements to Groups with Constraints"
    },
    "3448": {
        "id": "3448",
        "name": "Count Substrings Divisible By Last Digit",
        "acceptance": "20.9",
        "difficulty": "Hard",
        "displayText": "3448. Count Substrings Divisible By Last Digit"
    },
    "3449": {
        "id": "3449",
        "name": "Maximize the Minimum Game Score",
        "acceptance": "24.4",
        "difficulty": "Hard",
        "displayText": "3449. Maximize the Minimum Game Score"
    },
    "3450": {
        "id": "3450",
        "name": "Maximum Students on a Single Bench",
        "acceptance": "86.5",
        "difficulty": "Easy",
        "displayText": "3450. Maximum Students on a Single Bench"
    },
    "3451": {
        "id": "3451",
        "name": "Find Invalid IP Addresses",
        "acceptance": "57.4",
        "difficulty": "Hard",
        "displayText": "3451. Find Invalid IP Addresses"
    },
    "3452": {
        "id": "3452",
        "name": "Sum of Good Numbers",
        "acceptance": "69.9",
        "difficulty": "Easy",
        "displayText": "3452. Sum of Good Numbers"
    },
    "3453": {
        "id": "3453",
        "name": "Separate Squares I",
        "acceptance": "36.7",
        "difficulty": "Medium",
        "displayText": "3453. Separate Squares I"
    },
    "3454": {
        "id": "3454",
        "name": "Separate Squares II",
        "acceptance": "19.5",
        "difficulty": "Hard",
        "displayText": "3454. Separate Squares II"
    },
    "3455": {
        "id": "3455",
        "name": "Shortest Matching Substring",
        "acceptance": "24.5",
        "difficulty": "Hard",
        "displayText": "3455. Shortest Matching Substring"
    },
    "3456": {
        "id": "3456",
        "name": "Find Special Substring of Length K",
        "acceptance": "35.3",
        "difficulty": "Easy",
        "displayText": "3456. Find Special Substring of Length K"
    },
    "3457": {
        "id": "3457",
        "name": "Eat Pizzas!",
        "acceptance": "32.7",
        "difficulty": "Medium",
        "displayText": "3457. Eat Pizzas!"
    },
    "3458": {
        "id": "3458",
        "name": "Select K Disjoint Special Substrings",
        "acceptance": "17.9",
        "difficulty": "Medium",
        "displayText": "3458. Select K Disjoint Special Substrings"
    },
    "3459": {
        "id": "3459",
        "name": "Length of Longest V-Shaped Diagonal Segment",
        "acceptance": "39.8",
        "difficulty": "Hard",
        "displayText": "3459. Length of Longest V-Shaped Diagonal Segment"
    },
    "3460": {
        "id": "3460",
        "name": "Longest Common Prefix After at Most One Removal",
        "acceptance": "68.9",
        "difficulty": "Medium",
        "displayText": "3460. Longest Common Prefix After at Most One Removal"
    },
    "3461": {
        "id": "3461",
        "name": "Check If Digits Are Equal in String After Operations I",
        "acceptance": "80.1",
        "difficulty": "Easy",
        "displayText": "3461. Check If Digits Are Equal in String After Operations I"
    },
    "3462": {
        "id": "3462",
        "name": "Maximum Sum With at Most K Elements",
        "acceptance": "60.3",
        "difficulty": "Medium",
        "displayText": "3462. Maximum Sum With at Most K Elements"
    },
    "3463": {
        "id": "3463",
        "name": "Check If Digits Are Equal in String After Operations II",
        "acceptance": "10.0",
        "difficulty": "Hard",
        "displayText": "3463. Check If Digits Are Equal in String After Operations II"
    },
    "3464": {
        "id": "3464",
        "name": "Maximize the Distance Between Points on a Square",
        "acceptance": "18.7",
        "difficulty": "Hard",
        "displayText": "3464. Maximize the Distance Between Points on a Square"
    },
    "3465": {
        "id": "3465",
        "name": "Find Products with Valid Serial Numbers",
        "acceptance": "84.5",
        "difficulty": "Easy",
        "displayText": "3465. Find Products with Valid Serial Numbers"
    },
    "3466": {
        "id": "3466",
        "name": "Maximum Coin Collection",
        "acceptance": "54.0",
        "difficulty": "Medium",
        "displayText": "3466. Maximum Coin Collection"
    },
    "3467": {
        "id": "3467",
        "name": "Transform Array by Parity",
        "acceptance": "89.0",
        "difficulty": "Easy",
        "displayText": "3467. Transform Array by Parity"
    },
    "3468": {
        "id": "3468",
        "name": "Find the Number of Copy Arrays",
        "acceptance": "45.5",
        "difficulty": "Medium",
        "displayText": "3468. Find the Number of Copy Arrays"
    },
    "3469": {
        "id": "3469",
        "name": "Find Minimum Cost to Remove Array Elements",
        "acceptance": "17.6",
        "difficulty": "Medium",
        "displayText": "3469. Find Minimum Cost to Remove Array Elements"
    },
    "3470": {
        "id": "3470",
        "name": "Permutations IV",
        "acceptance": "26.5",
        "difficulty": "Hard",
        "displayText": "3470. Permutations IV"
    },
    "3471": {
        "id": "3471",
        "name": "Find the Largest Almost Missing Integer",
        "acceptance": "36.5",
        "difficulty": "Easy",
        "displayText": "3471. Find the Largest Almost Missing Integer"
    },
    "3472": {
        "id": "3472",
        "name": "Longest Palindromic Subsequence After at Most K Operations",
        "acceptance": "35.8",
        "difficulty": "Medium",
        "displayText": "3472. Longest Palindromic Subsequence After at Most K Operations"
    },
    "3473": {
        "id": "3473",
        "name": "Sum of K Subarrays With Length at Least M",
        "acceptance": "24.3",
        "difficulty": "Medium",
        "displayText": "3473. Sum of K Subarrays With Length at Least M"
    },
    "3474": {
        "id": "3474",
        "name": "Lexicographically Smallest Generated String",
        "acceptance": "28.7",
        "difficulty": "Hard",
        "displayText": "3474. Lexicographically Smallest Generated String"
    },
    "3475": {
        "id": "3475",
        "name": "DNA Pattern Recognition",
        "acceptance": "87.4",
        "difficulty": "Medium",
        "displayText": "3475. DNA Pattern Recognition"
    },
    "3476": {
        "id": "3476",
        "name": "Maximize Profit from Task Assignment",
        "acceptance": "63.4",
        "difficulty": "Medium",
        "displayText": "3476. Maximize Profit from Task Assignment"
    },
    "3477": {
        "id": "3477",
        "name": "Fruits Into Baskets II",
        "acceptance": "51.4",
        "difficulty": "Easy",
        "displayText": "3477. Fruits Into Baskets II"
    },
    "3478": {
        "id": "3478",
        "name": "Choose K Elements With Maximum Sum",
        "acceptance": "30.7",
        "difficulty": "Medium",
        "displayText": "3478. Choose K Elements With Maximum Sum"
    },
    "3479": {
        "id": "3479",
        "name": "Fruits Into Baskets III",
        "acceptance": "21.2",
        "difficulty": "Medium",
        "displayText": "3479. Fruits Into Baskets III"
    },
    "3480": {
        "id": "3480",
        "name": "Maximize Subarrays After Removing One Conflicting Pair",
        "acceptance": "31.6",
        "difficulty": "Hard",
        "displayText": "3480. Maximize Subarrays After Removing One Conflicting Pair"
    },
    "3481": {
        "id": "3481",
        "name": "Apply Substitutions",
        "acceptance": "77.6",
        "difficulty": "Medium",
        "displayText": "3481. Apply Substitutions"
    },
    "3482": {
        "id": "3482",
        "name": "Analyze Organization Hierarchy",
        "acceptance": "59.1",
        "difficulty": "Hard",
        "displayText": "3482. Analyze Organization Hierarchy"
    },
    "3483": {
        "id": "3483",
        "name": "Unique 3-Digit Even Numbers",
        "acceptance": "65.8",
        "difficulty": "Easy",
        "displayText": "3483. Unique 3-Digit Even Numbers"
    },
    "3484": {
        "id": "3484",
        "name": "Design Spreadsheet",
        "acceptance": "68.0",
        "difficulty": "Medium",
        "displayText": "3484. Design Spreadsheet"
    },
    "3485": {
        "id": "3485",
        "name": "Longest Common Prefix of K Strings After Removal",
        "acceptance": "19.7",
        "difficulty": "Hard",
        "displayText": "3485. Longest Common Prefix of K Strings After Removal"
    },
    "3486": {
        "id": "3486",
        "name": "Longest Special Path II",
        "acceptance": "15.7",
        "difficulty": "Hard",
        "displayText": "3486. Longest Special Path II"
    },
    "3487": {
        "id": "3487",
        "name": "Maximum Unique Subarray Sum After Deletion",
        "acceptance": "26.9",
        "difficulty": "Easy",
        "displayText": "3487. Maximum Unique Subarray Sum After Deletion"
    },
    "3488": {
        "id": "3488",
        "name": "Closest Equal Element Queries",
        "acceptance": "30.5",
        "difficulty": "Medium",
        "displayText": "3488. Closest Equal Element Queries"
    },
    "3489": {
        "id": "3489",
        "name": "Zero Array Transformation IV",
        "acceptance": "28.9",
        "difficulty": "Medium",
        "displayText": "3489. Zero Array Transformation IV"
    },
    "3490": {
        "id": "3490",
        "name": "Count Beautiful Numbers",
        "acceptance": "20.3",
        "difficulty": "Hard",
        "displayText": "3490. Count Beautiful Numbers"
    },
    "3491": {
        "id": "3491",
        "name": "Phone Number Prefix",
        "acceptance": "75.5",
        "difficulty": "Easy",
        "displayText": "3491. Phone Number Prefix"
    },
    "3492": {
        "id": "3492",
        "name": "Maximum Containers on a Ship",
        "acceptance": "74.3",
        "difficulty": "Easy",
        "displayText": "3492. Maximum Containers on a Ship"
    },
    "3493": {
        "id": "3493",
        "name": "Properties Graph",
        "acceptance": "46.4",
        "difficulty": "Medium",
        "displayText": "3493. Properties Graph"
    },
    "3494": {
        "id": "3494",
        "name": "Find the Minimum Amount of Time to Brew Potions",
        "acceptance": "33.3",
        "difficulty": "Medium",
        "displayText": "3494. Find the Minimum Amount of Time to Brew Potions"
    },
    "3495": {
        "id": "3495",
        "name": "Minimum Operations to Make Array Elements Zero",
        "acceptance": "30.4",
        "difficulty": "Hard",
        "displayText": "3495. Minimum Operations to Make Array Elements Zero"
    },
    "3496": {
        "id": "3496",
        "name": "Maximize Score After Pair Deletions",
        "acceptance": "62.8",
        "difficulty": "Medium",
        "displayText": "3496. Maximize Score After Pair Deletions"
    },
    "3497": {
        "id": "3497",
        "name": "Analyze Subscription Conversion",
        "acceptance": "79.4",
        "difficulty": "Medium",
        "displayText": "3497. Analyze Subscription Conversion"
    },
    "3498": {
        "id": "3498",
        "name": "Reverse Degree of a String",
        "acceptance": "88.8",
        "difficulty": "Easy",
        "displayText": "3498. Reverse Degree of a String"
    },
    "3499": {
        "id": "3499",
        "name": "Maximize Active Section with Trade I",
        "acceptance": "30.0",
        "difficulty": "Medium",
        "displayText": "3499. Maximize Active Section with Trade I"
    },
    "3500": {
        "id": "3500",
        "name": "Minimum Cost to Divide Array Into Subarrays",
        "acceptance": "22.4",
        "difficulty": "Hard",
        "displayText": "3500. Minimum Cost to Divide Array Into Subarrays"
    },
    "3501": {
        "id": "3501",
        "name": "Maximize Active Section with Trade II",
        "acceptance": "19.6",
        "difficulty": "Hard",
        "displayText": "3501. Maximize Active Section with Trade II"
    },
    "3502": {
        "id": "3502",
        "name": "Minimum Cost to Reach Every Position",
        "acceptance": "83.4",
        "difficulty": "Easy",
        "displayText": "3502. Minimum Cost to Reach Every Position"
    },
    "3503": {
        "id": "3503",
        "name": "Longest Palindrome After Substring Concatenation I",
        "acceptance": "43.4",
        "difficulty": "Medium",
        "displayText": "3503. Longest Palindrome After Substring Concatenation I"
    },
    "3504": {
        "id": "3504",
        "name": "Longest Palindrome After Substring Concatenation II",
        "acceptance": "15.2",
        "difficulty": "Hard",
        "displayText": "3504. Longest Palindrome After Substring Concatenation II"
    },
    "3505": {
        "id": "3505",
        "name": "Minimum Operations to Make Elements Within K Subarrays Equal",
        "acceptance": "27.7",
        "difficulty": "Hard",
        "displayText": "3505. Minimum Operations to Make Elements Within K Subarrays Equal"
    },
    "3506": {
        "id": "3506",
        "name": "Find Time Required to Eliminate Bacterial Strains",
        "acceptance": "58.2",
        "difficulty": "Hard",
        "displayText": "3506. Find Time Required to Eliminate Bacterial Strains"
    },
    "3507": {
        "id": "3507",
        "name": "Minimum Pair Removal to Sort Array I",
        "acceptance": "56.9",
        "difficulty": "Easy",
        "displayText": "3507. Minimum Pair Removal to Sort Array I"
    },
    "3508": {
        "id": "3508",
        "name": "Implement Router",
        "acceptance": "21.2",
        "difficulty": "Medium",
        "displayText": "3508. Implement Router"
    },
    "3509": {
        "id": "3509",
        "name": "Maximum Product of Subsequences With an Alternating Sum Equal to K",
        "acceptance": "10.2",
        "difficulty": "Hard",
        "displayText": "3509. Maximum Product of Subsequences With an Alternating Sum Equal to K"
    },
    "3510": {
        "id": "3510",
        "name": "Minimum Pair Removal to Sort Array II",
        "acceptance": "12.3",
        "difficulty": "Hard",
        "displayText": "3510. Minimum Pair Removal to Sort Array II"
    },
    "3511": {
        "id": "3511",
        "name": "Make a Positive Array",
        "acceptance": "39.6",
        "difficulty": "Medium",
        "displayText": "3511. Make a Positive Array"
    },
    "3512": {
        "id": "3512",
        "name": "Minimum Operations to Make Array Sum Divisible by K",
        "acceptance": "87.1",
        "difficulty": "Easy",
        "displayText": "3512. Minimum Operations to Make Array Sum Divisible by K"
    },
    "3513": {
        "id": "3513",
        "name": "Number of Unique XOR Triplets I",
        "acceptance": "23.5",
        "difficulty": "Medium",
        "displayText": "3513. Number of Unique XOR Triplets I"
    },
    "3514": {
        "id": "3514",
        "name": "Number of Unique XOR Triplets II",
        "acceptance": "28.0",
        "difficulty": "Medium",
        "displayText": "3514. Number of Unique XOR Triplets II"
    },
    "3515": {
        "id": "3515",
        "name": "Shortest Path in a Weighted Tree",
        "acceptance": "28.7",
        "difficulty": "Hard",
        "displayText": "3515. Shortest Path in a Weighted Tree"
    },
    "3516": {
        "id": "3516",
        "name": "Find Closest Person",
        "acceptance": "83.2",
        "difficulty": "Easy",
        "displayText": "3516. Find Closest Person"
    },
    "3517": {
        "id": "3517",
        "name": "Smallest Palindromic Rearrangement I",
        "acceptance": "63.5",
        "difficulty": "Medium",
        "displayText": "3517. Smallest Palindromic Rearrangement I"
    },
    "3518": {
        "id": "3518",
        "name": "Smallest Palindromic Rearrangement II",
        "acceptance": "10.2",
        "difficulty": "Hard",
        "displayText": "3518. Smallest Palindromic Rearrangement II"
    },
    "3519": {
        "id": "3519",
        "name": "Count Numbers with Non-Decreasing Digits",
        "acceptance": "32.1",
        "difficulty": "Hard",
        "displayText": "3519. Count Numbers with Non-Decreasing Digits"
    },
    "3520": {
        "id": "3520",
        "name": "Minimum Threshold for Inversion Pairs Count",
        "acceptance": "74.1",
        "difficulty": "Medium",
        "displayText": "3520. Minimum Threshold for Inversion Pairs Count"
    }
}