problems_cache.json

{
  "1": [
    "Two Sum",
    "Easy",
    "two-sum"
  ],
  "2": [
    "Add Two Numbers",
    "Medium",
    "add-two-numbers"
  ],
  "3": [
    "Longest Substring Without Repeating Characters",
    "Medium",
    "longest-substring-without-repeating-characters"
  ],
  "4": [
    "Median of Two Sorted Arrays",
    "Hard",
    "median-of-two-sorted-arrays"
  ],
  "5": [
    "Longest Palindromic Substring",
    "Medium",
    "longest-palindromic-substring"
  ],
  "6": [
    "Zigzag Conversion",
    "Medium",
    "zigzag-conversion"
  ],
  "7": [
    "Reverse Integer",
    "Medium",
    "reverse-integer"
  ],
  "8": [
    "String to Integer (atoi)",
    "Medium",
    "string-to-integer-atoi"
  ],
  "9": [
    "Palindrome Number",
    "Easy",
    "palindrome-number"
  ],
  "10": [
    "Regular Expression Matching",
    "Hard",
    "regular-expression-matching"
  ],
  "11": [
    "Container With Most Water",
    "Medium",
    "container-with-most-water"
  ],
  "12": [
    "Integer to Roman",
    "Medium",
    "integer-to-roman"
  ],
  "13": [
    "Roman to Integer",
    "Easy",
    "roman-to-integer"
  ],
  "14": [
    "Longest Common Prefix",
    "Easy",
    "longest-common-prefix"
  ],
  "15": [
    "3Sum",
    "Medium",
    "3sum"
  ],
  "16": [
    "3Sum Closest",
    "Medium",
    "3sum-closest"
  ],
  "17": [
    "Letter Combinations of a Phone Number",
    "Medium",
    "letter-combinations-of-a-phone-number"
  ],
  "18": [
    "4Sum",
    "Medium",
    "4sum"
  ],
  "19": [
    "Remove Nth Node From End of List",
    "Medium",
    "remove-nth-node-from-end-of-list"
  ],
  "20": [
    "Valid Parentheses",
    "Easy",
    "valid-parentheses"
  ],
  "21": [
    "Merge Two Sorted Lists",
    "Easy",
    "merge-two-sorted-lists"
  ],
  "22": [
    "Generate Parentheses",
    "Medium",
    "generate-parentheses"
  ],
  "23": [
    "Merge k Sorted Lists",
    "Hard",
    "merge-k-sorted-lists"
  ],
  "24": [
    "Swap Nodes in Pairs",
    "Medium",
    "swap-nodes-in-pairs"
  ],
  "25": [
    "Reverse Nodes in k-Group",
    "Hard",
    "reverse-nodes-in-k-group"
  ],
  "26": [
    "Remove Duplicates from Sorted Array",
    "Easy",
    "remove-duplicates-from-sorted-array"
  ],
  "27": [
    "Remove Element",
    "Easy",
    "remove-element"
  ],
  "28": [
    "Find the Index of the First Occurrence in a String",
    "Easy",
    "find-the-index-of-the-first-occurrence-in-a-string"
  ],
  "29": [
    "Divide Two Integers",
    "Medium",
    "divide-two-integers"
  ],
  "30": [
    "Substring with Concatenation of All Words",
    "Hard",
    "substring-with-concatenation-of-all-words"
  ],
  "31": [
    "Next Permutation",
    "Medium",
    "next-permutation"
  ],
  "32": [
    "Longest Valid Parentheses",
    "Hard",
    "longest-valid-parentheses"
  ],
  "33": [
    "Search in Rotated Sorted Array",
    "Medium",
    "search-in-rotated-sorted-array"
  ],
  "34": [
    "Find First and Last Position of Element in Sorted Array",
    "Medium",
    "find-first-and-last-position-of-element-in-sorted-array"
  ],
  "35": [
    "Search Insert Position",
    "Easy",
    "search-insert-position"
  ],
  "36": [
    "Valid Sudoku",
    "Medium",
    "valid-sudoku"
  ],
  "37": [
    "Sudoku Solver",
    "Hard",
    "sudoku-solver"
  ],
  "38": [
    "Count and Say",
    "Medium",
    "count-and-say"
  ],
  "39": [
    "Combination Sum",
    "Medium",
    "combination-sum"
  ],
  "40": [
    "Combination Sum II",
    "Medium",
    "combination-sum-ii"
  ],
  "41": [
    "First Missing Positive",
    "Hard",
    "first-missing-positive"
  ],
  "42": [
    "Trapping Rain Water",
    "Hard",
    "trapping-rain-water"
  ],
  "43": [
    "Multiply Strings",
    "Medium",
    "multiply-strings"
  ],
  "44": [
    "Wildcard Matching",
    "Hard",
    "wildcard-matching"
  ],
  "45": [
    "Jump Game II",
    "Medium",
    "jump-game-ii"
  ],
  "46": [
    "Permutations",
    "Medium",
    "permutations"
  ],
  "47": [
    "Permutations II",
    "Medium",
    "permutations-ii"
  ],
  "48": [
    "Rotate Image",
    "Medium",
    "rotate-image"
  ],
  "49": [
    "Group Anagrams",
    "Medium",
    "group-anagrams"
  ],
  "50": [
    "Pow(x, n)",
    "Medium",
    "powx-n"
  ],
  "51": [
    "N-Queens",
    "Hard",
    "n-queens"
  ],
  "52": [
    "N-Queens II",
    "Hard",
    "n-queens-ii"
  ],
  "53": [
    "Maximum Subarray",
    "Medium",
    "maximum-subarray"
  ],
  "54": [
    "Spiral Matrix",
    "Medium",
    "spiral-matrix"
  ],
  "55": [
    "Jump Game",
    "Medium",
    "jump-game"
  ],
  "56": [
    "Merge Intervals",
    "Medium",
    "merge-intervals"
  ],
  "57": [
    "Insert Interval",
    "Medium",
    "insert-interval"
  ],
  "58": [
    "Length of Last Word",
    "Easy",
    "length-of-last-word"
  ],
  "59": [
    "Spiral Matrix II",
    "Medium",
    "spiral-matrix-ii"
  ],
  "60": [
    "Permutation Sequence",
    "Hard",
    "permutation-sequence"
  ],
  "61": [
    "Rotate List",
    "Medium",
    "rotate-list"
  ],
  "62": [
    "Unique Paths",
    "Medium",
    "unique-paths"
  ],
  "63": [
    "Unique Paths II",
    "Medium",
    "unique-paths-ii"
  ],
  "64": [
    "Minimum Path Sum",
    "Medium",
    "minimum-path-sum"
  ],
  "65": [
    "Valid Number",
    "Hard",
    "valid-number"
  ],
  "66": [
    "Plus One",
    "Easy",
    "plus-one"
  ],
  "67": [
    "Add Binary",
    "Easy",
    "add-binary"
  ],
  "68": [
    "Text Justification",
    "Hard",
    "text-justification"
  ],
  "69": [
    "Sqrt(x)",
    "Easy",
    "sqrtx"
  ],
  "70": [
    "Climbing Stairs",
    "Easy",
    "climbing-stairs"
  ],
  "71": [
    "Simplify Path",
    "Medium",
    "simplify-path"
  ],
  "72": [
    "Edit Distance",
    "Medium",
    "edit-distance"
  ],
  "73": [
    "Set Matrix Zeroes",
    "Medium",
    "set-matrix-zeroes"
  ],
  "74": [
    "Search a 2D Matrix",
    "Medium",
    "search-a-2d-matrix"
  ],
  "75": [
    "Sort Colors",
    "Medium",
    "sort-colors"
  ],
  "76": [
    "Minimum Window Substring",
    "Hard",
    "minimum-window-substring"
  ],
  "77": [
    "Combinations",
    "Medium",
    "combinations"
  ],
  "78": [
    "Subsets",
    "Medium",
    "subsets"
  ],
  "79": [
    "Word Search",
    "Medium",
    "word-search"
  ],
  "80": [
    "Remove Duplicates from Sorted Array II",
    "Medium",
    "remove-duplicates-from-sorted-array-ii"
  ],
  "81": [
    "Search in Rotated Sorted Array II",
    "Medium",
    "search-in-rotated-sorted-array-ii"
  ],
  "82": [
    "Remove Duplicates from Sorted List II",
    "Medium",
    "remove-duplicates-from-sorted-list-ii"
  ],
  "83": [
    "Remove Duplicates from Sorted List",
    "Easy",
    "remove-duplicates-from-sorted-list"
  ],
  "84": [
    "Largest Rectangle in Histogram",
    "Hard",
    "largest-rectangle-in-histogram"
  ],
  "85": [
    "Maximal Rectangle",
    "Hard",
    "maximal-rectangle"
  ],
  "86": [
    "Partition List",
    "Medium",
    "partition-list"
  ],
  "87": [
    "Scramble String",
    "Hard",
    "scramble-string"
  ],
  "88": [
    "Merge Sorted Array",
    "Easy",
    "merge-sorted-array"
  ],
  "89": [
    "Gray Code",
    "Medium",
    "gray-code"
  ],
  "90": [
    "Subsets II",
    "Medium",
    "subsets-ii"
  ],
  "91": [
    "Decode Ways",
    "Medium",
    "decode-ways"
  ],
  "92": [
    "Reverse Linked List II",
    "Medium",
    "reverse-linked-list-ii"
  ],
  "93": [
    "Restore IP Addresses",
    "Medium",
    "restore-ip-addresses"
  ],
  "94": [
    "Binary Tree Inorder Traversal",
    "Easy",
    "binary-tree-inorder-traversal"
  ],
  "95": [
    "Unique Binary Search Trees II",
    "Medium",
    "unique-binary-search-trees-ii"
  ],
  "96": [
    "Unique Binary Search Trees",
    "Medium",
    "unique-binary-search-trees"
  ],
  "97": [
    "Interleaving String",
    "Medium",
    "interleaving-string"
  ],
  "98": [
    "Validate Binary Search Tree",
    "Medium",
    "validate-binary-search-tree"
  ],
  "99": [
    "Recover Binary Search Tree",
    "Medium",
    "recover-binary-search-tree"
  ],
  "100": [
    "Same Tree",
    "Easy",
    "same-tree"
  ],
  "101": [
    "Symmetric Tree",
    "Easy",
    "symmetric-tree"
  ],
  "102": [
    "Binary Tree Level Order Traversal",
    "Medium",
    "binary-tree-level-order-traversal"
  ],
  "103": [
    "Binary Tree Zigzag Level Order Traversal",
    "Medium",
    "binary-tree-zigzag-level-order-traversal"
  ],
  "104": [
    "Maximum Depth of Binary Tree",
    "Easy",
    "maximum-depth-of-binary-tree"
  ],
  "105": [
    "Construct Binary Tree from Preorder and Inorder Traversal",
    "Medium",
    "construct-binary-tree-from-preorder-and-inorder-traversal"
  ],
  "106": [
    "Construct Binary Tree from Inorder and Postorder Traversal",
    "Medium",
    "construct-binary-tree-from-inorder-and-postorder-traversal"
  ],
  "107": [
    "Binary Tree Level Order Traversal II",
    "Medium",
    "binary-tree-level-order-traversal-ii"
  ],
  "108": [
    "Convert Sorted Array to Binary Search Tree",
    "Easy",
    "convert-sorted-array-to-binary-search-tree"
  ],
  "109": [
    "Convert Sorted List to Binary Search Tree",
    "Medium",
    "convert-sorted-list-to-binary-search-tree"
  ],
  "110": [
    "Balanced Binary Tree",
    "Easy",
    "balanced-binary-tree"
  ],
  "111": [
    "Minimum Depth of Binary Tree",
    "Easy",
    "minimum-depth-of-binary-tree"
  ],
  "112": [
    "Path Sum",
    "Easy",
    "path-sum"
  ],
  "113": [
    "Path Sum II",
    "Medium",
    "path-sum-ii"
  ],
  "114": [
    "Flatten Binary Tree to Linked List",
    "Medium",
    "flatten-binary-tree-to-linked-list"
  ],
  "115": [
    "Distinct Subsequences",
    "Hard",
    "distinct-subsequences"
  ],
  "116": [
    "Populating Next Right Pointers in Each Node",
    "Medium",
    "populating-next-right-pointers-in-each-node"
  ],
  "117": [
    "Populating Next Right Pointers in Each Node II",
    "Medium",
    "populating-next-right-pointers-in-each-node-ii"
  ],
  "118": [
    "Pascal's Triangle",
    "Easy",
    "pascals-triangle"
  ],
  "119": [
    "Pascal's Triangle II",
    "Easy",
    "pascals-triangle-ii"
  ],
  "120": [
    "Triangle",
    "Medium",
    "triangle"
  ],
  "121": [
    "Best Time to Buy and Sell Stock",
    "Easy",
    "best-time-to-buy-and-sell-stock"
  ],
  "122": [
    "Best Time to Buy and Sell Stock II",
    "Medium",
    "best-time-to-buy-and-sell-stock-ii"
  ],
  "123": [
    "Best Time to Buy and Sell Stock III",
    "Hard",
    "best-time-to-buy-and-sell-stock-iii"
  ],
  "124": [
    "Binary Tree Maximum Path Sum",
    "Hard",
    "binary-tree-maximum-path-sum"
  ],
  "125": [
    "Valid Palindrome",
    "Easy",
    "valid-palindrome"
  ],
  "126": [
    "Word Ladder II",
    "Hard",
    "word-ladder-ii"
  ],
  "127": [
    "Word Ladder",
    "Hard",
    "word-ladder"
  ],
  "128": [
    "Longest Consecutive Sequence",
    "Medium",
    "longest-consecutive-sequence"
  ],
  "129": [
    "Sum Root to Leaf Numbers",
    "Medium",
    "sum-root-to-leaf-numbers"
  ],
  "130": [
    "Surrounded Regions",
    "Medium",
    "surrounded-regions"
  ],
  "131": [
    "Palindrome Partitioning",
    "Medium",
    "palindrome-partitioning"
  ],
  "132": [
    "Palindrome Partitioning II",
    "Hard",
    "palindrome-partitioning-ii"
  ],
  "133": [
    "Clone Graph",
    "Medium",
    "clone-graph"
  ],
  "134": [
    "Gas Station",
    "Medium",
    "gas-station"
  ],
  "135": [
    "Candy",
    "Hard",
    "candy"
  ],
  "136": [
    "Single Number",
    "Easy",
    "single-number"
  ],
  "137": [
    "Single Number II",
    "Medium",
    "single-number-ii"
  ],
  "138": [
    "Copy List with Random Pointer",
    "Medium",
    "copy-list-with-random-pointer"
  ],
  "139": [
    "Word Break",
    "Medium",
    "word-break"
  ],
  "140": [
    "Word Break II",
    "Hard",
    "word-break-ii"
  ],
  "141": [
    "Linked List Cycle",
    "Easy",
    "linked-list-cycle"
  ],
  "142": [
    "Linked List Cycle II",
    "Medium",
    "linked-list-cycle-ii"
  ],
  "143": [
    "Reorder List",
    "Medium",
    "reorder-list"
  ],
  "144": [
    "Binary Tree Preorder Traversal",
    "Easy",
    "binary-tree-preorder-traversal"
  ],
  "145": [
    "Binary Tree Postorder Traversal",
    "Easy",
    "binary-tree-postorder-traversal"
  ],
  "146": [
    "LRU Cache",
    "Medium",
    "lru-cache"
  ],
  "147": [
    "Insertion Sort List",
    "Medium",
    "insertion-sort-list"
  ],
  "148": [
    "Sort List",
    "Medium",
    "sort-list"
  ],
  "149": [
    "Max Points on a Line",
    "Hard",
    "max-points-on-a-line"
  ],
  "150": [
    "Evaluate Reverse Polish Notation",
    "Medium",
    "evaluate-reverse-polish-notation"
  ],
  "151": [
    "Reverse Words in a String",
    "Medium",
    "reverse-words-in-a-string"
  ],
  "152": [
    "Maximum Product Subarray",
    "Medium",
    "maximum-product-subarray"
  ],
  "153": [
    "Find Minimum in Rotated Sorted Array",
    "Medium",
    "find-minimum-in-rotated-sorted-array"
  ],
  "154": [
    "Find Minimum in Rotated Sorted Array II",
    "Hard",
    "find-minimum-in-rotated-sorted-array-ii"
  ],
  "155": [
    "Min Stack",
    "Medium",
    "min-stack"
  ],
  "156": [
    "Binary Tree Upside Down",
    "Medium",
    "binary-tree-upside-down"
  ],
  "157": [
    "Read N Characters Given Read4",
    "Easy",
    "read-n-characters-given-read4"
  ],
  "158": [
    "Read N Characters Given read4 II - Call Multiple Times",
    "Hard",
    "read-n-characters-given-read4-ii-call-multiple-times"
  ],
  "159": [
    "Longest Substring with At Most Two Distinct Characters",
    "Medium",
    "longest-substring-with-at-most-two-distinct-characters"
  ],
  "160": [
    "Intersection of Two Linked Lists",
    "Easy",
    "intersection-of-two-linked-lists"
  ],
  "161": [
    "One Edit Distance",
    "Medium",
    "one-edit-distance"
  ],
  "162": [
    "Find Peak Element",
    "Medium",
    "find-peak-element"
  ],
  "163": [
    "Missing Ranges",
    "Easy",
    "missing-ranges"
  ],
  "164": [
    "Maximum Gap",
    "Medium",
    "maximum-gap"
  ],
  "165": [
    "Compare Version Numbers",
    "Medium",
    "compare-version-numbers"
  ],
  "166": [
    "Fraction to Recurring Decimal",
    "Medium",
    "fraction-to-recurring-decimal"
  ],
  "167": [
    "Two Sum II - Input Array Is Sorted",
    "Medium",
    "two-sum-ii-input-array-is-sorted"
  ],
  "168": [
    "Excel Sheet Column Title",
    "Easy",
    "excel-sheet-column-title"
  ],
  "169": [
    "Majority Element",
    "Easy",
    "majority-element"
  ],
  "170": [
    "Two Sum III - Data structure design",
    "Easy",
    "two-sum-iii-data-structure-design"
  ],
  "171": [
    "Excel Sheet Column Number",
    "Easy",
    "excel-sheet-column-number"
  ],
  "172": [
    "Factorial Trailing Zeroes",
    "Medium",
    "factorial-trailing-zeroes"
  ],
  "173": [
    "Binary Search Tree Iterator",
    "Medium",
    "binary-search-tree-iterator"
  ],
  "174": [
    "Dungeon Game",
    "Hard",
    "dungeon-game"
  ],
  "175": [
    "Combine Two Tables",
    "Easy",
    "combine-two-tables"
  ],
  "176": [
    "Second Highest Salary",
    "Medium",
    "second-highest-salary"
  ],
  "177": [
    "Nth Highest Salary",
    "Medium",
    "nth-highest-salary"
  ],
  "178": [
    "Rank Scores",
    "Medium",
    "rank-scores"
  ],
  "179": [
    "Largest Number",
    "Medium",
    "largest-number"
  ],
  "180": [
    "Consecutive Numbers",
    "Medium",
    "consecutive-numbers"
  ],
  "181": [
    "Employees Earning More Than Their Managers",
    "Easy",
    "employees-earning-more-than-their-managers"
  ],
  "182": [
    "Duplicate Emails",
    "Easy",
    "duplicate-emails"
  ],
  "183": [
    "Customers Who Never Order",
    "Easy",
    "customers-who-never-order"
  ],
  "184": [
    "Department Highest Salary",
    "Medium",
    "department-highest-salary"
  ],
  "185": [
    "Department Top Three Salaries",
    "Hard",
    "department-top-three-salaries"
  ],
  "186": [
    "Reverse Words in a String II",
    "Medium",
    "reverse-words-in-a-string-ii"
  ],
  "187": [
    "Repeated DNA Sequences",
    "Medium",
    "repeated-dna-sequences"
  ],
  "188": [
    "Best Time to Buy and Sell Stock IV",
    "Hard",
    "best-time-to-buy-and-sell-stock-iv"
  ],
  "189": [
    "Rotate Array",
    "Medium",
    "rotate-array"
  ],
  "190": [
    "Reverse Bits",
    "Easy",
    "reverse-bits"
  ],
  "191": [
    "Number of 1 Bits",
    "Easy",
    "number-of-1-bits"
  ],
  "192": [
    "Word Frequency",
    "Medium",
    "word-frequency"
  ],
  "193": [
    "Valid Phone Numbers",
    "Easy",
    "valid-phone-numbers"
  ],
  "194": [
    "Transpose File",
    "Medium",
    "transpose-file"
  ],
  "195": [
    "Tenth Line",
    "Easy",
    "tenth-line"
  ],
  "196": [
    "Delete Duplicate Emails",
    "Easy",
    "delete-duplicate-emails"
  ],
  "197": [
    "Rising Temperature",
    "Easy",
    "rising-temperature"
  ],
  "198": [
    "House Robber",
    "Medium",
    "house-robber"
  ],
  "199": [
    "Binary Tree Right Side View",
    "Medium",
    "binary-tree-right-side-view"
  ],
  "200": [
    "Number of Islands",
    "Medium",
    "number-of-islands"
  ],
  "201": [
    "Bitwise AND of Numbers Range",
    "Medium",
    "bitwise-and-of-numbers-range"
  ],
  "202": [
    "Happy Number",
    "Easy",
    "happy-number"
  ],
  "203": [
    "Remove Linked List Elements",
    "Easy",
    "remove-linked-list-elements"
  ],
  "204": [
    "Count Primes",
    "Medium",
    "count-primes"
  ],
  "205": [
    "Isomorphic Strings",
    "Easy",
    "isomorphic-strings"
  ],
  "206": [
    "Reverse Linked List",
    "Easy",
    "reverse-linked-list"
  ],
  "207": [
    "Course Schedule",
    "Medium",
    "course-schedule"
  ],
  "208": [
    "Implement Trie (Prefix Tree)",
    "Medium",
    "implement-trie-prefix-tree"
  ],
  "209": [
    "Minimum Size Subarray Sum",
    "Medium",
    "minimum-size-subarray-sum"
  ],
  "210": [
    "Course Schedule II",
    "Medium",
    "course-schedule-ii"
  ],
  "211": [
    "Design Add and Search Words Data Structure",
    "Medium",
    "design-add-and-search-words-data-structure"
  ],
  "212": [
    "Word Search II",
    "Hard",
    "word-search-ii"
  ],
  "213": [
    "House Robber II",
    "Medium",
    "house-robber-ii"
  ],
  "214": [
    "Shortest Palindrome",
    "Hard",
    "shortest-palindrome"
  ],
  "215": [
    "Kth Largest Element in an Array",
    "Medium",
    "kth-largest-element-in-an-array"
  ],
  "216": [
    "Combination Sum III",
    "Medium",
    "combination-sum-iii"
  ],
  "217": [
    "Contains Duplicate",
    "Easy",
    "contains-duplicate"
  ],
  "218": [
    "The Skyline Problem",
    "Hard",
    "the-skyline-problem"
  ],
  "219": [
    "Contains Duplicate II",
    "Easy",
    "contains-duplicate-ii"
  ],
  "220": [
    "Contains Duplicate III",
    "Hard",
    "contains-duplicate-iii"
  ],
  "221": [
    "Maximal Square",
    "Medium",
    "maximal-square"
  ],
  "222": [
    "Count Complete Tree Nodes",
    "Easy",
    "count-complete-tree-nodes"
  ],
  "223": [
    "Rectangle Area",
    "Medium",
    "rectangle-area"
  ],
  "224": [
    "Basic Calculator",
    "Hard",
    "basic-calculator"
  ],
  "225": [
    "Implement Stack using Queues",
    "Easy",
    "implement-stack-using-queues"
  ],
  "226": [
    "Invert Binary Tree",
    "Easy",
    "invert-binary-tree"
  ],
  "227": [
    "Basic Calculator II",
    "Medium",
    "basic-calculator-ii"
  ],
  "228": [
    "Summary Ranges",
    "Easy",
    "summary-ranges"
  ],
  "229": [
    "Majority Element II",
    "Medium",
    "majority-element-ii"
  ],
  "230": [
    "Kth Smallest Element in a BST",
    "Medium",
    "kth-smallest-element-in-a-bst"
  ],
  "231": [
    "Power of Two",
    "Easy",
    "power-of-two"
  ],
  "232": [
    "Implement Queue using Stacks",
    "Easy",
    "implement-queue-using-stacks"
  ],
  "233": [
    "Number of Digit One",
    "Hard",
    "number-of-digit-one"
  ],
  "234": [
    "Palindrome Linked List",
    "Easy",
    "palindrome-linked-list"
  ],
  "235": [
    "Lowest Common Ancestor of a Binary Search Tree",
    "Medium",
    "lowest-common-ancestor-of-a-binary-search-tree"
  ],
  "236": [
    "Lowest Common Ancestor of a Binary Tree",
    "Medium",
    "lowest-common-ancestor-of-a-binary-tree"
  ],
  "237": [
    "Delete Node in a Linked List",
    "Medium",
    "delete-node-in-a-linked-list"
  ],
  "238": [
    "Product of Array Except Self",
    "Medium",
    "product-of-array-except-self"
  ],
  "239": [
    "Sliding Window Maximum",
    "Hard",
    "sliding-window-maximum"
  ],
  "240": [
    "Search a 2D Matrix II",
    "Medium",
    "search-a-2d-matrix-ii"
  ],
  "241": [
    "Different Ways to Add Parentheses",
    "Medium",
    "different-ways-to-add-parentheses"
  ],
  "242": [
    "Valid Anagram",
    "Easy",
    "valid-anagram"
  ],
  "243": [
    "Shortest Word Distance",
    "Easy",
    "shortest-word-distance"
  ],
  "244": [
    "Shortest Word Distance II",
    "Medium",
    "shortest-word-distance-ii"
  ],
  "245": [
    "Shortest Word Distance III",
    "Medium",
    "shortest-word-distance-iii"
  ],
  "246": [
    "Strobogrammatic Number",
    "Easy",
    "strobogrammatic-number"
  ],
  "247": [
    "Strobogrammatic Number II",
    "Medium",
    "strobogrammatic-number-ii"
  ],
  "248": [
    "Strobogrammatic Number III",
    "Hard",
    "strobogrammatic-number-iii"
  ],
  "249": [
    "Group Shifted Strings",
    "Medium",
    "group-shifted-strings"
  ],
  "250": [
    "Count Univalue Subtrees",
    "Medium",
    "count-univalue-subtrees"
  ],
  "251": [
    "Flatten 2D Vector",
    "Medium",
    "flatten-2d-vector"
  ],
  "252": [
    "Meeting Rooms",
    "Easy",
    "meeting-rooms"
  ],
  "253": [
    "Meeting Rooms II",
    "Medium",
    "meeting-rooms-ii"
  ],
  "254": [
    "Factor Combinations",
    "Medium",
    "factor-combinations"
  ],
  "255": [
    "Verify Preorder Sequence in Binary Search Tree",
    "Medium",
    "verify-preorder-sequence-in-binary-search-tree"
  ],
  "256": [
    "Paint House",
    "Medium",
    "paint-house"
  ],
  "257": [
    "Binary Tree Paths",
    "Easy",
    "binary-tree-paths"
  ],
  "258": [
    "Add Digits",
    "Easy",
    "add-digits"
  ],
  "259": [
    "3Sum Smaller",
    "Medium",
    "3sum-smaller"
  ],
  "260": [
    "Single Number III",
    "Medium",
    "single-number-iii"
  ],
  "261": [
    "Graph Valid Tree",
    "Medium",
    "graph-valid-tree"
  ],
  "262": [
    "Trips and Users",
    "Hard",
    "trips-and-users"
  ],
  "263": [
    "Ugly Number",
    "Easy",
    "ugly-number"
  ],
  "264": [
    "Ugly Number II",
    "Medium",
    "ugly-number-ii"
  ],
  "265": [
    "Paint House II",
    "Hard",
    "paint-house-ii"
  ],
  "266": [
    "Palindrome Permutation",
    "Easy",
    "palindrome-permutation"
  ],
  "267": [
    "Palindrome Permutation II",
    "Medium",
    "palindrome-permutation-ii"
  ],
  "268": [
    "Missing Number",
    "Easy",
    "missing-number"
  ],
  "269": [
    "Alien Dictionary",
    "Hard",
    "alien-dictionary"
  ],
  "270": [
    "Closest Binary Search Tree Value",
    "Easy",
    "closest-binary-search-tree-value"
  ],
  "271": [
    "Encode and Decode Strings",
    "Medium",
    "encode-and-decode-strings"
  ],
  "272": [
    "Closest Binary Search Tree Value II",
    "Hard",
    "closest-binary-search-tree-value-ii"
  ],
  "273": [
    "Integer to English Words",
    "Hard",
    "integer-to-english-words"
  ],
  "274": [
    "H-Index",
    "Medium",
    "h-index"
  ],
  "275": [
    "H-Index II",
    "Medium",
    "h-index-ii"
  ],
  "276": [
    "Paint Fence",
    "Medium",
    "paint-fence"
  ],
  "277": [
    "Find the Celebrity",
    "Medium",
    "find-the-celebrity"
  ],
  "278": [
    "First Bad Version",
    "Easy",
    "first-bad-version"
  ],
  "279": [
    "Perfect Squares",
    "Medium",
    "perfect-squares"
  ],
  "280": [
    "Wiggle Sort",
    "Medium",
    "wiggle-sort"
  ],
  "281": [
    "Zigzag Iterator",
    "Medium",
    "zigzag-iterator"
  ],
  "282": [
    "Expression Add Operators",
    "Hard",
    "expression-add-operators"
  ],
  "283": [
    "Move Zeroes",
    "Easy",
    "move-zeroes"
  ],
  "284": [
    "Peeking Iterator",
    "Medium",
    "peeking-iterator"
  ],
  "285": [
    "Inorder Successor in BST",
    "Medium",
    "inorder-successor-in-bst"
  ],
  "286": [
    "Walls and Gates",
    "Medium",
    "walls-and-gates"
  ],
  "287": [
    "Find the Duplicate Number",
    "Medium",
    "find-the-duplicate-number"
  ],
  "288": [
    "Unique Word Abbreviation",
    "Medium",
    "unique-word-abbreviation"
  ],
  "289": [
    "Game of Life",
    "Medium",
    "game-of-life"
  ],
  "290": [
    "Word Pattern",
    "Easy",
    "word-pattern"
  ],
  "291": [
    "Word Pattern II",
    "Medium",
    "word-pattern-ii"
  ],
  "292": [
    "Nim Game",
    "Easy",
    "nim-game"
  ],
  "293": [
    "Flip Game",
    "Easy",
    "flip-game"
  ],
  "294": [
    "Flip Game II",
    "Medium",
    "flip-game-ii"
  ],
  "295": [
    "Find Median from Data Stream",
    "Hard",
    "find-median-from-data-stream"
  ],
  "296": [
    "Best Meeting Point",
    "Hard",
    "best-meeting-point"
  ],
  "297": [
    "Serialize and Deserialize Binary Tree",
    "Hard",
    "serialize-and-deserialize-binary-tree"
  ],
  "298": [
    "Binary Tree Longest Consecutive Sequence",
    "Medium",
    "binary-tree-longest-consecutive-sequence"
  ],
  "299": [
    "Bulls and Cows",
    "Medium",
    "bulls-and-cows"
  ],
  "300": [
    "Longest Increasing Subsequence",
    "Medium",
    "longest-increasing-subsequence"
  ],
  "301": [
    "Remove Invalid Parentheses",
    "Hard",
    "remove-invalid-parentheses"
  ],
  "302": [
    "Smallest Rectangle Enclosing Black Pixels",
    "Hard",
    "smallest-rectangle-enclosing-black-pixels"
  ],
  "303": [
    "Range Sum Query - Immutable",
    "Easy",
    "range-sum-query-immutable"
  ],
  "304": [
    "Range Sum Query 2D - Immutable",
    "Medium",
    "range-sum-query-2d-immutable"
  ],
  "305": [
    "Number of Islands II",
    "Hard",
    "number-of-islands-ii"
  ],
  "306": [
    "Additive Number",
    "Medium",
    "additive-number"
  ],
  "307": [
    "Range Sum Query - Mutable",
    "Medium",
    "range-sum-query-mutable"
  ],
  "308": [
    "Range Sum Query 2D - Mutable",
    "Medium",
    "range-sum-query-2d-mutable"
  ],
  "309": [
    "Best Time to Buy and Sell Stock with Cooldown",
    "Medium",
    "best-time-to-buy-and-sell-stock-with-cooldown"
  ],
  "310": [
    "Minimum Height Trees",
    "Medium",
    "minimum-height-trees"
  ],
  "311": [
    "Sparse Matrix Multiplication",
    "Medium",
    "sparse-matrix-multiplication"
  ],
  "312": [
    "Burst Balloons",
    "Hard",
    "burst-balloons"
  ],
  "313": [
    "Super Ugly Number",
    "Medium",
    "super-ugly-number"
  ],
  "314": [
    "Binary Tree Vertical Order Traversal",
    "Medium",
    "binary-tree-vertical-order-traversal"
  ],
  "315": [
    "Count of Smaller Numbers After Self",
    "Hard",
    "count-of-smaller-numbers-after-self"
  ],
  "316": [
    "Remove Duplicate Letters",
    "Medium",
    "remove-duplicate-letters"
  ],
  "317": [
    "Shortest Distance from All Buildings",
    "Hard",
    "shortest-distance-from-all-buildings"
  ],
  "318": [
    "Maximum Product of Word Lengths",
    "Medium",
    "maximum-product-of-word-lengths"
  ],
  "319": [
    "Bulb Switcher",
    "Medium",
    "bulb-switcher"
  ],
  "320": [
    "Generalized Abbreviation",
    "Medium",
    "generalized-abbreviation"
  ],
  "321": [
    "Create Maximum Number",
    "Hard",
    "create-maximum-number"
  ],
  "322": [
    "Coin Change",
    "Medium",
    "coin-change"
  ],
  "323": [
    "Number of Connected Components in an Undirected Graph",
    "Medium",
    "number-of-connected-components-in-an-undirected-graph"
  ],
  "324": [
    "Wiggle Sort II",
    "Medium",
    "wiggle-sort-ii"
  ],
  "325": [
    "Maximum Size Subarray Sum Equals k",
    "Medium",
    "maximum-size-subarray-sum-equals-k"
  ],
  "326": [
    "Power of Three",
    "Easy",
    "power-of-three"
  ],
  "327": [
    "Count of Range Sum",
    "Hard",
    "count-of-range-sum"
  ],
  "328": [
    "Odd Even Linked List",
    "Medium",
    "odd-even-linked-list"
  ],
  "329": [
    "Longest Increasing Path in a Matrix",
    "Hard",
    "longest-increasing-path-in-a-matrix"
  ],
  "330": [
    "Patching Array",
    "Hard",
    "patching-array"
  ],
  "331": [
    "Verify Preorder Serialization of a Binary Tree",
    "Medium",
    "verify-preorder-serialization-of-a-binary-tree"
  ],
  "332": [
    "Reconstruct Itinerary",
    "Hard",
    "reconstruct-itinerary"
  ],
  "333": [
    "Largest BST Subtree",
    "Medium",
    "largest-bst-subtree"
  ],
  "334": [
    "Increasing Triplet Subsequence",
    "Medium",
    "increasing-triplet-subsequence"
  ],
  "335": [
    "Self Crossing",
    "Hard",
    "self-crossing"
  ],
  "336": [
    "Palindrome Pairs",
    "Hard",
    "palindrome-pairs"
  ],
  "337": [
    "House Robber III",
    "Medium",
    "house-robber-iii"
  ],
  "338": [
    "Counting Bits",
    "Easy",
    "counting-bits"
  ],
  "339": [
    "Nested List Weight Sum",
    "Medium",
    "nested-list-weight-sum"
  ],
  "340": [
    "Longest Substring with At Most K Distinct Characters",
    "Medium",
    "longest-substring-with-at-most-k-distinct-characters"
  ],
  "341": [
    "Flatten Nested List Iterator",
    "Medium",
    "flatten-nested-list-iterator"
  ],
  "342": [
    "Power of Four",
    "Easy",
    "power-of-four"
  ],
  "343": [
    "Integer Break",
    "Medium",
    "integer-break"
  ],
  "344": [
    "Reverse String",
    "Easy",
    "reverse-string"
  ],
  "345": [
    "Reverse Vowels of a String",
    "Easy",
    "reverse-vowels-of-a-string"
  ],
  "346": [
    "Moving Average from Data Stream",
    "Easy",
    "moving-average-from-data-stream"
  ],
  "347": [
    "Top K Frequent Elements",
    "Medium",
    "top-k-frequent-elements"
  ],
  "348": [
    "Design Tic-Tac-Toe",
    "Medium",
    "design-tic-tac-toe"
  ],
  "349": [
    "Intersection of Two Arrays",
    "Easy",
    "intersection-of-two-arrays"
  ],
  "350": [
    "Intersection of Two Arrays II",
    "Easy",
    "intersection-of-two-arrays-ii"
  ],
  "351": [
    "Android Unlock Patterns",
    "Medium",
    "android-unlock-patterns"
  ],
  "352": [
    "Data Stream as Disjoint Intervals",
    "Hard",
    "data-stream-as-disjoint-intervals"
  ],
  "353": [
    "Design Snake Game",
    "Medium",
    "design-snake-game"
  ],
  "354": [
    "Russian Doll Envelopes",
    "Hard",
    "russian-doll-envelopes"
  ],
  "355": [
    "Design Twitter",
    "Medium",
    "design-twitter"
  ],
  "356": [
    "Line Reflection",
    "Medium",
    "line-reflection"
  ],
  "357": [
    "Count Numbers with Unique Digits",
    "Medium",
    "count-numbers-with-unique-digits"
  ],
  "358": [
    "Rearrange String k Distance Apart",
    "Hard",
    "rearrange-string-k-distance-apart"
  ],
  "359": [
    "Logger Rate Limiter",
    "Easy",
    "logger-rate-limiter"
  ],
  "360": [
    "Sort Transformed Array",
    "Medium",
    "sort-transformed-array"
  ],
  "361": [
    "Bomb Enemy",
    "Medium",
    "bomb-enemy"
  ],
  "362": [
    "Design Hit Counter",
    "Medium",
    "design-hit-counter"
  ],
  "363": [
    "Max Sum of Rectangle No Larger Than K",
    "Hard",
    "max-sum-of-rectangle-no-larger-than-k"
  ],
  "364": [
    "Nested List Weight Sum II",
    "Medium",
    "nested-list-weight-sum-ii"
  ],
  "365": [
    "Water and Jug Problem",
    "Medium",
    "water-and-jug-problem"
  ],
  "366": [
    "Find Leaves of Binary Tree",
    "Medium",
    "find-leaves-of-binary-tree"
  ],
  "367": [
    "Valid Perfect Square",
    "Easy",
    "valid-perfect-square"
  ],
  "368": [
    "Largest Divisible Subset",
    "Medium",
    "largest-divisible-subset"
  ],
  "369": [
    "Plus One Linked List",
    "Medium",
    "plus-one-linked-list"
  ],
  "370": [
    "Range Addition",
    "Medium",
    "range-addition"
  ],
  "371": [
    "Sum of Two Integers",
    "Medium",
    "sum-of-two-integers"
  ],
  "372": [
    "Super Pow",
    "Medium",
    "super-pow"
  ],
  "373": [
    "Find K Pairs with Smallest Sums",
    "Medium",
    "find-k-pairs-with-smallest-sums"
  ],
  "374": [
    "Guess Number Higher or Lower",
    "Easy",
    "guess-number-higher-or-lower"
  ],
  "375": [
    "Guess Number Higher or Lower II",
    "Medium",
    "guess-number-higher-or-lower-ii"
  ],
  "376": [
    "Wiggle Subsequence",
    "Medium",
    "wiggle-subsequence"
  ],
  "377": [
    "Combination Sum IV",
    "Medium",
    "combination-sum-iv"
  ],
  "378": [
    "Kth Smallest Element in a Sorted Matrix",
    "Medium",
    "kth-smallest-element-in-a-sorted-matrix"
  ],
  "379": [
    "Design Phone Directory",
    "Medium",
    "design-phone-directory"
  ],
  "380": [
    "Insert Delete GetRandom O(1)",
    "Medium",
    "insert-delete-getrandom-o1"
  ],
  "381": [
    "Insert Delete GetRandom O(1) - Duplicates allowed",
    "Hard",
    "insert-delete-getrandom-o1-duplicates-allowed"
  ],
  "382": [
    "Linked List Random Node",
    "Medium",
    "linked-list-random-node"
  ],
  "383": [
    "Ransom Note",
    "Easy",
    "ransom-note"
  ],
  "384": [
    "Shuffle an Array",
    "Medium",
    "shuffle-an-array"
  ],
  "385": [
    "Mini Parser",
    "Medium",
    "mini-parser"
  ],
  "386": [
    "Lexicographical Numbers",
    "Medium",
    "lexicographical-numbers"
  ],
  "387": [
    "First Unique Character in a String",
    "Easy",
    "first-unique-character-in-a-string"
  ],
  "388": [
    "Longest Absolute File Path",
    "Medium",
    "longest-absolute-file-path"
  ],
  "389": [
    "Find the Difference",
    "Easy",
    "find-the-difference"
  ],
  "390": [
    "Elimination Game",
    "Medium",
    "elimination-game"
  ],
  "391": [
    "Perfect Rectangle",
    "Hard",
    "perfect-rectangle"
  ],
  "392": [
    "Is Subsequence",
    "Easy",
    "is-subsequence"
  ],
  "393": [
    "UTF-8 Validation",
    "Medium",
    "utf-8-validation"
  ],
  "394": [
    "Decode String",
    "Medium",
    "decode-string"
  ],
  "395": [
    "Longest Substring with At Least K Repeating Characters",
    "Medium",
    "longest-substring-with-at-least-k-repeating-characters"
  ],
  "396": [
    "Rotate Function",
    "Medium",
    "rotate-function"
  ],
  "397": [
    "Integer Replacement",
    "Medium",
    "integer-replacement"
  ],
  "398": [
    "Random Pick Index",
    "Medium",
    "random-pick-index"
  ],
  "399": [
    "Evaluate Division",
    "Medium",
    "evaluate-division"
  ],
  "400": [
    "Nth Digit",
    "Medium",
    "nth-digit"
  ],
  "401": [
    "Binary Watch",
    "Easy",
    "binary-watch"
  ],
  "402": [
    "Remove K Digits",
    "Medium",
    "remove-k-digits"
  ],
  "403": [
    "Frog Jump",
    "Hard",
    "frog-jump"
  ],
  "404": [
    "Sum of Left Leaves",
    "Easy",
    "sum-of-left-leaves"
  ],
  "405": [
    "Convert a Number to Hexadecimal",
    "Easy",
    "convert-a-number-to-hexadecimal"
  ],
  "406": [
    "Queue Reconstruction by Height",
    "Medium",
    "queue-reconstruction-by-height"
  ],
  "407": [
    "Trapping Rain Water II",
    "Hard",
    "trapping-rain-water-ii"
  ],
  "408": [
    "Valid Word Abbreviation",
    "Easy",
    "valid-word-abbreviation"
  ],
  "409": [
    "Longest Palindrome",
    "Easy",
    "longest-palindrome"
  ],
  "410": [
    "Split Array Largest Sum",
    "Hard",
    "split-array-largest-sum"
  ],
  "411": [
    "Minimum Unique Word Abbreviation",
    "Hard",
    "minimum-unique-word-abbreviation"
  ],
  "412": [
    "Fizz Buzz",
    "Easy",
    "fizz-buzz"
  ],
  "413": [
    "Arithmetic Slices",
    "Medium",
    "arithmetic-slices"
  ],
  "414": [
    "Third Maximum Number",
    "Easy",
    "third-maximum-number"
  ],
  "415": [
    "Add Strings",
    "Easy",
    "add-strings"
  ],
  "416": [
    "Partition Equal Subset Sum",
    "Medium",
    "partition-equal-subset-sum"
  ],
  "417": [
    "Pacific Atlantic Water Flow",
    "Medium",
    "pacific-atlantic-water-flow"
  ],
  "418": [
    "Sentence Screen Fitting",
    "Medium",
    "sentence-screen-fitting"
  ],
  "419": [
    "Battleships in a Board",
    "Medium",
    "battleships-in-a-board"
  ],
  "420": [
    "Strong Password Checker",
    "Hard",
    "strong-password-checker"
  ],
  "421": [
    "Maximum XOR of Two Numbers in an Array",
    "Medium",
    "maximum-xor-of-two-numbers-in-an-array"
  ],
  "422": [
    "Valid Word Square",
    "Easy",
    "valid-word-square"
  ],
  "423": [
    "Reconstruct Original Digits from English",
    "Medium",
    "reconstruct-original-digits-from-english"
  ],
  "424": [
    "Longest Repeating Character Replacement",
    "Medium",
    "longest-repeating-character-replacement"
  ],
  "425": [
    "Word Squares",
    "Hard",
    "word-squares"
  ],
  "758": [
    "Convert Binary Search Tree to Sorted Doubly Linked List",
    "Medium",
    "convert-binary-search-tree-to-sorted-doubly-linked-list"
  ],
  "772": [
    "Construct Quad Tree",
    "Medium",
    "construct-quad-tree"
  ],
  "765": [
    "Serialize and Deserialize N-ary Tree",
    "Hard",
    "serialize-and-deserialize-n-ary-tree"
  ],
  "764": [
    "N-ary Tree Level Order Traversal",
    "Medium",
    "n-ary-tree-level-order-traversal"
  ],
  "766": [
    "Flatten a Multilevel Doubly Linked List",
    "Medium",
    "flatten-a-multilevel-doubly-linked-list"
  ],
  "771": [
    "Encode N-ary Tree to Binary Tree",
    "Hard",
    "encode-n-ary-tree-to-binary-tree"
  ],
  "432": [
    "All O`one Data Structure",
    "Hard",
    "all-oone-data-structure"
  ],
  "433": [
    "Minimum Genetic Mutation",
    "Medium",
    "minimum-genetic-mutation"
  ],
  "434": [
    "Number of Segments in a String",
    "Easy",
    "number-of-segments-in-a-string"
  ],
  "435": [
    "Non-overlapping Intervals",
    "Medium",
    "non-overlapping-intervals"
  ],
  "436": [
    "Find Right Interval",
    "Medium",
    "find-right-interval"
  ],
  "437": [
    "Path Sum III",
    "Medium",
    "path-sum-iii"
  ],
  "438": [
    "Find All Anagrams in a String",
    "Medium",
    "find-all-anagrams-in-a-string"
  ],
  "439": [
    "Ternary Expression Parser",
    "Medium",
    "ternary-expression-parser"
  ],
  "440": [
    "K-th Smallest in Lexicographical Order",
    "Hard",
    "k-th-smallest-in-lexicographical-order"
  ],
  "441": [
    "Arranging Coins",
    "Easy",
    "arranging-coins"
  ],
  "442": [
    "Find All Duplicates in an Array",
    "Medium",
    "find-all-duplicates-in-an-array"
  ],
  "443": [
    "String Compression",
    "Medium",
    "string-compression"
  ],
  "444": [
    "Sequence Reconstruction",
    "Medium",
    "sequence-reconstruction"
  ],
  "445": [
    "Add Two Numbers II",
    "Medium",
    "add-two-numbers-ii"
  ],
  "446": [
    "Arithmetic Slices II - Subsequence",
    "Hard",
    "arithmetic-slices-ii-subsequence"
  ],
  "447": [
    "Number of Boomerangs",
    "Medium",
    "number-of-boomerangs"
  ],
  "448": [
    "Find All Numbers Disappeared in an Array",
    "Easy",
    "find-all-numbers-disappeared-in-an-array"
  ],
  "449": [
    "Serialize and Deserialize BST",
    "Medium",
    "serialize-and-deserialize-bst"
  ],
  "450": [
    "Delete Node in a BST",
    "Medium",
    "delete-node-in-a-bst"
  ],
  "451": [
    "Sort Characters By Frequency",
    "Medium",
    "sort-characters-by-frequency"
  ],
  "452": [
    "Minimum Number of Arrows to Burst Balloons",
    "Medium",
    "minimum-number-of-arrows-to-burst-balloons"
  ],
  "453": [
    "Minimum Moves to Equal Array Elements",
    "Medium",
    "minimum-moves-to-equal-array-elements"
  ],
  "454": [
    "4Sum II",
    "Medium",
    "4sum-ii"
  ],
  "455": [
    "Assign Cookies",
    "Easy",
    "assign-cookies"
  ],
  "456": [
    "132 Pattern",
    "Medium",
    "132-pattern"
  ],
  "457": [
    "Circular Array Loop",
    "Medium",
    "circular-array-loop"
  ],
  "458": [
    "Poor Pigs",
    "Hard",
    "poor-pigs"
  ],
  "459": [
    "Repeated Substring Pattern",
    "Easy",
    "repeated-substring-pattern"
  ],
  "460": [
    "LFU Cache",
    "Hard",
    "lfu-cache"
  ],
  "461": [
    "Hamming Distance",
    "Easy",
    "hamming-distance"
  ],
  "462": [
    "Minimum Moves to Equal Array Elements II",
    "Medium",
    "minimum-moves-to-equal-array-elements-ii"
  ],
  "463": [
    "Island Perimeter",
    "Easy",
    "island-perimeter"
  ],
  "464": [
    "Can I Win",
    "Medium",
    "can-i-win"
  ],
  "465": [
    "Optimal Account Balancing",
    "Hard",
    "optimal-account-balancing"
  ],
  "466": [
    "Count The Repetitions",
    "Hard",
    "count-the-repetitions"
  ],
  "467": [
    "Unique Substrings in Wraparound String",
    "Medium",
    "unique-substrings-in-wraparound-string"
  ],
  "468": [
    "Validate IP Address",
    "Medium",
    "validate-ip-address"
  ],
  "469": [
    "Convex Polygon",
    "Medium",
    "convex-polygon"
  ],
  "903": [
    "Implement Rand10() Using Rand7()",
    "Medium",
    "implement-rand10-using-rand7"
  ],
  "471": [
    "Encode String with Shortest Length",
    "Hard",
    "encode-string-with-shortest-length"
  ],
  "472": [
    "Concatenated Words",
    "Hard",
    "concatenated-words"
  ],
  "473": [
    "Matchsticks to Square",
    "Medium",
    "matchsticks-to-square"
  ],
  "474": [
    "Ones and Zeroes",
    "Medium",
    "ones-and-zeroes"
  ],
  "475": [
    "Heaters",
    "Medium",
    "heaters"
  ],
  "476": [
    "Number Complement",
    "Easy",
    "number-complement"
  ],
  "477": [
    "Total Hamming Distance",
    "Medium",
    "total-hamming-distance"
  ],
  "915": [
    "Generate Random Point in a Circle",
    "Medium",
    "generate-random-point-in-a-circle"
  ],
  "479": [
    "Largest Palindrome Product",
    "Hard",
    "largest-palindrome-product"
  ],
  "480": [
    "Sliding Window Median",
    "Hard",
    "sliding-window-median"
  ],
  "481": [
    "Magical String",
    "Medium",
    "magical-string"
  ],
  "482": [
    "License Key Formatting",
    "Easy",
    "license-key-formatting"
  ],
  "483": [
    "Smallest Good Base",
    "Hard",
    "smallest-good-base"
  ],
  "484": [
    "Find Permutation",
    "Medium",
    "find-permutation"
  ],
  "485": [
    "Max Consecutive Ones",
    "Easy",
    "max-consecutive-ones"
  ],
  "486": [
    "Predict the Winner",
    "Medium",
    "predict-the-winner"
  ],
  "487": [
    "Max Consecutive Ones II",
    "Medium",
    "max-consecutive-ones-ii"
  ],
  "488": [
    "Zuma Game",
    "Hard",
    "zuma-game"
  ],
  "865": [
    "Robot Room Cleaner",
    "Hard",
    "robot-room-cleaner"
  ],
  "490": [
    "The Maze",
    "Medium",
    "the-maze"
  ],
  "491": [
    "Non-decreasing Subsequences",
    "Medium",
    "non-decreasing-subsequences"
  ],
  "492": [
    "Construct the Rectangle",
    "Easy",
    "construct-the-rectangle"
  ],
  "493": [
    "Reverse Pairs",
    "Hard",
    "reverse-pairs"
  ],
  "494": [
    "Target Sum",
    "Medium",
    "target-sum"
  ],
  "495": [
    "Teemo Attacking",
    "Easy",
    "teemo-attacking"
  ],
  "496": [
    "Next Greater Element I",
    "Easy",
    "next-greater-element-i"
  ],
  "914": [
    "Random Point in Non-overlapping Rectangles",
    "Medium",
    "random-point-in-non-overlapping-rectangles"
  ],
  "498": [
    "Diagonal Traverse",
    "Medium",
    "diagonal-traverse"
  ],
  "499": [
    "The Maze III",
    "Hard",
    "the-maze-iii"
  ],
  "500": [
    "Keyboard Row",
    "Easy",
    "keyboard-row"
  ],
  "501": [
    "Find Mode in Binary Search Tree",
    "Easy",
    "find-mode-in-binary-search-tree"
  ],
  "502": [
    "IPO",
    "Hard",
    "ipo"
  ],
  "503": [
    "Next Greater Element II",
    "Medium",
    "next-greater-element-ii"
  ],
  "504": [
    "Base 7",
    "Easy",
    "base-7"
  ],
  "505": [
    "The Maze II",
    "Medium",
    "the-maze-ii"
  ],
  "506": [
    "Relative Ranks",
    "Easy",
    "relative-ranks"
  ],
  "507": [
    "Perfect Number",
    "Easy",
    "perfect-number"
  ],
  "508": [
    "Most Frequent Subtree Sum",
    "Medium",
    "most-frequent-subtree-sum"
  ],
  "1013": [
    "Fibonacci Number",
    "Easy",
    "fibonacci-number"
  ],
  "509": [
    "Inorder Successor in BST II",
    "Medium",
    "inorder-successor-in-bst-ii"
  ],
  "1179": [
    "Game Play Analysis I",
    "Easy",
    "game-play-analysis-i"
  ],
  "1180": [
    "Game Play Analysis II",
    "Easy",
    "game-play-analysis-ii"
  ],
  "513": [
    "Find Bottom Left Tree Value",
    "Medium",
    "find-bottom-left-tree-value"
  ],
  "514": [
    "Freedom Trail",
    "Hard",
    "freedom-trail"
  ],
  "515": [
    "Find Largest Value in Each Tree Row",
    "Medium",
    "find-largest-value-in-each-tree-row"
  ],
  "516": [
    "Longest Palindromic Subsequence",
    "Medium",
    "longest-palindromic-subsequence"
  ],
  "517": [
    "Super Washing Machines",
    "Hard",
    "super-washing-machines"
  ],
  "518": [
    "Coin Change II",
    "Medium",
    "coin-change-ii"
  ],
  "913": [
    "Random Flip Matrix",
    "Medium",
    "random-flip-matrix"
  ],
  "520": [
    "Detect Capital",
    "Easy",
    "detect-capital"
  ],
  "521": [
    "Longest Uncommon Subsequence I",
    "Easy",
    "longest-uncommon-subsequence-i"
  ],
  "522": [
    "Longest Uncommon Subsequence II",
    "Medium",
    "longest-uncommon-subsequence-ii"
  ],
  "523": [
    "Continuous Subarray Sum",
    "Medium",
    "continuous-subarray-sum"
  ],
  "524": [
    "Longest Word in Dictionary through Deleting",
    "Medium",
    "longest-word-in-dictionary-through-deleting"
  ],
  "525": [
    "Contiguous Array",
    "Medium",
    "contiguous-array"
  ],
  "526": [
    "Beautiful Arrangement",
    "Medium",
    "beautiful-arrangement"
  ],
  "527": [
    "Word Abbreviation",
    "Hard",
    "word-abbreviation"
  ],
  "912": [
    "Random Pick with Weight",
    "Medium",
    "random-pick-with-weight"
  ],
  "529": [
    "Minesweeper",
    "Medium",
    "minesweeper"
  ],
  "530": [
    "Minimum Absolute Difference in BST",
    "Easy",
    "minimum-absolute-difference-in-bst"
  ],
  "531": [
    "Lonely Pixel I",
    "Medium",
    "lonely-pixel-i"
  ],
  "532": [
    "K-diff Pairs in an Array",
    "Medium",
    "k-diff-pairs-in-an-array"
  ],
  "533": [
    "Lonely Pixel II",
    "Medium",
    "lonely-pixel-ii"
  ],
  "1181": [
    "Game Play Analysis III",
    "Medium",
    "game-play-analysis-iii"
  ],
  "535": [
    "Encode and Decode TinyURL",
    "Medium",
    "encode-and-decode-tinyurl"
  ],
  "536": [
    "Construct Binary Tree from String",
    "Medium",
    "construct-binary-tree-from-string"
  ],
  "537": [
    "Complex Number Multiplication",
    "Medium",
    "complex-number-multiplication"
  ],
  "538": [
    "Convert BST to Greater Tree",
    "Medium",
    "convert-bst-to-greater-tree"
  ],
  "539": [
    "Minimum Time Difference",
    "Medium",
    "minimum-time-difference"
  ],
  "540": [
    "Single Element in a Sorted Array",
    "Medium",
    "single-element-in-a-sorted-array"
  ],
  "541": [
    "Reverse String II",
    "Easy",
    "reverse-string-ii"
  ],
  "542": [
    "01 Matrix",
    "Medium",
    "01-matrix"
  ],
  "543": [
    "Diameter of Binary Tree",
    "Easy",
    "diameter-of-binary-tree"
  ],
  "544": [
    "Output Contest Matches",
    "Medium",
    "output-contest-matches"
  ],
  "545": [
    "Boundary of Binary Tree",
    "Medium",
    "boundary-of-binary-tree"
  ],
  "546": [
    "Remove Boxes",
    "Hard",
    "remove-boxes"
  ],
  "547": [
    "Number of Provinces",
    "Medium",
    "number-of-provinces"
  ],
  "548": [
    "Split Array with Equal Sum",
    "Hard",
    "split-array-with-equal-sum"
  ],
  "549": [
    "Binary Tree Longest Consecutive Sequence II",
    "Medium",
    "binary-tree-longest-consecutive-sequence-ii"
  ],
  "1182": [
    "Game Play Analysis IV",
    "Medium",
    "game-play-analysis-iv"
  ],
  "551": [
    "Student Attendance Record I",
    "Easy",
    "student-attendance-record-i"
  ],
  "552": [
    "Student Attendance Record II",
    "Hard",
    "student-attendance-record-ii"
  ],
  "553": [
    "Optimal Division",
    "Medium",
    "optimal-division"
  ],
  "554": [
    "Brick Wall",
    "Medium",
    "brick-wall"
  ],
  "555": [
    "Split Concatenated Strings",
    "Medium",
    "split-concatenated-strings"
  ],
  "556": [
    "Next Greater Element III",
    "Medium",
    "next-greater-element-iii"
  ],
  "557": [
    "Reverse Words in a String III",
    "Easy",
    "reverse-words-in-a-string-iii"
  ],
  "773": [
    "Logical OR of Two Binary Grids Represented as Quad-Trees",
    "Medium",
    "logical-or-of-two-binary-grids-represented-as-quad-trees"
  ],
  "774": [
    "Maximum Depth of N-ary Tree",
    "Easy",
    "maximum-depth-of-n-ary-tree"
  ],
  "560": [
    "Subarray Sum Equals K",
    "Medium",
    "subarray-sum-equals-k"
  ],
  "561": [
    "Array Partition",
    "Easy",
    "array-partition"
  ],
  "562": [
    "Longest Line of Consecutive One in Matrix",
    "Medium",
    "longest-line-of-consecutive-one-in-matrix"
  ],
  "563": [
    "Binary Tree Tilt",
    "Easy",
    "binary-tree-tilt"
  ],
  "564": [
    "Find the Closest Palindrome",
    "Hard",
    "find-the-closest-palindrome"
  ],
  "565": [
    "Array Nesting",
    "Medium",
    "array-nesting"
  ],
  "566": [
    "Reshape the Matrix",
    "Easy",
    "reshape-the-matrix"
  ],
  "567": [
    "Permutation in String",
    "Medium",
    "permutation-in-string"
  ],
  "568": [
    "Maximum Vacation Days",
    "Hard",
    "maximum-vacation-days"
  ],
  "569": [
    "Median Employee Salary",
    "Hard",
    "median-employee-salary"
  ],
  "570": [
    "Managers with at Least 5 Direct Reports",
    "Medium",
    "managers-with-at-least-5-direct-reports"
  ],
  "571": [
    "Find Median Given Frequency of Numbers",
    "Hard",
    "find-median-given-frequency-of-numbers"
  ],
  "572": [
    "Subtree of Another Tree",
    "Easy",
    "subtree-of-another-tree"
  ],
  "573": [
    "Squirrel Simulation",
    "Medium",
    "squirrel-simulation"
  ],
  "574": [
    "Winning Candidate",
    "Medium",
    "winning-candidate"
  ],
  "575": [
    "Distribute Candies",
    "Easy",
    "distribute-candies"
  ],
  "576": [
    "Out of Boundary Paths",
    "Medium",
    "out-of-boundary-paths"
  ],
  "577": [
    "Employee Bonus",
    "Easy",
    "employee-bonus"
  ],
  "578": [
    "Get Highest Answer Rate Question",
    "Medium",
    "get-highest-answer-rate-question"
  ],
  "579": [
    "Find Cumulative Salary of an Employee",
    "Hard",
    "find-cumulative-salary-of-an-employee"
  ],
  "580": [
    "Count Student Number in Departments",
    "Medium",
    "count-student-number-in-departments"
  ],
  "581": [
    "Shortest Unsorted Continuous Subarray",
    "Medium",
    "shortest-unsorted-continuous-subarray"
  ],
  "582": [
    "Kill Process",
    "Medium",
    "kill-process"
  ],
  "583": [
    "Delete Operation for Two Strings",
    "Medium",
    "delete-operation-for-two-strings"
  ],
  "584": [
    "Find Customer Referee",
    "Easy",
    "find-customer-referee"
  ],
  "585": [
    "Investments in 2016",
    "Medium",
    "investments-in-2016"
  ],
  "586": [
    "Customer Placing the Largest Number of Orders",
    "Easy",
    "customer-placing-the-largest-number-of-orders"
  ],
  "587": [
    "Erect the Fence",
    "Hard",
    "erect-the-fence"
  ],
  "588": [
    "Design In-Memory File System",
    "Hard",
    "design-in-memory-file-system"
  ],
  "775": [
    "N-ary Tree Preorder Traversal",
    "Easy",
    "n-ary-tree-preorder-traversal"
  ],
  "776": [
    "N-ary Tree Postorder Traversal",
    "Easy",
    "n-ary-tree-postorder-traversal"
  ],
  "591": [
    "Tag Validator",
    "Hard",
    "tag-validator"
  ],
  "592": [
    "Fraction Addition and Subtraction",
    "Medium",
    "fraction-addition-and-subtraction"
  ],
  "593": [
    "Valid Square",
    "Medium",
    "valid-square"
  ],
  "594": [
    "Longest Harmonious Subsequence",
    "Easy",
    "longest-harmonious-subsequence"
  ],
  "595": [
    "Big Countries",
    "Easy",
    "big-countries"
  ],
  "596": [
    "Classes With at Least 5 Students",
    "Easy",
    "classes-with-at-least-5-students"
  ],
  "597": [
    "Friend Requests I: Overall Acceptance Rate",
    "Easy",
    "friend-requests-i-overall-acceptance-rate"
  ],
  "598": [
    "Range Addition II",
    "Easy",
    "range-addition-ii"
  ],
  "599": [
    "Minimum Index Sum of Two Lists",
    "Easy",
    "minimum-index-sum-of-two-lists"
  ],
  "600": [
    "Non-negative Integers without Consecutive Ones",
    "Hard",
    "non-negative-integers-without-consecutive-ones"
  ],
  "601": [
    "Human Traffic of Stadium",
    "Hard",
    "human-traffic-of-stadium"
  ],
  "602": [
    "Friend Requests II: Who Has the Most Friends",
    "Medium",
    "friend-requests-ii-who-has-the-most-friends"
  ],
  "603": [
    "Consecutive Available Seats",
    "Easy",
    "consecutive-available-seats"
  ],
  "604": [
    "Design Compressed String Iterator",
    "Easy",
    "design-compressed-string-iterator"
  ],
  "605": [
    "Can Place Flowers",
    "Easy",
    "can-place-flowers"
  ],
  "606": [
    "Construct String from Binary Tree",
    "Medium",
    "construct-string-from-binary-tree"
  ],
  "607": [
    "Sales Person",
    "Easy",
    "sales-person"
  ],
  "608": [
    "Tree Node",
    "Medium",
    "tree-node"
  ],
  "609": [
    "Find Duplicate File in System",
    "Medium",
    "find-duplicate-file-in-system"
  ],
  "610": [
    "Triangle Judgement",
    "Easy",
    "triangle-judgement"
  ],
  "611": [
    "Valid Triangle Number",
    "Medium",
    "valid-triangle-number"
  ],
  "612": [
    "Shortest Distance in a Plane",
    "Medium",
    "shortest-distance-in-a-plane"
  ],
  "613": [
    "Shortest Distance in a Line",
    "Easy",
    "shortest-distance-in-a-line"
  ],
  "614": [
    "Second Degree Follower",
    "Medium",
    "second-degree-follower"
  ],
  "615": [
    "Average Salary: Departments VS Company",
    "Hard",
    "average-salary-departments-vs-company"
  ],
  "616": [
    "Add Bold Tag in String",
    "Medium",
    "add-bold-tag-in-string"
  ],
  "617": [
    "Merge Two Binary Trees",
    "Easy",
    "merge-two-binary-trees"
  ],
  "618": [
    "Students Report By Geography",
    "Hard",
    "students-report-by-geography"
  ],
  "619": [
    "Biggest Single Number",
    "Easy",
    "biggest-single-number"
  ],
  "620": [
    "Not Boring Movies",
    "Easy",
    "not-boring-movies"
  ],
  "621": [
    "Task Scheduler",
    "Medium",
    "task-scheduler"
  ],
  "860": [
    "Design Circular Queue",
    "Medium",
    "design-circular-queue"
  ],
  "623": [
    "Add One Row to Tree",
    "Medium",
    "add-one-row-to-tree"
  ],
  "624": [
    "Maximum Distance in Arrays",
    "Medium",
    "maximum-distance-in-arrays"
  ],
  "625": [
    "Minimum Factorization",
    "Medium",
    "minimum-factorization"
  ],
  "626": [
    "Exchange Seats",
    "Medium",
    "exchange-seats"
  ],
  "627": [
    "Swap Sex of Employees",
    "Easy",
    "swap-sex-of-employees"
  ],
  "628": [
    "Maximum Product of Three Numbers",
    "Easy",
    "maximum-product-of-three-numbers"
  ],
  "629": [
    "K Inverse Pairs Array",
    "Hard",
    "k-inverse-pairs-array"
  ],
  "630": [
    "Course Schedule III",
    "Hard",
    "course-schedule-iii"
  ],
  "631": [
    "Design Excel Sum Formula",
    "Hard",
    "design-excel-sum-formula"
  ],
  "632": [
    "Smallest Range Covering Elements from K Lists",
    "Hard",
    "smallest-range-covering-elements-from-k-lists"
  ],
  "633": [
    "Sum of Square Numbers",
    "Medium",
    "sum-of-square-numbers"
  ],
  "634": [
    "Find the Derangement of An Array",
    "Medium",
    "find-the-derangement-of-an-array"
  ],
  "635": [
    "Design Log Storage System",
    "Medium",
    "design-log-storage-system"
  ],
  "636": [
    "Exclusive Time of Functions",
    "Medium",
    "exclusive-time-of-functions"
  ],
  "637": [
    "Average of Levels in Binary Tree",
    "Easy",
    "average-of-levels-in-binary-tree"
  ],
  "638": [
    "Shopping Offers",
    "Medium",
    "shopping-offers"
  ],
  "639": [
    "Decode Ways II",
    "Hard",
    "decode-ways-ii"
  ],
  "640": [
    "Solve the Equation",
    "Medium",
    "solve-the-equation"
  ],
  "859": [
    "Design Circular Deque",
    "Medium",
    "design-circular-deque"
  ],
  "642": [
    "Design Search Autocomplete System",
    "Hard",
    "design-search-autocomplete-system"
  ],
  "643": [
    "Maximum Average Subarray I",
    "Easy",
    "maximum-average-subarray-i"
  ],
  "644": [
    "Maximum Average Subarray II",
    "Hard",
    "maximum-average-subarray-ii"
  ],
  "645": [
    "Set Mismatch",
    "Easy",
    "set-mismatch"
  ],
  "646": [
    "Maximum Length of Pair Chain",
    "Medium",
    "maximum-length-of-pair-chain"
  ],
  "647": [
    "Palindromic Substrings",
    "Medium",
    "palindromic-substrings"
  ],
  "648": [
    "Replace Words",
    "Medium",
    "replace-words"
  ],
  "649": [
    "Dota2 Senate",
    "Medium",
    "dota2-senate"
  ],
  "650": [
    "2 Keys Keyboard",
    "Medium",
    "2-keys-keyboard"
  ],
  "651": [
    "4 Keys Keyboard",
    "Medium",
    "4-keys-keyboard"
  ],
  "652": [
    "Find Duplicate Subtrees",
    "Medium",
    "find-duplicate-subtrees"
  ],
  "653": [
    "Two Sum IV - Input is a BST",
    "Easy",
    "two-sum-iv-input-is-a-bst"
  ],
  "654": [
    "Maximum Binary Tree",
    "Medium",
    "maximum-binary-tree"
  ],
  "655": [
    "Print Binary Tree",
    "Medium",
    "print-binary-tree"
  ],
  "656": [
    "Coin Path",
    "Hard",
    "coin-path"
  ],
  "657": [
    "Robot Return to Origin",
    "Easy",
    "robot-return-to-origin"
  ],
  "658": [
    "Find K Closest Elements",
    "Medium",
    "find-k-closest-elements"
  ],
  "659": [
    "Split Array into Consecutive Subsequences",
    "Medium",
    "split-array-into-consecutive-subsequences"
  ],
  "660": [
    "Remove 9",
    "Hard",
    "remove-9"
  ],
  "661": [
    "Image Smoother",
    "Easy",
    "image-smoother"
  ],
  "662": [
    "Maximum Width of Binary Tree",
    "Medium",
    "maximum-width-of-binary-tree"
  ],
  "663": [
    "Equal Tree Partition",
    "Medium",
    "equal-tree-partition"
  ],
  "664": [
    "Strange Printer",
    "Hard",
    "strange-printer"
  ],
  "665": [
    "Non-decreasing Array",
    "Medium",
    "non-decreasing-array"
  ],
  "666": [
    "Path Sum IV",
    "Medium",
    "path-sum-iv"
  ],
  "667": [
    "Beautiful Arrangement II",
    "Medium",
    "beautiful-arrangement-ii"
  ],
  "668": [
    "Kth Smallest Number in Multiplication Table",
    "Hard",
    "kth-smallest-number-in-multiplication-table"
  ],
  "669": [
    "Trim a Binary Search Tree",
    "Medium",
    "trim-a-binary-search-tree"
  ],
  "670": [
    "Maximum Swap",
    "Medium",
    "maximum-swap"
  ],
  "671": [
    "Second Minimum Node In a Binary Tree",
    "Easy",
    "second-minimum-node-in-a-binary-tree"
  ],
  "672": [
    "Bulb Switcher II",
    "Medium",
    "bulb-switcher-ii"
  ],
  "673": [
    "Number of Longest Increasing Subsequence",
    "Medium",
    "number-of-longest-increasing-subsequence"
  ],
  "674": [
    "Longest Continuous Increasing Subsequence",
    "Easy",
    "longest-continuous-increasing-subsequence"
  ],
  "675": [
    "Cut Off Trees for Golf Event",
    "Hard",
    "cut-off-trees-for-golf-event"
  ],
  "676": [
    "Implement Magic Dictionary",
    "Medium",
    "implement-magic-dictionary"
  ],
  "677": [
    "Map Sum Pairs",
    "Medium",
    "map-sum-pairs"
  ],
  "678": [
    "Valid Parenthesis String",
    "Medium",
    "valid-parenthesis-string"
  ],
  "679": [
    "24 Game",
    "Hard",
    "24-game"
  ],
  "680": [
    "Valid Palindrome II",
    "Easy",
    "valid-palindrome-ii"
  ],
  "681": [
    "Next Closest Time",
    "Medium",
    "next-closest-time"
  ],
  "682": [
    "Baseball Game",
    "Easy",
    "baseball-game"
  ],
  "683": [
    "K Empty Slots",
    "Hard",
    "k-empty-slots"
  ],
  "684": [
    "Redundant Connection",
    "Medium",
    "redundant-connection"
  ],
  "685": [
    "Redundant Connection II",
    "Hard",
    "redundant-connection-ii"
  ],
  "686": [
    "Repeated String Match",
    "Medium",
    "repeated-string-match"
  ],
  "687": [
    "Longest Univalue Path",
    "Medium",
    "longest-univalue-path"
  ],
  "688": [
    "Knight Probability in Chessboard",
    "Medium",
    "knight-probability-in-chessboard"
  ],
  "689": [
    "Maximum Sum of 3 Non-Overlapping Subarrays",
    "Hard",
    "maximum-sum-of-3-non-overlapping-subarrays"
  ],
  "690": [
    "Employee Importance",
    "Medium",
    "employee-importance"
  ],
  "691": [
    "Stickers to Spell Word",
    "Hard",
    "stickers-to-spell-word"
  ],
  "692": [
    "Top K Frequent Words",
    "Medium",
    "top-k-frequent-words"
  ],
  "693": [
    "Binary Number with Alternating Bits",
    "Easy",
    "binary-number-with-alternating-bits"
  ],
  "694": [
    "Number of Distinct Islands",
    "Medium",
    "number-of-distinct-islands"
  ],
  "695": [
    "Max Area of Island",
    "Medium",
    "max-area-of-island"
  ],
  "696": [
    "Count Binary Substrings",
    "Easy",
    "count-binary-substrings"
  ],
  "697": [
    "Degree of an Array",
    "Easy",
    "degree-of-an-array"
  ],
  "698": [
    "Partition to K Equal Sum Subsets",
    "Medium",
    "partition-to-k-equal-sum-subsets"
  ],
  "699": [
    "Falling Squares",
    "Hard",
    "falling-squares"
  ],
  "783": [
    "Search in a Binary Search Tree",
    "Easy",
    "search-in-a-binary-search-tree"
  ],
  "784": [
    "Insert into a Binary Search Tree",
    "Medium",
    "insert-into-a-binary-search-tree"
  ],
  "786": [
    "Search in a Sorted Array of Unknown Size",
    "Medium",
    "search-in-a-sorted-array-of-unknown-size"
  ],
  "789": [
    "Kth Largest Element in a Stream",
    "Easy",
    "kth-largest-element-in-a-stream"
  ],
  "792": [
    "Binary Search",
    "Easy",
    "binary-search"
  ],
  "816": [
    "Design HashSet",
    "Easy",
    "design-hashset"
  ],
  "817": [
    "Design HashMap",
    "Easy",
    "design-hashmap"
  ],
  "838": [
    "Design Linked List",
    "Medium",
    "design-linked-list"
  ],
  "850": [
    "Insert into a Sorted Circular Linked List",
    "Medium",
    "insert-into-a-sorted-circular-linked-list"
  ],
  "742": [
    "To Lower Case",
    "Easy",
    "to-lower-case"
  ],
  "894": [
    "Random Pick with Blacklist",
    "Hard",
    "random-pick-with-blacklist"
  ],
  "711": [
    "Number of Distinct Islands II",
    "Hard",
    "number-of-distinct-islands-ii"
  ],
  "712": [
    "Minimum ASCII Delete Sum for Two Strings",
    "Medium",
    "minimum-ascii-delete-sum-for-two-strings"
  ],
  "713": [
    "Subarray Product Less Than K",
    "Medium",
    "subarray-product-less-than-k"
  ],
  "714": [
    "Best Time to Buy and Sell Stock with Transaction Fee",
    "Medium",
    "best-time-to-buy-and-sell-stock-with-transaction-fee"
  ],
  "715": [
    "Range Module",
    "Hard",
    "range-module"
  ],
  "716": [
    "Max Stack",
    "Hard",
    "max-stack"
  ],
  "717": [
    "1-bit and 2-bit Characters",
    "Easy",
    "1-bit-and-2-bit-characters"
  ],
  "718": [
    "Maximum Length of Repeated Subarray",
    "Medium",
    "maximum-length-of-repeated-subarray"
  ],
  "719": [
    "Find K-th Smallest Pair Distance",
    "Hard",
    "find-k-th-smallest-pair-distance"
  ],
  "720": [
    "Longest Word in Dictionary",
    "Medium",
    "longest-word-in-dictionary"
  ],
  "721": [
    "Accounts Merge",
    "Medium",
    "accounts-merge"
  ],
  "722": [
    "Remove Comments",
    "Medium",
    "remove-comments"
  ],
  "723": [
    "Candy Crush",
    "Medium",
    "candy-crush"
  ],
  "724": [
    "Find Pivot Index",
    "Easy",
    "find-pivot-index"
  ],
  "725": [
    "Split Linked List in Parts",
    "Medium",
    "split-linked-list-in-parts"
  ],
  "726": [
    "Number of Atoms",
    "Hard",
    "number-of-atoms"
  ],
  "727": [
    "Minimum Window Subsequence",
    "Hard",
    "minimum-window-subsequence"
  ],
  "728": [
    "Self Dividing Numbers",
    "Easy",
    "self-dividing-numbers"
  ],
  "729": [
    "My Calendar I",
    "Medium",
    "my-calendar-i"
  ],
  "730": [
    "Count Different Palindromic Subsequences",
    "Hard",
    "count-different-palindromic-subsequences"
  ],
  "731": [
    "My Calendar II",
    "Medium",
    "my-calendar-ii"
  ],
  "732": [
    "My Calendar III",
    "Hard",
    "my-calendar-iii"
  ],
  "733": [
    "Flood Fill",
    "Easy",
    "flood-fill"
  ],
  "734": [
    "Sentence Similarity",
    "Easy",
    "sentence-similarity"
  ],
  "735": [
    "Asteroid Collision",
    "Medium",
    "asteroid-collision"
  ],
  "736": [
    "Parse Lisp Expression",
    "Hard",
    "parse-lisp-expression"
  ],
  "737": [
    "Sentence Similarity II",
    "Medium",
    "sentence-similarity-ii"
  ],
  "738": [
    "Monotone Increasing Digits",
    "Medium",
    "monotone-increasing-digits"
  ],
  "739": [
    "Daily Temperatures",
    "Medium",
    "daily-temperatures"
  ],
  "740": [
    "Delete and Earn",
    "Medium",
    "delete-and-earn"
  ],
  "741": [
    "Cherry Pickup",
    "Hard",
    "cherry-pickup"
  ],
  "743": [
    "Closest Leaf in a Binary Tree",
    "Medium",
    "closest-leaf-in-a-binary-tree"
  ],
  "744": [
    "Network Delay Time",
    "Medium",
    "network-delay-time"
  ],
  "745": [
    "Find Smallest Letter Greater Than Target",
    "Easy",
    "find-smallest-letter-greater-than-target"
  ],
  "746": [
    "Prefix and Suffix Search",
    "Hard",
    "prefix-and-suffix-search"
  ],
  "747": [
    "Min Cost Climbing Stairs",
    "Easy",
    "min-cost-climbing-stairs"
  ],
  "748": [
    "Largest Number At Least Twice of Others",
    "Easy",
    "largest-number-at-least-twice-of-others"
  ],
  "749": [
    "Shortest Completing Word",
    "Easy",
    "shortest-completing-word"
  ],
  "750": [
    "Contain Virus",
    "Hard",
    "contain-virus"
  ],
  "751": [
    "Number Of Corner Rectangles",
    "Medium",
    "number-of-corner-rectangles"
  ],
  "752": [
    "IP to CIDR",
    "Medium",
    "ip-to-cidr"
  ],
  "753": [
    "Open the Lock",
    "Medium",
    "open-the-lock"
  ],
  "754": [
    "Cracking the Safe",
    "Hard",
    "cracking-the-safe"
  ],
  "755": [
    "Reach a Number",
    "Medium",
    "reach-a-number"
  ],
  "756": [
    "Pour Water",
    "Medium",
    "pour-water"
  ],
  "757": [
    "Pyramid Transition Matrix",
    "Medium",
    "pyramid-transition-matrix"
  ],
  "759": [
    "Set Intersection Size At Least Two",
    "Hard",
    "set-intersection-size-at-least-two"
  ],
  "760": [
    "Bold Words in String",
    "Medium",
    "bold-words-in-string"
  ],
  "761": [
    "Employee Free Time",
    "Hard",
    "employee-free-time"
  ],
  "762": [
    "Find Anagram Mappings",
    "Easy",
    "find-anagram-mappings"
  ],
  "763": [
    "Special Binary String",
    "Hard",
    "special-binary-string"
  ],
  "767": [
    "Prime Number of Set Bits in Binary Representation",
    "Easy",
    "prime-number-of-set-bits-in-binary-representation"
  ],
  "768": [
    "Partition Labels",
    "Medium",
    "partition-labels"
  ],
  "769": [
    "Largest Plus Sign",
    "Medium",
    "largest-plus-sign"
  ],
  "770": [
    "Couples Holding Hands",
    "Hard",
    "couples-holding-hands"
  ],
  "777": [
    "Toeplitz Matrix",
    "Easy",
    "toeplitz-matrix"
  ],
  "778": [
    "Reorganize String",
    "Medium",
    "reorganize-string"
  ],
  "779": [
    "Max Chunks To Make Sorted II",
    "Hard",
    "max-chunks-to-make-sorted-ii"
  ],
  "780": [
    "Max Chunks To Make Sorted",
    "Medium",
    "max-chunks-to-make-sorted"
  ],
  "781": [
    "Basic Calculator IV",
    "Hard",
    "basic-calculator-iv"
  ],
  "782": [
    "Jewels and Stones",
    "Easy",
    "jewels-and-stones"
  ],
  "785": [
    "Basic Calculator III",
    "Hard",
    "basic-calculator-iii"
  ],
  "787": [
    "Sliding Puzzle",
    "Hard",
    "sliding-puzzle"
  ],
  "788": [
    "Minimize Max Distance to Gas Station",
    "Hard",
    "minimize-max-distance-to-gas-station"
  ],
  "790": [
    "Global and Local Inversions",
    "Medium",
    "global-and-local-inversions"
  ],
  "791": [
    "Split BST",
    "Medium",
    "split-bst"
  ],
  "793": [
    "Swap Adjacent in LR String",
    "Medium",
    "swap-adjacent-in-lr-string"
  ],
  "794": [
    "Swim in Rising Water",
    "Hard",
    "swim-in-rising-water"
  ],
  "795": [
    "K-th Symbol in Grammar",
    "Medium",
    "k-th-symbol-in-grammar"
  ],
  "796": [
    "Reaching Points",
    "Hard",
    "reaching-points"
  ],
  "797": [
    "Rabbits in Forest",
    "Medium",
    "rabbits-in-forest"
  ],
  "798": [
    "Transform to Chessboard",
    "Hard",
    "transform-to-chessboard"
  ],
  "799": [
    "Minimum Distance Between BST Nodes",
    "Easy",
    "minimum-distance-between-bst-nodes"
  ],
  "800": [
    "Letter Case Permutation",
    "Medium",
    "letter-case-permutation"
  ],
  "801": [
    "Is Graph Bipartite?",
    "Medium",
    "is-graph-bipartite"
  ],
  "802": [
    "K-th Smallest Prime Fraction",
    "Medium",
    "k-th-smallest-prime-fraction"
  ],
  "803": [
    "Cheapest Flights Within K Stops",
    "Medium",
    "cheapest-flights-within-k-stops"
  ],
  "804": [
    "Rotated Digits",
    "Medium",
    "rotated-digits"
  ],
  "805": [
    "Escape The Ghosts",
    "Medium",
    "escape-the-ghosts"
  ],
  "806": [
    "Domino and Tromino Tiling",
    "Medium",
    "domino-and-tromino-tiling"
  ],
  "807": [
    "Custom Sort String",
    "Medium",
    "custom-sort-string"
  ],
  "808": [
    "Number of Matching Subsequences",
    "Medium",
    "number-of-matching-subsequences"
  ],
  "809": [
    "Preimage Size of Factorial Zeroes Function",
    "Hard",
    "preimage-size-of-factorial-zeroes-function"
  ],
  "810": [
    "Valid Tic-Tac-Toe State",
    "Medium",
    "valid-tic-tac-toe-state"
  ],
  "811": [
    "Number of Subarrays with Bounded Maximum",
    "Medium",
    "number-of-subarrays-with-bounded-maximum"
  ],
  "812": [
    "Rotate String",
    "Easy",
    "rotate-string"
  ],
  "813": [
    "All Paths From Source to Target",
    "Medium",
    "all-paths-from-source-to-target"
  ],
  "814": [
    "Smallest Rotation with Highest Score",
    "Hard",
    "smallest-rotation-with-highest-score"
  ],
  "815": [
    "Champagne Tower",
    "Medium",
    "champagne-tower"
  ],
  "818": [
    "Similar RGB Color",
    "Easy",
    "similar-rgb-color"
  ],
  "819": [
    "Minimum Swaps To Make Sequences Increasing",
    "Hard",
    "minimum-swaps-to-make-sequences-increasing"
  ],
  "820": [
    "Find Eventual Safe States",
    "Medium",
    "find-eventual-safe-states"
  ],
  "821": [
    "Bricks Falling When Hit",
    "Hard",
    "bricks-falling-when-hit"
  ],
  "822": [
    "Unique Morse Code Words",
    "Easy",
    "unique-morse-code-words"
  ],
  "823": [
    "Split Array With Same Average",
    "Hard",
    "split-array-with-same-average"
  ],
  "824": [
    "Number of Lines To Write String",
    "Easy",
    "number-of-lines-to-write-string"
  ],
  "825": [
    "Max Increase to Keep City Skyline",
    "Medium",
    "max-increase-to-keep-city-skyline"
  ],
  "826": [
    "Soup Servings",
    "Medium",
    "soup-servings"
  ],
  "827": [
    "Expressive Words",
    "Medium",
    "expressive-words"
  ],
  "828": [
    "Chalkboard XOR Game",
    "Hard",
    "chalkboard-xor-game"
  ],
  "829": [
    "Subdomain Visit Count",
    "Medium",
    "subdomain-visit-count"
  ],
  "830": [
    "Largest Triangle Area",
    "Easy",
    "largest-triangle-area"
  ],
  "831": [
    "Largest Sum of Averages",
    "Medium",
    "largest-sum-of-averages"
  ],
  "832": [
    "Binary Tree Pruning",
    "Medium",
    "binary-tree-pruning"
  ],
  "833": [
    "Bus Routes",
    "Hard",
    "bus-routes"
  ],
  "834": [
    "Ambiguous Coordinates",
    "Medium",
    "ambiguous-coordinates"
  ],
  "835": [
    "Linked List Components",
    "Medium",
    "linked-list-components"
  ],
  "836": [
    "Race Car",
    "Hard",
    "race-car"
  ],
  "837": [
    "Most Common Word",
    "Easy",
    "most-common-word"
  ],
  "839": [
    "Short Encoding of Words",
    "Medium",
    "short-encoding-of-words"
  ],
  "841": [
    "Shortest Distance to a Character",
    "Easy",
    "shortest-distance-to-a-character"
  ],
  "842": [
    "Card Flipping Game",
    "Medium",
    "card-flipping-game"
  ],
  "843": [
    "Binary Trees With Factors",
    "Medium",
    "binary-trees-with-factors"
  ],
  "851": [
    "Goat Latin",
    "Easy",
    "goat-latin"
  ],
  "852": [
    "Friends Of Appropriate Ages",
    "Medium",
    "friends-of-appropriate-ages"
  ],
  "853": [
    "Most Profit Assigning Work",
    "Medium",
    "most-profit-assigning-work"
  ],
  "854": [
    "Making A Large Island",
    "Hard",
    "making-a-large-island"
  ],
  "855": [
    "Count Unique Characters of All Substrings of a Given String",
    "Hard",
    "count-unique-characters-of-all-substrings-of-a-given-string"
  ],
  "856": [
    "Consecutive Numbers Sum",
    "Hard",
    "consecutive-numbers-sum"
  ],
  "857": [
    "Positions of Large Groups",
    "Easy",
    "positions-of-large-groups"
  ],
  "858": [
    "Masking Personal Information",
    "Medium",
    "masking-personal-information"
  ],
  "861": [
    "Flipping an Image",
    "Easy",
    "flipping-an-image"
  ],
  "862": [
    "Find And Replace in String",
    "Medium",
    "find-and-replace-in-string"
  ],
  "863": [
    "Sum of Distances in Tree",
    "Hard",
    "sum-of-distances-in-tree"
  ],
  "864": [
    "Image Overlap",
    "Medium",
    "image-overlap"
  ],
  "866": [
    "Rectangle Overlap",
    "Easy",
    "rectangle-overlap"
  ],
  "867": [
    "New 21 Game",
    "Medium",
    "new-21-game"
  ],
  "868": [
    "Push Dominoes",
    "Medium",
    "push-dominoes"
  ],
  "869": [
    "Similar String Groups",
    "Hard",
    "similar-string-groups"
  ],
  "870": [
    "Magic Squares In Grid",
    "Medium",
    "magic-squares-in-grid"
  ],
  "871": [
    "Keys and Rooms",
    "Medium",
    "keys-and-rooms"
  ],
  "872": [
    "Split Array into Fibonacci Sequence",
    "Medium",
    "split-array-into-fibonacci-sequence"
  ],
  "873": [
    "Guess the Word",
    "Hard",
    "guess-the-word"
  ],
  "874": [
    "Backspace String Compare",
    "Easy",
    "backspace-string-compare"
  ],
  "875": [
    "Longest Mountain in Array",
    "Medium",
    "longest-mountain-in-array"
  ],
  "876": [
    "Hand of Straights",
    "Medium",
    "hand-of-straights"
  ],
  "877": [
    "Shortest Path Visiting All Nodes",
    "Hard",
    "shortest-path-visiting-all-nodes"
  ],
  "878": [
    "Shifting Letters",
    "Medium",
    "shifting-letters"
  ],
  "879": [
    "Maximize Distance to Closest Person",
    "Medium",
    "maximize-distance-to-closest-person"
  ],
  "880": [
    "Rectangle Area II",
    "Hard",
    "rectangle-area-ii"
  ],
  "881": [
    "Loud and Rich",
    "Medium",
    "loud-and-rich"
  ],
  "882": [
    "Peak Index in a Mountain Array",
    "Medium",
    "peak-index-in-a-mountain-array"
  ],
  "883": [
    "Car Fleet",
    "Medium",
    "car-fleet"
  ],
  "884": [
    "K-Similar Strings",
    "Hard",
    "k-similar-strings"
  ],
  "885": [
    "Exam Room",
    "Medium",
    "exam-room"
  ],
  "886": [
    "Score of Parentheses",
    "Medium",
    "score-of-parentheses"
  ],
  "887": [
    "Minimum Cost to Hire K Workers",
    "Hard",
    "minimum-cost-to-hire-k-workers"
  ],
  "888": [
    "Mirror Reflection",
    "Medium",
    "mirror-reflection"
  ],
  "889": [
    "Buddy Strings",
    "Easy",
    "buddy-strings"
  ],
  "890": [
    "Lemonade Change",
    "Easy",
    "lemonade-change"
  ],
  "891": [
    "Score After Flipping Matrix",
    "Medium",
    "score-after-flipping-matrix"
  ],
  "892": [
    "Shortest Subarray with Sum at Least K",
    "Hard",
    "shortest-subarray-with-sum-at-least-k"
  ],
  "893": [
    "All Nodes Distance K in Binary Tree",
    "Medium",
    "all-nodes-distance-k-in-binary-tree"
  ],
  "895": [
    "Shortest Path to Get All Keys",
    "Hard",
    "shortest-path-to-get-all-keys"
  ],
  "896": [
    "Smallest Subtree with all the Deepest Nodes",
    "Medium",
    "smallest-subtree-with-all-the-deepest-nodes"
  ],
  "897": [
    "Prime Palindrome",
    "Medium",
    "prime-palindrome"
  ],
  "898": [
    "Transpose Matrix",
    "Easy",
    "transpose-matrix"
  ],
  "899": [
    "Binary Gap",
    "Easy",
    "binary-gap"
  ],
  "900": [
    "Reordered Power of 2",
    "Medium",
    "reordered-power-of-2"
  ],
  "901": [
    "Advantage Shuffle",
    "Medium",
    "advantage-shuffle"
  ],
  "902": [
    "Minimum Number of Refueling Stops",
    "Hard",
    "minimum-number-of-refueling-stops"
  ],
  "904": [
    "Leaf-Similar Trees",
    "Easy",
    "leaf-similar-trees"
  ],
  "905": [
    "Length of Longest Fibonacci Subsequence",
    "Medium",
    "length-of-longest-fibonacci-subsequence"
  ],
  "906": [
    "Walking Robot Simulation",
    "Medium",
    "walking-robot-simulation"
  ],
  "907": [
    "Koko Eating Bananas",
    "Medium",
    "koko-eating-bananas"
  ],
  "908": [
    "Middle of the Linked List",
    "Easy",
    "middle-of-the-linked-list"
  ],
  "909": [
    "Stone Game",
    "Medium",
    "stone-game"
  ],
  "910": [
    "Nth Magical Number",
    "Hard",
    "nth-magical-number"
  ],
  "911": [
    "Profitable Schemes",
    "Hard",
    "profitable-schemes"
  ],
  "916": [
    "Decoded String at Index",
    "Medium",
    "decoded-string-at-index"
  ],
  "917": [
    "Boats to Save People",
    "Medium",
    "boats-to-save-people"
  ],
  "918": [
    "Reachable Nodes In Subdivided Graph",
    "Hard",
    "reachable-nodes-in-subdivided-graph"
  ],
  "919": [
    "Projection Area of 3D Shapes",
    "Easy",
    "projection-area-of-3d-shapes"
  ],
  "920": [
    "Uncommon Words from Two Sentences",
    "Easy",
    "uncommon-words-from-two-sentences"
  ],
  "921": [
    "Spiral Matrix III",
    "Medium",
    "spiral-matrix-iii"
  ],
  "922": [
    "Possible Bipartition",
    "Medium",
    "possible-bipartition"
  ],
  "923": [
    "Super Egg Drop",
    "Hard",
    "super-egg-drop"
  ],
  "924": [
    "Fair Candy Swap",
    "Easy",
    "fair-candy-swap"
  ],
  "925": [
    "Construct Binary Tree from Preorder and Postorder Traversal",
    "Medium",
    "construct-binary-tree-from-preorder-and-postorder-traversal"
  ],
  "926": [
    "Find and Replace Pattern",
    "Medium",
    "find-and-replace-pattern"
  ],
  "927": [
    "Sum of Subsequence Widths",
    "Hard",
    "sum-of-subsequence-widths"
  ],
  "928": [
    "Surface Area of 3D Shapes",
    "Easy",
    "surface-area-of-3d-shapes"
  ],
  "929": [
    "Groups of Special-Equivalent Strings",
    "Medium",
    "groups-of-special-equivalent-strings"
  ],
  "930": [
    "All Possible Full Binary Trees",
    "Medium",
    "all-possible-full-binary-trees"
  ],
  "931": [
    "Maximum Frequency Stack",
    "Hard",
    "maximum-frequency-stack"
  ],
  "932": [
    "Monotonic Array",
    "Easy",
    "monotonic-array"
  ],
  "933": [
    "Increasing Order Search Tree",
    "Easy",
    "increasing-order-search-tree"
  ],
  "934": [
    "Bitwise ORs of Subarrays",
    "Medium",
    "bitwise-ors-of-subarrays"
  ],
  "935": [
    "Orderly Queue",
    "Hard",
    "orderly-queue"
  ],
  "936": [
    "RLE Iterator",
    "Medium",
    "rle-iterator"
  ],
  "937": [
    "Online Stock Span",
    "Medium",
    "online-stock-span"
  ],
  "938": [
    "Numbers At Most N Given Digit Set",
    "Hard",
    "numbers-at-most-n-given-digit-set"
  ],
  "939": [
    "Valid Permutations for DI Sequence",
    "Hard",
    "valid-permutations-for-di-sequence"
  ],
  "940": [
    "Fruit Into Baskets",
    "Medium",
    "fruit-into-baskets"
  ],
  "941": [
    "Sort Array By Parity",
    "Easy",
    "sort-array-by-parity"
  ],
  "942": [
    "Super Palindromes",
    "Hard",
    "super-palindromes"
  ],
  "943": [
    "Sum of Subarray Minimums",
    "Medium",
    "sum-of-subarray-minimums"
  ],
  "944": [
    "Smallest Range I",
    "Easy",
    "smallest-range-i"
  ],
  "945": [
    "Snakes and Ladders",
    "Medium",
    "snakes-and-ladders"
  ],
  "946": [
    "Smallest Range II",
    "Medium",
    "smallest-range-ii"
  ],
  "947": [
    "Online Election",
    "Medium",
    "online-election"
  ],
  "948": [
    "Sort an Array",
    "Medium",
    "sort-an-array"
  ],
  "949": [
    "Cat and Mouse",
    "Hard",
    "cat-and-mouse"
  ],
  "950": [
    "X of a Kind in a Deck of Cards",
    "Easy",
    "x-of-a-kind-in-a-deck-of-cards"
  ],
  "951": [
    "Partition Array into Disjoint Intervals",
    "Medium",
    "partition-array-into-disjoint-intervals"
  ],
  "952": [
    "Word Subsets",
    "Medium",
    "word-subsets"
  ],
  "953": [
    "Reverse Only Letters",
    "Easy",
    "reverse-only-letters"
  ],
  "954": [
    "Maximum Sum Circular Subarray",
    "Medium",
    "maximum-sum-circular-subarray"
  ],
  "955": [
    "Complete Binary Tree Inserter",
    "Medium",
    "complete-binary-tree-inserter"
  ],
  "956": [
    "Number of Music Playlists",
    "Hard",
    "number-of-music-playlists"
  ],
  "957": [
    "Minimum Add to Make Parentheses Valid",
    "Medium",
    "minimum-add-to-make-parentheses-valid"
  ],
  "958": [
    "Sort Array By Parity II",
    "Easy",
    "sort-array-by-parity-ii"
  ],
  "959": [
    "3Sum With Multiplicity",
    "Medium",
    "3sum-with-multiplicity"
  ],
  "960": [
    "Minimize Malware Spread",
    "Hard",
    "minimize-malware-spread"
  ],
  "961": [
    "Long Pressed Name",
    "Easy",
    "long-pressed-name"
  ],
  "962": [
    "Flip String to Monotone Increasing",
    "Medium",
    "flip-string-to-monotone-increasing"
  ],
  "963": [
    "Three Equal Parts",
    "Hard",
    "three-equal-parts"
  ],
  "964": [
    "Minimize Malware Spread II",
    "Hard",
    "minimize-malware-spread-ii"
  ],
  "965": [
    "Unique Email Addresses",
    "Easy",
    "unique-email-addresses"
  ],
  "966": [
    "Binary Subarrays With Sum",
    "Medium",
    "binary-subarrays-with-sum"
  ],
  "967": [
    "Minimum Falling Path Sum",
    "Medium",
    "minimum-falling-path-sum"
  ],
  "968": [
    "Beautiful Array",
    "Medium",
    "beautiful-array"
  ],
  "969": [
    "Number of Recent Calls",
    "Easy",
    "number-of-recent-calls"
  ],
  "971": [
    "Shortest Bridge",
    "Medium",
    "shortest-bridge"
  ],
  "972": [
    "Knight Dialer",
    "Medium",
    "knight-dialer"
  ],
  "973": [
    "Stamping The Sequence",
    "Hard",
    "stamping-the-sequence"
  ],
  "974": [
    "Reorder Data in Log Files",
    "Medium",
    "reorder-data-in-log-files"
  ],
  "975": [
    "Range Sum of BST",
    "Easy",
    "range-sum-of-bst"
  ],
  "976": [
    "Minimum Area Rectangle",
    "Medium",
    "minimum-area-rectangle"
  ],
  "977": [
    "Distinct Subsequences II",
    "Hard",
    "distinct-subsequences-ii"
  ],
  "978": [
    "Valid Mountain Array",
    "Easy",
    "valid-mountain-array"
  ],
  "979": [
    "DI String Match",
    "Easy",
    "di-string-match"
  ],
  "980": [
    "Find the Shortest Superstring",
    "Hard",
    "find-the-shortest-superstring"
  ],
  "981": [
    "Delete Columns to Make Sorted",
    "Easy",
    "delete-columns-to-make-sorted"
  ],
  "982": [
    "Minimum Increment to Make Array Unique",
    "Medium",
    "minimum-increment-to-make-array-unique"
  ],
  "983": [
    "Validate Stack Sequences",
    "Medium",
    "validate-stack-sequences"
  ],
  "984": [
    "Most Stones Removed with Same Row or Column",
    "Medium",
    "most-stones-removed-with-same-row-or-column"
  ],
  "985": [
    "Bag of Tokens",
    "Medium",
    "bag-of-tokens"
  ],
  "986": [
    "Largest Time for Given Digits",
    "Medium",
    "largest-time-for-given-digits"
  ],
  "987": [
    "Reveal Cards In Increasing Order",
    "Medium",
    "reveal-cards-in-increasing-order"
  ],
  "988": [
    "Flip Equivalent Binary Trees",
    "Medium",
    "flip-equivalent-binary-trees"
  ],
  "989": [
    "Largest Component Size by Common Factor",
    "Hard",
    "largest-component-size-by-common-factor"
  ],
  "990": [
    "Verifying an Alien Dictionary",
    "Easy",
    "verifying-an-alien-dictionary"
  ],
  "991": [
    "Array of Doubled Pairs",
    "Medium",
    "array-of-doubled-pairs"
  ],
  "992": [
    "Delete Columns to Make Sorted II",
    "Medium",
    "delete-columns-to-make-sorted-ii"
  ],
  "993": [
    "Tallest Billboard",
    "Hard",
    "tallest-billboard"
  ],
  "994": [
    "Prison Cells After N Days",
    "Medium",
    "prison-cells-after-n-days"
  ],
  "998": [
    "Check Completeness of a Binary Tree",
    "Medium",
    "check-completeness-of-a-binary-tree"
  ],
  "999": [
    "Regions Cut By Slashes",
    "Medium",
    "regions-cut-by-slashes"
  ],
  "1000": [
    "Delete Columns to Make Sorted III",
    "Hard",
    "delete-columns-to-make-sorted-iii"
  ],
  "1001": [
    "N-Repeated Element in Size 2N Array",
    "Easy",
    "n-repeated-element-in-size-2n-array"
  ],
  "1002": [
    "Maximum Width Ramp",
    "Medium",
    "maximum-width-ramp"
  ],
  "1003": [
    "Minimum Area Rectangle II",
    "Medium",
    "minimum-area-rectangle-ii"
  ],
  "1004": [
    "Least Operators to Express Number",
    "Hard",
    "least-operators-to-express-number"
  ],
  "1005": [
    "Univalued Binary Tree",
    "Easy",
    "univalued-binary-tree"
  ],
  "1006": [
    "Vowel Spellchecker",
    "Medium",
    "vowel-spellchecker"
  ],
  "1007": [
    "Numbers With Same Consecutive Differences",
    "Medium",
    "numbers-with-same-consecutive-differences"
  ],
  "1008": [
    "Binary Tree Cameras",
    "Hard",
    "binary-tree-cameras"
  ],
  "1009": [
    "Pancake Sorting",
    "Medium",
    "pancake-sorting"
  ],
  "1010": [
    "Powerful Integers",
    "Medium",
    "powerful-integers"
  ],
  "1011": [
    "Flip Binary Tree To Match Preorder Traversal",
    "Medium",
    "flip-binary-tree-to-match-preorder-traversal"
  ],
  "1012": [
    "Equal Rational Numbers",
    "Hard",
    "equal-rational-numbers"
  ],
  "1014": [
    "K Closest Points to Origin",
    "Medium",
    "k-closest-points-to-origin"
  ],
  "1016": [
    "Subarray Sums Divisible by K",
    "Medium",
    "subarray-sums-divisible-by-k"
  ],
  "1017": [
    "Odd Even Jump",
    "Hard",
    "odd-even-jump"
  ],
  "1018": [
    "Largest Perimeter Triangle",
    "Easy",
    "largest-perimeter-triangle"
  ],
  "1019": [
    "Squares of a Sorted Array",
    "Easy",
    "squares-of-a-sorted-array"
  ],
  "1020": [
    "Longest Turbulent Subarray",
    "Medium",
    "longest-turbulent-subarray"
  ],
  "1021": [
    "Distribute Coins in Binary Tree",
    "Medium",
    "distribute-coins-in-binary-tree"
  ],
  "1022": [
    "Unique Paths III",
    "Hard",
    "unique-paths-iii"
  ],
  "1023": [
    "Time Based Key-Value Store",
    "Medium",
    "time-based-key-value-store"
  ],
  "1024": [
    "Triples with Bitwise AND Equal To Zero",
    "Hard",
    "triples-with-bitwise-and-equal-to-zero"
  ],
  "1025": [
    "Minimum Cost For Tickets",
    "Medium",
    "minimum-cost-for-tickets"
  ],
  "1026": [
    "String Without AAA or BBB",
    "Medium",
    "string-without-aaa-or-bbb"
  ],
  "1027": [
    "Sum of Even Numbers After Queries",
    "Medium",
    "sum-of-even-numbers-after-queries"
  ],
  "1028": [
    "Interval List Intersections",
    "Medium",
    "interval-list-intersections"
  ],
  "1029": [
    "Vertical Order Traversal of a Binary Tree",
    "Hard",
    "vertical-order-traversal-of-a-binary-tree"
  ],
  "1030": [
    "Smallest String Starting From Leaf",
    "Medium",
    "smallest-string-starting-from-leaf"
  ],
  "1031": [
    "Add to Array-Form of Integer",
    "Easy",
    "add-to-array-form-of-integer"
  ],
  "1032": [
    "Satisfiability of Equality Equations",
    "Medium",
    "satisfiability-of-equality-equations"
  ],
  "1033": [
    "Broken Calculator",
    "Medium",
    "broken-calculator"
  ],
  "1034": [
    "Subarrays with K Different Integers",
    "Hard",
    "subarrays-with-k-different-integers"
  ],
  "1035": [
    "Cousins in Binary Tree",
    "Easy",
    "cousins-in-binary-tree"
  ],
  "1036": [
    "Rotting Oranges",
    "Medium",
    "rotting-oranges"
  ],
  "1037": [
    "Minimum Number of K Consecutive Bit Flips",
    "Hard",
    "minimum-number-of-k-consecutive-bit-flips"
  ],
  "1038": [
    "Number of Squareful Arrays",
    "Hard",
    "number-of-squareful-arrays"
  ],
  "1039": [
    "Find the Town Judge",
    "Easy",
    "find-the-town-judge"
  ],
  "1040": [
    "Maximum Binary Tree II",
    "Medium",
    "maximum-binary-tree-ii"
  ],
  "1041": [
    "Available Captures for Rook",
    "Easy",
    "available-captures-for-rook"
  ],
  "1042": [
    "Minimum Cost to Merge Stones",
    "Hard",
    "minimum-cost-to-merge-stones"
  ],
  "1043": [
    "Grid Illumination",
    "Hard",
    "grid-illumination"
  ],
  "1044": [
    "Find Common Characters",
    "Easy",
    "find-common-characters"
  ],
  "1045": [
    "Check If Word Is Valid After Substitutions",
    "Medium",
    "check-if-word-is-valid-after-substitutions"
  ],
  "1046": [
    "Max Consecutive Ones III",
    "Medium",
    "max-consecutive-ones-iii"
  ],
  "1047": [
    "Maximize Sum Of Array After K Negations",
    "Easy",
    "maximize-sum-of-array-after-k-negations"
  ],
  "1048": [
    "Clumsy Factorial",
    "Medium",
    "clumsy-factorial"
  ],
  "1049": [
    "Minimum Domino Rotations For Equal Row",
    "Medium",
    "minimum-domino-rotations-for-equal-row"
  ],
  "1050": [
    "Construct Binary Search Tree from Preorder Traversal",
    "Medium",
    "construct-binary-search-tree-from-preorder-traversal"
  ],
  "1054": [
    "Complement of Base 10 Integer",
    "Easy",
    "complement-of-base-10-integer"
  ],
  "1055": [
    "Pairs of Songs With Total Durations Divisible by 60",
    "Medium",
    "pairs-of-songs-with-total-durations-divisible-by-60"
  ],
  "1056": [
    "Capacity To Ship Packages Within D Days",
    "Medium",
    "capacity-to-ship-packages-within-d-days"
  ],
  "1057": [
    "Numbers With Repeated Digits",
    "Hard",
    "numbers-with-repeated-digits"
  ],
  "1062": [
    "Partition Array Into Three Parts With Equal Sum",
    "Easy",
    "partition-array-into-three-parts-with-equal-sum"
  ],
  "1063": [
    "Best Sightseeing Pair",
    "Medium",
    "best-sightseeing-pair"
  ],
  "1064": [
    "Smallest Integer Divisible by K",
    "Medium",
    "smallest-integer-divisible-by-k"
  ],
  "1065": [
    "Binary String With Substrings Representing 1 To N",
    "Medium",
    "binary-string-with-substrings-representing-1-to-n"
  ],
  "1070": [
    "Convert to Base -2",
    "Medium",
    "convert-to-base-2"
  ],
  "1071": [
    "Binary Prefix Divisible By 5",
    "Easy",
    "binary-prefix-divisible-by-5"
  ],
  "1072": [
    "Next Greater Node In Linked List",
    "Medium",
    "next-greater-node-in-linked-list"
  ],
  "1073": [
    "Number of Enclaves",
    "Medium",
    "number-of-enclaves"
  ],
  "1078": [
    "Remove Outermost Parentheses",
    "Easy",
    "remove-outermost-parentheses"
  ],
  "1079": [
    "Sum of Root To Leaf Binary Numbers",
    "Easy",
    "sum-of-root-to-leaf-binary-numbers"
  ],
  "1080": [
    "Camelcase Matching",
    "Medium",
    "camelcase-matching"
  ],
  "1081": [
    "Video Stitching",
    "Medium",
    "video-stitching"
  ],
  "1086": [
    "Divisor Game",
    "Easy",
    "divisor-game"
  ],
  "1092": [
    "Maximum Difference Between Node and Ancestor",
    "Medium",
    "maximum-difference-between-node-and-ancestor"
  ],
  "1087": [
    "Longest Arithmetic Subsequence",
    "Medium",
    "longest-arithmetic-subsequence"
  ],
  "1093": [
    "Recover a Tree From Preorder Traversal",
    "Hard",
    "recover-a-tree-from-preorder-traversal"
  ],
  "1095": [
    "Two City Scheduling",
    "Medium",
    "two-city-scheduling"
  ],
  "1094": [
    "Matrix Cells in Distance Order",
    "Easy",
    "matrix-cells-in-distance-order"
  ],
  "1096": [
    "Maximum Sum of Two Non-Overlapping Subarrays",
    "Medium",
    "maximum-sum-of-two-non-overlapping-subarrays"
  ],
  "1097": [
    "Stream of Characters",
    "Hard",
    "stream-of-characters"
  ],
  "1103": [
    "Moving Stones Until Consecutive",
    "Medium",
    "moving-stones-until-consecutive"
  ],
  "1104": [
    "Coloring A Border",
    "Medium",
    "coloring-a-border"
  ],
  "1105": [
    "Uncrossed Lines",
    "Medium",
    "uncrossed-lines"
  ],
  "1106": [
    "Escape a Large Maze",
    "Hard",
    "escape-a-large-maze"
  ],
  "1115": [
    "Valid Boomerang",
    "Easy",
    "valid-boomerang"
  ],
  "1114": [
    "Binary Search Tree to Greater Sum Tree",
    "Medium",
    "binary-search-tree-to-greater-sum-tree"
  ],
  "1111": [
    "Minimum Score Triangulation of Polygon",
    "Medium",
    "minimum-score-triangulation-of-polygon"
  ],
  "1113": [
    "Moving Stones Until Consecutive II",
    "Medium",
    "moving-stones-until-consecutive-ii"
  ],
  "1119": [
    "Robot Bounded In Circle",
    "Medium",
    "robot-bounded-in-circle"
  ],
  "1120": [
    "Flower Planting With No Adjacent",
    "Medium",
    "flower-planting-with-no-adjacent"
  ],
  "1121": [
    "Partition Array for Maximum Sum",
    "Medium",
    "partition-array-for-maximum-sum"
  ],
  "1122": [
    "Longest Duplicate Substring",
    "Hard",
    "longest-duplicate-substring"
  ],
  "1135": [
    "Customers Who Bought All Products",
    "Medium",
    "customers-who-bought-all-products"
  ],
  "1127": [
    "Last Stone Weight",
    "Easy",
    "last-stone-weight"
  ],
  "1128": [
    "Remove All Adjacent Duplicates In String",
    "Easy",
    "remove-all-adjacent-duplicates-in-string"
  ],
  "1129": [
    "Longest String Chain",
    "Medium",
    "longest-string-chain"
  ],
  "1130": [
    "Last Stone Weight II",
    "Medium",
    "last-stone-weight-ii"
  ],
  "1136": [
    "Actors and Directors Who Cooperated At Least Three Times",
    "Easy",
    "actors-and-directors-who-cooperated-at-least-three-times"
  ],
  "1137": [
    "Height Checker",
    "Easy",
    "height-checker"
  ],
  "1138": [
    "Grumpy Bookstore Owner",
    "Medium",
    "grumpy-bookstore-owner"
  ],
  "1139": [
    "Previous Permutation With One Swap",
    "Medium",
    "previous-permutation-with-one-swap"
  ],
  "1140": [
    "Distant Barcodes",
    "Medium",
    "distant-barcodes"
  ],
  "1051": [
    "Shortest Way to Form String",
    "Medium",
    "shortest-way-to-form-string"
  ],
  "1069": [
    "Confusing Number",
    "Easy",
    "confusing-number"
  ],
  "1052": [
    "Campus Bikes",
    "Medium",
    "campus-bikes"
  ],
  "1053": [
    "Minimize Rounding Error to Meet Target",
    "Medium",
    "minimize-rounding-error-to-meet-target"
  ],
  "511": [
    "All Paths from Source Lead to Destination",
    "Medium",
    "all-paths-from-source-lead-to-destination"
  ],
  "1059": [
    "Missing Element in Sorted Array",
    "Medium",
    "missing-element-in-sorted-array"
  ],
  "1058": [
    "Lexicographically Smallest Equivalent String",
    "Medium",
    "lexicographically-smallest-equivalent-string"
  ],
  "1060": [
    "Longest Repeating Substring",
    "Medium",
    "longest-repeating-substring"
  ],
  "1061": [
    "Number of Valid Subarrays",
    "Hard",
    "number-of-valid-subarrays"
  ],
  "1066": [
    "Fixed Point",
    "Easy",
    "fixed-point"
  ],
  "1075": [
    "Index Pairs of a String",
    "Easy",
    "index-pairs-of-a-string"
  ],
  "1067": [
    "Campus Bikes II",
    "Medium",
    "campus-bikes-ii"
  ],
  "1068": [
    "Digit Count in Range",
    "Hard",
    "digit-count-in-range"
  ],
  "1153": [
    "Product Sales Analysis I",
    "Easy",
    "product-sales-analysis-i"
  ],
  "1154": [
    "Product Sales Analysis II",
    "Easy",
    "product-sales-analysis-ii"
  ],
  "1155": [
    "Product Sales Analysis III",
    "Medium",
    "product-sales-analysis-iii"
  ],
  "1146": [
    "Greatest Common Divisor of Strings",
    "Easy",
    "greatest-common-divisor-of-strings"
  ],
  "1147": [
    "Flip Columns For Maximum Number of Equal Rows",
    "Medium",
    "flip-columns-for-maximum-number-of-equal-rows"
  ],
  "1148": [
    "Adding Two Negabinary Numbers",
    "Medium",
    "adding-two-negabinary-numbers"
  ],
  "1145": [
    "Number of Submatrices That Sum to Target",
    "Hard",
    "number-of-submatrices-that-sum-to-target"
  ],
  "1161": [
    "Project Employees I",
    "Easy",
    "project-employees-i"
  ],
  "1162": [
    "Project Employees II",
    "Easy",
    "project-employees-ii"
  ],
  "1163": [
    "Project Employees III",
    "Medium",
    "project-employees-iii"
  ],
  "1156": [
    "Occurrences After Bigram",
    "Easy",
    "occurrences-after-bigram"
  ],
  "1160": [
    "Letter Tile Possibilities",
    "Medium",
    "letter-tile-possibilities"
  ],
  "1157": [
    "Insufficient Nodes in Root to Leaf Paths",
    "Medium",
    "insufficient-nodes-in-root-to-leaf-paths"
  ],
  "1159": [
    "Smallest Subsequence of Distinct Characters",
    "Medium",
    "smallest-subsequence-of-distinct-characters"
  ],
  "1172": [
    "Sales Analysis I",
    "Easy",
    "sales-analysis-i"
  ],
  "1173": [
    "Sales Analysis II",
    "Easy",
    "sales-analysis-ii"
  ],
  "1174": [
    "Sales Analysis III",
    "Easy",
    "sales-analysis-iii"
  ],
  "1082": [
    "Sum of Digits in the Minimum Number",
    "Easy",
    "sum-of-digits-in-the-minimum-number"
  ],
  "1074": [
    "High Five",
    "Easy",
    "high-five"
  ],
  "1076": [
    "Brace Expansion",
    "Medium",
    "brace-expansion"
  ],
  "1077": [
    "Confusing Number II",
    "Hard",
    "confusing-number-ii"
  ],
  "1168": [
    "Duplicate Zeros",
    "Easy",
    "duplicate-zeros"
  ],
  "1169": [
    "Largest Values From Labels",
    "Medium",
    "largest-values-from-labels"
  ],
  "1171": [
    "Shortest Path in Binary Matrix",
    "Medium",
    "shortest-path-in-binary-matrix"
  ],
  "1170": [
    "Shortest Common Supersequence ",
    "Hard",
    "shortest-common-supersequence"
  ],
  "1183": [
    "Statistics from a Large Sample",
    "Medium",
    "statistics-from-a-large-sample"
  ],
  "1184": [
    "Car Pooling",
    "Medium",
    "car-pooling"
  ],
  "1185": [
    "Find in Mountain Array",
    "Hard",
    "find-in-mountain-array"
  ],
  "1188": [
    "Brace Expansion II",
    "Hard",
    "brace-expansion-ii"
  ],
  "1193": [
    "Game Play Analysis V",
    "Hard",
    "game-play-analysis-v"
  ],
  "1198": [
    "Unpopular Books",
    "Medium",
    "unpopular-books"
  ],
  "1083": [
    "Two Sum Less Than K",
    "Easy",
    "two-sum-less-than-k"
  ],
  "1084": [
    "Find K-Length Substrings With No Repeated Characters",
    "Medium",
    "find-k-length-substrings-with-no-repeated-characters"
  ],
  "1085": [
    "The Earliest Moment When Everyone Become Friends",
    "Medium",
    "the-earliest-moment-when-everyone-become-friends"
  ],
  "1099": [
    "Path With Maximum Minimum Value",
    "Medium",
    "path-with-maximum-minimum-value"
  ],
  "1195": [
    "Distribute Candies to People",
    "Easy",
    "distribute-candies-to-people"
  ],
  "1194": [
    "Path In Zigzag Labelled Binary Tree",
    "Medium",
    "path-in-zigzag-labelled-binary-tree"
  ],
  "1196": [
    "Filling Bookcase Shelves",
    "Medium",
    "filling-bookcase-shelves"
  ],
  "1197": [
    "Parsing A Boolean Expression",
    "Hard",
    "parsing-a-boolean-expression"
  ],
  "1204": [
    "New Users Daily Count",
    "Medium",
    "new-users-daily-count"
  ],
  "1205": [
    "Defanging an IP Address",
    "Easy",
    "defanging-an-ip-address"
  ],
  "1206": [
    "Corporate Flight Bookings",
    "Medium",
    "corporate-flight-bookings"
  ],
  "1207": [
    "Delete Nodes And Return Forest",
    "Medium",
    "delete-nodes-and-return-forest"
  ],
  "1208": [
    "Maximum Nesting Depth of Two Valid Parentheses Strings",
    "Medium",
    "maximum-nesting-depth-of-two-valid-parentheses-strings"
  ],
  "1214": [
    "Highest Grade For Each Student",
    "Medium",
    "highest-grade-for-each-student"
  ],
  "1215": [
    "Reported Posts",
    "Easy",
    "reported-posts"
  ],
  "1203": [
    "Print in Order",
    "Easy",
    "print-in-order"
  ],
  "1187": [
    "Print FooBar Alternately",
    "Medium",
    "print-foobar-alternately"
  ],
  "1216": [
    "Print Zero Even Odd",
    "Medium",
    "print-zero-even-odd"
  ],
  "1186": [
    "Building H2O",
    "Medium",
    "building-h2o"
  ],
  "1088": [
    "Number of Days in a Month",
    "Easy",
    "number-of-days-in-a-month"
  ],
  "1089": [
    "Remove Vowels from a String",
    "Easy",
    "remove-vowels-from-a-string"
  ],
  "1091": [
    "Maximum Average Subtree",
    "Medium",
    "maximum-average-subtree"
  ],
  "1118": [
    "Divide Array Into Increasing Sequences",
    "Hard",
    "divide-array-into-increasing-sequences"
  ],
  "1217": [
    "Relative Sort Array",
    "Easy",
    "relative-sort-array"
  ],
  "1218": [
    "Lowest Common Ancestor of Deepest Leaves",
    "Medium",
    "lowest-common-ancestor-of-deepest-leaves"
  ],
  "1219": [
    "Longest Well-Performing Interval",
    "Medium",
    "longest-well-performing-interval"
  ],
  "1220": [
    "Smallest Sufficient Team",
    "Hard",
    "smallest-sufficient-team"
  ],
  "1225": [
    "Active Businesses",
    "Medium",
    "active-businesses"
  ],
  "1226": [
    "User Purchase Platform",
    "Hard",
    "user-purchase-platform"
  ],
  "1227": [
    "Number of Equivalent Domino Pairs",
    "Easy",
    "number-of-equivalent-domino-pairs"
  ],
  "1229": [
    "Shortest Path with Alternating Colors",
    "Medium",
    "shortest-path-with-alternating-colors"
  ],
  "1228": [
    "Minimum Cost Tree From Leaf Values",
    "Medium",
    "minimum-cost-tree-from-leaf-values"
  ],
  "1230": [
    "Maximum of Absolute Value Expression",
    "Medium",
    "maximum-of-absolute-value-expression"
  ],
  "1237": [
    "Reported Posts II",
    "Medium",
    "reported-posts-ii"
  ],
  "1098": [
    "Largest Unique Number",
    "Easy",
    "largest-unique-number"
  ],
  "1090": [
    "Armstrong Number",
    "Easy",
    "armstrong-number"
  ],
  "1100": [
    "Connecting Cities With Minimum Cost",
    "Medium",
    "connecting-cities-with-minimum-cost"
  ],
  "1101": [
    "Parallel Courses",
    "Medium",
    "parallel-courses"
  ],
  "1236": [
    "N-th Tribonacci Number",
    "Easy",
    "n-th-tribonacci-number"
  ],
  "1238": [
    "Alphabet Board Path",
    "Medium",
    "alphabet-board-path"
  ],
  "1239": [
    "Largest 1-Bordered Square",
    "Medium",
    "largest-1-bordered-square"
  ],
  "1240": [
    "Stone Game II",
    "Medium",
    "stone-game-ii"
  ],
  "1245": [
    "User Activity for the Past 30 Days I",
    "Easy",
    "user-activity-for-the-past-30-days-i"
  ],
  "1246": [
    "User Activity for the Past 30 Days II",
    "Easy",
    "user-activity-for-the-past-30-days-ii"
  ],
  "1250": [
    "Longest Common Subsequence",
    "Medium",
    "longest-common-subsequence"
  ],
  "1247": [
    "Decrease Elements To Make Array Zigzag",
    "Medium",
    "decrease-elements-to-make-array-zigzag"
  ],
  "1248": [
    "Binary Tree Coloring Game",
    "Medium",
    "binary-tree-coloring-game"
  ],
  "1249": [
    "Snapshot Array",
    "Medium",
    "snapshot-array"
  ],
  "1251": [
    "Longest Chunked Palindrome Decomposition",
    "Hard",
    "longest-chunked-palindrome-decomposition"
  ],
  "1258": [
    "Article Views I",
    "Easy",
    "article-views-i"
  ],
  "1259": [
    "Article Views II",
    "Medium",
    "article-views-ii"
  ],
  "1102": [
    "Check If a Number Is Majority Element in a Sorted Array",
    "Easy",
    "check-if-a-number-is-majority-element-in-a-sorted-array"
  ],
  "1107": [
    "Minimum Swaps to Group All 1's Together",
    "Medium",
    "minimum-swaps-to-group-all-1s-together"
  ],
  "1108": [
    "Analyze User Website Visit Pattern",
    "Medium",
    "analyze-user-website-visit-pattern"
  ],
  "1124": [
    "String Transforms Into Another String",
    "Hard",
    "string-transforms-into-another-string"
  ],
  "1260": [
    "Day of the Year",
    "Easy",
    "day-of-the-year"
  ],
  "1263": [
    "Number of Dice Rolls With Target Sum",
    "Medium",
    "number-of-dice-rolls-with-target-sum"
  ],
  "1261": [
    "Swap For Longest Repeated Character Substring",
    "Medium",
    "swap-for-longest-repeated-character-substring"
  ],
  "1262": [
    "Online Majority Element In Subarray",
    "Hard",
    "online-majority-element-in-subarray"
  ],
  "1268": [
    "Market Analysis I",
    "Medium",
    "market-analysis-i"
  ],
  "1269": [
    "Market Analysis II",
    "Hard",
    "market-analysis-ii"
  ],
  "1112": [
    "Find Words That Can Be Formed by Characters",
    "Easy",
    "find-words-that-can-be-formed-by-characters"
  ],
  "1116": [
    "Maximum Level Sum of a Binary Tree",
    "Medium",
    "maximum-level-sum-of-a-binary-tree"
  ],
  "1117": [
    "As Far from Land as Possible",
    "Medium",
    "as-far-from-land-as-possible"
  ],
  "1133": [
    "Last Substring in Lexicographical Order",
    "Hard",
    "last-substring-in-lexicographical-order"
  ],
  "1278": [
    "Product Price at a Given Date",
    "Medium",
    "product-price-at-a-given-date"
  ],
  "1123": [
    "Single-Row Keyboard",
    "Easy",
    "single-row-keyboard"
  ],
  "1125": [
    "Design File System",
    "Medium",
    "design-file-system"
  ],
  "1126": [
    "Minimum Cost to Connect Sticks",
    "Medium",
    "minimum-cost-to-connect-sticks"
  ],
  "1144": [
    "Optimize Water Distribution in a Village",
    "Hard",
    "optimize-water-distribution-in-a-village"
  ],
  "1272": [
    "Invalid Transactions",
    "Medium",
    "invalid-transactions"
  ],
  "1273": [
    "Compare Strings by Frequency of the Smallest Character",
    "Medium",
    "compare-strings-by-frequency-of-the-smallest-character"
  ],
  "1267": [
    "Remove Zero Sum Consecutive Nodes from Linked List",
    "Medium",
    "remove-zero-sum-consecutive-nodes-from-linked-list"
  ],
  "1270": [
    "Dinner Plate Stacks",
    "Hard",
    "dinner-plate-stacks"
  ],
  "1291": [
    "Immediate Food Delivery I",
    "Easy",
    "immediate-food-delivery-i"
  ],
  "1292": [
    "Immediate Food Delivery II",
    "Medium",
    "immediate-food-delivery-ii"
  ],
  "1279": [
    "Prime Arrangements",
    "Easy",
    "prime-arrangements"
  ],
  "1280": [
    "Diet Plan Performance",
    "Easy",
    "diet-plan-performance"
  ],
  "1281": [
    "Can Make Palindrome from Substring",
    "Medium",
    "can-make-palindrome-from-substring"
  ],
  "1282": [
    "Number of Valid Words for Each Puzzle",
    "Hard",
    "number-of-valid-words-for-each-puzzle"
  ],
  "1301": [
    "Reformat Department Table",
    "Easy",
    "reformat-department-table"
  ],
  "1131": [
    "Count Substrings with Only One Distinct Letter",
    "Easy",
    "count-substrings-with-only-one-distinct-letter"
  ],
  "1132": [
    "Before and After Puzzle",
    "Medium",
    "before-and-after-puzzle"
  ],
  "1134": [
    "Shortest Distance to Target Color",
    "Medium",
    "shortest-distance-to-target-color"
  ],
  "1152": [
    "Maximum Number of Ones",
    "Hard",
    "maximum-number-of-ones"
  ],
  "1287": [
    "Distance Between Bus Stops",
    "Easy",
    "distance-between-bus-stops"
  ],
  "1289": [
    "Day of the Week",
    "Easy",
    "day-of-the-week"
  ],
  "1288": [
    "Maximum Subarray Sum with One Deletion",
    "Medium",
    "maximum-subarray-sum-with-one-deletion"
  ],
  "1290": [
    "Make Array Strictly Increasing",
    "Hard",
    "make-array-strictly-increasing"
  ],
  "1209": [
    "Design Bounded Blocking Queue",
    "Medium",
    "design-bounded-blocking-queue"
  ],
  "1297": [
    "Maximum Number of Balloons",
    "Easy",
    "maximum-number-of-balloons"
  ],
  "1298": [
    "Reverse Substrings Between Each Pair of Parentheses",
    "Medium",
    "reverse-substrings-between-each-pair-of-parentheses"
  ],
  "1299": [
    "K-Concatenation Maximum Sum",
    "Medium",
    "k-concatenation-maximum-sum"
  ],
  "1300": [
    "Critical Connections in a Network",
    "Hard",
    "critical-connections-in-a-network"
  ],
  "1317": [
    "Monthly Transactions I",
    "Medium",
    "monthly-transactions-i"
  ],
  "1318": [
    "Tournament Winners",
    "Hard",
    "tournament-winners"
  ],
  "1316": [
    "Fizz Buzz Multithreaded",
    "Medium",
    "fizz-buzz-multithreaded"
  ],
  "1141": [
    "How Many Apples Can You Put into the Basket",
    "Easy",
    "how-many-apples-can-you-put-into-the-basket"
  ],
  "1142": [
    "Minimum Knight Moves",
    "Medium",
    "minimum-knight-moves"
  ],
  "1143": [
    "Find Smallest Common Element in All Rows",
    "Medium",
    "find-smallest-common-element-in-all-rows"
  ],
  "1167": [
    "Minimum Time to Build Blocks",
    "Hard",
    "minimum-time-to-build-blocks"
  ],
  "1306": [
    "Minimum Absolute Difference",
    "Easy",
    "minimum-absolute-difference"
  ],
  "1307": [
    "Ugly Number III",
    "Medium",
    "ugly-number-iii"
  ],
  "1308": [
    "Smallest String With Swaps",
    "Medium",
    "smallest-string-with-swaps"
  ],
  "1309": [
    "Sort Items by Groups Respecting Dependencies",
    "Hard",
    "sort-items-by-groups-respecting-dependencies"
  ],
  "1327": [
    "Last Person to Fit in the Bus",
    "Medium",
    "last-person-to-fit-in-the-bus"
  ],
  "1328": [
    "Monthly Transactions II",
    "Medium",
    "monthly-transactions-ii"
  ],
  "1337": [
    "Design Skiplist",
    "Hard",
    "design-skiplist"
  ],
  "1319": [
    "Unique Number of Occurrences",
    "Easy",
    "unique-number-of-occurrences"
  ],
  "1321": [
    "Get Equal Substrings Within Budget",
    "Medium",
    "get-equal-substrings-within-budget"
  ],
  "1320": [
    "Remove All Adjacent Duplicates in String II",
    "Medium",
    "remove-all-adjacent-duplicates-in-string-ii"
  ],
  "1322": [
    "Minimum Moves to Reach Target with Rotations",
    "Hard",
    "minimum-moves-to-reach-target-with-rotations"
  ],
  "1338": [
    "Queries Quality and Percentage",
    "Easy",
    "queries-quality-and-percentage"
  ],
  "1339": [
    "Team Scores in Football Tournament",
    "Medium",
    "team-scores-in-football-tournament"
  ],
  "1149": [
    "Intersection of Three Sorted Arrays",
    "Easy",
    "intersection-of-three-sorted-arrays"
  ],
  "1150": [
    "Two Sum BSTs",
    "Medium",
    "two-sum-bsts"
  ],
  "1151": [
    "Stepping Numbers",
    "Medium",
    "stepping-numbers"
  ],
  "1178": [
    "Valid Palindrome III",
    "Hard",
    "valid-palindrome-iii"
  ],
  "1329": [
    "Minimum Cost to Move Chips to The Same Position",
    "Easy",
    "minimum-cost-to-move-chips-to-the-same-position"
  ],
  "1330": [
    "Longest Arithmetic Subsequence of Given Difference",
    "Medium",
    "longest-arithmetic-subsequence-of-given-difference"
  ],
  "1331": [
    "Path with Maximum Gold",
    "Medium",
    "path-with-maximum-gold"
  ],
  "1332": [
    "Count Vowels Permutation",
    "Hard",
    "count-vowels-permutation"
  ],
  "1341": [
    "Split a String in Balanced Strings",
    "Easy",
    "split-a-string-in-balanced-strings"
  ],
  "1342": [
    "Queens That Can Attack the King",
    "Medium",
    "queens-that-can-attack-the-king"
  ],
  "1343": [
    "Dice Roll Simulation",
    "Hard",
    "dice-roll-simulation"
  ],
  "1344": [
    "Maximum Equal Frequency",
    "Hard",
    "maximum-equal-frequency"
  ],
  "1357": [
    "Report Contiguous Dates",
    "Hard",
    "report-contiguous-dates"
  ],
  "1340": [
    "The Dining Philosophers",
    "Medium",
    "the-dining-philosophers"
  ],
  "1362": [
    "Airplane Seat Assignment Probability",
    "Medium",
    "airplane-seat-assignment-probability"
  ],
  "1164": [
    "Missing Number In Arithmetic Progression",
    "Easy",
    "missing-number-in-arithmetic-progression"
  ],
  "1165": [
    "Meeting Scheduler",
    "Medium",
    "meeting-scheduler"
  ],
  "1166": [
    "Toss Strange Coins",
    "Medium",
    "toss-strange-coins"
  ],
  "1192": [
    "Divide Chocolate",
    "Hard",
    "divide-chocolate"
  ],
  "1349": [
    "Check If It Is a Straight Line",
    "Easy",
    "check-if-it-is-a-straight-line"
  ],
  "1350": [
    "Remove Sub-Folders from the Filesystem",
    "Medium",
    "remove-sub-folders-from-the-filesystem"
  ],
  "1351": [
    "Replace the Substring for Balanced String",
    "Medium",
    "replace-the-substring-for-balanced-string"
  ],
  "1352": [
    "Maximum Profit in Job Scheduling",
    "Hard",
    "maximum-profit-in-job-scheduling"
  ],
  "1271": [
    "Web Crawler",
    "Medium",
    "web-crawler"
  ],
  "1358": [
    "Find Positive Integer Solution for a Given Equation",
    "Medium",
    "find-positive-integer-solution-for-a-given-equation"
  ],
  "1359": [
    "Circular Permutation in Binary Representation",
    "Medium",
    "circular-permutation-in-binary-representation"
  ],
  "1360": [
    "Maximum Length of a Concatenated String with Unique Characters",
    "Medium",
    "maximum-length-of-a-concatenated-string-with-unique-characters"
  ],
  "1361": [
    "Tiling a Rectangle with the Fewest Squares",
    "Hard",
    "tiling-a-rectangle-with-the-fewest-squares"
  ],
  "1377": [
    "Number of Comments per Post",
    "Easy",
    "number-of-comments-per-post"
  ],
  "1368": [
    "Web Crawler Multithreaded",
    "Medium",
    "web-crawler-multithreaded"
  ],
  "1175": [
    "Array Transformation",
    "Easy",
    "array-transformation"
  ],
  "1176": [
    "Design A Leaderboard",
    "Medium",
    "design-a-leaderboard"
  ],
  "1177": [
    "Tree Diameter",
    "Medium",
    "tree-diameter"
  ],
  "1202": [
    "Palindrome Removal",
    "Hard",
    "palindrome-removal"
  ],
  "1369": [
    "Minimum Swaps to Make Strings Equal",
    "Medium",
    "minimum-swaps-to-make-strings-equal"
  ],
  "1370": [
    "Count Number of Nice Subarrays",
    "Medium",
    "count-number-of-nice-subarrays"
  ],
  "1371": [
    "Minimum Remove to Make Valid Parentheses",
    "Medium",
    "minimum-remove-to-make-valid-parentheses"
  ],
  "1372": [
    "Check If It Is a Good Array",
    "Hard",
    "check-if-it-is-a-good-array"
  ],
  "1390": [
    "Average Selling Price",
    "Easy",
    "average-selling-price"
  ],
  "1378": [
    "Cells with Odd Values in a Matrix",
    "Easy",
    "cells-with-odd-values-in-a-matrix"
  ],
  "1379": [
    "Reconstruct a 2-Row Binary Matrix",
    "Medium",
    "reconstruct-a-2-row-binary-matrix"
  ],
  "1380": [
    "Number of Closed Islands",
    "Medium",
    "number-of-closed-islands"
  ],
  "1381": [
    "Maximum Score Words Formed by Letters",
    "Hard",
    "maximum-score-words-formed-by-letters"
  ],
  "1189": [
    "Encode Number",
    "Medium",
    "encode-number"
  ],
  "1190": [
    "Smallest Common Region",
    "Medium",
    "smallest-common-region"
  ],
  "1191": [
    "Synonymous Sentences",
    "Medium",
    "synonymous-sentences"
  ],
  "1213": [
    "Handshakes That Don't Cross",
    "Hard",
    "handshakes-that-dont-cross"
  ],
  "1386": [
    "Shift 2D Grid",
    "Easy",
    "shift-2d-grid"
  ],
  "1387": [
    "Find Elements in a Contaminated Binary Tree",
    "Medium",
    "find-elements-in-a-contaminated-binary-tree"
  ],
  "1388": [
    "Greatest Sum Divisible by Three",
    "Medium",
    "greatest-sum-divisible-by-three"
  ],
  "1389": [
    "Minimum Moves to Move a Box to Their Target Location",
    "Hard",
    "minimum-moves-to-move-a-box-to-their-target-location"
  ],
  "1399": [
    "Page Recommendations",
    "Medium",
    "page-recommendations"
  ],
  "1404": [
    "Print Immutable Linked List in Reverse",
    "Medium",
    "print-immutable-linked-list-in-reverse"
  ],
  "1395": [
    "Minimum Time Visiting All Points",
    "Easy",
    "minimum-time-visiting-all-points"
  ],
  "1396": [
    "Count Servers that Communicate",
    "Medium",
    "count-servers-that-communicate"
  ],
  "1397": [
    "Search Suggestions System",
    "Medium",
    "search-suggestions-system"
  ],
  "1398": [
    "Number of Ways to Stay in the Same Place After Some Steps",
    "Hard",
    "number-of-ways-to-stay-in-the-same-place-after-some-steps"
  ],
  "1405": [
    "All People Report to the Given Manager",
    "Medium",
    "all-people-report-to-the-given-manager"
  ],
  "1199": [
    "Hexspeak",
    "Easy",
    "hexspeak"
  ],
  "1200": [
    "Remove Interval",
    "Medium",
    "remove-interval"
  ],
  "1201": [
    "Delete Tree Nodes",
    "Medium",
    "delete-tree-nodes"
  ],
  "1233": [
    "Number of Ships in a Rectangle",
    "Hard",
    "number-of-ships-in-a-rectangle"
  ],
  "1400": [
    "Find Winner on a Tic Tac Toe Game",
    "Easy",
    "find-winner-on-a-tic-tac-toe-game"
  ],
  "1401": [
    "Number of Burgers with No Waste of Ingredients",
    "Medium",
    "number-of-burgers-with-no-waste-of-ingredients"
  ],
  "1402": [
    "Count Square Submatrices with All Ones",
    "Medium",
    "count-square-submatrices-with-all-ones"
  ],
  "1403": [
    "Palindrome Partitioning III",
    "Hard",
    "palindrome-partitioning-iii"
  ],
  "1410": [
    "Traffic Light Controlled Intersection",
    "Easy",
    "traffic-light-controlled-intersection"
  ],
  "1415": [
    "Students and Examinations",
    "Easy",
    "students-and-examinations"
  ],
  "1406": [
    "Subtract the Product and Sum of Digits of an Integer",
    "Easy",
    "subtract-the-product-and-sum-of-digits-of-an-integer"
  ],
  "1407": [
    "Group the People Given the Group Size They Belong To",
    "Medium",
    "group-the-people-given-the-group-size-they-belong-to"
  ],
  "1408": [
    "Find the Smallest Divisor Given a Threshold",
    "Medium",
    "find-the-smallest-divisor-given-a-threshold"
  ],
  "1409": [
    "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix",
    "Hard",
    "minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"
  ],
  "1420": [
    "Find the Start and End Number of Continuous Ranges",
    "Medium",
    "find-the-start-and-end-number-of-continuous-ranges"
  ],
  "1211": [
    "Iterator for Combination",
    "Medium",
    "iterator-for-combination"
  ],
  "1221": [
    "Element Appearing More Than 25% In Sorted Array",
    "Easy",
    "element-appearing-more-than-25-in-sorted-array"
  ],
  "1222": [
    "Remove Covered Intervals",
    "Medium",
    "remove-covered-intervals"
  ],
  "1224": [
    "Minimum Falling Path Sum II",
    "Hard",
    "minimum-falling-path-sum-ii"
  ],
  "1411": [
    "Convert Binary Number in a Linked List to Integer",
    "Easy",
    "convert-binary-number-in-a-linked-list-to-integer"
  ],
  "1212": [
    "Sequential Digits",
    "Medium",
    "sequential-digits"
  ],
  "1413": [
    "Maximum Side Length of a Square with Sum Less than or Equal to Threshold",
    "Medium",
    "maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"
  ],
  "1414": [
    "Shortest Path in a Grid with Obstacles Elimination",
    "Hard",
    "shortest-path-in-a-grid-with-obstacles-elimination"
  ],
  "1425": [
    "Weather Type in Each Country",
    "Easy",
    "weather-type-in-each-country"
  ],
  "1421": [
    "Find Numbers with Even Number of Digits",
    "Easy",
    "find-numbers-with-even-number-of-digits"
  ],
  "1422": [
    "Divide Array in Sets of K Consecutive Numbers",
    "Medium",
    "divide-array-in-sets-of-k-consecutive-numbers"
  ],
  "1423": [
    "Maximum Number of Occurrences of a Substring",
    "Medium",
    "maximum-number-of-occurrences-of-a-substring"
  ],
  "1424": [
    "Maximum Candies You Can Get from Boxes",
    "Hard",
    "maximum-candies-you-can-get-from-boxes"
  ],
  "1231": [
    "Replace Elements with Greatest Element on Right Side",
    "Easy",
    "replace-elements-with-greatest-element-on-right-side"
  ],
  "1232": [
    "Sum of Mutated Array Closest to Target",
    "Medium",
    "sum-of-mutated-array-closest-to-target"
  ],
  "1234": [
    "Number of Paths with Max Score",
    "Hard",
    "number-of-paths-with-max-score"
  ],
  "1254": [
    "Deepest Leaves Sum",
    "Medium",
    "deepest-leaves-sum"
  ],
  "1438": [
    "Find the Team Size",
    "Easy",
    "find-the-team-size"
  ],
  "1426": [
    "Find N Unique Integers Sum up to Zero",
    "Easy",
    "find-n-unique-integers-sum-up-to-zero"
  ],
  "1427": [
    "All Elements in Two Binary Search Trees",
    "Medium",
    "all-elements-in-two-binary-search-trees"
  ],
  "1428": [
    "Jump Game III",
    "Medium",
    "jump-game-iii"
  ],
  "1429": [
    "Verbal Arithmetic Puzzle",
    "Hard",
    "verbal-arithmetic-puzzle"
  ],
  "1439": [
    "Running Total for Different Genders",
    "Medium",
    "running-total-for-different-genders"
  ],
  "1434": [
    "Decrypt String from Alphabet to Integer Mapping",
    "Easy",
    "decrypt-string-from-alphabet-to-integer-mapping"
  ],
  "1435": [
    "XOR Queries of a Subarray",
    "Medium",
    "xor-queries-of-a-subarray"
  ],
  "1436": [
    "Get Watched Videos by Your Friends",
    "Medium",
    "get-watched-videos-by-your-friends"
  ],
  "1437": [
    "Minimum Insertion Steps to Make a String Palindrome",
    "Hard",
    "minimum-insertion-steps-to-make-a-string-palindrome"
  ],
  "1241": [
    "Decompress Run-Length Encoded List",
    "Easy",
    "decompress-run-length-encoded-list"
  ],
  "1242": [
    "Matrix Block Sum",
    "Medium",
    "matrix-block-sum"
  ],
  "1243": [
    "Sum of Nodes with Even-Valued Grandparent",
    "Medium",
    "sum-of-nodes-with-even-valued-grandparent"
  ],
  "1244": [
    "Distinct Echo Substrings",
    "Hard",
    "distinct-echo-substrings"
  ],
  "1440": [
    "Convert Integer to the Sum of Two No-Zero Integers",
    "Easy",
    "convert-integer-to-the-sum-of-two-no-zero-integers"
  ],
  "1441": [
    "Minimum Flips to Make a OR b Equal to c",
    "Medium",
    "minimum-flips-to-make-a-or-b-equal-to-c"
  ],
  "1442": [
    "Number of Operations to Make Network Connected",
    "Medium",
    "number-of-operations-to-make-network-connected"
  ],
  "1443": [
    "Minimum Distance to Type a Word Using Two Fingers",
    "Hard",
    "minimum-distance-to-type-a-word-using-two-fingers"
  ],
  "1452": [
    "Restaurant Growth",
    "Medium",
    "restaurant-growth"
  ],
  "1453": [
    "Ads Performance",
    "Easy",
    "ads-performance"
  ],
  "1448": [
    "Maximum 69 Number",
    "Easy",
    "maximum-69-number"
  ],
  "1449": [
    "Print Words Vertically",
    "Medium",
    "print-words-vertically"
  ],
  "1450": [
    "Delete Leaves With a Given Value",
    "Medium",
    "delete-leaves-with-a-given-value"
  ],
  "1451": [
    "Minimum Number of Taps to Open to Water a Garden",
    "Hard",
    "minimum-number-of-taps-to-open-to-water-a-garden"
  ],
  "1462": [
    "List the Products Ordered in a Period",
    "Easy",
    "list-the-products-ordered-in-a-period"
  ],
  "1252": [
    "Break a Palindrome",
    "Medium",
    "break-a-palindrome"
  ],
  "1253": [
    "Sort the Matrix Diagonally",
    "Medium",
    "sort-the-matrix-diagonally"
  ],
  "1255": [
    "Reverse Subarray To Maximize Array Value",
    "Hard",
    "reverse-subarray-to-maximize-array-value"
  ],
  "1256": [
    "Rank Transform of an Array",
    "Easy",
    "rank-transform-of-an-array"
  ],
  "1454": [
    "Remove Palindromic Subsequences",
    "Easy",
    "remove-palindromic-subsequences"
  ],
  "1455": [
    "Filter Restaurants by Vegan-Friendly, Price and Distance",
    "Medium",
    "filter-restaurants-by-vegan-friendly-price-and-distance"
  ],
  "1456": [
    "Find the City With the Smallest Number of Neighbors at a Threshold Distance",
    "Medium",
    "find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"
  ],
  "1457": [
    "Minimum Difficulty of a Job Schedule",
    "Hard",
    "minimum-difficulty-of-a-job-schedule"
  ],
  "1467": [
    "Number of Transactions per Visit",
    "Hard",
    "number-of-transactions-per-visit"
  ],
  "1463": [
    "The K Weakest Rows in a Matrix",
    "Easy",
    "the-k-weakest-rows-in-a-matrix"
  ],
  "1464": [
    "Reduce Array Size to The Half",
    "Medium",
    "reduce-array-size-to-the-half"
  ],
  "1465": [
    "Maximum Product of Splitted Binary Tree",
    "Medium",
    "maximum-product-of-splitted-binary-tree"
  ],
  "1466": [
    "Jump Game V",
    "Hard",
    "jump-game-v"
  ],
  "1480": [
    "Movie Rating",
    "Medium",
    "movie-rating"
  ],
  "1444": [
    "Number of Steps to Reduce a Number to Zero",
    "Easy",
    "number-of-steps-to-reduce-a-number-to-zero"
  ],
  "1445": [
    "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold",
    "Medium",
    "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"
  ],
  "1446": [
    "Angle Between Hands of a Clock",
    "Medium",
    "angle-between-hands-of-a-clock"
  ],
  "1447": [
    "Jump Game IV",
    "Hard",
    "jump-game-iv"
  ],
  "1468": [
    "Check If N and Its Double Exist",
    "Easy",
    "check-if-n-and-its-double-exist"
  ],
  "1469": [
    "Minimum Number of Steps to Make Two Strings Anagram",
    "Medium",
    "minimum-number-of-steps-to-make-two-strings-anagram"
  ],
  "1470": [
    "Tweet Counts Per Frequency",
    "Medium",
    "tweet-counts-per-frequency"
  ],
  "1471": [
    "Maximum Students Taking Exam",
    "Hard",
    "maximum-students-taking-exam"
  ],
  "1481": [
    "Students With Invalid Departments",
    "Easy",
    "students-with-invalid-departments"
  ],
  "1476": [
    "Count Negative Numbers in a Sorted Matrix",
    "Easy",
    "count-negative-numbers-in-a-sorted-matrix"
  ],
  "1477": [
    "Product of the Last K Numbers",
    "Medium",
    "product-of-the-last-k-numbers"
  ],
  "1478": [
    "Maximum Number of Events That Can Be Attended",
    "Medium",
    "maximum-number-of-events-that-can-be-attended"
  ],
  "1479": [
    "Construct Target Array With Multiple Sums",
    "Hard",
    "construct-target-array-with-multiple-sums"
  ],
  "1494": [
    "Activity Participants",
    "Medium",
    "activity-participants"
  ],
  "1458": [
    "Sort Integers by The Number of 1 Bits",
    "Easy",
    "sort-integers-by-the-number-of-1-bits"
  ],
  "1459": [
    "Apply Discount Every n Orders",
    "Medium",
    "apply-discount-every-n-orders"
  ],
  "1460": [
    "Number of Substrings Containing All Three Characters",
    "Medium",
    "number-of-substrings-containing-all-three-characters"
  ],
  "1461": [
    "Count All Valid Pickup and Delivery Options",
    "Hard",
    "count-all-valid-pickup-and-delivery-options"
  ],
  "1274": [
    "Number of Days Between Two Dates",
    "Easy",
    "number-of-days-between-two-dates"
  ],
  "1275": [
    "Validate Binary Tree Nodes",
    "Medium",
    "validate-binary-tree-nodes"
  ],
  "1276": [
    "Closest Divisors",
    "Medium",
    "closest-divisors"
  ],
  "1277": [
    "Largest Multiple of Three",
    "Hard",
    "largest-multiple-of-three"
  ],
  "1495": [
    "Number of Trusted Contacts of a Customer",
    "Medium",
    "number-of-trusted-contacts-of-a-customer"
  ],
  "1482": [
    "How Many Numbers Are Smaller Than the Current Number",
    "Easy",
    "how-many-numbers-are-smaller-than-the-current-number"
  ],
  "1483": [
    "Rank Teams by Votes",
    "Medium",
    "rank-teams-by-votes"
  ],
  "1484": [
    "Linked List in Binary Tree",
    "Medium",
    "linked-list-in-binary-tree"
  ],
  "1485": [
    "Minimum Cost to Make at Least One Valid Path in a Grid",
    "Hard",
    "minimum-cost-to-make-at-least-one-valid-path-in-a-grid"
  ],
  "1504": [
    "Get the Second Most Recent Activity",
    "Hard",
    "get-the-second-most-recent-activity"
  ],
  "1472": [
    "Increasing Decreasing String",
    "Easy",
    "increasing-decreasing-string"
  ],
  "1473": [
    "Find the Longest Substring Containing Vowels in Even Counts",
    "Medium",
    "find-the-longest-substring-containing-vowels-in-even-counts"
  ],
  "1474": [
    "Longest ZigZag Path in a Binary Tree",
    "Medium",
    "longest-zigzag-path-in-a-binary-tree"
  ],
  "1475": [
    "Maximum Sum BST in Binary Tree",
    "Hard",
    "maximum-sum-bst-in-binary-tree"
  ],
  "1490": [
    "Generate a String With Characters That Have Odd Counts",
    "Easy",
    "generate-a-string-with-characters-that-have-odd-counts"
  ],
  "1491": [
    "Number of Times Binary String Is Prefix-Aligned",
    "Medium",
    "number-of-times-binary-string-is-prefix-aligned"
  ],
  "1492": [
    "Time Needed to Inform All Employees",
    "Medium",
    "time-needed-to-inform-all-employees"
  ],
  "1493": [
    "Frog Position After T Seconds",
    "Hard",
    "frog-position-after-t-seconds"
  ],
  "1509": [
    "Replace Employee ID With The Unique Identifier",
    "Easy",
    "replace-employee-id-with-the-unique-identifier"
  ],
  "1498": [
    "Find a Corresponding Node of a Binary Tree in a Clone of That Tree",
    "Easy",
    "find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"
  ],
  "1496": [
    "Lucky Numbers in a Matrix",
    "Easy",
    "lucky-numbers-in-a-matrix"
  ],
  "1497": [
    "Design a Stack With Increment Operation",
    "Medium",
    "design-a-stack-with-increment-operation"
  ],
  "1285": [
    "Balance a Binary Search Tree",
    "Medium",
    "balance-a-binary-search-tree"
  ],
  "1499": [
    "Maximum Performance of a Team",
    "Hard",
    "maximum-performance-of-a-team"
  ],
  "1518": [
    "Total Sales Amount by Year",
    "Hard",
    "total-sales-amount-by-year"
  ],
  "1486": [
    "Find the Distance Value Between Two Arrays",
    "Easy",
    "find-the-distance-value-between-two-arrays"
  ],
  "1487": [
    "Cinema Seat Allocation",
    "Medium",
    "cinema-seat-allocation"
  ],
  "1488": [
    "Sort Integers by The Power Value",
    "Medium",
    "sort-integers-by-the-power-value"
  ],
  "1489": [
    "Pizza With 3n Slices",
    "Hard",
    "pizza-with-3n-slices"
  ],
  "1505": [
    "Create Target Array in the Given Order",
    "Easy",
    "create-target-array-in-the-given-order"
  ],
  "1284": [
    "Four Divisors",
    "Medium",
    "four-divisors"
  ],
  "1507": [
    "Check if There is a Valid Path in a Grid",
    "Medium",
    "check-if-there-is-a-valid-path-in-a-grid"
  ],
  "1508": [
    "Longest Happy Prefix",
    "Hard",
    "longest-happy-prefix"
  ],
  "1523": [
    "Capital Gain/Loss",
    "Medium",
    "capital-gainloss"
  ],
  "1510": [
    "Find Lucky Integer in an Array",
    "Easy",
    "find-lucky-integer-in-an-array"
  ],
  "1511": [
    "Count Number of Teams",
    "Medium",
    "count-number-of-teams"
  ],
  "1512": [
    "Design Underground System",
    "Medium",
    "design-underground-system"
  ],
  "1513": [
    "Find All Good Strings",
    "Hard",
    "find-all-good-strings"
  ],
  "1536": [
    "Customers Who Bought Products A and B but Not C",
    "Medium",
    "customers-who-bought-products-a-and-b-but-not-c"
  ],
  "1500": [
    "Count Largest Group",
    "Easy",
    "count-largest-group"
  ],
  "1502": [
    "Construct K Palindrome Strings",
    "Medium",
    "construct-k-palindrome-strings"
  ],
  "1501": [
    "Circle and Rectangle Overlapping",
    "Medium",
    "circle-and-rectangle-overlapping"
  ],
  "1503": [
    "Reducing Dishes",
    "Hard",
    "reducing-dishes"
  ],
  "1519": [
    "Minimum Subsequence in Non-Increasing Order",
    "Easy",
    "minimum-subsequence-in-non-increasing-order"
  ],
  "1520": [
    "Number of Steps to Reduce a Number in Binary Representation to One",
    "Medium",
    "number-of-steps-to-reduce-a-number-in-binary-representation-to-one"
  ],
  "1304": [
    "Longest Happy String",
    "Medium",
    "longest-happy-string"
  ],
  "1522": [
    "Stone Game III",
    "Hard",
    "stone-game-iii"
  ],
  "1541": [
    "Top Travellers",
    "Easy",
    "top-travellers"
  ],
  "1524": [
    "String Matching in an Array",
    "Easy",
    "string-matching-in-an-array"
  ],
  "1525": [
    "Queries on a Permutation With Key",
    "Medium",
    "queries-on-a-permutation-with-key"
  ],
  "1526": [
    "HTML Entity Parser",
    "Medium",
    "html-entity-parser"
  ],
  "1527": [
    "Number of Ways to Paint N \u00d7 3 Grid",
    "Hard",
    "number-of-ways-to-paint-n-3-grid"
  ],
  "1546": [
    "Find the Quiet Students in All Exams",
    "Hard",
    "find-the-quiet-students-in-all-exams"
  ],
  "1514": [
    "Minimum Value to Get Positive Step by Step Sum",
    "Easy",
    "minimum-value-to-get-positive-step-by-step-sum"
  ],
  "1515": [
    "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K",
    "Medium",
    "find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"
  ],
  "1516": [
    "The k-th Lexicographical String of All Happy Strings of Length n",
    "Medium",
    "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"
  ],
  "1517": [
    "Restore The Array",
    "Hard",
    "restore-the-array"
  ],
  "1532": [
    "Reformat The String",
    "Easy",
    "reformat-the-string"
  ],
  "1533": [
    "Display Table of Food Orders in a Restaurant",
    "Medium",
    "display-table-of-food-orders-in-a-restaurant"
  ],
  "1534": [
    "Minimum Number of Frogs Croaking",
    "Medium",
    "minimum-number-of-frogs-croaking"
  ],
  "1535": [
    "Build Array Where You Can Find The Maximum Exactly K Comparisons",
    "Hard",
    "build-array-where-you-can-find-the-maximum-exactly-k-comparisons"
  ],
  "1551": [
    "NPV Queries",
    "Easy",
    "npv-queries"
  ],
  "1537": [
    "Maximum Score After Splitting a String",
    "Easy",
    "maximum-score-after-splitting-a-string"
  ],
  "1538": [
    "Maximum Points You Can Obtain from Cards",
    "Medium",
    "maximum-points-you-can-obtain-from-cards"
  ],
  "1539": [
    "Diagonal Traverse II",
    "Medium",
    "diagonal-traverse-ii"
  ],
  "1286": [
    "Constrained Subsequence Sum",
    "Hard",
    "constrained-subsequence-sum"
  ],
  "1391": [
    "Counting Elements",
    "Easy",
    "counting-elements"
  ],
  "1345": [
    "Perform String Shifts",
    "Easy",
    "perform-string-shifts"
  ],
  "1374": [
    "Leftmost Column with at Least a One",
    "Medium",
    "leftmost-column-with-at-least-a-one"
  ],
  "1366": [
    "First Unique Number",
    "Medium",
    "first-unique-number"
  ],
  "1432": [
    "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree",
    "Medium",
    "check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"
  ],
  "1528": [
    "Kids With the Greatest Number of Candies",
    "Easy",
    "kids-with-the-greatest-number-of-candies"
  ],
  "1529": [
    "Max Difference You Can Get From Changing an Integer",
    "Medium",
    "max-difference-you-can-get-from-changing-an-integer"
  ],
  "1530": [
    "Check If a String Can Break Another String",
    "Medium",
    "check-if-a-string-can-break-another-string"
  ],
  "1531": [
    "Number of Ways to Wear Different Hats to Each Other",
    "Hard",
    "number-of-ways-to-wear-different-hats-to-each-other"
  ],
  "1564": [
    "Create a Session Bar Chart",
    "Easy",
    "create-a-session-bar-chart"
  ],
  "1547": [
    "Destination City",
    "Easy",
    "destination-city"
  ],
  "1548": [
    "Check If All 1's Are at Least Length K Places Away",
    "Easy",
    "check-if-all-1s-are-at-least-length-k-places-away"
  ],
  "1549": [
    "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit",
    "Medium",
    "longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"
  ],
  "1550": [
    "Find the Kth Smallest Sum of a Matrix With Sorted Rows",
    "Hard",
    "find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"
  ],
  "1565": [
    "Evaluate Boolean Expression",
    "Medium",
    "evaluate-boolean-expression"
  ],
  "1552": [
    "Build an Array With Stack Operations",
    "Medium",
    "build-an-array-with-stack-operations"
  ],
  "1553": [
    "Count Triplets That Can Form Two Arrays of Equal XOR",
    "Medium",
    "count-triplets-that-can-form-two-arrays-of-equal-xor"
  ],
  "1554": [
    "Minimum Time to Collect All Apples in a Tree",
    "Medium",
    "minimum-time-to-collect-all-apples-in-a-tree"
  ],
  "1555": [
    "Number of Ways of Cutting a Pizza",
    "Hard",
    "number-of-ways-of-cutting-a-pizza"
  ],
  "1578": [
    "Apples & Oranges",
    "Medium",
    "apples-oranges"
  ],
  "1542": [
    "Consecutive Characters",
    "Easy",
    "consecutive-characters"
  ],
  "1543": [
    "Simplified Fractions",
    "Medium",
    "simplified-fractions"
  ],
  "1544": [
    "Count Good Nodes in Binary Tree",
    "Medium",
    "count-good-nodes-in-binary-tree"
  ],
  "1545": [
    "Form Largest Integer With Digits That Add up to Target",
    "Hard",
    "form-largest-integer-with-digits-that-add-up-to-target"
  ],
  "1560": [
    "Number of Students Doing Homework at a Given Time",
    "Easy",
    "number-of-students-doing-homework-at-a-given-time"
  ],
  "1561": [
    "Rearrange Words in a Sentence",
    "Medium",
    "rearrange-words-in-a-sentence"
  ],
  "1562": [
    "People Whose List of Favorite Companies Is Not a Subset of Another List",
    "Medium",
    "people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"
  ],
  "1563": [
    "Maximum Number of Darts Inside of a Circular Dartboard",
    "Hard",
    "maximum-number-of-darts-inside-of-a-circular-dartboard"
  ],
  "1579": [
    "Active Users",
    "Medium",
    "active-users"
  ],
  "1566": [
    "Check If a Word Occurs As a Prefix of Any Word in a Sentence",
    "Easy",
    "check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"
  ],
  "1567": [
    "Maximum Number of Vowels in a Substring of Given Length",
    "Medium",
    "maximum-number-of-vowels-in-a-substring-of-given-length"
  ],
  "1568": [
    "Pseudo-Palindromic Paths in a Binary Tree",
    "Medium",
    "pseudo-palindromic-paths-in-a-binary-tree"
  ],
  "1569": [
    "Max Dot Product of Two Subsequences",
    "Hard",
    "max-dot-product-of-two-subsequences"
  ],
  "1607": [
    "Rectangles Area",
    "Medium",
    "rectangles-area"
  ],
  "1556": [
    "Make Two Arrays Equal by Reversing Subarrays",
    "Easy",
    "make-two-arrays-equal-by-reversing-subarrays"
  ],
  "1557": [
    "Check If a String Contains All Binary Codes of Size K",
    "Medium",
    "check-if-a-string-contains-all-binary-codes-of-size-k"
  ],
  "1558": [
    "Course Schedule IV",
    "Medium",
    "course-schedule-iv"
  ],
  "1559": [
    "Cherry Pickup II",
    "Hard",
    "cherry-pickup-ii"
  ],
  "1574": [
    "Maximum Product of Two Elements in an Array",
    "Easy",
    "maximum-product-of-two-elements-in-an-array"
  ],
  "1575": [
    "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts",
    "Medium",
    "maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"
  ],
  "1576": [
    "Reorder Routes to Make All Paths Lead to the City Zero",
    "Medium",
    "reorder-routes-to-make-all-paths-lead-to-the-city-zero"
  ],
  "1577": [
    "Probability of a Two Boxes Having The Same Number of Distinct Balls",
    "Hard",
    "probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"
  ],
  "1608": [
    "Calculate Salaries",
    "Medium",
    "calculate-salaries"
  ],
  "1609": [
    "Find All The Lonely Nodes",
    "Easy",
    "find-all-the-lonely-nodes"
  ],
  "1580": [
    "Shuffle the Array",
    "Easy",
    "shuffle-the-array"
  ],
  "1581": [
    "The k Strongest Values in an Array",
    "Medium",
    "the-k-strongest-values-in-an-array"
  ],
  "1582": [
    "Design Browser History",
    "Medium",
    "design-browser-history"
  ],
  "1583": [
    "Paint House III",
    "Hard",
    "paint-house-iii"
  ],
  "1618": [
    "Delete N Nodes After M Nodes of a Linked List",
    "Easy",
    "delete-n-nodes-after-m-nodes-of-a-linked-list"
  ],
  "1570": [
    "Final Prices With a Special Discount in a Shop",
    "Easy",
    "final-prices-with-a-special-discount-in-a-shop"
  ],
  "1572": [
    "Subrectangle Queries",
    "Medium",
    "subrectangle-queries"
  ],
  "1573": [
    "Find Two Non-overlapping Sub-arrays Each With Target Sum",
    "Medium",
    "find-two-non-overlapping-sub-arrays-each-with-target-sum"
  ],
  "1571": [
    "Allocate Mailboxes",
    "Hard",
    "allocate-mailboxes"
  ],
  "1623": [
    "Sales by Day of the Week",
    "Hard",
    "sales-by-day-of-the-week"
  ],
  "1603": [
    "Running Sum of 1d Array",
    "Easy",
    "running-sum-of-1d-array"
  ],
  "1604": [
    "Least Number of Unique Integers after K Removals",
    "Medium",
    "least-number-of-unique-integers-after-k-removals"
  ],
  "1605": [
    "Minimum Number of Days to Make m Bouquets",
    "Medium",
    "minimum-number-of-days-to-make-m-bouquets"
  ],
  "1296": [
    "Kth Ancestor of a Tree Node",
    "Hard",
    "kth-ancestor-of-a-tree-node"
  ],
  "1625": [
    "Group Sold Products By The Date",
    "Easy",
    "group-sold-products-by-the-date"
  ],
  "1624": [
    "Clone Binary Tree With Random Pointer",
    "Medium",
    "clone-binary-tree-with-random-pointer"
  ],
  "1610": [
    "XOR Operation in an Array",
    "Easy",
    "xor-operation-in-an-array"
  ],
  "1611": [
    "Making File Names Unique",
    "Medium",
    "making-file-names-unique"
  ],
  "1612": [
    "Avoid Flood in The City",
    "Medium",
    "avoid-flood-in-the-city"
  ],
  "1613": [
    "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree",
    "Hard",
    "find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"
  ],
  "1634": [
    "Clone N-ary Tree",
    "Medium",
    "clone-n-ary-tree"
  ],
  "1584": [
    "Average Salary Excluding the Minimum and Maximum Salary",
    "Easy",
    "average-salary-excluding-the-minimum-and-maximum-salary"
  ],
  "1585": [
    "The kth Factor of n",
    "Medium",
    "the-kth-factor-of-n"
  ],
  "1586": [
    "Longest Subarray of 1's After Deleting One Element",
    "Medium",
    "longest-subarray-of-1s-after-deleting-one-element"
  ],
  "1587": [
    "Parallel Courses II",
    "Hard",
    "parallel-courses-ii"
  ],
  "1639": [
    "Friendly Movies Streamed Last Month",
    "Easy",
    "friendly-movies-streamed-last-month"
  ],
  "1619": [
    "Path Crossing",
    "Easy",
    "path-crossing"
  ],
  "1620": [
    "Check If Array Pairs Are Divisible by k",
    "Medium",
    "check-if-array-pairs-are-divisible-by-k"
  ],
  "1621": [
    "Number of Subsequences That Satisfy the Given Sum Condition",
    "Medium",
    "number-of-subsequences-that-satisfy-the-given-sum-condition"
  ],
  "1622": [
    "Max Value of Equation",
    "Hard",
    "max-value-of-equation"
  ],
  "1640": [
    "Design a File Sharing System",
    "Medium",
    "design-a-file-sharing-system"
  ],
  "1641": [
    "Countries You Can Safely Invest In",
    "Medium",
    "countries-you-can-safely-invest-in"
  ],
  "1626": [
    "Can Make Arithmetic Progression From Sequence",
    "Easy",
    "can-make-arithmetic-progression-from-sequence"
  ],
  "1627": [
    "Last Moment Before All Ants Fall Out of a Plank",
    "Medium",
    "last-moment-before-all-ants-fall-out-of-a-plank"
  ],
  "1628": [
    "Count Submatrices With All Ones",
    "Medium",
    "count-submatrices-with-all-ones"
  ],
  "1629": [
    "Minimum Possible Integer After at Most K Adjacent Swaps On Digits",
    "Hard",
    "minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"
  ],
  "1650": [
    "Find Root of N-Ary Tree",
    "Medium",
    "find-root-of-n-ary-tree"
  ],
  "1283": [
    "Reformat Date",
    "Easy",
    "reformat-date"
  ],
  "1615": [
    "Range Sum of Sorted Subarray Sums",
    "Medium",
    "range-sum-of-sorted-subarray-sums"
  ],
  "1616": [
    "Minimum Difference Between Largest and Smallest Value in Three Moves",
    "Medium",
    "minimum-difference-between-largest-and-smallest-value-in-three-moves"
  ],
  "1617": [
    "Stone Game IV",
    "Hard",
    "stone-game-iv"
  ],
  "1654": [
    "Customer Order Frequency",
    "Easy",
    "customer-order-frequency"
  ],
  "1635": [
    "Number of Good Pairs",
    "Easy",
    "number-of-good-pairs"
  ],
  "1636": [
    "Number of Substrings With Only 1s",
    "Medium",
    "number-of-substrings-with-only-1s"
  ],
  "1325": [
    "Path with Maximum Probability",
    "Medium",
    "path-with-maximum-probability"
  ],
  "1638": [
    "Best Position for a Service Centre",
    "Hard",
    "best-position-for-a-service-centre"
  ],
  "1655": [
    "Move Sub-Tree of N-Ary Tree",
    "Hard",
    "move-sub-tree-of-n-ary-tree"
  ],
  "1664": [
    "Find Users With Valid E-Mails",
    "Easy",
    "find-users-with-valid-e-mails"
  ],
  "1642": [
    "Water Bottles",
    "Easy",
    "water-bottles"
  ],
  "1643": [
    "Number of Nodes in the Sub-Tree With the Same Label",
    "Medium",
    "number-of-nodes-in-the-sub-tree-with-the-same-label"
  ],
  "1644": [
    "Maximum Number of Non-Overlapping Substrings",
    "Hard",
    "maximum-number-of-non-overlapping-substrings"
  ],
  "1645": [
    "Find a Value of a Mysterious Function Closest to Target",
    "Hard",
    "find-a-value-of-a-mysterious-function-closest-to-target"
  ],
  "1665": [
    "Diameter of N-Ary Tree",
    "Medium",
    "diameter-of-n-ary-tree"
  ],
  "1630": [
    "Count Odd Numbers in an Interval Range",
    "Easy",
    "count-odd-numbers-in-an-interval-range"
  ],
  "1631": [
    "Number of Sub-arrays With Odd Sum",
    "Medium",
    "number-of-sub-arrays-with-odd-sum"
  ],
  "1632": [
    "Number of Good Ways to Split a String",
    "Medium",
    "number-of-good-ways-to-split-a-string"
  ],
  "1633": [
    "Minimum Number of Increments on Subarrays to Form a Target Array",
    "Hard",
    "minimum-number-of-increments-on-subarrays-to-form-a-target-array"
  ],
  "1670": [
    "Patients With a Condition",
    "Easy",
    "patients-with-a-condition"
  ],
  "1651": [
    "Shuffle String",
    "Easy",
    "shuffle-string"
  ],
  "1652": [
    "Minimum Suffix Flips",
    "Medium",
    "minimum-suffix-flips"
  ],
  "1653": [
    "Number of Good Leaf Nodes Pairs",
    "Medium",
    "number-of-good-leaf-nodes-pairs"
  ],
  "1637": [
    "String Compression II",
    "Hard",
    "string-compression-ii"
  ],
  "1671": [
    "The Most Recent Three Orders",
    "Medium",
    "the-most-recent-three-orders"
  ],
  "1672": [
    "Find the Index of the Large Integer",
    "Medium",
    "find-the-index-of-the-large-integer"
  ],
  "1656": [
    "Count Good Triplets",
    "Easy",
    "count-good-triplets"
  ],
  "1657": [
    "Find the Winner of an Array Game",
    "Medium",
    "find-the-winner-of-an-array-game"
  ],
  "1658": [
    "Minimum Swaps to Arrange a Binary Grid",
    "Medium",
    "minimum-swaps-to-arrange-a-binary-grid"
  ],
  "1659": [
    "Get the Maximum Score",
    "Hard",
    "get-the-maximum-score"
  ],
  "1681": [
    "Guess the Majority in a Hidden Array",
    "Medium",
    "guess-the-majority-in-a-hidden-array"
  ],
  "1646": [
    "Kth Missing Positive Number",
    "Easy",
    "kth-missing-positive-number"
  ],
  "1647": [
    "Can Convert String in K Moves",
    "Medium",
    "can-convert-string-in-k-moves"
  ],
  "1648": [
    "Minimum Insertions to Balance a Parentheses String",
    "Medium",
    "minimum-insertions-to-balance-a-parentheses-string"
  ],
  "1668": [
    "Find Longest Awesome Substring",
    "Hard",
    "find-longest-awesome-substring"
  ],
  "1686": [
    "Fix Product Name Format",
    "Easy",
    "fix-product-name-format"
  ],
  "1666": [
    "Make The String Great",
    "Easy",
    "make-the-string-great"
  ],
  "1667": [
    "Find Kth Bit in Nth Binary String",
    "Medium",
    "find-kth-bit-in-nth-binary-string"
  ],
  "1649": [
    "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target",
    "Medium",
    "maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"
  ],
  "1669": [
    "Minimum Cost to Cut a Stick",
    "Hard",
    "minimum-cost-to-cut-a-stick"
  ],
  "1687": [
    "The Most Similar Path in a Graph",
    "Hard",
    "the-most-similar-path-in-a-graph"
  ],
  "1688": [
    "The Most Recent Orders for Each Product",
    "Medium",
    "the-most-recent-orders-for-each-product"
  ],
  "1293": [
    "Three Consecutive Odds",
    "Easy",
    "three-consecutive-odds"
  ],
  "1674": [
    "Minimum Operations to Make Array Equal",
    "Medium",
    "minimum-operations-to-make-array-equal"
  ],
  "1675": [
    "Magnetic Force Between Two Balls",
    "Medium",
    "magnetic-force-between-two-balls"
  ],
  "1676": [
    "Minimum Number of Days to Eat N Oranges",
    "Hard",
    "minimum-number-of-days-to-eat-n-oranges"
  ],
  "1697": [
    "Strings Differ by One Character",
    "Medium",
    "strings-differ-by-one-character"
  ],
  "1702": [
    "Bank Account Summary",
    "Medium",
    "bank-account-summary"
  ],
  "1660": [
    "Thousand Separator",
    "Easy",
    "thousand-separator"
  ],
  "1661": [
    "Minimum Number of Vertices to Reach All Nodes",
    "Medium",
    "minimum-number-of-vertices-to-reach-all-nodes"
  ],
  "1662": [
    "Minimum Numbers of Function Calls to Make Target Array",
    "Medium",
    "minimum-numbers-of-function-calls-to-make-target-array"
  ],
  "1663": [
    "Detect Cycles in 2D Grid",
    "Medium",
    "detect-cycles-in-2d-grid"
  ],
  "1682": [
    "Most Visited Sector in  a Circular Track",
    "Easy",
    "most-visited-sector-in-a-circular-track"
  ],
  "1683": [
    "Maximum Number of Coins You Can Get",
    "Medium",
    "maximum-number-of-coins-you-can-get"
  ],
  "1684": [
    "Find Latest Group of Size M",
    "Medium",
    "find-latest-group-of-size-m"
  ],
  "1685": [
    "Stone Game V",
    "Hard",
    "stone-game-v"
  ],
  "1703": [
    "Put Boxes Into the Warehouse I",
    "Medium",
    "put-boxes-into-the-warehouse-i"
  ],
  "1712": [
    "Unique Orders and Customers Per Month",
    "Easy",
    "unique-orders-and-customers-per-month"
  ],
  "1689": [
    "Detect Pattern of Length M Repeated K or More Times",
    "Easy",
    "detect-pattern-of-length-m-repeated-k-or-more-times"
  ],
  "1690": [
    "Maximum Length of Subarray With Positive Product",
    "Medium",
    "maximum-length-of-subarray-with-positive-product"
  ],
  "1691": [
    "Minimum Number of Days to Disconnect Island",
    "Hard",
    "minimum-number-of-days-to-disconnect-island"
  ],
  "1692": [
    "Number of Ways to Reorder Array to Get Same BST",
    "Hard",
    "number-of-ways-to-reorder-array-to-get-same-bst"
  ],
  "1713": [
    "Dot Product of Two Sparse Vectors",
    "Medium",
    "dot-product-of-two-sparse-vectors"
  ],
  "1718": [
    "Warehouse Manager",
    "Easy",
    "warehouse-manager"
  ],
  "1677": [
    "Matrix Diagonal Sum",
    "Easy",
    "matrix-diagonal-sum"
  ],
  "1678": [
    "Number of Ways to Split a String",
    "Medium",
    "number-of-ways-to-split-a-string"
  ],
  "1679": [
    "Shortest Subarray to be Removed to Make Array Sorted",
    "Medium",
    "shortest-subarray-to-be-removed-to-make-array-sorted"
  ],
  "1680": [
    "Count All Possible Routes",
    "Hard",
    "count-all-possible-routes"
  ],
  "1698": [
    "Replace All ?'s to Avoid Consecutive Repeating Characters",
    "Easy",
    "replace-all-s-to-avoid-consecutive-repeating-characters"
  ],
  "1699": [
    "Number of Ways Where Square of Number Is Equal to Product of Two Numbers",
    "Medium",
    "number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"
  ],
  "1700": [
    "Minimum Time to Make Rope Colorful",
    "Medium",
    "minimum-time-to-make-rope-colorful"
  ],
  "1701": [
    "Remove Max Number of Edges to Keep Graph Fully Traversable",
    "Hard",
    "remove-max-number-of-edges-to-keep-graph-fully-traversable"
  ],
  "1719": [
    "Put Boxes Into the Warehouse II",
    "Medium",
    "put-boxes-into-the-warehouse-ii"
  ],
  "1724": [
    "Customer Who Visited but Did Not Make Any Transactions",
    "Easy",
    "customer-who-visited-but-did-not-make-any-transactions"
  ],
  "1704": [
    "Special Positions in a Binary Matrix",
    "Easy",
    "special-positions-in-a-binary-matrix"
  ],
  "1705": [
    "Count Unhappy Friends",
    "Medium",
    "count-unhappy-friends"
  ],
  "1706": [
    "Min Cost to Connect All Points",
    "Medium",
    "min-cost-to-connect-all-points"
  ],
  "1707": [
    "Check If String Is Transformable With Substring Sort Operations",
    "Hard",
    "check-if-string-is-transformable-with-substring-sort-operations"
  ],
  "1729": [
    "Binary Search Tree Iterator II",
    "Medium",
    "binary-search-tree-iterator-ii"
  ],
  "1734": [
    "Bank Account Summary II",
    "Easy",
    "bank-account-summary-ii"
  ],
  "1693": [
    "Sum of All Odd Length Subarrays",
    "Easy",
    "sum-of-all-odd-length-subarrays"
  ],
  "1695": [
    "Maximum Sum Obtained of Any Permutation",
    "Medium",
    "maximum-sum-obtained-of-any-permutation"
  ],
  "1694": [
    "Make Sum Divisible by P",
    "Medium",
    "make-sum-divisible-by-p"
  ],
  "1696": [
    "Strange Printer II",
    "Hard",
    "strange-printer-ii"
  ],
  "1714": [
    "Rearrange Spaces Between Words",
    "Easy",
    "rearrange-spaces-between-words"
  ],
  "1715": [
    "Split a String Into the Max Number of Unique Substrings",
    "Medium",
    "split-a-string-into-the-max-number-of-unique-substrings"
  ],
  "1716": [
    "Maximum Non Negative Product in a Matrix",
    "Medium",
    "maximum-non-negative-product-in-a-matrix"
  ],
  "1717": [
    "Minimum Cost to Connect Two Groups of Points",
    "Hard",
    "minimum-cost-to-connect-two-groups-of-points"
  ],
  "1735": [
    "The Most Frequently Ordered Products for Each Customer",
    "Medium",
    "the-most-frequently-ordered-products-for-each-customer"
  ],
  "1736": [
    "Build Binary Expression Tree From Infix Expression",
    "Hard",
    "build-binary-expression-tree-from-infix-expression"
  ],
  "1720": [
    "Crawler Log Folder",
    "Easy",
    "crawler-log-folder"
  ],
  "1721": [
    "Maximum Profit of Operating a Centennial Wheel",
    "Medium",
    "maximum-profit-of-operating-a-centennial-wheel"
  ],
  "1722": [
    "Throne Inheritance",
    "Medium",
    "throne-inheritance"
  ],
  "1723": [
    "Maximum Number of Achievable Transfer Requests",
    "Hard",
    "maximum-number-of-achievable-transfer-requests"
  ],
  "1745": [
    "Find Nearest Right Node in Binary Tree",
    "Medium",
    "find-nearest-right-node-in-binary-tree"
  ],
  "1708": [
    "Design Parking System",
    "Easy",
    "design-parking-system"
  ],
  "1709": [
    "Alert Using Same Key-Card Three or More Times in a One Hour Period",
    "Medium",
    "alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"
  ],
  "1711": [
    "Find Valid Matrix Given Row and Column Sums",
    "Medium",
    "find-valid-matrix-given-row-and-column-sums"
  ],
  "1710": [
    "Find Servers That Handled Most Number of Requests",
    "Hard",
    "find-servers-that-handled-most-number-of-requests"
  ],
  "1749": [
    "Sellers With No Sales",
    "Easy",
    "sellers-with-no-sales"
  ],
  "1730": [
    "Special Array With X Elements Greater Than or Equal X",
    "Easy",
    "special-array-with-x-elements-greater-than-or-equal-x"
  ],
  "1731": [
    "Even Odd Tree",
    "Medium",
    "even-odd-tree"
  ],
  "1733": [
    "Maximum Number of Visible Points",
    "Hard",
    "maximum-number-of-visible-points"
  ],
  "1732": [
    "Minimum One Bit Operations to Make Integers Zero",
    "Hard",
    "minimum-one-bit-operations-to-make-integers-zero"
  ],
  "1750": [
    "Check If Two Expression Trees are Equivalent",
    "Medium",
    "check-if-two-expression-trees-are-equivalent"
  ],
  "1759": [
    "Find the Missing IDs",
    "Medium",
    "find-the-missing-ids"
  ],
  "1737": [
    "Maximum Nesting Depth of the Parentheses",
    "Easy",
    "maximum-nesting-depth-of-the-parentheses"
  ],
  "1738": [
    "Maximal Network Rank",
    "Medium",
    "maximal-network-rank"
  ],
  "1739": [
    "Split Two Strings to Make Palindrome",
    "Medium",
    "split-two-strings-to-make-palindrome"
  ],
  "1740": [
    "Count Subtrees With Max Distance Between Cities",
    "Hard",
    "count-subtrees-with-max-distance-between-cities"
  ],
  "1384": [
    "Maximum Font to Fit a Sentence in a Screen",
    "Medium",
    "maximum-font-to-fit-a-sentence-in-a-screen"
  ],
  "1210": [
    "Mean of Array After Removing Some Elements",
    "Easy",
    "mean-of-array-after-removing-some-elements"
  ],
  "1726": [
    "Coordinate With Maximum Network Quality",
    "Medium",
    "coordinate-with-maximum-network-quality"
  ],
  "1725": [
    "Number of Sets of K Non-Overlapping Line Segments",
    "Medium",
    "number-of-sets-of-k-non-overlapping-line-segments"
  ],
  "1728": [
    "Fancy Sequence",
    "Hard",
    "fancy-sequence"
  ],
  "1763": [
    "All Valid Triplets That Can Represent a Country",
    "Easy",
    "all-valid-triplets-that-can-represent-a-country"
  ],
  "1746": [
    "Largest Substring Between Two Equal Characters",
    "Easy",
    "largest-substring-between-two-equal-characters"
  ],
  "1747": [
    "Lexicographically Smallest String After Applying Operations",
    "Medium",
    "lexicographically-smallest-string-after-applying-operations"
  ],
  "1748": [
    "Best Team With No Conflicts",
    "Medium",
    "best-team-with-no-conflicts"
  ],
  "1223": [
    "Graph Connectivity With Threshold",
    "Hard",
    "graph-connectivity-with-threshold"
  ],
  "1768": [
    "Design an Expression Tree With Evaluate Function",
    "Medium",
    "design-an-expression-tree-with-evaluate-function"
  ],
  "1751": [
    "Slowest Key",
    "Easy",
    "slowest-key"
  ],
  "1752": [
    "Arithmetic Subarrays",
    "Medium",
    "arithmetic-subarrays"
  ],
  "1753": [
    "Path With Minimum Effort",
    "Medium",
    "path-with-minimum-effort"
  ],
  "1257": [
    "Rank Transform of a Matrix",
    "Hard",
    "rank-transform-of-a-matrix"
  ],
  "1773": [
    "Percentage of Users Attended a Contest",
    "Easy",
    "percentage-of-users-attended-a-contest"
  ],
  "1774": [
    "Add Two Polynomials Represented as Linked Lists",
    "Medium",
    "add-two-polynomials-represented-as-linked-lists"
  ],
  "1779": [
    "Hopper Company Queries I",
    "Hard",
    "hopper-company-queries-i"
  ],
  "1741": [
    "Sort Array by Increasing Frequency",
    "Easy",
    "sort-array-by-increasing-frequency"
  ],
  "1742": [
    "Widest Vertical Area Between Two Points Containing No Points",
    "Easy",
    "widest-vertical-area-between-two-points-containing-no-points"
  ],
  "1743": [
    "Count Substrings That Differ by One Character",
    "Medium",
    "count-substrings-that-differ-by-one-character"
  ],
  "1744": [
    "Number of Ways to Form a Target String Given a Dictionary",
    "Hard",
    "number-of-ways-to-form-a-target-string-given-a-dictionary"
  ],
  "1760": [
    "Check Array Formation Through Concatenation",
    "Easy",
    "check-array-formation-through-concatenation"
  ],
  "1761": [
    "Count Sorted Vowel Strings",
    "Medium",
    "count-sorted-vowel-strings"
  ],
  "1762": [
    "Furthest Building You Can Reach",
    "Medium",
    "furthest-building-you-can-reach"
  ],
  "489": [
    "Kth Smallest Instructions",
    "Hard",
    "kth-smallest-instructions"
  ],
  "1780": [
    "Lowest Common Ancestor of a Binary Tree II",
    "Medium",
    "lowest-common-ancestor-of-a-binary-tree-ii"
  ],
  "1785": [
    "Hopper Company Queries II",
    "Hard",
    "hopper-company-queries-ii"
  ],
  "1769": [
    "Get Maximum in Generated Array",
    "Easy",
    "get-maximum-in-generated-array"
  ],
  "1770": [
    "Minimum Deletions to Make Character Frequencies Unique",
    "Medium",
    "minimum-deletions-to-make-character-frequencies-unique"
  ],
  "1771": [
    "Sell Diminishing-Valued Colored Balls",
    "Medium",
    "sell-diminishing-valued-colored-balls"
  ],
  "1772": [
    "Create Sorted Array through Instructions",
    "Hard",
    "create-sorted-array-through-instructions"
  ],
  "1790": [
    "Lowest Common Ancestor of a Binary Tree III",
    "Medium",
    "lowest-common-ancestor-of-a-binary-tree-iii"
  ],
  "1795": [
    "Hopper Company Queries III",
    "Hard",
    "hopper-company-queries-iii"
  ],
  "1755": [
    "Defuse the Bomb",
    "Easy",
    "defuse-the-bomb"
  ],
  "1756": [
    "Minimum Deletions to Make String Balanced",
    "Medium",
    "minimum-deletions-to-make-string-balanced"
  ],
  "1757": [
    "Minimum Jumps to Reach Home",
    "Medium",
    "minimum-jumps-to-reach-home"
  ],
  "1758": [
    "Distribute Repeating Integers",
    "Hard",
    "distribute-repeating-integers"
  ],
  "1775": [
    "Design an Ordered Stream",
    "Easy",
    "design-an-ordered-stream"
  ],
  "1777": [
    "Determine if Two Strings Are Close",
    "Medium",
    "determine-if-two-strings-are-close"
  ],
  "1776": [
    "Minimum Operations to Reduce X to Zero",
    "Medium",
    "minimum-operations-to-reduce-x-to-zero"
  ],
  "1778": [
    "Maximize Grid Happiness",
    "Hard",
    "maximize-grid-happiness"
  ],
  "1796": [
    "Correct a Binary Tree",
    "Medium",
    "correct-a-binary-tree"
  ],
  "1801": [
    "Average Time of Process per Machine",
    "Easy",
    "average-time-of-process-per-machine"
  ],
  "1781": [
    "Check If Two String Arrays are Equivalent",
    "Easy",
    "check-if-two-string-arrays-are-equivalent"
  ],
  "1782": [
    "Smallest String With A Given Numeric Value",
    "Medium",
    "smallest-string-with-a-given-numeric-value"
  ],
  "1783": [
    "Ways to Make a Fair Array",
    "Medium",
    "ways-to-make-a-fair-array"
  ],
  "1784": [
    "Minimum Initial Energy to Finish Tasks",
    "Hard",
    "minimum-initial-energy-to-finish-tasks"
  ],
  "1810": [
    "Change the Root of a Binary Tree",
    "Medium",
    "change-the-root-of-a-binary-tree"
  ],
  "1811": [
    "Fix Names in a Table",
    "Easy",
    "fix-names-in-a-table"
  ],
  "1764": [
    "Maximum Repeating Substring",
    "Easy",
    "maximum-repeating-substring"
  ],
  "1765": [
    "Merge In Between Linked Lists",
    "Medium",
    "merge-in-between-linked-lists"
  ],
  "1767": [
    "Design Front Middle Back Queue",
    "Medium",
    "design-front-middle-back-queue"
  ],
  "1766": [
    "Minimum Number of Removals to Make Mountain Array",
    "Hard",
    "minimum-number-of-removals-to-make-mountain-array"
  ],
  "1791": [
    "Richest Customer Wealth",
    "Easy",
    "richest-customer-wealth"
  ],
  "1792": [
    "Find the Most Competitive Subsequence",
    "Medium",
    "find-the-most-competitive-subsequence"
  ],
  "1793": [
    "Minimum Moves to Make Array Complementary",
    "Medium",
    "minimum-moves-to-make-array-complementary"
  ],
  "1794": [
    "Minimize Deviation in Array",
    "Hard",
    "minimize-deviation-in-array"
  ],
  "1816": [
    "Lowest Common Ancestor of a Binary Tree IV",
    "Medium",
    "lowest-common-ancestor-of-a-binary-tree-iv"
  ],
  "1821": [
    "Product's Worth Over Invoices",
    "Easy",
    "products-worth-over-invoices"
  ],
  "1797": [
    "Goal Parser Interpretation",
    "Easy",
    "goal-parser-interpretation"
  ],
  "1798": [
    "Max Number of K-Sum Pairs",
    "Medium",
    "max-number-of-k-sum-pairs"
  ],
  "1800": [
    "Concatenation of Consecutive Binary Numbers",
    "Medium",
    "concatenation-of-consecutive-binary-numbers"
  ],
  "1799": [
    "Minimum Incompatibility",
    "Hard",
    "minimum-incompatibility"
  ],
  "1822": [
    "Longest Palindromic Subsequence II",
    "Medium",
    "longest-palindromic-subsequence-ii"
  ],
  "1827": [
    "Invalid Tweets",
    "Easy",
    "invalid-tweets"
  ],
  "1786": [
    "Count the Number of Consistent Strings",
    "Easy",
    "count-the-number-of-consistent-strings"
  ],
  "1787": [
    "Sum of Absolute Differences in a Sorted Array",
    "Medium",
    "sum-of-absolute-differences-in-a-sorted-array"
  ],
  "1788": [
    "Stone Game VI",
    "Medium",
    "stone-game-vi"
  ],
  "1789": [
    "Delivering Boxes from Storage to Ports",
    "Hard",
    "delivering-boxes-from-storage-to-ports"
  ],
  "1806": [
    "Count of Matches in Tournament",
    "Easy",
    "count-of-matches-in-tournament"
  ],
  "1807": [
    "Partitioning Into Minimum Number Of Deci-Binary Numbers",
    "Medium",
    "partitioning-into-minimum-number-of-deci-binary-numbers"
  ],
  "1808": [
    "Stone Game VII",
    "Medium",
    "stone-game-vii"
  ],
  "1367": [
    "Maximum Height by Stacking Cuboids ",
    "Hard",
    "maximum-height-by-stacking-cuboids"
  ],
  "1828": [
    "Count Ways to Distribute Candies",
    "Hard",
    "count-ways-to-distribute-candies"
  ],
  "1837": [
    "Daily Leads and Partners",
    "Easy",
    "daily-leads-and-partners"
  ],
  "1812": [
    "Reformat Phone Number",
    "Easy",
    "reformat-phone-number"
  ],
  "1813": [
    "Maximum Erasure Value",
    "Medium",
    "maximum-erasure-value"
  ],
  "1814": [
    "Jump Game VI",
    "Medium",
    "jump-game-vi"
  ],
  "1815": [
    "Checking Existence of Edge Length Limited Paths",
    "Hard",
    "checking-existence-of-edge-length-limited-paths"
  ],
  "1838": [
    "Number of Distinct Substrings in a String",
    "Medium",
    "number-of-distinct-substrings-in-a-string"
  ],
  "1842": [
    "Number of Calls Between Two Persons",
    "Medium",
    "number-of-calls-between-two-persons"
  ],
  "1802": [
    "Number of Students Unable to Eat Lunch",
    "Easy",
    "number-of-students-unable-to-eat-lunch"
  ],
  "1803": [
    "Average Waiting Time",
    "Medium",
    "average-waiting-time"
  ],
  "1804": [
    "Maximum Binary String After Change",
    "Medium",
    "maximum-binary-string-after-change"
  ],
  "1805": [
    "Minimum Adjacent Swaps for K Consecutive Ones",
    "Hard",
    "minimum-adjacent-swaps-for-k-consecutive-ones"
  ],
  "1823": [
    "Determine if String Halves Are Alike",
    "Easy",
    "determine-if-string-halves-are-alike"
  ],
  "1824": [
    "Maximum Number of Eaten Apples",
    "Medium",
    "maximum-number-of-eaten-apples"
  ],
  "1324": [
    "Where Will the Ball Fall",
    "Medium",
    "where-will-the-ball-fall"
  ],
  "1826": [
    "Maximum XOR With an Element From Array",
    "Hard",
    "maximum-xor-with-an-element-from-array"
  ],
  "1847": [
    "Largest Subarray Length K",
    "Easy",
    "largest-subarray-length-k"
  ],
  "1852": [
    "Biggest Window Between Visits",
    "Medium",
    "biggest-window-between-visits"
  ],
  "1829": [
    "Maximum Units on a Truck",
    "Easy",
    "maximum-units-on-a-truck"
  ],
  "1830": [
    "Count Good Meals",
    "Medium",
    "count-good-meals"
  ],
  "1831": [
    "Ways to Split Array Into Three Subarrays",
    "Medium",
    "ways-to-split-array-into-three-subarrays"
  ],
  "1832": [
    "Minimum Operations to Make a Subsequence",
    "Hard",
    "minimum-operations-to-make-a-subsequence"
  ],
  "1809": [
    "Sum Of Special Evenly-Spaced Elements In Array",
    "Hard",
    "sum-of-special-evenly-spaced-elements-in-array"
  ],
  "1862": [
    "Count Apples and Oranges",
    "Medium",
    "count-apples-and-oranges"
  ],
  "1817": [
    "Calculate Money in Leetcode Bank",
    "Easy",
    "calculate-money-in-leetcode-bank"
  ],
  "1818": [
    "Maximum Score From Removing Substrings",
    "Medium",
    "maximum-score-from-removing-substrings"
  ],
  "1819": [
    "Construct the Lexicographically Largest Valid Sequence",
    "Medium",
    "construct-the-lexicographically-largest-valid-sequence"
  ],
  "1820": [
    "Number Of Ways To Reconstruct A Tree",
    "Hard",
    "number-of-ways-to-reconstruct-a-tree"
  ],
  "1839": [
    "Decode XORed Array",
    "Easy",
    "decode-xored-array"
  ],
  "528": [
    "Swapping Nodes in a Linked List",
    "Medium",
    "swapping-nodes-in-a-linked-list"
  ],
  "1840": [
    "Minimize Hamming Distance After Swap Operations",
    "Medium",
    "minimize-hamming-distance-after-swap-operations"
  ],
  "1825": [
    "Find Minimum Time to Finish All Jobs",
    "Hard",
    "find-minimum-time-to-finish-all-jobs"
  ],
  "1865": [
    "Checking Existence of Edge Length Limited Paths II",
    "Hard",
    "checking-existence-of-edge-length-limited-paths-ii"
  ],
  "1843": [
    "Number Of Rectangles That Can Form The Largest Square",
    "Easy",
    "number-of-rectangles-that-can-form-the-largest-square"
  ],
  "1364": [
    "Tuple with Same Product",
    "Medium",
    "tuple-with-same-product"
  ],
  "1845": [
    "Largest Submatrix With Rearrangements",
    "Medium",
    "largest-submatrix-with-rearrangements"
  ],
  "1727": [
    "Cat and Mouse II",
    "Hard",
    "cat-and-mouse-ii"
  ],
  "1877": [
    "Find Followers Count",
    "Easy",
    "find-followers-count"
  ],
  "550": [
    "Shortest Path to Get Food",
    "Medium",
    "shortest-path-to-get-food"
  ],
  "1882": [
    "The Number of Employees Which Report to Each Employee",
    "Easy",
    "the-number-of-employees-which-report-to-each-employee"
  ],
  "1833": [
    "Find the Highest Altitude",
    "Easy",
    "find-the-highest-altitude"
  ],
  "1834": [
    "Minimum Number of People to Teach",
    "Medium",
    "minimum-number-of-people-to-teach"
  ],
  "1835": [
    "Decode XORed Permutation",
    "Medium",
    "decode-xored-permutation"
  ],
  "1836": [
    "Count Ways to Make Array With Product",
    "Hard",
    "count-ways-to-make-array-with-product"
  ],
  "1858": [
    "Latest Time by Replacing Hidden Digits",
    "Easy",
    "latest-time-by-replacing-hidden-digits"
  ],
  "1859": [
    "Change Minimum Characters to Satisfy One of Three Conditions",
    "Medium",
    "change-minimum-characters-to-satisfy-one-of-three-conditions"
  ],
  "1860": [
    "Find Kth Largest XOR Coordinate Value",
    "Medium",
    "find-kth-largest-xor-coordinate-value"
  ],
  "1861": [
    "Building Boxes",
    "Hard",
    "building-boxes"
  ],
  "1883": [
    "Find Distance in a Binary Tree",
    "Medium",
    "find-distance-in-a-binary-tree"
  ],
  "1892": [
    "Find Total Time Spent by Each Employee",
    "Easy",
    "find-total-time-spent-by-each-employee"
  ],
  "1844": [
    "Maximum Number of Balls in a Box",
    "Easy",
    "maximum-number-of-balls-in-a-box"
  ],
  "1866": [
    "Restore the Array From Adjacent Pairs",
    "Medium",
    "restore-the-array-from-adjacent-pairs"
  ],
  "1872": [
    "Can You Eat Your Favorite Candy on Your Favorite Day?",
    "Medium",
    "can-you-eat-your-favorite-candy-on-your-favorite-day"
  ],
  "1871": [
    "Palindrome Partitioning IV",
    "Hard",
    "palindrome-partitioning-iv"
  ],
  "1893": [
    "Maximum Subarray Sum After One Operation",
    "Medium",
    "maximum-subarray-sum-after-one-operation"
  ],
  "1898": [
    "Leetflex Banned Accounts",
    "Medium",
    "leetflex-banned-accounts"
  ],
  "1848": [
    "Sum of Unique Elements",
    "Easy",
    "sum-of-unique-elements"
  ],
  "1849": [
    "Maximum Absolute Sum of Any Subarray",
    "Medium",
    "maximum-absolute-sum-of-any-subarray"
  ],
  "1850": [
    "Minimum Length of String After Deleting Similar Ends",
    "Medium",
    "minimum-length-of-string-after-deleting-similar-ends"
  ],
  "1851": [
    "Maximum Number of Events That Can Be Attended II",
    "Hard",
    "maximum-number-of-events-that-can-be-attended-ii"
  ],
  "1878": [
    "Check if Array Is Sorted and Rotated",
    "Easy",
    "check-if-array-is-sorted-and-rotated"
  ],
  "1879": [
    "Maximum Score From Removing Stones",
    "Medium",
    "maximum-score-from-removing-stones"
  ],
  "1880": [
    "Largest Merge Of Two Strings",
    "Medium",
    "largest-merge-of-two-strings"
  ],
  "1881": [
    "Closest Subsequence Sum",
    "Hard",
    "closest-subsequence-sum"
  ],
  "1903": [
    "Design Most Recently Used Queue",
    "Medium",
    "design-most-recently-used-queue"
  ],
  "1908": [
    "Recyclable and Low Fat Products",
    "Easy",
    "recyclable-and-low-fat-products"
  ],
  "1884": [
    "Minimum Changes To Make Alternating Binary String",
    "Easy",
    "minimum-changes-to-make-alternating-binary-string"
  ],
  "1885": [
    "Count Number of Homogenous Substrings",
    "Medium",
    "count-number-of-homogenous-substrings"
  ],
  "1886": [
    "Minimum Limit of Balls in a Bag",
    "Medium",
    "minimum-limit-of-balls-in-a-bag"
  ],
  "1887": [
    "Minimum Degree of a Connected Trio in a Graph",
    "Hard",
    "minimum-degree-of-a-connected-trio-in-a-graph"
  ],
  "1909": [
    "Buildings With an Ocean View",
    "Medium",
    "buildings-with-an-ocean-view"
  ],
  "1873": [
    "Longest Nice Substring",
    "Easy",
    "longest-nice-substring"
  ],
  "1874": [
    "Form Array by Concatenating Subarrays of Another Array",
    "Medium",
    "form-array-by-concatenating-subarrays-of-another-array"
  ],
  "1876": [
    "Map of Highest Peak",
    "Medium",
    "map-of-highest-peak"
  ],
  "1875": [
    "Tree of Coprimes",
    "Hard",
    "tree-of-coprimes"
  ],
  "1914": [
    "Find the Subtasks That Did Not Execute",
    "Hard",
    "find-the-subtasks-that-did-not-execute"
  ],
  "1894": [
    "Merge Strings Alternately",
    "Easy",
    "merge-strings-alternately"
  ],
  "1895": [
    "Minimum Number of Operations to Move All Balls to Each Box",
    "Medium",
    "minimum-number-of-operations-to-move-all-balls-to-each-box"
  ],
  "1896": [
    "Maximum Score from Performing Multiplication Operations",
    "Hard",
    "maximum-score-from-performing-multiplication-operations"
  ],
  "1897": [
    "Maximize Palindrome Length From Subsequences",
    "Hard",
    "maximize-palindrome-length-from-subsequences"
  ],
  "1919": [
    "Sort Features by Popularity",
    "Medium",
    "sort-features-by-popularity"
  ],
  "1899": [
    "Count Items Matching a Rule",
    "Easy",
    "count-items-matching-a-rule"
  ],
  "1900": [
    "Closest Dessert Cost",
    "Medium",
    "closest-dessert-cost"
  ],
  "1901": [
    "Equal Sum Arrays With Minimum Number of Operations",
    "Medium",
    "equal-sum-arrays-with-minimum-number-of-operations"
  ],
  "1902": [
    "Car Fleet II",
    "Hard",
    "car-fleet-ii"
  ],
  "1926": [
    "Product's Price for Each Store",
    "Easy",
    "products-price-for-each-store"
  ],
  "1931": [
    "Shortest Path in a Hidden Grid",
    "Medium",
    "shortest-path-in-a-hidden-grid"
  ],
  "1888": [
    "Find Nearest Point That Has the Same X or Y Coordinate",
    "Easy",
    "find-nearest-point-that-has-the-same-x-or-y-coordinate"
  ],
  "1889": [
    "Check if Number is a Sum of Powers of Three",
    "Medium",
    "check-if-number-is-a-sum-of-powers-of-three"
  ],
  "1890": [
    "Sum of Beauty of All Substrings",
    "Medium",
    "sum-of-beauty-of-all-substrings"
  ],
  "1891": [
    "Count Pairs Of Nodes",
    "Hard",
    "count-pairs-of-nodes"
  ],
  "1932": [
    "Grand Slam Titles",
    "Medium",
    "grand-slam-titles"
  ],
  "1910": [
    "Check if Binary String Has at Most One Segment of Ones",
    "Easy",
    "check-if-binary-string-has-at-most-one-segment-of-ones"
  ],
  "1911": [
    "Minimum Elements to Add to Form a Given Sum",
    "Medium",
    "minimum-elements-to-add-to-form-a-given-sum"
  ],
  "1912": [
    "Number of Restricted Paths From First to Last Node",
    "Medium",
    "number-of-restricted-paths-from-first-to-last-node"
  ],
  "1913": [
    "Make the XOR of All Segments Equal to Zero",
    "Hard",
    "make-the-xor-of-all-segments-equal-to-zero"
  ],
  "1937": [
    "Maximize the Beauty of the Garden",
    "Hard",
    "maximize-the-beauty-of-the-garden"
  ],
  "1942": [
    "Primary Department for Each Employee",
    "Easy",
    "primary-department-for-each-employee"
  ],
  "1915": [
    "Check if One String Swap Can Make Strings Equal",
    "Easy",
    "check-if-one-string-swap-can-make-strings-equal"
  ],
  "1916": [
    "Find Center of Star Graph",
    "Easy",
    "find-center-of-star-graph"
  ],
  "1917": [
    "Maximum Average Pass Ratio",
    "Medium",
    "maximum-average-pass-ratio"
  ],
  "1918": [
    "Maximum Score of a Good Subarray",
    "Hard",
    "maximum-score-of-a-good-subarray"
  ],
  "1943": [
    "Count Pairs of Equal Substrings With Minimum Difference",
    "Medium",
    "count-pairs-of-equal-substrings-with-minimum-difference"
  ],
  "1948": [
    "Rearrange Products Table",
    "Easy",
    "rearrange-products-table"
  ],
  "1904": [
    "Second Largest Digit in a String",
    "Easy",
    "second-largest-digit-in-a-string"
  ],
  "1905": [
    "Design Authentication Manager",
    "Medium",
    "design-authentication-manager"
  ],
  "1930": [
    "Maximum Number of Consecutive Values You Can Make",
    "Medium",
    "maximum-number-of-consecutive-values-you-can-make"
  ],
  "1906": [
    "Maximize Score After N Operations",
    "Hard",
    "maximize-score-after-n-operations"
  ],
  "1927": [
    "Maximum Ascending Subarray Sum",
    "Easy",
    "maximum-ascending-subarray-sum"
  ],
  "1928": [
    "Number of Orders in the Backlog",
    "Medium",
    "number-of-orders-in-the-backlog"
  ],
  "1929": [
    "Maximum Value at a Given Index in a Bounded Array",
    "Medium",
    "maximum-value-at-a-given-index-in-a-bounded-array"
  ],
  "1907": [
    "Count Pairs With XOR in a Range",
    "Hard",
    "count-pairs-with-xor-in-a-range"
  ],
  "1949": [
    "Implement Trie II (Prefix Tree)",
    "Medium",
    "implement-trie-ii-prefix-tree"
  ],
  "1933": [
    "Number of Different Integers in a String",
    "Easy",
    "number-of-different-integers-in-a-string"
  ],
  "1935": [
    "Minimum Number of Operations to Reinitialize a Permutation",
    "Medium",
    "minimum-number-of-operations-to-reinitialize-a-permutation"
  ],
  "1934": [
    "Evaluate the Bracket Pairs of a String",
    "Medium",
    "evaluate-the-bracket-pairs-of-a-string"
  ],
  "1936": [
    "Maximize Number of Nice Divisors",
    "Hard",
    "maximize-number-of-nice-divisors"
  ],
  "1958": [
    "Ad-Free Sessions",
    "Easy",
    "ad-free-sessions"
  ],
  "1959": [
    "Minimum Path Cost in a Hidden Grid",
    "Medium",
    "minimum-path-cost-in-a-hidden-grid"
  ],
  "1964": [
    "Find Interview Candidates",
    "Medium",
    "find-interview-candidates"
  ],
  "1920": [
    "Determine Color of a Chessboard Square",
    "Easy",
    "determine-color-of-a-chessboard-square"
  ],
  "1923": [
    "Sentence Similarity III",
    "Medium",
    "sentence-similarity-iii"
  ],
  "1925": [
    "Count Nice Pairs in an Array",
    "Medium",
    "count-nice-pairs-in-an-array"
  ],
  "1924": [
    "Maximum Number of Groups Getting Fresh Donuts",
    "Hard",
    "maximum-number-of-groups-getting-fresh-donuts"
  ],
  "1944": [
    "Truncate Sentence",
    "Easy",
    "truncate-sentence"
  ],
  "1945": [
    "Finding the Users Active Minutes",
    "Medium",
    "finding-the-users-active-minutes"
  ],
  "1946": [
    "Minimum Absolute Sum Difference",
    "Medium",
    "minimum-absolute-sum-difference"
  ],
  "1947": [
    "Number of Different Subsequences GCDs",
    "Hard",
    "number-of-different-subsequences-gcds"
  ],
  "1969": [
    "Maximum Number of Accepted Invitations",
    "Medium",
    "maximum-number-of-accepted-invitations"
  ],
  "1974": [
    "Find Customers With Positive Revenue this Year",
    "Easy",
    "find-customers-with-positive-revenue-this-year"
  ],
  "1950": [
    "Sign of the Product of an Array",
    "Easy",
    "sign-of-the-product-of-an-array"
  ],
  "1951": [
    "Find the Winner of the Circular Game",
    "Medium",
    "find-the-winner-of-the-circular-game"
  ],
  "1952": [
    "Minimum Sideway Jumps",
    "Medium",
    "minimum-sideway-jumps"
  ],
  "1953": [
    "Finding MK Average",
    "Hard",
    "finding-mk-average"
  ],
  "1980": [
    "Faulty Sensor",
    "Easy",
    "faulty-sensor"
  ],
  "1938": [
    "Minimum Operations to Make the Array Increasing",
    "Easy",
    "minimum-operations-to-make-the-array-increasing"
  ],
  "1939": [
    "Queries on Number of Points Inside a Circle",
    "Medium",
    "queries-on-number-of-points-inside-a-circle"
  ],
  "1940": [
    "Maximum XOR for Each Query",
    "Medium",
    "maximum-xor-for-each-query"
  ],
  "1941": [
    "Minimum Number of Operations to Make String Sorted",
    "Hard",
    "minimum-number-of-operations-to-make-string-sorted"
  ],
  "1981": [
    "Maximum Transaction Each Day",
    "Medium",
    "maximum-transaction-each-day"
  ],
  "1960": [
    "Check if the Sentence Is Pangram",
    "Easy",
    "check-if-the-sentence-is-pangram"
  ],
  "1961": [
    "Maximum Ice Cream Bars",
    "Medium",
    "maximum-ice-cream-bars"
  ],
  "1962": [
    "Single-Threaded CPU",
    "Medium",
    "single-threaded-cpu"
  ],
  "1963": [
    "Find XOR Sum of All Pairs Bitwise AND",
    "Hard",
    "find-xor-sum-of-all-pairs-bitwise-and"
  ],
  "1982": [
    "Remove Duplicates From an Unsorted Linked List",
    "Medium",
    "remove-duplicates-from-an-unsorted-linked-list"
  ],
  "1965": [
    "Sum of Digits in Base K",
    "Easy",
    "sum-of-digits-in-base-k"
  ],
  "1966": [
    "Frequency of the Most Frequent Element",
    "Medium",
    "frequency-of-the-most-frequent-element"
  ],
  "1967": [
    "Longest Substring Of All Vowels in Order",
    "Medium",
    "longest-substring-of-all-vowels-in-order"
  ],
  "1968": [
    "Maximum Building Height",
    "Hard",
    "maximum-building-height"
  ],
  "1991": [
    "League Statistics",
    "Medium",
    "league-statistics"
  ],
  "1997": [
    "Next Palindrome Using Same Digits",
    "Hard",
    "next-palindrome-using-same-digits"
  ],
  "1998": [
    "Suspicious Bank Accounts",
    "Medium",
    "suspicious-bank-accounts"
  ],
  "1954": [
    "Replace All Digits with Characters",
    "Easy",
    "replace-all-digits-with-characters"
  ],
  "1955": [
    "Seat Reservation Manager",
    "Medium",
    "seat-reservation-manager"
  ],
  "1956": [
    "Maximum Element After Decreasing and Rearranging",
    "Medium",
    "maximum-element-after-decreasing-and-rearranging"
  ],
  "1957": [
    "Closest Room",
    "Hard",
    "closest-room"
  ],
  "1975": [
    "Minimum Distance to the Target Element",
    "Easy",
    "minimum-distance-to-the-target-element"
  ],
  "1976": [
    "Splitting a String Into Descending Consecutive Values",
    "Medium",
    "splitting-a-string-into-descending-consecutive-values"
  ],
  "1978": [
    "Minimum Adjacent Swaps to Reach the Kth Smallest Number",
    "Medium",
    "minimum-adjacent-swaps-to-reach-the-kth-smallest-number"
  ],
  "1977": [
    "Minimum Interval to Include Each Query",
    "Hard",
    "minimum-interval-to-include-each-query"
  ],
  "2003": [
    "Distinct Numbers in Each Subarray",
    "Medium",
    "distinct-numbers-in-each-subarray"
  ],
  "2004": [
    "Convert Date Format",
    "Easy",
    "convert-date-format"
  ],
  "1983": [
    "Maximum Population Year",
    "Easy",
    "maximum-population-year"
  ],
  "1984": [
    "Maximum Distance Between a Pair of Values",
    "Medium",
    "maximum-distance-between-a-pair-of-values"
  ],
  "1985": [
    "Maximum Subarray Min-Product",
    "Medium",
    "maximum-subarray-min-product"
  ],
  "1986": [
    "Largest Color Value in a Directed Graph",
    "Hard",
    "largest-color-value-in-a-directed-graph"
  ],
  "2009": [
    "Longest Word With All Prefixes",
    "Medium",
    "longest-word-with-all-prefixes"
  ],
  "1970": [
    "Sorting the Sentence",
    "Easy",
    "sorting-the-sentence"
  ],
  "1971": [
    "Incremental Memory Leak",
    "Medium",
    "incremental-memory-leak"
  ],
  "1972": [
    "Rotating the Box",
    "Medium",
    "rotating-the-box"
  ],
  "1326": [
    "Sum of Floored Pairs",
    "Hard",
    "sum-of-floored-pairs"
  ],
  "1993": [
    "Sum of All Subset XOR Totals",
    "Easy",
    "sum-of-all-subset-xor-totals"
  ],
  "1994": [
    "Minimum Number of Swaps to Make the Binary String Alternating",
    "Medium",
    "minimum-number-of-swaps-to-make-the-binary-string-alternating"
  ],
  "1995": [
    "Finding Pairs With a Certain Sum",
    "Medium",
    "finding-pairs-with-a-certain-sum"
  ],
  "1996": [
    "Number of Ways to Rearrange Sticks With K Sticks Visible",
    "Hard",
    "number-of-ways-to-rearrange-sticks-with-k-sticks-visible"
  ],
  "2014": [
    "Orders With Maximum Quantity Above Average",
    "Medium",
    "orders-with-maximum-quantity-above-average"
  ],
  "2019": [
    "Product of Two Run-Length Encoded Arrays",
    "Medium",
    "product-of-two-run-length-encoded-arrays"
  ],
  "1999": [
    "Longer Contiguous Segments of Ones than Zeros",
    "Easy",
    "longer-contiguous-segments-of-ones-than-zeros"
  ],
  "2000": [
    "Minimum Speed to Arrive on Time",
    "Medium",
    "minimum-speed-to-arrive-on-time"
  ],
  "2001": [
    "Jump Game VII",
    "Medium",
    "jump-game-vii"
  ],
  "2002": [
    "Stone Game VIII",
    "Hard",
    "stone-game-viii"
  ],
  "2024": [
    "Calculate Special Bonus",
    "Easy",
    "calculate-special-bonus"
  ],
  "2029": [
    "Minimize Product Sum of Two Arrays",
    "Medium",
    "minimize-product-sum-of-two-arrays"
  ],
  "2030": [
    "Group Employees of the Same Salary",
    "Medium",
    "group-employees-of-the-same-salary"
  ],
  "1987": [
    "Substrings of Size Three with Distinct Characters",
    "Easy",
    "substrings-of-size-three-with-distinct-characters"
  ],
  "1988": [
    "Minimize Maximum Pair Sum in Array",
    "Medium",
    "minimize-maximum-pair-sum-in-array"
  ],
  "1990": [
    "Get Biggest Three Rhombus Sums in a Grid",
    "Medium",
    "get-biggest-three-rhombus-sums-in-a-grid"
  ],
  "1989": [
    "Minimum XOR Sum of Two Arrays",
    "Hard",
    "minimum-xor-sum-of-two-arrays"
  ],
  "2010": [
    "Check if Word Equals Summation of Two Words",
    "Easy",
    "check-if-word-equals-summation-of-two-words"
  ],
  "2011": [
    "Maximum Value after Insertion",
    "Medium",
    "maximum-value-after-insertion"
  ],
  "2012": [
    "Process Tasks Using Servers",
    "Medium",
    "process-tasks-using-servers"
  ],
  "2013": [
    "Minimum Skips to Arrive at Meeting On Time",
    "Hard",
    "minimum-skips-to-arrive-at-meeting-on-time"
  ],
  "2031": [
    "Egg Drop With 2 Eggs and N Floors",
    "Medium",
    "egg-drop-with-2-eggs-and-n-floors"
  ],
  "2036": [
    "Count Pairs in Two Arrays",
    "Medium",
    "count-pairs-in-two-arrays"
  ],
  "2015": [
    "Determine Whether Matrix Can Be Obtained By Rotation",
    "Easy",
    "determine-whether-matrix-can-be-obtained-by-rotation"
  ],
  "2016": [
    "Reduction Operations to Make the Array Elements Equal",
    "Medium",
    "reduction-operations-to-make-the-array-elements-equal"
  ],
  "2017": [
    "Minimum Number of Flips to Make the Binary String Alternating",
    "Medium",
    "minimum-number-of-flips-to-make-the-binary-string-alternating"
  ],
  "2018": [
    "Minimum Space Wasted From Packaging",
    "Hard",
    "minimum-space-wasted-from-packaging"
  ],
  "2041": [
    "The Latest Login in 2020",
    "Easy",
    "the-latest-login-in-2020"
  ],
  "2045": [
    "Cutting Ribbons",
    "Medium",
    "cutting-ribbons"
  ],
  "2046": [
    "Page Recommendations II",
    "Hard",
    "page-recommendations-ii"
  ],
  "2005": [
    "Check if All the Integers in a Range Are Covered",
    "Easy",
    "check-if-all-the-integers-in-a-range-are-covered"
  ],
  "2006": [
    "Find the Student that Will Replace the Chalk",
    "Medium",
    "find-the-student-that-will-replace-the-chalk"
  ],
  "1311": [
    "Largest Magic Square",
    "Medium",
    "largest-magic-square"
  ],
  "2008": [
    "Minimum Cost to Change the Final Value of Expression",
    "Hard",
    "minimum-cost-to-change-the-final-value-of-expression"
  ],
  "2025": [
    "Redistribute Characters to Make All Strings Equal",
    "Easy",
    "redistribute-characters-to-make-all-strings-equal"
  ],
  "2027": [
    "Maximum Number of Removable Characters",
    "Medium",
    "maximum-number-of-removable-characters"
  ],
  "2026": [
    "Merge Triplets to Form Target Triplet",
    "Medium",
    "merge-triplets-to-form-target-triplet"
  ],
  "2028": [
    "The Earliest and Latest Rounds Where Players Compete",
    "Hard",
    "the-earliest-and-latest-rounds-where-players-compete"
  ],
  "2047": [
    "Find a Peak Element II",
    "Medium",
    "find-a-peak-element-ii"
  ],
  "2052": [
    "Depth of BST Given Insertion Order",
    "Medium",
    "depth-of-bst-given-insertion-order"
  ],
  "2032": [
    "Largest Odd Number in String",
    "Easy",
    "largest-odd-number-in-string"
  ],
  "2033": [
    "The Number of Full Rounds You Have Played",
    "Medium",
    "the-number-of-full-rounds-you-have-played"
  ],
  "2035": [
    "Count Sub Islands",
    "Medium",
    "count-sub-islands"
  ],
  "2034": [
    "Minimum Absolute Difference Queries",
    "Medium",
    "minimum-absolute-difference-queries"
  ],
  "2057": [
    "Count Salary Categories",
    "Medium",
    "count-salary-categories"
  ],
  "2062": [
    "Game of Nim",
    "Medium",
    "game-of-nim"
  ],
  "2020": [
    "Remove One Element to Make the Array Strictly Increasing",
    "Easy",
    "remove-one-element-to-make-the-array-strictly-increasing"
  ],
  "2021": [
    "Remove All Occurrences of a Substring",
    "Medium",
    "remove-all-occurrences-of-a-substring"
  ],
  "2022": [
    "Maximum Alternating Subsequence Sum",
    "Medium",
    "maximum-alternating-subsequence-sum"
  ],
  "2023": [
    "Design Movie Rental System",
    "Hard",
    "design-movie-rental-system"
  ],
  "2042": [
    "Maximum Product Difference Between Two Pairs",
    "Easy",
    "maximum-product-difference-between-two-pairs"
  ],
  "2043": [
    "Cyclically Rotating a Grid",
    "Medium",
    "cyclically-rotating-a-grid"
  ],
  "2044": [
    "Number of Wonderful Substrings",
    "Medium",
    "number-of-wonderful-substrings"
  ],
  "1313": [
    "Count Ways to Build Rooms in an Ant Colony",
    "Hard",
    "count-ways-to-build-rooms-in-an-ant-colony"
  ],
  "2063": [
    "Leetcodify Friends Recommendations",
    "Hard",
    "leetcodify-friends-recommendations"
  ],
  "2069": [
    "Kth Smallest Subarray Sum",
    "Medium",
    "kth-smallest-subarray-sum"
  ],
  "2064": [
    "Leetcodify Similar Friends",
    "Hard",
    "leetcodify-similar-friends"
  ],
  "2048": [
    "Build Array from Permutation",
    "Easy",
    "build-array-from-permutation"
  ],
  "2049": [
    "Eliminate Maximum Number of Monsters",
    "Medium",
    "eliminate-maximum-number-of-monsters"
  ],
  "2050": [
    "Count Good Numbers",
    "Medium",
    "count-good-numbers"
  ],
  "2051": [
    "Longest Common Subpath",
    "Hard",
    "longest-common-subpath"
  ],
  "2074": [
    "Erect the Fence II",
    "Hard",
    "erect-the-fence-ii"
  ],
  "2037": [
    "Count Square Sum Triples",
    "Easy",
    "count-square-sum-triples"
  ],
  "2038": [
    "Nearest Exit from Entrance in Maze",
    "Medium",
    "nearest-exit-from-entrance-in-maze"
  ],
  "2039": [
    "Sum Game",
    "Medium",
    "sum-game"
  ],
  "2040": [
    "Minimum Cost to Reach Destination in Time",
    "Hard",
    "minimum-cost-to-reach-destination-in-time"
  ],
  "2058": [
    "Concatenation of Array",
    "Easy",
    "concatenation-of-array"
  ],
  "2059": [
    "Unique Length-3 Palindromic Subsequences",
    "Medium",
    "unique-length-3-palindromic-subsequences"
  ],
  "2061": [
    "Painting a Grid With Three Different Colors",
    "Hard",
    "painting-a-grid-with-three-different-colors"
  ],
  "2060": [
    "Merge BSTs to Create Single BST",
    "Hard",
    "merge-bsts-to-create-single-bst"
  ],
  "2070": [
    "Check if String Is Decomposable Into Value-Equal Substrings",
    "Easy",
    "check-if-string-is-decomposable-into-value-equal-substrings"
  ],
  "2087": [
    "Confirmation Rate",
    "Medium",
    "confirmation-rate"
  ],
  "1264": [
    "Maximum Number of Words You Can Type",
    "Easy",
    "maximum-number-of-words-you-can-type"
  ],
  "2066": [
    "Add Minimum Number of Rungs",
    "Medium",
    "add-minimum-number-of-rungs"
  ],
  "2067": [
    "Maximum Number of Points with Cost",
    "Medium",
    "maximum-number-of-points-with-cost"
  ],
  "2068": [
    "Maximum Genetic Difference Query",
    "Hard",
    "maximum-genetic-difference-query"
  ],
  "2092": [
    "Users That Actively Request Confirmation Messages",
    "Easy",
    "users-that-actively-request-confirmation-messages"
  ],
  "2071": [
    "Longest Common Subsequence Between Sorted Arrays",
    "Medium",
    "longest-common-subsequence-between-sorted-arrays"
  ],
  "2053": [
    "Check if All Characters Have Equal Number of Occurrences",
    "Easy",
    "check-if-all-characters-have-equal-number-of-occurrences"
  ],
  "2054": [
    "The Number of the Smallest Unoccupied Chair",
    "Medium",
    "the-number-of-the-smallest-unoccupied-chair"
  ],
  "2055": [
    "Describe the Painting",
    "Medium",
    "describe-the-painting"
  ],
  "1305": [
    "Number of Visible People in a Queue",
    "Hard",
    "number-of-visible-people-in-a-queue"
  ],
  "2076": [
    "Sum of Digits of String After Convert",
    "Easy",
    "sum-of-digits-of-string-after-convert"
  ],
  "2077": [
    "Largest Number After Mutating Substring",
    "Medium",
    "largest-number-after-mutating-substring"
  ],
  "2078": [
    "Maximum Compatibility Score Sum",
    "Medium",
    "maximum-compatibility-score-sum"
  ],
  "2079": [
    "Delete Duplicate Folders in System",
    "Hard",
    "delete-duplicate-folders-in-system"
  ],
  "2097": [
    "Strong Friendship",
    "Medium",
    "strong-friendship"
  ],
  "2072": [
    "Maximum of Minimum Values in All Subarrays",
    "Medium",
    "maximum-of-minimum-values-in-all-subarrays"
  ],
  "2098": [
    "All the Pairs With the Maximum Number of Common Followers",
    "Medium",
    "all-the-pairs-with-the-maximum-number-of-common-followers"
  ],
  "2083": [
    "Three Divisors",
    "Easy",
    "three-divisors"
  ],
  "2084": [
    "Maximum Number of Weeks for Which You Can Work",
    "Medium",
    "maximum-number-of-weeks-for-which-you-can-work"
  ],
  "1295": [
    "Minimum Garden Perimeter to Collect Enough Apples",
    "Medium",
    "minimum-garden-perimeter-to-collect-enough-apples"
  ],
  "2086": [
    "Count Number of Special Subsequences",
    "Hard",
    "count-number-of-special-subsequences"
  ],
  "2073": [
    "Minimum Time For K Virus Variants to Spread",
    "Hard",
    "minimum-time-for-k-virus-variants-to-spread"
  ],
  "1302": [
    "Delete Characters to Make Fancy String",
    "Easy",
    "delete-characters-to-make-fancy-string"
  ],
  "2080": [
    "Check if Move is Legal",
    "Medium",
    "check-if-move-is-legal"
  ],
  "2081": [
    "Minimum Total Space Wasted With K Resizing Operations",
    "Medium",
    "minimum-total-space-wasted-with-k-resizing-operations"
  ],
  "1336": [
    "Maximum Product of the Length of Two Palindromic Substrings",
    "Hard",
    "maximum-product-of-the-length-of-two-palindromic-substrings"
  ],
  "2093": [
    "Check If String Is a Prefix of Array",
    "Easy",
    "check-if-string-is-a-prefix-of-array"
  ],
  "2094": [
    "Remove Stones to Minimize the Total",
    "Medium",
    "remove-stones-to-minimize-the-total"
  ],
  "2095": [
    "Minimum Number of Swaps to Make the String Balanced",
    "Medium",
    "minimum-number-of-swaps-to-make-the-string-balanced"
  ],
  "2096": [
    "Find the Longest Valid Obstacle Course at Each Position",
    "Hard",
    "find-the-longest-valid-obstacle-course-at-each-position"
  ],
  "2110": [
    "Employees With Missing Information",
    "Easy",
    "employees-with-missing-information"
  ],
  "2111": [
    "Binary Searchable Numbers in an Unsorted Array",
    "Medium",
    "binary-searchable-numbers-in-an-unsorted-array"
  ],
  "2099": [
    "Number of Strings That Appear as Substrings in Word",
    "Easy",
    "number-of-strings-that-appear-as-substrings-in-word"
  ],
  "2085": [
    "Array With Elements Not Equal to Average of Neighbors",
    "Medium",
    "array-with-elements-not-equal-to-average-of-neighbors"
  ],
  "2100": [
    "Minimum Non-Zero Product of the Array Elements",
    "Medium",
    "minimum-non-zero-product-of-the-array-elements"
  ],
  "2101": [
    "Last Day Where You Can Still Cross",
    "Hard",
    "last-day-where-you-can-still-cross"
  ],
  "2121": [
    "Find if Path Exists in Graph",
    "Easy",
    "find-if-path-exists-in-graph"
  ],
  "2120": [
    "First and Last Call On the Same Day",
    "Hard",
    "first-and-last-call-on-the-same-day"
  ],
  "2126": [
    "Count Nodes Equal to Sum of Descendants",
    "Medium",
    "count-nodes-equal-to-sum-of-descendants"
  ],
  "2088": [
    "Minimum Time to Type Word Using Special Typewriter",
    "Easy",
    "minimum-time-to-type-word-using-special-typewriter"
  ],
  "2089": [
    "Maximum Matrix Sum",
    "Medium",
    "maximum-matrix-sum"
  ],
  "2090": [
    "Number of Ways to Arrive at Destination",
    "Medium",
    "number-of-ways-to-arrive-at-destination"
  ],
  "2091": [
    "Number of Ways to Separate Numbers",
    "Hard",
    "number-of-ways-to-separate-numbers"
  ],
  "2127": [
    "Employees Whose Manager Left the Company",
    "Easy",
    "employees-whose-manager-left-the-company"
  ],
  "2106": [
    "Find Greatest Common Divisor of Array",
    "Easy",
    "find-greatest-common-divisor-of-array"
  ],
  "2107": [
    "Find Unique Binary String",
    "Medium",
    "find-unique-binary-string"
  ],
  "2108": [
    "Minimize the Difference Between Target and Chosen Elements",
    "Medium",
    "minimize-the-difference-between-target-and-chosen-elements"
  ],
  "2109": [
    "Find Array Given Subset Sums",
    "Hard",
    "find-array-given-subset-sums"
  ],
  "519": [
    "Widest Pair of Indices With Equal Range Sum",
    "Medium",
    "widest-pair-of-indices-with-equal-range-sum"
  ],
  "2112": [
    "Minimum Difference Between Highest and Lowest of K Scores",
    "Easy",
    "minimum-difference-between-highest-and-lowest-of-k-scores"
  ],
  "2113": [
    "Find the Kth Largest Integer in the Array",
    "Medium",
    "find-the-kth-largest-integer-in-the-array"
  ],
  "2114": [
    "Minimum Number of Work Sessions to Finish the Tasks",
    "Medium",
    "minimum-number-of-work-sessions-to-finish-the-tasks"
  ],
  "2115": [
    "Number of Unique Good Subsequences",
    "Hard",
    "number-of-unique-good-subsequences"
  ],
  "2136": [
    "Find Cutoff Score for Each School",
    "Medium",
    "find-cutoff-score-for-each-school"
  ],
  "1979": [
    "Maximum Number of People That Can Be Caught in Tag",
    "Medium",
    "maximum-number-of-people-that-can-be-caught-in-tag"
  ],
  "2143": [
    "Count the Number of Experiments",
    "Medium",
    "count-the-number-of-experiments"
  ],
  "2102": [
    "Find the Middle Index in Array",
    "Easy",
    "find-the-middle-index-in-array"
  ],
  "2103": [
    "Find All Groups of Farmland",
    "Medium",
    "find-all-groups-of-farmland"
  ],
  "2104": [
    "Operations on Tree",
    "Medium",
    "operations-on-tree"
  ],
  "2105": [
    "The Number of Good Subsets",
    "Hard",
    "the-number-of-good-subsets"
  ],
  "2122": [
    "Count Special Quadruplets",
    "Easy",
    "count-special-quadruplets"
  ],
  "2123": [
    "The Number of Weak Characters in the Game",
    "Medium",
    "the-number-of-weak-characters-in-the-game"
  ],
  "2124": [
    "First Day Where You Have Been in All the Rooms",
    "Medium",
    "first-day-where-you-have-been-in-all-the-rooms"
  ],
  "2125": [
    "GCD Sort of an Array",
    "Hard",
    "gcd-sort-of-an-array"
  ],
  "2141": [
    "Smallest Greater Multiple Made of Two Digits",
    "Medium",
    "smallest-greater-multiple-made-of-two-digits"
  ],
  "2128": [
    "Reverse Prefix of Word",
    "Easy",
    "reverse-prefix-of-word"
  ],
  "2129": [
    "Number of Pairs of Interchangeable Rectangles",
    "Medium",
    "number-of-pairs-of-interchangeable-rectangles"
  ],
  "2130": [
    "Maximum Product of the Length of Two Palindromic Subsequences",
    "Medium",
    "maximum-product-of-the-length-of-two-palindromic-subsequences"
  ],
  "2131": [
    "Smallest Missing Genetic Value in Each Subtree",
    "Hard",
    "smallest-missing-genetic-value-in-each-subtree"
  ],
  "2152": [
    "The Number of Seniors and Juniors to Join the Company",
    "Hard",
    "the-number-of-seniors-and-juniors-to-join-the-company"
  ],
  "2153": [
    "Subtree Removal Game with Fibonacci Tree",
    "Hard",
    "subtree-removal-game-with-fibonacci-tree"
  ],
  "2116": [
    "Count Number of Pairs With Absolute Difference K",
    "Easy",
    "count-number-of-pairs-with-absolute-difference-k"
  ],
  "2117": [
    "Find Original Array From Doubled Array",
    "Medium",
    "find-original-array-from-doubled-array"
  ],
  "2118": [
    "Maximum Earnings From Taxi",
    "Medium",
    "maximum-earnings-from-taxi"
  ],
  "2119": [
    "Minimum Number of Operations to Make Array Continuous",
    "Hard",
    "minimum-number-of-operations-to-make-array-continuous"
  ],
  "2158": [
    "The Number of Seniors and Juniors to Join the Company II",
    "Hard",
    "the-number-of-seniors-and-juniors-to-join-the-company-ii"
  ],
  "2137": [
    "Final Value of Variable After Performing Operations",
    "Easy",
    "final-value-of-variable-after-performing-operations"
  ],
  "2138": [
    "Sum of Beauty in the Array",
    "Medium",
    "sum-of-beauty-in-the-array"
  ],
  "2139": [
    "Detect Squares",
    "Medium",
    "detect-squares"
  ],
  "2140": [
    "Longest Subsequence Repeated k Times",
    "Hard",
    "longest-subsequence-repeated-k-times"
  ],
  "2142": [
    "Average Height of Buildings in Each Segment",
    "Medium",
    "average-height-of-buildings-in-each-segment"
  ],
  "2144": [
    "Maximum Difference Between Increasing Elements",
    "Easy",
    "maximum-difference-between-increasing-elements"
  ],
  "2145": [
    "Grid Game",
    "Medium",
    "grid-game"
  ],
  "2146": [
    "Check if Word Can Be Placed In Crossword",
    "Medium",
    "check-if-word-can-be-placed-in-crossword"
  ],
  "2147": [
    "The Score of Students Solving Math Expression",
    "Hard",
    "the-score-of-students-solving-math-expression"
  ],
  "2167": [
    "Number of Accounts That Did Not Stream",
    "Medium",
    "number-of-accounts-that-did-not-stream"
  ],
  "2075": [
    "Brightest Position on Street",
    "Medium",
    "brightest-position-on-street"
  ],
  "2132": [
    "Convert 1D Array Into 2D Array",
    "Easy",
    "convert-1d-array-into-2d-array"
  ],
  "2133": [
    "Number of Pairs of Strings With Concatenation Equal to Target",
    "Medium",
    "number-of-pairs-of-strings-with-concatenation-equal-to-target"
  ],
  "2134": [
    "Maximize the Confusion of an Exam",
    "Medium",
    "maximize-the-confusion-of-an-exam"
  ],
  "2135": [
    "Maximum Number of Ways to Partition an Array",
    "Hard",
    "maximum-number-of-ways-to-partition-an-array"
  ],
  "2172": [
    "Low-Quality Problems",
    "Easy",
    "low-quality-problems"
  ],
  "2154": [
    "Minimum Moves to Convert String",
    "Easy",
    "minimum-moves-to-convert-string"
  ],
  "2155": [
    "Find Missing Observations",
    "Medium",
    "find-missing-observations"
  ],
  "2156": [
    "Stone Game IX",
    "Medium",
    "stone-game-ix"
  ],
  "2157": [
    "Smallest K-Length Subsequence With Occurrences of a Letter",
    "Hard",
    "smallest-k-length-subsequence-with-occurrences-of-a-letter"
  ],
  "510": [
    "Count Subarrays With More Ones Than Zeros",
    "Medium",
    "count-subarrays-with-more-ones-than-zeros"
  ],
  "2159": [
    "Two Out of Three",
    "Easy",
    "two-out-of-three"
  ],
  "2160": [
    "Minimum Operations to Make a Uni-Value Grid",
    "Medium",
    "minimum-operations-to-make-a-uni-value-grid"
  ],
  "2161": [
    "Stock Price Fluctuation ",
    "Medium",
    "stock-price-fluctuation"
  ],
  "2162": [
    "Partition Array Into Two Arrays to Minimize Sum Difference",
    "Hard",
    "partition-array-into-two-arrays-to-minimize-sum-difference"
  ],
  "512": [
    "Maximum Alternating Subarray Sum",
    "Medium",
    "maximum-alternating-subarray-sum"
  ],
  "2148": [
    "Minimum Number of Moves to Seat Everyone",
    "Easy",
    "minimum-number-of-moves-to-seat-everyone"
  ],
  "2149": [
    "Remove Colored Pieces if Both Neighbors are the Same Color",
    "Medium",
    "remove-colored-pieces-if-both-neighbors-are-the-same-color"
  ],
  "2151": [
    "The Time When the Network Becomes Idle",
    "Medium",
    "the-time-when-the-network-becomes-idle"
  ],
  "2150": [
    "Kth Smallest Product of Two Sorted Arrays",
    "Hard",
    "kth-smallest-product-of-two-sorted-arrays"
  ],
  "2185": [
    "Accepted Candidates From the Interviews",
    "Medium",
    "accepted-candidates-from-the-interviews"
  ],
  "2168": [
    "Check if Numbers Are Ascending in a Sentence",
    "Easy",
    "check-if-numbers-are-ascending-in-a-sentence"
  ],
  "2169": [
    "Simple Bank System",
    "Medium",
    "simple-bank-system"
  ],
  "2170": [
    "Count Number of Maximum Bitwise-OR Subsets",
    "Medium",
    "count-number-of-maximum-bitwise-or-subsets"
  ],
  "2171": [
    "Second Minimum Time to Reach Destination",
    "Hard",
    "second-minimum-time-to-reach-destination"
  ],
  "1992": [
    "Sort Linked List Already Sorted Using Absolute Values",
    "Medium",
    "sort-linked-list-already-sorted-using-absolute-values"
  ],
  "2173": [
    "Number of Valid Words in a Sentence",
    "Easy",
    "number-of-valid-words-in-a-sentence"
  ],
  "2174": [
    "Next Greater Numerically Balanced Number",
    "Medium",
    "next-greater-numerically-balanced-number"
  ],
  "2175": [
    "Count Nodes With the Highest Score",
    "Medium",
    "count-nodes-with-the-highest-score"
  ],
  "2176": [
    "Parallel Courses III",
    "Hard",
    "parallel-courses-iii"
  ],
  "2194": [
    "The Category of Each Member in the Store",
    "Medium",
    "the-category-of-each-member-in-the-store"
  ],
  "2082": [
    "Minimum Cost to Separate Sentence Into Rows",
    "Medium",
    "minimum-cost-to-separate-sentence-into-rows"
  ],
  "2163": [
    "Kth Distinct String in an Array",
    "Easy",
    "kth-distinct-string-in-an-array"
  ],
  "2164": [
    "Two Best Non-Overlapping Events",
    "Medium",
    "two-best-non-overlapping-events"
  ],
  "2165": [
    "Plates Between Candles",
    "Medium",
    "plates-between-candles"
  ],
  "2166": [
    "Number of Valid Move Combinations On Chessboard",
    "Hard",
    "number-of-valid-move-combinations-on-chessboard"
  ],
  "2181": [
    "Smallest Index With Equal Value",
    "Easy",
    "smallest-index-with-equal-value"
  ],
  "2182": [
    "Find the Minimum and Maximum Number of Nodes Between Critical Points",
    "Medium",
    "find-the-minimum-and-maximum-number-of-nodes-between-critical-points"
  ],
  "2183": [
    "Minimum Operations to Convert Number",
    "Medium",
    "minimum-operations-to-convert-number"
  ],
  "2184": [
    "Check if an Original String Exists Given Two Encoded Strings",
    "Hard",
    "check-if-an-original-string-exists-given-two-encoded-strings"
  ],
  "2203": [
    "Number of Spaces Cleaning Robot Cleaned",
    "Medium",
    "number-of-spaces-cleaning-robot-cleaned"
  ],
  "2186": [
    "Count Vowel Substrings of a String",
    "Easy",
    "count-vowel-substrings-of-a-string"
  ],
  "2187": [
    "Vowels of All Substrings",
    "Medium",
    "vowels-of-all-substrings"
  ],
  "2188": [
    "Minimized Maximum of Products Distributed to Any Store",
    "Medium",
    "minimized-maximum-of-products-distributed-to-any-store"
  ],
  "2189": [
    "Maximum Path Quality of a Graph",
    "Hard",
    "maximum-path-quality-of-a-graph"
  ],
  "2208": [
    "Account Balance",
    "Medium",
    "account-balance"
  ],
  "2209": [
    "Number of Equal Count Substrings",
    "Medium",
    "number-of-equal-count-substrings"
  ],
  "2177": [
    "Check Whether Two Strings are Almost Equivalent",
    "Easy",
    "check-whether-two-strings-are-almost-equivalent"
  ],
  "2178": [
    "Walking Robot Simulation II",
    "Medium",
    "walking-robot-simulation-ii"
  ],
  "2179": [
    "Most Beautiful Item for Each Query",
    "Medium",
    "most-beautiful-item-for-each-query"
  ],
  "2180": [
    "Maximum Number of Tasks You Can Assign",
    "Hard",
    "maximum-number-of-tasks-you-can-assign"
  ],
  "2214": [
    "The Winner University",
    "Easy",
    "the-winner-university"
  ],
  "2195": [
    "Time Needed to Buy Tickets",
    "Easy",
    "time-needed-to-buy-tickets"
  ],
  "2196": [
    "Reverse Nodes in Even Length Groups",
    "Medium",
    "reverse-nodes-in-even-length-groups"
  ],
  "2197": [
    "Decode the Slanted Ciphertext",
    "Medium",
    "decode-the-slanted-ciphertext"
  ],
  "2198": [
    "Process Restricted Friend Requests",
    "Hard",
    "process-restricted-friend-requests"
  ],
  "2218": [
    "Paths in Maze That Lead to Same Room",
    "Medium",
    "paths-in-maze-that-lead-to-same-room"
  ],
  "2199": [
    "Two Furthest Houses With Different Colors",
    "Easy",
    "two-furthest-houses-with-different-colors"
  ],
  "1310": [
    "Watering Plants",
    "Medium",
    "watering-plants"
  ],
  "1294": [
    "Range Frequency Queries",
    "Medium",
    "range-frequency-queries"
  ],
  "2202": [
    "Sum of k-Mirror Numbers",
    "Hard",
    "sum-of-k-mirror-numbers"
  ],
  "2223": [
    "The Number of Rich Customers",
    "Easy",
    "the-number-of-rich-customers"
  ],
  "2225": [
    "Substrings That Begin and End With the Same Letter",
    "Medium",
    "substrings-that-begin-and-end-with-the-same-letter"
  ],
  "2224": [
    "Drop Type 1 Orders for Customers With Type 0 Orders",
    "Medium",
    "drop-type-1-orders-for-customers-with-type-0-orders"
  ],
  "2190": [
    "Count Common Words With One Occurrence",
    "Easy",
    "count-common-words-with-one-occurrence"
  ],
  "2191": [
    "Minimum Number of Food Buckets to Feed the Hamsters",
    "Medium",
    "minimum-number-of-food-buckets-to-feed-the-hamsters"
  ],
  "2192": [
    "Minimum Cost Homecoming of a Robot in a Grid",
    "Medium",
    "minimum-cost-homecoming-of-a-robot-in-a-grid"
  ],
  "2193": [
    "Count Fertile Pyramids in a Land",
    "Hard",
    "count-fertile-pyramids-in-a-land"
  ],
  "2210": [
    "Find Target Indices After Sorting Array",
    "Easy",
    "find-target-indices-after-sorting-array"
  ],
  "2211": [
    "K Radius Subarray Averages",
    "Medium",
    "k-radius-subarray-averages"
  ],
  "2212": [
    "Removing Minimum and Maximum From Array",
    "Medium",
    "removing-minimum-and-maximum-from-array"
  ],
  "2213": [
    "Find All People With Secret",
    "Hard",
    "find-all-people-with-secret"
  ],
  "2230": [
    "Minimum Cost to Reach City With Discounts",
    "Medium",
    "minimum-cost-to-reach-city-with-discounts"
  ],
  "2215": [
    "Finding 3-Digit Even Numbers",
    "Easy",
    "finding-3-digit-even-numbers"
  ],
  "2216": [
    "Delete the Middle Node of a Linked List",
    "Medium",
    "delete-the-middle-node-of-a-linked-list"
  ],
  "2217": [
    "Step-By-Step Directions From a Binary Tree Node to Another",
    "Medium",
    "step-by-step-directions-from-a-binary-tree-node-to-another"
  ],
  "2201": [
    "Valid Arrangement of Pairs",
    "Hard",
    "valid-arrangement-of-pairs"
  ],
  "2242": [
    "Subsequence of Size K With the Largest Even Sum",
    "Medium",
    "subsequence-of-size-k-with-the-largest-even-sum"
  ],
  "2204": [
    "Find Subsequence of Length K With the Largest Sum",
    "Easy",
    "find-subsequence-of-length-k-with-the-largest-sum"
  ],
  "2205": [
    "Find Good Days to Rob the Bank",
    "Medium",
    "find-good-days-to-rob-the-bank"
  ],
  "2206": [
    "Detonate the Maximum Bombs",
    "Medium",
    "detonate-the-maximum-bombs"
  ],
  "2207": [
    "Sequentially Ordinal Rank Tracker",
    "Hard",
    "sequentially-ordinal-rank-tracker"
  ],
  "2226": [
    "Rings and Rods",
    "Easy",
    "rings-and-rods"
  ],
  "2227": [
    "Sum of Subarray Ranges",
    "Medium",
    "sum-of-subarray-ranges"
  ],
  "2228": [
    "Watering Plants II",
    "Medium",
    "watering-plants-ii"
  ],
  "2229": [
    "Maximum Fruits Harvested After at Most K Steps",
    "Hard",
    "maximum-fruits-harvested-after-at-most-k-steps"
  ],
  "2247": [
    "Number of Unique Flavors After Sharing K Candies",
    "Medium",
    "number-of-unique-flavors-after-sharing-k-candies"
  ],
  "2231": [
    "Find First Palindromic String in the Array",
    "Easy",
    "find-first-palindromic-string-in-the-array"
  ],
  "2232": [
    "Adding Spaces to a String",
    "Medium",
    "adding-spaces-to-a-string"
  ],
  "2233": [
    "Number of Smooth Descent Periods of a Stock",
    "Medium",
    "number-of-smooth-descent-periods-of-a-stock"
  ],
  "2234": [
    "Minimum Operations to Make the Array K-Increasing",
    "Hard",
    "minimum-operations-to-make-the-array-k-increasing"
  ],
  "2252": [
    "The Airport With the Most Traffic",
    "Medium",
    "the-airport-with-the-most-traffic"
  ],
  "2258": [
    "Elements in Array After Removing and Replacing Elements",
    "Medium",
    "elements-in-array-after-removing-and-replacing-elements"
  ],
  "2219": [
    "Maximum Number of Words Found in Sentences",
    "Easy",
    "maximum-number-of-words-found-in-sentences"
  ],
  "2220": [
    "Find All Possible Recipes from Given Supplies",
    "Medium",
    "find-all-possible-recipes-from-given-supplies"
  ],
  "2221": [
    "Check if a Parentheses String Can Be Valid",
    "Medium",
    "check-if-a-parentheses-string-can-be-valid"
  ],
  "2222": [
    "Abbreviating the Product of a Range",
    "Hard",
    "abbreviating-the-product-of-a-range"
  ],
  "2253": [
    "Build the Equation",
    "Hard",
    "build-the-equation"
  ],
  "2238": [
    "A Number After a Double Reversal",
    "Easy",
    "a-number-after-a-double-reversal"
  ],
  "2239": [
    "Execution of All Suffix Instructions Staying in a Grid",
    "Medium",
    "execution-of-all-suffix-instructions-staying-in-a-grid"
  ],
  "2240": [
    "Intervals Between Identical Elements",
    "Medium",
    "intervals-between-identical-elements"
  ],
  "2241": [
    "Recover the Original Array",
    "Hard",
    "recover-the-original-array"
  ],
  "2259": [
    "Minimum Operations to Remove Adjacent Ones in Matrix",
    "Hard",
    "minimum-operations-to-remove-adjacent-ones-in-matrix"
  ],
  "2243": [
    "Check if All A's Appears Before All B's",
    "Easy",
    "check-if-all-as-appears-before-all-bs"
  ],
  "2244": [
    "Number of Laser Beams in a Bank",
    "Medium",
    "number-of-laser-beams-in-a-bank"
  ],
  "2245": [
    "Destroying Asteroids",
    "Medium",
    "destroying-asteroids"
  ],
  "2246": [
    "Maximum Employees to Be Invited to a Meeting",
    "Hard",
    "maximum-employees-to-be-invited-to-a-meeting"
  ],
  "2268": [
    "Remove All Ones With Row and Column Flips",
    "Medium",
    "remove-all-ones-with-row-and-column-flips"
  ],
  "2235": [
    "Capitalize the Title",
    "Easy",
    "capitalize-the-title"
  ],
  "2236": [
    "Maximum Twin Sum of a Linked List",
    "Medium",
    "maximum-twin-sum-of-a-linked-list"
  ],
  "2237": [
    "Longest Palindrome by Concatenating Two Letter Words",
    "Medium",
    "longest-palindrome-by-concatenating-two-letter-words"
  ],
  "2200": [
    "Stamping the Grid",
    "Hard",
    "stamping-the-grid"
  ],
  "2254": [
    "Check if Every Row and Column Contains All Numbers",
    "Easy",
    "check-if-every-row-and-column-contains-all-numbers"
  ],
  "2255": [
    "Minimum Swaps to Group All 1's Together II",
    "Medium",
    "minimum-swaps-to-group-all-1s-together-ii"
  ],
  "2256": [
    "Count Words Obtained After Adding a Letter",
    "Medium",
    "count-words-obtained-after-adding-a-letter"
  ],
  "2257": [
    "Earliest Possible Day of Full Bloom",
    "Hard",
    "earliest-possible-day-of-full-bloom"
  ],
  "2273": [
    "Pour Water Between Buckets to Make Water Levels Equal",
    "Medium",
    "pour-water-between-buckets-to-make-water-levels-equal"
  ],
  "2260": [
    "Divide a String Into Groups of Size k",
    "Easy",
    "divide-a-string-into-groups-of-size-k"
  ],
  "1303": [
    "Minimum Moves to Reach Target Score",
    "Medium",
    "minimum-moves-to-reach-target-score"
  ],
  "2262": [
    "Solving Questions With Brainpower",
    "Medium",
    "solving-questions-with-brainpower"
  ],
  "2263": [
    "Maximum Running Time of N Computers",
    "Hard",
    "maximum-running-time-of-n-computers"
  ],
  "2281": [
    "The Number of Passengers in Each Bus I",
    "Medium",
    "the-number-of-passengers-in-each-bus-i"
  ],
  "2282": [
    "Choose Numbers From Two Arrays in Range",
    "Hard",
    "choose-numbers-from-two-arrays-in-range"
  ],
  "2248": [
    "Minimum Cost of Buying Candies With Discount",
    "Easy",
    "minimum-cost-of-buying-candies-with-discount"
  ],
  "2249": [
    "Count the Hidden Sequences",
    "Medium",
    "count-the-hidden-sequences"
  ],
  "2250": [
    "K Highest Ranked Items Within a Price Range",
    "Medium",
    "k-highest-ranked-items-within-a-price-range"
  ],
  "2251": [
    "Number of Ways to Divide a Long Corridor",
    "Hard",
    "number-of-ways-to-divide-a-long-corridor"
  ],
  "2269": [
    "Count Elements With Strictly Smaller and Greater Elements ",
    "Easy",
    "count-elements-with-strictly-smaller-and-greater-elements"
  ],
  "2271": [
    "Rearrange Array Elements by Sign",
    "Medium",
    "rearrange-array-elements-by-sign"
  ],
  "2270": [
    "Find All Lonely Numbers in the Array",
    "Medium",
    "find-all-lonely-numbers-in-the-array"
  ],
  "2272": [
    "Maximum Good People Based on Statements",
    "Hard",
    "maximum-good-people-based-on-statements"
  ],
  "2287": [
    "Minimum Number of Lines to Cover Points",
    "Medium",
    "minimum-number-of-lines-to-cover-points"
  ],
  "2296": [
    "The Number of Passengers in Each Bus II",
    "Hard",
    "the-number-of-passengers-in-each-bus-ii"
  ],
  "2274": [
    "Keep Multiplying Found Values by Two",
    "Easy",
    "keep-multiplying-found-values-by-two"
  ],
  "2261": [
    "All Divisions With the Highest Score of a Binary Array",
    "Medium",
    "all-divisions-with-the-highest-score-of-a-binary-array"
  ],
  "2275": [
    "Find Substring With Given Hash Value",
    "Hard",
    "find-substring-with-given-hash-value"
  ],
  "2276": [
    "Groups of Strings",
    "Hard",
    "groups-of-strings"
  ],
  "2297": [
    "Amount of New Area Painted Each Day",
    "Hard",
    "amount-of-new-area-painted-each-day"
  ],
  "2302": [
    "Order Two Columns Independently",
    "Medium",
    "order-two-columns-independently"
  ],
  "2264": [
    "Minimum Sum of Four Digit Number After Splitting Digits",
    "Easy",
    "minimum-sum-of-four-digit-number-after-splitting-digits"
  ],
  "2265": [
    "Partition Array According to Given Pivot",
    "Medium",
    "partition-array-according-to-given-pivot"
  ],
  "2266": [
    "Minimum Cost to Set Cooking Time",
    "Medium",
    "minimum-cost-to-set-cooking-time"
  ],
  "2267": [
    "Minimum Difference in Sums After Removal of Elements",
    "Hard",
    "minimum-difference-in-sums-after-removal-of-elements"
  ],
  "2283": [
    "Sort Even and Odd Indices Independently",
    "Easy",
    "sort-even-and-odd-indices-independently"
  ],
  "2284": [
    "Smallest Value of the Rearranged Number",
    "Medium",
    "smallest-value-of-the-rearranged-number"
  ],
  "2285": [
    "Design Bitset",
    "Medium",
    "design-bitset"
  ],
  "2286": [
    "Minimum Time to Remove All Cars Containing Illegal Goods",
    "Hard",
    "minimum-time-to-remove-all-cars-containing-illegal-goods"
  ],
  "2303": [
    "Unique Substrings With Equal Digit Frequency",
    "Medium",
    "unique-substrings-with-equal-digit-frequency"
  ],
  "2288": [
    "Count Operations to Obtain Zero",
    "Easy",
    "count-operations-to-obtain-zero"
  ],
  "2289": [
    "Minimum Operations to Make the Array Alternating",
    "Medium",
    "minimum-operations-to-make-the-array-alternating"
  ],
  "2290": [
    "Removing Minimum Number of Magic Beans",
    "Medium",
    "removing-minimum-number-of-magic-beans"
  ],
  "2291": [
    "Maximum AND Sum of Array",
    "Hard",
    "maximum-and-sum-of-array"
  ],
  "2313": [
    "Longest Winning Streak",
    "Hard",
    "longest-winning-streak"
  ],
  "2314": [
    "Remove All Ones With Row and Column Flips II",
    "Medium",
    "remove-all-ones-with-row-and-column-flips-ii"
  ],
  "2315": [
    "The Change in Global Rankings",
    "Medium",
    "the-change-in-global-rankings"
  ],
  "2277": [
    "Count Equal and Divisible Pairs in an Array",
    "Easy",
    "count-equal-and-divisible-pairs-in-an-array"
  ],
  "2278": [
    "Find Three Consecutive Integers That Sum to a Given Number",
    "Medium",
    "find-three-consecutive-integers-that-sum-to-a-given-number"
  ],
  "2279": [
    "Maximum Split of Positive Even Integers",
    "Medium",
    "maximum-split-of-positive-even-integers"
  ],
  "2280": [
    "Count Good Triplets in an Array",
    "Hard",
    "count-good-triplets-in-an-array"
  ],
  "2298": [
    "Count Integers With Even Digit Sum",
    "Easy",
    "count-integers-with-even-digit-sum"
  ],
  "2299": [
    "Merge Nodes in Between Zeros",
    "Medium",
    "merge-nodes-in-between-zeros"
  ],
  "2300": [
    "Construct String With Repeat Limit",
    "Medium",
    "construct-string-with-repeat-limit"
  ],
  "2301": [
    "Count Array Pairs Divisible by K",
    "Hard",
    "count-array-pairs-divisible-by-k"
  ],
  "2322": [
    "Number of Ways to Build Sturdy Brick Wall",
    "Medium",
    "number-of-ways-to-build-sturdy-brick-wall"
  ],
  "2292": [
    "Counting Words With a Given Prefix",
    "Easy",
    "counting-words-with-a-given-prefix"
  ],
  "2293": [
    "Minimum Number of Steps to Make Two Strings Anagram II",
    "Medium",
    "minimum-number-of-steps-to-make-two-strings-anagram-ii"
  ],
  "2294": [
    "Minimum Time to Complete Trips",
    "Medium",
    "minimum-time-to-complete-trips"
  ],
  "2295": [
    "Minimum Time to Finish the Race",
    "Hard",
    "minimum-time-to-finish-the-race"
  ],
  "1385": [
    "Number of Ways to Build House of Cards",
    "Medium",
    "number-of-ways-to-build-house-of-cards"
  ],
  "2312": [
    "Most Frequent Number Following Key In an Array",
    "Easy",
    "most-frequent-number-following-key-in-an-array"
  ],
  "1333": [
    "Sort the Jumbled Numbers",
    "Medium",
    "sort-the-jumbled-numbers"
  ],
  "1431": [
    "All Ancestors of a Node in a Directed Acyclic Graph",
    "Medium",
    "all-ancestors-of-a-node-in-a-directed-acyclic-graph"
  ],
  "1356": [
    "Minimum Number of Moves to Make Palindrome",
    "Hard",
    "minimum-number-of-moves-to-make-palindrome"
  ],
  "2304": [
    "Cells in a Range on an Excel Sheet",
    "Easy",
    "cells-in-a-range-on-an-excel-sheet"
  ],
  "2305": [
    "Append K Integers With Minimal Sum",
    "Medium",
    "append-k-integers-with-minimal-sum"
  ],
  "2306": [
    "Create Binary Tree From Descriptions",
    "Medium",
    "create-binary-tree-from-descriptions"
  ],
  "2307": [
    "Replace Non-Coprime Numbers in Array",
    "Hard",
    "replace-non-coprime-numbers-in-array"
  ],
  "1383": [
    "Number of Single Divisor Triplets",
    "Medium",
    "number-of-single-divisor-triplets"
  ],
  "2335": [
    "Finding the Topic of Each Post",
    "Hard",
    "finding-the-topic-of-each-post"
  ],
  "2320": [
    "Find All K-Distant Indices in an Array",
    "Easy",
    "find-all-k-distant-indices-in-an-array"
  ],
  "1312": [
    "Count Artifacts That Can Be Extracted",
    "Medium",
    "count-artifacts-that-can-be-extracted"
  ],
  "1346": [
    "Maximize the Topmost Element After K Moves",
    "Medium",
    "maximize-the-topmost-element-after-k-moves"
  ],
  "2321": [
    "Minimum Weighted Subgraph With the Required Paths",
    "Hard",
    "minimum-weighted-subgraph-with-the-required-paths"
  ],
  "1347": [
    "Distance to a Cycle in Undirected Graph",
    "Hard",
    "distance-to-a-cycle-in-undirected-graph"
  ],
  "2336": [
    "The Number of Users That Are Eligible for Discount",
    "Easy",
    "the-number-of-users-that-are-eligible-for-discount"
  ],
  "2308": [
    "Divide Array Into Equal Pairs",
    "Easy",
    "divide-array-into-equal-pairs"
  ],
  "2309": [
    "Maximize Number of Subsequences in a String",
    "Medium",
    "maximize-number-of-subsequences-in-a-string"
  ],
  "2310": [
    "Minimum Operations to Halve Array Sum",
    "Medium",
    "minimum-operations-to-halve-array-sum"
  ],
  "2311": [
    "Minimum White Tiles After Covering With Carpets",
    "Hard",
    "minimum-white-tiles-after-covering-with-carpets"
  ],
  "2316": [
    "Count Hills and Valleys in an Array",
    "Easy",
    "count-hills-and-valleys-in-an-array"
  ],
  "2317": [
    "Count Collisions on a Road",
    "Medium",
    "count-collisions-on-a-road"
  ],
  "2318": [
    "Maximum Points in an Archery Competition",
    "Medium",
    "maximum-points-in-an-archery-competition"
  ],
  "2319": [
    "Longest Substring of One Repeating Character",
    "Hard",
    "longest-substring-of-one-repeating-character"
  ],
  "2354": [
    "Minimum Health to Beat Game",
    "Medium",
    "minimum-health-to-beat-game"
  ],
  "1392": [
    "Find the Difference of Two Arrays",
    "Easy",
    "find-the-difference-of-two-arrays"
  ],
  "1355": [
    "Minimum Deletions to Make Array Beautiful",
    "Medium",
    "minimum-deletions-to-make-array-beautiful"
  ],
  "1375": [
    "Find Palindrome With Fixed Length",
    "Medium",
    "find-palindrome-with-fixed-length"
  ],
  "1393": [
    "Maximum Value of K Coins From Piles",
    "Hard",
    "maximum-value-of-k-coins-from-piles"
  ],
  "2369": [
    "Maximum Sum Score of Array",
    "Medium",
    "maximum-sum-score-of-array"
  ],
  "2323": [
    "Minimum Bit Flips to Convert Number",
    "Easy",
    "minimum-bit-flips-to-convert-number"
  ],
  "2324": [
    "Find Triangular Sum of an Array",
    "Medium",
    "find-triangular-sum-of-an-array"
  ],
  "2325": [
    "Number of Ways to Select Buildings",
    "Medium",
    "number-of-ways-to-select-buildings"
  ],
  "2326": [
    "Sum of Scores of Built Strings",
    "Hard",
    "sum-of-scores-of-built-strings"
  ],
  "2345": [
    "Minimum Number of Operations to Convert Time",
    "Easy",
    "minimum-number-of-operations-to-convert-time"
  ],
  "1354": [
    "Find Players With Zero or One Losses",
    "Medium",
    "find-players-with-zero-or-one-losses"
  ],
  "1335": [
    "Maximum Candies Allocated to K Children",
    "Medium",
    "maximum-candies-allocated-to-k-children"
  ],
  "1433": [
    "Encrypt and Decrypt Strings",
    "Hard",
    "encrypt-and-decrypt-strings"
  ],
  "2370": [
    "Users With Two Purchases Within Seven Days",
    "Medium",
    "users-with-two-purchases-within-seven-days"
  ],
  "1416": [
    "Check if an Array Is Consecutive",
    "Easy",
    "check-if-an-array-is-consecutive"
  ],
  "2371": [
    "The Users That Are Eligible for Discount",
    "Easy",
    "the-users-that-are-eligible-for-discount"
  ],
  "2327": [
    "Largest Number After Digit Swaps by Parity",
    "Easy",
    "largest-number-after-digit-swaps-by-parity"
  ],
  "2328": [
    "Minimize Result by Adding Parentheses to Expression",
    "Medium",
    "minimize-result-by-adding-parentheses-to-expression"
  ],
  "2329": [
    "Maximum Product After K Increments",
    "Medium",
    "maximum-product-after-k-increments"
  ],
  "2330": [
    "Maximum Total Beauty of the Gardens",
    "Hard",
    "maximum-total-beauty-of-the-gardens"
  ],
  "2383": [
    "Add Two Integers",
    "Easy",
    "add-two-integers"
  ],
  "2384": [
    "Root Equals Sum of Children",
    "Easy",
    "root-equals-sum-of-children"
  ],
  "2385": [
    "Count Positions on Street With Required Brightness",
    "Medium",
    "count-positions-on-street-with-required-brightness"
  ],
  "2376": [
    "Number of Times a Driver Was a Passenger",
    "Medium",
    "number-of-times-a-driver-was-a-passenger"
  ],
  "2350": [
    "Find Closest Number to Zero",
    "Easy",
    "find-closest-number-to-zero"
  ],
  "2351": [
    "Number of Ways to Buy Pens and Pencils",
    "Medium",
    "number-of-ways-to-buy-pens-and-pencils"
  ],
  "2352": [
    "Design an ATM Machine",
    "Medium",
    "design-an-atm-machine"
  ],
  "2353": [
    "Maximum Score of a Node Sequence",
    "Hard",
    "maximum-score-of-a-node-sequence"
  ],
  "2361": [
    "Calculate Digit Sum of a String",
    "Easy",
    "calculate-digit-sum-of-a-string"
  ],
  "2362": [
    "Minimum Rounds to Complete All Tasks",
    "Medium",
    "minimum-rounds-to-complete-all-tasks"
  ],
  "2363": [
    "Maximum Trailing Zeros in a Cornered Path",
    "Medium",
    "maximum-trailing-zeros-in-a-cornered-path"
  ],
  "2364": [
    "Longest Path With Different Adjacent Characters",
    "Hard",
    "longest-path-with-different-adjacent-characters"
  ],
  "2007": [
    "Maximum Cost of Trip With K Highways",
    "Hard",
    "maximum-cost-of-trip-with-k-highways"
  ],
  "2331": [
    "Intersection of Multiple Arrays",
    "Easy",
    "intersection-of-multiple-arrays"
  ],
  "2332": [
    "Count Lattice Points Inside a Circle",
    "Medium",
    "count-lattice-points-inside-a-circle"
  ],
  "2333": [
    "Count Number of Rectangles Containing Each Point",
    "Medium",
    "count-number-of-rectangles-containing-each-point"
  ],
  "2334": [
    "Number of Flowers in Full Bloom",
    "Hard",
    "number-of-flowers-in-full-bloom"
  ],
  "2381": [
    "Dynamic Pivoting of a Table",
    "Hard",
    "dynamic-pivoting-of-a-table"
  ],
  "2382": [
    "Dynamic Unpivoting of a Table",
    "Hard",
    "dynamic-unpivoting-of-a-table"
  ],
  "2396": [
    "Design Video Sharing Platform",
    "Hard",
    "design-video-sharing-platform"
  ],
  "2341": [
    "Count Prefixes of a Given String",
    "Easy",
    "count-prefixes-of-a-given-string"
  ],
  "2342": [
    "Minimum Average Difference",
    "Medium",
    "minimum-average-difference"
  ],
  "2343": [
    "Count Unguarded Cells in the Grid",
    "Medium",
    "count-unguarded-cells-in-the-grid"
  ],
  "2344": [
    "Escape the Spreading Fire",
    "Hard",
    "escape-the-spreading-fire"
  ],
  "2337": [
    "Remove Digit From Number to Maximize Result",
    "Easy",
    "remove-digit-from-number-to-maximize-result"
  ],
  "2338": [
    "Minimum Consecutive Cards to Pick Up",
    "Medium",
    "minimum-consecutive-cards-to-pick-up"
  ],
  "2339": [
    "K Divisible Elements Subarrays",
    "Medium",
    "k-divisible-elements-subarrays"
  ],
  "2340": [
    "Total Appeal of A String",
    "Hard",
    "total-appeal-of-a-string"
  ],
  "1419": [
    "Make Array Non-decreasing or Non-increasing",
    "Hard",
    "make-array-non-decreasing-or-non-increasing"
  ],
  "2346": [
    "Largest 3-Same-Digit Number in String",
    "Easy",
    "largest-3-same-digit-number-in-string"
  ],
  "2347": [
    "Count Nodes Equal to Average of Subtree",
    "Medium",
    "count-nodes-equal-to-average-of-subtree"
  ],
  "2348": [
    "Count Number of Texts",
    "Medium",
    "count-number-of-texts"
  ],
  "2349": [
    " Check if There Is a Valid Parentheses String Path",
    "Hard",
    "check-if-there-is-a-valid-parentheses-string-path"
  ],
  "2405": [
    "Minimum Number of Keypresses",
    "Medium",
    "minimum-number-of-keypresses"
  ],
  "1430": [
    "Find the K-Beauty of a Number",
    "Easy",
    "find-the-k-beauty-of-a-number"
  ],
  "2358": [
    "Number of Ways to Split Array",
    "Medium",
    "number-of-ways-to-split-array"
  ],
  "2359": [
    "Maximum White Tiles Covered by a Carpet",
    "Medium",
    "maximum-white-tiles-covered-by-a-carpet"
  ],
  "2360": [
    "Substring With Largest Variance",
    "Hard",
    "substring-with-largest-variance"
  ],
  "1353": [
    "Find Resultant Array After Removing Anagrams",
    "Easy",
    "find-resultant-array-after-removing-anagrams"
  ],
  "2355": [
    "Maximum Consecutive Floors Without Special Floors",
    "Medium",
    "maximum-consecutive-floors-without-special-floors"
  ],
  "2356": [
    "Largest Combination With Bitwise AND Greater Than Zero",
    "Medium",
    "largest-combination-with-bitwise-and-greater-than-zero"
  ],
  "2357": [
    "Count Integers in Intervals",
    "Hard",
    "count-integers-in-intervals"
  ],
  "2420": [
    "Closest Node to Path in Tree",
    "Hard",
    "closest-node-to-path-in-tree"
  ],
  "2365": [
    "Percentage of Letter in String",
    "Easy",
    "percentage-of-letter-in-string"
  ],
  "2366": [
    "Maximum Bags With Full Capacity of Rocks",
    "Medium",
    "maximum-bags-with-full-capacity-of-rocks"
  ],
  "2367": [
    "Minimum Lines to Represent a Line Chart",
    "Medium",
    "minimum-lines-to-represent-a-line-chart"
  ],
  "2368": [
    "Sum of Total Strength of Wizards",
    "Hard",
    "sum-of-total-strength-of-wizards"
  ],
  "2425": [
    "Number of People That Can Be Seen in a Grid",
    "Medium",
    "number-of-people-that-can-be-seen-in-a-grid"
  ],
  "2377": [
    "Check if Number Has Equal Digit Count and Digit Value",
    "Easy",
    "check-if-number-has-equal-digit-count-and-digit-value"
  ],
  "2378": [
    "Sender With Largest Word Count",
    "Medium",
    "sender-with-largest-word-count"
  ],
  "2379": [
    "Maximum Total Importance of Roads",
    "Medium",
    "maximum-total-importance-of-roads"
  ],
  "2380": [
    "Booking Concert Tickets in Groups",
    "Hard",
    "booking-concert-tickets-in-groups"
  ],
  "2372": [
    "Rearrange Characters to Make Target String",
    "Easy",
    "rearrange-characters-to-make-target-string"
  ],
  "2373": [
    "Apply Discount to Prices",
    "Medium",
    "apply-discount-to-prices"
  ],
  "2374": [
    "Steps to Make Array Non-decreasing",
    "Medium",
    "steps-to-make-array-non-decreasing"
  ],
  "2375": [
    "Minimum Obstacle Removal to Reach Corner",
    "Hard",
    "minimum-obstacle-removal-to-reach-corner"
  ],
  "2426": [
    "Maximum Profit From Trading Stocks",
    "Medium",
    "maximum-profit-from-trading-stocks"
  ],
  "2431": [
    "Products With Three or More Orders in Two Consecutive Years",
    "Medium",
    "products-with-three-or-more-orders-in-two-consecutive-years"
  ],
  "2386": [
    "Min Max Game",
    "Easy",
    "min-max-game"
  ],
  "2387": [
    "Partition Array Such That Maximum Difference Is K",
    "Medium",
    "partition-array-such-that-maximum-difference-is-k"
  ],
  "2388": [
    "Replace Elements in an Array",
    "Medium",
    "replace-elements-in-an-array"
  ],
  "2389": [
    "Design a Text Editor",
    "Hard",
    "design-a-text-editor"
  ],
  "2056": [
    "Jump Game VIII",
    "Medium",
    "jump-game-viii"
  ],
  "2440": [
    "Tasks Count in the Weekend",
    "Medium",
    "tasks-count-in-the-weekend"
  ],
  "2391": [
    "Strong Password Checker II",
    "Easy",
    "strong-password-checker-ii"
  ],
  "2392": [
    "Successful Pairs of Spells and Potions",
    "Medium",
    "successful-pairs-of-spells-and-potions"
  ],
  "2393": [
    "Match Substring After Replacement",
    "Hard",
    "match-substring-after-replacement"
  ],
  "2394": [
    "Count Subarrays With Score Less Than K",
    "Hard",
    "count-subarrays-with-score-less-than-k"
  ],
  "1382": [
    "Calculate Amount Paid in Taxes",
    "Easy",
    "calculate-amount-paid-in-taxes"
  ],
  "1394": [
    "Minimum Path Cost in a Grid",
    "Medium",
    "minimum-path-cost-in-a-grid"
  ],
  "1418": [
    "Fair Distribution of Cookies",
    "Medium",
    "fair-distribution-of-cookies"
  ],
  "2390": [
    "Naming a Company",
    "Hard",
    "naming-a-company"
  ],
  "2065": [
    "Check for Contradictions in Equations",
    "Hard",
    "check-for-contradictions-in-equations"
  ],
  "2441": [
    "Arrange Table by Gender",
    "Medium",
    "arrange-table-by-gender"
  ],
  "1363": [
    "Greatest English Letter in Upper and Lower Case",
    "Easy",
    "greatest-english-letter-in-upper-and-lower-case"
  ],
  "1334": [
    "Sum of Numbers With Units Digit K",
    "Medium",
    "sum-of-numbers-with-units-digit-k"
  ],
  "2395": [
    "Longest Binary Subsequence Less Than or Equal to K",
    "Medium",
    "longest-binary-subsequence-less-than-or-equal-to-k"
  ],
  "1376": [
    "Selling Pieces of Wood",
    "Hard",
    "selling-pieces-of-wood"
  ],
  "2399": [
    "Minimum Flips in Binary Tree to Get Result",
    "Hard",
    "minimum-flips-in-binary-tree-to-get-result"
  ],
  "2446": [
    "The First Day of the Maximum Recorded Degree in Each City",
    "Medium",
    "the-first-day-of-the-maximum-recorded-degree-in-each-city"
  ],
  "2401": [
    "Count Asterisks",
    "Easy",
    "count-asterisks"
  ],
  "2403": [
    "Count Unreachable Pairs of Nodes in an Undirected Graph",
    "Medium",
    "count-unreachable-pairs-of-nodes-in-an-undirected-graph"
  ],
  "2402": [
    "Maximum XOR After Operations ",
    "Medium",
    "maximum-xor-after-operations"
  ],
  "2404": [
    "Number of Distinct Roll Sequences",
    "Hard",
    "number-of-distinct-roll-sequences"
  ],
  "2398": [
    "Check if Matrix Is X-Matrix",
    "Easy",
    "check-if-matrix-is-x-matrix"
  ],
  "2397": [
    "Count Number of Ways to Place Houses",
    "Medium",
    "count-number-of-ways-to-place-houses"
  ],
  "1348": [
    "Maximum Score Of Spliced Array",
    "Hard",
    "maximum-score-of-spliced-array"
  ],
  "2400": [
    "Minimum Score After Removals on a Tree",
    "Hard",
    "minimum-score-after-removals-on-a-tree"
  ],
  "2458": [
    "Find Minimum Time to Finish All Jobs II",
    "Medium",
    "find-minimum-time-to-finish-all-jobs-ii"
  ],
  "2451": [
    "Product Sales Analysis IV",
    "Medium",
    "product-sales-analysis-iv"
  ],
  "2406": [
    "Decode the Message",
    "Easy",
    "decode-the-message"
  ],
  "2411": [
    "Spiral Matrix IV",
    "Medium",
    "spiral-matrix-iv"
  ],
  "2408": [
    "Number of People Aware of a Secret",
    "Medium",
    "number-of-people-aware-of-a-secret"
  ],
  "2409": [
    "Number of Increasing Paths in a Grid",
    "Hard",
    "number-of-increasing-paths-in-a-grid"
  ],
  "2452": [
    "Product Sales Analysis V",
    "Easy",
    "product-sales-analysis-v"
  ],
  "2468": [
    "Valid Palindrome IV",
    "Medium",
    "valid-palindrome-iv"
  ],
  "2416": [
    "Evaluate Boolean Binary Tree",
    "Easy",
    "evaluate-boolean-binary-tree"
  ],
  "2417": [
    "The Latest Time to Catch a Bus",
    "Medium",
    "the-latest-time-to-catch-a-bus"
  ],
  "2418": [
    "Minimum Sum of Squared Difference",
    "Medium",
    "minimum-sum-of-squared-difference"
  ],
  "2419": [
    "Subarray With Elements Greater Than Varying Threshold",
    "Hard",
    "subarray-with-elements-greater-than-varying-threshold"
  ],
  "2412": [
    "Minimum Amount of Time to Fill Cups",
    "Easy",
    "minimum-amount-of-time-to-fill-cups"
  ],
  "2413": [
    "Smallest Number in Infinite Set",
    "Medium",
    "smallest-number-in-infinite-set"
  ],
  "2414": [
    "Move Pieces to Obtain a String",
    "Medium",
    "move-pieces-to-obtain-a-string"
  ],
  "2415": [
    "Count the Number of Ideal Arrays",
    "Hard",
    "count-the-number-of-ideal-arrays"
  ],
  "2453": [
    "All the Matches of the League",
    "Easy",
    "all-the-matches-of-the-league"
  ],
  "2474": [
    "Minimum Adjacent Swaps to Make a Valid Array",
    "Medium",
    "minimum-adjacent-swaps-to-make-a-valid-array"
  ],
  "2421": [
    "Maximum Number of Pairs in Array",
    "Easy",
    "maximum-number-of-pairs-in-array"
  ],
  "2473": [
    "Max Sum of a Pair With Equal Sum of Digits",
    "Medium",
    "max-sum-of-a-pair-with-equal-sum-of-digits"
  ],
  "2422": [
    "Query Kth Smallest Trimmed Number",
    "Medium",
    "query-kth-smallest-trimmed-number"
  ],
  "2423": [
    "Minimum Deletions to Make Array Divisible",
    "Hard",
    "minimum-deletions-to-make-array-divisible"
  ],
  "2485": [
    "Finding the Number of Visible Mountains",
    "Medium",
    "finding-the-number-of-visible-mountains"
  ],
  "2484": [
    "Compute the Rank as a Percentage",
    "Medium",
    "compute-the-rank-as-a-percentage"
  ],
  "2433": [
    "Best Poker Hand",
    "Easy",
    "best-poker-hand"
  ],
  "2432": [
    "Number of Zero-Filled Subarrays",
    "Medium",
    "number-of-zero-filled-subarrays"
  ],
  "2434": [
    "Design a Number Container System",
    "Medium",
    "design-a-number-container-system"
  ],
  "2435": [
    "Shortest Impossible Sequence of Rolls",
    "Hard",
    "shortest-impossible-sequence-of-rolls"
  ],
  "2427": [
    "First Letter to Appear Twice",
    "Easy",
    "first-letter-to-appear-twice"
  ],
  "2428": [
    "Equal Row and Column Pairs",
    "Medium",
    "equal-row-and-column-pairs"
  ],
  "2429": [
    "Design a Food Rating System",
    "Medium",
    "design-a-food-rating-system"
  ],
  "2430": [
    "Number of Excellent Pairs",
    "Hard",
    "number-of-excellent-pairs"
  ],
  "2490": [
    "Maximum Number of Books You Can Take",
    "Hard",
    "maximum-number-of-books-you-can-take"
  ],
  "2495": [
    "Number of Unique Subjects Taught by Each Teacher",
    "Easy",
    "number-of-unique-subjects-taught-by-each-teacher"
  ],
  "2436": [
    "Make Array Zero by Subtracting Equal Amounts",
    "Easy",
    "make-array-zero-by-subtracting-equal-amounts"
  ],
  "2437": [
    "Maximum Number of Groups Entering a Competition",
    "Medium",
    "maximum-number-of-groups-entering-a-competition"
  ],
  "2438": [
    "Find Closest Node to Given Two Nodes",
    "Medium",
    "find-closest-node-to-given-two-nodes"
  ],
  "2439": [
    "Longest Cycle in a Graph",
    "Hard",
    "longest-cycle-in-a-graph"
  ],
  "2500": [
    "Minimum Costs Using the Train Line",
    "Hard",
    "minimum-costs-using-the-train-line"
  ],
  "2501": [
    "Generate the Invoice",
    "Hard",
    "generate-the-invoice"
  ],
  "2447": [
    "Merge Similar Items",
    "Easy",
    "merge-similar-items"
  ],
  "2448": [
    "Count Number of Bad Pairs",
    "Medium",
    "count-number-of-bad-pairs"
  ],
  "2483": [
    "Task Scheduler II",
    "Medium",
    "task-scheduler-ii"
  ],
  "2450": [
    "Minimum Replacements to Sort the Array",
    "Hard",
    "minimum-replacements-to-sort-the-array"
  ],
  "2442": [
    "Number of Arithmetic Triplets",
    "Easy",
    "number-of-arithmetic-triplets"
  ],
  "2445": [
    "Reachable Nodes With Restrictions",
    "Medium",
    "reachable-nodes-with-restrictions"
  ],
  "2443": [
    "Check if There is a Valid Partition For The Array",
    "Medium",
    "check-if-there-is-a-valid-partition-for-the-array"
  ],
  "2444": [
    "Longest Ideal Subsequence",
    "Medium",
    "longest-ideal-subsequence"
  ],
  "2506": [
    "Minimize Maximum Value in a Grid",
    "Hard",
    "minimize-maximum-value-in-a-grid"
  ],
  "2515": [
    "Calculate the Influence of Each Salesperson",
    "Medium",
    "calculate-the-influence-of-each-salesperson"
  ],
  "2454": [
    "Largest Local Values in a Matrix",
    "Easy",
    "largest-local-values-in-a-matrix"
  ],
  "2455": [
    "Node With Highest Edge Score",
    "Medium",
    "node-with-highest-edge-score"
  ],
  "2456": [
    "Construct Smallest Number From DI String",
    "Medium",
    "construct-smallest-number-from-di-string"
  ],
  "2457": [
    "Count Special Integers",
    "Hard",
    "count-special-integers"
  ],
  "2516": [
    "Sort the Olympic Table",
    "Easy",
    "sort-the-olympic-table"
  ],
  "2517": [
    "Choose Edges to Maximize Score in a Tree",
    "Medium",
    "choose-edges-to-maximize-score-in-a-tree"
  ],
  "2463": [
    "Minimum Recolors to Get K Consecutive Black Blocks",
    "Easy",
    "minimum-recolors-to-get-k-consecutive-black-blocks"
  ],
  "2464": [
    "Time Needed to Rearrange a Binary String",
    "Medium",
    "time-needed-to-rearrange-a-binary-string"
  ],
  "2465": [
    "Shifting Letters II",
    "Medium",
    "shifting-letters-ii"
  ],
  "2466": [
    "Maximum Segment Sum After Removals",
    "Hard",
    "maximum-segment-sum-after-removals"
  ],
  "2459": [
    "Minimum Hours of Training to Win a Competition",
    "Easy",
    "minimum-hours-of-training-to-win-a-competition"
  ],
  "2475": [
    "Largest Palindromic Number",
    "Medium",
    "largest-palindromic-number"
  ],
  "2461": [
    "Amount of Time for Binary Tree to Be Infected",
    "Medium",
    "amount-of-time-for-binary-tree-to-be-infected"
  ],
  "2462": [
    "Find the K-Sum of an Array",
    "Hard",
    "find-the-k-sum-of-an-array"
  ],
  "2522": [
    "Median of a Row Wise Sorted Matrix",
    "Medium",
    "median-of-a-row-wise-sorted-matrix"
  ],
  "2523": [
    "Change Null Values in a Table to the Previous Value",
    "Medium",
    "change-null-values-in-a-table-to-the-previous-value"
  ],
  "2469": [
    "Longest Subsequence With Limited Sum",
    "Easy",
    "longest-subsequence-with-limited-sum"
  ],
  "2470": [
    "Removing Stars From a String",
    "Medium",
    "removing-stars-from-a-string"
  ],
  "2471": [
    "Minimum Amount of Time to Collect Garbage",
    "Medium",
    "minimum-amount-of-time-to-collect-garbage"
  ],
  "2472": [
    "Build a Matrix With Conditions",
    "Hard",
    "build-a-matrix-with-conditions"
  ],
  "2535": [
    "Count Strictly Increasing Subarrays",
    "Medium",
    "count-strictly-increasing-subarrays"
  ],
  "2534": [
    "Employees With Deductions",
    "Medium",
    "employees-with-deductions"
  ],
  "2480": [
    "Find Subarrays With Equal Sum",
    "Easy",
    "find-subarrays-with-equal-sum"
  ],
  "2481": [
    "Strictly Palindromic Number",
    "Medium",
    "strictly-palindromic-number"
  ],
  "2482": [
    "Maximum Rows Covered by Columns",
    "Medium",
    "maximum-rows-covered-by-columns"
  ],
  "2449": [
    "Maximum Number of Robots Within Budget",
    "Hard",
    "maximum-number-of-robots-within-budget"
  ],
  "2476": [
    "Check Distances Between Same Letters",
    "Easy",
    "check-distances-between-same-letters"
  ],
  "2477": [
    "Number of Ways to Reach a Position After Exactly k Steps",
    "Medium",
    "number-of-ways-to-reach-a-position-after-exactly-k-steps"
  ],
  "2478": [
    "Longest Nice Subarray",
    "Medium",
    "longest-nice-subarray"
  ],
  "2479": [
    "Meeting Rooms III",
    "Hard",
    "meeting-rooms-iii"
  ],
  "2537": [
    "Minimum Time to Kill All Monsters",
    "Hard",
    "minimum-time-to-kill-all-monsters"
  ],
  "2486": [
    "Most Frequent Even Element",
    "Easy",
    "most-frequent-even-element"
  ],
  "2487": [
    "Optimal Partition of String",
    "Medium",
    "optimal-partition-of-string"
  ],
  "2488": [
    "Divide Intervals Into Minimum Number of Groups",
    "Medium",
    "divide-intervals-into-minimum-number-of-groups"
  ],
  "2526": [
    "Longest Increasing Subsequence II",
    "Hard",
    "longest-increasing-subsequence-ii"
  ],
  "2555": [
    "Design SQL",
    "Medium",
    "design-sql"
  ],
  "2496": [
    "Count Days Spent Together",
    "Easy",
    "count-days-spent-together"
  ],
  "2497": [
    "Maximum Matching of Players With Trainers",
    "Medium",
    "maximum-matching-of-players-with-trainers"
  ],
  "2498": [
    "Smallest Subarrays With Maximum Bitwise OR",
    "Medium",
    "smallest-subarrays-with-maximum-bitwise-or"
  ],
  "2499": [
    "Minimum Money Required Before Transactions",
    "Hard",
    "minimum-money-required-before-transactions"
  ],
  "2491": [
    "Smallest Even Multiple",
    "Easy",
    "smallest-even-multiple"
  ],
  "2492": [
    "Length of the Longest Alphabetical Continuous Substring",
    "Medium",
    "length-of-the-longest-alphabetical-continuous-substring"
  ],
  "2493": [
    "Reverse Odd Levels of Binary Tree",
    "Medium",
    "reverse-odd-levels-of-binary-tree"
  ],
  "2494": [
    "Sum of Prefix Scores of Strings",
    "Hard",
    "sum-of-prefix-scores-of-strings"
  ],
  "2560": [
    "Closest Fair Integer",
    "Medium",
    "closest-fair-integer"
  ],
  "2502": [
    "Sort the People",
    "Easy",
    "sort-the-people"
  ],
  "2503": [
    "Longest Subarray With Maximum Bitwise AND",
    "Medium",
    "longest-subarray-with-maximum-bitwise-and"
  ],
  "2504": [
    "Find All Good Indices",
    "Medium",
    "find-all-good-indices"
  ],
  "2505": [
    "Number of Good Paths",
    "Hard",
    "number-of-good-paths"
  ],
  "2565": [
    "Merge Operations to Turn Array Into a Palindrome",
    "Medium",
    "merge-operations-to-turn-array-into-a-palindrome"
  ],
  "2532": [
    "Remove Letter To Equalize Frequency",
    "Easy",
    "remove-letter-to-equalize-frequency"
  ],
  "2512": [
    "Longest Uploaded Prefix",
    "Medium",
    "longest-uploaded-prefix"
  ],
  "2533": [
    "Bitwise XOR of All Pairings",
    "Medium",
    "bitwise-xor-of-all-pairings"
  ],
  "2513": [
    "Number of Pairs Satisfying Inequality",
    "Hard",
    "number-of-pairs-satisfying-inequality"
  ],
  "2507": [
    "Number of Common Factors",
    "Easy",
    "number-of-common-factors"
  ],
  "2508": [
    "Maximum Sum of an Hourglass",
    "Medium",
    "maximum-sum-of-an-hourglass"
  ],
  "2509": [
    "Minimize XOR",
    "Medium",
    "minimize-xor"
  ],
  "2510": [
    "Maximum Deletions on a String",
    "Hard",
    "maximum-deletions-on-a-string"
  ],
  "2570": [
    "Maximize Total Tastiness of Purchased Fruits",
    "Medium",
    "maximize-total-tastiness-of-purchased-fruits"
  ],
  "2518": [
    "The Employee That Worked on the Longest Task",
    "Easy",
    "the-employee-that-worked-on-the-longest-task"
  ],
  "2519": [
    "Find The Original Array of Prefix Xor",
    "Medium",
    "find-the-original-array-of-prefix-xor"
  ],
  "2520": [
    "Using a Robot to Print the Lexicographically Smallest String",
    "Medium",
    "using-a-robot-to-print-the-lexicographically-smallest-string"
  ],
  "2521": [
    "Paths in Matrix Whose Sum Is Divisible by K",
    "Hard",
    "paths-in-matrix-whose-sum-is-divisible-by-k"
  ],
  "2579": [
    "Minimum Split Into Subarrays With GCD Greater Than One",
    "Medium",
    "minimum-split-into-subarrays-with-gcd-greater-than-one"
  ],
  "2528": [
    "Number of Valid Clock Times",
    "Easy",
    "number-of-valid-clock-times"
  ],
  "2529": [
    "Range Product Queries of Powers",
    "Medium",
    "range-product-queries-of-powers"
  ],
  "2530": [
    "Minimize Maximum of Array",
    "Medium",
    "minimize-maximum-of-array"
  ],
  "2531": [
    "Create Components With Same Value",
    "Hard",
    "create-components-with-same-value"
  ],
  "2524": [
    "Largest Positive Integer That Exists With Its Negative",
    "Easy",
    "largest-positive-integer-that-exists-with-its-negative"
  ],
  "2525": [
    "Count Number of Distinct Integers After Reverse Operations",
    "Medium",
    "count-number-of-distinct-integers-after-reverse-operations"
  ],
  "2541": [
    "Sum of Number and Its Reverse",
    "Medium",
    "sum-of-number-and-its-reverse"
  ],
  "2527": [
    "Count Subarrays With Fixed Bounds",
    "Hard",
    "count-subarrays-with-fixed-bounds"
  ],
  "2584": [
    "Number of Nodes With Value One",
    "Medium",
    "number-of-nodes-with-value-one"
  ],
  "2536": [
    "Determine if Two Events Have Conflict",
    "Easy",
    "determine-if-two-events-have-conflict"
  ],
  "2546": [
    "Number of Subarrays With GCD Equal to K",
    "Medium",
    "number-of-subarrays-with-gcd-equal-to-k"
  ],
  "2538": [
    "Minimum Cost to Make Array Equal",
    "Hard",
    "minimum-cost-to-make-array-equal"
  ],
  "2539": [
    "Minimum Number of Operations to Make Arrays Similar",
    "Hard",
    "minimum-number-of-operations-to-make-arrays-similar"
  ],
  "2593": [
    "Number of Distinct Binary Strings After Applying Operations",
    "Medium",
    "number-of-distinct-binary-strings-after-applying-operations"
  ],
  "2547": [
    "Odd String Difference",
    "Easy",
    "odd-string-difference"
  ],
  "2550": [
    "Words Within Two Edits of Dictionary",
    "Medium",
    "words-within-two-edits-of-dictionary"
  ],
  "2548": [
    "Destroy Sequential Targets",
    "Medium",
    "destroy-sequential-targets"
  ],
  "2549": [
    "Next Greater Element IV",
    "Hard",
    "next-greater-element-iv"
  ],
  "2542": [
    "Average Value of Even Numbers That Are Divisible by Three",
    "Easy",
    "average-value-of-even-numbers-that-are-divisible-by-three"
  ],
  "2543": [
    "Most Popular Video Creator",
    "Medium",
    "most-popular-video-creator"
  ],
  "2544": [
    "Minimum Addition to Make Integer Beautiful",
    "Medium",
    "minimum-addition-to-make-integer-beautiful"
  ],
  "2545": [
    "Height of Binary Tree After Subtree Removal Queries",
    "Hard",
    "height-of-binary-tree-after-subtree-removal-queries"
  ],
  "2489": [
    "Sort Array by Moving Items to Empty Space",
    "Hard",
    "sort-array-by-moving-items-to-empty-space"
  ],
  "2551": [
    "Apply Operations to an Array",
    "Easy",
    "apply-operations-to-an-array"
  ],
  "2552": [
    "Maximum Sum of Distinct Subarrays With Length K",
    "Medium",
    "maximum-sum-of-distinct-subarrays-with-length-k"
  ],
  "2553": [
    "Total Cost to Hire K Workers",
    "Medium",
    "total-cost-to-hire-k-workers"
  ],
  "2554": [
    "Minimum Total Distance Traveled",
    "Hard",
    "minimum-total-distance-traveled"
  ],
  "2607": [
    "Minimum Subarrays in a Valid Split",
    "Medium",
    "minimum-subarrays-in-a-valid-split"
  ],
  "2561": [
    "Number of Distinct Averages",
    "Easy",
    "number-of-distinct-averages"
  ],
  "2562": [
    "Count Ways To Build Good Strings",
    "Medium",
    "count-ways-to-build-good-strings"
  ],
  "2564": [
    "Most Profitable Path in a Tree",
    "Medium",
    "most-profitable-path-in-a-tree"
  ],
  "2563": [
    "Split Message Based on Limit",
    "Hard",
    "split-message-based-on-limit"
  ],
  "2556": [
    "Convert the Temperature",
    "Easy",
    "convert-the-temperature"
  ],
  "2557": [
    "Number of Subarrays With LCM Equal to K",
    "Medium",
    "number-of-subarrays-with-lcm-equal-to-k"
  ],
  "2558": [
    "Minimum Number of Operations to Sort a Binary Tree by Level",
    "Medium",
    "minimum-number-of-operations-to-sort-a-binary-tree-by-level"
  ],
  "2559": [
    "Maximum Number of Non-overlapping Palindrome Substrings",
    "Hard",
    "maximum-number-of-non-overlapping-palindrome-substrings"
  ],
  "2612": [
    "Minimum Cost to Buy Apples",
    "Medium",
    "minimum-cost-to-buy-apples"
  ],
  "2613": [
    "Customers With Strictly Increasing Purchases",
    "Hard",
    "customers-with-strictly-increasing-purchases"
  ],
  "2566": [
    "Number of Unequal Triplets in Array",
    "Easy",
    "number-of-unequal-triplets-in-array"
  ],
  "2567": [
    "Closest Nodes Queries in a Binary Search Tree",
    "Medium",
    "closest-nodes-queries-in-a-binary-search-tree"
  ],
  "2568": [
    "Minimum Fuel Cost to Report to the Capital",
    "Medium",
    "minimum-fuel-cost-to-report-to-the-capital"
  ],
  "2569": [
    "Number of Beautiful Partitions",
    "Hard",
    "number-of-beautiful-partitions"
  ],
  "2623": [
    "Maximum XOR of Two Non-Overlapping Subtrees",
    "Hard",
    "maximum-xor-of-two-non-overlapping-subtrees"
  ],
  "2622": [
    "Form a Chemical Bond",
    "Easy",
    "form-a-chemical-bond"
  ],
  "2575": [
    "Minimum Cuts to Divide a Circle",
    "Easy",
    "minimum-cuts-to-divide-a-circle"
  ],
  "2606": [
    "Difference Between Ones and Zeros in Row and Column",
    "Medium",
    "difference-between-ones-and-zeros-in-row-and-column"
  ],
  "2576": [
    "Minimum Penalty for a Shop",
    "Medium",
    "minimum-penalty-for-a-shop"
  ],
  "2577": [
    "Count Palindromic Subsequences",
    "Hard",
    "count-palindromic-subsequences"
  ],
  "2571": [
    "Find the Pivot Integer",
    "Easy",
    "find-the-pivot-integer"
  ],
  "2572": [
    "Append Characters to String to Make Subsequence",
    "Medium",
    "append-characters-to-string-to-make-subsequence"
  ],
  "2573": [
    "Remove Nodes From Linked List",
    "Medium",
    "remove-nodes-from-linked-list"
  ],
  "2574": [
    "Count Subarrays With Median K",
    "Hard",
    "count-subarrays-with-median-k"
  ],
  "2629": [
    "Number of Substrings With Fixed Ratio",
    "Medium",
    "number-of-substrings-with-fixed-ratio"
  ],
  "2580": [
    "Circular Sentence",
    "Easy",
    "circular-sentence"
  ],
  "2581": [
    "Divide Players Into Teams of Equal Skill",
    "Medium",
    "divide-players-into-teams-of-equal-skill"
  ],
  "2582": [
    "Minimum Score of a Path Between Two Cities",
    "Medium",
    "minimum-score-of-a-path-between-two-cities"
  ],
  "2583": [
    "Divide Nodes Into the Maximum Number of Groups",
    "Hard",
    "divide-nodes-into-the-maximum-number-of-groups"
  ],
  "2637": [
    "Merge Overlapping Events in the Same Hall",
    "Hard",
    "merge-overlapping-events-in-the-same-hall"
  ],
  "2638": [
    "Number of Subarrays Having Even Product",
    "Medium",
    "number-of-subarrays-having-even-product"
  ],
  "2589": [
    "Maximum Value of a String in an Array",
    "Easy",
    "maximum-value-of-a-string-in-an-array"
  ],
  "2590": [
    "Maximum Star Sum of a Graph",
    "Medium",
    "maximum-star-sum-of-a-graph"
  ],
  "2591": [
    "Frog Jump II",
    "Medium",
    "frog-jump-ii"
  ],
  "2592": [
    "Minimum Total Cost to Make Arrays Unequal",
    "Hard",
    "minimum-total-cost-to-make-arrays-unequal"
  ],
  "2585": [
    "Delete Greatest Value in Each Row",
    "Easy",
    "delete-greatest-value-in-each-row"
  ],
  "2586": [
    "Longest Square Streak in an Array",
    "Medium",
    "longest-square-streak-in-an-array"
  ],
  "2587": [
    "Design Memory Allocator",
    "Medium",
    "design-memory-allocator"
  ],
  "2588": [
    "Maximum Number of Points From Grid Queries",
    "Hard",
    "maximum-number-of-points-from-grid-queries"
  ],
  "2643": [
    "Concatenate the Name and the Profession",
    "Easy",
    "concatenate-the-name-and-the-profession"
  ],
  "2644": [
    "Bitwise OR of All Subsequence Sums",
    "Medium",
    "bitwise-or-of-all-subsequence-sums"
  ],
  "2594": [
    "Count Pairs Of Similar Strings",
    "Easy",
    "count-pairs-of-similar-strings"
  ],
  "2595": [
    "Smallest Value After Replacing With Sum of Prime Factors",
    "Medium",
    "smallest-value-after-replacing-with-sum-of-prime-factors"
  ],
  "2596": [
    "Add Edges to Make Degrees of All Nodes Even",
    "Hard",
    "add-edges-to-make-degrees-of-all-nodes-even"
  ],
  "2597": [
    "Cycle Length Queries in a Tree",
    "Hard",
    "cycle-length-queries-in-a-tree"
  ],
  "2653": [
    "Check if There is a Path With Equal Number of 0's And 1's",
    "Medium",
    "check-if-there-is-a-path-with-equal-number-of-0s-and-1s"
  ],
  "2602": [
    "Maximum Enemy Forts That Can Be Captured",
    "Easy",
    "maximum-enemy-forts-that-can-be-captured"
  ],
  "2603": [
    "Reward Top K Students",
    "Medium",
    "reward-top-k-students"
  ],
  "2628": [
    "Minimize the Maximum of Two Arrays",
    "Medium",
    "minimize-the-maximum-of-two-arrays"
  ],
  "2605": [
    "Count Anagrams",
    "Hard",
    "count-anagrams"
  ],
  "2598": [
    "Shortest Distance to Target String in a Circular Array",
    "Easy",
    "shortest-distance-to-target-string-in-a-circular-array"
  ],
  "2599": [
    "Take K of Each Character From Left and Right",
    "Medium",
    "take-k-of-each-character-from-left-and-right"
  ],
  "2600": [
    "Maximum Tastiness of Candy Basket",
    "Medium",
    "maximum-tastiness-of-candy-basket"
  ],
  "2601": [
    "Number of Great Partitions",
    "Hard",
    "number-of-great-partitions"
  ],
  "2658": [
    "Count the Number of K-Big Indices",
    "Hard",
    "count-the-number-of-k-big-indices"
  ],
  "2608": [
    "Count the Digits That Divide a Number",
    "Easy",
    "count-the-digits-that-divide-a-number"
  ],
  "2609": [
    "Distinct Prime Factors of Product of Array",
    "Medium",
    "distinct-prime-factors-of-product-of-array"
  ],
  "2511": [
    "Partition String Into Substrings With Values at Most K",
    "Medium",
    "partition-string-into-substrings-with-values-at-most-k"
  ],
  "2610": [
    "Closest Prime Numbers in Range",
    "Medium",
    "closest-prime-numbers-in-range"
  ],
  "2667": [
    "Maximum Frequency Score of a Subarray",
    "Hard",
    "maximum-frequency-score-of-a-subarray"
  ],
  "2619": [
    "Categorize Box According to Criteria",
    "Easy",
    "categorize-box-according-to-criteria"
  ],
  "2620": [
    "Find Consecutive Integers from a Data Stream",
    "Medium",
    "find-consecutive-integers-from-a-data-stream"
  ],
  "2621": [
    "Find Xor-Beauty of Array",
    "Medium",
    "find-xor-beauty-of-array"
  ],
  "2618": [
    "Maximize the Minimum Powered City",
    "Hard",
    "maximize-the-minimum-powered-city"
  ],
  "2614": [
    "Maximum Count of Positive Integer and Negative Integer",
    "Easy",
    "maximum-count-of-positive-integer-and-negative-integer"
  ],
  "2616": [
    "Maximal Score After Applying K Operations",
    "Medium",
    "maximal-score-after-applying-k-operations"
  ],
  "2615": [
    "Make Number of Distinct Characters Equal",
    "Medium",
    "make-number-of-distinct-characters-equal"
  ],
  "2642": [
    "Time to Cross a Bridge",
    "Hard",
    "time-to-cross-a-bridge"
  ],
  "2672": [
    "Number of Good Binary Strings",
    "Medium",
    "number-of-good-binary-strings"
  ],
  "2617": [
    "Time Taken to Cross the Door",
    "Hard",
    "time-taken-to-cross-the-door"
  ],
  "2624": [
    "Difference Between Element Sum and Digit Sum of an Array",
    "Easy",
    "difference-between-element-sum-and-digit-sum-of-an-array"
  ],
  "2625": [
    "Increment Submatrices by One",
    "Medium",
    "increment-submatrices-by-one"
  ],
  "2626": [
    "Count the Number of Good Subarrays",
    "Medium",
    "count-the-number-of-good-subarrays"
  ],
  "2627": [
    "Difference Between Maximum and Minimum Price Sum",
    "Hard",
    "difference-between-maximum-and-minimum-price-sum"
  ],
  "2683": [
    "Count the Number of Good Subsequences",
    "Medium",
    "count-the-number-of-good-subsequences"
  ],
  "2634": [
    "Minimum Common Value",
    "Easy",
    "minimum-common-value"
  ],
  "2604": [
    "Minimum Operations to Make Array Equal II",
    "Medium",
    "minimum-operations-to-make-array-equal-ii"
  ],
  "2636": [
    "Maximum Subsequence Score",
    "Medium",
    "maximum-subsequence-score"
  ],
  "2635": [
    "Check if Point Is Reachable",
    "Hard",
    "check-if-point-is-reachable"
  ],
  "2630": [
    "Alternating Digit Sum",
    "Easy",
    "alternating-digit-sum"
  ],
  "2631": [
    "Sort the Students by Their Kth Score",
    "Medium",
    "sort-the-students-by-their-kth-score"
  ],
  "2632": [
    "Apply Bitwise Operations to Make Strings Equal",
    "Medium",
    "apply-bitwise-operations-to-make-strings-equal"
  ],
  "2633": [
    "Minimum Cost to Split an Array",
    "Hard",
    "minimum-cost-to-split-an-array"
  ],
  "2693": [
    "Maximum Price to Fill a Bag",
    "Medium",
    "maximum-price-to-fill-a-bag"
  ],
  "2679": [
    "Count Distinct Numbers on Board",
    "Easy",
    "count-distinct-numbers-on-board"
  ],
  "2680": [
    "Count Collisions of Monkeys on a Polygon",
    "Medium",
    "count-collisions-of-monkeys-on-a-polygon"
  ],
  "2681": [
    "Put Marbles in Bags",
    "Hard",
    "put-marbles-in-bags"
  ],
  "2682": [
    "Count Increasing Quadruplets",
    "Hard",
    "count-increasing-quadruplets"
  ],
  "2639": [
    "Separate the Digits in an Array",
    "Easy",
    "separate-the-digits-in-an-array"
  ],
  "2640": [
    "Maximum Number of Integers to Choose From a Range I",
    "Medium",
    "maximum-number-of-integers-to-choose-from-a-range-i"
  ],
  "2673": [
    "Maximize Win From Two Segments",
    "Medium",
    "maximize-win-from-two-segments"
  ],
  "2641": [
    "Disconnect Path in a Binary Matrix by at Most One Flip",
    "Medium",
    "disconnect-path-in-a-binary-matrix-by-at-most-one-flip"
  ],
  "2702": [
    "Maximum Number of Integers to Choose From a Range II",
    "Medium",
    "maximum-number-of-integers-to-choose-from-a-range-ii"
  ],
  "2692": [
    "Take Gifts From the Richest Pile",
    "Easy",
    "take-gifts-from-the-richest-pile"
  ],
  "2691": [
    "Count Vowel Strings in Ranges",
    "Medium",
    "count-vowel-strings-in-ranges"
  ],
  "2690": [
    "House Robber IV",
    "Medium",
    "house-robber-iv"
  ],
  "2689": [
    "Rearranging Fruits",
    "Hard",
    "rearranging-fruits"
  ],
  "2698": [
    "Find the Array Concatenation Value",
    "Easy",
    "find-the-array-concatenation-value"
  ],
  "2699": [
    "Count the Number of Fair Pairs",
    "Medium",
    "count-the-number-of-fair-pairs"
  ],
  "2700": [
    "Substring XOR Queries",
    "Medium",
    "substring-xor-queries"
  ],
  "2701": [
    "Subsequence With the Minimum Score",
    "Hard",
    "subsequence-with-the-minimum-score"
  ],
  "2704": [
    "Maximum Difference by Remapping a Digit",
    "Easy",
    "maximum-difference-by-remapping-a-digit"
  ],
  "2706": [
    "Minimum Score by Changing Two Elements",
    "Medium",
    "minimum-score-by-changing-two-elements"
  ],
  "2705": [
    "Minimum Impossible OR",
    "Medium",
    "minimum-impossible-or"
  ],
  "2703": [
    "Handling Sum Queries After Update",
    "Hard",
    "handling-sum-queries-after-update"
  ],
  "2707": [
    "Merge Two 2D Arrays by Summing Values",
    "Easy",
    "merge-two-2d-arrays-by-summing-values"
  ],
  "2710": [
    "Minimum Operations to Reduce an Integer to 0",
    "Medium",
    "minimum-operations-to-reduce-an-integer-to-0"
  ],
  "2709": [
    "Count the Number of Square-Free Subsets",
    "Medium",
    "count-the-number-of-square-free-subsets"
  ],
  "2708": [
    "Find the String with LCP",
    "Hard",
    "find-the-string-with-lcp"
  ],
  "2714": [
    "Left and Right Sum Differences",
    "Easy",
    "left-and-right-sum-differences"
  ],
  "2713": [
    "Find the Divisibility Array of a String",
    "Medium",
    "find-the-divisibility-array-of-a-string"
  ],
  "2712": [
    "Find the Maximum Number of Marked Indices",
    "Medium",
    "find-the-maximum-number-of-marked-indices"
  ],
  "2711": [
    "Minimum Time to Visit a Cell In a Grid",
    "Hard",
    "minimum-time-to-visit-a-cell-in-a-grid"
  ],
  "2650": [
    "Split With Minimum Sum",
    "Easy",
    "split-with-minimum-sum"
  ],
  "2649": [
    "Count Total Number of Colored Cells",
    "Medium",
    "count-total-number-of-colored-cells"
  ],
  "2651": [
    "Count Ways to Group Overlapping Ranges",
    "Medium",
    "count-ways-to-group-overlapping-ranges"
  ],
  "2652": [
    "Count Number of Possible Root Nodes",
    "Hard",
    "count-number-of-possible-root-nodes"
  ],
  "2645": [
    "Pass the Pillow",
    "Easy",
    "pass-the-pillow"
  ],
  "2646": [
    "Kth Largest Sum in a Binary Tree",
    "Medium",
    "kth-largest-sum-in-a-binary-tree"
  ],
  "2647": [
    "Split the Array to Make Coprime Products",
    "Hard",
    "split-the-array-to-make-coprime-products"
  ],
  "2648": [
    "Number of Ways to Earn Points",
    "Hard",
    "number-of-ways-to-earn-points"
  ],
  "2654": [
    "Count the Number of Vowel Strings in Range",
    "Easy",
    "count-the-number-of-vowel-strings-in-range"
  ],
  "2655": [
    "Rearrange Array to Maximize Prefix Score",
    "Medium",
    "rearrange-array-to-maximize-prefix-score"
  ],
  "2656": [
    "Count the Number of Beautiful Subarrays",
    "Medium",
    "count-the-number-of-beautiful-subarrays"
  ],
  "2657": [
    "Minimum Time to Complete All Tasks",
    "Hard",
    "minimum-time-to-complete-all-tasks"
  ],
  "2688": [
    "Design a Todo List",
    "Medium",
    "design-a-todo-list"
  ],
  "2663": [
    "Distribute Money to Maximum Children",
    "Easy",
    "distribute-money-to-maximum-children"
  ],
  "2664": [
    "Maximize Greatness of an Array",
    "Medium",
    "maximize-greatness-of-an-array"
  ],
  "2695": [
    "Find Score of an Array After Marking All Elements",
    "Medium",
    "find-score-of-an-array-after-marking-all-elements"
  ],
  "2665": [
    "Minimum Time to Repair Cars",
    "Medium",
    "minimum-time-to-repair-cars"
  ],
  "2659": [
    "Number of Even and Odd Bits",
    "Easy",
    "number-of-even-and-odd-bits"
  ],
  "2662": [
    "Check Knight Tour Configuration",
    "Medium",
    "check-knight-tour-configuration"
  ],
  "2696": [
    "The Number of Beautiful Subsets",
    "Medium",
    "the-number-of-beautiful-subsets"
  ],
  "2661": [
    "Smallest Missing Non-negative Integer After Operations",
    "Medium",
    "smallest-missing-non-negative-integer-after-operations"
  ],
  "2674": [
    "Make the Prefix Sum Non-negative",
    "Medium",
    "make-the-prefix-sum-non-negative"
  ],
  "2715": [
    "K Items With the Maximum Sum",
    "Easy",
    "k-items-with-the-maximum-sum"
  ],
  "2716": [
    "Prime Subtraction Operation",
    "Medium",
    "prime-subtraction-operation"
  ],
  "2718": [
    "Minimum Operations to Make All Array Elements Equal",
    "Medium",
    "minimum-operations-to-make-all-array-elements-equal"
  ],
  "2717": [
    "Collect Coins in a Tree",
    "Hard",
    "collect-coins-in-a-tree"
  ],
  "2666": [
    "Minimum Time to Eat All Grains",
    "Hard",
    "minimum-time-to-eat-all-grains"
  ],
  "2668": [
    "Form Smallest Number From Two Digit Arrays",
    "Easy",
    "form-smallest-number-from-two-digit-arrays"
  ],
  "2669": [
    "Find the Substring With Maximum Cost",
    "Medium",
    "find-the-substring-with-maximum-cost"
  ],
  "2670": [
    "Make K-Subarray Sums Equal",
    "Medium",
    "make-k-subarray-sums-equal"
  ],
  "2671": [
    "Shortest Cycle in a Graph",
    "Hard",
    "shortest-cycle-in-a-graph"
  ],
  "2723": [
    "Find the Longest Balanced Substring of a Binary String",
    "Easy",
    "find-the-longest-balanced-substring-of-a-binary-string"
  ],
  "2724": [
    "Convert an Array Into a 2D Array With Conditions",
    "Medium",
    "convert-an-array-into-a-2d-array-with-conditions"
  ],
  "2725": [
    "Mice and Cheese",
    "Medium",
    "mice-and-cheese"
  ],
  "2726": [
    "Minimum Reverse Operations",
    "Hard",
    "minimum-reverse-operations"
  ],
  "2719": [
    "Beautiful Pairs",
    "Hard",
    "beautiful-pairs"
  ],
  "2722": [
    "Prime In Diagonal",
    "Easy",
    "prime-in-diagonal"
  ],
  "2721": [
    "Sum of Distances",
    "Medium",
    "sum-of-distances"
  ],
  "2720": [
    "Minimize the Maximum Difference of Pairs",
    "Medium",
    "minimize-the-maximum-difference-of-pairs"
  ],
  "2697": [
    "Minimum Number of Visited Cells in a Grid",
    "Hard",
    "minimum-number-of-visited-cells-in-a-grid"
  ],
  "2758": [
    "Check if Object Instance of Class",
    "Medium",
    "check-if-object-instance-of-class"
  ],
  "2734": [
    "Array Prototype Last",
    "Easy",
    "array-prototype-last"
  ],
  "2732": [
    "Counter",
    "Easy",
    "counter"
  ],
  "2733": [
    "Sleep",
    "Easy",
    "sleep"
  ],
  "2762": [
    "Cache With Time Limit",
    "Medium",
    "cache-with-time-limit"
  ],
  "2731": [
    "Memoize",
    "Medium",
    "memoize"
  ],
  "2760": [
    "Snail Traversal",
    "Medium",
    "snail-traversal"
  ],
  "2759": [
    "Flatten Deeply Nested Array",
    "Medium",
    "flatten-deeply-nested-array"
  ],
  "2761": [
    "Array Reduce Transformation",
    "Easy",
    "array-reduce-transformation"
  ],
  "2743": [
    "Debounce",
    "Medium",
    "debounce"
  ],
  "2735": [
    "JSON Deep Equal",
    "Medium",
    "json-deep-equal"
  ],
  "2741": [
    "Function Composition",
    "Easy",
    "function-composition"
  ],
  "2744": [
    "Memoize II",
    "Hard",
    "memoize-ii"
  ],
  "2742": [
    "Group By",
    "Medium",
    "group-by"
  ],
  "2740": [
    "Curry",
    "Medium",
    "curry"
  ],
  "2745": [
    "Convert Object to JSON String",
    "Medium",
    "convert-object-to-json-string"
  ],
  "2746": [
    "Filter Elements from Array",
    "Easy",
    "filter-elements-from-array"
  ],
  "2747": [
    "Apply Transform Over Each Element in Array",
    "Easy",
    "apply-transform-over-each-element-in-array"
  ],
  "2750": [
    "Promise Pool",
    "Medium",
    "promise-pool"
  ],
  "2749": [
    "Promise Time Limit",
    "Medium",
    "promise-time-limit"
  ],
  "2738": [
    "Count the Number of K-Free Subsets",
    "Medium",
    "count-the-number-of-k-free-subsets"
  ],
  "2675": [
    "Find the Width of Columns of a Grid",
    "Easy",
    "find-the-width-of-columns-of-a-grid"
  ],
  "2676": [
    "Find the Score of All Prefixes of an Array",
    "Medium",
    "find-the-score-of-all-prefixes-of-an-array"
  ],
  "2677": [
    "Cousins in Binary Tree II",
    "Medium",
    "cousins-in-binary-tree-ii"
  ],
  "2678": [
    "Design Graph With Shortest Path Calculator",
    "Hard",
    "design-graph-with-shortest-path-calculator"
  ],
  "2737": [
    "Row With Maximum Ones",
    "Easy",
    "row-with-maximum-ones"
  ],
  "2694": [
    "Find the Maximum Divisibility Score",
    "Easy",
    "find-the-maximum-divisibility-score"
  ],
  "2736": [
    "Minimum Additions to Make Valid String",
    "Medium",
    "minimum-additions-to-make-valid-string"
  ],
  "2739": [
    "Minimize the Total Price of the Trips",
    "Hard",
    "minimize-the-total-price-of-the-trips"
  ],
  "2540": [
    "Color the Triangle Red",
    "Hard",
    "color-the-triangle-red"
  ],
  "2775": [
    "Generate Fibonacci Sequence",
    "Easy",
    "generate-fibonacci-sequence"
  ],
  "2783": [
    "Nested Array Generator",
    "Medium",
    "nested-array-generator"
  ],
  "2788": [
    "Design Cancellable Function",
    "Hard",
    "design-cancellable-function"
  ],
  "2748": [
    "Calculate Delayed Arrival Time",
    "Easy",
    "calculate-delayed-arrival-time"
  ],
  "2752": [
    "Sum Multiples",
    "Easy",
    "sum-multiples"
  ],
  "2751": [
    "Sliding Subarray Beauty",
    "Medium",
    "sliding-subarray-beauty"
  ],
  "2753": [
    "Minimum Number of Operations to Make All Array Elements Equal to 1",
    "Medium",
    "minimum-number-of-operations-to-make-all-array-elements-equal-to-1"
  ],
  "2815": [
    "Find Maximal Uncovered Ranges",
    "Medium",
    "find-maximal-uncovered-ranges"
  ],
  "2767": [
    "Maximum Sum With Exactly K Elements ",
    "Easy",
    "maximum-sum-with-exactly-k-elements"
  ],
  "2766": [
    "Find the Prefix Common Array of Two Arrays",
    "Medium",
    "find-the-prefix-common-array-of-two-arrays"
  ],
  "2764": [
    "Maximum Number of Fish in a Grid",
    "Medium",
    "maximum-number-of-fish-in-a-grid"
  ],
  "2765": [
    "Make Array Empty",
    "Hard",
    "make-array-empty"
  ],
  "2684": [
    "Determine the Winner of a Bowling Game",
    "Easy",
    "determine-the-winner-of-a-bowling-game"
  ],
  "2685": [
    "First Completely Painted Row or Column",
    "Medium",
    "first-completely-painted-row-or-column"
  ],
  "2686": [
    "Minimum Cost of a Path With Special Roads",
    "Medium",
    "minimum-cost-of-a-path-with-special-roads"
  ],
  "2687": [
    "Lexicographically Smallest Beautiful String",
    "Hard",
    "lexicographically-smallest-beautiful-string"
  ],
  "2823": [
    "The Knight\u2019s Tour",
    "Medium",
    "the-knights-tour"
  ],
  "2789": [
    "Counter II",
    "Easy",
    "counter-ii"
  ],
  "2796": [
    "Allow One Function Call",
    "Easy",
    "allow-one-function-call"
  ],
  "2809": [
    "Create Hello World Function",
    "Easy",
    "create-hello-world-function"
  ],
  "2829": [
    "Find Latest Salaries",
    "Easy",
    "find-latest-salaries"
  ],
  "2830": [
    "Count Artist Occurrences On Spotify Ranking List",
    "Easy",
    "count-artist-occurrences-on-spotify-ranking-list"
  ],
  "2777": [
    "Find the Distinct Difference Array",
    "Easy",
    "find-the-distinct-difference-array"
  ],
  "2778": [
    "Frequency Tracker",
    "Medium",
    "frequency-tracker"
  ],
  "2779": [
    "Number of Adjacent Elements With the Same Color",
    "Medium",
    "number-of-adjacent-elements-with-the-same-color"
  ],
  "2780": [
    "Make Costs of Paths Equal in a Binary Tree",
    "Medium",
    "make-costs-of-paths-equal-in-a-binary-tree"
  ],
  "2835": [
    "Split a Circular Linked List",
    "Medium",
    "split-a-circular-linked-list"
  ],
  "2769": [
    "Array of Objects to Matrix",
    "Hard",
    "array-of-objects-to-matrix"
  ],
  "2771": [
    "Throttle",
    "Medium",
    "throttle"
  ],
  "2798": [
    "Chunk Array",
    "Easy",
    "chunk-array"
  ],
  "2727": [
    "Number of Senior Citizens",
    "Easy",
    "number-of-senior-citizens"
  ],
  "2728": [
    "Sum in a Matrix",
    "Medium",
    "sum-in-a-matrix"
  ],
  "2730": [
    "Maximum OR",
    "Medium",
    "maximum-or"
  ],
  "2784": [
    "Power of Heroes",
    "Hard",
    "power-of-heroes"
  ],
  "2791": [
    "Find the Losers of the Circular Game",
    "Easy",
    "find-the-losers-of-the-circular-game"
  ],
  "2792": [
    "Neighboring Bitwise XOR",
    "Medium",
    "neighboring-bitwise-xor"
  ],
  "2794": [
    "Maximum Number of Moves in a Grid",
    "Medium",
    "maximum-number-of-moves-in-a-grid"
  ],
  "2793": [
    "Count the Number of Complete Components",
    "Medium",
    "count-the-number-of-complete-components"
  ],
  "2840": [
    "Immediate Food Delivery III",
    "Medium",
    "immediate-food-delivery-iii"
  ],
  "2841": [
    "Bikes Last Time Used ",
    "Easy",
    "bikes-last-time-used"
  ],
  "2842": [
    "Find Active Users",
    "Medium",
    "find-active-users"
  ],
  "2843": [
    "Extract Kth Character From The Rope Tree",
    "Easy",
    "extract-kth-character-from-the-rope-tree"
  ],
  "2772": [
    "Infinite Method Object",
    "Easy",
    "infinite-method-object"
  ],
  "2773": [
    "Immutability Helper",
    "Hard",
    "immutability-helper"
  ],
  "2776": [
    "Make Object Immutable",
    "Medium",
    "make-object-immutable"
  ],
  "2790": [
    "Call Function with Custom Context",
    "Medium",
    "call-function-with-custom-context"
  ],
  "2797": [
    "Event Emitter",
    "Medium",
    "event-emitter"
  ],
  "2805": [
    "Array Wrapper",
    "Easy",
    "array-wrapper"
  ],
  "2800": [
    "Minimum String Length After Removing Substrings",
    "Easy",
    "minimum-string-length-after-removing-substrings"
  ],
  "2816": [
    "Lexicographically Smallest Palindrome",
    "Easy",
    "lexicographically-smallest-palindrome"
  ],
  "2802": [
    "Find the Punishment Number of an Integer",
    "Medium",
    "find-the-punishment-number-of-an-integer"
  ],
  "2803": [
    "Modify Graph Edge Weights",
    "Hard",
    "modify-graph-edge-weights"
  ],
  "2774": [
    "Differences Between Two Objects",
    "Medium",
    "differences-between-two-objects"
  ],
  "2853": [
    "Consecutive Transactions with Increasing Amounts",
    "Hard",
    "consecutive-transactions-with-increasing-amounts"
  ],
  "2729": [
    "Minimum Operations to Make Numbers Non-positive",
    "Hard",
    "minimum-operations-to-make-numbers-non-positive"
  ],
  "2820": [
    "Return Length of Arguments Passed",
    "Easy",
    "return-length-of-arguments-passed"
  ],
  "2813": [
    "To Be Or Not To Be",
    "Easy",
    "to-be-or-not-to-be"
  ],
  "2804": [
    "Compact Object",
    "Medium",
    "compact-object"
  ],
  "2756": [
    "Buy Two Chocolates",
    "Easy",
    "buy-two-chocolates"
  ],
  "2755": [
    "Extra Characters in a String",
    "Medium",
    "extra-characters-in-a-string"
  ],
  "2754": [
    "Maximum Strength of a Group",
    "Medium",
    "maximum-strength-of-a-group"
  ],
  "2827": [
    "Greatest Common Divisor Traversal",
    "Hard",
    "greatest-common-divisor-traversal"
  ],
  "2819": [
    "Remove Trailing Zeros From a String",
    "Easy",
    "remove-trailing-zeros-from-a-string"
  ],
  "2801": [
    "Difference of Number of Distinct Values on Diagonals",
    "Medium",
    "difference-of-number-of-distinct-values-on-diagonals"
  ],
  "2817": [
    "Minimum Cost to Make All Characters Equal",
    "Medium",
    "minimum-cost-to-make-all-characters-equal"
  ],
  "2818": [
    "Maximum Strictly Increasing Cells in a Matrix",
    "Hard",
    "maximum-strictly-increasing-cells-in-a-matrix"
  ],
  "2865": [
    "Find Shortest Path with K Hops",
    "Hard",
    "find-shortest-path-with-k-hops"
  ],
  "2821": [
    "Timeout Cancellation",
    "Easy",
    "timeout-cancellation"
  ],
  "2825": [
    "Minimize String Length",
    "Easy",
    "minimize-string-length"
  ],
  "2785": [
    "Semi-Ordered Permutation",
    "Easy",
    "semi-ordered-permutation"
  ],
  "2838": [
    "Sum of Matrix After Queries",
    "Medium",
    "sum-of-matrix-after-queries"
  ],
  "2757": [
    "Count of Integers",
    "Hard",
    "count-of-integers"
  ],
  "2874": [
    "Popularity Percentage",
    "Hard",
    "popularity-percentage"
  ],
  "2807": [
    "Execute Asynchronous Functions in Parallel",
    "Medium",
    "execute-asynchronous-functions-in-parallel"
  ],
  "2858": [
    "Join Two Arrays by ID",
    "Medium",
    "join-two-arrays-by-id"
  ],
  "2859": [
    "Add Two Promises",
    "Easy",
    "add-two-promises"
  ],
  "2860": [
    "Sort By",
    "Easy",
    "sort-by"
  ],
  "2862": [
    "Interval Cancellation",
    "Easy",
    "interval-cancellation"
  ],
  "2863": [
    "Calculator with Method Chaining",
    "Easy",
    "calculator-with-method-chaining"
  ],
  "2864": [
    "Is Object Empty",
    "Easy",
    "is-object-empty"
  ],
  "2875": [
    "Count Houses in a Circular Street",
    "Easy",
    "count-houses-in-a-circular-street"
  ],
  "2824": [
    "Check if The Number is Fascinating",
    "Easy",
    "check-if-the-number-is-fascinating"
  ],
  "2786": [
    "Find the Longest Semi-Repetitive Substring",
    "Medium",
    "find-the-longest-semi-repetitive-substring"
  ],
  "2787": [
    "Movement of Robots",
    "Medium",
    "movement-of-robots"
  ],
  "2826": [
    "Find a Good Subset of the Matrix",
    "Hard",
    "find-a-good-subset-of-the-matrix"
  ],
  "2836": [
    "Neither Minimum nor Maximum",
    "Easy",
    "neither-minimum-nor-maximum"
  ],
  "2828": [
    "Lexicographically Smallest String After Substring Operation",
    "Medium",
    "lexicographically-smallest-string-after-substring-operation"
  ],
  "2810": [
    "Collecting Chocolates",
    "Medium",
    "collecting-chocolates"
  ],
  "2839": [
    "Maximum Sum Queries",
    "Hard",
    "maximum-sum-queries"
  ],
  "2880": [
    "Find the Closest Marked Node",
    "Medium",
    "find-the-closest-marked-node"
  ],
  "2885": [
    "Count Occurrences in Text",
    "Medium",
    "count-occurrences-in-text"
  ],
  "2857": [
    "Total Distance Traveled",
    "Easy",
    "total-distance-traveled"
  ],
  "2845": [
    "Find the Value of the Partition",
    "Medium",
    "find-the-value-of-the-partition"
  ],
  "2848": [
    "Special Permutations",
    "Medium",
    "special-permutations"
  ],
  "2808": [
    "Painting the Walls",
    "Hard",
    "painting-the-walls"
  ],
  "2890": [
    "Count Substrings Without Repeating Character",
    "Medium",
    "count-substrings-without-repeating-character"
  ],
  "2847": [
    "Find Maximum Number of String Pairs",
    "Easy",
    "find-maximum-number-of-string-pairs"
  ],
  "2850": [
    "Construct the Longest New String",
    "Medium",
    "construct-the-longest-new-string"
  ],
  "2854": [
    "Decremental String Concatenation",
    "Medium",
    "decremental-string-concatenation"
  ],
  "2833": [
    "Count Zero Request Servers",
    "Medium",
    "count-zero-request-servers"
  ],
  "2831": [
    "Number of Beautiful Pairs",
    "Easy",
    "number-of-beautiful-pairs"
  ],
  "2837": [
    "Minimum Operations to Make the Integer Zero",
    "Medium",
    "minimum-operations-to-make-the-integer-zero"
  ],
  "2867": [
    "Ways to Split Array Into Good Subarrays",
    "Medium",
    "ways-to-split-array-into-good-subarrays"
  ],
  "2846": [
    "Robot Collisions",
    "Hard",
    "robot-collisions"
  ],
  "2852": [
    "Customers with Maximum Number of Transactions on Consecutive Days",
    "Hard",
    "customers-with-maximum-number-of-transactions-on-consecutive-days"
  ],
  "2897": [
    "Count Houses in a Circular Street II",
    "Hard",
    "count-houses-in-a-circular-street-ii"
  ],
  "2770": [
    "Bind Function to Context",
    "Medium",
    "bind-function-to-context"
  ],
  "2795": [
    "Deep Merge of Two Objects",
    "Medium",
    "deep-merge-of-two-objects"
  ],
  "2806": [
    "Query Batching",
    "Hard",
    "query-batching"
  ],
  "2814": [
    "Generate Circular Array Values",
    "Medium",
    "generate-circular-array-values"
  ],
  "2822": [
    "Next Day",
    "Easy",
    "next-day"
  ],
  "2851": [
    "Convert JSON String to Object",
    "Hard",
    "convert-json-string-to-object"
  ],
  "2866": [
    "Longest Even Odd Subarray With Threshold",
    "Easy",
    "longest-even-odd-subarray-with-threshold"
  ],
  "2873": [
    "Prime Pairs With Target Sum",
    "Medium",
    "prime-pairs-with-target-sum"
  ],
  "2868": [
    "Continuous Subarrays",
    "Medium",
    "continuous-subarrays"
  ],
  "2849": [
    "Sum of Imbalance Numbers of All Subarrays",
    "Hard",
    "sum-of-imbalance-numbers-of-all-subarrays"
  ],
  "2918": [
    "Is Array a Preorder of Some \u200cBinary Tree",
    "Medium",
    "is-array-a-preorder-of-some-binary-tree"
  ],
  "2870": [
    "Longest Alternating Subarray",
    "Easy",
    "longest-alternating-subarray"
  ],
  "2834": [
    "Relocate Marbles",
    "Medium",
    "relocate-marbles"
  ],
  "2883": [
    "Partition String Into Minimum Beautiful Substrings",
    "Medium",
    "partition-string-into-minimum-beautiful-substrings"
  ],
  "2889": [
    "Number of Black Blocks",
    "Medium",
    "number-of-black-blocks"
  ],
  "2812": [
    "Find the Maximum Achievable Number",
    "Easy",
    "find-the-maximum-achievable-number"
  ],
  "2855": [
    "Maximum Number of Jumps to Reach the Last Index",
    "Medium",
    "maximum-number-of-jumps-to-reach-the-last-index"
  ],
  "2869": [
    "Longest Non-decreasing Subarray From Two Arrays",
    "Medium",
    "longest-non-decreasing-subarray-from-two-arrays"
  ],
  "2878": [
    "Apply Operations to Make All Array Elements Equal to Zero",
    "Medium",
    "apply-operations-to-make-all-array-elements-equal-to-zero"
  ],
  "2944": [
    "Height of Special Binary Tree",
    "Medium",
    "height-of-special-binary-tree"
  ],
  "2768": [
    "Array Upper Bound",
    "Easy",
    "array-upper-bound"
  ],
  "2781": [
    "Undefined to Null",
    "Medium",
    "undefined-to-null"
  ],
  "2782": [
    "Convert Callback Based Function to Promise Based Function",
    "Medium",
    "convert-callback-based-function-to-promise-based-function"
  ],
  "2799": [
    "Date Range Generator",
    "Medium",
    "date-range-generator"
  ],
  "2844": [
    "Sum of Squares of Special Elements ",
    "Easy",
    "sum-of-squares-of-special-elements"
  ],
  "2891": [
    "Maximum Beauty of an Array After Applying Operation",
    "Medium",
    "maximum-beauty-of-an-array-after-applying-operation"
  ],
  "2888": [
    "Minimum Index of a Valid Split",
    "Medium",
    "minimum-index-of-a-valid-split"
  ],
  "2884": [
    "Length of the Longest Valid Substring",
    "Hard",
    "length-of-the-longest-valid-substring"
  ],
  "2995": [
    "Number of Unique Categories",
    "Medium",
    "number-of-unique-categories"
  ],
  "3002": [
    "Flight Occupancy and Waitlist Analysis",
    "Medium",
    "flight-occupancy-and-waitlist-analysis"
  ],
  "2892": [
    "Check if Array is Good",
    "Easy",
    "check-if-array-is-good"
  ],
  "2887": [
    "Sort Vowels in a String",
    "Medium",
    "sort-vowels-in-a-string"
  ],
  "2893": [
    "Visit Array Positions to Maximize Score",
    "Medium",
    "visit-array-positions-to-maximize-score"
  ],
  "2882": [
    "Ways to Express an Integer as Sum of Powers",
    "Medium",
    "ways-to-express-an-integer-as-sum-of-powers"
  ],
  "2881": [
    "Split Strings by Separator",
    "Easy",
    "split-strings-by-separator"
  ],
  "2872": [
    "Largest Element in an Array after Merge Operations",
    "Medium",
    "largest-element-in-an-array-after-merge-operations"
  ],
  "2919": [
    "Maximum Number of Groups With Increasing Length",
    "Hard",
    "maximum-number-of-groups-with-increasing-length"
  ],
  "2905": [
    "Count Paths That Can Form a Palindrome in a Tree",
    "Hard",
    "count-paths-that-can-form-a-palindrome-in-a-tree"
  ],
  "3016": [
    "Count Nodes That Are Great Enough",
    "Hard",
    "count-nodes-that-are-great-enough"
  ],
  "3003": [
    "Status of Flight Tickets",
    "Hard",
    "status-of-flight-tickets"
  ],
  "2861": [
    "Create Object from Two Arrays",
    "Easy",
    "create-object-from-two-arrays"
  ],
  "2898": [
    "Parallel Execution of Promises for Individual Results Retrieval",
    "Medium",
    "parallel-execution-of-promises-for-individual-results-retrieval"
  ],
  "2899": [
    "Repeat String",
    "Easy",
    "repeat-string"
  ],
  "2900": [
    "Partial Function with Placeholders",
    "Easy",
    "partial-function-with-placeholders"
  ],
  "2876": [
    "Number of Employees Who Met the Target",
    "Easy",
    "number-of-employees-who-met-the-target"
  ],
  "2856": [
    "Count Complete Subarrays in an Array",
    "Medium",
    "count-complete-subarrays-in-an-array"
  ],
  "2877": [
    "Shortest String That Contains Three Strings",
    "Medium",
    "shortest-string-that-contains-three-strings"
  ],
  "2921": [
    "Count Stepping Numbers in Range",
    "Hard",
    "count-stepping-numbers-in-range"
  ],
  "3030": [
    "Find The K-th Lucky Number",
    "Medium",
    "find-the-k-th-lucky-number"
  ],
  "2901": [
    "Factorial Generator",
    "Easy",
    "factorial-generator"
  ],
  "2907": [
    "Array Prototype ForEach",
    "Easy",
    "array-prototype-foreach"
  ],
  "2908": [
    "Custom Interval",
    "Medium",
    "custom-interval"
  ],
  "2955": [
    "Account Balance After Rounded Purchase",
    "Easy",
    "account-balance-after-rounded-purchase"
  ],
  "2903": [
    "Insert Greatest Common Divisors in Linked List",
    "Medium",
    "insert-greatest-common-divisors-in-linked-list"
  ],
  "2920": [
    "Minimum Seconds to Equalize a Circular Array",
    "Medium",
    "minimum-seconds-to-equalize-a-circular-array"
  ],
  "2952": [
    "Minimum Time to Make Array Sum At Most x",
    "Hard",
    "minimum-time-to-make-array-sum-at-most-x"
  ],
  "2886": [
    "Faulty Keyboard",
    "Easy",
    "faulty-keyboard"
  ],
  "2916": [
    "Check if it is Possible to Split Array",
    "Medium",
    "check-if-it-is-possible-to-split-array"
  ],
  "2914": [
    "Find the Safest Path in a Grid",
    "Medium",
    "find-the-safest-path-in-a-grid"
  ],
  "2894": [
    "Maximum Elegance of a K-Length Subsequence",
    "Hard",
    "maximum-elegance-of-a-k-length-subsequence"
  ],
  "3043": [
    "Minimum Time Takes to Reach Destination Without Drowning",
    "Hard",
    "minimum-time-takes-to-reach-destination-without-drowning"
  ],
  "2902": [
    "Max Pair Sum in an Array",
    "Easy",
    "max-pair-sum-in-an-array"
  ],
  "2871": [
    "Double a Number Represented as a Linked List",
    "Medium",
    "double-a-number-represented-as-a-linked-list"
  ],
  "3000": [
    "Minimum Absolute Difference Between Elements With Constraint",
    "Medium",
    "minimum-absolute-difference-between-elements-with-constraint"
  ],
  "3001": [
    "Apply Operations to Maximize Score",
    "Hard",
    "apply-operations-to-maximize-score"
  ],
  "3077": [
    "Minimum Relative Loss After Buying Chocolates",
    "Hard",
    "minimum-relative-loss-after-buying-chocolates"
  ],
  "3078": [
    "Election Results",
    "Medium",
    "election-results"
  ],
  "2909": [
    "Delay the Resolution of Each Promise",
    "Medium",
    "delay-the-resolution-of-each-promise"
  ],
  "2925": [
    "Inversion of Object",
    "Easy",
    "inversion-of-object"
  ],
  "2912": [
    "Deep Object Filter",
    "Medium",
    "deep-object-filter"
  ],
  "2917": [
    "Count Pairs Whose Sum is Less than Target",
    "Easy",
    "count-pairs-whose-sum-is-less-than-target"
  ],
  "3018": [
    "Make String a Subsequence Using Cyclic Increments",
    "Medium",
    "make-string-a-subsequence-using-cyclic-increments"
  ],
  "2904": [
    "Sorting Three Groups",
    "Medium",
    "sorting-three-groups"
  ],
  "3017": [
    "Number of Beautiful Integers in the Range",
    "Hard",
    "number-of-beautiful-integers-in-the-range"
  ],
  "2977": [
    "Check if a String Is an Acronym of Words",
    "Easy",
    "check-if-a-string-is-an-acronym-of-words"
  ],
  "2811": [
    "Determine the Minimum Sum of a k-avoiding Array",
    "Medium",
    "determine-the-minimum-sum-of-a-k-avoiding-array"
  ],
  "2979": [
    "Maximize the Profit as the Salesman",
    "Medium",
    "maximize-the-profit-as-the-salesman"
  ],
  "2832": [
    "Find the Longest Equal Subarray",
    "Medium",
    "find-the-longest-equal-subarray"
  ],
  "3088": [
    "Maximal Range That Each Element Is Maximum in It",
    "Medium",
    "maximal-range-that-each-element-is-maximum-in-it"
  ],
  "3019": [
    "Furthest Point From Origin",
    "Easy",
    "furthest-point-from-origin"
  ],
  "3026": [
    "Find the Minimum Possible Sum of a Beautiful Array",
    "Medium",
    "find-the-minimum-possible-sum-of-a-beautiful-array"
  ],
  "3025": [
    "Minimum Operations to Form Subsequence With Target Sum",
    "Hard",
    "minimum-operations-to-form-subsequence-with-target-sum"
  ],
  "3032": [
    "Maximize Value of Function in a Ball Passing Game",
    "Hard",
    "maximize-value-of-function-in-a-ball-passing-game"
  ],
  "3097": [
    "Total Traveled Distance",
    "Easy",
    "total-traveled-distance"
  ],
  "3101": [
    "Maximum Coins Heroes Can Collect",
    "Medium",
    "maximum-coins-heroes-can-collect"
  ],
  "2999": [
    "Check if Strings Can be Made Equal With Operations I",
    "Easy",
    "check-if-strings-can-be-made-equal-with-operations-i"
  ],
  "2978": [
    "Check if Strings Can be Made Equal With Operations II",
    "Medium",
    "check-if-strings-can-be-made-equal-with-operations-ii"
  ],
  "2954": [
    "Maximum Sum of Almost Unique Subarray",
    "Medium",
    "maximum-sum-of-almost-unique-subarray"
  ],
  "3057": [
    "Count K-Subsequences of a String With Maximum Beauty",
    "Hard",
    "count-k-subsequences-of-a-string-with-maximum-beauty"
  ],
  "2998": [
    "  Count Symmetric Integers",
    "Easy",
    "count-symmetric-integers"
  ],
  "3046": [
    "Minimum Operations to Make a Special Number",
    "Medium",
    "minimum-operations-to-make-a-special-number"
  ],
  "2915": [
    "Count of Interesting Subarrays",
    "Medium",
    "count-of-interesting-subarrays"
  ],
  "3079": [
    "Minimum Edge Weight Equilibrium Queries in a Tree",
    "Hard",
    "minimum-edge-weight-equilibrium-queries-in-a-tree"
  ],
  "3111": [
    "Smallest Number With Given Digit Product",
    "Medium",
    "smallest-number-with-given-digit-product"
  ],
  "3034": [
    "Points That Intersect With Cars",
    "Easy",
    "points-that-intersect-with-cars"
  ],
  "3056": [
    "Determine if a Cell Is Reachable at a Given Time",
    "Medium",
    "determine-if-a-cell-is-reachable-at-a-given-time"
  ],
  "3092": [
    "Minimum Moves to Spread Stones Over Grid",
    "Medium",
    "minimum-moves-to-spread-stones-over-grid"
  ],
  "3024": [
    "String Transformation",
    "Hard",
    "string-transformation"
  ],
  "3148": [
    "Sum of Remoteness of All Cells",
    "Medium",
    "sum-of-remoteness-of-all-cells"
  ],
  "3155": [
    "Highest Salaries Difference",
    "Easy",
    "highest-salaries-difference"
  ],
  "3156": [
    "Rolling Average Steps",
    "Medium",
    "rolling-average-steps"
  ],
  "3045": [
    "Minimum Right Shifts to Sort the Array",
    "Easy",
    "minimum-right-shifts-to-sort-the-array"
  ],
  "3081": [
    "Minimum Array Length After Pair Removals",
    "Medium",
    "minimum-array-length-after-pair-removals"
  ],
  "2953": [
    "Count Pairs of Points With Distance k",
    "Medium",
    "count-pairs-of-points-with-distance-k"
  ],
  "3105": [
    "Minimum Edge Reversals So Every Node Is Reachable",
    "Hard",
    "minimum-edge-reversals-so-every-node-is-reachable"
  ],
  "3093": [
    "Sum of Values at Indices With K Set Bits",
    "Easy",
    "sum-of-values-at-indices-with-k-set-bits"
  ],
  "3104": [
    "Happy Students",
    "Medium",
    "happy-students"
  ],
  "3095": [
    "Maximum Number of Alloys",
    "Medium",
    "maximum-number-of-alloys"
  ],
  "3047": [
    "Maximum Element-Sum of a Complete Subset of Indices",
    "Hard",
    "maximum-element-sum-of-a-complete-subset-of-indices"
  ],
  "3158": [
    "Maximum Length of Semi-Decreasing Subarrays",
    "Medium",
    "maximum-length-of-semi-decreasing-subarrays"
  ],
  "3055": [
    "Maximum Odd Binary Number",
    "Easy",
    "maximum-odd-binary-number"
  ],
  "3114": [
    "Beautiful Towers I",
    "Medium",
    "beautiful-towers-i"
  ],
  "3113": [
    "Beautiful Towers II",
    "Medium",
    "beautiful-towers-ii"
  ],
  "3112": [
    "Count Valid Paths in a Tree",
    "Hard",
    "count-valid-paths-in-a-tree"
  ],
  "3173": [
    "The Wording Game",
    "Hard",
    "the-wording-game"
  ],
  "3044": [
    "Minimum Operations to Collect Elements",
    "Easy",
    "minimum-operations-to-collect-elements"
  ],
  "3094": [
    "Minimum Number of Operations to Make Array Empty",
    "Medium",
    "minimum-number-of-operations-to-make-array-empty"
  ],
  "3080": [
    "Split Array Into Maximum Number of Subarrays",
    "Medium",
    "split-array-into-maximum-number-of-subarrays"
  ],
  "3058": [
    "Maximum Number of K-Divisible Components",
    "Hard",
    "maximum-number-of-k-divisible-components"
  ],
  "3154": [
    "Maximum Value of an Ordered Triplet I",
    "Easy",
    "maximum-value-of-an-ordered-triplet-i"
  ],
  "3152": [
    "Maximum Value of an Ordered Triplet II",
    "Medium",
    "maximum-value-of-an-ordered-triplet-ii"
  ],
  "3141": [
    "Minimum Size Subarray in Infinite Array",
    "Medium",
    "minimum-size-subarray-in-infinite-array"
  ],
  "3140": [
    "Count Visited Nodes in a Directed Graph",
    "Hard",
    "count-visited-nodes-in-a-directed-graph"
  ],
  "3062": [
    "Create a DataFrame from List",
    "Easy",
    "create-a-dataframe-from-list"
  ],
  "3076": [
    "Get the Size of a DataFrame",
    "Easy",
    "get-the-size-of-a-dataframe"
  ],
  "3065": [
    "Display the First Three Rows",
    "Easy",
    "display-the-first-three-rows"
  ],
  "3074": [
    "Select Data",
    "Easy",
    "select-data"
  ],
  "3066": [
    "Create a New Column",
    "Easy",
    "create-a-new-column"
  ],
  "3071": [
    "Drop Duplicate Rows",
    "Easy",
    "drop-duplicate-rows"
  ],
  "3075": [
    "Drop Missing Data",
    "Easy",
    "drop-missing-data"
  ],
  "3067": [
    "Modify Columns",
    "Easy",
    "modify-columns"
  ],
  "3068": [
    "Rename Columns",
    "Easy",
    "rename-columns"
  ],
  "3069": [
    "Change Data Type",
    "Easy",
    "change-data-type"
  ],
  "3070": [
    "Fill Missing Data",
    "Easy",
    "fill-missing-data"
  ],
  "3064": [
    "Reshape Data: Concatenate",
    "Easy",
    "reshape-data-concatenate"
  ],
  "3072": [
    "Reshape Data: Pivot",
    "Easy",
    "reshape-data-pivot"
  ],
  "3073": [
    "Reshape Data: Melt",
    "Easy",
    "reshape-data-melt"
  ],
  "3063": [
    "Method Chaining",
    "Easy",
    "method-chaining"
  ],
  "3177": [
    "Minimizing Array After Replacing Pairs With Their Product",
    "Medium",
    "minimizing-array-after-replacing-pairs-with-their-product"
  ],
  "3160": [
    "Calculate Orders Within Each Interval",
    "Medium",
    "calculate-orders-within-each-interval"
  ],
  "3172": [
    "Divisible and Non-divisible Sums Difference",
    "Easy",
    "divisible-and-non-divisible-sums-difference"
  ],
  "3151": [
    "Minimum Processing Time",
    "Medium",
    "minimum-processing-time"
  ],
  "3033": [
    "Apply Operations to Make Two Strings Equal",
    "Medium",
    "apply-operations-to-make-two-strings-equal"
  ],
  "3153": [
    "Apply Operations on Array to Maximize Sum of Squares",
    "Hard",
    "apply-operations-on-array-to-maximize-sum-of-squares"
  ],
  "3182": [
    "Maximum Linear Stock Score",
    "Medium",
    "maximum-linear-stock-score"
  ],
  "3164": [
    "Last Visited Integers",
    "Easy",
    "last-visited-integers"
  ],
  "3143": [
    "Longest Unequal Adjacent Groups Subsequence I",
    "Easy",
    "longest-unequal-adjacent-groups-subsequence-i"
  ],
  "3142": [
    "Longest Unequal Adjacent Groups Subsequence II",
    "Medium",
    "longest-unequal-adjacent-groups-subsequence-ii"
  ],
  "3091": [
    "Count of Sub-Multisets With Bounded Sum",
    "Hard",
    "count-of-sub-multisets-with-bounded-sum"
  ],
  "3165": [
    "Find Indices With Index and Value Difference I",
    "Easy",
    "find-indices-with-index-and-value-difference-i"
  ],
  "3150": [
    "Shortest and Lexicographically Smallest Beautiful String",
    "Medium",
    "shortest-and-lexicographically-smallest-beautiful-string"
  ],
  "3170": [
    "Find Indices With Index and Value Difference II",
    "Medium",
    "find-indices-with-index-and-value-difference-ii"
  ],
  "3031": [
    "Construct Product Matrix",
    "Medium",
    "construct-product-matrix"
  ],
  "3187": [
    "Maximum Profitable Triplets With Increasing Prices I",
    "Medium",
    "maximum-profitable-triplets-with-increasing-prices-i"
  ],
  "3176": [
    "Minimum Sum of Mountain Triplets I",
    "Easy",
    "minimum-sum-of-mountain-triplets-i"
  ],
  "3186": [
    "Minimum Sum of Mountain Triplets II",
    "Medium",
    "minimum-sum-of-mountain-triplets-ii"
  ],
  "3166": [
    "Minimum Number of Groups to Create a Valid Assignment",
    "Medium",
    "minimum-number-of-groups-to-create-a-valid-assignment"
  ],
  "2879": [
    "Minimum Changes to Make K Semi-palindromes",
    "Hard",
    "minimum-changes-to-make-k-semi-palindromes"
  ],
  "3198": [
    "Number of Ways to Reach Destination in the Grid",
    "Hard",
    "number-of-ways-to-reach-destination-in-the-grid"
  ],
  "3163": [
    "Subarrays Distinct Element Sum of Squares I",
    "Easy",
    "subarrays-distinct-element-sum-of-squares-i"
  ],
  "3174": [
    "Minimum Number of Changes to Make Binary String Beautiful",
    "Medium",
    "minimum-number-of-changes-to-make-binary-string-beautiful"
  ],
  "3106": [
    "Length of the Longest Subsequence That Sums to Target",
    "Medium",
    "length-of-the-longest-subsequence-that-sums-to-target"
  ],
  "3139": [
    "Subarrays Distinct Element Sum of Squares II",
    "Hard",
    "subarrays-distinct-element-sum-of-squares-ii"
  ],
  "3183": [
    "Find the K-or of an Array",
    "Easy",
    "find-the-k-or-of-an-array"
  ],
  "3171": [
    "Minimum Equal Sum of Two Arrays After Replacing Zeros",
    "Medium",
    "minimum-equal-sum-of-two-arrays-after-replacing-zeros"
  ],
  "3178": [
    "Minimum Increment Operations to Make Array Beautiful",
    "Medium",
    "minimum-increment-operations-to-make-array-beautiful"
  ],
  "3179": [
    "Maximum Points After Collecting Coins From All Nodes",
    "Hard",
    "maximum-points-after-collecting-coins-from-all-nodes"
  ],
  "3204": [
    "Maximum Profitable Triplets With Increasing Prices II",
    "Hard",
    "maximum-profitable-triplets-with-increasing-prices-ii"
  ],
  "3205": [
    "Market Analysis III",
    "Medium",
    "market-analysis-iii"
  ],
  "3188": [
    "Find Champion I",
    "Easy",
    "find-champion-i"
  ],
  "3189": [
    "Find Champion II",
    "Medium",
    "find-champion-ii"
  ],
  "3191": [
    "Maximum Score After Applying Operations on a Tree",
    "Medium",
    "maximum-score-after-applying-operations-on-a-tree"
  ],
  "3184": [
    "Maximum Balanced Subsequence Sum",
    "Hard",
    "maximum-balanced-subsequence-sum"
  ],
  "3216": [
    "Distribute Candies Among Children III",
    "Hard",
    "distribute-candies-among-children-iii"
  ],
  "3199": [
    "Distribute Candies Among Children I",
    "Easy",
    "distribute-candies-among-children-i"
  ],
  "3201": [
    "Distribute Candies Among Children II",
    "Medium",
    "distribute-candies-among-children-ii"
  ],
  "3200": [
    "Number of Strings Which Can Be Rearranged to Contain Substring",
    "Medium",
    "number-of-strings-which-can-be-rearranged-to-contain-substring"
  ],
  "3107": [
    "Maximum Spending After Buying Items",
    "Hard",
    "maximum-spending-after-buying-items"
  ],
  "3193": [
    "Maximum Strong Pair XOR I",
    "Easy",
    "maximum-strong-pair-xor-i"
  ],
  "3202": [
    "High-Access Employees",
    "Medium",
    "high-access-employees"
  ],
  "3190": [
    "Minimum Operations to Maximize Last Elements in Arrays",
    "Medium",
    "minimum-operations-to-maximize-last-elements-in-arrays"
  ],
  "3197": [
    "Maximum Strong Pair XOR II",
    "Hard",
    "maximum-strong-pair-xor-ii"
  ],
  "3222": [
    "Number of Equal Numbers Blocks",
    "Medium",
    "number-of-equal-numbers-blocks"
  ],
  "3207": [
    "Make Three Strings Equal",
    "Easy",
    "make-three-strings-equal"
  ],
  "3195": [
    "Separate Black and White Balls",
    "Medium",
    "separate-black-and-white-balls"
  ],
  "3192": [
    "Maximum Xor Product",
    "Medium",
    "maximum-xor-product"
  ],
  "3181": [
    "Find Building Where Alice and Bob Can Meet",
    "Hard",
    "find-building-where-alice-and-bob-can-meet"
  ],
  "3232": [
    "Maximum GCD-Sum of a Subarray",
    "Hard",
    "maximum-gcd-sum-of-a-subarray"
  ],
  "3194": [
    "Find Words Containing Character",
    "Easy",
    "find-words-containing-character"
  ],
  "3214": [
    "Maximize Area of Square Hole in Grid",
    "Medium",
    "maximize-area-of-square-hole-in-grid"
  ],
  "3209": [
    "Minimum Number of Coins for Fruits",
    "Medium",
    "minimum-number-of-coins-for-fruits"
  ],
  "3211": [
    "Find Maximum Non-decreasing Array Length",
    "Hard",
    "find-maximum-non-decreasing-array-length"
  ],
  "3215": [
    "Matrix Similarity After Cyclic Shifts",
    "Easy",
    "matrix-similarity-after-cyclic-shifts"
  ],
  "3210": [
    "Count Beautiful Substrings I",
    "Medium",
    "count-beautiful-substrings-i"
  ],
  "3219": [
    "Make Lexicographically Smallest Array by Swapping Elements",
    "Medium",
    "make-lexicographically-smallest-array-by-swapping-elements"
  ],
  "3208": [
    "Count Beautiful Substrings II",
    "Hard",
    "count-beautiful-substrings-ii"
  ],
  "3237": [
    "Number of Divisible Substrings",
    "Medium",
    "number-of-divisible-substrings"
  ],
  "3221": [
    "Find the Peaks",
    "Easy",
    "find-the-peaks"
  ],
  "3231": [
    "Minimum Number of Coins to be Added",
    "Medium",
    "minimum-number-of-coins-to-be-added"
  ],
  "3223": [
    "Count Complete Substrings",
    "Hard",
    "count-complete-substrings"
  ],
  "3224": [
    "Count the Number of Infection Sequences",
    "Hard",
    "count-the-number-of-infection-sequences"
  ],
  "3247": [
    "Number of Same-End Substrings",
    "Medium",
    "number-of-same-end-substrings"
  ],
  "3206": [
    "Find Common Elements Between Two Arrays",
    "Easy",
    "find-common-elements-between-two-arrays"
  ],
  "3230": [
    "Remove Adjacent Almost-Equal Characters",
    "Medium",
    "remove-adjacent-almost-equal-characters"
  ],
  "3225": [
    "Length of Longest Subarray With at Most K Frequency",
    "Medium",
    "length-of-longest-subarray-with-at-most-k-frequency"
  ],
  "3217": [
    "Number of Possible Sets of Closing Branches",
    "Hard",
    "number-of-possible-sets-of-closing-branches"
  ],
  "3220": [
    "Count Tested Devices After Test Operations",
    "Easy",
    "count-tested-devices-after-test-operations"
  ],
  "3234": [
    "Double Modular Exponentiation",
    "Medium",
    "double-modular-exponentiation"
  ],
  "3213": [
    "Count Subarrays Where Max Element Appears at Least K Times",
    "Medium",
    "count-subarrays-where-max-element-appears-at-least-k-times"
  ],
  "3212": [
    "Count the Number of Good Partitions",
    "Hard",
    "count-the-number-of-good-partitions"
  ],
  "3254": [
    "Number of Divisible Triplet Sums",
    "Medium",
    "number-of-divisible-triplet-sums"
  ],
  "3227": [
    "Find Missing and Repeated Values",
    "Easy",
    "find-missing-and-repeated-values"
  ],
  "3241": [
    "Divide Array Into Arrays With Max Difference",
    "Medium",
    "divide-array-into-arrays-with-max-difference"
  ],
  "3229": [
    "Minimum Cost to Make Array Equalindromic",
    "Medium",
    "minimum-cost-to-make-array-equalindromic"
  ],
  "3196": [
    "Apply Operations to Maximize Frequency Score",
    "Hard",
    "apply-operations-to-maximize-frequency-score"
  ],
  "3268": [
    "Minimum Number of Coins for Fruits II",
    "Hard",
    "minimum-number-of-coins-for-fruits-ii"
  ],
  "3252": [
    "Count the Number of Incremovable Subarrays I",
    "Easy",
    "count-the-number-of-incremovable-subarrays-i"
  ],
  "3262": [
    "Find Polygon With the Largest Perimeter",
    "Medium",
    "find-polygon-with-the-largest-perimeter"
  ],
  "3248": [
    "Count the Number of Incremovable Subarrays II",
    "Hard",
    "count-the-number-of-incremovable-subarrays-ii"
  ],
  "3218": [
    "Find Number of Coins to Place in Tree Nodes",
    "Hard",
    "find-number-of-coins-to-place-in-tree-nodes"
  ],
  "3226": [
    "Minimum Number Game",
    "Easy",
    "minimum-number-game"
  ],
  "3250": [
    "Maximum Square Area by Removing Fences From a Field",
    "Medium",
    "maximum-square-area-by-removing-fences-from-a-field"
  ],
  "3235": [
    "Minimum Cost to Convert String I",
    "Medium",
    "minimum-cost-to-convert-string-i"
  ],
  "3238": [
    "Minimum Cost to Convert String II",
    "Hard",
    "minimum-cost-to-convert-string-ii"
  ],
  "3253": [
    "Symmetric Coordinates",
    "Medium",
    "symmetric-coordinates"
  ],
  "3273": [
    "Most Expensive Item That Can Not Be Bought",
    "Medium",
    "most-expensive-item-that-can-not-be-bought"
  ],
  "3246": [
    "Check if Bitwise OR Has Trailing Zeros",
    "Easy",
    "check-if-bitwise-or-has-trailing-zeros"
  ],
  "3267": [
    "Find Longest Special Substring That Occurs Thrice I",
    "Medium",
    "find-longest-special-substring-that-occurs-thrice-i"
  ],
  "3266": [
    "Find Longest Special Substring That Occurs Thrice II",
    "Medium",
    "find-longest-special-substring-that-occurs-thrice-ii"
  ],
  "3203": [
    "Palindrome Rearrangement Queries",
    "Hard",
    "palindrome-rearrangement-queries"
  ],
  "3281": [
    "Find Peak Calling Hours for Each City",
    "Medium",
    "find-peak-calling-hours-for-each-city"
  ],
  "3282": [
    "Calculate Compressed Mean",
    "Easy",
    "calculate-compressed-mean"
  ],
  "3283": [
    "Find Third Transaction",
    "Medium",
    "find-third-transaction"
  ],
  "3284": [
    "Find Expensive Cities",
    "Easy",
    "find-expensive-cities"
  ],
  "3285": [
    "Manager of the Largest Department",
    "Medium",
    "manager-of-the-largest-department"
  ],
  "3286": [
    "Class Performance",
    "Medium",
    "class-performance"
  ],
  "3287": [
    "Loan Types",
    "Easy",
    "loan-types"
  ],
  "3288": [
    "Top Three Wineries ",
    "Hard",
    "top-three-wineries"
  ],
  "3294": [
    "Number of Self-Divisible Permutations",
    "Medium",
    "number-of-self-divisible-permutations"
  ],
  "3300": [
    "Friday Purchases I",
    "Medium",
    "friday-purchases-i"
  ],
  "3301": [
    "Friday Purchases II ",
    "Hard",
    "friday-purchases-ii"
  ],
  "3302": [
    "Viewers Turned Streamers",
    "Hard",
    "viewers-turned-streamers"
  ],
  "3236": [
    "Smallest Missing Integer Greater Than Sequential Prefix Sum",
    "Easy",
    "smallest-missing-integer-greater-than-sequential-prefix-sum"
  ],
  "3249": [
    "Minimum Number of Operations to Make Array XOR Equal to K",
    "Medium",
    "minimum-number-of-operations-to-make-array-xor-equal-to-k"
  ],
  "3239": [
    "Minimum Number of Operations to Make X and Y Equal",
    "Medium",
    "minimum-number-of-operations-to-make-x-and-y-equal"
  ],
  "3243": [
    "Count the Number of Powerful Integers",
    "Hard",
    "count-the-number-of-powerful-integers"
  ],
  "3251": [
    "Maximum Area of Longest Diagonal Rectangle",
    "Easy",
    "maximum-area-of-longest-diagonal-rectangle"
  ],
  "3270": [
    "Minimum Moves to Capture The Queen",
    "Medium",
    "minimum-moves-to-capture-the-queen"
  ],
  "3228": [
    "Maximum Size of a Set After Removals",
    "Medium",
    "maximum-size-of-a-set-after-removals"
  ],
  "3233": [
    "Maximize the Number of Partitions After Operations",
    "Hard",
    "maximize-the-number-of-partitions-after-operations"
  ],
  "3304": [
    "Maximum Subtree of the Same Color",
    "Medium",
    "maximum-subtree-of-the-same-color"
  ],
  "3242": [
    "Count Elements With Maximum Frequency",
    "Easy",
    "count-elements-with-maximum-frequency"
  ],
  "3245": [
    "Find Beautiful Indices in the Given Array I",
    "Medium",
    "find-beautiful-indices-in-the-given-array-i"
  ],
  "3240": [
    "Maximum Number That Sum of the Prices Is Less Than or Equal to K",
    "Medium",
    "maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k"
  ],
  "3303": [
    "Find Beautiful Indices in the Given Array II",
    "Hard",
    "find-beautiful-indices-in-the-given-array-ii"
  ],
  "3315": [
    "Maximum Number of Intersections on the Chart",
    "Hard",
    "maximum-number-of-intersections-on-the-chart"
  ],
  "3263": [
    "Divide an Array Into Subarrays With Minimum Cost I",
    "Easy",
    "divide-an-array-into-subarrays-with-minimum-cost-i"
  ],
  "3291": [
    "Find if Array Can Be Sorted",
    "Medium",
    "find-if-array-can-be-sorted"
  ],
  "3244": [
    "Minimize Length of Array Using Operations",
    "Medium",
    "minimize-length-of-array-using-operations"
  ],
  "3260": [
    "Divide an Array Into Subarrays With Minimum Cost II",
    "Hard",
    "divide-an-array-into-subarrays-with-minimum-cost-ii"
  ],
  "3275": [
    "Minimum Number of Pushes to Type Word I",
    "Easy",
    "minimum-number-of-pushes-to-type-word-i"
  ],
  "3271": [
    "Count the Number of Houses at a Certain Distance I",
    "Medium",
    "count-the-number-of-houses-at-a-certain-distance-i"
  ],
  "3276": [
    "Minimum Number of Pushes to Type Word II",
    "Medium",
    "minimum-number-of-pushes-to-type-word-ii"
  ],
  "3310": [
    "Count the Number of Houses at a Certain Distance II",
    "Hard",
    "count-the-number-of-houses-at-a-certain-distance-ii"
  ],
  "3323": [
    "Maximum Number of Removal Queries That Can Be Processed I",
    "Hard",
    "maximum-number-of-removal-queries-that-can-be-processed-i"
  ],
  "3312": [
    "Number of Changing Keys",
    "Easy",
    "number-of-changing-keys"
  ],
  "3299": [
    "Find the Maximum Number of Elements in Subset",
    "Medium",
    "find-the-maximum-number-of-elements-in-subset"
  ],
  "3279": [
    "Alice and Bob Playing Flower Game",
    "Medium",
    "alice-and-bob-playing-flower-game"
  ],
  "3261": [
    "Minimize OR of Remaining Elements Using Operations",
    "Hard",
    "minimize-or-of-remaining-elements-using-operations"
  ],
  "3333": [
    "Find Pattern in Infinite Stream I",
    "Medium",
    "find-pattern-in-infinite-stream-i"
  ],
  "3321": [
    "Type of Triangle",
    "Easy",
    "type-of-triangle"
  ],
  "3278": [
    "Find the Number of Ways to Place People I",
    "Medium",
    "find-the-number-of-ways-to-place-people-i"
  ],
  "3265": [
    "Maximum Good Subarray Sum",
    "Medium",
    "maximum-good-subarray-sum"
  ],
  "3277": [
    "Find the Number of Ways to Place People II",
    "Hard",
    "find-the-number-of-ways-to-place-people-ii"
  ],
  "3311": [
    "Ant on the Boundary",
    "Easy",
    "ant-on-the-boundary"
  ],
  "3297": [
    "Minimum Time to Revert Word to Initial State I",
    "Medium",
    "minimum-time-to-revert-word-to-initial-state-i"
  ],
  "3272": [
    "Find the Grid of Region Average",
    "Medium",
    "find-the-grid-of-region-average"
  ],
  "3296": [
    "Minimum Time to Revert Word to Initial State II",
    "Hard",
    "minimum-time-to-revert-word-to-initial-state-ii"
  ],
  "3343": [
    "Count Numbers With Unique Digits II",
    "Easy",
    "count-numbers-with-unique-digits-ii"
  ],
  "3330": [
    "Modify the Matrix",
    "Easy",
    "modify-the-matrix"
  ],
  "3269": [
    "Number of Subarrays That Match a Pattern I",
    "Medium",
    "number-of-subarrays-that-match-a-pattern-i"
  ],
  "3317": [
    "Maximum Palindromes After Operations",
    "Medium",
    "maximum-palindromes-after-operations"
  ],
  "3290": [
    "Number of Subarrays That Match a Pattern II",
    "Hard",
    "number-of-subarrays-that-match-a-pattern-ii"
  ],
  "3352": [
    "Find Pattern in Infinite Stream II",
    "Hard",
    "find-pattern-in-infinite-stream-ii"
  ],
  "3320": [
    "Maximum Number of Operations With the Same Score I",
    "Easy",
    "maximum-number-of-operations-with-the-same-score-i"
  ],
  "3308": [
    "Apply Operations to Make String Empty",
    "Medium",
    "apply-operations-to-make-string-empty"
  ],
  "3318": [
    "Maximum Number of Operations With the Same Score II",
    "Medium",
    "maximum-number-of-operations-with-the-same-score-ii"
  ],
  "3298": [
    "Maximize Consecutive Elements in an Array After Modification",
    "Hard",
    "maximize-consecutive-elements-in-an-array-after-modification"
  ],
  "3309": [
    "Count Prefix and Suffix Pairs I",
    "Easy",
    "count-prefix-and-suffix-pairs-i"
  ],
  "3329": [
    "Find the Length of the Longest Common Prefix",
    "Medium",
    "find-the-length-of-the-longest-common-prefix"
  ],
  "3314": [
    "Most Frequent Prime",
    "Medium",
    "most-frequent-prime"
  ],
  "3305": [
    "Count Prefix and Suffix Pairs II",
    "Hard",
    "count-prefix-and-suffix-pairs-ii"
  ],
  "3324": [
    "Split the Array",
    "Easy",
    "split-the-array"
  ],
  "3325": [
    "Find the Largest Area of Square Inside Two Rectangles",
    "Medium",
    "find-the-largest-area-of-square-inside-two-rectangles"
  ],
  "3292": [
    "Earliest Second to Mark Indices I",
    "Medium",
    "earliest-second-to-mark-indices-i"
  ],
  "3289": [
    "Earliest Second to Mark Indices II",
    "Hard",
    "earliest-second-to-mark-indices-ii"
  ],
  "3255": [
    "Pizza Toppings Cost Analysis",
    "Medium",
    "pizza-toppings-cost-analysis"
  ],
  "3256": [
    "Find Candidates for Data Scientist Position",
    "Easy",
    "find-candidates-for-data-scientist-position"
  ],
  "3257": [
    "Maximize Items",
    "Hard",
    "maximize-items"
  ],
  "3258": [
    "Classifying Triangles by Lengths",
    "Easy",
    "classifying-triangles-by-lengths"
  ],
  "3259": [
    "Binary Tree Nodes",
    "Medium",
    "binary-tree-nodes"
  ],
  "3339": [
    "Top Percentile Fraud",
    "Medium",
    "top-percentile-fraud"
  ],
  "3340": [
    "Snaps Analysis",
    "Medium",
    "snaps-analysis"
  ],
  "3357": [
    "Employees Project Allocation",
    "Hard",
    "employees-project-allocation"
  ],
  "3358": [
    "Friends With No Mutual Friends",
    "Medium",
    "friends-with-no-mutual-friends"
  ],
  "3365": [
    "Find All Unique Email Domains",
    "Easy",
    "find-all-unique-email-domains"
  ],
  "3366": [
    "User Activities within Time Bounds",
    "Hard",
    "user-activities-within-time-bounds"
  ],
  "3369": [
    "Calculate Trapping Rain Water",
    "Hard",
    "calculate-trapping-rain-water"
  ],
  "3368": [
    "Winner of the Linked List Game",
    "Easy",
    "winner-of-the-linked-list-game"
  ],
  "3359": [
    "Linked List Frequency",
    "Easy",
    "linked-list-frequency"
  ],
  "3370": [
    "Guess the Number Using Bitwise Questions I",
    "Medium",
    "guess-the-number-using-bitwise-questions-i"
  ],
  "3331": [
    "Minimum Operations to Exceed Threshold Value I",
    "Easy",
    "minimum-operations-to-exceed-threshold-value-i"
  ],
  "3332": [
    "Minimum Operations to Exceed Threshold Value II",
    "Medium",
    "minimum-operations-to-exceed-threshold-value-ii"
  ],
  "3326": [
    "Count Pairs of Connectable Servers in a Weighted Tree Network",
    "Medium",
    "count-pairs-of-connectable-servers-in-a-weighted-tree-network"
  ],
  "3307": [
    "Find the Maximum Sum of Node Values",
    "Hard",
    "find-the-maximum-sum-of-node-values"
  ],
  "3347": [
    "Distribute Elements Into Two Arrays I",
    "Easy",
    "distribute-elements-into-two-arrays-i"
  ],
  "3338": [
    "Count Submatrices with Top-Left Element and Sum Less Than k",
    "Medium",
    "count-submatrices-with-top-left-element-and-sum-less-than-k"
  ],
  "3335": [
    "Minimum Operations to Write the Letter Y on a Grid",
    "Medium",
    "minimum-operations-to-write-the-letter-y-on-a-grid"
  ],
  "3350": [
    "Distribute Elements Into Two Arrays II",
    "Hard",
    "distribute-elements-into-two-arrays-ii"
  ],
  "3378": [
    "Maximum Increasing Triplet Value",
    "Medium",
    "maximum-increasing-triplet-value"
  ],
  "3334": [
    "Apple Redistribution into Boxes",
    "Easy",
    "apple-redistribution-into-boxes"
  ],
  "3351": [
    "Maximize Happiness of Selected Children",
    "Medium",
    "maximize-happiness-of-selected-children"
  ],
  "3356": [
    "Shortest Uncommon Substring in an Array",
    "Medium",
    "shortest-uncommon-substring-in-an-array"
  ],
  "3313": [
    "Maximum Strength of K Disjoint Subarrays",
    "Hard",
    "maximum-strength-of-k-disjoint-subarrays"
  ],
  "3385": [
    "Match Alphanumerical Pattern in Matrix I",
    "Medium",
    "match-alphanumerical-pattern-in-matrix-i"
  ],
  "3367": [
    "Find the Sum of Encrypted Integers",
    "Easy",
    "find-the-sum-of-encrypted-integers"
  ],
  "3306": [
    "Mark Elements on Array by Performing Queries",
    "Medium",
    "mark-elements-on-array-by-performing-queries"
  ],
  "3354": [
    "Replace Question Marks in String to Minimize Its Value",
    "Medium",
    "replace-question-marks-in-string-to-minimize-its-value"
  ],
  "3345": [
    "Find the Sum of the Power of All Subsequences",
    "Hard",
    "find-the-sum-of-the-power-of-all-subsequences"
  ],
  "3353": [
    "Existence of a Substring in a String and Its Reverse",
    "Easy",
    "existence-of-a-substring-in-a-string-and-its-reverse"
  ],
  "3337": [
    "Count Substrings Starting and Ending with Given Character",
    "Medium",
    "count-substrings-starting-and-ending-with-given-character"
  ],
  "3360": [
    "Minimum Deletions to Make String K-Special",
    "Medium",
    "minimum-deletions-to-make-string-k-special"
  ],
  "3327": [
    "Minimum Moves to Pick K Ones",
    "Hard",
    "minimum-moves-to-pick-k-ones"
  ],
  "3392": [
    "Find Trending Hashtags",
    "Medium",
    "find-trending-hashtags"
  ],
  "3393": [
    "Make String Anti-palindrome",
    "Hard",
    "make-string-anti-palindrome"
  ],
  "3400": [
    "Find Bursty Behavior",
    "Medium",
    "find-bursty-behavior"
  ],
  "3349": [
    "Maximum Length Substring With Two Occurrences",
    "Easy",
    "maximum-length-substring-with-two-occurrences"
  ],
  "3328": [
    "Apply Operations to Make Sum of Array Greater Than or Equal to k",
    "Medium",
    "apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k"
  ],
  "3363": [
    "Most Frequent IDs",
    "Medium",
    "most-frequent-ids"
  ],
  "3376": [
    "Longest Common Suffix Queries",
    "Hard",
    "longest-common-suffix-queries"
  ],
  "3401": [
    "Guess the Number Using Bitwise Questions II",
    "Medium",
    "guess-the-number-using-bitwise-questions-ii"
  ],
  "3381": [
    "Shortest Subarray With OR at Least K I",
    "Easy",
    "shortest-subarray-with-or-at-least-k-i"
  ],
  "3355": [
    "Minimum Levels to Gain More Points",
    "Medium",
    "minimum-levels-to-gain-more-points"
  ],
  "3380": [
    "Shortest Subarray With OR at Least K II",
    "Medium",
    "shortest-subarray-with-or-at-least-k-ii"
  ],
  "3316": [
    "Find the Sum of Subsequence Powers",
    "Hard",
    "find-the-sum-of-subsequence-powers"
  ],
  "3371": [
    "Harshad Number",
    "Easy",
    "harshad-number"
  ],
  "3336": [
    "Water Bottles II",
    "Medium",
    "water-bottles-ii"
  ],
  "3374": [
    "Count Alternating Subarrays",
    "Medium",
    "count-alternating-subarrays"
  ],
  "3344": [
    "Minimize Manhattan Distances",
    "Hard",
    "minimize-manhattan-distances"
  ],
  "3409": [
    "Find Trending Hashtags II ",
    "Hard",
    "find-trending-hashtags-ii"
  ],
  "3410": [
    "Find Longest Self-Contained Substring",
    "Hard",
    "find-longest-self-contained-substring"
  ],
  "3372": [
    "Longest Strictly Increasing or Strictly Decreasing Subarray",
    "Easy",
    "longest-strictly-increasing-or-strictly-decreasing-subarray"
  ],
  "3346": [
    "Lexicographically Smallest String After Operations With Constraint",
    "Medium",
    "lexicographically-smallest-string-after-operations-with-constraint"
  ],
  "3387": [
    "Minimum Operations to Make Median of Array Equal to K",
    "Medium",
    "minimum-operations-to-make-median-of-array-equal-to-k"
  ],
  "3348": [
    "Minimum Cost Walk in Weighted Graph",
    "Hard",
    "minimum-cost-walk-in-weighted-graph"
  ],
  "3417": [
    "Find the Index of Permutation",
    "Medium",
    "find-the-index-of-permutation"
  ],
  "3379": [
    "Score of a String",
    "Easy",
    "score-of-a-string"
  ],
  "3390": [
    "Minimum Rectangles to Cover Points",
    "Medium",
    "minimum-rectangles-to-cover-points"
  ],
  "3389": [
    "Minimum Time to Visit Disappearing Nodes",
    "Medium",
    "minimum-time-to-visit-disappearing-nodes"
  ],
  "3382": [
    "Find the Number of Subarrays Where Boundary Elements Are Maximum",
    "Hard",
    "find-the-number-of-subarrays-where-boundary-elements-are-maximum"
  ],
  "3361": [
    "Latest Time You Can Obtain After Replacing Characters",
    "Easy",
    "latest-time-you-can-obtain-after-replacing-characters"
  ],
  "3373": [
    "Maximum Prime Difference",
    "Medium",
    "maximum-prime-difference"
  ],
  "3375": [
    "Kth Smallest Amount With Single Denomination Combination",
    "Hard",
    "kth-smallest-amount-with-single-denomination-combination"
  ],
  "3364": [
    "Minimum Sum of Values by Dividing Array",
    "Hard",
    "minimum-sum-of-values-by-dividing-array"
  ],
  "3424": [
    "Friday Purchase III ",
    "Medium",
    "friday-purchase-iii"
  ],
  "3425": [
    "Maximum Number of Potholes That Can Be Fixed",
    "Medium",
    "maximum-number-of-potholes-that-can-be-fixed"
  ],
  "3408": [
    "Count the Number of Special Characters I",
    "Easy",
    "count-the-number-of-special-characters-i"
  ],
  "3405": [
    "Count the Number of Special Characters II",
    "Medium",
    "count-the-number-of-special-characters-ii"
  ],
  "3404": [
    "Minimum Number of Operations to Satisfy Conditions",
    "Medium",
    "minimum-number-of-operations-to-satisfy-conditions"
  ],
  "3386": [
    "Find Edges in Shortest Paths",
    "Hard",
    "find-edges-in-shortest-paths"
  ],
  "3432": [
    "Find Longest Calls",
    "Medium",
    "find-longest-calls"
  ],
  "3433": [
    "Maximum Number That Makes Result of Bitwise AND Zero",
    "Medium",
    "maximum-number-that-makes-result-of-bitwise-and-zero"
  ],
  "3440": [
    "Server Utilization Time",
    "Medium",
    "server-utilization-time"
  ],
  "3398": [
    "Make a Square with the Same Color",
    "Easy",
    "make-a-square-with-the-same-color"
  ],
  "3388": [
    "Right Triangles",
    "Medium",
    "right-triangles"
  ],
  "3406": [
    "Find All Possible Stable Binary Arrays I",
    "Medium",
    "find-all-possible-stable-binary-arrays-i"
  ],
  "3407": [
    "Find All Possible Stable Binary Arrays II",
    "Hard",
    "find-all-possible-stable-binary-arrays-ii"
  ],
  "3397": [
    "Find the Integer Added to Array I",
    "Easy",
    "find-the-integer-added-to-array-i"
  ],
  "3399": [
    "Find the Integer Added to Array II",
    "Medium",
    "find-the-integer-added-to-array-ii"
  ],
  "3394": [
    "Minimum Array End",
    "Medium",
    "minimum-array-end"
  ],
  "3362": [
    "Find the Median of the Uniqueness Array",
    "Hard",
    "find-the-median-of-the-uniqueness-array"
  ],
  "3441": [
    "Equalize Strings by Adding or Removing Characters at Ends",
    "Medium",
    "equalize-strings-by-adding-or-removing-characters-at-ends"
  ],
  "3396": [
    "Valid Word",
    "Easy",
    "valid-word"
  ],
  "3384": [
    "Minimum Number of Operations to Make Word K-Periodic",
    "Medium",
    "minimum-number-of-operations-to-make-word-k-periodic"
  ],
  "3395": [
    "Minimum Length of Anagram Concatenation",
    "Medium",
    "minimum-length-of-anagram-concatenation"
  ],
  "3402": [
    "Minimum Cost to Equalize Array",
    "Hard",
    "minimum-cost-to-equalize-array"
  ],
  "3448": [
    "Consecutive Available Seats II",
    "Medium",
    "consecutive-available-seats-ii"
  ],
  "3449": [
    "Maximum Hamming Distances",
    "Hard",
    "maximum-hamming-distances"
  ],
  "3415": [
    "Check if Grid Satisfies Conditions",
    "Easy",
    "check-if-grid-satisfies-conditions"
  ],
  "3419": [
    "Maximum Points Inside the Square",
    "Medium",
    "maximum-points-inside-the-square"
  ],
  "3403": [
    "Minimum Substring Partition of Equal Character Frequency",
    "Medium",
    "minimum-substring-partition-of-equal-character-frequency"
  ],
  "3411": [
    "Find Products of Elements of Big Array",
    "Hard",
    "find-products-of-elements-of-big-array"
  ],
  "3412": [
    "Permutation Difference between Two Strings",
    "Easy",
    "permutation-difference-between-two-strings"
  ],
  "3383": [
    "Taking Maximum Energy From the Mystic Dungeon",
    "Medium",
    "taking-maximum-energy-from-the-mystic-dungeon"
  ],
  "3391": [
    "Maximum Difference Score in a Grid",
    "Medium",
    "maximum-difference-score-in-a-grid"
  ],
  "3431": [
    "Find the Minimum Cost Array Permutation",
    "Hard",
    "find-the-minimum-cost-array-permutation"
  ],
  "3457": [
    "Invalid Tweets II",
    "Easy",
    "invalid-tweets-ii"
  ],
  "3429": [
    "Special Array I",
    "Easy",
    "special-array-i"
  ],
  "3427": [
    "Special Array II",
    "Medium",
    "special-array-ii"
  ],
  "3416": [
    "Sum of Digit Differences of All Pairs",
    "Medium",
    "sum-of-digit-differences-of-all-pairs"
  ],
  "3414": [
    "Find Number of Ways to Reach the K-th Stair",
    "Hard",
    "find-number-of-ways-to-reach-the-k-th-stair"
  ],
  "3458": [
    "Maximum Number of Upgradable Servers",
    "Medium",
    "maximum-number-of-upgradable-servers"
  ],
  "3465": [
    "Employee Task Duration and Concurrent Tasks",
    "Hard",
    "employee-task-duration-and-concurrent-tasks"
  ],
  "3467": [
    "Find the Level of Tree with Minimum Sum",
    "Medium",
    "find-the-level-of-tree-with-minimum-sum"
  ],
  "3428": [
    "Find the XOR of Numbers Which Appear Twice",
    "Easy",
    "find-the-xor-of-numbers-which-appear-twice"
  ],
  "3420": [
    "Find Occurrences of an Element in an Array",
    "Medium",
    "find-occurrences-of-an-element-in-an-array"
  ],
  "3434": [
    "Find the Number of Distinct Colors Among the Balls",
    "Medium",
    "find-the-number-of-distinct-colors-among-the-balls"
  ],
  "3435": [
    "Block Placement Queries",
    "Hard",
    "block-placement-queries"
  ],
  "3446": [
    "Find the Number of Good Pairs I",
    "Easy",
    "find-the-number-of-good-pairs-i"
  ],
  "3451": [
    "String Compression III",
    "Medium",
    "string-compression-iii"
  ],
  "3444": [
    "Find the Number of Good Pairs II",
    "Medium",
    "find-the-number-of-good-pairs-ii"
  ],
  "3423": [
    "Maximum Sum of Subsequence With Non-adjacent Elements",
    "Hard",
    "maximum-sum-of-subsequence-with-non-adjacent-elements"
  ],
  "3473": [
    "Calculate Parking Fees and Duration",
    "Medium",
    "calculate-parking-fees-and-duration"
  ],
  "3474": [
    "Better Compression of String",
    "Medium",
    "better-compression-of-string"
  ],
  "3426": [
    "Minimum Number of Chairs in a Waiting Room",
    "Easy",
    "minimum-number-of-chairs-in-a-waiting-room"
  ],
  "3430": [
    "Count Days Without Meetings",
    "Medium",
    "count-days-without-meetings"
  ],
  "3445": [
    "Lexicographically Minimum String After Removing Stars",
    "Medium",
    "lexicographically-minimum-string-after-removing-stars"
  ],
  "3436": [
    "Find Subarray With Bitwise OR Closest to K",
    "Hard",
    "find-subarray-with-bitwise-or-closest-to-k"
  ],
  "3481": [
    "Second Day Verification",
    "Easy",
    "second-day-verification"
  ],
  "3472": [
    "Bitwise OR of Adjacent Elements",
    "Easy",
    "bitwise-or-of-adjacent-elements"
  ],
  "3447": [
    "Clear Digits",
    "Easy",
    "clear-digits"
  ],
  "3413": [
    "Find The First Player to win K Games in a Row",
    "Medium",
    "find-the-first-player-to-win-k-games-in-a-row"
  ],
  "3456": [
    "Find the Maximum Length of a Good Subsequence I",
    "Medium",
    "find-the-maximum-length-of-a-good-subsequence-i"
  ],
  "3452": [
    "Find the Maximum Length of a Good Subsequence II",
    "Hard",
    "find-the-maximum-length-of-a-good-subsequence-ii"
  ],
  "3450": [
    "Find the Child Who Has the Ball After K Seconds",
    "Easy",
    "find-the-child-who-has-the-ball-after-k-seconds"
  ],
  "3422": [
    "Find the N-th Value After K Seconds",
    "Medium",
    "find-the-n-th-value-after-k-seconds"
  ],
  "3442": [
    "Maximum Total Reward Using Operations I",
    "Medium",
    "maximum-total-reward-using-operations-i"
  ],
  "3443": [
    "Maximum Total Reward Using Operations II",
    "Hard",
    "maximum-total-reward-using-operations-ii"
  ],
  "3488": [
    "Find Top Scoring Students",
    "Medium",
    "find-top-scoring-students"
  ],
  "3489": [
    "The Number of Ways to Make the Sum",
    "Medium",
    "the-number-of-ways-to-make-the-sum"
  ],
  "3421": [
    "Count Pairs That Form a Complete Day I",
    "Easy",
    "count-pairs-that-form-a-complete-day-i"
  ],
  "3418": [
    "Count Pairs That Form a Complete Day II",
    "Medium",
    "count-pairs-that-form-a-complete-day-ii"
  ],
  "3437": [
    "Maximum Total Damage With Spell Casting",
    "Medium",
    "maximum-total-damage-with-spell-casting"
  ],
  "3438": [
    "Peaks in Array",
    "Hard",
    "peaks-in-array"
  ],
  "3503": [
    "Find Top Scoring Students II",
    "Hard",
    "find-top-scoring-students-ii"
  ],
  "3504": [
    "Minimum Moves to Get a Peaceful Board",
    "Medium",
    "minimum-moves-to-get-a-peaceful-board"
  ],
  "3476": [
    "Find Minimum Operations to Make All Elements Divisible by Three",
    "Easy",
    "find-minimum-operations-to-make-all-elements-divisible-by-three"
  ],
  "3475": [
    "Minimum Operations to Make Binary Array Elements Equal to One I",
    "Medium",
    "minimum-operations-to-make-binary-array-elements-equal-to-one-i"
  ],
  "3477": [
    "Minimum Operations to Make Binary Array Elements Equal to One II",
    "Medium",
    "minimum-operations-to-make-binary-array-elements-equal-to-one-ii"
  ],
  "3460": [
    "Count the Number of Inversions",
    "Hard",
    "count-the-number-of-inversions"
  ],
  "3471": [
    "Minimum Average of Smallest and Largest Elements",
    "Easy",
    "minimum-average-of-smallest-and-largest-elements"
  ],
  "3461": [
    "Find the Minimum Area to Cover All Ones I",
    "Medium",
    "find-the-minimum-area-to-cover-all-ones-i"
  ],
  "3464": [
    "Maximize Total Cost of Alternating Subarrays",
    "Medium",
    "maximize-total-cost-of-alternating-subarrays"
  ],
  "3459": [
    "Find the Minimum Area to Cover All Ones II",
    "Hard",
    "find-the-minimum-area-to-cover-all-ones-ii"
  ],
  "3505": [
    "Find Cities in Each State",
    "Easy",
    "find-cities-in-each-state"
  ],
  "3506": [
    "Count Triplets with Even XOR Set Bits I",
    "Easy",
    "count-triplets-with-even-xor-set-bits-i"
  ],
  "3469": [
    "Maximum Height of a Triangle",
    "Easy",
    "maximum-height-of-a-triangle"
  ],
  "3490": [
    "Find the Maximum Length of Valid Subsequence I",
    "Medium",
    "find-the-maximum-length-of-valid-subsequence-i"
  ],
  "3491": [
    "Find the Maximum Length of Valid Subsequence II",
    "Medium",
    "find-the-maximum-length-of-valid-subsequence-ii"
  ],
  "3439": [
    "Find Minimum Diameter After Merging Two Trees",
    "Hard",
    "find-minimum-diameter-after-merging-two-trees"
  ],
  "3512": [
    "Bitwise User Permissions Analysis",
    "Medium",
    "bitwise-user-permissions-analysis"
  ],
  "3513": [
    "Maximum Array Hopping Score I",
    "Medium",
    "maximum-array-hopping-score-i"
  ],
  "3463": [
    "Alternating Groups I",
    "Easy",
    "alternating-groups-i"
  ],
  "3264": [
    "Maximum Points After Enemy Battles",
    "Medium",
    "maximum-points-after-enemy-battles"
  ],
  "3483": [
    "Alternating Groups II",
    "Medium",
    "alternating-groups-ii"
  ],
  "3466": [
    "Number of Subarrays With AND Value of K",
    "Hard",
    "number-of-subarrays-with-and-value-of-k"
  ],
  "3468": [
    "Find the Encrypted String",
    "Easy",
    "find-the-encrypted-string"
  ],
  "3453": [
    "Generate Binary Strings Without Adjacent Zeros",
    "Medium",
    "generate-binary-strings-without-adjacent-zeros"
  ],
  "3492": [
    "Count Submatrices With Equal Frequency of X and Y",
    "Medium",
    "count-submatrices-with-equal-frequency-of-x-and-y"
  ],
  "3482": [
    "Construct String with Minimum Cost",
    "Hard",
    "construct-string-with-minimum-cost"
  ],
  "3520": [
    "Year on Year Growth Rate",
    "Hard",
    "year-on-year-growth-rate"
  ],
  "3521": [
    "Count Triplets with Even XOR Set Bits II",
    "Medium",
    "count-triplets-with-even-xor-set-bits-ii"
  ],
  "3484": [
    "Lexicographically Smallest String After a Swap",
    "Easy",
    "lexicographically-smallest-string-after-a-swap"
  ],
  "3501": [
    "Delete Nodes From Linked List Present in Array",
    "Medium",
    "delete-nodes-from-linked-list-present-in-array"
  ],
  "3494": [
    "Minimum Cost for Cutting Cake I",
    "Medium",
    "minimum-cost-for-cutting-cake-i"
  ],
  "3500": [
    "Minimum Cost for Cutting Cake II",
    "Hard",
    "minimum-cost-for-cutting-cake-ii"
  ],
  "3530": [
    "Odd and Even Transactions",
    "Medium",
    "odd-and-even-transactions"
  ],
  "3529": [
    "Maximum Array Hopping Score II",
    "Medium",
    "maximum-array-hopping-score-ii"
  ],
  "3511": [
    "Find the Winning Player in Coin Game",
    "Easy",
    "find-the-winning-player-in-coin-game"
  ],
  "3455": [
    "Minimum Length of String After Operations",
    "Medium",
    "minimum-length-of-string-after-operations"
  ],
  "3498": [
    "Minimum Array Changes to Make Differences Equal",
    "Medium",
    "minimum-array-changes-to-make-differences-equal"
  ],
  "3470": [
    "Maximum Score From Grid Operations",
    "Hard",
    "maximum-score-from-grid-operations"
  ],
  "3508": [
    "Number of Bit Changes to Make Two Integers Equal",
    "Easy",
    "number-of-bit-changes-to-make-two-integers-equal"
  ],
  "3462": [
    "Vowels Game in a String",
    "Medium",
    "vowels-game-in-a-string"
  ],
  "3493": [
    "Maximum Number of Operations to Move Ones to the End",
    "Medium",
    "maximum-number-of-operations-to-move-ones-to-the-end"
  ],
  "3454": [
    "Minimum Operations to Make Array Equal to Target",
    "Hard",
    "minimum-operations-to-make-array-equal-to-target"
  ],
  "3539": [
    "Customer Purchasing Behavior Analysis",
    "Medium",
    "customer-purchasing-behavior-analysis"
  ],
  "3545": [
    "Minimum Number of Increasing Subsequence to Be Removed",
    "Hard",
    "minimum-number-of-increasing-subsequence-to-be-removed"
  ],
  "3515": [
    "Find if Digit Game Can Be Won",
    "Easy",
    "find-if-digit-game-can-be-won"
  ],
  "3507": [
    "Find the Count of Numbers Which Are Not Special",
    "Medium",
    "find-the-count-of-numbers-which-are-not-special"
  ],
  "3479": [
    "Count the Number of Substrings With Dominant Ones",
    "Medium",
    "count-the-number-of-substrings-with-dominant-ones"
  ],
  "3478": [
    "Check if the Rectangle Corner Is Reachable",
    "Hard",
    "check-if-the-rectangle-corner-is-reachable"
  ],
  "3549": [
    "CEO Subordinate Hierarchy",
    "Hard",
    "ceo-subordinate-hierarchy"
  ],
  "3538": [
    "Alt and Tab Simulation",
    "Medium",
    "alt-and-tab-simulation"
  ],
  "3519": [
    "Find the Number of Winning Players",
    "Easy",
    "find-the-number-of-winning-players"
  ],
  "3526": [
    "Minimum Number of Flips to Make Binary Grid Palindromic I",
    "Medium",
    "minimum-number-of-flips-to-make-binary-grid-palindromic-i"
  ],
  "3524": [
    "Minimum Number of Flips to Make Binary Grid Palindromic II",
    "Medium",
    "minimum-number-of-flips-to-make-binary-grid-palindromic-ii"
  ],
  "3532": [
    "Time Taken to Mark All Nodes",
    "Hard",
    "time-taken-to-mark-all-nodes"
  ],
  "3516": [
    "Design Neighbor Sum Service",
    "Easy",
    "design-neighbor-sum-service"
  ],
  "3517": [
    "Shortest Distance After Road Addition Queries I",
    "Medium",
    "shortest-distance-after-road-addition-queries-i"
  ],
  "3514": [
    "Shortest Distance After Road Addition Queries II",
    "Hard",
    "shortest-distance-after-road-addition-queries-ii"
  ],
  "3527": [
    "Alternating Groups III",
    "Hard",
    "alternating-groups-iii"
  ],
  "3554": [
    "Premier League Table Ranking",
    "Easy",
    "premier-league-table-ranking"
  ],
  "3537": [
    "Number of Subsequences with Odd Sum",
    "Medium",
    "number-of-subsequences-with-odd-sum"
  ],
  "3533": [
    "Snake in Matrix",
    "Easy",
    "snake-in-matrix"
  ],
  "3486": [
    "Count the Number of Good Nodes",
    "Medium",
    "count-the-number-of-good-nodes"
  ],
  "3535": [
    "Find the Count of Monotonic Pairs I",
    "Hard",
    "find-the-count-of-monotonic-pairs-i"
  ],
  "3536": [
    "Find the Count of Monotonic Pairs II",
    "Hard",
    "find-the-count-of-monotonic-pairs-ii"
  ],
  "3564": [
    "Premier League Table Ranking II",
    "Medium",
    "premier-league-table-ranking-ii"
  ],
  "3480": [
    "Construct String with Minimum Cost (Easy)",
    "Medium",
    "construct-string-with-minimum-cost-easy"
  ],
  "3522": [
    "Find the Power of K-Size Subarrays I",
    "Medium",
    "find-the-power-of-k-size-subarrays-i"
  ],
  "3523": [
    "Find the Power of K-Size Subarrays II",
    "Medium",
    "find-the-power-of-k-size-subarrays-ii"
  ],
  "3550": [
    "Maximum Value Sum by Placing Three Rooks I",
    "Hard",
    "maximum-value-sum-by-placing-three-rooks-i"
  ],
  "3542": [
    "Maximum Value Sum by Placing Three Rooks II",
    "Hard",
    "maximum-value-sum-by-placing-three-rooks-ii"
  ],
  "3543": [
    "Count Substrings That Satisfy K-Constraint I",
    "Easy",
    "count-substrings-that-satisfy-k-constraint-i"
  ],
  "3525": [
    "Maximum Energy Boost From Two Drinks",
    "Medium",
    "maximum-energy-boost-from-two-drinks"
  ],
  "3552": [
    "Find the Largest Palindrome Divisible by K",
    "Hard",
    "find-the-largest-palindrome-divisible-by-k"
  ],
  "3546": [
    "Count Substrings That Satisfy K-Constraint II",
    "Hard",
    "count-substrings-that-satisfy-k-constraint-ii"
  ],
  "3574": [
    "Find Overlapping Shifts",
    "Medium",
    "find-overlapping-shifts"
  ],
  "3577": [
    "Convert Doubly Linked List to Array I",
    "Easy",
    "convert-doubly-linked-list-to-array-i"
  ],
  "3555": [
    "Final Array State After K Multiplication Operations I",
    "Easy",
    "final-array-state-after-k-multiplication-operations-i"
  ],
  "3534": [
    "Count Almost Equal Pairs I",
    "Medium",
    "count-almost-equal-pairs-i"
  ],
  "3556": [
    "Final Array State After K Multiplication Operations II",
    "Hard",
    "final-array-state-after-k-multiplication-operations-ii"
  ],
  "3544": [
    "Count Almost Equal Pairs II",
    "Hard",
    "count-almost-equal-pairs-ii"
  ],
  "3585": [
    "Find Overlapping Shifts II",
    "Hard",
    "find-overlapping-shifts-ii"
  ],
  "3586": [
    "Constructing Two Increasing Arrays",
    "Hard",
    "constructing-two-increasing-arrays"
  ],
  "3568": [
    "Find the Key of the Numbers",
    "Easy",
    "find-the-key-of-the-numbers"
  ],
  "3540": [
    "Hash Divided String",
    "Medium",
    "hash-divided-string"
  ],
  "3548": [
    "Find the Count of Good Integers",
    "Hard",
    "find-the-count-of-good-integers"
  ],
  "3531": [
    "Minimum Amount of Damage Dealt to Bob",
    "Hard",
    "minimum-amount-of-damage-dealt-to-bob"
  ],
  "3553": [
    "Check if Two Chessboard Squares Have the Same Color",
    "Easy",
    "check-if-two-chessboard-squares-have-the-same-color"
  ],
  "3495": [
    "K-th Nearest Obstacle Queries",
    "Medium",
    "k-th-nearest-obstacle-queries"
  ],
  "3563": [
    "Select Cells in Grid With Maximum Score",
    "Hard",
    "select-cells-in-grid-with-maximum-score"
  ],
  "3551": [
    "Maximum XOR Score Subarray Queries",
    "Hard",
    "maximum-xor-score-subarray-queries"
  ],
  "3589": [
    "Find Candidates for Data Scientist Position II",
    "Medium",
    "find-candidates-for-data-scientist-position-ii"
  ],
  "3590": [
    "Maximum Total Area Occupied by Pistons",
    "Hard",
    "maximum-total-area-occupied-by-pistons"
  ],
  "3567": [
    "Convert Date to Binary",
    "Easy",
    "convert-date-to-binary"
  ],
  "3485": [
    "Maximize Score of Numbers in Ranges",
    "Medium",
    "maximize-score-of-numbers-in-ranges"
  ],
  "3528": [
    "Reach End of Array With Max Score",
    "Medium",
    "reach-end-of-array-with-max-score"
  ],
  "3560": [
    "Maximum Number of Moves to Kill All Pawns",
    "Hard",
    "maximum-number-of-moves-to-kill-all-pawns"
  ],
  "3602": [
    "Sum of Consecutive Subarrays",
    "Medium",
    "sum-of-consecutive-subarrays"
  ],
  "3582": [
    "Find Indices of Stable Mountains",
    "Easy",
    "find-indices-of-stable-mountains"
  ],
  "3558": [
    "Find a Safe Walk Through a Grid",
    "Medium",
    "find-a-safe-walk-through-a-grid"
  ],
  "3575": [
    "Find the Maximum Sequence Value of Array",
    "Hard",
    "find-the-maximum-sequence-value-of-array"
  ],
  "3571": [
    "Length of the Longest Increasing Path",
    "Hard",
    "length-of-the-longest-increasing-path"
  ],
  "3581": [
    "The Two Sneaky Numbers of Digitville",
    "Easy",
    "the-two-sneaky-numbers-of-digitville"
  ],
  "3518": [
    "Maximum Multiplication Score",
    "Medium",
    "maximum-multiplication-score"
  ],
  "3559": [
    "Minimum Number of Valid Strings to Form Target I",
    "Medium",
    "minimum-number-of-valid-strings-to-form-target-i"
  ],
  "3557": [
    "Minimum Number of Valid Strings to Form Target II",
    "Hard",
    "minimum-number-of-valid-strings-to-form-target-ii"
  ],
  "3609": [
    "Calculate Product Final Price",
    "Medium",
    "calculate-product-final-price"
  ],
  "3615": [
    "Convert Doubly Linked List to Array II",
    "Medium",
    "convert-doubly-linked-list-to-array-ii"
  ],
  "3541": [
    "Report Spam Message",
    "Medium",
    "report-spam-message"
  ],
  "3496": [
    "Minimum Number of Seconds to Make Mountain Height Zero",
    "Medium",
    "minimum-number-of-seconds-to-make-mountain-height-zero"
  ],
  "3573": [
    "Count Substrings That Can Be Rearranged to Contain a String I",
    "Medium",
    "count-substrings-that-can-be-rearranged-to-contain-a-string-i"
  ],
  "3572": [
    "Count Substrings That Can Be Rearranged to Contain a String II",
    "Hard",
    "count-substrings-that-can-be-rearranged-to-contain-a-string-ii"
  ],
  "3623": [
    "Sum of Consecutive Subsequences",
    "Hard",
    "sum-of-consecutive-subsequences"
  ],
  "3606": [
    "Minimum Element After Replacement With Digit Sum",
    "Easy",
    "minimum-element-after-replacement-with-digit-sum"
  ],
  "3510": [
    "Maximize the Total Height of Unique Towers",
    "Medium",
    "maximize-the-total-height-of-unique-towers"
  ],
  "3584": [
    "Find the Lexicographically Smallest Valid Sequence",
    "Medium",
    "find-the-lexicographically-smallest-valid-sequence"
  ],
  "3580": [
    "Find the Occurrence of First Almost Equal Substring",
    "Hard",
    "find-the-occurrence-of-first-almost-equal-substring"
  ],
  "3600": [
    "Find the K-th Character in String Game I",
    "Easy",
    "find-the-k-th-character-in-string-game-i"
  ],
  "3570": [
    "Count of Substrings Containing Every Vowel and K Consonants I",
    "Medium",
    "count-of-substrings-containing-every-vowel-and-k-consonants-i"
  ],
  "3569": [
    "Count of Substrings Containing Every Vowel and K Consonants II",
    "Medium",
    "count-of-substrings-containing-every-vowel-and-k-consonants-ii"
  ],
  "3601": [
    "Find the K-th Character in String Game II",
    "Hard",
    "find-the-k-th-character-in-string-game-ii"
  ],
  "3624": [
    "Find Top Performing Driver",
    "Medium",
    "find-top-performing-driver"
  ],
  "3579": [
    "Maximum Possible Number by Binary Concatenation",
    "Medium",
    "maximum-possible-number-by-binary-concatenation"
  ],
  "3561": [
    "Remove Methods From Project",
    "Medium",
    "remove-methods-from-project"
  ],
  "3578": [
    "Construct 2D Grid Matching Graph Layout",
    "Hard",
    "construct-2d-grid-matching-graph-layout"
  ],
  "3583": [
    "Sorted GCD Pair Queries",
    "Hard",
    "sorted-gcd-pair-queries"
  ],
  "3497": [
    "Find the Last Marked Nodes in Tree",
    "Hard",
    "find-the-last-marked-nodes-in-tree"
  ],
  "3605": [
    "Construct the Minimum Bitwise Array I",
    "Easy",
    "construct-the-minimum-bitwise-array-i"
  ],
  "3611": [
    "Construct the Minimum Bitwise Array II",
    "Medium",
    "construct-the-minimum-bitwise-array-ii"
  ],
  "3487": [
    "Find Maximum Removals From Source String",
    "Medium",
    "find-maximum-removals-from-source-string"
  ],
  "3604": [
    "Find the Number of Possible Ways for an Event",
    "Hard",
    "find-the-number-of-possible-ways-for-an-event"
  ],
  "3610": [
    "Find X-Sum of All K-Long Subarrays I",
    "Easy",
    "find-x-sum-of-all-k-long-subarrays-i"
  ],
  "3509": [
    "K-th Largest Perfect Subtree Size in Binary Tree",
    "Medium",
    "k-th-largest-perfect-subtree-size-in-binary-tree"
  ],
  "3588": [
    "Count The Number of Winning Sequences",
    "Hard",
    "count-the-number-of-winning-sequences"
  ],
  "3592": [
    "Find X-Sum of All K-Long Subarrays II",
    "Hard",
    "find-x-sum-of-all-k-long-subarrays-ii"
  ],
  "3642": [
    "Premier League Table Ranking III",
    "Medium",
    "premier-league-table-ranking-iii"
  ],
  "3565": [
    "Minimize Connected Groups by Inserting Interval",
    "Medium",
    "minimize-connected-groups-by-inserting-interval"
  ],
  "3566": [
    "Find the Sequence of Strings Appeared on the Screen",
    "Medium",
    "find-the-sequence-of-strings-appeared-on-the-screen"
  ],
  "3502": [
    "Count Substrings With K-Frequency Characters I",
    "Medium",
    "count-substrings-with-k-frequency-characters-i"
  ],
  "3607": [
    "Minimum Division Operations to Make Array Non Decreasing",
    "Medium",
    "minimum-division-operations-to-make-array-non-decreasing"
  ],
  "3603": [
    "Check if DFS Strings Are Palindromes",
    "Hard",
    "check-if-dfs-strings-are-palindromes"
  ],
  "3650": [
    "Find Cities in Each State II",
    "Medium",
    "find-cities-in-each-state-ii"
  ],
  "3499": [
    "Count Substrings With K-Frequency Characters II",
    "Hard",
    "count-substrings-with-k-frequency-characters-ii"
  ],
  "3617": [
    "Find the Original Typed String I",
    "Easy",
    "find-the-original-typed-string-i"
  ],
  "3576": [
    "Find Subtree Sizes After Changes",
    "Medium",
    "find-subtree-sizes-after-changes"
  ],
  "3587": [
    "Maximum Points Tourist Can Earn",
    "Medium",
    "maximum-points-tourist-can-earn"
  ],
  "3618": [
    "Find the Original Typed String II",
    "Hard",
    "find-the-original-typed-string-ii"
  ],
  "3593": [
    "Find the Maximum Factor Score of Array",
    "Medium",
    "find-the-maximum-factor-score-of-array"
  ],
  "3629": [
    "Total Characters in String After Transformations I",
    "Medium",
    "total-characters-in-string-after-transformations-i"
  ],
  "3608": [
    "Find the Number of Subsequences With Equal GCD",
    "Hard",
    "find-the-number-of-subsequences-with-equal-gcd"
  ],
  "3630": [
    "Total Characters in String After Transformations II",
    "Hard",
    "total-characters-in-string-after-transformations-ii"
  ],
  "3660": [
    "Second Highest Salary II",
    "Medium",
    "second-highest-salary-ii"
  ],
  "3614": [
    "Find the Number of K-Even Arrays",
    "Medium",
    "find-the-number-of-k-even-arrays"
  ],
  "3636": [
    "Check Balanced String",
    "Easy",
    "check-balanced-string"
  ],
  "3627": [
    "Find Minimum Time to Reach Last Room I",
    "Medium",
    "find-minimum-time-to-reach-last-room-i"
  ],
  "3628": [
    "Find Minimum Time to Reach Last Room II",
    "Medium",
    "find-minimum-time-to-reach-last-room-ii"
  ],
  "3637": [
    "Count Number of Balanced Permutations",
    "Hard",
    "count-number-of-balanced-permutations"
  ],
  "3679": [
    "Maximum Sized Array",
    "Medium",
    "maximum-sized-array"
  ],
  "3626": [
    "Smallest Divisible Digit Product I",
    "Easy",
    "smallest-divisible-digit-product-i"
  ],
  "3622": [
    "Maximum Frequency of an Element After Performing Operations I",
    "Medium",
    "maximum-frequency-of-an-element-after-performing-operations-i"
  ],
  "3640": [
    "Maximum Frequency of an Element After Performing Operations II",
    "Hard",
    "maximum-frequency-of-an-element-after-performing-operations-ii"
  ],
  "3635": [
    "Smallest Divisible Digit Product II",
    "Hard",
    "smallest-divisible-digit-product-ii"
  ],
  "3612": [
    "Adjacent Increasing Subarrays Detection I",
    "Easy",
    "adjacent-increasing-subarrays-detection-i"
  ],
  "3619": [
    "Adjacent Increasing Subarrays Detection II",
    "Medium",
    "adjacent-increasing-subarrays-detection-ii"
  ],
  "3646": [
    "Sum of Good Subsequences",
    "Hard",
    "sum-of-good-subsequences"
  ],
  "3631": [
    "Count K-Reducible Numbers Less Than N",
    "Hard",
    "count-k-reducible-numbers-less-than-n"
  ],
  "3694": [
    "Minimum Total Operations",
    "Easy",
    "minimum-total-operations"
  ],
  "3616": [
    "Make Array Elements Equal to Zero",
    "Easy",
    "make-array-elements-equal-to-zero"
  ],
  "3639": [
    "Zero Array Transformation I",
    "Medium",
    "zero-array-transformation-i"
  ],
  "3643": [
    "Zero Array Transformation II",
    "Medium",
    "zero-array-transformation-ii"
  ],
  "3658": [
    "Minimize the Maximum Adjacent Element Difference",
    "Hard",
    "minimize-the-maximum-adjacent-element-difference"
  ],
  "3695": [
    "Books with NULL Ratings",
    "Easy",
    "books-with-null-ratings"
  ],
  "3652": [
    "Find Sorted Submatrices With Maximum Element at Most K",
    "Hard",
    "find-sorted-submatrices-with-maximum-element-at-most-k"
  ],
  "3625": [
    "Stone Removal Game",
    "Easy",
    "stone-removal-game"
  ],
  "3591": [
    "Shift Distance Between Two Strings",
    "Medium",
    "shift-distance-between-two-strings"
  ],
  "3647": [
    "Zero Array Transformation III",
    "Medium",
    "zero-array-transformation-iii"
  ],
  "3648": [
    "Find the Maximum Number of Fruits Collected",
    "Hard",
    "find-the-maximum-number-of-fruits-collected"
  ],
  "3644": [
    "Minimum Positive Sum Subarray ",
    "Easy",
    "minimum-positive-sum-subarray"
  ],
  "3595": [
    "Rearrange K Substrings to Form Target String",
    "Medium",
    "rearrange-k-substrings-to-form-target-string"
  ],
  "3654": [
    "Minimum Array Sum",
    "Medium",
    "minimum-array-sum"
  ],
  "3675": [
    "Maximize Sum of Weights after Edge Removals",
    "Hard",
    "maximize-sum-of-weights-after-edge-removals"
  ],
  "3703": [
    "First Letter Capitalization",
    "Hard",
    "first-letter-capitalization"
  ],
  "3710": [
    "Design an Array Statistics Tracker ",
    "Hard",
    "design-an-array-statistics-tracker"
  ],
  "3676": [
    "Smallest Number With All Set Bits",
    "Easy",
    "smallest-number-with-all-set-bits"
  ],
  "3594": [
    "Identify the Largest Outlier in an Array",
    "Medium",
    "identify-the-largest-outlier-in-an-array"
  ],
  "3633": [
    "Maximize the Number of Target Nodes After Connecting Trees I",
    "Medium",
    "maximize-the-number-of-target-nodes-after-connecting-trees-i"
  ],
  "3645": [
    "Maximize the Number of Target Nodes After Connecting Trees II",
    "Hard",
    "maximize-the-number-of-target-nodes-after-connecting-trees-ii"
  ],
  "3711": [
    "First Letter Capitalization II",
    "Hard",
    "first-letter-capitalization-ii"
  ],
  "3621": [
    "Minimum Operations to Make Array Values Equal to K",
    "Easy",
    "minimum-operations-to-make-array-values-equal-to-k"
  ],
  "3649": [
    "Minimum Time to Break Locks I",
    "Medium",
    "minimum-time-to-break-locks-i"
  ],
  "3655": [
    "Digit Operations to Make Two Integers Equal",
    "Medium",
    "digit-operations-to-make-two-integers-equal"
  ],
  "3680": [
    "Count Connected Components in LCM Graph",
    "Hard",
    "count-connected-components-in-lcm-graph"
  ],
  "3651": [
    "Transformed Array",
    "Easy",
    "transformed-array"
  ],
  "3681": [
    "Maximum Area Rectangle With Point Constraints I",
    "Medium",
    "maximum-area-rectangle-with-point-constraints-i"
  ],
  "3653": [
    "Maximum Subarray Sum With Length Divisible by K",
    "Medium",
    "maximum-subarray-sum-with-length-divisible-by-k"
  ],
  "3689": [
    "Maximum Area Rectangle With Point Constraints II",
    "Hard",
    "maximum-area-rectangle-with-point-constraints-ii"
  ],
  "3718": [
    "Minimum Runes to Add to Cast Spell",
    "Hard",
    "minimum-runes-to-add-to-cast-spell"
  ],
  "3719": [
    "Team Dominance by Pass Success",
    "Hard",
    "team-dominance-by-pass-success"
  ],
  "3693": [
    "Minimum Time to Break Locks II",
    "Hard",
    "minimum-time-to-break-locks-ii"
  ],
  "3632": [
    "Button with Longest Push Time",
    "Easy",
    "button-with-longest-push-time"
  ],
  "3613": [
    "Maximize Amount After Two Days of Conversions",
    "Medium",
    "maximize-amount-after-two-days-of-conversions"
  ],
  "3686": [
    "Count Beautiful Splits in an Array",
    "Medium",
    "count-beautiful-splits-in-an-array"
  ],
  "3638": [
    "Minimum Operations to Make Character Frequencies Equal",
    "Hard",
    "minimum-operations-to-make-character-frequencies-equal"
  ],
  "3726": [
    "Longest Team Pass Streak",
    "Hard",
    "longest-team-pass-streak"
  ],
  "3735": [
    "Design a 3D Binary Matrix with Efficient Layer Tracking",
    "Medium",
    "design-a-3d-binary-matrix-with-efficient-layer-tracking"
  ],
  "3685": [
    "Count Subarrays of Length Three With a Condition",
    "Easy",
    "count-subarrays-of-length-three-with-a-condition"
  ],
  "3659": [
    "Count Paths With the Given XOR Value",
    "Medium",
    "count-paths-with-the-given-xor-value"
  ],
  "3657": [
    "Check if Grid can be Cut into Sections",
    "Medium",
    "check-if-grid-can-be-cut-into-sections"
  ],
  "3700": [
    "Subsequences with a Unique Middle Mode I",
    "Hard",
    "subsequences-with-a-unique-middle-mode-i"
  ],
  "3656": [
    "Minimum Number of Operations to Make Elements in Array Distinct",
    "Easy",
    "minimum-number-of-operations-to-make-elements-in-array-distinct"
  ],
  "3620": [
    "Maximum Number of Distinct Elements After Operations",
    "Medium",
    "maximum-number-of-distinct-elements-after-operations"
  ],
  "3690": [
    "Smallest Substring With Identical Characters I",
    "Hard",
    "smallest-substring-with-identical-characters-i"
  ],
  "3706": [
    "Smallest Substring With Identical Characters II",
    "Hard",
    "smallest-substring-with-identical-characters-ii"
  ],
  "3740": [
    "Maximum Number of Matching Indices After Right Shifts",
    "Medium",
    "maximum-number-of-matching-indices-after-right-shifts"
  ],
  "3746": [
    "Find Circular Gift Exchange Chains",
    "Hard",
    "find-circular-gift-exchange-chains"
  ],
  "3691": [
    "Minimum Operations to Make Columns Strictly Increasing",
    "Easy",
    "minimum-operations-to-make-columns-strictly-increasing"
  ],
  "3683": [
    "Find the Lexicographically Largest String From the Box I",
    "Medium",
    "find-the-lexicographically-largest-string-from-the-box-i"
  ],
  "3699": [
    "Count Special Subsequences",
    "Medium",
    "count-special-subsequences"
  ],
  "3682": [
    "Count the Number of Arrays with K Matching Adjacent Elements",
    "Hard",
    "count-the-number-of-arrays-with-k-matching-adjacent-elements"
  ],
  "3749": [
    "Find the Lexicographically Largest String From the Box II",
    "Hard",
    "find-the-lexicographically-largest-string-from-the-box-ii"
  ],
  "3684": [
    "Substring Matching Pattern",
    "Easy",
    "substring-matching-pattern"
  ],
  "3678": [
    "Design Task Manager",
    "Medium",
    "design-task-manager"
  ],
  "3716": [
    "Longest Subsequence With Decreasing Adjacent Difference",
    "Medium",
    "longest-subsequence-with-decreasing-adjacent-difference"
  ],
  "3688": [
    "Maximize Subarray Sum After Removing All Occurrences of One Element",
    "Hard",
    "maximize-subarray-sum-after-removing-all-occurrences-of-one-element"
  ],
  "3702": [
    "Maximum Subarray With Equal Products",
    "Easy",
    "maximum-subarray-with-equal-products"
  ],
  "3634": [
    "Find Mirror Score of a String",
    "Medium",
    "find-mirror-score-of-a-string"
  ],
  "3715": [
    "Maximum Coins From K Consecutive Bags",
    "Medium",
    "maximum-coins-from-k-consecutive-bags"
  ],
  "3562": [
    "Maximum Score of Non-overlapping Intervals",
    "Hard",
    "maximum-score-of-non-overlapping-intervals"
  ],
  "3757": [
    "Find Products with Three Consecutive Digits ",
    "Easy",
    "find-products-with-three-consecutive-digits"
  ],
  "3756": [
    "Subsequences with a Unique Middle Mode II",
    "Hard",
    "subsequences-with-a-unique-middle-mode-ii"
  ],
  "3708": [
    "Zigzag Grid Traversal With Skip",
    "Easy",
    "zigzag-grid-traversal-with-skip"
  ],
  "3677": [
    "Maximum Amount of Money Robot Can Earn",
    "Medium",
    "maximum-amount-of-money-robot-can-earn"
  ],
  "3720": [
    "Minimize the Maximum Edge Weight of Graph",
    "Medium",
    "minimize-the-maximum-edge-weight-of-graph"
  ],
  "3674": [
    "Count Non-Decreasing Subarrays After K Operations",
    "Hard",
    "count-non-decreasing-subarrays-after-k-operations"
  ],
  "3767": [
    "Find Students Who Improved",
    "Medium",
    "find-students-who-improved"
  ],
  "3698": [
    "Minimum Operations to Make Subarray Elements Equal",
    "Medium",
    "minimum-operations-to-make-subarray-elements-equal"
  ],
  "3747": [
    "Maximum Difference Between Adjacent Elements in a Circular Array",
    "Easy",
    "maximum-difference-between-adjacent-elements-in-a-circular-array"
  ],
  "3712": [
    "Minimum Cost to Make Arrays Identical",
    "Medium",
    "minimum-cost-to-make-arrays-identical"
  ],
  "3687": [
    "Longest Special Path",
    "Hard",
    "longest-special-path"
  ],
  "3739": [
    "Manhattan Distances of All Arrangements of Pieces",
    "Hard",
    "manhattan-distances-of-all-arrangements-of-pieces"
  ],
  "3731": [
    "Sum of Variable Length Subarrays",
    "Easy",
    "sum-of-variable-length-subarrays"
  ],
  "3714": [
    "Maximum and Minimum Sums of at Most Size K Subsequences",
    "Medium",
    "maximum-and-minimum-sums-of-at-most-size-k-subsequences"
  ],
  "3737": [
    "Paint House IV",
    "Medium",
    "paint-house-iv"
  ],
  "3725": [
    "Maximum and Minimum Sums of at Most Size K Subarrays",
    "Hard",
    "maximum-and-minimum-sums-of-at-most-size-k-subarrays"
  ],
  "3758": [
    "Minimum Unlocked Indices to Sort Nums",
    "Medium",
    "minimum-unlocked-indices-to-sort-nums"
  ],
  "3704": [
    "Count Partitions with Even Sum Difference",
    "Easy",
    "count-partitions-with-even-sum-difference"
  ],
  "3721": [
    "Count Mentions Per User",
    "Medium",
    "count-mentions-per-user"
  ],
  "3751": [
    "Maximum Frequency After Subarray Operation",
    "Medium",
    "maximum-frequency-after-subarray-operation"
  ],
  "3713": [
    "Frequencies of Shortest Supersequences",
    "Hard",
    "frequencies-of-shortest-supersequences"
  ],
  "3782": [
    "Find Valid Emails",
    "Easy",
    "find-valid-emails"
  ],
  "3780": [
    "Permutations III",
    "Medium",
    "permutations-iii"
  ],
  "3736": [
    "Find Valid Pair of Adjacent Digits in String",
    "Easy",
    "find-valid-pair-of-adjacent-digits-in-string"
  ],
  "3743": [
    "Reschedule Meetings for Maximum Free Time I",
    "Medium",
    "reschedule-meetings-for-maximum-free-time-i"
  ],
  "3741": [
    "Reschedule Meetings for Maximum Free Time II",
    "Medium",
    "reschedule-meetings-for-maximum-free-time-ii"
  ],
  "3701": [
    "Minimum Cost Good Caption",
    "Hard",
    "minimum-cost-good-caption"
  ],
  "3753": [
    "Maximum Difference Between Even and Odd Frequency I",
    "Easy",
    "maximum-difference-between-even-and-odd-frequency-i"
  ],
  "3754": [
    "Maximum Manhattan Distance After K Changes",
    "Medium",
    "maximum-manhattan-distance-after-k-changes"
  ],
  "3697": [
    "Minimum Increments for Target Multiples in an Array",
    "Hard",
    "minimum-increments-for-target-multiples-in-an-array"
  ],
  "3761": [
    "Maximum Difference Between Even and Odd Frequency II",
    "Hard",
    "maximum-difference-between-even-and-odd-frequency-ii"
  ],
  "3748": [
    "Sort Matrix by Diagonals",
    "Medium",
    "sort-matrix-by-diagonals"
  ],
  "3760": [
    "Assign Elements to Groups with Constraints",
    "Medium",
    "assign-elements-to-groups-with-constraints"
  ],
  "3696": [
    "Count Substrings Divisible By Last Digit",
    "Hard",
    "count-substrings-divisible-by-last-digit"
  ],
  "3762": [
    "Maximize the Minimum Game Score",
    "Hard",
    "maximize-the-minimum-game-score"
  ],
  "3787": [
    "Maximum Students on a Single Bench",
    "Easy",
    "maximum-students-on-a-single-bench"
  ],
  "3792": [
    "Find Invalid IP Addresses",
    "Hard",
    "find-invalid-ip-addresses"
  ],
  "3723": [
    "Sum of Good Numbers",
    "Easy",
    "sum-of-good-numbers"
  ],
  "3763": [
    "Separate Squares I",
    "Medium",
    "separate-squares-i"
  ],
  "3775": [
    "Separate Squares II",
    "Hard",
    "separate-squares-ii"
  ],
  "3692": [
    "Shortest Matching Substring",
    "Hard",
    "shortest-matching-substring"
  ],
  "3709": [
    "Find Special Substring of Length K",
    "Easy",
    "find-special-substring-of-length-k"
  ],
  "3779": [
    "Eat Pizzas!",
    "Medium",
    "eat-pizzas"
  ],
  "3771": [
    "Select K Disjoint Special Substrings",
    "Medium",
    "select-k-disjoint-special-substrings"
  ],
  "3733": [
    "Length of Longest V-Shaped Diagonal Segment",
    "Hard",
    "length-of-longest-v-shaped-diagonal-segment"
  ],
  "3796": [
    "Longest Common Prefix After at Most One Removal",
    "Medium",
    "longest-common-prefix-after-at-most-one-removal"
  ],
  "3768": [
    "Check If Digits Are Equal in String After Operations I",
    "Easy",
    "check-if-digits-are-equal-in-string-after-operations-i"
  ],
  "3764": [
    "Maximum Sum With at Most K Elements",
    "Medium",
    "maximum-sum-with-at-most-k-elements"
  ],
  "3774": [
    "Check If Digits Are Equal in String After Operations II",
    "Hard",
    "check-if-digits-are-equal-in-string-after-operations-ii"
  ],
  "3781": [
    "Maximize the Distance Between Points on a Square",
    "Hard",
    "maximize-the-distance-between-points-on-a-square"
  ],
  "3803": [
    "Find Products with Valid Serial Numbers",
    "Easy",
    "find-products-with-valid-serial-numbers"
  ],
  "3806": [
    "Maximum Coin Collection ",
    "Medium",
    "maximum-coin-collection"
  ],
  "3778": [
    "Transform Array by Parity",
    "Easy",
    "transform-array-by-parity"
  ],
  "3785": [
    "Find the Number of Copy Arrays",
    "Medium",
    "find-the-number-of-copy-arrays"
  ],
  "3776": [
    "Find Minimum Cost to Remove Array Elements",
    "Medium",
    "find-minimum-cost-to-remove-array-elements"
  ],
  "3783": [
    "Permutations IV",
    "Hard",
    "permutations-iv"
  ],
  "3705": [
    "Find the Largest Almost Missing Integer",
    "Easy",
    "find-the-largest-almost-missing-integer"
  ],
  "3786": [
    "Longest Palindromic Subsequence After at Most K Operations",
    "Medium",
    "longest-palindromic-subsequence-after-at-most-k-operations"
  ],
  "3722": [
    "Sum of K Subarrays With Length at Least M",
    "Medium",
    "sum-of-k-subarrays-with-length-at-least-m"
  ],
  "3770": [
    "Lexicographically Smallest Generated String",
    "Hard",
    "lexicographically-smallest-generated-string"
  ],
  "3816": [
    "DNA Pattern Recognition ",
    "Medium",
    "dna-pattern-recognition"
  ],
  "3818": [
    "Maximize Profit from Task Assignment",
    "Medium",
    "maximize-profit-from-task-assignment"
  ],
  "3790": [
    "Fruits Into Baskets II",
    "Easy",
    "fruits-into-baskets-ii"
  ],
  "3759": [
    "Choose K Elements With Maximum Sum",
    "Medium",
    "choose-k-elements-with-maximum-sum"
  ],
  "3791": [
    "Fruits Into Baskets III",
    "Medium",
    "fruits-into-baskets-iii"
  ],
  "3789": [
    "Maximize Subarrays After Removing One Conflicting Pair",
    "Hard",
    "maximize-subarrays-after-removing-one-conflicting-pair"
  ],
  "3825": [
    "Apply Substitutions",
    "Medium",
    "apply-substitutions"
  ],
  "3828": [
    "Analyze Organization Hierarchy",
    "Hard",
    "analyze-organization-hierarchy"
  ],
  "3799": [
    "Unique 3-Digit Even Numbers",
    "Easy",
    "unique-3-digit-even-numbers"
  ],
  "3797": [
    "Design Spreadsheet",
    "Medium",
    "design-spreadsheet"
  ],
  "3784": [
    "Longest Common Prefix of K Strings After Removal",
    "Hard",
    "longest-common-prefix-of-k-strings-after-removal"
  ],
  "3798": [
    "Longest Special Path II",
    "Hard",
    "longest-special-path-ii"
  ],
  "3788": [
    "Maximum Unique Subarray Sum After Deletion",
    "Easy",
    "maximum-unique-subarray-sum-after-deletion"
  ],
  "3750": [
    "Closest Equal Element Queries",
    "Medium",
    "closest-equal-element-queries"
  ],
  "3795": [
    "Zero Array Transformation IV",
    "Medium",
    "zero-array-transformation-iv"
  ],
  "3801": [
    "Count Beautiful Numbers",
    "Hard",
    "count-beautiful-numbers"
  ],
  "3836": [
    "Phone Number Prefix",
    "Easy",
    "phone-number-prefix"
  ],
  "3817": [
    "Maximum Containers on a Ship",
    "Easy",
    "maximum-containers-on-a-ship"
  ],
  "3809": [
    "Properties Graph",
    "Medium",
    "properties-graph"
  ],
  "3794": [
    "Find the Minimum Amount of Time to Brew Potions",
    "Medium",
    "find-the-minimum-amount-of-time-to-brew-potions"
  ],
  "3744": [
    "Minimum Operations to Make Array Elements Zero",
    "Hard",
    "minimum-operations-to-make-array-elements-zero"
  ],
  "3839": [
    "Maximize Score After Pair Deletions",
    "Medium",
    "maximize-score-after-pair-deletions"
  ],
  "3848": [
    "Analyze Subscription Conversion ",
    "Medium",
    "analyze-subscription-conversion"
  ],
  "3811": [
    "Reverse Degree of a String",
    "Easy",
    "reverse-degree-of-a-string"
  ],
  "3805": [
    "Maximize Active Section with Trade I",
    "Medium",
    "maximize-active-section-with-trade-i"
  ],
  "3765": [
    "Minimum Cost to Divide Array Into Subarrays",
    "Hard",
    "minimum-cost-to-divide-array-into-subarrays"
  ],
  "3804": [
    "Maximize Active Section with Trade II",
    "Hard",
    "maximize-active-section-with-trade-ii"
  ],
  "3832": [
    "Minimum Cost to Reach Every Position",
    "Easy",
    "minimum-cost-to-reach-every-position"
  ],
  "3793": [
    "Longest Palindrome After Substring Concatenation I",
    "Medium",
    "longest-palindrome-after-substring-concatenation-i"
  ],
  "3808": [
    "Longest Palindrome After Substring Concatenation II",
    "Hard",
    "longest-palindrome-after-substring-concatenation-ii"
  ],
  "3717": [
    "Minimum Operations to Make Elements Within K Subarrays Equal",
    "Hard",
    "minimum-operations-to-make-elements-within-k-subarrays-equal"
  ],
  "3814": [
    "Find Time Required to Eliminate Bacterial Strains",
    "Hard",
    "find-time-required-to-eliminate-bacterial-strains"
  ],
  "3773": [
    "Minimum Pair Removal to Sort Array I",
    "Easy",
    "minimum-pair-removal-to-sort-array-i"
  ],
  "3827": [
    "Implement Router",
    "Medium",
    "implement-router"
  ],
  "3777": [
    "Maximum Product of Subsequences With an Alternating Sum Equal to K",
    "Hard",
    "maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k"
  ],
  "3772": [
    "Minimum Pair Removal to Sort Array II",
    "Hard",
    "minimum-pair-removal-to-sort-array-ii"
  ],
  "3855": [
    "Make a Positive Array",
    "Medium",
    "make-a-positive-array"
  ],
  "3846": [
    "Minimum Operations to Make Array Sum Divisible by K",
    "Easy",
    "minimum-operations-to-make-array-sum-divisible-by-k"
  ],
  "3824": [
    "Number of Unique XOR Triplets I",
    "Medium",
    "number-of-unique-xor-triplets-i"
  ],
  "3820": [
    "Number of Unique XOR Triplets II",
    "Medium",
    "number-of-unique-xor-triplets-ii"
  ],
  "3829": [
    "Shortest Path in a Weighted Tree",
    "Hard",
    "shortest-path-in-a-weighted-tree"
  ],
  "3830": [
    "Find Closest Person",
    "Easy",
    "find-closest-person"
  ],
  "3812": [
    "Smallest Palindromic Rearrangement I",
    "Medium",
    "smallest-palindromic-rearrangement-i"
  ],
  "3813": [
    "Smallest Palindromic Rearrangement II",
    "Hard",
    "smallest-palindromic-rearrangement-ii"
  ],
  "3810": [
    "Count Numbers with Non-Decreasing Digits ",
    "Hard",
    "count-numbers-with-non-decreasing-digits"
  ],
  "3861": [
    "Minimum Threshold for Inversion Pairs Count",
    "Medium",
    "minimum-threshold-for-inversion-pairs-count"
  ],
  "3865": [
    "Find Product Recommendation Pairs",
    "Medium",
    "find-product-recommendation-pairs"
  ],
  "3732": [
    "Calculate Score After Performing Instructions",
    "Medium",
    "calculate-score-after-performing-instructions"
  ],
  "3738": [
    "Make Array Non-decreasing",
    "Medium",
    "make-array-non-decreasing"
  ],
  "3831": [
    "Find X Value of Array I",
    "Medium",
    "find-x-value-of-array-i"
  ],
  "3840": [
    "Find X Value of Array II",
    "Hard",
    "find-x-value-of-array-ii"
  ],
  "3862": [
    "Range XOR Queries with Subarray Reversals",
    "Hard",
    "range-xor-queries-with-subarray-reversals"
  ],
  "3707": [
    "Find the Most Common Response",
    "Medium",
    "find-the-most-common-response"
  ],
  "3729": [
    "Unit Conversion I",
    "Medium",
    "unit-conversion-i"
  ],
  "3821": [
    "Count Cells in Overlapping Horizontal and Vertical Substrings",
    "Medium",
    "count-cells-in-overlapping-horizontal-and-vertical-substrings"
  ],
  "3826": [
    "Maximum Profit from Valid Topological Order in DAG",
    "Hard",
    "maximum-profit-from-valid-topological-order-in-dag"
  ],
  "3819": [
    "Count Covered Buildings",
    "Medium",
    "count-covered-buildings"
  ],
  "3838": [
    "Path Existence Queries in a Graph I",
    "Medium",
    "path-existence-queries-in-a-graph-i"
  ],
  "3841": [
    "Concatenated Divisibility",
    "Hard",
    "concatenated-divisibility"
  ],
  "3852": [
    "Path Existence Queries in a Graph II",
    "Hard",
    "path-existence-queries-in-a-graph-ii"
  ],
  "3752": [
    "Unit Conversion II",
    "Medium",
    "unit-conversion-ii"
  ],
  "3859": [
    "Maximum Product of Two Digits",
    "Easy",
    "maximum-product-of-two-digits"
  ],
  "3822": [
    "Fill a Special Grid",
    "Medium",
    "fill-a-special-grid"
  ],
  "3833": [
    "Merge Operations for Minimum Travel Time",
    "Hard",
    "merge-operations-for-minimum-travel-time"
  ],
  "3851": [
    "Find Sum of Array Product of Magical Sequences",
    "Hard",
    "find-sum-of-array-product-of-magical-sequences"
  ],
  "3880": [
    "Minimum Time to Visit All Houses",
    "Medium",
    "minimum-time-to-visit-all-houses"
  ],
  "3872": [
    "Find Most Frequent Vowel and Consonant",
    "Easy",
    "find-most-frequent-vowel-and-consonant"
  ],
  "3834": [
    "Minimum Operations to Convert All Elements to Zero",
    "Medium",
    "minimum-operations-to-convert-all-elements-to-zero"
  ],
  "3856": [
    "Maximum Weighted K-Edge Path",
    "Medium",
    "maximum-weighted-k-edge-path"
  ],
  "3858": [
    "Subtree Inversion Sum",
    "Hard",
    "subtree-inversion-sum"
  ],
  "3871": [
    "Minimum Deletions for At Most K Distinct Characters",
    "Easy",
    "minimum-deletions-for-at-most-k-distinct-characters"
  ],
  "3849": [
    "Equal Sum Grid Partition I",
    "Medium",
    "equal-sum-grid-partition-i"
  ],
  "3845": [
    "Maximum Sum of Edge Values in a Graph",
    "Hard",
    "maximum-sum-of-edge-values-in-a-graph"
  ],
  "3850": [
    "Equal Sum Grid Partition II",
    "Hard",
    "equal-sum-grid-partition-ii"
  ],
  "3883": [
    "Multiply Two Polynomials",
    "Hard",
    "multiply-two-polynomials"
  ],
  "3869": [
    "Smallest Index With Digit Sum Equal to Index",
    "Easy",
    "smallest-index-with-digit-sum-equal-to-index"
  ],
  "3847": [
    "Minimum Swaps to Sort by Digit Sum",
    "Medium",
    "minimum-swaps-to-sort-by-digit-sum"
  ],
  "3837": [
    "Grid Teleportation Traversal",
    "Medium",
    "grid-teleportation-traversal"
  ],
  "3853": [
    "Minimum Weighted Subgraph With the Required Paths II",
    "Hard",
    "minimum-weighted-subgraph-with-the-required-paths-ii"
  ],
  "3891": [
    "Find Category Recommendation Pairs",
    "Hard",
    "find-category-recommendation-pairs"
  ],
  "3890": [
    "Smallest Subarray to Sort in Every Sliding Window",
    "Medium",
    "smallest-subarray-to-sort-in-every-sliding-window"
  ],
  "3815": [
    "Sum of Largest Prime Substrings",
    "Medium",
    "sum-of-largest-prime-substrings"
  ],
  "3857": [
    "Find Maximum Number of Non Intersecting Substrings",
    "Medium",
    "find-maximum-number-of-non-intersecting-substrings"
  ],
  "3844": [
    "Number of Ways to Assign Edge Weights I",
    "Medium",
    "number-of-ways-to-assign-edge-weights-i"
  ],
  "3842": [
    "Number of Ways to Assign Edge Weights II",
    "Hard",
    "number-of-ways-to-assign-edge-weights-ii"
  ],
  "3879": [
    "Find Minimum Log Transportation Cost",
    "Easy",
    "find-minimum-log-transportation-cost"
  ],
  "3860": [
    "Resulting String After Adjacent Removals",
    "Medium",
    "resulting-string-after-adjacent-removals"
  ],
  "3854": [
    "Maximum Profit from Trading Stocks with Discounts",
    "Hard",
    "maximum-profit-from-trading-stocks-with-discounts"
  ],
  "3867": [
    "Lexicographically Smallest String After Adjacent Removals",
    "Hard",
    "lexicographically-smallest-string-after-adjacent-removals"
  ],
  "3898": [
    "Seasonal Sales Analysis",
    "Medium",
    "seasonal-sales-analysis"
  ],
  "3899": [
    "Sequential Grid Path Cover",
    "Medium",
    "sequential-grid-path-cover"
  ],
  "3843": [
    "Partition Array into Two Equal Product Subsets",
    "Medium",
    "partition-array-into-two-equal-product-subsets"
  ],
  "3884": [
    "Minimum Absolute Difference in Sliding Submatrix",
    "Medium",
    "minimum-absolute-difference-in-sliding-submatrix"
  ],
  "3870": [
    "Minimum Moves to Clean the Classroom",
    "Medium",
    "minimum-moves-to-clean-the-classroom"
  ],
  "3878": [
    "Maximize Count of Distinct Primes After Split",
    "Hard",
    "maximize-count-of-distinct-primes-after-split"
  ],
  "3910": [
    "Find Books with No Available Copies",
    "Easy",
    "find-books-with-no-available-copies"
  ],
  "3911": [
    "Find the Shortest Superstring II",
    "Easy",
    "find-the-shortest-superstring-ii"
  ],
  "3894": [
    "Maximize Y\u2011Sum by Picking a Triplet of Distinct X\u2011Values",
    "Medium",
    "maximize-ysum-by-picking-a-triplet-of-distinct-xvalues"
  ],
  "3892": [
    "Best Time to Buy and Sell Stock V",
    "Medium",
    "best-time-to-buy-and-sell-stock-v"
  ],
  "3888": [
    "Maximize Subarray GCD Score",
    "Hard",
    "maximize-subarray-gcd-score"
  ],
  "3875": [
    "Maximum Good Subtree Score",
    "Hard",
    "maximum-good-subtree-score"
  ],
  "3876": [
    "Transform Array to All Equal Elements",
    "Medium",
    "transform-array-to-all-equal-elements"
  ],
  "3864": [
    "Count the Number of Computer Unlocking Permutations",
    "Medium",
    "count-the-number-of-computer-unlocking-permutations"
  ],
  "3835": [
    "Count Partitions With Max-Min Difference at Most K",
    "Medium",
    "count-partitions-with-max-min-difference-at-most-k"
  ],
  "3866": [
    "Minimum Steps to Convert String with Operations",
    "Hard",
    "minimum-steps-to-convert-string-with-operations"
  ],
  "3921": [
    "Find Consistently Improving Employees",
    "Medium",
    "find-consistently-improving-employees"
  ],
  "3924": [
    "Count Odd Letters from Number",
    "Easy",
    "count-odd-letters-from-number"
  ],
  "3893": [
    "Generate Tag for Video Caption",
    "Easy",
    "generate-tag-for-video-caption"
  ],
  "3885": [
    "Count Special Triplets",
    "Medium",
    "count-special-triplets"
  ],
  "3755": [
    "Maximum Product of First and Last Elements of a Subsequence",
    "Medium",
    "maximum-product-of-first-and-last-elements-of-a-subsequence"
  ],
  "3900": [
    "Find Weighted Median Node in Tree",
    "Hard",
    "find-weighted-median-node-in-tree"
  ],
  "3932": [
    "Find COVID Recovery Patients",
    "Medium",
    "find-covid-recovery-patients"
  ],
  "3904": [
    "Minimum Adjacent Swaps to Alternate Parity",
    "Medium",
    "minimum-adjacent-swaps-to-alternate-parity"
  ],
  "3868": [
    "Find Maximum Area of a Triangle",
    "Medium",
    "find-maximum-area-of-a-triangle"
  ],
  "3907": [
    "Count Prime-Gap Balanced Subarrays",
    "Medium",
    "count-prime-gap-balanced-subarrays"
  ],
  "3906": [
    "Kth Smallest Path XOR Sum",
    "Hard",
    "kth-smallest-path-xor-sum"
  ],
  "3914": [
    "Check if Any Element Has Prime Frequency",
    "Easy",
    "check-if-any-element-has-prime-frequency"
  ],
  "3903": [
    "Inverse Coin Change",
    "Medium",
    "inverse-coin-change"
  ],
  "3909": [
    "Minimum Increments to Equalize Leaf Paths",
    "Medium",
    "minimum-increments-to-equalize-leaf-paths"
  ],
  "3896": [
    "Minimum Time to Transport All Individuals",
    "Hard",
    "minimum-time-to-transport-all-individuals"
  ],
  "3935": [
    "Once Twice",
    "Medium",
    "once-twice"
  ],
  "3925": [
    "Minimum Cost Path with Alternating Directions I",
    "Medium",
    "minimum-cost-path-with-alternating-directions-i"
  ],
  "3905": [
    "Partition String ",
    "Medium",
    "partition-string"
  ],
  "3800": [
    "Longest Common Prefix Between Adjacent Strings After Removals",
    "Medium",
    "longest-common-prefix-between-adjacent-strings-after-removals"
  ],
  "3913": [
    "Partition Array to Minimize XOR",
    "Medium",
    "partition-array-to-minimize-xor"
  ],
  "3902": [
    "Maximize Spanning Tree Stability with Upgrades",
    "Hard",
    "maximize-spanning-tree-stability-with-upgrades"
  ],
  "3942": [
    "Find Drivers with Improved Fuel Efficiency",
    "Medium",
    "find-drivers-with-improved-fuel-efficiency"
  ],
  "3912": [
    "Hexadecimal and Hexatrigesimal Conversion",
    "Easy",
    "hexadecimal-and-hexatrigesimal-conversion"
  ],
  "3927": [
    "Minimum Cost Path with Alternating Directions II",
    "Medium",
    "minimum-cost-path-with-alternating-directions-ii"
  ],
  "3916": [
    "Minimum Time to Reach Destination in Directed Graph",
    "Medium",
    "minimum-time-to-reach-destination-in-directed-graph"
  ],
  "3920": [
    "Minimum Stability Factor of Array",
    "Hard",
    "minimum-stability-factor-of-array"
  ],
  "3934": [
    "Coupon Code Validator",
    "Easy",
    "coupon-code-validator"
  ],
  "3863": [
    "Power Grid Maintenance",
    "Medium",
    "power-grid-maintenance"
  ],
  "3908": [
    "Minimum Time for K Connected Components",
    "Medium",
    "minimum-time-for-k-connected-components"
  ],
  "3922": [
    "Minimum Moves to Reach Target in Grid",
    "Hard",
    "minimum-moves-to-reach-target-in-grid"
  ],
  "3949": [
    "Minimum Number of Primes to Sum to Target",
    "Medium",
    "minimum-number-of-primes-to-sum-to-target"
  ],
  "3943": [
    "Find Overbooked Employees",
    "Medium",
    "find-overbooked-employees"
  ],
  "3931": [
    "Process String with Special Operations I",
    "Medium",
    "process-string-with-special-operations-i"
  ],
  "3881": [
    "Minimize Maximum Component Cost",
    "Medium",
    "minimize-maximum-component-cost"
  ],
  "3939": [
    "Process String with Special Operations II",
    "Hard",
    "process-string-with-special-operations-ii"
  ],
  "3930": [
    "Longest Palindromic Path in Graph",
    "Hard",
    "longest-palindromic-path-in-graph"
  ],
  "3960": [
    "Number of Student Replacements",
    "Medium",
    "number-of-student-replacements"
  ],
  "3961": [
    "Find Students with Study Spiral Pattern",
    "Hard",
    "find-students-with-study-spiral-pattern"
  ],
  "3936": [
    "Split Array by Prime Indices",
    "Medium",
    "split-array-by-prime-indices"
  ],
  "3823": [
    "Count Islands With Total Value Divisible by K",
    "Medium",
    "count-islands-with-total-value-divisible-by-k"
  ],
  "3919": [
    "Network Recovery Pathways",
    "Hard",
    "network-recovery-pathways"
  ],
  "3937": [
    "Number of Integers With Popcount-Depth Equal to K I",
    "Hard",
    "number-of-integers-with-popcount-depth-equal-to-k-i"
  ],
  "3918": [
    "Check Divisibility by Digit Sum and Product",
    "Easy",
    "check-divisibility-by-digit-sum-and-product"
  ],
  "3886": [
    "Count Number of Trapezoids I",
    "Medium",
    "count-number-of-trapezoids-i"
  ],
  "3941": [
    "Number of Integers With Popcount-Depth Equal to K II",
    "Hard",
    "number-of-integers-with-popcount-depth-equal-to-k-ii"
  ],
  "3897": [
    "Count Number of Trapezoids II",
    "Hard",
    "count-number-of-trapezoids-ii"
  ],
  "3971": [
    "Find Stores with Inventory Imbalance",
    "Medium",
    "find-stores-with-inventory-imbalance"
  ],
  "3766": [
    "Maximum Median Sum of Subsequences of Size 3",
    "Medium",
    "maximum-median-sum-of-subsequences-of-size-3"
  ],
  "3948": [
    "Maximum Number of Subsequences After One Inserting",
    "Medium",
    "maximum-number-of-subsequences-after-one-inserting"
  ],
  "3933": [
    "Minimum Jumps to Reach End via Prime Teleportation",
    "Medium",
    "minimum-jumps-to-reach-end-via-prime-teleportation"
  ],
  "3882": [
    "Partition Array for Maximum XOR and AND",
    "Hard",
    "partition-array-for-maximum-xor-and-and"
  ],
  "3969": [
    "Sort Threats by Severity and Exploitability",
    "Medium",
    "sort-threats-by-severity-and-exploitability"
  ],
  "3929": [
    "Subarrays with XOR at Least K",
    "Hard",
    "subarrays-with-xor-at-least-k"
  ],
  "3965": [
    "Earliest Finish Time for Land and Water Rides I",
    "Easy",
    "earliest-finish-time-for-land-and-water-rides-i"
  ],
  "3958": [
    "Minimum Removals to Balance Array",
    "Medium",
    "minimum-removals-to-balance-array"
  ],
  "3967": [
    "Earliest Finish Time for Land and Water Rides II",
    "Medium",
    "earliest-finish-time-for-land-and-water-rides-ii"
  ],
  "3955": [
    "Threshold Majority Queries",
    "Hard",
    "threshold-majority-queries"
  ],
  "3952": [
    "Trionic Array I",
    "Easy",
    "trionic-array-i"
  ],
  "3954": [
    "Maximum Balanced Shipments",
    "Medium",
    "maximum-balanced-shipments"
  ],
  "3944": [
    "Minimum Time to Activate String",
    "Medium",
    "minimum-time-to-activate-string"
  ],
  "3956": [
    "Trionic Array II",
    "Hard",
    "trionic-array-ii"
  ],
  "3992": [
    "Longest Semi-Repeating Subarray",
    "Medium",
    "longest-semi-repeating-subarray"
  ],
  "3996": [
    "Find Books with Polarized Opinions",
    "Medium",
    "find-books-with-polarized-opinions"
  ],
  "3973": [
    "Flip Square Submatrix Vertically",
    "Easy",
    "flip-square-submatrix-vertically"
  ],
  "3950": [
    "Maximum K to Sort a Permutation",
    "Medium",
    "maximum-k-to-sort-a-permutation"
  ],
  "3959": [
    "Maximum Total from Optimal Activation Order",
    "Medium",
    "maximum-total-from-optimal-activation-order"
  ],
  "3951": [
    "Next Special Palindrome Number",
    "Hard",
    "next-special-palindrome-number"
  ],
  "3987": [
    "Maximum Weight in Two Bags",
    "Medium",
    "maximum-weight-in-two-bags"
  ],
  "3945": [
    "Minimum Sensors to Cover Grid",
    "Medium",
    "minimum-sensors-to-cover-grid"
  ],
  "3963": [
    "Number of Perfect Pairs",
    "Medium",
    "number-of-perfect-pairs"
  ],
  "3887": [
    "Minimum Cost Path with Edge Reversals",
    "Medium",
    "minimum-cost-path-with-edge-reversals"
  ],
  "3889": [
    "Minimum Cost Path with Teleportations",
    "Hard",
    "minimum-cost-path-with-teleportations"
  ],
  "3980": [
    "Best Time to Buy and Sell Stock using Strategy",
    "Medium",
    "best-time-to-buy-and-sell-stock-using-strategy"
  ],
  "3974": [
    "XOR After Range Multiplication Queries I",
    "Medium",
    "xor-after-range-multiplication-queries-i"
  ],
  "3966": [
    "Minimum Sum After Divisible Sum Deletions",
    "Medium",
    "minimum-sum-after-divisible-sum-deletions"
  ],
  "3975": [
    "XOR After Range Multiplication Queries II",
    "Hard",
    "xor-after-range-multiplication-queries-ii"
  ],
  "4006": [
    "Determine if a Simple Graph Exists",
    "Medium",
    "determine-if-a-simple-graph-exists"
  ],
  "4025": [
    "Find Loyal Customers",
    "Medium",
    "find-loyal-customers"
  ],
  "3995": [
    "GCD of Odd and Even Sums",
    "Easy",
    "gcd-of-odd-and-even-sums"
  ],
  "3979": [
    "Partition Array Into K-Distinct Groups",
    "Medium",
    "partition-array-into-k-distinct-groups"
  ],
  "3981": [
    "Jump Game IX",
    "Medium",
    "jump-game-ix"
  ],
  "3982": [
    "Maximum Walls Destroyed by Robots",
    "Hard",
    "maximum-walls-destroyed-by-robots"
  ],
  "4017": [
    "Filter Characters by Frequency",
    "Easy",
    "filter-characters-by-frequency"
  ],
  "3994": [
    "Find The Least Frequent Digit",
    "Easy",
    "find-the-least-frequent-digit"
  ],
  "3877": [
    "Two-Letter Card Game",
    "Medium",
    "two-letter-card-game"
  ],
  "3938": [
    "Twisted Mirror Path Count",
    "Medium",
    "twisted-mirror-path-count"
  ],
  "3983": [
    "Minimum Operations to Equalize Binary String",
    "Hard",
    "minimum-operations-to-equalize-binary-string"
  ],
  "4029": [
    "Sort Array By Absolute Value",
    "Easy",
    "sort-array-by-absolute-value"
  ],
  "4008": [
    "Restore Finishing Order",
    "Easy",
    "restore-finishing-order"
  ],
  "3947": [
    "Balanced K-Factor Decomposition",
    "Medium",
    "balanced-k-factor-decomposition"
  ],
  "3915": [
    "Maximum Product of Two Integers With No Common Bits",
    "Medium",
    "maximum-product-of-two-integers-with-no-common-bits"
  ],
  "3989": [
    "Sum of Beautiful Subsequences",
    "Hard",
    "sum-of-beautiful-subsequences"
  ],
  "4036": [
    "Sum of Weighted Modes in Subarrays",
    "Medium",
    "sum-of-weighted-modes-in-subarrays"
  ],
  "4043": [
    "Find Zombie Sessions",
    "Hard",
    "find-zombie-sessions"
  ],
  "3998": [
    "Minimum Operations to Equalize Array",
    "Easy",
    "minimum-operations-to-equalize-array"
  ],
  "3999": [
    "Minimum Operations to Transform String",
    "Medium",
    "minimum-operations-to-transform-string"
  ],
  "4000": [
    "Count Bowl Subarrays",
    "Medium",
    "count-bowl-subarrays"
  ],
  "4023": [
    "Count Binary Palindromic Numbers",
    "Hard",
    "count-binary-palindromic-numbers"
  ],
  "4011": [
    "Smallest Absent Positive Greater Than Average",
    "Easy",
    "smallest-absent-positive-greater-than-average"
  ],
  "3953": [
    " Minimum Discards to Balance Inventory",
    "Medium",
    "minimum-discards-to-balance-inventory"
  ],
  "3991": [
    "Generate Schedule",
    "Medium",
    "generate-schedule"
  ],
  "3990": [
    "Maximum XOR of Subsequences",
    "Hard",
    "maximum-xor-of-subsequences"
  ],
  "4050": [
    "Minimum Index Sum of Common Elements",
    "Medium",
    "minimum-index-sum-of-common-elements"
  ],
  "4012": [
    "Earliest Time to Finish One Task",
    "Easy",
    "earliest-time-to-finish-one-task"
  ],
  "3997": [
    "Maximize Sum of At Most K Distinct Elements",
    "Easy",
    "maximize-sum-of-at-most-k-distinct-elements"
  ],
  "3873": [
    "Subsequence Sum After Capping Elements",
    "Medium",
    "subsequence-sum-after-capping-elements"
  ],
  "4027": [
    "Number of Stable Subsequences",
    "Hard",
    "number-of-stable-subsequences"
  ],
  "4060": [
    "Library Late Fee Calculator",
    "Easy",
    "library-late-fee-calculator"
  ],
  "4009": [
    "Bitwise OR of Even Numbers in an Array",
    "Easy",
    "bitwise-or-of-even-numbers-in-an-array"
  ],
  "4005": [
    "Maximum Total Subarray Value I",
    "Medium",
    "maximum-total-subarray-value-i"
  ],
  "3928": [
    "Split and Merge Array Transformation",
    "Medium",
    "split-and-merge-array-transformation"
  ],
  "4007": [
    "Maximum Total Subarray Value II",
    "Hard",
    "maximum-total-subarray-value-ii"
  ],
  "4053": [
    "Majority Frequency Characters",
    "Easy",
    "majority-frequency-characters"
  ],
  "4041": [
    "Climbing Stairs II",
    "Medium",
    "climbing-stairs-ii"
  ],
  "4021": [
    "Distinct Points Reachable After Substring Removal",
    "Medium",
    "distinct-points-reachable-after-substring-removal"
  ],
  "4010": [
    "Maximize Alternating Sum Using Swaps",
    "Hard",
    "maximize-alternating-sum-using-swaps"
  ],
  "4066": [
    "Maximum Distance Between Unequal Words in Array I",
    "Easy",
    "maximum-distance-between-unequal-words-in-array-i"
  ],
  "4039": [
    "Compute Decimal Representation",
    "Easy",
    "compute-decimal-representation"
  ],
  "4015": [
    "Split Array With Minimum Difference",
    "Medium",
    "split-array-with-minimum-difference"
  ],
  "3962": [
    "Number of ZigZag Arrays I",
    "Hard",
    "number-of-zigzag-arrays-i"
  ],
  "3964": [
    "Number of ZigZag Arrays II",
    "Hard",
    "number-of-zigzag-arrays-ii"
  ],
  "4058": [
    "Compute Alternating Sum",
    "Easy",
    "compute-alternating-sum"
  ],
  "4033": [
    "Longest Subsequence With Non-Zero Bitwise XOR",
    "Medium",
    "longest-subsequence-with-non-zero-bitwise-xor"
  ],
  "4019": [
    "Remove K-Balanced Substrings",
    "Medium",
    "remove-k-balanced-substrings"
  ],
  "4049": [
    "Count No-Zero Pairs That Sum to N",
    "Hard",
    "count-no-zero-pairs-that-sum-to-n"
  ],
  "4091": [
    "Find Golden Hour Customers",
    "Medium",
    "find-golden-hour-customers"
  ],
  "4070": [
    "Maximum Distance Between Unequal Words in Array II",
    "Medium",
    "maximum-distance-between-unequal-words-in-array-ii"
  ],
  "4052": [
    "Equal Score Substrings",
    "Easy",
    "equal-score-substrings"
  ],
  "4003": [
    "Longest Fibonacci Subarray",
    "Medium",
    "longest-fibonacci-subarray"
  ],
  "4059": [
    "Design Exam Scores Tracker",
    "Medium",
    "design-exam-scores-tracker"
  ],
  "4035": [
    "Maximum Partition Factor",
    "Hard",
    "maximum-partition-factor"
  ],
  "4081": [
    "Maximum Transactions Without Negative Balance",
    "Medium",
    "maximum-transactions-without-negative-balance"
  ],
  "4068": [
    "Sum of Elements With Frequency Divisible by K",
    "Easy",
    "sum-of-elements-with-frequency-divisible-by-k"
  ],
  "4055": [
    "Longest Balanced Substring I",
    "Medium",
    "longest-balanced-substring-i"
  ],
  "4056": [
    "Longest Balanced Substring II",
    "Medium",
    "longest-balanced-substring-ii"
  ],
  "3957": [
    "Sum of Perfect Square Ancestors",
    "Hard",
    "sum-of-perfect-square-ancestors"
  ],
  "4103": [
    "Find Churn Risk Customers",
    "Medium",
    "find-churn-risk-customers"
  ],
  "4108": [
    "Minimum Operations to Make the Array Beautiful",
    "Medium",
    "minimum-operations-to-make-the-array-beautiful"
  ],
  "4080": [
    "Smallest Missing Multiple of K",
    "Easy",
    "smallest-missing-multiple-of-k"
  ],
  "4045": [
    "Longest Balanced Subarray I",
    "Medium",
    "longest-balanced-subarray-i"
  ],
  "4020": [
    "Lexicographically Smallest Permutation Greater Than Target",
    "Medium",
    "lexicographically-smallest-permutation-greater-than-target"
  ],
  "4047": [
    "Longest Balanced Subarray II",
    "Hard",
    "longest-balanced-subarray-ii"
  ],
  "4073": [
    "Lexicographically Smallest String After Reverse",
    "Medium",
    "lexicographically-smallest-string-after-reverse"
  ],
  "4084": [
    "Maximize Sum of Squares of Digits",
    "Medium",
    "maximize-sum-of-squares-of-digits"
  ],
  "4042": [
    "Minimum Operations to Transform Array",
    "Medium",
    "minimum-operations-to-transform-array"
  ],
  "4069": [
    "Count Ways to Choose Coprime Integers from Rows",
    "Hard",
    "count-ways-to-choose-coprime-integers-from-rows"
  ],
  "4051": [
    "Remove Zeros in Decimal Representation",
    "Easy",
    "remove-zeros-in-decimal-representation"
  ],
  "4078": [
    "Maximum Alternating Sum of Squares",
    "Medium",
    "maximum-alternating-sum-of-squares"
  ],
  "4083": [
    "Stable Subarrays With Equal Boundary and Interior Sum",
    "Medium",
    "stable-subarrays-with-equal-boundary-and-interior-sum"
  ],
  "4063": [
    "Count Distinct Subarrays Divisible by K in Sorted Array",
    "Hard",
    "count-distinct-subarrays-divisible-by-k-in-sorted-array"
  ],
  "4109": [
    "Maximum Calories Burnt from Jumps",
    "Medium",
    "maximum-calories-burnt-from-jumps"
  ],
  "4107": [
    "Find Missing Elements",
    "Easy",
    "find-missing-elements"
  ],
  "4101": [
    "Maximum Product of Three Elements After One Replacement",
    "Medium",
    "maximum-product-of-three-elements-after-one-replacement"
  ],
  "4048": [
    "Minimum Time to Complete All Deliveries",
    "Medium",
    "minimum-time-to-complete-all-deliveries"
  ],
  "4037": [
    "Lexicographically Smallest Palindromic Permutation Greater Than Target",
    "Hard",
    "lexicographically-smallest-palindromic-permutation-greater-than-target"
  ],
  "4106": [
    "Lexicographically Smallest String After Reverse II",
    "Hard",
    "lexicographically-smallest-string-after-reverse-ii"
  ],
  "4116": [
    "Minimum Moves to Equal Array Elements III",
    "Easy",
    "minimum-moves-to-equal-array-elements-iii"
  ],
  "4074": [
    "Count Subarrays With Majority Element I",
    "Medium",
    "count-subarrays-with-majority-element-i"
  ],
  "4098": [
    "Longest Non-Decreasing Subarray After Replacing at Most One Element",
    "Medium",
    "longest-non-decreasing-subarray-after-replacing-at-most-one-element"
  ],
  "4075": [
    "Count Subarrays With Majority Element II",
    "Hard",
    "count-subarrays-with-majority-element-ii"
  ],
  "4115": [
    "Minimum Distance Between Three Equal Elements I",
    "Easy",
    "minimum-distance-between-three-equal-elements-i"
  ],
  "4119": [
    "Minimum Distance Between Three Equal Elements II",
    "Medium",
    "minimum-distance-between-three-equal-elements-ii"
  ],
  "3986": [
    "Maximum Path Score in a Grid",
    "Medium",
    "maximum-path-score-in-a-grid"
  ],
  "4030": [
    "Maximize Cyclic Partition Score",
    "Hard",
    "maximize-cyclic-partition-score"
  ],
  "4113": [
    "Find Kth Character in Expanded String",
    "Medium",
    "find-kth-character-in-expanded-string"
  ],
  "4112": [
    "Maximize Expression of Three Elements",
    "Easy",
    "maximize-expression-of-three-elements"
  ],
  "4090": [
    "Minimum String Length After Balanced Removals",
    "Medium",
    "minimum-string-length-after-balanced-removals"
  ],
  "4054": [
    "Count Distinct Integers After Removing Zeros",
    "Medium",
    "count-distinct-integers-after-removing-zeros"
  ],
  "4110": [
    "Count Stable Subarrays",
    "Hard",
    "count-stable-subarrays"
  ],
  "4140": [
    "Evaluate Valid Expressions",
    "Hard",
    "evaluate-valid-expressions"
  ],
  "4126": [
    "Minimum Number of Flips to Reverse Binary String",
    "Easy",
    "minimum-number-of-flips-to-reverse-binary-string"
  ],
  "4057": [
    "Total Waviness of Numbers in Range I",
    "Medium",
    "total-waviness-of-numbers-in-range-i"
  ],
  "4077": [
    "Lexicographically Smallest Negated Permutation that Sums to Target",
    "Medium",
    "lexicographically-smallest-negated-permutation-that-sums-to-target"
  ],
  "4128": [
    "Total Waviness of Numbers in Range II",
    "Hard",
    "total-waviness-of-numbers-in-range-ii"
  ],
  "4135": [
    "Concatenate Non-Zero Digits and Multiply by Sum I",
    "Easy",
    "concatenate-non-zero-digits-and-multiply-by-sum-i"
  ],
  "3946": [
    "Find Maximum Balanced XOR Subarray Length",
    "Medium",
    "find-maximum-balanced-xor-subarray-length"
  ],
  "4136": [
    "Concatenate Non-Zero Digits and Multiply by Sum II",
    "Medium",
    "concatenate-non-zero-digits-and-multiply-by-sum-ii"
  ],
  "4134": [
    "Number of Effective Subsequences",
    "Hard",
    "number-of-effective-subsequences"
  ],
  "4148": [
    "Convert Number Words to Digits",
    "Medium",
    "convert-number-words-to-digits"
  ],
  "4141": [
    "Count Elements With at Least K Greater Values",
    "Medium",
    "count-elements-with-at-least-k-greater-values"
  ],
  "4087": [
    "Maximum Substrings With Distinct Start",
    "Medium",
    "maximum-substrings-with-distinct-start"
  ],
  "4139": [
    "Minimum Absolute Distance Between Mirror Pairs",
    "Medium",
    "minimum-absolute-distance-between-mirror-pairs"
  ],
  "4022": [
    "Minimum Operations to Equalize Subarrays",
    "Hard",
    "minimum-operations-to-equalize-subarrays"
  ],
  "4166": [
    "Maximum Total Sum with Threshold Constraints",
    "Medium",
    "maximum-total-sum-with-threshold-constraints"
  ],
  "4169": [
    "Most Common Course Pairs",
    "Hard",
    "most-common-course-pairs"
  ],
  "4100": [
    "Complete Prime Number",
    "Medium",
    "complete-prime-number"
  ],
  "4099": [
    "Minimum Operations to Make Binary Palindrome",
    "Medium",
    "minimum-operations-to-make-binary-palindrome"
  ],
  "4089": [
    "Maximize Points After Choosing K Tasks",
    "Medium",
    "maximize-points-after-choosing-k-tasks"
  ],
  "4145": [
    "Minimum Inversion Count in Subarrays of Fixed Length",
    "Hard",
    "minimum-inversion-count-in-subarrays-of-fixed-length"
  ],
  "4150": [
    "Sort Integers by Binary Reflection",
    "Easy",
    "sort-integers-by-binary-reflection"
  ],
  "4085": [
    "Largest Prime from Consecutive Prime Sum",
    "Medium",
    "largest-prime-from-consecutive-prime-sum"
  ],
  "4146": [
    "Total Score of Dungeon Runs",
    "Medium",
    "total-score-of-dungeon-runs"
  ],
  "4151": [
    "Maximum Subgraph Score in a Tree",
    "Hard",
    "maximum-subgraph-score-in-a-tree"
  ],
  "4155": [
    "Maximum Number of Equal Length Runs",
    "Medium",
    "maximum-number-of-equal-length-runs"
  ],
  "4158": [
    "Absolute Difference Between Maximum and Minimum K Elements",
    "Easy",
    "absolute-difference-between-maximum-and-minimum-k-elements"
  ],
  "4157": [
    "Reverse Words With Same Vowel Count",
    "Medium",
    "reverse-words-with-same-vowel-count"
  ],
  "4018": [
    "Minimum Moves to Balance Circular Array",
    "Medium",
    "minimum-moves-to-balance-circular-array"
  ],
  "4064": [
    "Minimum Deletions to Make Alternating Substring",
    "Hard",
    "minimum-deletions-to-make-alternating-substring"
  ],
  "4127": [
    "Minimum Distance Excluding One Maximum Weighted Edge",
    "Medium",
    "minimum-distance-excluding-one-maximum-weighted-edge"
  ],
  "4162": [
    "Minimum Number of Operations to Have Distinct Elements",
    "Medium",
    "minimum-number-of-operations-to-have-distinct-elements"
  ],
  "4160": [
    "Maximum Sum of Three Numbers Divisible by Three",
    "Medium",
    "maximum-sum-of-three-numbers-divisible-by-three"
  ],
  "4130": [
    "Maximum Score After Binary Swaps",
    "Medium",
    "maximum-score-after-binary-swaps"
  ],
  "4164": [
    "Last Remaining Integer After Alternating Deletion Operations",
    "Hard",
    "last-remaining-integer-after-alternating-deletion-operations"
  ],
  "4168": [
    "Mirror Distance of an Integer",
    "Easy",
    "mirror-distance-of-an-integer"
  ],
  "4138": [
    "Minimum Deletion Cost to Make All Characters Equal",
    "Medium",
    "minimum-deletion-cost-to-make-all-characters-equal"
  ],
  "4061": [
    "Minimum Swaps to Avoid Forbidden Values",
    "Hard",
    "minimum-swaps-to-avoid-forbidden-values"
  ],
  "4072": [
    "Total Sum of Interaction Cost in Tree Groups",
    "Hard",
    "total-sum-of-interaction-cost-in-tree-groups"
  ],
  "4165": [
    "Find Diameter Endpoints of a Tree",
    "Medium",
    "find-diameter-endpoints-of-a-tree"
  ],
  "4173": [
    "Maximum Score of a Split",
    "Medium",
    "maximum-score-of-a-split"
  ],
  "4147": [
    "Minimum Cost to Acquire Required Items",
    "Medium",
    "minimum-cost-to-acquire-required-items"
  ],
  "4175": [
    "Smallest All-Ones Multiple",
    "Medium",
    "smallest-all-ones-multiple"
  ],
  "4095": [
    "Number of Balanced Integers in a Range",
    "Hard",
    "number-of-balanced-integers-in-a-range"
  ],
  "4172": [
    "Sum of Increasing Product Blocks",
    "Medium",
    "sum-of-increasing-product-blocks"
  ],
  "4195": [
    "Find Users with High Token Usage",
    "Easy",
    "find-users-with-high-token-usage"
  ],
  "4177": [
    "Reverse String Prefix",
    "Easy",
    "reverse-string-prefix"
  ],
  "4152": [
    "Minimum Subarray Length With Distinct Sum At Least K",
    "Medium",
    "minimum-subarray-length-with-distinct-sum-at-least-k"
  ],
  "3807": [
    "Find Maximum Value in a Constrained Sequence",
    "Medium",
    "find-maximum-value-in-a-constrained-sequence"
  ],
  "4153": [
    "Count Routes to Climb a Rectangular Grid",
    "Hard",
    "count-routes-to-climb-a-rectangular-grid"
  ],
  "4179": [
    "Largest Even Number",
    "Easy",
    "largest-even-number"
  ],
  "4071": [
    "Word Squares II",
    "Medium",
    "word-squares-ii"
  ],
  "4156": [
    "Minimum Cost to Make Two Binary Strings Equal",
    "Medium",
    "minimum-cost-to-make-two-binary-strings-equal"
  ],
  "4144": [
    "Minimum Cost to Merge Sorted Lists",
    "Hard",
    "minimum-cost-to-merge-sorted-lists"
  ],
  "4132": [
    "Number of Ways to Paint Sheets",
    "Hard",
    "number-of-ways-to-paint-sheets"
  ],
  "4186": [
    "Count Residue Prefixes",
    "Easy",
    "count-residue-prefixes"
  ],
  "4129": [
    "Number of Centered Subarrays",
    "Medium",
    "number-of-centered-subarrays"
  ],
  "4183": [
    "Count Caesar Cipher Pairs",
    "Medium",
    "count-caesar-cipher-pairs"
  ],
  "4154": [
    "Maximum Bitwise AND After Increment Operations",
    "Hard",
    "maximum-bitwise-and-after-increment-operations"
  ],
  "4197": [
    "Minimum Cost to Repair Edges to Traverse a Graph",
    "Medium",
    "minimum-cost-to-repair-edges-to-traverse-a-graph"
  ],
  "4208": [
    "Find Emotionally Consistent Users",
    "Medium",
    "find-emotionally-consistent-users"
  ],
  "4187": [
    "Best Reachable Tower",
    "Medium",
    "best-reachable-tower"
  ],
  "4190": [
    "Minimum Operations to Reach Target Array",
    "Medium",
    "minimum-operations-to-reach-target-array"
  ],
  "4143": [
    "Number of Alternating XOR Partitions",
    "Medium",
    "number-of-alternating-xor-partitions"
  ],
  "4181": [
    "Minimum Edge Toggles on a Tree",
    "Hard",
    "minimum-edge-toggles-on-a-tree"
  ],
  "4178": [
    "Vowel-Consonant Score",
    "Easy",
    "vowel-consonant-score"
  ],
  "4079": [
    "Maximum Capacity Within Budget",
    "Medium",
    "maximum-capacity-within-budget"
  ],
  "4067": [
    "Design Auction System",
    "Medium",
    "design-auction-system"
  ],
  "4086": [
    "Lexicographically Smallest String After Deleting Duplicate Characters",
    "Hard",
    "lexicographically-smallest-string-after-deleting-duplicate-characters"
  ],
  "4207": [
    "Good Indices in a Digit String",
    "Medium",
    "good-indices-in-a-digit-string"
  ],
  "4199": [
    "Minimum Prefix Removal to Make Array Strictly Increasing",
    "Medium",
    "minimum-prefix-removal-to-make-array-strictly-increasing"
  ],
  "4171": [
    "Rotate Non Negative Elements",
    "Medium",
    "rotate-non-negative-elements"
  ],
  "4180": [
    "Pythagorean Distance Nodes in a Tree",
    "Medium",
    "pythagorean-distance-nodes-in-a-tree"
  ],
  "4189": [
    "Find Nth Smallest Integer With K One Bits",
    "Hard",
    "find-nth-smallest-integer-with-k-one-bits"
  ],
  "4201": [
    "Design Order Management System",
    "Medium",
    "design-order-management-system"
  ],
  "4200": [
    "Reverse Letters Then Special Characters in a String",
    "Easy",
    "reverse-letters-then-special-characters-in-a-string"
  ],
  "4176": [
    "Minimum K to Reduce Array Within Limit",
    "Medium",
    "minimum-k-to-reduce-array-within-limit"
  ],
  "4032": [
    "Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND",
    "Medium",
    "longest-strictly-increasing-subsequence-with-non-zero-bitwise-and"
  ],
  "4121": [
    "Minimum Partition Score",
    "Hard",
    "minimum-partition-score"
  ],
  "4194": [
    "Count Monobit Integers",
    "Easy",
    "count-monobit-integers"
  ],
  "4122": [
    "Final Element After Subarray Deletions",
    "Medium",
    "final-element-after-subarray-deletions"
  ],
  "4118": [
    "Design Ride Sharing System",
    "Medium",
    "design-ride-sharing-system"
  ],
  "4198": [
    "Longest Alternating Subarray After Removing At Most One Element",
    "Hard",
    "longest-alternating-subarray-after-removing-at-most-one-element"
  ],
  "4210": [
    "Median of a Binary Search Tree Level",
    "Medium",
    "median-of-a-binary-search-tree-level"
  ],
  "4227": [
    "Find Users with Persistent Behavior Patterns",
    "Hard",
    "find-users-with-persistent-behavior-patterns"
  ],
  "4214": [
    "Count Dominant Indices",
    "Easy",
    "count-dominant-indices"
  ],
  "4213": [
    "Merge Adjacent Equal Elements",
    "Medium",
    "merge-adjacent-equal-elements"
  ],
  "4211": [
    "Count Subarrays With Cost Less Than or Equal to K",
    "Medium",
    "count-subarrays-with-cost-less-than-or-equal-to-k"
  ],
  "4202": [
    "Maximum Score Using Exactly K Pairs",
    "Hard",
    "maximum-score-using-exactly-k-pairs"
  ],
  "4228": [
    "Delayed Count of Equal Elements",
    "Medium",
    "delayed-count-of-equal-elements"
  ],
  "4216": [
    "Weighted Word Mapping",
    "Easy",
    "weighted-word-mapping"
  ],
  "4137": [
    "Number of Prefix Connected Groups",
    "Medium",
    "number-of-prefix-connected-groups"
  ],
  "4062": [
    "House Robber V",
    "Medium",
    "house-robber-v"
  ],
  "4209": [
    "Palindromic Path Queries in a Tree",
    "Hard",
    "palindromic-path-queries-in-a-tree"
  ],
  "4212": [
    "Toggle Light Bulbs",
    "Easy",
    "toggle-light-bulbs"
  ],
  "4217": [
    "First Element with Unique Frequency",
    "Medium",
    "first-element-with-unique-frequency"
  ],
  "4221": [
    "Longest Almost-Palindromic Substring",
    "Medium",
    "longest-almost-palindromic-substring"
  ],
  "4204": [
    "Maximum Subarray XOR with Bounded Range",
    "Hard",
    "maximum-subarray-xor-with-bounded-range"
  ],
  "4170": [
    "Total Distance to Type a String Using One Finger",
    "Medium",
    "total-distance-to-type-a-string-using-one-finger"
  ],
  "4224": [
    "Find the Score Difference in a Game",
    "Medium",
    "find-the-score-difference-in-a-game"
  ],
  "4226": [
    "Check Digitorial Permutation",
    "Medium",
    "check-digitorial-permutation"
  ],
  "4044": [
    "Maximum Bitwise XOR After Rearrangement",
    "Medium",
    "maximum-bitwise-xor-after-rearrangement"
  ],
  "4065": [
    "Count Sequences to K",
    "Hard",
    "count-sequences-to-k"
  ],
  "4250": [
    "Maximum Requests Without Violating the Limit",
    "Medium",
    "maximum-requests-without-violating-the-limit"
  ],
  "4231": [
    "Smallest Pair With Different Frequencies",
    "Easy",
    "smallest-pair-with-different-frequencies"
  ],
  "4013": [
    "Merge Close Characters",
    "Medium",
    "merge-close-characters"
  ],
  "4219": [
    "Minimum Operations to Make Array Parity Alternating",
    "Medium",
    "minimum-operations-to-make-array-parity-alternating"
  ],
  "4239": [
    "Sum of K-Digit Numbers in a Range",
    "Hard",
    "sum-of-k-digit-numbers-in-a-range"
  ],
  "4229": [
    "Trim Trailing Vowels",
    "Easy",
    "trim-trailing-vowels"
  ],
  "4024": [
    "Minimum Cost to Split into Ones",
    "Medium",
    "minimum-cost-to-split-into-ones"
  ],
  "4161": [
    "Minimum Bitwise OR From Grid",
    "Medium",
    "minimum-bitwise-or-from-grid"
  ],
  "4002": [
    "Count Subarrays With K Distinct Integers",
    "Hard",
    "count-subarrays-with-k-distinct-integers"
  ]
}