diff --git a/workspaces/archive/problems.jsonl b/workspaces/archive/problems.jsonl
index c15dcecd..67faf552 100644
--- a/workspaces/archive/problems.jsonl
+++ b/workspaces/archive/problems.jsonl
@@ -1,3312 +1,3312 @@
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1,"title":"Two Sum","titleSlug":"two-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2,"title":"Add Two Numbers","titleSlug":"add-two-numbers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3,"title":"Longest Substring Without Repeating Characters","titleSlug":"longest-substring-without-repeating-characters"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":4,"title":"Median of Two Sorted Arrays","titleSlug":"median-of-two-sorted-arrays"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":5,"title":"Longest Palindromic Substring","titleSlug":"longest-palindromic-substring"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":6,"title":"Zigzag Conversion","titleSlug":"zigzag-conversion"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":7,"title":"Reverse Integer","titleSlug":"reverse-integer"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":8,"title":"String to Integer (atoi)","titleSlug":"string-to-integer-atoi"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":9,"title":"Palindrome Number","titleSlug":"palindrome-number"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":10,"title":"Regular Expression Matching","titleSlug":"regular-expression-matching"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":11,"title":"Container With Most Water","titleSlug":"container-with-most-water"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":12,"title":"Integer to Roman","titleSlug":"integer-to-roman"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":13,"title":"Roman to Integer","titleSlug":"roman-to-integer"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":14,"title":"Longest Common Prefix","titleSlug":"longest-common-prefix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":15,"title":"3Sum","titleSlug":"3sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":16,"title":"3Sum Closest","titleSlug":"3sum-closest"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":17,"title":"Letter Combinations of a Phone Number","titleSlug":"letter-combinations-of-a-phone-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":18,"title":"4Sum","titleSlug":"4sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":19,"title":"Remove Nth Node From End of List","titleSlug":"remove-nth-node-from-end-of-list"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":20,"title":"Valid Parentheses","titleSlug":"valid-parentheses"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":21,"title":"Merge Two Sorted Lists","titleSlug":"merge-two-sorted-lists"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":22,"title":"Generate Parentheses","titleSlug":"generate-parentheses"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":23,"title":"Merge k Sorted Lists","titleSlug":"merge-k-sorted-lists"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":24,"title":"Swap Nodes in Pairs","titleSlug":"swap-nodes-in-pairs"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":25,"title":"Reverse Nodes in k-Group","titleSlug":"reverse-nodes-in-k-group"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":26,"title":"Remove Duplicates from Sorted Array","titleSlug":"remove-duplicates-from-sorted-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":27,"title":"Remove Element","titleSlug":"remove-element"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":28,"title":"Find the Index of the First Occurrence in a String","titleSlug":"find-the-index-of-the-first-occurrence-in-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":29,"title":"Divide Two Integers","titleSlug":"divide-two-integers"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":30,"title":"Substring with Concatenation of All Words","titleSlug":"substring-with-concatenation-of-all-words"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":31,"title":"Next Permutation","titleSlug":"next-permutation"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":32,"title":"Longest Valid Parentheses","titleSlug":"longest-valid-parentheses"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":33,"title":"Search in Rotated Sorted Array","titleSlug":"search-in-rotated-sorted-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":34,"title":"Find First and Last Position of Element in Sorted Array","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":35,"title":"Search Insert Position","titleSlug":"search-insert-position"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":36,"title":"Valid Sudoku","titleSlug":"valid-sudoku"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":37,"title":"Sudoku Solver","titleSlug":"sudoku-solver"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":38,"title":"Count and Say","titleSlug":"count-and-say"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":39,"title":"Combination Sum","titleSlug":"combination-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":40,"title":"Combination Sum II","titleSlug":"combination-sum-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":41,"title":"First Missing Positive","titleSlug":"first-missing-positive"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":42,"title":"Trapping Rain Water","titleSlug":"trapping-rain-water"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":43,"title":"Multiply Strings","titleSlug":"multiply-strings"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":44,"title":"Wildcard Matching","titleSlug":"wildcard-matching"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":45,"title":"Jump Game II","titleSlug":"jump-game-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":46,"title":"Permutations","titleSlug":"permutations"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":47,"title":"Permutations II","titleSlug":"permutations-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":48,"title":"Rotate Image","titleSlug":"rotate-image"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":49,"title":"Group Anagrams","titleSlug":"group-anagrams"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":50,"title":"Pow(x, n)","titleSlug":"powx-n"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":51,"title":"N-Queens","titleSlug":"n-queens"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":52,"title":"N-Queens II","titleSlug":"n-queens-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":53,"title":"Maximum Subarray","titleSlug":"maximum-subarray"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":54,"title":"Spiral Matrix","titleSlug":"spiral-matrix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":55,"title":"Jump Game","titleSlug":"jump-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":56,"title":"Merge Intervals","titleSlug":"merge-intervals"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":57,"title":"Insert Interval","titleSlug":"insert-interval"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":58,"title":"Length of Last Word","titleSlug":"length-of-last-word"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":59,"title":"Spiral Matrix II","titleSlug":"spiral-matrix-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":60,"title":"Permutation Sequence","titleSlug":"permutation-sequence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":61,"title":"Rotate List","titleSlug":"rotate-list"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":62,"title":"Unique Paths","titleSlug":"unique-paths"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":63,"title":"Unique Paths II","titleSlug":"unique-paths-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":64,"title":"Minimum Path Sum","titleSlug":"minimum-path-sum"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":65,"title":"Valid Number","titleSlug":"valid-number"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":66,"title":"Plus One","titleSlug":"plus-one"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":67,"title":"Add Binary","titleSlug":"add-binary"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":68,"title":"Text Justification","titleSlug":"text-justification"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":69,"title":"Sqrt(x)","titleSlug":"sqrtx"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":70,"title":"Climbing Stairs","titleSlug":"climbing-stairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":71,"title":"Simplify Path","titleSlug":"simplify-path"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":72,"title":"Edit Distance","titleSlug":"edit-distance"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":73,"title":"Set Matrix Zeroes","titleSlug":"set-matrix-zeroes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":74,"title":"Search a 2D Matrix","titleSlug":"search-a-2d-matrix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":75,"title":"Sort Colors","titleSlug":"sort-colors"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":76,"title":"Minimum Window Substring","titleSlug":"minimum-window-substring"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":77,"title":"Combinations","titleSlug":"combinations"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":78,"title":"Subsets","titleSlug":"subsets"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":79,"title":"Word Search","titleSlug":"word-search"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":80,"title":"Remove Duplicates from Sorted Array II","titleSlug":"remove-duplicates-from-sorted-array-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":81,"title":"Search in Rotated Sorted Array II","titleSlug":"search-in-rotated-sorted-array-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":82,"title":"Remove Duplicates from Sorted List II","titleSlug":"remove-duplicates-from-sorted-list-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":83,"title":"Remove Duplicates from Sorted List","titleSlug":"remove-duplicates-from-sorted-list"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":84,"title":"Largest Rectangle in Histogram","titleSlug":"largest-rectangle-in-histogram"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":85,"title":"Maximal Rectangle","titleSlug":"maximal-rectangle"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":86,"title":"Partition List","titleSlug":"partition-list"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":87,"title":"Scramble String","titleSlug":"scramble-string"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":88,"title":"Merge Sorted Array","titleSlug":"merge-sorted-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":89,"title":"Gray Code","titleSlug":"gray-code"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":90,"title":"Subsets II","titleSlug":"subsets-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":91,"title":"Decode Ways","titleSlug":"decode-ways"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":92,"title":"Reverse Linked List II","titleSlug":"reverse-linked-list-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":93,"title":"Restore IP Addresses","titleSlug":"restore-ip-addresses"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":94,"title":"Binary Tree Inorder Traversal","titleSlug":"binary-tree-inorder-traversal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":95,"title":"Unique Binary Search Trees II","titleSlug":"unique-binary-search-trees-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":96,"title":"Unique Binary Search Trees","titleSlug":"unique-binary-search-trees"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":97,"title":"Interleaving String","titleSlug":"interleaving-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":98,"title":"Validate Binary Search Tree","titleSlug":"validate-binary-search-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":99,"title":"Recover Binary Search Tree","titleSlug":"recover-binary-search-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":100,"title":"Same Tree","titleSlug":"same-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":101,"title":"Symmetric Tree","titleSlug":"symmetric-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":102,"title":"Binary Tree Level Order Traversal","titleSlug":"binary-tree-level-order-traversal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":103,"title":"Binary Tree Zigzag Level Order Traversal","titleSlug":"binary-tree-zigzag-level-order-traversal"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":104,"title":"Maximum Depth of Binary Tree","titleSlug":"maximum-depth-of-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":105,"title":"Construct Binary Tree from Preorder and Inorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":106,"title":"Construct Binary Tree from Inorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":107,"title":"Binary Tree Level Order Traversal II","titleSlug":"binary-tree-level-order-traversal-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":108,"title":"Convert Sorted Array to Binary Search Tree","titleSlug":"convert-sorted-array-to-binary-search-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":109,"title":"Convert Sorted List to Binary Search Tree","titleSlug":"convert-sorted-list-to-binary-search-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":110,"title":"Balanced Binary Tree","titleSlug":"balanced-binary-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":111,"title":"Minimum Depth of Binary Tree","titleSlug":"minimum-depth-of-binary-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":112,"title":"Path Sum","titleSlug":"path-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":113,"title":"Path Sum II","titleSlug":"path-sum-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":114,"title":"Flatten Binary Tree to Linked List","titleSlug":"flatten-binary-tree-to-linked-list"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":115,"title":"Distinct Subsequences","titleSlug":"distinct-subsequences"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":116,"title":"Populating Next Right Pointers in Each Node","titleSlug":"populating-next-right-pointers-in-each-node"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":117,"title":"Populating Next Right Pointers in Each Node II","titleSlug":"populating-next-right-pointers-in-each-node-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":118,"title":"Pascal's Triangle","titleSlug":"pascals-triangle"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":119,"title":"Pascal's Triangle II","titleSlug":"pascals-triangle-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":120,"title":"Triangle","titleSlug":"triangle"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":121,"title":"Best Time to Buy and Sell Stock","titleSlug":"best-time-to-buy-and-sell-stock"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":122,"title":"Best Time to Buy and Sell Stock II","titleSlug":"best-time-to-buy-and-sell-stock-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":123,"title":"Best Time to Buy and Sell Stock III","titleSlug":"best-time-to-buy-and-sell-stock-iii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":124,"title":"Binary Tree Maximum Path Sum","titleSlug":"binary-tree-maximum-path-sum"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":125,"title":"Valid Palindrome","titleSlug":"valid-palindrome"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":126,"title":"Word Ladder II","titleSlug":"word-ladder-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":127,"title":"Word Ladder","titleSlug":"word-ladder"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":128,"title":"Longest Consecutive Sequence","titleSlug":"longest-consecutive-sequence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":129,"title":"Sum Root to Leaf Numbers","titleSlug":"sum-root-to-leaf-numbers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":130,"title":"Surrounded Regions","titleSlug":"surrounded-regions"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":131,"title":"Palindrome Partitioning","titleSlug":"palindrome-partitioning"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":132,"title":"Palindrome Partitioning II","titleSlug":"palindrome-partitioning-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":133,"title":"Clone Graph","titleSlug":"clone-graph"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":134,"title":"Gas Station","titleSlug":"gas-station"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":135,"title":"Candy","titleSlug":"candy"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":136,"title":"Single Number","titleSlug":"single-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":137,"title":"Single Number II","titleSlug":"single-number-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":138,"title":"Copy List with Random Pointer","titleSlug":"copy-list-with-random-pointer"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":139,"title":"Word Break","titleSlug":"word-break"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":140,"title":"Word Break II","titleSlug":"word-break-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":141,"title":"Linked List Cycle","titleSlug":"linked-list-cycle"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":142,"title":"Linked List Cycle II","titleSlug":"linked-list-cycle-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":143,"title":"Reorder List","titleSlug":"reorder-list"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":144,"title":"Binary Tree Preorder Traversal","titleSlug":"binary-tree-preorder-traversal"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":145,"title":"Binary Tree Postorder Traversal","titleSlug":"binary-tree-postorder-traversal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":146,"title":"LRU Cache","titleSlug":"lru-cache"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":147,"title":"Insertion Sort List","titleSlug":"insertion-sort-list"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":148,"title":"Sort List","titleSlug":"sort-list"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":149,"title":"Max Points on a Line","titleSlug":"max-points-on-a-line"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":150,"title":"Evaluate Reverse Polish Notation","titleSlug":"evaluate-reverse-polish-notation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":151,"title":"Reverse Words in a String","titleSlug":"reverse-words-in-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":152,"title":"Maximum Product Subarray","titleSlug":"maximum-product-subarray"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":153,"title":"Find Minimum in Rotated Sorted Array","titleSlug":"find-minimum-in-rotated-sorted-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":154,"title":"Find Minimum in Rotated Sorted Array II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":155,"title":"Min Stack","titleSlug":"min-stack"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":156,"title":"Binary Tree Upside Down","titleSlug":"binary-tree-upside-down"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":157,"title":"Read N Characters Given Read4","titleSlug":"read-n-characters-given-read4"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":158,"title":"Read N Characters Given read4 II - Call Multiple Times","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":159,"title":"Longest Substring with At Most Two Distinct Characters","titleSlug":"longest-substring-with-at-most-two-distinct-characters"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":160,"title":"Intersection of Two Linked Lists","titleSlug":"intersection-of-two-linked-lists"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":161,"title":"One Edit Distance","titleSlug":"one-edit-distance"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":162,"title":"Find Peak Element","titleSlug":"find-peak-element"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":163,"title":"Missing Ranges","titleSlug":"missing-ranges"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":164,"title":"Maximum Gap","titleSlug":"maximum-gap"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":165,"title":"Compare Version Numbers","titleSlug":"compare-version-numbers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":166,"title":"Fraction to Recurring Decimal","titleSlug":"fraction-to-recurring-decimal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":167,"title":"Two Sum II - Input Array Is Sorted","titleSlug":"two-sum-ii-input-array-is-sorted"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":168,"title":"Excel Sheet Column Title","titleSlug":"excel-sheet-column-title"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":169,"title":"Majority Element","titleSlug":"majority-element"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":170,"title":"Two Sum III - Data structure design","titleSlug":"two-sum-iii-data-structure-design"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":171,"title":"Excel Sheet Column Number","titleSlug":"excel-sheet-column-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":172,"title":"Factorial Trailing Zeroes","titleSlug":"factorial-trailing-zeroes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":173,"title":"Binary Search Tree Iterator","titleSlug":"binary-search-tree-iterator"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":174,"title":"Dungeon Game","titleSlug":"dungeon-game"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":175,"title":"Combine Two Tables","titleSlug":"combine-two-tables"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":176,"title":"Second Highest Salary","titleSlug":"second-highest-salary"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":177,"title":"Nth Highest Salary","titleSlug":"nth-highest-salary"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":178,"title":"Rank Scores","titleSlug":"rank-scores"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":179,"title":"Largest Number","titleSlug":"largest-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":180,"title":"Consecutive Numbers","titleSlug":"consecutive-numbers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":181,"title":"Employees Earning More Than Their Managers","titleSlug":"employees-earning-more-than-their-managers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":182,"title":"Duplicate Emails","titleSlug":"duplicate-emails"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":183,"title":"Customers Who Never Order","titleSlug":"customers-who-never-order"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":184,"title":"Department Highest Salary","titleSlug":"department-highest-salary"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":185,"title":"Department Top Three Salaries","titleSlug":"department-top-three-salaries"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":186,"title":"Reverse Words in a String II","titleSlug":"reverse-words-in-a-string-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":187,"title":"Repeated DNA Sequences","titleSlug":"repeated-dna-sequences"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":188,"title":"Best Time to Buy and Sell Stock IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":189,"title":"Rotate Array","titleSlug":"rotate-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":190,"title":"Reverse Bits","titleSlug":"reverse-bits"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":191,"title":"Number of 1 Bits","titleSlug":"number-of-1-bits"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":192,"title":"Word Frequency","titleSlug":"word-frequency"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":193,"title":"Valid Phone Numbers","titleSlug":"valid-phone-numbers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":194,"title":"Transpose File","titleSlug":"transpose-file"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":195,"title":"Tenth Line","titleSlug":"tenth-line"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":196,"title":"Delete Duplicate Emails","titleSlug":"delete-duplicate-emails"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":197,"title":"Rising Temperature","titleSlug":"rising-temperature"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":198,"title":"House Robber","titleSlug":"house-robber"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":199,"title":"Binary Tree Right Side View","titleSlug":"binary-tree-right-side-view"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":200,"title":"Number of Islands","titleSlug":"number-of-islands"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":201,"title":"Bitwise AND of Numbers Range","titleSlug":"bitwise-and-of-numbers-range"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":202,"title":"Happy Number","titleSlug":"happy-number"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":203,"title":"Remove Linked List Elements","titleSlug":"remove-linked-list-elements"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":204,"title":"Count Primes","titleSlug":"count-primes"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":205,"title":"Isomorphic Strings","titleSlug":"isomorphic-strings"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":206,"title":"Reverse Linked List","titleSlug":"reverse-linked-list"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":207,"title":"Course Schedule","titleSlug":"course-schedule"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":208,"title":"Implement Trie (Prefix Tree)","titleSlug":"implement-trie-prefix-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":209,"title":"Minimum Size Subarray Sum","titleSlug":"minimum-size-subarray-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":210,"title":"Course Schedule II","titleSlug":"course-schedule-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":211,"title":"Design Add and Search Words Data Structure","titleSlug":"design-add-and-search-words-data-structure"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":212,"title":"Word Search II","titleSlug":"word-search-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":213,"title":"House Robber II","titleSlug":"house-robber-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":214,"title":"Shortest Palindrome","titleSlug":"shortest-palindrome"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":215,"title":"Kth Largest Element in an Array","titleSlug":"kth-largest-element-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":216,"title":"Combination Sum III","titleSlug":"combination-sum-iii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":217,"title":"Contains Duplicate","titleSlug":"contains-duplicate"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":218,"title":"The Skyline Problem","titleSlug":"the-skyline-problem"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":219,"title":"Contains Duplicate II","titleSlug":"contains-duplicate-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":220,"title":"Contains Duplicate III","titleSlug":"contains-duplicate-iii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":221,"title":"Maximal Square","titleSlug":"maximal-square"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":222,"title":"Count Complete Tree Nodes","titleSlug":"count-complete-tree-nodes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":223,"title":"Rectangle Area","titleSlug":"rectangle-area"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":224,"title":"Basic Calculator","titleSlug":"basic-calculator"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":225,"title":"Implement Stack using Queues","titleSlug":"implement-stack-using-queues"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":226,"title":"Invert Binary Tree","titleSlug":"invert-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":227,"title":"Basic Calculator II","titleSlug":"basic-calculator-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":228,"title":"Summary Ranges","titleSlug":"summary-ranges"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":229,"title":"Majority Element II","titleSlug":"majority-element-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":230,"title":"Kth Smallest Element in a BST","titleSlug":"kth-smallest-element-in-a-bst"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":231,"title":"Power of Two","titleSlug":"power-of-two"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":232,"title":"Implement Queue using Stacks","titleSlug":"implement-queue-using-stacks"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":233,"title":"Number of Digit One","titleSlug":"number-of-digit-one"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":234,"title":"Palindrome Linked List","titleSlug":"palindrome-linked-list"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":235,"title":"Lowest Common Ancestor of a Binary Search Tree","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":236,"title":"Lowest Common Ancestor of a Binary Tree","titleSlug":"lowest-common-ancestor-of-a-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":237,"title":"Delete Node in a Linked List","titleSlug":"delete-node-in-a-linked-list"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":238,"title":"Product of Array Except Self","titleSlug":"product-of-array-except-self"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":239,"title":"Sliding Window Maximum","titleSlug":"sliding-window-maximum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":240,"title":"Search a 2D Matrix II","titleSlug":"search-a-2d-matrix-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":241,"title":"Different Ways to Add Parentheses","titleSlug":"different-ways-to-add-parentheses"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":242,"title":"Valid Anagram","titleSlug":"valid-anagram"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":243,"title":"Shortest Word Distance","titleSlug":"shortest-word-distance"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":244,"title":"Shortest Word Distance II","titleSlug":"shortest-word-distance-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":245,"title":"Shortest Word Distance III","titleSlug":"shortest-word-distance-iii"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":246,"title":"Strobogrammatic Number","titleSlug":"strobogrammatic-number"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":247,"title":"Strobogrammatic Number II","titleSlug":"strobogrammatic-number-ii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":248,"title":"Strobogrammatic Number III","titleSlug":"strobogrammatic-number-iii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":249,"title":"Group Shifted Strings","titleSlug":"group-shifted-strings"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":250,"title":"Count Univalue Subtrees","titleSlug":"count-univalue-subtrees"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":251,"title":"Flatten 2D Vector","titleSlug":"flatten-2d-vector"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":252,"title":"Meeting Rooms","titleSlug":"meeting-rooms"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":253,"title":"Meeting Rooms II","titleSlug":"meeting-rooms-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":254,"title":"Factor Combinations","titleSlug":"factor-combinations"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":255,"title":"Verify Preorder Sequence in Binary Search Tree","titleSlug":"verify-preorder-sequence-in-binary-search-tree"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":256,"title":"Paint House","titleSlug":"paint-house"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":257,"title":"Binary Tree Paths","titleSlug":"binary-tree-paths"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":258,"title":"Add Digits","titleSlug":"add-digits"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":259,"title":"3Sum Smaller","titleSlug":"3sum-smaller"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":260,"title":"Single Number III","titleSlug":"single-number-iii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":261,"title":"Graph Valid Tree","titleSlug":"graph-valid-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":262,"title":"Trips and Users","titleSlug":"trips-and-users"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":263,"title":"Ugly Number","titleSlug":"ugly-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":264,"title":"Ugly Number II","titleSlug":"ugly-number-ii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":265,"title":"Paint House II","titleSlug":"paint-house-ii"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":266,"title":"Palindrome Permutation","titleSlug":"palindrome-permutation"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":267,"title":"Palindrome Permutation II","titleSlug":"palindrome-permutation-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":268,"title":"Missing Number","titleSlug":"missing-number"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":269,"title":"Alien Dictionary","titleSlug":"alien-dictionary"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":270,"title":"Closest Binary Search Tree Value","titleSlug":"closest-binary-search-tree-value"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":271,"title":"Encode and Decode Strings","titleSlug":"encode-and-decode-strings"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":272,"title":"Closest Binary Search Tree Value II","titleSlug":"closest-binary-search-tree-value-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":273,"title":"Integer to English Words","titleSlug":"integer-to-english-words"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":274,"title":"H-Index","titleSlug":"h-index"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":275,"title":"H-Index II","titleSlug":"h-index-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":276,"title":"Paint Fence","titleSlug":"paint-fence"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":277,"title":"Find the Celebrity","titleSlug":"find-the-celebrity"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":278,"title":"First Bad Version","titleSlug":"first-bad-version"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":279,"title":"Perfect Squares","titleSlug":"perfect-squares"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":280,"title":"Wiggle Sort","titleSlug":"wiggle-sort"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":281,"title":"Zigzag Iterator","titleSlug":"zigzag-iterator"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":282,"title":"Expression Add Operators","titleSlug":"expression-add-operators"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":283,"title":"Move Zeroes","titleSlug":"move-zeroes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":284,"title":"Peeking Iterator","titleSlug":"peeking-iterator"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":285,"title":"Inorder Successor in BST","titleSlug":"inorder-successor-in-bst"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":286,"title":"Walls and Gates","titleSlug":"walls-and-gates"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":287,"title":"Find the Duplicate Number","titleSlug":"find-the-duplicate-number"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":288,"title":"Unique Word Abbreviation","titleSlug":"unique-word-abbreviation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":289,"title":"Game of Life","titleSlug":"game-of-life"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":290,"title":"Word Pattern","titleSlug":"word-pattern"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":291,"title":"Word Pattern II","titleSlug":"word-pattern-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":292,"title":"Nim Game","titleSlug":"nim-game"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":293,"title":"Flip Game","titleSlug":"flip-game"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":294,"title":"Flip Game II","titleSlug":"flip-game-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":295,"title":"Find Median from Data Stream","titleSlug":"find-median-from-data-stream"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":296,"title":"Best Meeting Point","titleSlug":"best-meeting-point"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":297,"title":"Serialize and Deserialize Binary Tree","titleSlug":"serialize-and-deserialize-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":298,"title":"Binary Tree Longest Consecutive Sequence","titleSlug":"binary-tree-longest-consecutive-sequence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":299,"title":"Bulls and Cows","titleSlug":"bulls-and-cows"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":300,"title":"Longest Increasing Subsequence","titleSlug":"longest-increasing-subsequence"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":301,"title":"Remove Invalid Parentheses","titleSlug":"remove-invalid-parentheses"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":302,"title":"Smallest Rectangle Enclosing Black Pixels","titleSlug":"smallest-rectangle-enclosing-black-pixels"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":303,"title":"Range Sum Query - Immutable","titleSlug":"range-sum-query-immutable"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":304,"title":"Range Sum Query 2D - Immutable","titleSlug":"range-sum-query-2d-immutable"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":305,"title":"Number of Islands II","titleSlug":"number-of-islands-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":306,"title":"Additive Number","titleSlug":"additive-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":307,"title":"Range Sum Query - Mutable","titleSlug":"range-sum-query-mutable"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":308,"title":"Range Sum Query 2D - Mutable","titleSlug":"range-sum-query-2d-mutable"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":309,"title":"Best Time to Buy and Sell Stock with Cooldown","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":310,"title":"Minimum Height Trees","titleSlug":"minimum-height-trees"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":311,"title":"Sparse Matrix Multiplication","titleSlug":"sparse-matrix-multiplication"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":312,"title":"Burst Balloons","titleSlug":"burst-balloons"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":313,"title":"Super Ugly Number","titleSlug":"super-ugly-number"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":314,"title":"Binary Tree Vertical Order Traversal","titleSlug":"binary-tree-vertical-order-traversal"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":315,"title":"Count of Smaller Numbers After Self","titleSlug":"count-of-smaller-numbers-after-self"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":316,"title":"Remove Duplicate Letters","titleSlug":"remove-duplicate-letters"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":317,"title":"Shortest Distance from All Buildings","titleSlug":"shortest-distance-from-all-buildings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":318,"title":"Maximum Product of Word Lengths","titleSlug":"maximum-product-of-word-lengths"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":319,"title":"Bulb Switcher","titleSlug":"bulb-switcher"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":320,"title":"Generalized Abbreviation","titleSlug":"generalized-abbreviation"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":321,"title":"Create Maximum Number","titleSlug":"create-maximum-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":322,"title":"Coin Change","titleSlug":"coin-change"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":323,"title":"Number of Connected Components in an Undirected Graph","titleSlug":"number-of-connected-components-in-an-undirected-graph"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":324,"title":"Wiggle Sort II","titleSlug":"wiggle-sort-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":325,"title":"Maximum Size Subarray Sum Equals k","titleSlug":"maximum-size-subarray-sum-equals-k"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":326,"title":"Power of Three","titleSlug":"power-of-three"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":327,"title":"Count of Range Sum","titleSlug":"count-of-range-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":328,"title":"Odd Even Linked List","titleSlug":"odd-even-linked-list"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":329,"title":"Longest Increasing Path in a Matrix","titleSlug":"longest-increasing-path-in-a-matrix"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":330,"title":"Patching Array","titleSlug":"patching-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":331,"title":"Verify Preorder Serialization of a Binary Tree","titleSlug":"verify-preorder-serialization-of-a-binary-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":332,"title":"Reconstruct Itinerary","titleSlug":"reconstruct-itinerary"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":333,"title":"Largest BST Subtree","titleSlug":"largest-bst-subtree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":334,"title":"Increasing Triplet Subsequence","titleSlug":"increasing-triplet-subsequence"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":335,"title":"Self Crossing","titleSlug":"self-crossing"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":336,"title":"Palindrome Pairs","titleSlug":"palindrome-pairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":337,"title":"House Robber III","titleSlug":"house-robber-iii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":338,"title":"Counting Bits","titleSlug":"counting-bits"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":339,"title":"Nested List Weight Sum","titleSlug":"nested-list-weight-sum"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":340,"title":"Longest Substring with At Most K Distinct Characters","titleSlug":"longest-substring-with-at-most-k-distinct-characters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":341,"title":"Flatten Nested List Iterator","titleSlug":"flatten-nested-list-iterator"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":342,"title":"Power of Four","titleSlug":"power-of-four"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":343,"title":"Integer Break","titleSlug":"integer-break"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":344,"title":"Reverse String","titleSlug":"reverse-string"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":345,"title":"Reverse Vowels of a String","titleSlug":"reverse-vowels-of-a-string"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":346,"title":"Moving Average from Data Stream","titleSlug":"moving-average-from-data-stream"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":347,"title":"Top K Frequent Elements","titleSlug":"top-k-frequent-elements"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":348,"title":"Design Tic-Tac-Toe","titleSlug":"design-tic-tac-toe"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":349,"title":"Intersection of Two Arrays","titleSlug":"intersection-of-two-arrays"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":350,"title":"Intersection of Two Arrays II","titleSlug":"intersection-of-two-arrays-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":351,"title":"Android Unlock Patterns","titleSlug":"android-unlock-patterns"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":352,"title":"Data Stream as Disjoint Intervals","titleSlug":"data-stream-as-disjoint-intervals"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":353,"title":"Design Snake Game","titleSlug":"design-snake-game"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":354,"title":"Russian Doll Envelopes","titleSlug":"russian-doll-envelopes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":355,"title":"Design Twitter","titleSlug":"design-twitter"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":356,"title":"Line Reflection","titleSlug":"line-reflection"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":357,"title":"Count Numbers with Unique Digits","titleSlug":"count-numbers-with-unique-digits"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":358,"title":"Rearrange String k Distance Apart","titleSlug":"rearrange-string-k-distance-apart"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":359,"title":"Logger Rate Limiter","titleSlug":"logger-rate-limiter"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":360,"title":"Sort Transformed Array","titleSlug":"sort-transformed-array"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":361,"title":"Bomb Enemy","titleSlug":"bomb-enemy"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":362,"title":"Design Hit Counter","titleSlug":"design-hit-counter"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":363,"title":"Max Sum of Rectangle No Larger Than K","titleSlug":"max-sum-of-rectangle-no-larger-than-k"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":364,"title":"Nested List Weight Sum II","titleSlug":"nested-list-weight-sum-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":365,"title":"Water and Jug Problem","titleSlug":"water-and-jug-problem"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":366,"title":"Find Leaves of Binary Tree","titleSlug":"find-leaves-of-binary-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":367,"title":"Valid Perfect Square","titleSlug":"valid-perfect-square"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":368,"title":"Largest Divisible Subset","titleSlug":"largest-divisible-subset"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":369,"title":"Plus One Linked List","titleSlug":"plus-one-linked-list"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":370,"title":"Range Addition","titleSlug":"range-addition"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":371,"title":"Sum of Two Integers","titleSlug":"sum-of-two-integers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":372,"title":"Super Pow","titleSlug":"super-pow"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":373,"title":"Find K Pairs with Smallest Sums","titleSlug":"find-k-pairs-with-smallest-sums"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":374,"title":"Guess Number Higher or Lower","titleSlug":"guess-number-higher-or-lower"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":375,"title":"Guess Number Higher or Lower II","titleSlug":"guess-number-higher-or-lower-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":376,"title":"Wiggle Subsequence","titleSlug":"wiggle-subsequence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":377,"title":"Combination Sum IV","titleSlug":"combination-sum-iv"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":378,"title":"Kth Smallest Element in a Sorted Matrix","titleSlug":"kth-smallest-element-in-a-sorted-matrix"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":379,"title":"Design Phone Directory","titleSlug":"design-phone-directory"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":380,"title":"Insert Delete GetRandom O(1)","titleSlug":"insert-delete-getrandom-o1"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":381,"title":"Insert Delete GetRandom O(1) - Duplicates allowed","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":382,"title":"Linked List Random Node","titleSlug":"linked-list-random-node"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":383,"title":"Ransom Note","titleSlug":"ransom-note"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":384,"title":"Shuffle an Array","titleSlug":"shuffle-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":385,"title":"Mini Parser","titleSlug":"mini-parser"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":386,"title":"Lexicographical Numbers","titleSlug":"lexicographical-numbers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":387,"title":"First Unique Character in a String","titleSlug":"first-unique-character-in-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":388,"title":"Longest Absolute File Path","titleSlug":"longest-absolute-file-path"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":389,"title":"Find the Difference","titleSlug":"find-the-difference"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":390,"title":"Elimination Game","titleSlug":"elimination-game"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":391,"title":"Perfect Rectangle","titleSlug":"perfect-rectangle"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":392,"title":"Is Subsequence","titleSlug":"is-subsequence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":393,"title":"UTF-8 Validation","titleSlug":"utf-8-validation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":394,"title":"Decode String","titleSlug":"decode-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":395,"title":"Longest Substring with At Least K Repeating Characters","titleSlug":"longest-substring-with-at-least-k-repeating-characters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":396,"title":"Rotate Function","titleSlug":"rotate-function"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":397,"title":"Integer Replacement","titleSlug":"integer-replacement"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":398,"title":"Random Pick Index","titleSlug":"random-pick-index"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":399,"title":"Evaluate Division","titleSlug":"evaluate-division"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":400,"title":"Nth Digit","titleSlug":"nth-digit"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":401,"title":"Binary Watch","titleSlug":"binary-watch"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":402,"title":"Remove K Digits","titleSlug":"remove-k-digits"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":403,"title":"Frog Jump","titleSlug":"frog-jump"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":404,"title":"Sum of Left Leaves","titleSlug":"sum-of-left-leaves"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":405,"title":"Convert a Number to Hexadecimal","titleSlug":"convert-a-number-to-hexadecimal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":406,"title":"Queue Reconstruction by Height","titleSlug":"queue-reconstruction-by-height"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":407,"title":"Trapping Rain Water II","titleSlug":"trapping-rain-water-ii"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":408,"title":"Valid Word Abbreviation","titleSlug":"valid-word-abbreviation"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":409,"title":"Longest Palindrome","titleSlug":"longest-palindrome"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":410,"title":"Split Array Largest Sum","titleSlug":"split-array-largest-sum"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":411,"title":"Minimum Unique Word Abbreviation","titleSlug":"minimum-unique-word-abbreviation"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":412,"title":"Fizz Buzz","titleSlug":"fizz-buzz"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":413,"title":"Arithmetic Slices","titleSlug":"arithmetic-slices"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":414,"title":"Third Maximum Number","titleSlug":"third-maximum-number"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":415,"title":"Add Strings","titleSlug":"add-strings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":416,"title":"Partition Equal Subset Sum","titleSlug":"partition-equal-subset-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":417,"title":"Pacific Atlantic Water Flow","titleSlug":"pacific-atlantic-water-flow"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":418,"title":"Sentence Screen Fitting","titleSlug":"sentence-screen-fitting"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":419,"title":"Battleships in a Board","titleSlug":"battleships-in-a-board"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":420,"title":"Strong Password Checker","titleSlug":"strong-password-checker"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":421,"title":"Maximum XOR of Two Numbers in an Array","titleSlug":"maximum-xor-of-two-numbers-in-an-array"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":422,"title":"Valid Word Square","titleSlug":"valid-word-square"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":423,"title":"Reconstruct Original Digits from English","titleSlug":"reconstruct-original-digits-from-english"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":424,"title":"Longest Repeating Character Replacement","titleSlug":"longest-repeating-character-replacement"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":425,"title":"Word Squares","titleSlug":"word-squares"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":426,"title":"Convert Binary Search Tree to Sorted Doubly Linked List","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":427,"title":"Construct Quad Tree","titleSlug":"construct-quad-tree"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":428,"title":"Serialize and Deserialize N-ary Tree","titleSlug":"serialize-and-deserialize-n-ary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":429,"title":"N-ary Tree Level Order Traversal","titleSlug":"n-ary-tree-level-order-traversal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":430,"title":"Flatten a Multilevel Doubly Linked List","titleSlug":"flatten-a-multilevel-doubly-linked-list"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":431,"title":"Encode N-ary Tree to Binary Tree","titleSlug":"encode-n-ary-tree-to-binary-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":432,"title":"All O`one Data Structure","titleSlug":"all-oone-data-structure"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":433,"title":"Minimum Genetic Mutation","titleSlug":"minimum-genetic-mutation"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":434,"title":"Number of Segments in a String","titleSlug":"number-of-segments-in-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":435,"title":"Non-overlapping Intervals","titleSlug":"non-overlapping-intervals"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":436,"title":"Find Right Interval","titleSlug":"find-right-interval"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":437,"title":"Path Sum III","titleSlug":"path-sum-iii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":438,"title":"Find All Anagrams in a String","titleSlug":"find-all-anagrams-in-a-string"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":439,"title":"Ternary Expression Parser","titleSlug":"ternary-expression-parser"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":440,"title":"K-th Smallest in Lexicographical Order","titleSlug":"k-th-smallest-in-lexicographical-order"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":441,"title":"Arranging Coins","titleSlug":"arranging-coins"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":442,"title":"Find All Duplicates in an Array","titleSlug":"find-all-duplicates-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":443,"title":"String Compression","titleSlug":"string-compression"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":444,"title":"Sequence Reconstruction","titleSlug":"sequence-reconstruction"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":445,"title":"Add Two Numbers II","titleSlug":"add-two-numbers-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":446,"title":"Arithmetic Slices II - Subsequence","titleSlug":"arithmetic-slices-ii-subsequence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":447,"title":"Number of Boomerangs","titleSlug":"number-of-boomerangs"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":448,"title":"Find All Numbers Disappeared in an Array","titleSlug":"find-all-numbers-disappeared-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":449,"title":"Serialize and Deserialize BST","titleSlug":"serialize-and-deserialize-bst"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":450,"title":"Delete Node in a BST","titleSlug":"delete-node-in-a-bst"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":451,"title":"Sort Characters By Frequency","titleSlug":"sort-characters-by-frequency"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":452,"title":"Minimum Number of Arrows to Burst Balloons","titleSlug":"minimum-number-of-arrows-to-burst-balloons"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":453,"title":"Minimum Moves to Equal Array Elements","titleSlug":"minimum-moves-to-equal-array-elements"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":454,"title":"4Sum II","titleSlug":"4sum-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":455,"title":"Assign Cookies","titleSlug":"assign-cookies"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":456,"title":"132 Pattern","titleSlug":"132-pattern"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":457,"title":"Circular Array Loop","titleSlug":"circular-array-loop"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":458,"title":"Poor Pigs","titleSlug":"poor-pigs"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":459,"title":"Repeated Substring Pattern","titleSlug":"repeated-substring-pattern"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":460,"title":"LFU Cache","titleSlug":"lfu-cache"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":461,"title":"Hamming Distance","titleSlug":"hamming-distance"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":462,"title":"Minimum Moves to Equal Array Elements II","titleSlug":"minimum-moves-to-equal-array-elements-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":463,"title":"Island Perimeter","titleSlug":"island-perimeter"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":464,"title":"Can I Win","titleSlug":"can-i-win"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":465,"title":"Optimal Account Balancing","titleSlug":"optimal-account-balancing"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":466,"title":"Count The Repetitions","titleSlug":"count-the-repetitions"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":467,"title":"Unique Substrings in Wraparound String","titleSlug":"unique-substrings-in-wraparound-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":468,"title":"Validate IP Address","titleSlug":"validate-ip-address"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":469,"title":"Convex Polygon","titleSlug":"convex-polygon"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":470,"title":"Implement Rand10() Using Rand7()","titleSlug":"implement-rand10-using-rand7"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":471,"title":"Encode String with Shortest Length","titleSlug":"encode-string-with-shortest-length"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":472,"title":"Concatenated Words","titleSlug":"concatenated-words"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":473,"title":"Matchsticks to Square","titleSlug":"matchsticks-to-square"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":474,"title":"Ones and Zeroes","titleSlug":"ones-and-zeroes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":475,"title":"Heaters","titleSlug":"heaters"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":476,"title":"Number Complement","titleSlug":"number-complement"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":477,"title":"Total Hamming Distance","titleSlug":"total-hamming-distance"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":478,"title":"Generate Random Point in a Circle","titleSlug":"generate-random-point-in-a-circle"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":479,"title":"Largest Palindrome Product","titleSlug":"largest-palindrome-product"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":480,"title":"Sliding Window Median","titleSlug":"sliding-window-median"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":481,"title":"Magical String","titleSlug":"magical-string"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":482,"title":"License Key Formatting","titleSlug":"license-key-formatting"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":483,"title":"Smallest Good Base","titleSlug":"smallest-good-base"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":484,"title":"Find Permutation","titleSlug":"find-permutation"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":485,"title":"Max Consecutive Ones","titleSlug":"max-consecutive-ones"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":486,"title":"Predict the Winner","titleSlug":"predict-the-winner"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":487,"title":"Max Consecutive Ones II","titleSlug":"max-consecutive-ones-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":488,"title":"Zuma Game","titleSlug":"zuma-game"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":489,"title":"Robot Room Cleaner","titleSlug":"robot-room-cleaner"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":490,"title":"The Maze","titleSlug":"the-maze"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":491,"title":"Non-decreasing Subsequences","titleSlug":"non-decreasing-subsequences"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":492,"title":"Construct the Rectangle","titleSlug":"construct-the-rectangle"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":493,"title":"Reverse Pairs","titleSlug":"reverse-pairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":494,"title":"Target Sum","titleSlug":"target-sum"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":495,"title":"Teemo Attacking","titleSlug":"teemo-attacking"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":496,"title":"Next Greater Element I","titleSlug":"next-greater-element-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":497,"title":"Random Point in Non-overlapping Rectangles","titleSlug":"random-point-in-non-overlapping-rectangles"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":498,"title":"Diagonal Traverse","titleSlug":"diagonal-traverse"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":499,"title":"The Maze III","titleSlug":"the-maze-iii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":500,"title":"Keyboard Row","titleSlug":"keyboard-row"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":501,"title":"Find Mode in Binary Search Tree","titleSlug":"find-mode-in-binary-search-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":502,"title":"IPO","titleSlug":"ipo"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":503,"title":"Next Greater Element II","titleSlug":"next-greater-element-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":504,"title":"Base 7","titleSlug":"base-7"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":505,"title":"The Maze II","titleSlug":"the-maze-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":506,"title":"Relative Ranks","titleSlug":"relative-ranks"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":507,"title":"Perfect Number","titleSlug":"perfect-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":508,"title":"Most Frequent Subtree Sum","titleSlug":"most-frequent-subtree-sum"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":509,"title":"Fibonacci Number","titleSlug":"fibonacci-number"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":510,"title":"Inorder Successor in BST II","titleSlug":"inorder-successor-in-bst-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":511,"title":"Game Play Analysis I","titleSlug":"game-play-analysis-i"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":512,"title":"Game Play Analysis II","titleSlug":"game-play-analysis-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":513,"title":"Find Bottom Left Tree Value","titleSlug":"find-bottom-left-tree-value"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":514,"title":"Freedom Trail","titleSlug":"freedom-trail"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":515,"title":"Find Largest Value in Each Tree Row","titleSlug":"find-largest-value-in-each-tree-row"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":516,"title":"Longest Palindromic Subsequence","titleSlug":"longest-palindromic-subsequence"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":517,"title":"Super Washing Machines","titleSlug":"super-washing-machines"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":518,"title":"Coin Change II","titleSlug":"coin-change-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":519,"title":"Random Flip Matrix","titleSlug":"random-flip-matrix"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":520,"title":"Detect Capital","titleSlug":"detect-capital"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":521,"title":"Longest Uncommon Subsequence I","titleSlug":"longest-uncommon-subsequence-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":522,"title":"Longest Uncommon Subsequence II","titleSlug":"longest-uncommon-subsequence-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":523,"title":"Continuous Subarray Sum","titleSlug":"continuous-subarray-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":524,"title":"Longest Word in Dictionary through Deleting","titleSlug":"longest-word-in-dictionary-through-deleting"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":525,"title":"Contiguous Array","titleSlug":"contiguous-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":526,"title":"Beautiful Arrangement","titleSlug":"beautiful-arrangement"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":527,"title":"Word Abbreviation","titleSlug":"word-abbreviation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":528,"title":"Random Pick with Weight","titleSlug":"random-pick-with-weight"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":529,"title":"Minesweeper","titleSlug":"minesweeper"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":530,"title":"Minimum Absolute Difference in BST","titleSlug":"minimum-absolute-difference-in-bst"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":531,"title":"Lonely Pixel I","titleSlug":"lonely-pixel-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":532,"title":"K-diff Pairs in an Array","titleSlug":"k-diff-pairs-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":533,"title":"Lonely Pixel II","titleSlug":"lonely-pixel-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":534,"title":"Game Play Analysis III","titleSlug":"game-play-analysis-iii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":535,"title":"Encode and Decode TinyURL","titleSlug":"encode-and-decode-tinyurl"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":536,"title":"Construct Binary Tree from String","titleSlug":"construct-binary-tree-from-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":537,"title":"Complex Number Multiplication","titleSlug":"complex-number-multiplication"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":538,"title":"Convert BST to Greater Tree","titleSlug":"convert-bst-to-greater-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":539,"title":"Minimum Time Difference","titleSlug":"minimum-time-difference"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":540,"title":"Single Element in a Sorted Array","titleSlug":"single-element-in-a-sorted-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":541,"title":"Reverse String II","titleSlug":"reverse-string-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":542,"title":"01 Matrix","titleSlug":"01-matrix"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":543,"title":"Diameter of Binary Tree","titleSlug":"diameter-of-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":544,"title":"Output Contest Matches","titleSlug":"output-contest-matches"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":545,"title":"Boundary of Binary Tree","titleSlug":"boundary-of-binary-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":546,"title":"Remove Boxes","titleSlug":"remove-boxes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":547,"title":"Number of Provinces","titleSlug":"number-of-provinces"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":548,"title":"Split Array with Equal Sum","titleSlug":"split-array-with-equal-sum"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":549,"title":"Binary Tree Longest Consecutive Sequence II","titleSlug":"binary-tree-longest-consecutive-sequence-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":550,"title":"Game Play Analysis IV","titleSlug":"game-play-analysis-iv"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":551,"title":"Student Attendance Record I","titleSlug":"student-attendance-record-i"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":552,"title":"Student Attendance Record II","titleSlug":"student-attendance-record-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":553,"title":"Optimal Division","titleSlug":"optimal-division"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":554,"title":"Brick Wall","titleSlug":"brick-wall"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":555,"title":"Split Concatenated Strings","titleSlug":"split-concatenated-strings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":556,"title":"Next Greater Element III","titleSlug":"next-greater-element-iii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":557,"title":"Reverse Words in a String III","titleSlug":"reverse-words-in-a-string-iii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":558,"title":"Logical OR of Two Binary Grids Represented as Quad-Trees","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":559,"title":"Maximum Depth of N-ary Tree","titleSlug":"maximum-depth-of-n-ary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":560,"title":"Subarray Sum Equals K","titleSlug":"subarray-sum-equals-k"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":561,"title":"Array Partition","titleSlug":"array-partition"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":562,"title":"Longest Line of Consecutive One in Matrix","titleSlug":"longest-line-of-consecutive-one-in-matrix"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":563,"title":"Binary Tree Tilt","titleSlug":"binary-tree-tilt"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":564,"title":"Find the Closest Palindrome","titleSlug":"find-the-closest-palindrome"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":565,"title":"Array Nesting","titleSlug":"array-nesting"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":566,"title":"Reshape the Matrix","titleSlug":"reshape-the-matrix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":567,"title":"Permutation in String","titleSlug":"permutation-in-string"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":568,"title":"Maximum Vacation Days","titleSlug":"maximum-vacation-days"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":569,"title":"Median Employee Salary","titleSlug":"median-employee-salary"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":570,"title":"Managers with at Least 5 Direct Reports","titleSlug":"managers-with-at-least-5-direct-reports"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":571,"title":"Find Median Given Frequency of Numbers","titleSlug":"find-median-given-frequency-of-numbers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":572,"title":"Subtree of Another Tree","titleSlug":"subtree-of-another-tree"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":573,"title":"Squirrel Simulation","titleSlug":"squirrel-simulation"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":574,"title":"Winning Candidate","titleSlug":"winning-candidate"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":575,"title":"Distribute Candies","titleSlug":"distribute-candies"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":576,"title":"Out of Boundary Paths","titleSlug":"out-of-boundary-paths"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":577,"title":"Employee Bonus","titleSlug":"employee-bonus"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":578,"title":"Get Highest Answer Rate Question","titleSlug":"get-highest-answer-rate-question"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":579,"title":"Find Cumulative Salary of an Employee","titleSlug":"find-cumulative-salary-of-an-employee"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":580,"title":"Count Student Number in Departments","titleSlug":"count-student-number-in-departments"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":581,"title":"Shortest Unsorted Continuous Subarray","titleSlug":"shortest-unsorted-continuous-subarray"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":582,"title":"Kill Process","titleSlug":"kill-process"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":583,"title":"Delete Operation for Two Strings","titleSlug":"delete-operation-for-two-strings"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":584,"title":"Find Customer Referee","titleSlug":"find-customer-referee"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":585,"title":"Investments in 2016","titleSlug":"investments-in-2016"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":586,"title":"Customer Placing the Largest Number of Orders","titleSlug":"customer-placing-the-largest-number-of-orders"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":587,"title":"Erect the Fence","titleSlug":"erect-the-fence"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":588,"title":"Design In-Memory File System","titleSlug":"design-in-memory-file-system"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":589,"title":"N-ary Tree Preorder Traversal","titleSlug":"n-ary-tree-preorder-traversal"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":590,"title":"N-ary Tree Postorder Traversal","titleSlug":"n-ary-tree-postorder-traversal"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":591,"title":"Tag Validator","titleSlug":"tag-validator"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":592,"title":"Fraction Addition and Subtraction","titleSlug":"fraction-addition-and-subtraction"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":593,"title":"Valid Square","titleSlug":"valid-square"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":594,"title":"Longest Harmonious Subsequence","titleSlug":"longest-harmonious-subsequence"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":595,"title":"Big Countries","titleSlug":"big-countries"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":596,"title":"Classes More Than 5 Students","titleSlug":"classes-more-than-5-students"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":597,"title":"Friend Requests I: Overall Acceptance Rate","titleSlug":"friend-requests-i-overall-acceptance-rate"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":598,"title":"Range Addition II","titleSlug":"range-addition-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":599,"title":"Minimum Index Sum of Two Lists","titleSlug":"minimum-index-sum-of-two-lists"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":600,"title":"Non-negative Integers without Consecutive Ones","titleSlug":"non-negative-integers-without-consecutive-ones"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":601,"title":"Human Traffic of Stadium","titleSlug":"human-traffic-of-stadium"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":602,"title":"Friend Requests II: Who Has the Most Friends","titleSlug":"friend-requests-ii-who-has-the-most-friends"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":603,"title":"Consecutive Available Seats","titleSlug":"consecutive-available-seats"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":604,"title":"Design Compressed String Iterator","titleSlug":"design-compressed-string-iterator"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":605,"title":"Can Place Flowers","titleSlug":"can-place-flowers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":606,"title":"Construct String from Binary Tree","titleSlug":"construct-string-from-binary-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":607,"title":"Sales Person","titleSlug":"sales-person"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":608,"title":"Tree Node","titleSlug":"tree-node"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":609,"title":"Find Duplicate File in System","titleSlug":"find-duplicate-file-in-system"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":610,"title":"Triangle Judgement","titleSlug":"triangle-judgement"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":611,"title":"Valid Triangle Number","titleSlug":"valid-triangle-number"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":612,"title":"Shortest Distance in a Plane","titleSlug":"shortest-distance-in-a-plane"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":613,"title":"Shortest Distance in a Line","titleSlug":"shortest-distance-in-a-line"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":614,"title":"Second Degree Follower","titleSlug":"second-degree-follower"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":615,"title":"Average Salary: Departments VS Company","titleSlug":"average-salary-departments-vs-company"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":616,"title":"Add Bold Tag in String","titleSlug":"add-bold-tag-in-string"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":617,"title":"Merge Two Binary Trees","titleSlug":"merge-two-binary-trees"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":618,"title":"Students Report By Geography","titleSlug":"students-report-by-geography"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":619,"title":"Biggest Single Number","titleSlug":"biggest-single-number"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":620,"title":"Not Boring Movies","titleSlug":"not-boring-movies"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":621,"title":"Task Scheduler","titleSlug":"task-scheduler"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":622,"title":"Design Circular Queue","titleSlug":"design-circular-queue"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":623,"title":"Add One Row to Tree","titleSlug":"add-one-row-to-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":624,"title":"Maximum Distance in Arrays","titleSlug":"maximum-distance-in-arrays"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":625,"title":"Minimum Factorization","titleSlug":"minimum-factorization"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":626,"title":"Exchange Seats","titleSlug":"exchange-seats"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":627,"title":"Swap Salary","titleSlug":"swap-salary"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":628,"title":"Maximum Product of Three Numbers","titleSlug":"maximum-product-of-three-numbers"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":629,"title":"K Inverse Pairs Array","titleSlug":"k-inverse-pairs-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":630,"title":"Course Schedule III","titleSlug":"course-schedule-iii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":631,"title":"Design Excel Sum Formula","titleSlug":"design-excel-sum-formula"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":632,"title":"Smallest Range Covering Elements from K Lists","titleSlug":"smallest-range-covering-elements-from-k-lists"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":633,"title":"Sum of Square Numbers","titleSlug":"sum-of-square-numbers"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":634,"title":"Find the Derangement of An Array","titleSlug":"find-the-derangement-of-an-array"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":635,"title":"Design Log Storage System","titleSlug":"design-log-storage-system"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":636,"title":"Exclusive Time of Functions","titleSlug":"exclusive-time-of-functions"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":637,"title":"Average of Levels in Binary Tree","titleSlug":"average-of-levels-in-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":638,"title":"Shopping Offers","titleSlug":"shopping-offers"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":639,"title":"Decode Ways II","titleSlug":"decode-ways-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":640,"title":"Solve the Equation","titleSlug":"solve-the-equation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":641,"title":"Design Circular Deque","titleSlug":"design-circular-deque"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":642,"title":"Design Search Autocomplete System","titleSlug":"design-search-autocomplete-system"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":643,"title":"Maximum Average Subarray I","titleSlug":"maximum-average-subarray-i"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":644,"title":"Maximum Average Subarray II","titleSlug":"maximum-average-subarray-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":645,"title":"Set Mismatch","titleSlug":"set-mismatch"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":646,"title":"Maximum Length of Pair Chain","titleSlug":"maximum-length-of-pair-chain"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":647,"title":"Palindromic Substrings","titleSlug":"palindromic-substrings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":648,"title":"Replace Words","titleSlug":"replace-words"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":649,"title":"Dota2 Senate","titleSlug":"dota2-senate"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":650,"title":"2 Keys Keyboard","titleSlug":"2-keys-keyboard"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":651,"title":"4 Keys Keyboard","titleSlug":"4-keys-keyboard"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":652,"title":"Find Duplicate Subtrees","titleSlug":"find-duplicate-subtrees"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":653,"title":"Two Sum IV - Input is a BST","titleSlug":"two-sum-iv-input-is-a-bst"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":654,"title":"Maximum Binary Tree","titleSlug":"maximum-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":655,"title":"Print Binary Tree","titleSlug":"print-binary-tree"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":656,"title":"Coin Path","titleSlug":"coin-path"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":657,"title":"Robot Return to Origin","titleSlug":"robot-return-to-origin"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":658,"title":"Find K Closest Elements","titleSlug":"find-k-closest-elements"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":659,"title":"Split Array into Consecutive Subsequences","titleSlug":"split-array-into-consecutive-subsequences"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":660,"title":"Remove 9","titleSlug":"remove-9"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":661,"title":"Image Smoother","titleSlug":"image-smoother"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":662,"title":"Maximum Width of Binary Tree","titleSlug":"maximum-width-of-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":663,"title":"Equal Tree Partition","titleSlug":"equal-tree-partition"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":664,"title":"Strange Printer","titleSlug":"strange-printer"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":665,"title":"Non-decreasing Array","titleSlug":"non-decreasing-array"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":666,"title":"Path Sum IV","titleSlug":"path-sum-iv"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":667,"title":"Beautiful Arrangement II","titleSlug":"beautiful-arrangement-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":668,"title":"Kth Smallest Number in Multiplication Table","titleSlug":"kth-smallest-number-in-multiplication-table"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":669,"title":"Trim a Binary Search Tree","titleSlug":"trim-a-binary-search-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":670,"title":"Maximum Swap","titleSlug":"maximum-swap"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":671,"title":"Second Minimum Node In a Binary Tree","titleSlug":"second-minimum-node-in-a-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":672,"title":"Bulb Switcher II","titleSlug":"bulb-switcher-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":673,"title":"Number of Longest Increasing Subsequence","titleSlug":"number-of-longest-increasing-subsequence"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":674,"title":"Longest Continuous Increasing Subsequence","titleSlug":"longest-continuous-increasing-subsequence"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":675,"title":"Cut Off Trees for Golf Event","titleSlug":"cut-off-trees-for-golf-event"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":676,"title":"Implement Magic Dictionary","titleSlug":"implement-magic-dictionary"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":677,"title":"Map Sum Pairs","titleSlug":"map-sum-pairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":678,"title":"Valid Parenthesis String","titleSlug":"valid-parenthesis-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":679,"title":"24 Game","titleSlug":"24-game"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":680,"title":"Valid Palindrome II","titleSlug":"valid-palindrome-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":681,"title":"Next Closest Time","titleSlug":"next-closest-time"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":682,"title":"Baseball Game","titleSlug":"baseball-game"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":683,"title":"K Empty Slots","titleSlug":"k-empty-slots"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":684,"title":"Redundant Connection","titleSlug":"redundant-connection"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":685,"title":"Redundant Connection II","titleSlug":"redundant-connection-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":686,"title":"Repeated String Match","titleSlug":"repeated-string-match"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":687,"title":"Longest Univalue Path","titleSlug":"longest-univalue-path"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":688,"title":"Knight Probability in Chessboard","titleSlug":"knight-probability-in-chessboard"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":689,"title":"Maximum Sum of 3 Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":690,"title":"Employee Importance","titleSlug":"employee-importance"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":691,"title":"Stickers to Spell Word","titleSlug":"stickers-to-spell-word"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":692,"title":"Top K Frequent Words","titleSlug":"top-k-frequent-words"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":693,"title":"Binary Number with Alternating Bits","titleSlug":"binary-number-with-alternating-bits"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":694,"title":"Number of Distinct Islands","titleSlug":"number-of-distinct-islands"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":695,"title":"Max Area of Island","titleSlug":"max-area-of-island"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":696,"title":"Count Binary Substrings","titleSlug":"count-binary-substrings"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":697,"title":"Degree of an Array","titleSlug":"degree-of-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":698,"title":"Partition to K Equal Sum Subsets","titleSlug":"partition-to-k-equal-sum-subsets"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":699,"title":"Falling Squares","titleSlug":"falling-squares"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":700,"title":"Search in a Binary Search Tree","titleSlug":"search-in-a-binary-search-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":701,"title":"Insert into a Binary Search Tree","titleSlug":"insert-into-a-binary-search-tree"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":702,"title":"Search in a Sorted Array of Unknown Size","titleSlug":"search-in-a-sorted-array-of-unknown-size"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":703,"title":"Kth Largest Element in a Stream","titleSlug":"kth-largest-element-in-a-stream"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":704,"title":"Binary Search","titleSlug":"binary-search"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":705,"title":"Design HashSet","titleSlug":"design-hashset"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":706,"title":"Design HashMap","titleSlug":"design-hashmap"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":707,"title":"Design Linked List","titleSlug":"design-linked-list"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":708,"title":"Insert into a Sorted Circular Linked List","titleSlug":"insert-into-a-sorted-circular-linked-list"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":709,"title":"To Lower Case","titleSlug":"to-lower-case"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":710,"title":"Random Pick with Blacklist","titleSlug":"random-pick-with-blacklist"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":711,"title":"Number of Distinct Islands II","titleSlug":"number-of-distinct-islands-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":712,"title":"Minimum ASCII Delete Sum for Two Strings","titleSlug":"minimum-ascii-delete-sum-for-two-strings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":713,"title":"Subarray Product Less Than K","titleSlug":"subarray-product-less-than-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":714,"title":"Best Time to Buy and Sell Stock with Transaction Fee","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":715,"title":"Range Module","titleSlug":"range-module"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":716,"title":"Max Stack","titleSlug":"max-stack"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":717,"title":"1-bit and 2-bit Characters","titleSlug":"1-bit-and-2-bit-characters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":718,"title":"Maximum Length of Repeated Subarray","titleSlug":"maximum-length-of-repeated-subarray"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":719,"title":"Find K-th Smallest Pair Distance","titleSlug":"find-k-th-smallest-pair-distance"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":720,"title":"Longest Word in Dictionary","titleSlug":"longest-word-in-dictionary"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":721,"title":"Accounts Merge","titleSlug":"accounts-merge"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":722,"title":"Remove Comments","titleSlug":"remove-comments"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":723,"title":"Candy Crush","titleSlug":"candy-crush"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":724,"title":"Find Pivot Index","titleSlug":"find-pivot-index"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":725,"title":"Split Linked List in Parts","titleSlug":"split-linked-list-in-parts"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":726,"title":"Number of Atoms","titleSlug":"number-of-atoms"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":727,"title":"Minimum Window Subsequence","titleSlug":"minimum-window-subsequence"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":728,"title":"Self Dividing Numbers","titleSlug":"self-dividing-numbers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":729,"title":"My Calendar I","titleSlug":"my-calendar-i"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":730,"title":"Count Different Palindromic Subsequences","titleSlug":"count-different-palindromic-subsequences"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":731,"title":"My Calendar II","titleSlug":"my-calendar-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":732,"title":"My Calendar III","titleSlug":"my-calendar-iii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":733,"title":"Flood Fill","titleSlug":"flood-fill"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":734,"title":"Sentence Similarity","titleSlug":"sentence-similarity"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":735,"title":"Asteroid Collision","titleSlug":"asteroid-collision"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":736,"title":"Parse Lisp Expression","titleSlug":"parse-lisp-expression"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":737,"title":"Sentence Similarity II","titleSlug":"sentence-similarity-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":738,"title":"Monotone Increasing Digits","titleSlug":"monotone-increasing-digits"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":739,"title":"Daily Temperatures","titleSlug":"daily-temperatures"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":740,"title":"Delete and Earn","titleSlug":"delete-and-earn"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":741,"title":"Cherry Pickup","titleSlug":"cherry-pickup"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":742,"title":"Closest Leaf in a Binary Tree","titleSlug":"closest-leaf-in-a-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":743,"title":"Network Delay Time","titleSlug":"network-delay-time"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":744,"title":"Find Smallest Letter Greater Than Target","titleSlug":"find-smallest-letter-greater-than-target"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":745,"title":"Prefix and Suffix Search","titleSlug":"prefix-and-suffix-search"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":746,"title":"Min Cost Climbing Stairs","titleSlug":"min-cost-climbing-stairs"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":747,"title":"Largest Number At Least Twice of Others","titleSlug":"largest-number-at-least-twice-of-others"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":748,"title":"Shortest Completing Word","titleSlug":"shortest-completing-word"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":749,"title":"Contain Virus","titleSlug":"contain-virus"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":750,"title":"Number Of Corner Rectangles","titleSlug":"number-of-corner-rectangles"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":751,"title":"IP to CIDR","titleSlug":"ip-to-cidr"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":752,"title":"Open the Lock","titleSlug":"open-the-lock"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":753,"title":"Cracking the Safe","titleSlug":"cracking-the-safe"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":754,"title":"Reach a Number","titleSlug":"reach-a-number"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":755,"title":"Pour Water","titleSlug":"pour-water"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":756,"title":"Pyramid Transition Matrix","titleSlug":"pyramid-transition-matrix"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":757,"title":"Set Intersection Size At Least Two","titleSlug":"set-intersection-size-at-least-two"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":758,"title":"Bold Words in String","titleSlug":"bold-words-in-string"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":759,"title":"Employee Free Time","titleSlug":"employee-free-time"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":760,"title":"Find Anagram Mappings","titleSlug":"find-anagram-mappings"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":761,"title":"Special Binary String","titleSlug":"special-binary-string"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":762,"title":"Prime Number of Set Bits in Binary Representation","titleSlug":"prime-number-of-set-bits-in-binary-representation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":763,"title":"Partition Labels","titleSlug":"partition-labels"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":764,"title":"Largest Plus Sign","titleSlug":"largest-plus-sign"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":765,"title":"Couples Holding Hands","titleSlug":"couples-holding-hands"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":766,"title":"Toeplitz Matrix","titleSlug":"toeplitz-matrix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":767,"title":"Reorganize String","titleSlug":"reorganize-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":768,"title":"Max Chunks To Make Sorted II","titleSlug":"max-chunks-to-make-sorted-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":769,"title":"Max Chunks To Make Sorted","titleSlug":"max-chunks-to-make-sorted"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":770,"title":"Basic Calculator IV","titleSlug":"basic-calculator-iv"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":771,"title":"Jewels and Stones","titleSlug":"jewels-and-stones"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":772,"title":"Basic Calculator III","titleSlug":"basic-calculator-iii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":773,"title":"Sliding Puzzle","titleSlug":"sliding-puzzle"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":774,"title":"Minimize Max Distance to Gas Station","titleSlug":"minimize-max-distance-to-gas-station"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":775,"title":"Global and Local Inversions","titleSlug":"global-and-local-inversions"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":776,"title":"Split BST","titleSlug":"split-bst"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":777,"title":"Swap Adjacent in LR String","titleSlug":"swap-adjacent-in-lr-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":778,"title":"Swim in Rising Water","titleSlug":"swim-in-rising-water"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":779,"title":"K-th Symbol in Grammar","titleSlug":"k-th-symbol-in-grammar"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":780,"title":"Reaching Points","titleSlug":"reaching-points"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":781,"title":"Rabbits in Forest","titleSlug":"rabbits-in-forest"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":782,"title":"Transform to Chessboard","titleSlug":"transform-to-chessboard"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":783,"title":"Minimum Distance Between BST Nodes","titleSlug":"minimum-distance-between-bst-nodes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":784,"title":"Letter Case Permutation","titleSlug":"letter-case-permutation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":785,"title":"Is Graph Bipartite?","titleSlug":"is-graph-bipartite"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":786,"title":"K-th Smallest Prime Fraction","titleSlug":"k-th-smallest-prime-fraction"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":787,"title":"Cheapest Flights Within K Stops","titleSlug":"cheapest-flights-within-k-stops"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":788,"title":"Rotated Digits","titleSlug":"rotated-digits"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":789,"title":"Escape The Ghosts","titleSlug":"escape-the-ghosts"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":790,"title":"Domino and Tromino Tiling","titleSlug":"domino-and-tromino-tiling"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":791,"title":"Custom Sort String","titleSlug":"custom-sort-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":792,"title":"Number of Matching Subsequences","titleSlug":"number-of-matching-subsequences"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":793,"title":"Preimage Size of Factorial Zeroes Function","titleSlug":"preimage-size-of-factorial-zeroes-function"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":794,"title":"Valid Tic-Tac-Toe State","titleSlug":"valid-tic-tac-toe-state"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":795,"title":"Number of Subarrays with Bounded Maximum","titleSlug":"number-of-subarrays-with-bounded-maximum"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":796,"title":"Rotate String","titleSlug":"rotate-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":797,"title":"All Paths From Source to Target","titleSlug":"all-paths-from-source-to-target"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":798,"title":"Smallest Rotation with Highest Score","titleSlug":"smallest-rotation-with-highest-score"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":799,"title":"Champagne Tower","titleSlug":"champagne-tower"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":800,"title":"Similar RGB Color","titleSlug":"similar-rgb-color"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":801,"title":"Minimum Swaps To Make Sequences Increasing","titleSlug":"minimum-swaps-to-make-sequences-increasing"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":802,"title":"Find Eventual Safe States","titleSlug":"find-eventual-safe-states"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":803,"title":"Bricks Falling When Hit","titleSlug":"bricks-falling-when-hit"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":804,"title":"Unique Morse Code Words","titleSlug":"unique-morse-code-words"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":805,"title":"Split Array With Same Average","titleSlug":"split-array-with-same-average"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":806,"title":"Number of Lines To Write String","titleSlug":"number-of-lines-to-write-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":807,"title":"Max Increase to Keep City Skyline","titleSlug":"max-increase-to-keep-city-skyline"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":808,"title":"Soup Servings","titleSlug":"soup-servings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":809,"title":"Expressive Words","titleSlug":"expressive-words"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":810,"title":"Chalkboard XOR Game","titleSlug":"chalkboard-xor-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":811,"title":"Subdomain Visit Count","titleSlug":"subdomain-visit-count"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":812,"title":"Largest Triangle Area","titleSlug":"largest-triangle-area"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":813,"title":"Largest Sum of Averages","titleSlug":"largest-sum-of-averages"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":814,"title":"Binary Tree Pruning","titleSlug":"binary-tree-pruning"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":815,"title":"Bus Routes","titleSlug":"bus-routes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":816,"title":"Ambiguous Coordinates","titleSlug":"ambiguous-coordinates"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":817,"title":"Linked List Components","titleSlug":"linked-list-components"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":818,"title":"Race Car","titleSlug":"race-car"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":819,"title":"Most Common Word","titleSlug":"most-common-word"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":820,"title":"Short Encoding of Words","titleSlug":"short-encoding-of-words"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":821,"title":"Shortest Distance to a Character","titleSlug":"shortest-distance-to-a-character"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":822,"title":"Card Flipping Game","titleSlug":"card-flipping-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":823,"title":"Binary Trees With Factors","titleSlug":"binary-trees-with-factors"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":824,"title":"Goat Latin","titleSlug":"goat-latin"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":825,"title":"Friends Of Appropriate Ages","titleSlug":"friends-of-appropriate-ages"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":826,"title":"Most Profit Assigning Work","titleSlug":"most-profit-assigning-work"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":827,"title":"Making A Large Island","titleSlug":"making-a-large-island"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":828,"title":"Count Unique Characters of All Substrings of a Given String","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":829,"title":"Consecutive Numbers Sum","titleSlug":"consecutive-numbers-sum"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":830,"title":"Positions of Large Groups","titleSlug":"positions-of-large-groups"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":831,"title":"Masking Personal Information","titleSlug":"masking-personal-information"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":832,"title":"Flipping an Image","titleSlug":"flipping-an-image"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":833,"title":"Find And Replace in String","titleSlug":"find-and-replace-in-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":834,"title":"Sum of Distances in Tree","titleSlug":"sum-of-distances-in-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":835,"title":"Image Overlap","titleSlug":"image-overlap"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":836,"title":"Rectangle Overlap","titleSlug":"rectangle-overlap"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":837,"title":"New 21 Game","titleSlug":"new-21-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":838,"title":"Push Dominoes","titleSlug":"push-dominoes"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":839,"title":"Similar String Groups","titleSlug":"similar-string-groups"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":840,"title":"Magic Squares In Grid","titleSlug":"magic-squares-in-grid"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":841,"title":"Keys and Rooms","titleSlug":"keys-and-rooms"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":842,"title":"Split Array into Fibonacci Sequence","titleSlug":"split-array-into-fibonacci-sequence"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":843,"title":"Guess the Word","titleSlug":"guess-the-word"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":844,"title":"Backspace String Compare","titleSlug":"backspace-string-compare"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":845,"title":"Longest Mountain in Array","titleSlug":"longest-mountain-in-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":846,"title":"Hand of Straights","titleSlug":"hand-of-straights"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":847,"title":"Shortest Path Visiting All Nodes","titleSlug":"shortest-path-visiting-all-nodes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":848,"title":"Shifting Letters","titleSlug":"shifting-letters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":849,"title":"Maximize Distance to Closest Person","titleSlug":"maximize-distance-to-closest-person"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":850,"title":"Rectangle Area II","titleSlug":"rectangle-area-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":851,"title":"Loud and Rich","titleSlug":"loud-and-rich"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":852,"title":"Peak Index in a Mountain Array","titleSlug":"peak-index-in-a-mountain-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":853,"title":"Car Fleet","titleSlug":"car-fleet"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":854,"title":"K-Similar Strings","titleSlug":"k-similar-strings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":855,"title":"Exam Room","titleSlug":"exam-room"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":856,"title":"Score of Parentheses","titleSlug":"score-of-parentheses"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":857,"title":"Minimum Cost to Hire K Workers","titleSlug":"minimum-cost-to-hire-k-workers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":858,"title":"Mirror Reflection","titleSlug":"mirror-reflection"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":859,"title":"Buddy Strings","titleSlug":"buddy-strings"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":860,"title":"Lemonade Change","titleSlug":"lemonade-change"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":861,"title":"Score After Flipping Matrix","titleSlug":"score-after-flipping-matrix"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":862,"title":"Shortest Subarray with Sum at Least K","titleSlug":"shortest-subarray-with-sum-at-least-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":863,"title":"All Nodes Distance K in Binary Tree","titleSlug":"all-nodes-distance-k-in-binary-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":864,"title":"Shortest Path to Get All Keys","titleSlug":"shortest-path-to-get-all-keys"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":865,"title":"Smallest Subtree with all the Deepest Nodes","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":866,"title":"Prime Palindrome","titleSlug":"prime-palindrome"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":867,"title":"Transpose Matrix","titleSlug":"transpose-matrix"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":868,"title":"Binary Gap","titleSlug":"binary-gap"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":869,"title":"Reordered Power of 2","titleSlug":"reordered-power-of-2"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":870,"title":"Advantage Shuffle","titleSlug":"advantage-shuffle"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":871,"title":"Minimum Number of Refueling Stops","titleSlug":"minimum-number-of-refueling-stops"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":872,"title":"Leaf-Similar Trees","titleSlug":"leaf-similar-trees"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":873,"title":"Length of Longest Fibonacci Subsequence","titleSlug":"length-of-longest-fibonacci-subsequence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":874,"title":"Walking Robot Simulation","titleSlug":"walking-robot-simulation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":875,"title":"Koko Eating Bananas","titleSlug":"koko-eating-bananas"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":876,"title":"Middle of the Linked List","titleSlug":"middle-of-the-linked-list"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":877,"title":"Stone Game","titleSlug":"stone-game"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":878,"title":"Nth Magical Number","titleSlug":"nth-magical-number"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":879,"title":"Profitable Schemes","titleSlug":"profitable-schemes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":880,"title":"Decoded String at Index","titleSlug":"decoded-string-at-index"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":881,"title":"Boats to Save People","titleSlug":"boats-to-save-people"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":882,"title":"Reachable Nodes In Subdivided Graph","titleSlug":"reachable-nodes-in-subdivided-graph"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":883,"title":"Projection Area of 3D Shapes","titleSlug":"projection-area-of-3d-shapes"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":884,"title":"Uncommon Words from Two Sentences","titleSlug":"uncommon-words-from-two-sentences"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":885,"title":"Spiral Matrix III","titleSlug":"spiral-matrix-iii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":886,"title":"Possible Bipartition","titleSlug":"possible-bipartition"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":887,"title":"Super Egg Drop","titleSlug":"super-egg-drop"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":888,"title":"Fair Candy Swap","titleSlug":"fair-candy-swap"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":889,"title":"Construct Binary Tree from Preorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":890,"title":"Find and Replace Pattern","titleSlug":"find-and-replace-pattern"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":891,"title":"Sum of Subsequence Widths","titleSlug":"sum-of-subsequence-widths"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":892,"title":"Surface Area of 3D Shapes","titleSlug":"surface-area-of-3d-shapes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":893,"title":"Groups of Special-Equivalent Strings","titleSlug":"groups-of-special-equivalent-strings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":894,"title":"All Possible Full Binary Trees","titleSlug":"all-possible-full-binary-trees"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":895,"title":"Maximum Frequency Stack","titleSlug":"maximum-frequency-stack"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":896,"title":"Monotonic Array","titleSlug":"monotonic-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":897,"title":"Increasing Order Search Tree","titleSlug":"increasing-order-search-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":898,"title":"Bitwise ORs of Subarrays","titleSlug":"bitwise-ors-of-subarrays"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":899,"title":"Orderly Queue","titleSlug":"orderly-queue"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":900,"title":"RLE Iterator","titleSlug":"rle-iterator"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":901,"title":"Online Stock Span","titleSlug":"online-stock-span"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":902,"title":"Numbers At Most N Given Digit Set","titleSlug":"numbers-at-most-n-given-digit-set"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":903,"title":"Valid Permutations for DI Sequence","titleSlug":"valid-permutations-for-di-sequence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":904,"title":"Fruit Into Baskets","titleSlug":"fruit-into-baskets"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":905,"title":"Sort Array By Parity","titleSlug":"sort-array-by-parity"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":906,"title":"Super Palindromes","titleSlug":"super-palindromes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":907,"title":"Sum of Subarray Minimums","titleSlug":"sum-of-subarray-minimums"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":908,"title":"Smallest Range I","titleSlug":"smallest-range-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":909,"title":"Snakes and Ladders","titleSlug":"snakes-and-ladders"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":910,"title":"Smallest Range II","titleSlug":"smallest-range-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":911,"title":"Online Election","titleSlug":"online-election"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":912,"title":"Sort an Array","titleSlug":"sort-an-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":913,"title":"Cat and Mouse","titleSlug":"cat-and-mouse"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":914,"title":"X of a Kind in a Deck of Cards","titleSlug":"x-of-a-kind-in-a-deck-of-cards"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":915,"title":"Partition Array into Disjoint Intervals","titleSlug":"partition-array-into-disjoint-intervals"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":916,"title":"Word Subsets","titleSlug":"word-subsets"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":917,"title":"Reverse Only Letters","titleSlug":"reverse-only-letters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":918,"title":"Maximum Sum Circular Subarray","titleSlug":"maximum-sum-circular-subarray"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":919,"title":"Complete Binary Tree Inserter","titleSlug":"complete-binary-tree-inserter"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":920,"title":"Number of Music Playlists","titleSlug":"number-of-music-playlists"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":921,"title":"Minimum Add to Make Parentheses Valid","titleSlug":"minimum-add-to-make-parentheses-valid"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":922,"title":"Sort Array By Parity II","titleSlug":"sort-array-by-parity-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":923,"title":"3Sum With Multiplicity","titleSlug":"3sum-with-multiplicity"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":924,"title":"Minimize Malware Spread","titleSlug":"minimize-malware-spread"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":925,"title":"Long Pressed Name","titleSlug":"long-pressed-name"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":926,"title":"Flip String to Monotone Increasing","titleSlug":"flip-string-to-monotone-increasing"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":927,"title":"Three Equal Parts","titleSlug":"three-equal-parts"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":928,"title":"Minimize Malware Spread II","titleSlug":"minimize-malware-spread-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":929,"title":"Unique Email Addresses","titleSlug":"unique-email-addresses"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":930,"title":"Binary Subarrays With Sum","titleSlug":"binary-subarrays-with-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":931,"title":"Minimum Falling Path Sum","titleSlug":"minimum-falling-path-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":932,"title":"Beautiful Array","titleSlug":"beautiful-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":933,"title":"Number of Recent Calls","titleSlug":"number-of-recent-calls"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":934,"title":"Shortest Bridge","titleSlug":"shortest-bridge"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":935,"title":"Knight Dialer","titleSlug":"knight-dialer"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":936,"title":"Stamping The Sequence","titleSlug":"stamping-the-sequence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":937,"title":"Reorder Data in Log Files","titleSlug":"reorder-data-in-log-files"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":938,"title":"Range Sum of BST","titleSlug":"range-sum-of-bst"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":939,"title":"Minimum Area Rectangle","titleSlug":"minimum-area-rectangle"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":940,"title":"Distinct Subsequences II","titleSlug":"distinct-subsequences-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":941,"title":"Valid Mountain Array","titleSlug":"valid-mountain-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":942,"title":"DI String Match","titleSlug":"di-string-match"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":943,"title":"Find the Shortest Superstring","titleSlug":"find-the-shortest-superstring"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":944,"title":"Delete Columns to Make Sorted","titleSlug":"delete-columns-to-make-sorted"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":945,"title":"Minimum Increment to Make Array Unique","titleSlug":"minimum-increment-to-make-array-unique"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":946,"title":"Validate Stack Sequences","titleSlug":"validate-stack-sequences"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":947,"title":"Most Stones Removed with Same Row or Column","titleSlug":"most-stones-removed-with-same-row-or-column"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":948,"title":"Bag of Tokens","titleSlug":"bag-of-tokens"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":949,"title":"Largest Time for Given Digits","titleSlug":"largest-time-for-given-digits"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":950,"title":"Reveal Cards In Increasing Order","titleSlug":"reveal-cards-in-increasing-order"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":951,"title":"Flip Equivalent Binary Trees","titleSlug":"flip-equivalent-binary-trees"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":952,"title":"Largest Component Size by Common Factor","titleSlug":"largest-component-size-by-common-factor"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":953,"title":"Verifying an Alien Dictionary","titleSlug":"verifying-an-alien-dictionary"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":954,"title":"Array of Doubled Pairs","titleSlug":"array-of-doubled-pairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":955,"title":"Delete Columns to Make Sorted II","titleSlug":"delete-columns-to-make-sorted-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":956,"title":"Tallest Billboard","titleSlug":"tallest-billboard"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":957,"title":"Prison Cells After N Days","titleSlug":"prison-cells-after-n-days"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":958,"title":"Check Completeness of a Binary Tree","titleSlug":"check-completeness-of-a-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":959,"title":"Regions Cut By Slashes","titleSlug":"regions-cut-by-slashes"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":960,"title":"Delete Columns to Make Sorted III","titleSlug":"delete-columns-to-make-sorted-iii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":961,"title":"N-Repeated Element in Size 2N Array","titleSlug":"n-repeated-element-in-size-2n-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":962,"title":"Maximum Width Ramp","titleSlug":"maximum-width-ramp"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":963,"title":"Minimum Area Rectangle II","titleSlug":"minimum-area-rectangle-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":964,"title":"Least Operators to Express Number","titleSlug":"least-operators-to-express-number"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":965,"title":"Univalued Binary Tree","titleSlug":"univalued-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":966,"title":"Vowel Spellchecker","titleSlug":"vowel-spellchecker"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":967,"title":"Numbers With Same Consecutive Differences","titleSlug":"numbers-with-same-consecutive-differences"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":968,"title":"Binary Tree Cameras","titleSlug":"binary-tree-cameras"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":969,"title":"Pancake Sorting","titleSlug":"pancake-sorting"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":970,"title":"Powerful Integers","titleSlug":"powerful-integers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":971,"title":"Flip Binary Tree To Match Preorder Traversal","titleSlug":"flip-binary-tree-to-match-preorder-traversal"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":972,"title":"Equal Rational Numbers","titleSlug":"equal-rational-numbers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":973,"title":"K Closest Points to Origin","titleSlug":"k-closest-points-to-origin"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":974,"title":"Subarray Sums Divisible by K","titleSlug":"subarray-sums-divisible-by-k"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":975,"title":"Odd Even Jump","titleSlug":"odd-even-jump"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":976,"title":"Largest Perimeter Triangle","titleSlug":"largest-perimeter-triangle"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":977,"title":"Squares of a Sorted Array","titleSlug":"squares-of-a-sorted-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":978,"title":"Longest Turbulent Subarray","titleSlug":"longest-turbulent-subarray"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":979,"title":"Distribute Coins in Binary Tree","titleSlug":"distribute-coins-in-binary-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":980,"title":"Unique Paths III","titleSlug":"unique-paths-iii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":981,"title":"Time Based Key-Value Store","titleSlug":"time-based-key-value-store"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":982,"title":"Triples with Bitwise AND Equal To Zero","titleSlug":"triples-with-bitwise-and-equal-to-zero"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":983,"title":"Minimum Cost For Tickets","titleSlug":"minimum-cost-for-tickets"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":984,"title":"String Without AAA or BBB","titleSlug":"string-without-aaa-or-bbb"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":985,"title":"Sum of Even Numbers After Queries","titleSlug":"sum-of-even-numbers-after-queries"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":986,"title":"Interval List Intersections","titleSlug":"interval-list-intersections"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":987,"title":"Vertical Order Traversal of a Binary Tree","titleSlug":"vertical-order-traversal-of-a-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":988,"title":"Smallest String Starting From Leaf","titleSlug":"smallest-string-starting-from-leaf"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":989,"title":"Add to Array-Form of Integer","titleSlug":"add-to-array-form-of-integer"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":990,"title":"Satisfiability of Equality Equations","titleSlug":"satisfiability-of-equality-equations"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":991,"title":"Broken Calculator","titleSlug":"broken-calculator"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":992,"title":"Subarrays with K Different Integers","titleSlug":"subarrays-with-k-different-integers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":993,"title":"Cousins in Binary Tree","titleSlug":"cousins-in-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":994,"title":"Rotting Oranges","titleSlug":"rotting-oranges"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":995,"title":"Minimum Number of K Consecutive Bit Flips","titleSlug":"minimum-number-of-k-consecutive-bit-flips"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":996,"title":"Number of Squareful Arrays","titleSlug":"number-of-squareful-arrays"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":997,"title":"Find the Town Judge","titleSlug":"find-the-town-judge"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":998,"title":"Maximum Binary Tree II","titleSlug":"maximum-binary-tree-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":999,"title":"Available Captures for Rook","titleSlug":"available-captures-for-rook"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1000,"title":"Minimum Cost to Merge Stones","titleSlug":"minimum-cost-to-merge-stones"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1001,"title":"Grid Illumination","titleSlug":"grid-illumination"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1002,"title":"Find Common Characters","titleSlug":"find-common-characters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1003,"title":"Check If Word Is Valid After Substitutions","titleSlug":"check-if-word-is-valid-after-substitutions"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1004,"title":"Max Consecutive Ones III","titleSlug":"max-consecutive-ones-iii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1005,"title":"Maximize Sum Of Array After K Negations","titleSlug":"maximize-sum-of-array-after-k-negations"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1006,"title":"Clumsy Factorial","titleSlug":"clumsy-factorial"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1007,"title":"Minimum Domino Rotations For Equal Row","titleSlug":"minimum-domino-rotations-for-equal-row"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1008,"title":"Construct Binary Search Tree from Preorder Traversal","titleSlug":"construct-binary-search-tree-from-preorder-traversal"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1009,"title":"Complement of Base 10 Integer","titleSlug":"complement-of-base-10-integer"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1010,"title":"Pairs of Songs With Total Durations Divisible by 60","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1011,"title":"Capacity To Ship Packages Within D Days","titleSlug":"capacity-to-ship-packages-within-d-days"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1012,"title":"Numbers With Repeated Digits","titleSlug":"numbers-with-repeated-digits"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1013,"title":"Partition Array Into Three Parts With Equal Sum","titleSlug":"partition-array-into-three-parts-with-equal-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1014,"title":"Best Sightseeing Pair","titleSlug":"best-sightseeing-pair"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1015,"title":"Smallest Integer Divisible by K","titleSlug":"smallest-integer-divisible-by-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1016,"title":"Binary String With Substrings Representing 1 To N","titleSlug":"binary-string-with-substrings-representing-1-to-n"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1017,"title":"Convert to Base -2","titleSlug":"convert-to-base-2"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1018,"title":"Binary Prefix Divisible By 5","titleSlug":"binary-prefix-divisible-by-5"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1019,"title":"Next Greater Node In Linked List","titleSlug":"next-greater-node-in-linked-list"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1020,"title":"Number of Enclaves","titleSlug":"number-of-enclaves"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1021,"title":"Remove Outermost Parentheses","titleSlug":"remove-outermost-parentheses"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1022,"title":"Sum of Root To Leaf Binary Numbers","titleSlug":"sum-of-root-to-leaf-binary-numbers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1023,"title":"Camelcase Matching","titleSlug":"camelcase-matching"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1024,"title":"Video Stitching","titleSlug":"video-stitching"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1025,"title":"Divisor Game","titleSlug":"divisor-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1026,"title":"Maximum Difference Between Node and Ancestor","titleSlug":"maximum-difference-between-node-and-ancestor"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1027,"title":"Longest Arithmetic Subsequence","titleSlug":"longest-arithmetic-subsequence"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1028,"title":"Recover a Tree From Preorder Traversal","titleSlug":"recover-a-tree-from-preorder-traversal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1029,"title":"Two City Scheduling","titleSlug":"two-city-scheduling"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1030,"title":"Matrix Cells in Distance Order","titleSlug":"matrix-cells-in-distance-order"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1031,"title":"Maximum Sum of Two Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1032,"title":"Stream of Characters","titleSlug":"stream-of-characters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1033,"title":"Moving Stones Until Consecutive","titleSlug":"moving-stones-until-consecutive"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1034,"title":"Coloring A Border","titleSlug":"coloring-a-border"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1035,"title":"Uncrossed Lines","titleSlug":"uncrossed-lines"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1036,"title":"Escape a Large Maze","titleSlug":"escape-a-large-maze"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1037,"title":"Valid Boomerang","titleSlug":"valid-boomerang"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1038,"title":"Binary Search Tree to Greater Sum Tree","titleSlug":"binary-search-tree-to-greater-sum-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1039,"title":"Minimum Score Triangulation of Polygon","titleSlug":"minimum-score-triangulation-of-polygon"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1040,"title":"Moving Stones Until Consecutive II","titleSlug":"moving-stones-until-consecutive-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1041,"title":"Robot Bounded In Circle","titleSlug":"robot-bounded-in-circle"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1042,"title":"Flower Planting With No Adjacent","titleSlug":"flower-planting-with-no-adjacent"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1043,"title":"Partition Array for Maximum Sum","titleSlug":"partition-array-for-maximum-sum"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1044,"title":"Longest Duplicate Substring","titleSlug":"longest-duplicate-substring"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1045,"title":"Customers Who Bought All Products","titleSlug":"customers-who-bought-all-products"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1046,"title":"Last Stone Weight","titleSlug":"last-stone-weight"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1047,"title":"Remove All Adjacent Duplicates In String","titleSlug":"remove-all-adjacent-duplicates-in-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1048,"title":"Longest String Chain","titleSlug":"longest-string-chain"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1049,"title":"Last Stone Weight II","titleSlug":"last-stone-weight-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1050,"title":"Actors and Directors Who Cooperated At Least Three Times","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1051,"title":"Height Checker","titleSlug":"height-checker"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1052,"title":"Grumpy Bookstore Owner","titleSlug":"grumpy-bookstore-owner"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1053,"title":"Previous Permutation With One Swap","titleSlug":"previous-permutation-with-one-swap"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1054,"title":"Distant Barcodes","titleSlug":"distant-barcodes"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1055,"title":"Shortest Way to Form String","titleSlug":"shortest-way-to-form-string"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1056,"title":"Confusing Number","titleSlug":"confusing-number"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1057,"title":"Campus Bikes","titleSlug":"campus-bikes"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1058,"title":"Minimize Rounding Error to Meet Target","titleSlug":"minimize-rounding-error-to-meet-target"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1059,"title":"All Paths from Source Lead to Destination","titleSlug":"all-paths-from-source-lead-to-destination"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1060,"title":"Missing Element in Sorted Array","titleSlug":"missing-element-in-sorted-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1061,"title":"Lexicographically Smallest Equivalent String","titleSlug":"lexicographically-smallest-equivalent-string"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1062,"title":"Longest Repeating Substring","titleSlug":"longest-repeating-substring"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1063,"title":"Number of Valid Subarrays","titleSlug":"number-of-valid-subarrays"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1064,"title":"Fixed Point","titleSlug":"fixed-point"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1065,"title":"Index Pairs of a String","titleSlug":"index-pairs-of-a-string"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1066,"title":"Campus Bikes II","titleSlug":"campus-bikes-ii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1067,"title":"Digit Count in Range","titleSlug":"digit-count-in-range"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1068,"title":"Product Sales Analysis I","titleSlug":"product-sales-analysis-i"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1069,"title":"Product Sales Analysis II","titleSlug":"product-sales-analysis-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1070,"title":"Product Sales Analysis III","titleSlug":"product-sales-analysis-iii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1071,"title":"Greatest Common Divisor of Strings","titleSlug":"greatest-common-divisor-of-strings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1072,"title":"Flip Columns For Maximum Number of Equal Rows","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1073,"title":"Adding Two Negabinary Numbers","titleSlug":"adding-two-negabinary-numbers"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1074,"title":"Number of Submatrices That Sum to Target","titleSlug":"number-of-submatrices-that-sum-to-target"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1075,"title":"Project Employees I","titleSlug":"project-employees-i"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1076,"title":"Project Employees II","titleSlug":"project-employees-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1077,"title":"Project Employees III","titleSlug":"project-employees-iii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1078,"title":"Occurrences After Bigram","titleSlug":"occurrences-after-bigram"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1079,"title":"Letter Tile Possibilities","titleSlug":"letter-tile-possibilities"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1080,"title":"Insufficient Nodes in Root to Leaf Paths","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1081,"title":"Smallest Subsequence of Distinct Characters","titleSlug":"smallest-subsequence-of-distinct-characters"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1082,"title":"Sales Analysis I","titleSlug":"sales-analysis-i"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1083,"title":"Sales Analysis II","titleSlug":"sales-analysis-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1084,"title":"Sales Analysis III","titleSlug":"sales-analysis-iii"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1085,"title":"Sum of Digits in the Minimum Number","titleSlug":"sum-of-digits-in-the-minimum-number"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1086,"title":"High Five","titleSlug":"high-five"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1087,"title":"Brace Expansion","titleSlug":"brace-expansion"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1088,"title":"Confusing Number II","titleSlug":"confusing-number-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1089,"title":"Duplicate Zeros","titleSlug":"duplicate-zeros"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1090,"title":"Largest Values From Labels","titleSlug":"largest-values-from-labels"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1091,"title":"Shortest Path in Binary Matrix","titleSlug":"shortest-path-in-binary-matrix"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1092,"title":"Shortest Common Supersequence","titleSlug":"shortest-common-supersequence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1093,"title":"Statistics from a Large Sample","titleSlug":"statistics-from-a-large-sample"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1094,"title":"Car Pooling","titleSlug":"car-pooling"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1095,"title":"Find in Mountain Array","titleSlug":"find-in-mountain-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1096,"title":"Brace Expansion II","titleSlug":"brace-expansion-ii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1097,"title":"Game Play Analysis V","titleSlug":"game-play-analysis-v"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1098,"title":"Unpopular Books","titleSlug":"unpopular-books"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1099,"title":"Two Sum Less Than K","titleSlug":"two-sum-less-than-k"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1100,"title":"Find K-Length Substrings With No Repeated Characters","titleSlug":"find-k-length-substrings-with-no-repeated-characters"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1101,"title":"The Earliest Moment When Everyone Become Friends","titleSlug":"the-earliest-moment-when-everyone-become-friends"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1102,"title":"Path With Maximum Minimum Value","titleSlug":"path-with-maximum-minimum-value"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1103,"title":"Distribute Candies to People","titleSlug":"distribute-candies-to-people"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1104,"title":"Path In Zigzag Labelled Binary Tree","titleSlug":"path-in-zigzag-labelled-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1105,"title":"Filling Bookcase Shelves","titleSlug":"filling-bookcase-shelves"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1106,"title":"Parsing A Boolean Expression","titleSlug":"parsing-a-boolean-expression"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1107,"title":"New Users Daily Count","titleSlug":"new-users-daily-count"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1108,"title":"Defanging an IP Address","titleSlug":"defanging-an-ip-address"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1109,"title":"Corporate Flight Bookings","titleSlug":"corporate-flight-bookings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1110,"title":"Delete Nodes And Return Forest","titleSlug":"delete-nodes-and-return-forest"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1111,"title":"Maximum Nesting Depth of Two Valid Parentheses Strings","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1112,"title":"Highest Grade For Each Student","titleSlug":"highest-grade-for-each-student"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1113,"title":"Reported Posts","titleSlug":"reported-posts"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1114,"title":"Print in Order","titleSlug":"print-in-order"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1115,"title":"Print FooBar Alternately","titleSlug":"print-foobar-alternately"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1116,"title":"Print Zero Even Odd","titleSlug":"print-zero-even-odd"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1117,"title":"Building H2O","titleSlug":"building-h2o"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1118,"title":"Number of Days in a Month","titleSlug":"number-of-days-in-a-month"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1119,"title":"Remove Vowels from a String","titleSlug":"remove-vowels-from-a-string"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1120,"title":"Maximum Average Subtree","titleSlug":"maximum-average-subtree"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1121,"title":"Divide Array Into Increasing Sequences","titleSlug":"divide-array-into-increasing-sequences"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1122,"title":"Relative Sort Array","titleSlug":"relative-sort-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1123,"title":"Lowest Common Ancestor of Deepest Leaves","titleSlug":"lowest-common-ancestor-of-deepest-leaves"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1124,"title":"Longest Well-Performing Interval","titleSlug":"longest-well-performing-interval"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1125,"title":"Smallest Sufficient Team","titleSlug":"smallest-sufficient-team"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1126,"title":"Active Businesses","titleSlug":"active-businesses"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1127,"title":"User Purchase Platform","titleSlug":"user-purchase-platform"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1128,"title":"Number of Equivalent Domino Pairs","titleSlug":"number-of-equivalent-domino-pairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1129,"title":"Shortest Path with Alternating Colors","titleSlug":"shortest-path-with-alternating-colors"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1130,"title":"Minimum Cost Tree From Leaf Values","titleSlug":"minimum-cost-tree-from-leaf-values"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1131,"title":"Maximum of Absolute Value Expression","titleSlug":"maximum-of-absolute-value-expression"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1132,"title":"Reported Posts II","titleSlug":"reported-posts-ii"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1133,"title":"Largest Unique Number","titleSlug":"largest-unique-number"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1134,"title":"Armstrong Number","titleSlug":"armstrong-number"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1135,"title":"Connecting Cities With Minimum Cost","titleSlug":"connecting-cities-with-minimum-cost"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1136,"title":"Parallel Courses","titleSlug":"parallel-courses"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1137,"title":"N-th Tribonacci Number","titleSlug":"n-th-tribonacci-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1138,"title":"Alphabet Board Path","titleSlug":"alphabet-board-path"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1139,"title":"Largest 1-Bordered Square","titleSlug":"largest-1-bordered-square"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1140,"title":"Stone Game II","titleSlug":"stone-game-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1141,"title":"User Activity for the Past 30 Days I","titleSlug":"user-activity-for-the-past-30-days-i"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1142,"title":"User Activity for the Past 30 Days II","titleSlug":"user-activity-for-the-past-30-days-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1143,"title":"Longest Common Subsequence","titleSlug":"longest-common-subsequence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1144,"title":"Decrease Elements To Make Array Zigzag","titleSlug":"decrease-elements-to-make-array-zigzag"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1145,"title":"Binary Tree Coloring Game","titleSlug":"binary-tree-coloring-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1146,"title":"Snapshot Array","titleSlug":"snapshot-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1147,"title":"Longest Chunked Palindrome Decomposition","titleSlug":"longest-chunked-palindrome-decomposition"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1148,"title":"Article Views I","titleSlug":"article-views-i"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1149,"title":"Article Views II","titleSlug":"article-views-ii"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1150,"title":"Check If a Number Is Majority Element in a Sorted Array","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1151,"title":"Minimum Swaps to Group All 1's Together","titleSlug":"minimum-swaps-to-group-all-1s-together"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1152,"title":"Analyze User Website Visit Pattern","titleSlug":"analyze-user-website-visit-pattern"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1153,"title":"String Transforms Into Another String","titleSlug":"string-transforms-into-another-string"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1154,"title":"Day of the Year","titleSlug":"day-of-the-year"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1155,"title":"Number of Dice Rolls With Target Sum","titleSlug":"number-of-dice-rolls-with-target-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1156,"title":"Swap For Longest Repeated Character Substring","titleSlug":"swap-for-longest-repeated-character-substring"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1157,"title":"Online Majority Element In Subarray","titleSlug":"online-majority-element-in-subarray"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1158,"title":"Market Analysis I","titleSlug":"market-analysis-i"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1159,"title":"Market Analysis II","titleSlug":"market-analysis-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1160,"title":"Find Words That Can Be Formed by Characters","titleSlug":"find-words-that-can-be-formed-by-characters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1161,"title":"Maximum Level Sum of a Binary Tree","titleSlug":"maximum-level-sum-of-a-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1162,"title":"As Far from Land as Possible","titleSlug":"as-far-from-land-as-possible"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1163,"title":"Last Substring in Lexicographical Order","titleSlug":"last-substring-in-lexicographical-order"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1164,"title":"Product Price at a Given Date","titleSlug":"product-price-at-a-given-date"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1165,"title":"Single-Row Keyboard","titleSlug":"single-row-keyboard"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1166,"title":"Design File System","titleSlug":"design-file-system"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1167,"title":"Minimum Cost to Connect Sticks","titleSlug":"minimum-cost-to-connect-sticks"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1168,"title":"Optimize Water Distribution in a Village","titleSlug":"optimize-water-distribution-in-a-village"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1169,"title":"Invalid Transactions","titleSlug":"invalid-transactions"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1170,"title":"Compare Strings by Frequency of the Smallest Character","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1171,"title":"Remove Zero Sum Consecutive Nodes from Linked List","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1172,"title":"Dinner Plate Stacks","titleSlug":"dinner-plate-stacks"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1173,"title":"Immediate Food Delivery I","titleSlug":"immediate-food-delivery-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1174,"title":"Immediate Food Delivery II","titleSlug":"immediate-food-delivery-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1175,"title":"Prime Arrangements","titleSlug":"prime-arrangements"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1176,"title":"Diet Plan Performance","titleSlug":"diet-plan-performance"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1177,"title":"Can Make Palindrome from Substring","titleSlug":"can-make-palindrome-from-substring"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1178,"title":"Number of Valid Words for Each Puzzle","titleSlug":"number-of-valid-words-for-each-puzzle"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1179,"title":"Reformat Department Table","titleSlug":"reformat-department-table"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1180,"title":"Count Substrings with Only One Distinct Letter","titleSlug":"count-substrings-with-only-one-distinct-letter"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1181,"title":"Before and After Puzzle","titleSlug":"before-and-after-puzzle"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1182,"title":"Shortest Distance to Target Color","titleSlug":"shortest-distance-to-target-color"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1183,"title":"Maximum Number of Ones","titleSlug":"maximum-number-of-ones"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1184,"title":"Distance Between Bus Stops","titleSlug":"distance-between-bus-stops"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1185,"title":"Day of the Week","titleSlug":"day-of-the-week"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1186,"title":"Maximum Subarray Sum with One Deletion","titleSlug":"maximum-subarray-sum-with-one-deletion"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1187,"title":"Make Array Strictly Increasing","titleSlug":"make-array-strictly-increasing"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1188,"title":"Design Bounded Blocking Queue","titleSlug":"design-bounded-blocking-queue"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1189,"title":"Maximum Number of Balloons","titleSlug":"maximum-number-of-balloons"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1190,"title":"Reverse Substrings Between Each Pair of Parentheses","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1191,"title":"K-Concatenation Maximum Sum","titleSlug":"k-concatenation-maximum-sum"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1192,"title":"Critical Connections in a Network","titleSlug":"critical-connections-in-a-network"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1193,"title":"Monthly Transactions I","titleSlug":"monthly-transactions-i"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1194,"title":"Tournament Winners","titleSlug":"tournament-winners"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1195,"title":"Fizz Buzz Multithreaded","titleSlug":"fizz-buzz-multithreaded"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1196,"title":"How Many Apples Can You Put into the Basket","titleSlug":"how-many-apples-can-you-put-into-the-basket"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1197,"title":"Minimum Knight Moves","titleSlug":"minimum-knight-moves"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1198,"title":"Find Smallest Common Element in All Rows","titleSlug":"find-smallest-common-element-in-all-rows"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1199,"title":"Minimum Time to Build Blocks","titleSlug":"minimum-time-to-build-blocks"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1200,"title":"Minimum Absolute Difference","titleSlug":"minimum-absolute-difference"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1201,"title":"Ugly Number III","titleSlug":"ugly-number-iii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1202,"title":"Smallest String With Swaps","titleSlug":"smallest-string-with-swaps"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1203,"title":"Sort Items by Groups Respecting Dependencies","titleSlug":"sort-items-by-groups-respecting-dependencies"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1204,"title":"Last Person to Fit in the Bus","titleSlug":"last-person-to-fit-in-the-bus"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1205,"title":"Monthly Transactions II","titleSlug":"monthly-transactions-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1206,"title":"Design Skiplist","titleSlug":"design-skiplist"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1207,"title":"Unique Number of Occurrences","titleSlug":"unique-number-of-occurrences"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1208,"title":"Get Equal Substrings Within Budget","titleSlug":"get-equal-substrings-within-budget"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1209,"title":"Remove All Adjacent Duplicates in String II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1210,"title":"Minimum Moves to Reach Target with Rotations","titleSlug":"minimum-moves-to-reach-target-with-rotations"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1211,"title":"Queries Quality and Percentage","titleSlug":"queries-quality-and-percentage"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1212,"title":"Team Scores in Football Tournament","titleSlug":"team-scores-in-football-tournament"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1213,"title":"Intersection of Three Sorted Arrays","titleSlug":"intersection-of-three-sorted-arrays"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1214,"title":"Two Sum BSTs","titleSlug":"two-sum-bsts"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1215,"title":"Stepping Numbers","titleSlug":"stepping-numbers"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1216,"title":"Valid Palindrome III","titleSlug":"valid-palindrome-iii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1217,"title":"Minimum Cost to Move Chips to The Same Position","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1218,"title":"Longest Arithmetic Subsequence of Given Difference","titleSlug":"longest-arithmetic-subsequence-of-given-difference"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1219,"title":"Path with Maximum Gold","titleSlug":"path-with-maximum-gold"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1220,"title":"Count Vowels Permutation","titleSlug":"count-vowels-permutation"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1221,"title":"Split a String in Balanced Strings","titleSlug":"split-a-string-in-balanced-strings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1222,"title":"Queens That Can Attack the King","titleSlug":"queens-that-can-attack-the-king"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1223,"title":"Dice Roll Simulation","titleSlug":"dice-roll-simulation"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1224,"title":"Maximum Equal Frequency","titleSlug":"maximum-equal-frequency"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1225,"title":"Report Contiguous Dates","titleSlug":"report-contiguous-dates"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1226,"title":"The Dining Philosophers","titleSlug":"the-dining-philosophers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1227,"title":"Airplane Seat Assignment Probability","titleSlug":"airplane-seat-assignment-probability"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1228,"title":"Missing Number In Arithmetic Progression","titleSlug":"missing-number-in-arithmetic-progression"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1229,"title":"Meeting Scheduler","titleSlug":"meeting-scheduler"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1230,"title":"Toss Strange Coins","titleSlug":"toss-strange-coins"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1231,"title":"Divide Chocolate","titleSlug":"divide-chocolate"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1232,"title":"Check If It Is a Straight Line","titleSlug":"check-if-it-is-a-straight-line"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1233,"title":"Remove Sub-Folders from the Filesystem","titleSlug":"remove-sub-folders-from-the-filesystem"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1234,"title":"Replace the Substring for Balanced String","titleSlug":"replace-the-substring-for-balanced-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1235,"title":"Maximum Profit in Job Scheduling","titleSlug":"maximum-profit-in-job-scheduling"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1236,"title":"Web Crawler","titleSlug":"web-crawler"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1237,"title":"Find Positive Integer Solution for a Given Equation","titleSlug":"find-positive-integer-solution-for-a-given-equation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1238,"title":"Circular Permutation in Binary Representation","titleSlug":"circular-permutation-in-binary-representation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1239,"title":"Maximum Length of a Concatenated String with Unique Characters","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1240,"title":"Tiling a Rectangle with the Fewest Squares","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1241,"title":"Number of Comments per Post","titleSlug":"number-of-comments-per-post"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1242,"title":"Web Crawler Multithreaded","titleSlug":"web-crawler-multithreaded"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1243,"title":"Array Transformation","titleSlug":"array-transformation"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1244,"title":"Design A Leaderboard","titleSlug":"design-a-leaderboard"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1245,"title":"Tree Diameter","titleSlug":"tree-diameter"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1246,"title":"Palindrome Removal","titleSlug":"palindrome-removal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1247,"title":"Minimum Swaps to Make Strings Equal","titleSlug":"minimum-swaps-to-make-strings-equal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1248,"title":"Count Number of Nice Subarrays","titleSlug":"count-number-of-nice-subarrays"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1249,"title":"Minimum Remove to Make Valid Parentheses","titleSlug":"minimum-remove-to-make-valid-parentheses"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1250,"title":"Check If It Is a Good Array","titleSlug":"check-if-it-is-a-good-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1251,"title":"Average Selling Price","titleSlug":"average-selling-price"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1252,"title":"Cells with Odd Values in a Matrix","titleSlug":"cells-with-odd-values-in-a-matrix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1253,"title":"Reconstruct a 2-Row Binary Matrix","titleSlug":"reconstruct-a-2-row-binary-matrix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1254,"title":"Number of Closed Islands","titleSlug":"number-of-closed-islands"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1255,"title":"Maximum Score Words Formed by Letters","titleSlug":"maximum-score-words-formed-by-letters"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1256,"title":"Encode Number","titleSlug":"encode-number"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1257,"title":"Smallest Common Region","titleSlug":"smallest-common-region"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1258,"title":"Synonymous Sentences","titleSlug":"synonymous-sentences"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1259,"title":"Handshakes That Don't Cross","titleSlug":"handshakes-that-dont-cross"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1260,"title":"Shift 2D Grid","titleSlug":"shift-2d-grid"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1261,"title":"Find Elements in a Contaminated Binary Tree","titleSlug":"find-elements-in-a-contaminated-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1262,"title":"Greatest Sum Divisible by Three","titleSlug":"greatest-sum-divisible-by-three"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1263,"title":"Minimum Moves to Move a Box to Their Target Location","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1264,"title":"Page Recommendations","titleSlug":"page-recommendations"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1265,"title":"Print Immutable Linked List in Reverse","titleSlug":"print-immutable-linked-list-in-reverse"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1266,"title":"Minimum Time Visiting All Points","titleSlug":"minimum-time-visiting-all-points"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1267,"title":"Count Servers that Communicate","titleSlug":"count-servers-that-communicate"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1268,"title":"Search Suggestions System","titleSlug":"search-suggestions-system"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1269,"title":"Number of Ways to Stay in the Same Place After Some Steps","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1270,"title":"All People Report to the Given Manager","titleSlug":"all-people-report-to-the-given-manager"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1271,"title":"Hexspeak","titleSlug":"hexspeak"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1272,"title":"Remove Interval","titleSlug":"remove-interval"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1273,"title":"Delete Tree Nodes","titleSlug":"delete-tree-nodes"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1274,"title":"Number of Ships in a Rectangle","titleSlug":"number-of-ships-in-a-rectangle"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1275,"title":"Find Winner on a Tic Tac Toe Game","titleSlug":"find-winner-on-a-tic-tac-toe-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1276,"title":"Number of Burgers with No Waste of Ingredients","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1277,"title":"Count Square Submatrices with All Ones","titleSlug":"count-square-submatrices-with-all-ones"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1278,"title":"Palindrome Partitioning III","titleSlug":"palindrome-partitioning-iii"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1279,"title":"Traffic Light Controlled Intersection","titleSlug":"traffic-light-controlled-intersection"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1280,"title":"Students and Examinations","titleSlug":"students-and-examinations"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1281,"title":"Subtract the Product and Sum of Digits of an Integer","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1282,"title":"Group the People Given the Group Size They Belong To","titleSlug":"group-the-people-given-the-group-size-they-belong-to"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1283,"title":"Find the Smallest Divisor Given a Threshold","titleSlug":"find-the-smallest-divisor-given-a-threshold"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1284,"title":"Minimum Number of Flips to Convert Binary Matrix to Zero Matrix","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1285,"title":"Find the Start and End Number of Continuous Ranges","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1286,"title":"Iterator for Combination","titleSlug":"iterator-for-combination"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1287,"title":"Element Appearing More Than 25% In Sorted Array","titleSlug":"element-appearing-more-than-25-in-sorted-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1288,"title":"Remove Covered Intervals","titleSlug":"remove-covered-intervals"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1289,"title":"Minimum Falling Path Sum II","titleSlug":"minimum-falling-path-sum-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1290,"title":"Convert Binary Number in a Linked List to Integer","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1291,"title":"Sequential Digits","titleSlug":"sequential-digits"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1292,"title":"Maximum Side Length of a Square with Sum Less than or Equal to Threshold","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1293,"title":"Shortest Path in a Grid with Obstacles Elimination","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1294,"title":"Weather Type in Each Country","titleSlug":"weather-type-in-each-country"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1295,"title":"Find Numbers with Even Number of Digits","titleSlug":"find-numbers-with-even-number-of-digits"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1296,"title":"Divide Array in Sets of K Consecutive Numbers","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1297,"title":"Maximum Number of Occurrences of a Substring","titleSlug":"maximum-number-of-occurrences-of-a-substring"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1298,"title":"Maximum Candies You Can Get from Boxes","titleSlug":"maximum-candies-you-can-get-from-boxes"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1299,"title":"Replace Elements with Greatest Element on Right Side","titleSlug":"replace-elements-with-greatest-element-on-right-side"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1300,"title":"Sum of Mutated Array Closest to Target","titleSlug":"sum-of-mutated-array-closest-to-target"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1301,"title":"Number of Paths with Max Score","titleSlug":"number-of-paths-with-max-score"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1302,"title":"Deepest Leaves Sum","titleSlug":"deepest-leaves-sum"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1303,"title":"Find the Team Size","titleSlug":"find-the-team-size"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1304,"title":"Find N Unique Integers Sum up to Zero","titleSlug":"find-n-unique-integers-sum-up-to-zero"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1305,"title":"All Elements in Two Binary Search Trees","titleSlug":"all-elements-in-two-binary-search-trees"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1306,"title":"Jump Game III","titleSlug":"jump-game-iii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1307,"title":"Verbal Arithmetic Puzzle","titleSlug":"verbal-arithmetic-puzzle"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1308,"title":"Running Total for Different Genders","titleSlug":"running-total-for-different-genders"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1309,"title":"Decrypt String from Alphabet to Integer Mapping","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1310,"title":"XOR Queries of a Subarray","titleSlug":"xor-queries-of-a-subarray"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1311,"title":"Get Watched Videos by Your Friends","titleSlug":"get-watched-videos-by-your-friends"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1312,"title":"Minimum Insertion Steps to Make a String Palindrome","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1313,"title":"Decompress Run-Length Encoded List","titleSlug":"decompress-run-length-encoded-list"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1314,"title":"Matrix Block Sum","titleSlug":"matrix-block-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1315,"title":"Sum of Nodes with Even-Valued Grandparent","titleSlug":"sum-of-nodes-with-even-valued-grandparent"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1316,"title":"Distinct Echo Substrings","titleSlug":"distinct-echo-substrings"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1317,"title":"Convert Integer to the Sum of Two No-Zero Integers","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1318,"title":"Minimum Flips to Make a OR b Equal to c","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1319,"title":"Number of Operations to Make Network Connected","titleSlug":"number-of-operations-to-make-network-connected"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1320,"title":"Minimum Distance to Type a Word Using Two Fingers","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1321,"title":"Restaurant Growth","titleSlug":"restaurant-growth"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1322,"title":"Ads Performance","titleSlug":"ads-performance"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1323,"title":"Maximum 69 Number","titleSlug":"maximum-69-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1324,"title":"Print Words Vertically","titleSlug":"print-words-vertically"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1325,"title":"Delete Leaves With a Given Value","titleSlug":"delete-leaves-with-a-given-value"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1326,"title":"Minimum Number of Taps to Open to Water a Garden","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1327,"title":"List the Products Ordered in a Period","titleSlug":"list-the-products-ordered-in-a-period"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1328,"title":"Break a Palindrome","titleSlug":"break-a-palindrome"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1329,"title":"Sort the Matrix Diagonally","titleSlug":"sort-the-matrix-diagonally"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1330,"title":"Reverse Subarray To Maximize Array Value","titleSlug":"reverse-subarray-to-maximize-array-value"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1331,"title":"Rank Transform of an Array","titleSlug":"rank-transform-of-an-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1332,"title":"Remove Palindromic Subsequences","titleSlug":"remove-palindromic-subsequences"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1333,"title":"Filter Restaurants by Vegan-Friendly, Price and Distance","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1334,"title":"Find the City With the Smallest Number of Neighbors at a Threshold Distance","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1335,"title":"Minimum Difficulty of a Job Schedule","titleSlug":"minimum-difficulty-of-a-job-schedule"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1336,"title":"Number of Transactions per Visit","titleSlug":"number-of-transactions-per-visit"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1337,"title":"The K Weakest Rows in a Matrix","titleSlug":"the-k-weakest-rows-in-a-matrix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1338,"title":"Reduce Array Size to The Half","titleSlug":"reduce-array-size-to-the-half"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1339,"title":"Maximum Product of Splitted Binary Tree","titleSlug":"maximum-product-of-splitted-binary-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1340,"title":"Jump Game V","titleSlug":"jump-game-v"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1341,"title":"Movie Rating","titleSlug":"movie-rating"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1342,"title":"Number of Steps to Reduce a Number to Zero","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1343,"title":"Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1344,"title":"Angle Between Hands of a Clock","titleSlug":"angle-between-hands-of-a-clock"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1345,"title":"Jump Game IV","titleSlug":"jump-game-iv"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1346,"title":"Check If N and Its Double Exist","titleSlug":"check-if-n-and-its-double-exist"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1347,"title":"Minimum Number of Steps to Make Two Strings Anagram","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1348,"title":"Tweet Counts Per Frequency","titleSlug":"tweet-counts-per-frequency"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1349,"title":"Maximum Students Taking Exam","titleSlug":"maximum-students-taking-exam"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1350,"title":"Students With Invalid Departments","titleSlug":"students-with-invalid-departments"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1351,"title":"Count Negative Numbers in a Sorted Matrix","titleSlug":"count-negative-numbers-in-a-sorted-matrix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1352,"title":"Product of the Last K Numbers","titleSlug":"product-of-the-last-k-numbers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1353,"title":"Maximum Number of Events That Can Be Attended","titleSlug":"maximum-number-of-events-that-can-be-attended"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1354,"title":"Construct Target Array With Multiple Sums","titleSlug":"construct-target-array-with-multiple-sums"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1355,"title":"Activity Participants","titleSlug":"activity-participants"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1356,"title":"Sort Integers by The Number of 1 Bits","titleSlug":"sort-integers-by-the-number-of-1-bits"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1357,"title":"Apply Discount Every n Orders","titleSlug":"apply-discount-every-n-orders"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1358,"title":"Number of Substrings Containing All Three Characters","titleSlug":"number-of-substrings-containing-all-three-characters"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1359,"title":"Count All Valid Pickup and Delivery Options","titleSlug":"count-all-valid-pickup-and-delivery-options"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1360,"title":"Number of Days Between Two Dates","titleSlug":"number-of-days-between-two-dates"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1361,"title":"Validate Binary Tree Nodes","titleSlug":"validate-binary-tree-nodes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1362,"title":"Closest Divisors","titleSlug":"closest-divisors"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1363,"title":"Largest Multiple of Three","titleSlug":"largest-multiple-of-three"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1364,"title":"Number of Trusted Contacts of a Customer","titleSlug":"number-of-trusted-contacts-of-a-customer"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1365,"title":"How Many Numbers Are Smaller Than the Current Number","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1366,"title":"Rank Teams by Votes","titleSlug":"rank-teams-by-votes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1367,"title":"Linked List in Binary Tree","titleSlug":"linked-list-in-binary-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1368,"title":"Minimum Cost to Make at Least One Valid Path in a Grid","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1369,"title":"Get the Second Most Recent Activity","titleSlug":"get-the-second-most-recent-activity"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1370,"title":"Increasing Decreasing String","titleSlug":"increasing-decreasing-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1371,"title":"Find the Longest Substring Containing Vowels in Even Counts","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1372,"title":"Longest ZigZag Path in a Binary Tree","titleSlug":"longest-zigzag-path-in-a-binary-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1373,"title":"Maximum Sum BST in Binary Tree","titleSlug":"maximum-sum-bst-in-binary-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1374,"title":"Generate a String With Characters That Have Odd Counts","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1375,"title":"Number of Times Binary String Is Prefix-Aligned","titleSlug":"number-of-times-binary-string-is-prefix-aligned"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1376,"title":"Time Needed to Inform All Employees","titleSlug":"time-needed-to-inform-all-employees"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1377,"title":"Frog Position After T Seconds","titleSlug":"frog-position-after-t-seconds"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1378,"title":"Replace Employee ID With The Unique Identifier","titleSlug":"replace-employee-id-with-the-unique-identifier"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1379,"title":"Find a Corresponding Node of a Binary Tree in a Clone of That Tree","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1380,"title":"Lucky Numbers in a Matrix","titleSlug":"lucky-numbers-in-a-matrix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1381,"title":"Design a Stack With Increment Operation","titleSlug":"design-a-stack-with-increment-operation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1382,"title":"Balance a Binary Search Tree","titleSlug":"balance-a-binary-search-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1383,"title":"Maximum Performance of a Team","titleSlug":"maximum-performance-of-a-team"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1384,"title":"Total Sales Amount by Year","titleSlug":"total-sales-amount-by-year"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1385,"title":"Find the Distance Value Between Two Arrays","titleSlug":"find-the-distance-value-between-two-arrays"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1386,"title":"Cinema Seat Allocation","titleSlug":"cinema-seat-allocation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1387,"title":"Sort Integers by The Power Value","titleSlug":"sort-integers-by-the-power-value"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1388,"title":"Pizza With 3n Slices","titleSlug":"pizza-with-3n-slices"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1389,"title":"Create Target Array in the Given Order","titleSlug":"create-target-array-in-the-given-order"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1390,"title":"Four Divisors","titleSlug":"four-divisors"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1391,"title":"Check if There is a Valid Path in a Grid","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1392,"title":"Longest Happy Prefix","titleSlug":"longest-happy-prefix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1393,"title":"Capital Gain/Loss","titleSlug":"capital-gainloss"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1394,"title":"Find Lucky Integer in an Array","titleSlug":"find-lucky-integer-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1395,"title":"Count Number of Teams","titleSlug":"count-number-of-teams"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1396,"title":"Design Underground System","titleSlug":"design-underground-system"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1397,"title":"Find All Good Strings","titleSlug":"find-all-good-strings"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1398,"title":"Customers Who Bought Products A and B but Not C","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1399,"title":"Count Largest Group","titleSlug":"count-largest-group"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1400,"title":"Construct K Palindrome Strings","titleSlug":"construct-k-palindrome-strings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1401,"title":"Circle and Rectangle Overlapping","titleSlug":"circle-and-rectangle-overlapping"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1402,"title":"Reducing Dishes","titleSlug":"reducing-dishes"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1403,"title":"Minimum Subsequence in Non-Increasing Order","titleSlug":"minimum-subsequence-in-non-increasing-order"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1404,"title":"Number of Steps to Reduce a Number in Binary Representation to One","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1405,"title":"Longest Happy String","titleSlug":"longest-happy-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1406,"title":"Stone Game III","titleSlug":"stone-game-iii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1407,"title":"Top Travellers","titleSlug":"top-travellers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1408,"title":"String Matching in an Array","titleSlug":"string-matching-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1409,"title":"Queries on a Permutation With Key","titleSlug":"queries-on-a-permutation-with-key"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1410,"title":"HTML Entity Parser","titleSlug":"html-entity-parser"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1411,"title":"Number of Ways to Paint N × 3 Grid","titleSlug":"number-of-ways-to-paint-n-3-grid"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1412,"title":"Find the Quiet Students in All Exams","titleSlug":"find-the-quiet-students-in-all-exams"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1413,"title":"Minimum Value to Get Positive Step by Step Sum","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1414,"title":"Find the Minimum Number of Fibonacci Numbers Whose Sum Is K","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1415,"title":"The k-th Lexicographical String of All Happy Strings of Length n","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1416,"title":"Restore The Array","titleSlug":"restore-the-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1417,"title":"Reformat The String","titleSlug":"reformat-the-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1418,"title":"Display Table of Food Orders in a Restaurant","titleSlug":"display-table-of-food-orders-in-a-restaurant"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1419,"title":"Minimum Number of Frogs Croaking","titleSlug":"minimum-number-of-frogs-croaking"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1420,"title":"Build Array Where You Can Find The Maximum Exactly K Comparisons","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1421,"title":"NPV Queries","titleSlug":"npv-queries"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1422,"title":"Maximum Score After Splitting a String","titleSlug":"maximum-score-after-splitting-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1423,"title":"Maximum Points You Can Obtain from Cards","titleSlug":"maximum-points-you-can-obtain-from-cards"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1424,"title":"Diagonal Traverse II","titleSlug":"diagonal-traverse-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1425,"title":"Constrained Subsequence Sum","titleSlug":"constrained-subsequence-sum"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1426,"title":"Counting Elements","titleSlug":"counting-elements"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1427,"title":"Perform String Shifts","titleSlug":"perform-string-shifts"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1428,"title":"Leftmost Column with at Least a One","titleSlug":"leftmost-column-with-at-least-a-one"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1429,"title":"First Unique Number","titleSlug":"first-unique-number"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1430,"title":"Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1431,"title":"Kids With the Greatest Number of Candies","titleSlug":"kids-with-the-greatest-number-of-candies"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1432,"title":"Max Difference You Can Get From Changing an Integer","titleSlug":"max-difference-you-can-get-from-changing-an-integer"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1433,"title":"Check If a String Can Break Another String","titleSlug":"check-if-a-string-can-break-another-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1434,"title":"Number of Ways to Wear Different Hats to Each Other","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1435,"title":"Create a Session Bar Chart","titleSlug":"create-a-session-bar-chart"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1436,"title":"Destination City","titleSlug":"destination-city"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1437,"title":"Check If All 1's Are at Least Length K Places Away","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1438,"title":"Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1439,"title":"Find the Kth Smallest Sum of a Matrix With Sorted Rows","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1440,"title":"Evaluate Boolean Expression","titleSlug":"evaluate-boolean-expression"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1441,"title":"Build an Array With Stack Operations","titleSlug":"build-an-array-with-stack-operations"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1442,"title":"Count Triplets That Can Form Two Arrays of Equal XOR","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1443,"title":"Minimum Time to Collect All Apples in a Tree","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1444,"title":"Number of Ways of Cutting a Pizza","titleSlug":"number-of-ways-of-cutting-a-pizza"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1445,"title":"Apples & Oranges","titleSlug":"apples-oranges"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1446,"title":"Consecutive Characters","titleSlug":"consecutive-characters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1447,"title":"Simplified Fractions","titleSlug":"simplified-fractions"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1448,"title":"Count Good Nodes in Binary Tree","titleSlug":"count-good-nodes-in-binary-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1449,"title":"Form Largest Integer With Digits That Add up to Target","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1450,"title":"Number of Students Doing Homework at a Given Time","titleSlug":"number-of-students-doing-homework-at-a-given-time"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1451,"title":"Rearrange Words in a Sentence","titleSlug":"rearrange-words-in-a-sentence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1452,"title":"People Whose List of Favorite Companies Is Not a Subset of Another List","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1453,"title":"Maximum Number of Darts Inside of a Circular Dartboard","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1454,"title":"Active Users","titleSlug":"active-users"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1455,"title":"Check If a Word Occurs As a Prefix of Any Word in a Sentence","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1456,"title":"Maximum Number of Vowels in a Substring of Given Length","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1457,"title":"Pseudo-Palindromic Paths in a Binary Tree","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1458,"title":"Max Dot Product of Two Subsequences","titleSlug":"max-dot-product-of-two-subsequences"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1459,"title":"Rectangles Area","titleSlug":"rectangles-area"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1460,"title":"Make Two Arrays Equal by Reversing Subarrays","titleSlug":"make-two-arrays-equal-by-reversing-subarrays"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1461,"title":"Check If a String Contains All Binary Codes of Size K","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1462,"title":"Course Schedule IV","titleSlug":"course-schedule-iv"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1463,"title":"Cherry Pickup II","titleSlug":"cherry-pickup-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1464,"title":"Maximum Product of Two Elements in an Array","titleSlug":"maximum-product-of-two-elements-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1465,"title":"Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1466,"title":"Reorder Routes to Make All Paths Lead to the City Zero","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1467,"title":"Probability of a Two Boxes Having The Same Number of Distinct Balls","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1468,"title":"Calculate Salaries","titleSlug":"calculate-salaries"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1469,"title":"Find All The Lonely Nodes","titleSlug":"find-all-the-lonely-nodes"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1470,"title":"Shuffle the Array","titleSlug":"shuffle-the-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1471,"title":"The k Strongest Values in an Array","titleSlug":"the-k-strongest-values-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1472,"title":"Design Browser History","titleSlug":"design-browser-history"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1473,"title":"Paint House III","titleSlug":"paint-house-iii"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1474,"title":"Delete N Nodes After M Nodes of a Linked List","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1475,"title":"Final Prices With a Special Discount in a Shop","titleSlug":"final-prices-with-a-special-discount-in-a-shop"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1476,"title":"Subrectangle Queries","titleSlug":"subrectangle-queries"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1477,"title":"Find Two Non-overlapping Sub-arrays Each With Target Sum","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1478,"title":"Allocate Mailboxes","titleSlug":"allocate-mailboxes"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1479,"title":"Sales by Day of the Week","titleSlug":"sales-by-day-of-the-week"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1480,"title":"Running Sum of 1d Array","titleSlug":"running-sum-of-1d-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1481,"title":"Least Number of Unique Integers after K Removals","titleSlug":"least-number-of-unique-integers-after-k-removals"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1482,"title":"Minimum Number of Days to Make m Bouquets","titleSlug":"minimum-number-of-days-to-make-m-bouquets"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1483,"title":"Kth Ancestor of a Tree Node","titleSlug":"kth-ancestor-of-a-tree-node"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1484,"title":"Group Sold Products By The Date","titleSlug":"group-sold-products-by-the-date"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1485,"title":"Clone Binary Tree With Random Pointer","titleSlug":"clone-binary-tree-with-random-pointer"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1486,"title":"XOR Operation in an Array","titleSlug":"xor-operation-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1487,"title":"Making File Names Unique","titleSlug":"making-file-names-unique"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1488,"title":"Avoid Flood in The City","titleSlug":"avoid-flood-in-the-city"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1489,"title":"Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1490,"title":"Clone N-ary Tree","titleSlug":"clone-n-ary-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1491,"title":"Average Salary Excluding the Minimum and Maximum Salary","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1492,"title":"The kth Factor of n","titleSlug":"the-kth-factor-of-n"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1493,"title":"Longest Subarray of 1's After Deleting One Element","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1494,"title":"Parallel Courses II","titleSlug":"parallel-courses-ii"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1495,"title":"Friendly Movies Streamed Last Month","titleSlug":"friendly-movies-streamed-last-month"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1496,"title":"Path Crossing","titleSlug":"path-crossing"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1497,"title":"Check If Array Pairs Are Divisible by k","titleSlug":"check-if-array-pairs-are-divisible-by-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1498,"title":"Number of Subsequences That Satisfy the Given Sum Condition","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1499,"title":"Max Value of Equation","titleSlug":"max-value-of-equation"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1500,"title":"Design a File Sharing System","titleSlug":"design-a-file-sharing-system"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1501,"title":"Countries You Can Safely Invest In","titleSlug":"countries-you-can-safely-invest-in"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1502,"title":"Can Make Arithmetic Progression From Sequence","titleSlug":"can-make-arithmetic-progression-from-sequence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1503,"title":"Last Moment Before All Ants Fall Out of a Plank","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1504,"title":"Count Submatrices With All Ones","titleSlug":"count-submatrices-with-all-ones"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1505,"title":"Minimum Possible Integer After at Most K Adjacent Swaps On Digits","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1506,"title":"Find Root of N-Ary Tree","titleSlug":"find-root-of-n-ary-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1507,"title":"Reformat Date","titleSlug":"reformat-date"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1508,"title":"Range Sum of Sorted Subarray Sums","titleSlug":"range-sum-of-sorted-subarray-sums"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1509,"title":"Minimum Difference Between Largest and Smallest Value in Three Moves","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1510,"title":"Stone Game IV","titleSlug":"stone-game-iv"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1511,"title":"Customer Order Frequency","titleSlug":"customer-order-frequency"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1512,"title":"Number of Good Pairs","titleSlug":"number-of-good-pairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1513,"title":"Number of Substrings With Only 1s","titleSlug":"number-of-substrings-with-only-1s"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1514,"title":"Path with Maximum Probability","titleSlug":"path-with-maximum-probability"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1515,"title":"Best Position for a Service Centre","titleSlug":"best-position-for-a-service-centre"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1516,"title":"Move Sub-Tree of N-Ary Tree","titleSlug":"move-sub-tree-of-n-ary-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1517,"title":"Find Users With Valid E-Mails","titleSlug":"find-users-with-valid-e-mails"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1518,"title":"Water Bottles","titleSlug":"water-bottles"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1519,"title":"Number of Nodes in the Sub-Tree With the Same Label","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1520,"title":"Maximum Number of Non-Overlapping Substrings","titleSlug":"maximum-number-of-non-overlapping-substrings"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1521,"title":"Find a Value of a Mysterious Function Closest to Target","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1522,"title":"Diameter of N-Ary Tree","titleSlug":"diameter-of-n-ary-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1523,"title":"Count Odd Numbers in an Interval Range","titleSlug":"count-odd-numbers-in-an-interval-range"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1524,"title":"Number of Sub-arrays With Odd Sum","titleSlug":"number-of-sub-arrays-with-odd-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1525,"title":"Number of Good Ways to Split a String","titleSlug":"number-of-good-ways-to-split-a-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1526,"title":"Minimum Number of Increments on Subarrays to Form a Target Array","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1527,"title":"Patients With a Condition","titleSlug":"patients-with-a-condition"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1528,"title":"Shuffle String","titleSlug":"shuffle-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1529,"title":"Minimum Suffix Flips","titleSlug":"minimum-suffix-flips"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1530,"title":"Number of Good Leaf Nodes Pairs","titleSlug":"number-of-good-leaf-nodes-pairs"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1531,"title":"String Compression II","titleSlug":"string-compression-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1532,"title":"The Most Recent Three Orders","titleSlug":"the-most-recent-three-orders"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1533,"title":"Find the Index of the Large Integer","titleSlug":"find-the-index-of-the-large-integer"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1534,"title":"Count Good Triplets","titleSlug":"count-good-triplets"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1535,"title":"Find the Winner of an Array Game","titleSlug":"find-the-winner-of-an-array-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1536,"title":"Minimum Swaps to Arrange a Binary Grid","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1537,"title":"Get the Maximum Score","titleSlug":"get-the-maximum-score"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1538,"title":"Guess the Majority in a Hidden Array","titleSlug":"guess-the-majority-in-a-hidden-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1539,"title":"Kth Missing Positive Number","titleSlug":"kth-missing-positive-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1540,"title":"Can Convert String in K Moves","titleSlug":"can-convert-string-in-k-moves"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1541,"title":"Minimum Insertions to Balance a Parentheses String","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1542,"title":"Find Longest Awesome Substring","titleSlug":"find-longest-awesome-substring"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1543,"title":"Fix Product Name Format","titleSlug":"fix-product-name-format"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1544,"title":"Make The String Great","titleSlug":"make-the-string-great"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1545,"title":"Find Kth Bit in Nth Binary String","titleSlug":"find-kth-bit-in-nth-binary-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1546,"title":"Maximum Number of Non-Overlapping Subarrays With Sum Equals Target","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1547,"title":"Minimum Cost to Cut a Stick","titleSlug":"minimum-cost-to-cut-a-stick"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1548,"title":"The Most Similar Path in a Graph","titleSlug":"the-most-similar-path-in-a-graph"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1549,"title":"The Most Recent Orders for Each Product","titleSlug":"the-most-recent-orders-for-each-product"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1550,"title":"Three Consecutive Odds","titleSlug":"three-consecutive-odds"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1551,"title":"Minimum Operations to Make Array Equal","titleSlug":"minimum-operations-to-make-array-equal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1552,"title":"Magnetic Force Between Two Balls","titleSlug":"magnetic-force-between-two-balls"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1553,"title":"Minimum Number of Days to Eat N Oranges","titleSlug":"minimum-number-of-days-to-eat-n-oranges"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1554,"title":"Strings Differ by One Character","titleSlug":"strings-differ-by-one-character"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1555,"title":"Bank Account Summary","titleSlug":"bank-account-summary"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1556,"title":"Thousand Separator","titleSlug":"thousand-separator"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1557,"title":"Minimum Number of Vertices to Reach All Nodes","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1558,"title":"Minimum Numbers of Function Calls to Make Target Array","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1559,"title":"Detect Cycles in 2D Grid","titleSlug":"detect-cycles-in-2d-grid"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1560,"title":"Most Visited Sector in  a Circular Track","titleSlug":"most-visited-sector-in-a-circular-track"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1561,"title":"Maximum Number of Coins You Can Get","titleSlug":"maximum-number-of-coins-you-can-get"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1562,"title":"Find Latest Group of Size M","titleSlug":"find-latest-group-of-size-m"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1563,"title":"Stone Game V","titleSlug":"stone-game-v"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1564,"title":"Put Boxes Into the Warehouse I","titleSlug":"put-boxes-into-the-warehouse-i"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1565,"title":"Unique Orders and Customers Per Month","titleSlug":"unique-orders-and-customers-per-month"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1566,"title":"Detect Pattern of Length M Repeated K or More Times","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1567,"title":"Maximum Length of Subarray With Positive Product","titleSlug":"maximum-length-of-subarray-with-positive-product"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1568,"title":"Minimum Number of Days to Disconnect Island","titleSlug":"minimum-number-of-days-to-disconnect-island"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1569,"title":"Number of Ways to Reorder Array to Get Same BST","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1570,"title":"Dot Product of Two Sparse Vectors","titleSlug":"dot-product-of-two-sparse-vectors"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1571,"title":"Warehouse Manager","titleSlug":"warehouse-manager"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1572,"title":"Matrix Diagonal Sum","titleSlug":"matrix-diagonal-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1573,"title":"Number of Ways to Split a String","titleSlug":"number-of-ways-to-split-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1574,"title":"Shortest Subarray to be Removed to Make Array Sorted","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1575,"title":"Count All Possible Routes","titleSlug":"count-all-possible-routes"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1576,"title":"Replace All ?'s to Avoid Consecutive Repeating Characters","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1577,"title":"Number of Ways Where Square of Number Is Equal to Product of Two Numbers","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1578,"title":"Minimum Time to Make Rope Colorful","titleSlug":"minimum-time-to-make-rope-colorful"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1579,"title":"Remove Max Number of Edges to Keep Graph Fully Traversable","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1580,"title":"Put Boxes Into the Warehouse II","titleSlug":"put-boxes-into-the-warehouse-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1581,"title":"Customer Who Visited but Did Not Make Any Transactions","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1582,"title":"Special Positions in a Binary Matrix","titleSlug":"special-positions-in-a-binary-matrix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1583,"title":"Count Unhappy Friends","titleSlug":"count-unhappy-friends"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1584,"title":"Min Cost to Connect All Points","titleSlug":"min-cost-to-connect-all-points"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1585,"title":"Check If String Is Transformable With Substring Sort Operations","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1586,"title":"Binary Search Tree Iterator II","titleSlug":"binary-search-tree-iterator-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1587,"title":"Bank Account Summary II","titleSlug":"bank-account-summary-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1588,"title":"Sum of All Odd Length Subarrays","titleSlug":"sum-of-all-odd-length-subarrays"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1589,"title":"Maximum Sum Obtained of Any Permutation","titleSlug":"maximum-sum-obtained-of-any-permutation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1590,"title":"Make Sum Divisible by P","titleSlug":"make-sum-divisible-by-p"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1591,"title":"Strange Printer II","titleSlug":"strange-printer-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1592,"title":"Rearrange Spaces Between Words","titleSlug":"rearrange-spaces-between-words"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1593,"title":"Split a String Into the Max Number of Unique Substrings","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1594,"title":"Maximum Non Negative Product in a Matrix","titleSlug":"maximum-non-negative-product-in-a-matrix"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1595,"title":"Minimum Cost to Connect Two Groups of Points","titleSlug":"minimum-cost-to-connect-two-groups-of-points"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1596,"title":"The Most Frequently Ordered Products for Each Customer","titleSlug":"the-most-frequently-ordered-products-for-each-customer"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1597,"title":"Build Binary Expression Tree From Infix Expression","titleSlug":"build-binary-expression-tree-from-infix-expression"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1598,"title":"Crawler Log Folder","titleSlug":"crawler-log-folder"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1599,"title":"Maximum Profit of Operating a Centennial Wheel","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1600,"title":"Throne Inheritance","titleSlug":"throne-inheritance"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1601,"title":"Maximum Number of Achievable Transfer Requests","titleSlug":"maximum-number-of-achievable-transfer-requests"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1602,"title":"Find Nearest Right Node in Binary Tree","titleSlug":"find-nearest-right-node-in-binary-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1603,"title":"Design Parking System","titleSlug":"design-parking-system"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1604,"title":"Alert Using Same Key-Card Three or More Times in a One Hour Period","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1605,"title":"Find Valid Matrix Given Row and Column Sums","titleSlug":"find-valid-matrix-given-row-and-column-sums"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1606,"title":"Find Servers That Handled Most Number of Requests","titleSlug":"find-servers-that-handled-most-number-of-requests"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1607,"title":"Sellers With No Sales","titleSlug":"sellers-with-no-sales"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1608,"title":"Special Array With X Elements Greater Than or Equal X","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1609,"title":"Even Odd Tree","titleSlug":"even-odd-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1610,"title":"Maximum Number of Visible Points","titleSlug":"maximum-number-of-visible-points"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1611,"title":"Minimum One Bit Operations to Make Integers Zero","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1612,"title":"Check If Two Expression Trees are Equivalent","titleSlug":"check-if-two-expression-trees-are-equivalent"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1613,"title":"Find the Missing IDs","titleSlug":"find-the-missing-ids"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1614,"title":"Maximum Nesting Depth of the Parentheses","titleSlug":"maximum-nesting-depth-of-the-parentheses"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1615,"title":"Maximal Network Rank","titleSlug":"maximal-network-rank"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1616,"title":"Split Two Strings to Make Palindrome","titleSlug":"split-two-strings-to-make-palindrome"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1617,"title":"Count Subtrees With Max Distance Between Cities","titleSlug":"count-subtrees-with-max-distance-between-cities"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1618,"title":"Maximum Font to Fit a Sentence in a Screen","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1619,"title":"Mean of Array After Removing Some Elements","titleSlug":"mean-of-array-after-removing-some-elements"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1620,"title":"Coordinate With Maximum Network Quality","titleSlug":"coordinate-with-maximum-network-quality"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1621,"title":"Number of Sets of K Non-Overlapping Line Segments","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1622,"title":"Fancy Sequence","titleSlug":"fancy-sequence"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1623,"title":"All Valid Triplets That Can Represent a Country","titleSlug":"all-valid-triplets-that-can-represent-a-country"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1624,"title":"Largest Substring Between Two Equal Characters","titleSlug":"largest-substring-between-two-equal-characters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1625,"title":"Lexicographically Smallest String After Applying Operations","titleSlug":"lexicographically-smallest-string-after-applying-operations"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1626,"title":"Best Team With No Conflicts","titleSlug":"best-team-with-no-conflicts"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1627,"title":"Graph Connectivity With Threshold","titleSlug":"graph-connectivity-with-threshold"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1628,"title":"Design an Expression Tree With Evaluate Function","titleSlug":"design-an-expression-tree-with-evaluate-function"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1629,"title":"Slowest Key","titleSlug":"slowest-key"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1630,"title":"Arithmetic Subarrays","titleSlug":"arithmetic-subarrays"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1631,"title":"Path With Minimum Effort","titleSlug":"path-with-minimum-effort"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1632,"title":"Rank Transform of a Matrix","titleSlug":"rank-transform-of-a-matrix"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1633,"title":"Percentage of Users Attended a Contest","titleSlug":"percentage-of-users-attended-a-contest"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1634,"title":"Add Two Polynomials Represented as Linked Lists","titleSlug":"add-two-polynomials-represented-as-linked-lists"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1635,"title":"Hopper Company Queries I","titleSlug":"hopper-company-queries-i"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1636,"title":"Sort Array by Increasing Frequency","titleSlug":"sort-array-by-increasing-frequency"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1637,"title":"Widest Vertical Area Between Two Points Containing No Points","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1638,"title":"Count Substrings That Differ by One Character","titleSlug":"count-substrings-that-differ-by-one-character"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1639,"title":"Number of Ways to Form a Target String Given a Dictionary","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1640,"title":"Check Array Formation Through Concatenation","titleSlug":"check-array-formation-through-concatenation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1641,"title":"Count Sorted Vowel Strings","titleSlug":"count-sorted-vowel-strings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1642,"title":"Furthest Building You Can Reach","titleSlug":"furthest-building-you-can-reach"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1643,"title":"Kth Smallest Instructions","titleSlug":"kth-smallest-instructions"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1644,"title":"Lowest Common Ancestor of a Binary Tree II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1645,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1646,"title":"Get Maximum in Generated Array","titleSlug":"get-maximum-in-generated-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1647,"title":"Minimum Deletions to Make Character Frequencies Unique","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1648,"title":"Sell Diminishing-Valued Colored Balls","titleSlug":"sell-diminishing-valued-colored-balls"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1649,"title":"Create Sorted Array through Instructions","titleSlug":"create-sorted-array-through-instructions"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1650,"title":"Lowest Common Ancestor of a Binary Tree III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1651,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1652,"title":"Defuse the Bomb","titleSlug":"defuse-the-bomb"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1653,"title":"Minimum Deletions to Make String Balanced","titleSlug":"minimum-deletions-to-make-string-balanced"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1654,"title":"Minimum Jumps to Reach Home","titleSlug":"minimum-jumps-to-reach-home"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1655,"title":"Distribute Repeating Integers","titleSlug":"distribute-repeating-integers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1656,"title":"Design an Ordered Stream","titleSlug":"design-an-ordered-stream"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1657,"title":"Determine if Two Strings Are Close","titleSlug":"determine-if-two-strings-are-close"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1658,"title":"Minimum Operations to Reduce X to Zero","titleSlug":"minimum-operations-to-reduce-x-to-zero"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1659,"title":"Maximize Grid Happiness","titleSlug":"maximize-grid-happiness"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1660,"title":"Correct a Binary Tree","titleSlug":"correct-a-binary-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1661,"title":"Average Time of Process per Machine","titleSlug":"average-time-of-process-per-machine"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1662,"title":"Check If Two String Arrays are Equivalent","titleSlug":"check-if-two-string-arrays-are-equivalent"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1663,"title":"Smallest String With A Given Numeric Value","titleSlug":"smallest-string-with-a-given-numeric-value"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1664,"title":"Ways to Make a Fair Array","titleSlug":"ways-to-make-a-fair-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1665,"title":"Minimum Initial Energy to Finish Tasks","titleSlug":"minimum-initial-energy-to-finish-tasks"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1666,"title":"Change the Root of a Binary Tree","titleSlug":"change-the-root-of-a-binary-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1667,"title":"Fix Names in a Table","titleSlug":"fix-names-in-a-table"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1668,"title":"Maximum Repeating Substring","titleSlug":"maximum-repeating-substring"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1669,"title":"Merge In Between Linked Lists","titleSlug":"merge-in-between-linked-lists"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1670,"title":"Design Front Middle Back Queue","titleSlug":"design-front-middle-back-queue"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1671,"title":"Minimum Number of Removals to Make Mountain Array","titleSlug":"minimum-number-of-removals-to-make-mountain-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1672,"title":"Richest Customer Wealth","titleSlug":"richest-customer-wealth"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1673,"title":"Find the Most Competitive Subsequence","titleSlug":"find-the-most-competitive-subsequence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1674,"title":"Minimum Moves to Make Array Complementary","titleSlug":"minimum-moves-to-make-array-complementary"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1675,"title":"Minimize Deviation in Array","titleSlug":"minimize-deviation-in-array"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1676,"title":"Lowest Common Ancestor of a Binary Tree IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1677,"title":"Product's Worth Over Invoices","titleSlug":"products-worth-over-invoices"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1678,"title":"Goal Parser Interpretation","titleSlug":"goal-parser-interpretation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1679,"title":"Max Number of K-Sum Pairs","titleSlug":"max-number-of-k-sum-pairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1680,"title":"Concatenation of Consecutive Binary Numbers","titleSlug":"concatenation-of-consecutive-binary-numbers"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1681,"title":"Minimum Incompatibility","titleSlug":"minimum-incompatibility"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1682,"title":"Longest Palindromic Subsequence II","titleSlug":"longest-palindromic-subsequence-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1683,"title":"Invalid Tweets","titleSlug":"invalid-tweets"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1684,"title":"Count the Number of Consistent Strings","titleSlug":"count-the-number-of-consistent-strings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1685,"title":"Sum of Absolute Differences in a Sorted Array","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1686,"title":"Stone Game VI","titleSlug":"stone-game-vi"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1687,"title":"Delivering Boxes from Storage to Ports","titleSlug":"delivering-boxes-from-storage-to-ports"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1688,"title":"Count of Matches in Tournament","titleSlug":"count-of-matches-in-tournament"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1689,"title":"Partitioning Into Minimum Number Of Deci-Binary Numbers","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1690,"title":"Stone Game VII","titleSlug":"stone-game-vii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1691,"title":"Maximum Height by Stacking Cuboids","titleSlug":"maximum-height-by-stacking-cuboids"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1692,"title":"Count Ways to Distribute Candies","titleSlug":"count-ways-to-distribute-candies"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1693,"title":"Daily Leads and Partners","titleSlug":"daily-leads-and-partners"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1694,"title":"Reformat Phone Number","titleSlug":"reformat-phone-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1695,"title":"Maximum Erasure Value","titleSlug":"maximum-erasure-value"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1696,"title":"Jump Game VI","titleSlug":"jump-game-vi"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1697,"title":"Checking Existence of Edge Length Limited Paths","titleSlug":"checking-existence-of-edge-length-limited-paths"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1698,"title":"Number of Distinct Substrings in a String","titleSlug":"number-of-distinct-substrings-in-a-string"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1699,"title":"Number of Calls Between Two Persons","titleSlug":"number-of-calls-between-two-persons"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1700,"title":"Number of Students Unable to Eat Lunch","titleSlug":"number-of-students-unable-to-eat-lunch"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1701,"title":"Average Waiting Time","titleSlug":"average-waiting-time"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1702,"title":"Maximum Binary String After Change","titleSlug":"maximum-binary-string-after-change"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1703,"title":"Minimum Adjacent Swaps for K Consecutive Ones","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1704,"title":"Determine if String Halves Are Alike","titleSlug":"determine-if-string-halves-are-alike"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1705,"title":"Maximum Number of Eaten Apples","titleSlug":"maximum-number-of-eaten-apples"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1706,"title":"Where Will the Ball Fall","titleSlug":"where-will-the-ball-fall"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1707,"title":"Maximum XOR With an Element From Array","titleSlug":"maximum-xor-with-an-element-from-array"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1708,"title":"Largest Subarray Length K","titleSlug":"largest-subarray-length-k"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1709,"title":"Biggest Window Between Visits","titleSlug":"biggest-window-between-visits"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1710,"title":"Maximum Units on a Truck","titleSlug":"maximum-units-on-a-truck"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1711,"title":"Count Good Meals","titleSlug":"count-good-meals"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1712,"title":"Ways to Split Array Into Three Subarrays","titleSlug":"ways-to-split-array-into-three-subarrays"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1713,"title":"Minimum Operations to Make a Subsequence","titleSlug":"minimum-operations-to-make-a-subsequence"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1714,"title":"Sum Of Special Evenly-Spaced Elements In Array","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1715,"title":"Count Apples and Oranges","titleSlug":"count-apples-and-oranges"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1716,"title":"Calculate Money in Leetcode Bank","titleSlug":"calculate-money-in-leetcode-bank"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1717,"title":"Maximum Score From Removing Substrings","titleSlug":"maximum-score-from-removing-substrings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1718,"title":"Construct the Lexicographically Largest Valid Sequence","titleSlug":"construct-the-lexicographically-largest-valid-sequence"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1719,"title":"Number Of Ways To Reconstruct A Tree","titleSlug":"number-of-ways-to-reconstruct-a-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1720,"title":"Decode XORed Array","titleSlug":"decode-xored-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1721,"title":"Swapping Nodes in a Linked List","titleSlug":"swapping-nodes-in-a-linked-list"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1722,"title":"Minimize Hamming Distance After Swap Operations","titleSlug":"minimize-hamming-distance-after-swap-operations"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1723,"title":"Find Minimum Time to Finish All Jobs","titleSlug":"find-minimum-time-to-finish-all-jobs"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1724,"title":"Checking Existence of Edge Length Limited Paths II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1725,"title":"Number Of Rectangles That Can Form The Largest Square","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1726,"title":"Tuple with Same Product","titleSlug":"tuple-with-same-product"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1727,"title":"Largest Submatrix With Rearrangements","titleSlug":"largest-submatrix-with-rearrangements"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1728,"title":"Cat and Mouse II","titleSlug":"cat-and-mouse-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1729,"title":"Find Followers Count","titleSlug":"find-followers-count"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1730,"title":"Shortest Path to Get Food","titleSlug":"shortest-path-to-get-food"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1731,"title":"The Number of Employees Which Report to Each Employee","titleSlug":"the-number-of-employees-which-report-to-each-employee"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1732,"title":"Find the Highest Altitude","titleSlug":"find-the-highest-altitude"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1733,"title":"Minimum Number of People to Teach","titleSlug":"minimum-number-of-people-to-teach"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1734,"title":"Decode XORed Permutation","titleSlug":"decode-xored-permutation"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1735,"title":"Count Ways to Make Array With Product","titleSlug":"count-ways-to-make-array-with-product"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1736,"title":"Latest Time by Replacing Hidden Digits","titleSlug":"latest-time-by-replacing-hidden-digits"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1737,"title":"Change Minimum Characters to Satisfy One of Three Conditions","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1738,"title":"Find Kth Largest XOR Coordinate Value","titleSlug":"find-kth-largest-xor-coordinate-value"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1739,"title":"Building Boxes","titleSlug":"building-boxes"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1740,"title":"Find Distance in a Binary Tree","titleSlug":"find-distance-in-a-binary-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1741,"title":"Find Total Time Spent by Each Employee","titleSlug":"find-total-time-spent-by-each-employee"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1742,"title":"Maximum Number of Balls in a Box","titleSlug":"maximum-number-of-balls-in-a-box"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1743,"title":"Restore the Array From Adjacent Pairs","titleSlug":"restore-the-array-from-adjacent-pairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1744,"title":"Can You Eat Your Favorite Candy on Your Favorite Day?","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1745,"title":"Palindrome Partitioning IV","titleSlug":"palindrome-partitioning-iv"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1746,"title":"Maximum Subarray Sum After One Operation","titleSlug":"maximum-subarray-sum-after-one-operation"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1747,"title":"Leetflex Banned Accounts","titleSlug":"leetflex-banned-accounts"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1748,"title":"Sum of Unique Elements","titleSlug":"sum-of-unique-elements"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1749,"title":"Maximum Absolute Sum of Any Subarray","titleSlug":"maximum-absolute-sum-of-any-subarray"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1750,"title":"Minimum Length of String After Deleting Similar Ends","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1751,"title":"Maximum Number of Events That Can Be Attended II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1752,"title":"Check if Array Is Sorted and Rotated","titleSlug":"check-if-array-is-sorted-and-rotated"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1753,"title":"Maximum Score From Removing Stones","titleSlug":"maximum-score-from-removing-stones"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1754,"title":"Largest Merge Of Two Strings","titleSlug":"largest-merge-of-two-strings"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1755,"title":"Closest Subsequence Sum","titleSlug":"closest-subsequence-sum"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1756,"title":"Design Most Recently Used Queue","titleSlug":"design-most-recently-used-queue"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1757,"title":"Recyclable and Low Fat Products","titleSlug":"recyclable-and-low-fat-products"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1758,"title":"Minimum Changes To Make Alternating Binary String","titleSlug":"minimum-changes-to-make-alternating-binary-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1759,"title":"Count Number of Homogenous Substrings","titleSlug":"count-number-of-homogenous-substrings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1760,"title":"Minimum Limit of Balls in a Bag","titleSlug":"minimum-limit-of-balls-in-a-bag"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1761,"title":"Minimum Degree of a Connected Trio in a Graph","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1762,"title":"Buildings With an Ocean View","titleSlug":"buildings-with-an-ocean-view"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1763,"title":"Longest Nice Substring","titleSlug":"longest-nice-substring"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1764,"title":"Form Array by Concatenating Subarrays of Another Array","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1765,"title":"Map of Highest Peak","titleSlug":"map-of-highest-peak"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1766,"title":"Tree of Coprimes","titleSlug":"tree-of-coprimes"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1767,"title":"Find the Subtasks That Did Not Execute","titleSlug":"find-the-subtasks-that-did-not-execute"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1768,"title":"Merge Strings Alternately","titleSlug":"merge-strings-alternately"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1769,"title":"Minimum Number of Operations to Move All Balls to Each Box","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1770,"title":"Maximum Score from Performing Multiplication Operations","titleSlug":"maximum-score-from-performing-multiplication-operations"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1771,"title":"Maximize Palindrome Length From Subsequences","titleSlug":"maximize-palindrome-length-from-subsequences"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1772,"title":"Sort Features by Popularity","titleSlug":"sort-features-by-popularity"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1773,"title":"Count Items Matching a Rule","titleSlug":"count-items-matching-a-rule"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1774,"title":"Closest Dessert Cost","titleSlug":"closest-dessert-cost"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1775,"title":"Equal Sum Arrays With Minimum Number of Operations","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1776,"title":"Car Fleet II","titleSlug":"car-fleet-ii"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1777,"title":"Product's Price for Each Store","titleSlug":"products-price-for-each-store"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1778,"title":"Shortest Path in a Hidden Grid","titleSlug":"shortest-path-in-a-hidden-grid"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1779,"title":"Find Nearest Point That Has the Same X or Y Coordinate","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1780,"title":"Check if Number is a Sum of Powers of Three","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1781,"title":"Sum of Beauty of All Substrings","titleSlug":"sum-of-beauty-of-all-substrings"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1782,"title":"Count Pairs Of Nodes","titleSlug":"count-pairs-of-nodes"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1783,"title":"Grand Slam Titles","titleSlug":"grand-slam-titles"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1784,"title":"Check if Binary String Has at Most One Segment of Ones","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1785,"title":"Minimum Elements to Add to Form a Given Sum","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1786,"title":"Number of Restricted Paths From First to Last Node","titleSlug":"number-of-restricted-paths-from-first-to-last-node"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1787,"title":"Make the XOR of All Segments Equal to Zero","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1788,"title":"Maximize the Beauty of the Garden","titleSlug":"maximize-the-beauty-of-the-garden"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1789,"title":"Primary Department for Each Employee","titleSlug":"primary-department-for-each-employee"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1790,"title":"Check if One String Swap Can Make Strings Equal","titleSlug":"check-if-one-string-swap-can-make-strings-equal"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1791,"title":"Find Center of Star Graph","titleSlug":"find-center-of-star-graph"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1792,"title":"Maximum Average Pass Ratio","titleSlug":"maximum-average-pass-ratio"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1793,"title":"Maximum Score of a Good Subarray","titleSlug":"maximum-score-of-a-good-subarray"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1794,"title":"Count Pairs of Equal Substrings With Minimum Difference","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1795,"title":"Rearrange Products Table","titleSlug":"rearrange-products-table"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1796,"title":"Second Largest Digit in a String","titleSlug":"second-largest-digit-in-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1797,"title":"Design Authentication Manager","titleSlug":"design-authentication-manager"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1798,"title":"Maximum Number of Consecutive Values You Can Make","titleSlug":"maximum-number-of-consecutive-values-you-can-make"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1799,"title":"Maximize Score After N Operations","titleSlug":"maximize-score-after-n-operations"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1800,"title":"Maximum Ascending Subarray Sum","titleSlug":"maximum-ascending-subarray-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1801,"title":"Number of Orders in the Backlog","titleSlug":"number-of-orders-in-the-backlog"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1802,"title":"Maximum Value at a Given Index in a Bounded Array","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1803,"title":"Count Pairs With XOR in a Range","titleSlug":"count-pairs-with-xor-in-a-range"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1804,"title":"Implement Trie II (Prefix Tree)","titleSlug":"implement-trie-ii-prefix-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1805,"title":"Number of Different Integers in a String","titleSlug":"number-of-different-integers-in-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1806,"title":"Minimum Number of Operations to Reinitialize a Permutation","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1807,"title":"Evaluate the Bracket Pairs of a String","titleSlug":"evaluate-the-bracket-pairs-of-a-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1808,"title":"Maximize Number of Nice Divisors","titleSlug":"maximize-number-of-nice-divisors"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1809,"title":"Ad-Free Sessions","titleSlug":"ad-free-sessions"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1810,"title":"Minimum Path Cost in a Hidden Grid","titleSlug":"minimum-path-cost-in-a-hidden-grid"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1811,"title":"Find Interview Candidates","titleSlug":"find-interview-candidates"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1812,"title":"Determine Color of a Chessboard Square","titleSlug":"determine-color-of-a-chessboard-square"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1813,"title":"Sentence Similarity III","titleSlug":"sentence-similarity-iii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1814,"title":"Count Nice Pairs in an Array","titleSlug":"count-nice-pairs-in-an-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1815,"title":"Maximum Number of Groups Getting Fresh Donuts","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1816,"title":"Truncate Sentence","titleSlug":"truncate-sentence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1817,"title":"Finding the Users Active Minutes","titleSlug":"finding-the-users-active-minutes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1818,"title":"Minimum Absolute Sum Difference","titleSlug":"minimum-absolute-sum-difference"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1819,"title":"Number of Different Subsequences GCDs","titleSlug":"number-of-different-subsequences-gcds"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1820,"title":"Maximum Number of Accepted Invitations","titleSlug":"maximum-number-of-accepted-invitations"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1821,"title":"Find Customers With Positive Revenue this Year","titleSlug":"find-customers-with-positive-revenue-this-year"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1822,"title":"Sign of the Product of an Array","titleSlug":"sign-of-the-product-of-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1823,"title":"Find the Winner of the Circular Game","titleSlug":"find-the-winner-of-the-circular-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1824,"title":"Minimum Sideway Jumps","titleSlug":"minimum-sideway-jumps"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1825,"title":"Finding MK Average","titleSlug":"finding-mk-average"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1826,"title":"Faulty Sensor","titleSlug":"faulty-sensor"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1827,"title":"Minimum Operations to Make the Array Increasing","titleSlug":"minimum-operations-to-make-the-array-increasing"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1828,"title":"Queries on Number of Points Inside a Circle","titleSlug":"queries-on-number-of-points-inside-a-circle"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1829,"title":"Maximum XOR for Each Query","titleSlug":"maximum-xor-for-each-query"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1830,"title":"Minimum Number of Operations to Make String Sorted","titleSlug":"minimum-number-of-operations-to-make-string-sorted"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1831,"title":"Maximum Transaction Each Day","titleSlug":"maximum-transaction-each-day"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1832,"title":"Check if the Sentence Is Pangram","titleSlug":"check-if-the-sentence-is-pangram"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1833,"title":"Maximum Ice Cream Bars","titleSlug":"maximum-ice-cream-bars"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1834,"title":"Single-Threaded CPU","titleSlug":"single-threaded-cpu"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1835,"title":"Find XOR Sum of All Pairs Bitwise AND","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1836,"title":"Remove Duplicates From an Unsorted Linked List","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1837,"title":"Sum of Digits in Base K","titleSlug":"sum-of-digits-in-base-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1838,"title":"Frequency of the Most Frequent Element","titleSlug":"frequency-of-the-most-frequent-element"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1839,"title":"Longest Substring Of All Vowels in Order","titleSlug":"longest-substring-of-all-vowels-in-order"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1840,"title":"Maximum Building Height","titleSlug":"maximum-building-height"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1841,"title":"League Statistics","titleSlug":"league-statistics"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1842,"title":"Next Palindrome Using Same Digits","titleSlug":"next-palindrome-using-same-digits"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1843,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1844,"title":"Replace All Digits with Characters","titleSlug":"replace-all-digits-with-characters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1845,"title":"Seat Reservation Manager","titleSlug":"seat-reservation-manager"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1846,"title":"Maximum Element After Decreasing and Rearranging","titleSlug":"maximum-element-after-decreasing-and-rearranging"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1847,"title":"Closest Room","titleSlug":"closest-room"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1848,"title":"Minimum Distance to the Target Element","titleSlug":"minimum-distance-to-the-target-element"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1849,"title":"Splitting a String Into Descending Consecutive Values","titleSlug":"splitting-a-string-into-descending-consecutive-values"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1850,"title":"Minimum Adjacent Swaps to Reach the Kth Smallest Number","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1851,"title":"Minimum Interval to Include Each Query","titleSlug":"minimum-interval-to-include-each-query"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1852,"title":"Distinct Numbers in Each Subarray","titleSlug":"distinct-numbers-in-each-subarray"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1853,"title":"Convert Date Format","titleSlug":"convert-date-format"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1854,"title":"Maximum Population Year","titleSlug":"maximum-population-year"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1855,"title":"Maximum Distance Between a Pair of Values","titleSlug":"maximum-distance-between-a-pair-of-values"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1856,"title":"Maximum Subarray Min-Product","titleSlug":"maximum-subarray-min-product"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1857,"title":"Largest Color Value in a Directed Graph","titleSlug":"largest-color-value-in-a-directed-graph"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1858,"title":"Longest Word With All Prefixes","titleSlug":"longest-word-with-all-prefixes"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1859,"title":"Sorting the Sentence","titleSlug":"sorting-the-sentence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1860,"title":"Incremental Memory Leak","titleSlug":"incremental-memory-leak"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1861,"title":"Rotating the Box","titleSlug":"rotating-the-box"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1862,"title":"Sum of Floored Pairs","titleSlug":"sum-of-floored-pairs"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1863,"title":"Sum of All Subset XOR Totals","titleSlug":"sum-of-all-subset-xor-totals"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1864,"title":"Minimum Number of Swaps to Make the Binary String Alternating","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1865,"title":"Finding Pairs With a Certain Sum","titleSlug":"finding-pairs-with-a-certain-sum"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1866,"title":"Number of Ways to Rearrange Sticks With K Sticks Visible","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1867,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1868,"title":"Product of Two Run-Length Encoded Arrays","titleSlug":"product-of-two-run-length-encoded-arrays"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1869,"title":"Longer Contiguous Segments of Ones than Zeros","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1870,"title":"Minimum Speed to Arrive on Time","titleSlug":"minimum-speed-to-arrive-on-time"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1871,"title":"Jump Game VII","titleSlug":"jump-game-vii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1872,"title":"Stone Game VIII","titleSlug":"stone-game-viii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1873,"title":"Calculate Special Bonus","titleSlug":"calculate-special-bonus"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1874,"title":"Minimize Product Sum of Two Arrays","titleSlug":"minimize-product-sum-of-two-arrays"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1875,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1876,"title":"Substrings of Size Three with Distinct Characters","titleSlug":"substrings-of-size-three-with-distinct-characters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1877,"title":"Minimize Maximum Pair Sum in Array","titleSlug":"minimize-maximum-pair-sum-in-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1878,"title":"Get Biggest Three Rhombus Sums in a Grid","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1879,"title":"Minimum XOR Sum of Two Arrays","titleSlug":"minimum-xor-sum-of-two-arrays"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1880,"title":"Check if Word Equals Summation of Two Words","titleSlug":"check-if-word-equals-summation-of-two-words"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1881,"title":"Maximum Value after Insertion","titleSlug":"maximum-value-after-insertion"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1882,"title":"Process Tasks Using Servers","titleSlug":"process-tasks-using-servers"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1883,"title":"Minimum Skips to Arrive at Meeting On Time","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1884,"title":"Egg Drop With 2 Eggs and N Floors","titleSlug":"egg-drop-with-2-eggs-and-n-floors"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1885,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1886,"title":"Determine Whether Matrix Can Be Obtained By Rotation","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1887,"title":"Reduction Operations to Make the Array Elements Equal","titleSlug":"reduction-operations-to-make-the-array-elements-equal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1888,"title":"Minimum Number of Flips to Make the Binary String Alternating","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1889,"title":"Minimum Space Wasted From Packaging","titleSlug":"minimum-space-wasted-from-packaging"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1890,"title":"The Latest Login in 2020","titleSlug":"the-latest-login-in-2020"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1891,"title":"Cutting Ribbons","titleSlug":"cutting-ribbons"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1892,"title":"Page Recommendations II","titleSlug":"page-recommendations-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1893,"title":"Check if All the Integers in a Range Are Covered","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1894,"title":"Find the Student that Will Replace the Chalk","titleSlug":"find-the-student-that-will-replace-the-chalk"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1895,"title":"Largest Magic Square","titleSlug":"largest-magic-square"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1896,"title":"Minimum Cost to Change the Final Value of Expression","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1897,"title":"Redistribute Characters to Make All Strings Equal","titleSlug":"redistribute-characters-to-make-all-strings-equal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1898,"title":"Maximum Number of Removable Characters","titleSlug":"maximum-number-of-removable-characters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1899,"title":"Merge Triplets to Form Target Triplet","titleSlug":"merge-triplets-to-form-target-triplet"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1900,"title":"The Earliest and Latest Rounds Where Players Compete","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1901,"title":"Find a Peak Element II","titleSlug":"find-a-peak-element-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1902,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1903,"title":"Largest Odd Number in String","titleSlug":"largest-odd-number-in-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1904,"title":"The Number of Full Rounds You Have Played","titleSlug":"the-number-of-full-rounds-you-have-played"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1905,"title":"Count Sub Islands","titleSlug":"count-sub-islands"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1906,"title":"Minimum Absolute Difference Queries","titleSlug":"minimum-absolute-difference-queries"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1907,"title":"Count Salary Categories","titleSlug":"count-salary-categories"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1908,"title":"Game of Nim","titleSlug":"game-of-nim"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1909,"title":"Remove One Element to Make the Array Strictly Increasing","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1910,"title":"Remove All Occurrences of a Substring","titleSlug":"remove-all-occurrences-of-a-substring"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1911,"title":"Maximum Alternating Subsequence Sum","titleSlug":"maximum-alternating-subsequence-sum"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1912,"title":"Design Movie Rental System","titleSlug":"design-movie-rental-system"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1913,"title":"Maximum Product Difference Between Two Pairs","titleSlug":"maximum-product-difference-between-two-pairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1914,"title":"Cyclically Rotating a Grid","titleSlug":"cyclically-rotating-a-grid"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1915,"title":"Number of Wonderful Substrings","titleSlug":"number-of-wonderful-substrings"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1916,"title":"Count Ways to Build Rooms in an Ant Colony","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1917,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1918,"title":"Kth Smallest Subarray Sum","titleSlug":"kth-smallest-subarray-sum"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1919,"title":"Leetcodify Similar Friends","titleSlug":"leetcodify-similar-friends"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1920,"title":"Build Array from Permutation","titleSlug":"build-array-from-permutation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1921,"title":"Eliminate Maximum Number of Monsters","titleSlug":"eliminate-maximum-number-of-monsters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1922,"title":"Count Good Numbers","titleSlug":"count-good-numbers"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1923,"title":"Longest Common Subpath","titleSlug":"longest-common-subpath"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1924,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1925,"title":"Count Square Sum Triples","titleSlug":"count-square-sum-triples"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1926,"title":"Nearest Exit from Entrance in Maze","titleSlug":"nearest-exit-from-entrance-in-maze"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1927,"title":"Sum Game","titleSlug":"sum-game"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1928,"title":"Minimum Cost to Reach Destination in Time","titleSlug":"minimum-cost-to-reach-destination-in-time"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1929,"title":"Concatenation of Array","titleSlug":"concatenation-of-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1930,"title":"Unique Length-3 Palindromic Subsequences","titleSlug":"unique-length-3-palindromic-subsequences"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1931,"title":"Painting a Grid With Three Different Colors","titleSlug":"painting-a-grid-with-three-different-colors"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1932,"title":"Merge BSTs to Create Single BST","titleSlug":"merge-bsts-to-create-single-bst"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1933,"title":"Check if String Is Decomposable Into Value-Equal Substrings","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1934,"title":"Confirmation Rate","titleSlug":"confirmation-rate"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1935,"title":"Maximum Number of Words You Can Type","titleSlug":"maximum-number-of-words-you-can-type"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1936,"title":"Add Minimum Number of Rungs","titleSlug":"add-minimum-number-of-rungs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1937,"title":"Maximum Number of Points with Cost","titleSlug":"maximum-number-of-points-with-cost"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1938,"title":"Maximum Genetic Difference Query","titleSlug":"maximum-genetic-difference-query"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1939,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1940,"title":"Longest Common Subsequence Between Sorted Arrays","titleSlug":"longest-common-subsequence-between-sorted-arrays"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1941,"title":"Check if All Characters Have Equal Number of Occurrences","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1942,"title":"The Number of the Smallest Unoccupied Chair","titleSlug":"the-number-of-the-smallest-unoccupied-chair"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1943,"title":"Describe the Painting","titleSlug":"describe-the-painting"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1944,"title":"Number of Visible People in a Queue","titleSlug":"number-of-visible-people-in-a-queue"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1945,"title":"Sum of Digits of String After Convert","titleSlug":"sum-of-digits-of-string-after-convert"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1946,"title":"Largest Number After Mutating Substring","titleSlug":"largest-number-after-mutating-substring"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1947,"title":"Maximum Compatibility Score Sum","titleSlug":"maximum-compatibility-score-sum"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1948,"title":"Delete Duplicate Folders in System","titleSlug":"delete-duplicate-folders-in-system"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1949,"title":"Strong Friendship","titleSlug":"strong-friendship"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1950,"title":"Maximum of Minimum Values in All Subarrays","titleSlug":"maximum-of-minimum-values-in-all-subarrays"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1951,"title":"All the Pairs With the Maximum Number of Common Followers","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1952,"title":"Three Divisors","titleSlug":"three-divisors"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1953,"title":"Maximum Number of Weeks for Which You Can Work","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1954,"title":"Minimum Garden Perimeter to Collect Enough Apples","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1955,"title":"Count Number of Special Subsequences","titleSlug":"count-number-of-special-subsequences"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1956,"title":"Minimum Time For K Virus Variants to Spread","titleSlug":"minimum-time-for-k-virus-variants-to-spread"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1957,"title":"Delete Characters to Make Fancy String","titleSlug":"delete-characters-to-make-fancy-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1958,"title":"Check if Move is Legal","titleSlug":"check-if-move-is-legal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1959,"title":"Minimum Total Space Wasted With K Resizing Operations","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1960,"title":"Maximum Product of the Length of Two Palindromic Substrings","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1961,"title":"Check If String Is a Prefix of Array","titleSlug":"check-if-string-is-a-prefix-of-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1962,"title":"Remove Stones to Minimize the Total","titleSlug":"remove-stones-to-minimize-the-total"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1963,"title":"Minimum Number of Swaps to Make the String Balanced","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1964,"title":"Find the Longest Valid Obstacle Course at Each Position","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1965,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1966,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1967,"title":"Number of Strings That Appear as Substrings in Word","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1968,"title":"Array With Elements Not Equal to Average of Neighbors","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1969,"title":"Minimum Non-Zero Product of the Array Elements","titleSlug":"minimum-non-zero-product-of-the-array-elements"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1970,"title":"Last Day Where You Can Still Cross","titleSlug":"last-day-where-you-can-still-cross"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1971,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1972,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1973,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1974,"title":"Minimum Time to Type Word Using Special Typewriter","titleSlug":"minimum-time-to-type-word-using-special-typewriter"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1975,"title":"Maximum Matrix Sum","titleSlug":"maximum-matrix-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1976,"title":"Number of Ways to Arrive at Destination","titleSlug":"number-of-ways-to-arrive-at-destination"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1977,"title":"Number of Ways to Separate Numbers","titleSlug":"number-of-ways-to-separate-numbers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1978,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1979,"title":"Find Greatest Common Divisor of Array","titleSlug":"find-greatest-common-divisor-of-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1980,"title":"Find Unique Binary String","titleSlug":"find-unique-binary-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1981,"title":"Minimize the Difference Between Target and Chosen Elements","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1982,"title":"Find Array Given Subset Sums","titleSlug":"find-array-given-subset-sums"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1983,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1984,"title":"Minimum Difference Between Highest and Lowest of K Scores","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1985,"title":"Find the Kth Largest Integer in the Array","titleSlug":"find-the-kth-largest-integer-in-the-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1986,"title":"Minimum Number of Work Sessions to Finish the Tasks","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1987,"title":"Number of Unique Good Subsequences","titleSlug":"number-of-unique-good-subsequences"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1988,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1989,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1990,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1991,"title":"Find the Middle Index in Array","titleSlug":"find-the-middle-index-in-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1992,"title":"Find All Groups of Farmland","titleSlug":"find-all-groups-of-farmland"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1993,"title":"Operations on Tree","titleSlug":"operations-on-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1994,"title":"The Number of Good Subsets","titleSlug":"the-number-of-good-subsets"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1995,"title":"Count Special Quadruplets","titleSlug":"count-special-quadruplets"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1996,"title":"The Number of Weak Characters in the Game","titleSlug":"the-number-of-weak-characters-in-the-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1997,"title":"First Day Where You Have Been in All the Rooms","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1998,"title":"GCD Sort of an Array","titleSlug":"gcd-sort-of-an-array"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1999,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2000,"title":"Reverse Prefix of Word","titleSlug":"reverse-prefix-of-word"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2001,"title":"Number of Pairs of Interchangeable Rectangles","titleSlug":"number-of-pairs-of-interchangeable-rectangles"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2002,"title":"Maximum Product of the Length of Two Palindromic Subsequences","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2003,"title":"Smallest Missing Genetic Value in Each Subtree","titleSlug":"smallest-missing-genetic-value-in-each-subtree"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2004,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2005,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2006,"title":"Count Number of Pairs With Absolute Difference K","titleSlug":"count-number-of-pairs-with-absolute-difference-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2007,"title":"Find Original Array From Doubled Array","titleSlug":"find-original-array-from-doubled-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2008,"title":"Maximum Earnings From Taxi","titleSlug":"maximum-earnings-from-taxi"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2009,"title":"Minimum Number of Operations to Make Array Continuous","titleSlug":"minimum-number-of-operations-to-make-array-continuous"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2010,"title":"The Number of Seniors and Juniors to Join the Company II","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2011,"title":"Final Value of Variable After Performing Operations","titleSlug":"final-value-of-variable-after-performing-operations"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2012,"title":"Sum of Beauty in the Array","titleSlug":"sum-of-beauty-in-the-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2013,"title":"Detect Squares","titleSlug":"detect-squares"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2014,"title":"Longest Subsequence Repeated k Times","titleSlug":"longest-subsequence-repeated-k-times"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2015,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2016,"title":"Maximum Difference Between Increasing Elements","titleSlug":"maximum-difference-between-increasing-elements"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2017,"title":"Grid Game","titleSlug":"grid-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2018,"title":"Check if Word Can Be Placed In Crossword","titleSlug":"check-if-word-can-be-placed-in-crossword"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2019,"title":"The Score of Students Solving Math Expression","titleSlug":"the-score-of-students-solving-math-expression"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2020,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2021,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2022,"title":"Convert 1D Array Into 2D Array","titleSlug":"convert-1d-array-into-2d-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2023,"title":"Number of Pairs of Strings With Concatenation Equal to Target","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2024,"title":"Maximize the Confusion of an Exam","titleSlug":"maximize-the-confusion-of-an-exam"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2025,"title":"Maximum Number of Ways to Partition an Array","titleSlug":"maximum-number-of-ways-to-partition-an-array"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2026,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2027,"title":"Minimum Moves to Convert String","titleSlug":"minimum-moves-to-convert-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2028,"title":"Find Missing Observations","titleSlug":"find-missing-observations"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2029,"title":"Stone Game IX","titleSlug":"stone-game-ix"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2030,"title":"Smallest K-Length Subsequence With Occurrences of a Letter","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2031,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2032,"title":"Two Out of Three","titleSlug":"two-out-of-three"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2033,"title":"Minimum Operations to Make a Uni-Value Grid","titleSlug":"minimum-operations-to-make-a-uni-value-grid"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2034,"title":"Stock Price Fluctuation","titleSlug":"stock-price-fluctuation"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2035,"title":"Partition Array Into Two Arrays to Minimize Sum Difference","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2036,"title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2037,"title":"Minimum Number of Moves to Seat Everyone","titleSlug":"minimum-number-of-moves-to-seat-everyone"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2038,"title":"Remove Colored Pieces if Both Neighbors are the Same Color","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2039,"title":"The Time When the Network Becomes Idle","titleSlug":"the-time-when-the-network-becomes-idle"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2040,"title":"Kth Smallest Product of Two Sorted Arrays","titleSlug":"kth-smallest-product-of-two-sorted-arrays"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2041,"title":"Accepted Candidates From the Interviews","titleSlug":"accepted-candidates-from-the-interviews"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2042,"title":"Check if Numbers Are Ascending in a Sentence","titleSlug":"check-if-numbers-are-ascending-in-a-sentence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2043,"title":"Simple Bank System","titleSlug":"simple-bank-system"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2044,"title":"Count Number of Maximum Bitwise-OR Subsets","titleSlug":"count-number-of-maximum-bitwise-or-subsets"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2045,"title":"Second Minimum Time to Reach Destination","titleSlug":"second-minimum-time-to-reach-destination"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2046,"title":"Sort Linked List Already Sorted Using Absolute Values","titleSlug":"sort-linked-list-already-sorted-using-absolute-values"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2047,"title":"Number of Valid Words in a Sentence","titleSlug":"number-of-valid-words-in-a-sentence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2048,"title":"Next Greater Numerically Balanced Number","titleSlug":"next-greater-numerically-balanced-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2049,"title":"Count Nodes With the Highest Score","titleSlug":"count-nodes-with-the-highest-score"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2050,"title":"Parallel Courses III","titleSlug":"parallel-courses-iii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2051,"title":"The Category of Each Member in the Store","titleSlug":"the-category-of-each-member-in-the-store"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2052,"title":"Minimum Cost to Separate Sentence Into Rows","titleSlug":"minimum-cost-to-separate-sentence-into-rows"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2053,"title":"Kth Distinct String in an Array","titleSlug":"kth-distinct-string-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2054,"title":"Two Best Non-Overlapping Events","titleSlug":"two-best-non-overlapping-events"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2055,"title":"Plates Between Candles","titleSlug":"plates-between-candles"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2056,"title":"Number of Valid Move Combinations On Chessboard","titleSlug":"number-of-valid-move-combinations-on-chessboard"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2057,"title":"Smallest Index With Equal Value","titleSlug":"smallest-index-with-equal-value"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2058,"title":"Find the Minimum and Maximum Number of Nodes Between Critical Points","titleSlug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2059,"title":"Minimum Operations to Convert Number","titleSlug":"minimum-operations-to-convert-number"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2060,"title":"Check if an Original String Exists Given Two Encoded Strings","titleSlug":"check-if-an-original-string-exists-given-two-encoded-strings"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2061,"title":"Number of Spaces Cleaning Robot Cleaned","titleSlug":"number-of-spaces-cleaning-robot-cleaned"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2062,"title":"Count Vowel Substrings of a String","titleSlug":"count-vowel-substrings-of-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2063,"title":"Vowels of All Substrings","titleSlug":"vowels-of-all-substrings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2064,"title":"Minimized Maximum of Products Distributed to Any Store","titleSlug":"minimized-maximum-of-products-distributed-to-any-store"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2065,"title":"Maximum Path Quality of a Graph","titleSlug":"maximum-path-quality-of-a-graph"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2066,"title":"Account Balance","titleSlug":"account-balance"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2067,"title":"Number of Equal Count Substrings","titleSlug":"number-of-equal-count-substrings"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2068,"title":"Check Whether Two Strings are Almost Equivalent","titleSlug":"check-whether-two-strings-are-almost-equivalent"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2069,"title":"Walking Robot Simulation II","titleSlug":"walking-robot-simulation-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2070,"title":"Most Beautiful Item for Each Query","titleSlug":"most-beautiful-item-for-each-query"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2071,"title":"Maximum Number of Tasks You Can Assign","titleSlug":"maximum-number-of-tasks-you-can-assign"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2072,"title":"The Winner University","titleSlug":"the-winner-university"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2073,"title":"Time Needed to Buy Tickets","titleSlug":"time-needed-to-buy-tickets"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2074,"title":"Reverse Nodes in Even Length Groups","titleSlug":"reverse-nodes-in-even-length-groups"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2075,"title":"Decode the Slanted Ciphertext","titleSlug":"decode-the-slanted-ciphertext"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2076,"title":"Process Restricted Friend Requests","titleSlug":"process-restricted-friend-requests"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2077,"title":"Paths in Maze That Lead to Same Room","titleSlug":"paths-in-maze-that-lead-to-same-room"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2078,"title":"Two Furthest Houses With Different Colors","titleSlug":"two-furthest-houses-with-different-colors"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2079,"title":"Watering Plants","titleSlug":"watering-plants"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2080,"title":"Range Frequency Queries","titleSlug":"range-frequency-queries"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2081,"title":"Sum of k-Mirror Numbers","titleSlug":"sum-of-k-mirror-numbers"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2082,"title":"The Number of Rich Customers","titleSlug":"the-number-of-rich-customers"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2083,"title":"Substrings That Begin and End With the Same Letter","titleSlug":"substrings-that-begin-and-end-with-the-same-letter"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2084,"title":"Drop Type 1 Orders for Customers With Type 0 Orders","titleSlug":"drop-type-1-orders-for-customers-with-type-0-orders"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2085,"title":"Count Common Words With One Occurrence","titleSlug":"count-common-words-with-one-occurrence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2086,"title":"Minimum Number of Food Buckets to Feed the Hamsters","titleSlug":"minimum-number-of-food-buckets-to-feed-the-hamsters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2087,"title":"Minimum Cost Homecoming of a Robot in a Grid","titleSlug":"minimum-cost-homecoming-of-a-robot-in-a-grid"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2088,"title":"Count Fertile Pyramids in a Land","titleSlug":"count-fertile-pyramids-in-a-land"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2089,"title":"Find Target Indices After Sorting Array","titleSlug":"find-target-indices-after-sorting-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2090,"title":"K Radius Subarray Averages","titleSlug":"k-radius-subarray-averages"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2091,"title":"Removing Minimum and Maximum From Array","titleSlug":"removing-minimum-and-maximum-from-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2092,"title":"Find All People With Secret","titleSlug":"find-all-people-with-secret"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2093,"title":"Minimum Cost to Reach City With Discounts","titleSlug":"minimum-cost-to-reach-city-with-discounts"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2094,"title":"Finding 3-Digit Even Numbers","titleSlug":"finding-3-digit-even-numbers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2095,"title":"Delete the Middle Node of a Linked List","titleSlug":"delete-the-middle-node-of-a-linked-list"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2096,"title":"Step-By-Step Directions From a Binary Tree Node to Another","titleSlug":"step-by-step-directions-from-a-binary-tree-node-to-another"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2097,"title":"Valid Arrangement of Pairs","titleSlug":"valid-arrangement-of-pairs"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2098,"title":"Subsequence of Size K With the Largest Even Sum","titleSlug":"subsequence-of-size-k-with-the-largest-even-sum"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2099,"title":"Find Subsequence of Length K With the Largest Sum","titleSlug":"find-subsequence-of-length-k-with-the-largest-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2100,"title":"Find Good Days to Rob the Bank","titleSlug":"find-good-days-to-rob-the-bank"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2101,"title":"Detonate the Maximum Bombs","titleSlug":"detonate-the-maximum-bombs"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2102,"title":"Sequentially Ordinal Rank Tracker","titleSlug":"sequentially-ordinal-rank-tracker"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2103,"title":"Rings and Rods","titleSlug":"rings-and-rods"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2104,"title":"Sum of Subarray Ranges","titleSlug":"sum-of-subarray-ranges"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2105,"title":"Watering Plants II","titleSlug":"watering-plants-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2106,"title":"Maximum Fruits Harvested After at Most K Steps","titleSlug":"maximum-fruits-harvested-after-at-most-k-steps"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2107,"title":"Number of Unique Flavors After Sharing K Candies","titleSlug":"number-of-unique-flavors-after-sharing-k-candies"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2108,"title":"Find First Palindromic String in the Array","titleSlug":"find-first-palindromic-string-in-the-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2109,"title":"Adding Spaces to a String","titleSlug":"adding-spaces-to-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2110,"title":"Number of Smooth Descent Periods of a Stock","titleSlug":"number-of-smooth-descent-periods-of-a-stock"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2111,"title":"Minimum Operations to Make the Array K-Increasing","titleSlug":"minimum-operations-to-make-the-array-k-increasing"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2112,"title":"The Airport With the Most Traffic","titleSlug":"the-airport-with-the-most-traffic"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2113,"title":"Elements in Array After Removing and Replacing Elements","titleSlug":"elements-in-array-after-removing-and-replacing-elements"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2114,"title":"Maximum Number of Words Found in Sentences","titleSlug":"maximum-number-of-words-found-in-sentences"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2115,"title":"Find All Possible Recipes from Given Supplies","titleSlug":"find-all-possible-recipes-from-given-supplies"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2116,"title":"Check if a Parentheses String Can Be Valid","titleSlug":"check-if-a-parentheses-string-can-be-valid"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2117,"title":"Abbreviating the Product of a Range","titleSlug":"abbreviating-the-product-of-a-range"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2118,"title":"Build the Equation","titleSlug":"build-the-equation"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2119,"title":"A Number After a Double Reversal","titleSlug":"a-number-after-a-double-reversal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2120,"title":"Execution of All Suffix Instructions Staying in a Grid","titleSlug":"execution-of-all-suffix-instructions-staying-in-a-grid"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2121,"title":"Intervals Between Identical Elements","titleSlug":"intervals-between-identical-elements"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2122,"title":"Recover the Original Array","titleSlug":"recover-the-original-array"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2123,"title":"Minimum Operations to Remove Adjacent Ones in Matrix","titleSlug":"minimum-operations-to-remove-adjacent-ones-in-matrix"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2124,"title":"Check if All A's Appears Before All B's","titleSlug":"check-if-all-as-appears-before-all-bs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2125,"title":"Number of Laser Beams in a Bank","titleSlug":"number-of-laser-beams-in-a-bank"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2126,"title":"Destroying Asteroids","titleSlug":"destroying-asteroids"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2127,"title":"Maximum Employees to Be Invited to a Meeting","titleSlug":"maximum-employees-to-be-invited-to-a-meeting"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2128,"title":"Remove All Ones With Row and Column Flips","titleSlug":"remove-all-ones-with-row-and-column-flips"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2129,"title":"Capitalize the Title","titleSlug":"capitalize-the-title"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2130,"title":"Maximum Twin Sum of a Linked List","titleSlug":"maximum-twin-sum-of-a-linked-list"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2131,"title":"Longest Palindrome by Concatenating Two Letter Words","titleSlug":"longest-palindrome-by-concatenating-two-letter-words"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2132,"title":"Stamping the Grid","titleSlug":"stamping-the-grid"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2133,"title":"Check if Every Row and Column Contains All Numbers","titleSlug":"check-if-every-row-and-column-contains-all-numbers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2134,"title":"Minimum Swaps to Group All 1's Together II","titleSlug":"minimum-swaps-to-group-all-1s-together-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2135,"title":"Count Words Obtained After Adding a Letter","titleSlug":"count-words-obtained-after-adding-a-letter"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2136,"title":"Earliest Possible Day of Full Bloom","titleSlug":"earliest-possible-day-of-full-bloom"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2137,"title":"Pour Water Between Buckets to Make Water Levels Equal","titleSlug":"pour-water-between-buckets-to-make-water-levels-equal"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2138,"title":"Divide a String Into Groups of Size k","titleSlug":"divide-a-string-into-groups-of-size-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2139,"title":"Minimum Moves to Reach Target Score","titleSlug":"minimum-moves-to-reach-target-score"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2140,"title":"Solving Questions With Brainpower","titleSlug":"solving-questions-with-brainpower"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2141,"title":"Maximum Running Time of N Computers","titleSlug":"maximum-running-time-of-n-computers"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2142,"title":"The Number of Passengers in Each Bus I","titleSlug":"the-number-of-passengers-in-each-bus-i"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2143,"title":"Choose Numbers From Two Arrays in Range","titleSlug":"choose-numbers-from-two-arrays-in-range"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2144,"title":"Minimum Cost of Buying Candies With Discount","titleSlug":"minimum-cost-of-buying-candies-with-discount"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2145,"title":"Count the Hidden Sequences","titleSlug":"count-the-hidden-sequences"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2146,"title":"K Highest Ranked Items Within a Price Range","titleSlug":"k-highest-ranked-items-within-a-price-range"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2147,"title":"Number of Ways to Divide a Long Corridor","titleSlug":"number-of-ways-to-divide-a-long-corridor"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2148,"title":"Count Elements With Strictly Smaller and Greater Elements","titleSlug":"count-elements-with-strictly-smaller-and-greater-elements"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2149,"title":"Rearrange Array Elements by Sign","titleSlug":"rearrange-array-elements-by-sign"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2150,"title":"Find All Lonely Numbers in the Array","titleSlug":"find-all-lonely-numbers-in-the-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2151,"title":"Maximum Good People Based on Statements","titleSlug":"maximum-good-people-based-on-statements"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2152,"title":"Minimum Number of Lines to Cover Points","titleSlug":"minimum-number-of-lines-to-cover-points"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2153,"title":"The Number of Passengers in Each Bus II","titleSlug":"the-number-of-passengers-in-each-bus-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2154,"title":"Keep Multiplying Found Values by Two","titleSlug":"keep-multiplying-found-values-by-two"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2155,"title":"All Divisions With the Highest Score of a Binary Array","titleSlug":"all-divisions-with-the-highest-score-of-a-binary-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2156,"title":"Find Substring With Given Hash Value","titleSlug":"find-substring-with-given-hash-value"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2157,"title":"Groups of Strings","titleSlug":"groups-of-strings"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2158,"title":"Amount of New Area Painted Each Day","titleSlug":"amount-of-new-area-painted-each-day"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2159,"title":"Order Two Columns Independently","titleSlug":"order-two-columns-independently"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2160,"title":"Minimum Sum of Four Digit Number After Splitting Digits","titleSlug":"minimum-sum-of-four-digit-number-after-splitting-digits"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2161,"title":"Partition Array According to Given Pivot","titleSlug":"partition-array-according-to-given-pivot"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2162,"title":"Minimum Cost to Set Cooking Time","titleSlug":"minimum-cost-to-set-cooking-time"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2163,"title":"Minimum Difference in Sums After Removal of Elements","titleSlug":"minimum-difference-in-sums-after-removal-of-elements"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2164,"title":"Sort Even and Odd Indices Independently","titleSlug":"sort-even-and-odd-indices-independently"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2165,"title":"Smallest Value of the Rearranged Number","titleSlug":"smallest-value-of-the-rearranged-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2166,"title":"Design Bitset","titleSlug":"design-bitset"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2167,"title":"Minimum Time to Remove All Cars Containing Illegal Goods","titleSlug":"minimum-time-to-remove-all-cars-containing-illegal-goods"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2168,"title":"Unique Substrings With Equal Digit Frequency","titleSlug":"unique-substrings-with-equal-digit-frequency"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2169,"title":"Count Operations to Obtain Zero","titleSlug":"count-operations-to-obtain-zero"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2170,"title":"Minimum Operations to Make the Array Alternating","titleSlug":"minimum-operations-to-make-the-array-alternating"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2171,"title":"Removing Minimum Number of Magic Beans","titleSlug":"removing-minimum-number-of-magic-beans"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2172,"title":"Maximum AND Sum of Array","titleSlug":"maximum-and-sum-of-array"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2173,"title":"Longest Winning Streak","titleSlug":"longest-winning-streak"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2174,"title":"Remove All Ones With Row and Column Flips II","titleSlug":"remove-all-ones-with-row-and-column-flips-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2175,"title":"The Change in Global Rankings","titleSlug":"the-change-in-global-rankings"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2176,"title":"Count Equal and Divisible Pairs in an Array","titleSlug":"count-equal-and-divisible-pairs-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2177,"title":"Find Three Consecutive Integers That Sum to a Given Number","titleSlug":"find-three-consecutive-integers-that-sum-to-a-given-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2178,"title":"Maximum Split of Positive Even Integers","titleSlug":"maximum-split-of-positive-even-integers"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2179,"title":"Count Good Triplets in an Array","titleSlug":"count-good-triplets-in-an-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2180,"title":"Count Integers With Even Digit Sum","titleSlug":"count-integers-with-even-digit-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2181,"title":"Merge Nodes in Between Zeros","titleSlug":"merge-nodes-in-between-zeros"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2182,"title":"Construct String With Repeat Limit","titleSlug":"construct-string-with-repeat-limit"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2183,"title":"Count Array Pairs Divisible by K","titleSlug":"count-array-pairs-divisible-by-k"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2184,"title":"Number of Ways to Build Sturdy Brick Wall","titleSlug":"number-of-ways-to-build-sturdy-brick-wall"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2185,"title":"Counting Words With a Given Prefix","titleSlug":"counting-words-with-a-given-prefix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2186,"title":"Minimum Number of Steps to Make Two Strings Anagram II","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2187,"title":"Minimum Time to Complete Trips","titleSlug":"minimum-time-to-complete-trips"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2188,"title":"Minimum Time to Finish the Race","titleSlug":"minimum-time-to-finish-the-race"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2189,"title":"Number of Ways to Build House of Cards","titleSlug":"number-of-ways-to-build-house-of-cards"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2190,"title":"Most Frequent Number Following Key In an Array","titleSlug":"most-frequent-number-following-key-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2191,"title":"Sort the Jumbled Numbers","titleSlug":"sort-the-jumbled-numbers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2192,"title":"All Ancestors of a Node in a Directed Acyclic Graph","titleSlug":"all-ancestors-of-a-node-in-a-directed-acyclic-graph"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2193,"title":"Minimum Number of Moves to Make Palindrome","titleSlug":"minimum-number-of-moves-to-make-palindrome"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2194,"title":"Cells in a Range on an Excel Sheet","titleSlug":"cells-in-a-range-on-an-excel-sheet"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2195,"title":"Append K Integers With Minimal Sum","titleSlug":"append-k-integers-with-minimal-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2196,"title":"Create Binary Tree From Descriptions","titleSlug":"create-binary-tree-from-descriptions"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2197,"title":"Replace Non-Coprime Numbers in Array","titleSlug":"replace-non-coprime-numbers-in-array"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2198,"title":"Number of Single Divisor Triplets","titleSlug":"number-of-single-divisor-triplets"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2199,"title":"Finding the Topic of Each Post","titleSlug":"finding-the-topic-of-each-post"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2200,"title":"Find All K-Distant Indices in an Array","titleSlug":"find-all-k-distant-indices-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2201,"title":"Count Artifacts That Can Be Extracted","titleSlug":"count-artifacts-that-can-be-extracted"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2202,"title":"Maximize the Topmost Element After K Moves","titleSlug":"maximize-the-topmost-element-after-k-moves"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2203,"title":"Minimum Weighted Subgraph With the Required Paths","titleSlug":"minimum-weighted-subgraph-with-the-required-paths"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2204,"title":"Distance to a Cycle in Undirected Graph","titleSlug":"distance-to-a-cycle-in-undirected-graph"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2205,"title":"The Number of Users That Are Eligible for Discount","titleSlug":"the-number-of-users-that-are-eligible-for-discount"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2206,"title":"Divide Array Into Equal Pairs","titleSlug":"divide-array-into-equal-pairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2207,"title":"Maximize Number of Subsequences in a String","titleSlug":"maximize-number-of-subsequences-in-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2208,"title":"Minimum Operations to Halve Array Sum","titleSlug":"minimum-operations-to-halve-array-sum"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2209,"title":"Minimum White Tiles After Covering With Carpets","titleSlug":"minimum-white-tiles-after-covering-with-carpets"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2210,"title":"Count Hills and Valleys in an Array","titleSlug":"count-hills-and-valleys-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2211,"title":"Count Collisions on a Road","titleSlug":"count-collisions-on-a-road"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2212,"title":"Maximum Points in an Archery Competition","titleSlug":"maximum-points-in-an-archery-competition"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2213,"title":"Longest Substring of One Repeating Character","titleSlug":"longest-substring-of-one-repeating-character"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2214,"title":"Minimum Health to Beat Game","titleSlug":"minimum-health-to-beat-game"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2215,"title":"Find the Difference of Two Arrays","titleSlug":"find-the-difference-of-two-arrays"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2216,"title":"Minimum Deletions to Make Array Beautiful","titleSlug":"minimum-deletions-to-make-array-beautiful"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2217,"title":"Find Palindrome With Fixed Length","titleSlug":"find-palindrome-with-fixed-length"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2218,"title":"Maximum Value of K Coins From Piles","titleSlug":"maximum-value-of-k-coins-from-piles"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2219,"title":"Maximum Sum Score of Array","titleSlug":"maximum-sum-score-of-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2220,"title":"Minimum Bit Flips to Convert Number","titleSlug":"minimum-bit-flips-to-convert-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2221,"title":"Find Triangular Sum of an Array","titleSlug":"find-triangular-sum-of-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2222,"title":"Number of Ways to Select Buildings","titleSlug":"number-of-ways-to-select-buildings"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2223,"title":"Sum of Scores of Built Strings","titleSlug":"sum-of-scores-of-built-strings"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2224,"title":"Minimum Number of Operations to Convert Time","titleSlug":"minimum-number-of-operations-to-convert-time"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2225,"title":"Find Players With Zero or One Losses","titleSlug":"find-players-with-zero-or-one-losses"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2226,"title":"Maximum Candies Allocated to K Children","titleSlug":"maximum-candies-allocated-to-k-children"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2227,"title":"Encrypt and Decrypt Strings","titleSlug":"encrypt-and-decrypt-strings"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2228,"title":"Users With Two Purchases Within Seven Days","titleSlug":"users-with-two-purchases-within-seven-days"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2229,"title":"Check if an Array Is Consecutive","titleSlug":"check-if-an-array-is-consecutive"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2230,"title":"The Users That Are Eligible for Discount","titleSlug":"the-users-that-are-eligible-for-discount"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2231,"title":"Largest Number After Digit Swaps by Parity","titleSlug":"largest-number-after-digit-swaps-by-parity"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2232,"title":"Minimize Result by Adding Parentheses to Expression","titleSlug":"minimize-result-by-adding-parentheses-to-expression"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2233,"title":"Maximum Product After K Increments","titleSlug":"maximum-product-after-k-increments"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2234,"title":"Maximum Total Beauty of the Gardens","titleSlug":"maximum-total-beauty-of-the-gardens"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2235,"title":"Add Two Integers","titleSlug":"add-two-integers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2236,"title":"Root Equals Sum of Children","titleSlug":"root-equals-sum-of-children"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2237,"title":"Count Positions on Street With Required Brightness","titleSlug":"count-positions-on-street-with-required-brightness"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2238,"title":"Number of Times a Driver Was a Passenger","titleSlug":"number-of-times-a-driver-was-a-passenger"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2239,"title":"Find Closest Number to Zero","titleSlug":"find-closest-number-to-zero"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2240,"title":"Number of Ways to Buy Pens and Pencils","titleSlug":"number-of-ways-to-buy-pens-and-pencils"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2241,"title":"Design an ATM Machine","titleSlug":"design-an-atm-machine"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2242,"title":"Maximum Score of a Node Sequence","titleSlug":"maximum-score-of-a-node-sequence"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2243,"title":"Calculate Digit Sum of a String","titleSlug":"calculate-digit-sum-of-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2244,"title":"Minimum Rounds to Complete All Tasks","titleSlug":"minimum-rounds-to-complete-all-tasks"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2245,"title":"Maximum Trailing Zeros in a Cornered Path","titleSlug":"maximum-trailing-zeros-in-a-cornered-path"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2246,"title":"Longest Path With Different Adjacent Characters","titleSlug":"longest-path-with-different-adjacent-characters"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2247,"title":"Maximum Cost of Trip With K Highways","titleSlug":"maximum-cost-of-trip-with-k-highways"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2248,"title":"Intersection of Multiple Arrays","titleSlug":"intersection-of-multiple-arrays"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2249,"title":"Count Lattice Points Inside a Circle","titleSlug":"count-lattice-points-inside-a-circle"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2250,"title":"Count Number of Rectangles Containing Each Point","titleSlug":"count-number-of-rectangles-containing-each-point"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2251,"title":"Number of Flowers in Full Bloom","titleSlug":"number-of-flowers-in-full-bloom"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2252,"title":"Dynamic Pivoting of a Table","titleSlug":"dynamic-pivoting-of-a-table"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2253,"title":"Dynamic Unpivoting of a Table","titleSlug":"dynamic-unpivoting-of-a-table"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2254,"title":"Design Video Sharing Platform","titleSlug":"design-video-sharing-platform"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2255,"title":"Count Prefixes of a Given String","titleSlug":"count-prefixes-of-a-given-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2256,"title":"Minimum Average Difference","titleSlug":"minimum-average-difference"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2257,"title":"Count Unguarded Cells in the Grid","titleSlug":"count-unguarded-cells-in-the-grid"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2258,"title":"Escape the Spreading Fire","titleSlug":"escape-the-spreading-fire"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2259,"title":"Remove Digit From Number to Maximize Result","titleSlug":"remove-digit-from-number-to-maximize-result"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2260,"title":"Minimum Consecutive Cards to Pick Up","titleSlug":"minimum-consecutive-cards-to-pick-up"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2261,"title":"K Divisible Elements Subarrays","titleSlug":"k-divisible-elements-subarrays"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2262,"title":"Total Appeal of A String","titleSlug":"total-appeal-of-a-string"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2263,"title":"Make Array Non-decreasing or Non-increasing","titleSlug":"make-array-non-decreasing-or-non-increasing"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2264,"title":"Largest 3-Same-Digit Number in String","titleSlug":"largest-3-same-digit-number-in-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2265,"title":"Count Nodes Equal to Average of Subtree","titleSlug":"count-nodes-equal-to-average-of-subtree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2266,"title":"Count Number of Texts","titleSlug":"count-number-of-texts"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2267,"title":"Check if There Is a Valid Parentheses String Path","titleSlug":"check-if-there-is-a-valid-parentheses-string-path"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2268,"title":"Minimum Number of Keypresses","titleSlug":"minimum-number-of-keypresses"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2269,"title":"Find the K-Beauty of a Number","titleSlug":"find-the-k-beauty-of-a-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2270,"title":"Number of Ways to Split Array","titleSlug":"number-of-ways-to-split-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2271,"title":"Maximum White Tiles Covered by a Carpet","titleSlug":"maximum-white-tiles-covered-by-a-carpet"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2272,"title":"Substring With Largest Variance","titleSlug":"substring-with-largest-variance"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2273,"title":"Find Resultant Array After Removing Anagrams","titleSlug":"find-resultant-array-after-removing-anagrams"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2274,"title":"Maximum Consecutive Floors Without Special Floors","titleSlug":"maximum-consecutive-floors-without-special-floors"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2275,"title":"Largest Combination With Bitwise AND Greater Than Zero","titleSlug":"largest-combination-with-bitwise-and-greater-than-zero"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2276,"title":"Count Integers in Intervals","titleSlug":"count-integers-in-intervals"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2277,"title":"Closest Node to Path in Tree","titleSlug":"closest-node-to-path-in-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2278,"title":"Percentage of Letter in String","titleSlug":"percentage-of-letter-in-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2279,"title":"Maximum Bags With Full Capacity of Rocks","titleSlug":"maximum-bags-with-full-capacity-of-rocks"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2280,"title":"Minimum Lines to Represent a Line Chart","titleSlug":"minimum-lines-to-represent-a-line-chart"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2281,"title":"Sum of Total Strength of Wizards","titleSlug":"sum-of-total-strength-of-wizards"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2282,"title":"Number of People That Can Be Seen in a Grid","titleSlug":"number-of-people-that-can-be-seen-in-a-grid"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2283,"title":"Check if Number Has Equal Digit Count and Digit Value","titleSlug":"check-if-number-has-equal-digit-count-and-digit-value"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2284,"title":"Sender With Largest Word Count","titleSlug":"sender-with-largest-word-count"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2285,"title":"Maximum Total Importance of Roads","titleSlug":"maximum-total-importance-of-roads"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2286,"title":"Booking Concert Tickets in Groups","titleSlug":"booking-concert-tickets-in-groups"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2287,"title":"Rearrange Characters to Make Target String","titleSlug":"rearrange-characters-to-make-target-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2288,"title":"Apply Discount to Prices","titleSlug":"apply-discount-to-prices"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2289,"title":"Steps to Make Array Non-decreasing","titleSlug":"steps-to-make-array-non-decreasing"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2290,"title":"Minimum Obstacle Removal to Reach Corner","titleSlug":"minimum-obstacle-removal-to-reach-corner"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2291,"title":"Maximum Profit From Trading Stocks","titleSlug":"maximum-profit-from-trading-stocks"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2292,"title":"Products With Three or More Orders in Two Consecutive Years","titleSlug":"products-with-three-or-more-orders-in-two-consecutive-years"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2293,"title":"Min Max Game","titleSlug":"min-max-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2294,"title":"Partition Array Such That Maximum Difference Is K","titleSlug":"partition-array-such-that-maximum-difference-is-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2295,"title":"Replace Elements in an Array","titleSlug":"replace-elements-in-an-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2296,"title":"Design a Text Editor","titleSlug":"design-a-text-editor"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2297,"title":"Jump Game VIII","titleSlug":"jump-game-viii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2298,"title":"Tasks Count in the Weekend","titleSlug":"tasks-count-in-the-weekend"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2299,"title":"Strong Password Checker II","titleSlug":"strong-password-checker-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2300,"title":"Successful Pairs of Spells and Potions","titleSlug":"successful-pairs-of-spells-and-potions"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2301,"title":"Match Substring After Replacement","titleSlug":"match-substring-after-replacement"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2302,"title":"Count Subarrays With Score Less Than K","titleSlug":"count-subarrays-with-score-less-than-k"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2303,"title":"Calculate Amount Paid in Taxes","titleSlug":"calculate-amount-paid-in-taxes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2304,"title":"Minimum Path Cost in a Grid","titleSlug":"minimum-path-cost-in-a-grid"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2305,"title":"Fair Distribution of Cookies","titleSlug":"fair-distribution-of-cookies"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2306,"title":"Naming a Company","titleSlug":"naming-a-company"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2307,"title":"Check for Contradictions in Equations","titleSlug":"check-for-contradictions-in-equations"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2308,"title":"Arrange Table by Gender","titleSlug":"arrange-table-by-gender"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2309,"title":"Greatest English Letter in Upper and Lower Case","titleSlug":"greatest-english-letter-in-upper-and-lower-case"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2310,"title":"Sum of Numbers With Units Digit K","titleSlug":"sum-of-numbers-with-units-digit-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2311,"title":"Longest Binary Subsequence Less Than or Equal to K","titleSlug":"longest-binary-subsequence-less-than-or-equal-to-k"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2312,"title":"Selling Pieces of Wood","titleSlug":"selling-pieces-of-wood"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2313,"title":"Minimum Flips in Binary Tree to Get Result","titleSlug":"minimum-flips-in-binary-tree-to-get-result"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2314,"title":"The First Day of the Maximum Recorded Degree in Each City","titleSlug":"the-first-day-of-the-maximum-recorded-degree-in-each-city"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2315,"title":"Count Asterisks","titleSlug":"count-asterisks"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2316,"title":"Count Unreachable Pairs of Nodes in an Undirected Graph","titleSlug":"count-unreachable-pairs-of-nodes-in-an-undirected-graph"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2317,"title":"Maximum XOR After Operations","titleSlug":"maximum-xor-after-operations"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2318,"title":"Number of Distinct Roll Sequences","titleSlug":"number-of-distinct-roll-sequences"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2319,"title":"Check if Matrix Is X-Matrix","titleSlug":"check-if-matrix-is-x-matrix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2320,"title":"Count Number of Ways to Place Houses","titleSlug":"count-number-of-ways-to-place-houses"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2321,"title":"Maximum Score Of Spliced Array","titleSlug":"maximum-score-of-spliced-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2322,"title":"Minimum Score After Removals on a Tree","titleSlug":"minimum-score-after-removals-on-a-tree"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2323,"title":"Find Minimum Time to Finish All Jobs II","titleSlug":"find-minimum-time-to-finish-all-jobs-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2324,"title":"Product Sales Analysis IV","titleSlug":"product-sales-analysis-iv"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2325,"title":"Decode the Message","titleSlug":"decode-the-message"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2326,"title":"Spiral Matrix IV","titleSlug":"spiral-matrix-iv"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2327,"title":"Number of People Aware of a Secret","titleSlug":"number-of-people-aware-of-a-secret"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2328,"title":"Number of Increasing Paths in a Grid","titleSlug":"number-of-increasing-paths-in-a-grid"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2329,"title":"Product Sales Analysis V","titleSlug":"product-sales-analysis-v"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2330,"title":"Valid Palindrome IV","titleSlug":"valid-palindrome-iv"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2331,"title":"Evaluate Boolean Binary Tree","titleSlug":"evaluate-boolean-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2332,"title":"The Latest Time to Catch a Bus","titleSlug":"the-latest-time-to-catch-a-bus"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2333,"title":"Minimum Sum of Squared Difference","titleSlug":"minimum-sum-of-squared-difference"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2334,"title":"Subarray With Elements Greater Than Varying Threshold","titleSlug":"subarray-with-elements-greater-than-varying-threshold"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2335,"title":"Minimum Amount of Time to Fill Cups","titleSlug":"minimum-amount-of-time-to-fill-cups"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2336,"title":"Smallest Number in Infinite Set","titleSlug":"smallest-number-in-infinite-set"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2337,"title":"Move Pieces to Obtain a String","titleSlug":"move-pieces-to-obtain-a-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2338,"title":"Count the Number of Ideal Arrays","titleSlug":"count-the-number-of-ideal-arrays"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2339,"title":"All the Matches of the League","titleSlug":"all-the-matches-of-the-league"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2340,"title":"Minimum Adjacent Swaps to Make a Valid Array","titleSlug":"minimum-adjacent-swaps-to-make-a-valid-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2341,"title":"Maximum Number of Pairs in Array","titleSlug":"maximum-number-of-pairs-in-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2342,"title":"Max Sum of a Pair With Equal Sum of Digits","titleSlug":"max-sum-of-a-pair-with-equal-sum-of-digits"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2343,"title":"Query Kth Smallest Trimmed Number","titleSlug":"query-kth-smallest-trimmed-number"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2344,"title":"Minimum Deletions to Make Array Divisible","titleSlug":"minimum-deletions-to-make-array-divisible"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2345,"title":"Finding the Number of Visible Mountains","titleSlug":"finding-the-number-of-visible-mountains"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2346,"title":"Compute the Rank as a Percentage","titleSlug":"compute-the-rank-as-a-percentage"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2347,"title":"Best Poker Hand","titleSlug":"best-poker-hand"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2348,"title":"Number of Zero-Filled Subarrays","titleSlug":"number-of-zero-filled-subarrays"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2349,"title":"Design a Number Container System","titleSlug":"design-a-number-container-system"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2350,"title":"Shortest Impossible Sequence of Rolls","titleSlug":"shortest-impossible-sequence-of-rolls"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2351,"title":"First Letter to Appear Twice","titleSlug":"first-letter-to-appear-twice"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2352,"title":"Equal Row and Column Pairs","titleSlug":"equal-row-and-column-pairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2353,"title":"Design a Food Rating System","titleSlug":"design-a-food-rating-system"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2354,"title":"Number of Excellent Pairs","titleSlug":"number-of-excellent-pairs"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2355,"title":"Maximum Number of Books You Can Take","titleSlug":"maximum-number-of-books-you-can-take"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2356,"title":"Number of Unique Subjects Taught by Each Teacher","titleSlug":"number-of-unique-subjects-taught-by-each-teacher"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2357,"title":"Make Array Zero by Subtracting Equal Amounts","titleSlug":"make-array-zero-by-subtracting-equal-amounts"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2358,"title":"Maximum Number of Groups Entering a Competition","titleSlug":"maximum-number-of-groups-entering-a-competition"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2359,"title":"Find Closest Node to Given Two Nodes","titleSlug":"find-closest-node-to-given-two-nodes"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2360,"title":"Longest Cycle in a Graph","titleSlug":"longest-cycle-in-a-graph"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2361,"title":"Minimum Costs Using the Train Line","titleSlug":"minimum-costs-using-the-train-line"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2362,"title":"Generate the Invoice","titleSlug":"generate-the-invoice"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2363,"title":"Merge Similar Items","titleSlug":"merge-similar-items"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2364,"title":"Count Number of Bad Pairs","titleSlug":"count-number-of-bad-pairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2365,"title":"Task Scheduler II","titleSlug":"task-scheduler-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2366,"title":"Minimum Replacements to Sort the Array","titleSlug":"minimum-replacements-to-sort-the-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2367,"title":"Number of Arithmetic Triplets","titleSlug":"number-of-arithmetic-triplets"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2368,"title":"Reachable Nodes With Restrictions","titleSlug":"reachable-nodes-with-restrictions"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2369,"title":"Check if There is a Valid Partition For The Array","titleSlug":"check-if-there-is-a-valid-partition-for-the-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2370,"title":"Longest Ideal Subsequence","titleSlug":"longest-ideal-subsequence"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2371,"title":"Minimize Maximum Value in a Grid","titleSlug":"minimize-maximum-value-in-a-grid"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2372,"title":"Calculate the Influence of Each Salesperson","titleSlug":"calculate-the-influence-of-each-salesperson"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2373,"title":"Largest Local Values in a Matrix","titleSlug":"largest-local-values-in-a-matrix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2374,"title":"Node With Highest Edge Score","titleSlug":"node-with-highest-edge-score"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2375,"title":"Construct Smallest Number From DI String","titleSlug":"construct-smallest-number-from-di-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2376,"title":"Count Special Integers","titleSlug":"count-special-integers"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2377,"title":"Sort the Olympic Table","titleSlug":"sort-the-olympic-table"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2378,"title":"Choose Edges to Maximize Score in a Tree","titleSlug":"choose-edges-to-maximize-score-in-a-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2379,"title":"Minimum Recolors to Get K Consecutive Black Blocks","titleSlug":"minimum-recolors-to-get-k-consecutive-black-blocks"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2380,"title":"Time Needed to Rearrange a Binary String","titleSlug":"time-needed-to-rearrange-a-binary-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2381,"title":"Shifting Letters II","titleSlug":"shifting-letters-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2382,"title":"Maximum Segment Sum After Removals","titleSlug":"maximum-segment-sum-after-removals"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2383,"title":"Minimum Hours of Training to Win a Competition","titleSlug":"minimum-hours-of-training-to-win-a-competition"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2384,"title":"Largest Palindromic Number","titleSlug":"largest-palindromic-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2385,"title":"Amount of Time for Binary Tree to Be Infected","titleSlug":"amount-of-time-for-binary-tree-to-be-infected"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2386,"title":"Find the K-Sum of an Array","titleSlug":"find-the-k-sum-of-an-array"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2387,"title":"Median of a Row Wise Sorted Matrix","titleSlug":"median-of-a-row-wise-sorted-matrix"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2388,"title":"Change Null Values in a Table to the Previous Value","titleSlug":"change-null-values-in-a-table-to-the-previous-value"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2389,"title":"Longest Subsequence With Limited Sum","titleSlug":"longest-subsequence-with-limited-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2390,"title":"Removing Stars From a String","titleSlug":"removing-stars-from-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2391,"title":"Minimum Amount of Time to Collect Garbage","titleSlug":"minimum-amount-of-time-to-collect-garbage"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2392,"title":"Build a Matrix With Conditions","titleSlug":"build-a-matrix-with-conditions"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2393,"title":"Count Strictly Increasing Subarrays","titleSlug":"count-strictly-increasing-subarrays"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2394,"title":"Employees With Deductions","titleSlug":"employees-with-deductions"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2395,"title":"Find Subarrays With Equal Sum","titleSlug":"find-subarrays-with-equal-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2396,"title":"Strictly Palindromic Number","titleSlug":"strictly-palindromic-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2397,"title":"Maximum Rows Covered by Columns","titleSlug":"maximum-rows-covered-by-columns"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2398,"title":"Maximum Number of Robots Within Budget","titleSlug":"maximum-number-of-robots-within-budget"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2399,"title":"Check Distances Between Same Letters","titleSlug":"check-distances-between-same-letters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2400,"title":"Number of Ways to Reach a Position After Exactly k Steps","titleSlug":"number-of-ways-to-reach-a-position-after-exactly-k-steps"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2401,"title":"Longest Nice Subarray","titleSlug":"longest-nice-subarray"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2402,"title":"Meeting Rooms III","titleSlug":"meeting-rooms-iii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2403,"title":"Minimum Time to Kill All Monsters","titleSlug":"minimum-time-to-kill-all-monsters"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2404,"title":"Most Frequent Even Element","titleSlug":"most-frequent-even-element"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2405,"title":"Optimal Partition of String","titleSlug":"optimal-partition-of-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2406,"title":"Divide Intervals Into Minimum Number of Groups","titleSlug":"divide-intervals-into-minimum-number-of-groups"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2407,"title":"Longest Increasing Subsequence II","titleSlug":"longest-increasing-subsequence-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2408,"title":"Design SQL","titleSlug":"design-sql"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2409,"title":"Count Days Spent Together","titleSlug":"count-days-spent-together"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2410,"title":"Maximum Matching of Players With Trainers","titleSlug":"maximum-matching-of-players-with-trainers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2411,"title":"Smallest Subarrays With Maximum Bitwise OR","titleSlug":"smallest-subarrays-with-maximum-bitwise-or"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2412,"title":"Minimum Money Required Before Transactions","titleSlug":"minimum-money-required-before-transactions"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2413,"title":"Smallest Even Multiple","titleSlug":"smallest-even-multiple"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2414,"title":"Length of the Longest Alphabetical Continuous Substring","titleSlug":"length-of-the-longest-alphabetical-continuous-substring"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2415,"title":"Reverse Odd Levels of Binary Tree","titleSlug":"reverse-odd-levels-of-binary-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2416,"title":"Sum of Prefix Scores of Strings","titleSlug":"sum-of-prefix-scores-of-strings"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2417,"title":"Closest Fair Integer","titleSlug":"closest-fair-integer"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2418,"title":"Sort the People","titleSlug":"sort-the-people"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2419,"title":"Longest Subarray With Maximum Bitwise AND","titleSlug":"longest-subarray-with-maximum-bitwise-and"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2420,"title":"Find All Good Indices","titleSlug":"find-all-good-indices"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2421,"title":"Number of Good Paths","titleSlug":"number-of-good-paths"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2422,"title":"Merge Operations to Turn Array Into a Palindrome","titleSlug":"merge-operations-to-turn-array-into-a-palindrome"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2423,"title":"Remove Letter To Equalize Frequency","titleSlug":"remove-letter-to-equalize-frequency"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2424,"title":"Longest Uploaded Prefix","titleSlug":"longest-uploaded-prefix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2425,"title":"Bitwise XOR of All Pairings","titleSlug":"bitwise-xor-of-all-pairings"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2426,"title":"Number of Pairs Satisfying Inequality","titleSlug":"number-of-pairs-satisfying-inequality"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2427,"title":"Number of Common Factors","titleSlug":"number-of-common-factors"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2428,"title":"Maximum Sum of an Hourglass","titleSlug":"maximum-sum-of-an-hourglass"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2429,"title":"Minimize XOR","titleSlug":"minimize-xor"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2430,"title":"Maximum Deletions on a String","titleSlug":"maximum-deletions-on-a-string"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2431,"title":"Maximize Total Tastiness of Purchased Fruits","titleSlug":"maximize-total-tastiness-of-purchased-fruits"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2432,"title":"The Employee That Worked on the Longest Task","titleSlug":"the-employee-that-worked-on-the-longest-task"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2433,"title":"Find The Original Array of Prefix Xor","titleSlug":"find-the-original-array-of-prefix-xor"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2434,"title":"Using a Robot to Print the Lexicographically Smallest String","titleSlug":"using-a-robot-to-print-the-lexicographically-smallest-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2435,"title":"Paths in Matrix Whose Sum Is Divisible by K","titleSlug":"paths-in-matrix-whose-sum-is-divisible-by-k"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2436,"title":"Minimum Split Into Subarrays With GCD Greater Than One","titleSlug":"minimum-split-into-subarrays-with-gcd-greater-than-one"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2437,"title":"Number of Valid Clock Times","titleSlug":"number-of-valid-clock-times"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2438,"title":"Range Product Queries of Powers","titleSlug":"range-product-queries-of-powers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2439,"title":"Minimize Maximum of Array","titleSlug":"minimize-maximum-of-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2440,"title":"Create Components With Same Value","titleSlug":"create-components-with-same-value"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2441,"title":"Largest Positive Integer That Exists With Its Negative","titleSlug":"largest-positive-integer-that-exists-with-its-negative"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2442,"title":"Count Number of Distinct Integers After Reverse Operations","titleSlug":"count-number-of-distinct-integers-after-reverse-operations"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2443,"title":"Sum of Number and Its Reverse","titleSlug":"sum-of-number-and-its-reverse"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2444,"title":"Count Subarrays With Fixed Bounds","titleSlug":"count-subarrays-with-fixed-bounds"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2445,"title":"Number of Nodes With Value One","titleSlug":"number-of-nodes-with-value-one"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2446,"title":"Determine if Two Events Have Conflict","titleSlug":"determine-if-two-events-have-conflict"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2447,"title":"Number of Subarrays With GCD Equal to K","titleSlug":"number-of-subarrays-with-gcd-equal-to-k"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2448,"title":"Minimum Cost to Make Array Equal","titleSlug":"minimum-cost-to-make-array-equal"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2449,"title":"Minimum Number of Operations to Make Arrays Similar","titleSlug":"minimum-number-of-operations-to-make-arrays-similar"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2450,"title":"Number of Distinct Binary Strings After Applying Operations","titleSlug":"number-of-distinct-binary-strings-after-applying-operations"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2451,"title":"Odd String Difference","titleSlug":"odd-string-difference"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2452,"title":"Words Within Two Edits of Dictionary","titleSlug":"words-within-two-edits-of-dictionary"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2453,"title":"Destroy Sequential Targets","titleSlug":"destroy-sequential-targets"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2454,"title":"Next Greater Element IV","titleSlug":"next-greater-element-iv"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2455,"title":"Average Value of Even Numbers That Are Divisible by Three","titleSlug":"average-value-of-even-numbers-that-are-divisible-by-three"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2456,"title":"Most Popular Video Creator","titleSlug":"most-popular-video-creator"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2457,"title":"Minimum Addition to Make Integer Beautiful","titleSlug":"minimum-addition-to-make-integer-beautiful"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2458,"title":"Height of Binary Tree After Subtree Removal Queries","titleSlug":"height-of-binary-tree-after-subtree-removal-queries"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2459,"title":"Sort Array by Moving Items to Empty Space","titleSlug":"sort-array-by-moving-items-to-empty-space"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2460,"title":"Apply Operations to an Array","titleSlug":"apply-operations-to-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2461,"title":"Maximum Sum of Distinct Subarrays With Length K","titleSlug":"maximum-sum-of-distinct-subarrays-with-length-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2462,"title":"Total Cost to Hire K Workers","titleSlug":"total-cost-to-hire-k-workers"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2463,"title":"Minimum Total Distance Traveled","titleSlug":"minimum-total-distance-traveled"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2464,"title":"Minimum Subarrays in a Valid Split","titleSlug":"minimum-subarrays-in-a-valid-split"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2465,"title":"Number of Distinct Averages","titleSlug":"number-of-distinct-averages"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2466,"title":"Count Ways To Build Good Strings","titleSlug":"count-ways-to-build-good-strings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2467,"title":"Most Profitable Path in a Tree","titleSlug":"most-profitable-path-in-a-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2468,"title":"Split Message Based on Limit","titleSlug":"split-message-based-on-limit"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2469,"title":"Convert the Temperature","titleSlug":"convert-the-temperature"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2470,"title":"Number of Subarrays With LCM Equal to K","titleSlug":"number-of-subarrays-with-lcm-equal-to-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2471,"title":"Minimum Number of Operations to Sort a Binary Tree by Level","titleSlug":"minimum-number-of-operations-to-sort-a-binary-tree-by-level"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2472,"title":"Maximum Number of Non-overlapping Palindrome Substrings","titleSlug":"maximum-number-of-non-overlapping-palindrome-substrings"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2473,"title":"Minimum Cost to Buy Apples","titleSlug":"minimum-cost-to-buy-apples"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2474,"title":"Customers With Strictly Increasing Purchases","titleSlug":"customers-with-strictly-increasing-purchases"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2475,"title":"Number of Unequal Triplets in Array","titleSlug":"number-of-unequal-triplets-in-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2476,"title":"Closest Nodes Queries in a Binary Search Tree","titleSlug":"closest-nodes-queries-in-a-binary-search-tree"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2477,"title":"Minimum Fuel Cost to Report to the Capital","titleSlug":"minimum-fuel-cost-to-report-to-the-capital"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2478,"title":"Number of Beautiful Partitions","titleSlug":"number-of-beautiful-partitions"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2479,"title":"Maximum XOR of Two Non-Overlapping Subtrees","titleSlug":"maximum-xor-of-two-non-overlapping-subtrees"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2480,"title":"Form a Chemical Bond","titleSlug":"form-a-chemical-bond"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2481,"title":"Minimum Cuts to Divide a Circle","titleSlug":"minimum-cuts-to-divide-a-circle"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2482,"title":"Difference Between Ones and Zeros in Row and Column","titleSlug":"difference-between-ones-and-zeros-in-row-and-column"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2483,"title":"Minimum Penalty for a Shop","titleSlug":"minimum-penalty-for-a-shop"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2484,"title":"Count Palindromic Subsequences","titleSlug":"count-palindromic-subsequences"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2485,"title":"Find the Pivot Integer","titleSlug":"find-the-pivot-integer"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2486,"title":"Append Characters to String to Make Subsequence","titleSlug":"append-characters-to-string-to-make-subsequence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2487,"title":"Remove Nodes From Linked List","titleSlug":"remove-nodes-from-linked-list"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2488,"title":"Count Subarrays With Median K","titleSlug":"count-subarrays-with-median-k"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2489,"title":"Number of Substrings With Fixed Ratio","titleSlug":"number-of-substrings-with-fixed-ratio"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2490,"title":"Circular Sentence","titleSlug":"circular-sentence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2491,"title":"Divide Players Into Teams of Equal Skill","titleSlug":"divide-players-into-teams-of-equal-skill"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2492,"title":"Minimum Score of a Path Between Two Cities","titleSlug":"minimum-score-of-a-path-between-two-cities"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2493,"title":"Divide Nodes Into the Maximum Number of Groups","titleSlug":"divide-nodes-into-the-maximum-number-of-groups"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2494,"title":"Merge Overlapping Events in the Same Hall","titleSlug":"merge-overlapping-events-in-the-same-hall"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2495,"title":"Number of Subarrays Having Even Product","titleSlug":"number-of-subarrays-having-even-product"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2496,"title":"Maximum Value of a String in an Array","titleSlug":"maximum-value-of-a-string-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2497,"title":"Maximum Star Sum of a Graph","titleSlug":"maximum-star-sum-of-a-graph"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2498,"title":"Frog Jump II","titleSlug":"frog-jump-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2499,"title":"Minimum Total Cost to Make Arrays Unequal","titleSlug":"minimum-total-cost-to-make-arrays-unequal"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2500,"title":"Delete Greatest Value in Each Row","titleSlug":"delete-greatest-value-in-each-row"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2501,"title":"Longest Square Streak in an Array","titleSlug":"longest-square-streak-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2502,"title":"Design Memory Allocator","titleSlug":"design-memory-allocator"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2503,"title":"Maximum Number of Points From Grid Queries","titleSlug":"maximum-number-of-points-from-grid-queries"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2504,"title":"Concatenate the Name and the Profession","titleSlug":"concatenate-the-name-and-the-profession"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2505,"title":"Bitwise OR of All Subsequence Sums","titleSlug":"bitwise-or-of-all-subsequence-sums"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2506,"title":"Count Pairs Of Similar Strings","titleSlug":"count-pairs-of-similar-strings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2507,"title":"Smallest Value After Replacing With Sum of Prime Factors","titleSlug":"smallest-value-after-replacing-with-sum-of-prime-factors"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2508,"title":"Add Edges to Make Degrees of All Nodes Even","titleSlug":"add-edges-to-make-degrees-of-all-nodes-even"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2509,"title":"Cycle Length Queries in a Tree","titleSlug":"cycle-length-queries-in-a-tree"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2510,"title":"Check if There is a Path With Equal Number of 0's And 1's","titleSlug":"check-if-there-is-a-path-with-equal-number-of-0s-and-1s"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2511,"title":"Maximum Enemy Forts That Can Be Captured","titleSlug":"maximum-enemy-forts-that-can-be-captured"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2512,"title":"Reward Top K Students","titleSlug":"reward-top-k-students"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2513,"title":"Minimize the Maximum of Two Arrays","titleSlug":"minimize-the-maximum-of-two-arrays"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2514,"title":"Count Anagrams","titleSlug":"count-anagrams"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2515,"title":"Shortest Distance to Target String in a Circular Array","titleSlug":"shortest-distance-to-target-string-in-a-circular-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2516,"title":"Take K of Each Character From Left and Right","titleSlug":"take-k-of-each-character-from-left-and-right"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2517,"title":"Maximum Tastiness of Candy Basket","titleSlug":"maximum-tastiness-of-candy-basket"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2518,"title":"Number of Great Partitions","titleSlug":"number-of-great-partitions"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2519,"title":"Count the Number of K-Big Indices","titleSlug":"count-the-number-of-k-big-indices"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2520,"title":"Count the Digits That Divide a Number","titleSlug":"count-the-digits-that-divide-a-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2521,"title":"Distinct Prime Factors of Product of Array","titleSlug":"distinct-prime-factors-of-product-of-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2522,"title":"Partition String Into Substrings With Values at Most K","titleSlug":"partition-string-into-substrings-with-values-at-most-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2523,"title":"Closest Prime Numbers in Range","titleSlug":"closest-prime-numbers-in-range"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2524,"title":"Maximum Frequency Score of a Subarray","titleSlug":"maximum-frequency-score-of-a-subarray"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2525,"title":"Categorize Box According to Criteria","titleSlug":"categorize-box-according-to-criteria"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2526,"title":"Find Consecutive Integers from a Data Stream","titleSlug":"find-consecutive-integers-from-a-data-stream"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2527,"title":"Find Xor-Beauty of Array","titleSlug":"find-xor-beauty-of-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2528,"title":"Maximize the Minimum Powered City","titleSlug":"maximize-the-minimum-powered-city"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2529,"title":"Maximum Count of Positive Integer and Negative Integer","titleSlug":"maximum-count-of-positive-integer-and-negative-integer"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2530,"title":"Maximal Score After Applying K Operations","titleSlug":"maximal-score-after-applying-k-operations"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2531,"title":"Make Number of Distinct Characters Equal","titleSlug":"make-number-of-distinct-characters-equal"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2532,"title":"Time to Cross a Bridge","titleSlug":"time-to-cross-a-bridge"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2533,"title":"Number of Good Binary Strings","titleSlug":"number-of-good-binary-strings"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2534,"title":"Time Taken to Cross the Door","titleSlug":"time-taken-to-cross-the-door"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2535,"title":"Difference Between Element Sum and Digit Sum of an Array","titleSlug":"difference-between-element-sum-and-digit-sum-of-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2536,"title":"Increment Submatrices by One","titleSlug":"increment-submatrices-by-one"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2537,"title":"Count the Number of Good Subarrays","titleSlug":"count-the-number-of-good-subarrays"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2538,"title":"Difference Between Maximum and Minimum Price Sum","titleSlug":"difference-between-maximum-and-minimum-price-sum"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2539,"title":"Count the Number of Good Subsequences","titleSlug":"count-the-number-of-good-subsequences"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2540,"title":"Minimum Common Value","titleSlug":"minimum-common-value"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2541,"title":"Minimum Operations to Make Array Equal II","titleSlug":"minimum-operations-to-make-array-equal-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2542,"title":"Maximum Subsequence Score","titleSlug":"maximum-subsequence-score"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2543,"title":"Check if Point Is Reachable","titleSlug":"check-if-point-is-reachable"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2544,"title":"Alternating Digit Sum","titleSlug":"alternating-digit-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2545,"title":"Sort the Students by Their Kth Score","titleSlug":"sort-the-students-by-their-kth-score"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2546,"title":"Apply Bitwise Operations to Make Strings Equal","titleSlug":"apply-bitwise-operations-to-make-strings-equal"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2547,"title":"Minimum Cost to Split an Array","titleSlug":"minimum-cost-to-split-an-array"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2548,"title":"Maximum Price to Fill a Bag","titleSlug":"maximum-price-to-fill-a-bag"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2549,"title":"Count Distinct Numbers on Board","titleSlug":"count-distinct-numbers-on-board"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2550,"title":"Count Collisions of Monkeys on a Polygon","titleSlug":"count-collisions-of-monkeys-on-a-polygon"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2551,"title":"Put Marbles in Bags","titleSlug":"put-marbles-in-bags"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2552,"title":"Count Increasing Quadruplets","titleSlug":"count-increasing-quadruplets"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2553,"title":"Separate the Digits in an Array","titleSlug":"separate-the-digits-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2554,"title":"Maximum Number of Integers to Choose From a Range I","titleSlug":"maximum-number-of-integers-to-choose-from-a-range-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2555,"title":"Maximize Win From Two Segments","titleSlug":"maximize-win-from-two-segments"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2556,"title":"Disconnect Path in a Binary Matrix by at Most One Flip","titleSlug":"disconnect-path-in-a-binary-matrix-by-at-most-one-flip"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2557,"title":"Maximum Number of Integers to Choose From a Range II","titleSlug":"maximum-number-of-integers-to-choose-from-a-range-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2558,"title":"Take Gifts From the Richest Pile","titleSlug":"take-gifts-from-the-richest-pile"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2559,"title":"Count Vowel Strings in Ranges","titleSlug":"count-vowel-strings-in-ranges"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2560,"title":"House Robber IV","titleSlug":"house-robber-iv"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2561,"title":"Rearranging Fruits","titleSlug":"rearranging-fruits"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2562,"title":"Find the Array Concatenation Value","titleSlug":"find-the-array-concatenation-value"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2563,"title":"Count the Number of Fair Pairs","titleSlug":"count-the-number-of-fair-pairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2564,"title":"Substring XOR Queries","titleSlug":"substring-xor-queries"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2565,"title":"Subsequence With the Minimum Score","titleSlug":"subsequence-with-the-minimum-score"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2566,"title":"Maximum Difference by Remapping a Digit","titleSlug":"maximum-difference-by-remapping-a-digit"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2567,"title":"Minimum Score by Changing Two Elements","titleSlug":"minimum-score-by-changing-two-elements"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2568,"title":"Minimum Impossible OR","titleSlug":"minimum-impossible-or"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2569,"title":"Handling Sum Queries After Update","titleSlug":"handling-sum-queries-after-update"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2570,"title":"Merge Two 2D Arrays by Summing Values","titleSlug":"merge-two-2d-arrays-by-summing-values"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2571,"title":"Minimum Operations to Reduce an Integer to 0","titleSlug":"minimum-operations-to-reduce-an-integer-to-0"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2572,"title":"Count the Number of Square-Free Subsets","titleSlug":"count-the-number-of-square-free-subsets"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2573,"title":"Find the String with LCP","titleSlug":"find-the-string-with-lcp"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2574,"title":"Left and Right Sum Differences","titleSlug":"left-and-right-sum-differences"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2575,"title":"Find the Divisibility Array of a String","titleSlug":"find-the-divisibility-array-of-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2576,"title":"Find the Maximum Number of Marked Indices","titleSlug":"find-the-maximum-number-of-marked-indices"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2577,"title":"Minimum Time to Visit a Cell In a Grid","titleSlug":"minimum-time-to-visit-a-cell-in-a-grid"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2578,"title":"Split With Minimum Sum","titleSlug":"split-with-minimum-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2579,"title":"Count Total Number of Colored Cells","titleSlug":"count-total-number-of-colored-cells"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2580,"title":"Count Ways to Group Overlapping Ranges","titleSlug":"count-ways-to-group-overlapping-ranges"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2581,"title":"Count Number of Possible Root Nodes","titleSlug":"count-number-of-possible-root-nodes"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2582,"title":"Pass the Pillow","titleSlug":"pass-the-pillow"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2583,"title":"Kth Largest Sum in a Binary Tree","titleSlug":"kth-largest-sum-in-a-binary-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2584,"title":"Split the Array to Make Coprime Products","titleSlug":"split-the-array-to-make-coprime-products"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2585,"title":"Number of Ways to Earn Points","titleSlug":"number-of-ways-to-earn-points"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2586,"title":"Count the Number of Vowel Strings in Range","titleSlug":"count-the-number-of-vowel-strings-in-range"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2587,"title":"Rearrange Array to Maximize Prefix Score","titleSlug":"rearrange-array-to-maximize-prefix-score"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2588,"title":"Count the Number of Beautiful Subarrays","titleSlug":"count-the-number-of-beautiful-subarrays"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2589,"title":"Minimum Time to Complete All Tasks","titleSlug":"minimum-time-to-complete-all-tasks"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2590,"title":"Design a Todo List","titleSlug":"design-a-todo-list"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2591,"title":"Distribute Money to Maximum Children","titleSlug":"distribute-money-to-maximum-children"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2592,"title":"Maximize Greatness of an Array","titleSlug":"maximize-greatness-of-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2593,"title":"Find Score of an Array After Marking All Elements","titleSlug":"find-score-of-an-array-after-marking-all-elements"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2594,"title":"Minimum Time to Repair Cars","titleSlug":"minimum-time-to-repair-cars"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2595,"title":"Number of Even and Odd Bits","titleSlug":"number-of-even-and-odd-bits"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2596,"title":"Check Knight Tour Configuration","titleSlug":"check-knight-tour-configuration"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2597,"title":"The Number of Beautiful Subsets","titleSlug":"the-number-of-beautiful-subsets"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2598,"title":"Smallest Missing Non-negative Integer After Operations","titleSlug":"smallest-missing-non-negative-integer-after-operations"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2599,"title":"Make the Prefix Sum Non-negative","titleSlug":"make-the-prefix-sum-non-negative"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2600,"title":"K Items With the Maximum Sum","titleSlug":"k-items-with-the-maximum-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2601,"title":"Prime Subtraction Operation","titleSlug":"prime-subtraction-operation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2602,"title":"Minimum Operations to Make All Array Elements Equal","titleSlug":"minimum-operations-to-make-all-array-elements-equal"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2603,"title":"Collect Coins in a Tree","titleSlug":"collect-coins-in-a-tree"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2604,"title":"Minimum Time to Eat All Grains","titleSlug":"minimum-time-to-eat-all-grains"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2605,"title":"Form Smallest Number From Two Digit Arrays","titleSlug":"form-smallest-number-from-two-digit-arrays"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2606,"title":"Find the Substring With Maximum Cost","titleSlug":"find-the-substring-with-maximum-cost"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2607,"title":"Make K-Subarray Sums Equal","titleSlug":"make-k-subarray-sums-equal"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2608,"title":"Shortest Cycle in a Graph","titleSlug":"shortest-cycle-in-a-graph"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2609,"title":"Find the Longest Balanced Substring of a Binary String","titleSlug":"find-the-longest-balanced-substring-of-a-binary-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2610,"title":"Convert an Array Into a 2D Array With Conditions","titleSlug":"convert-an-array-into-a-2d-array-with-conditions"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2611,"title":"Mice and Cheese","titleSlug":"mice-and-cheese"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2612,"title":"Minimum Reverse Operations","titleSlug":"minimum-reverse-operations"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2613,"title":"Beautiful Pairs","titleSlug":"beautiful-pairs"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2614,"title":"Prime In Diagonal","titleSlug":"prime-in-diagonal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2615,"title":"Sum of Distances","titleSlug":"sum-of-distances"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2616,"title":"Minimize the Maximum Difference of Pairs","titleSlug":"minimize-the-maximum-difference-of-pairs"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2617,"title":"Minimum Number of Visited Cells in a Grid","titleSlug":"minimum-number-of-visited-cells-in-a-grid"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2618,"title":"Check if Object Instance of Class","titleSlug":"check-if-object-instance-of-class"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2619,"title":"Array Prototype Last","titleSlug":"array-prototype-last"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2620,"title":"Counter","titleSlug":"counter"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2621,"title":"Sleep","titleSlug":"sleep"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2622,"title":"Cache With Time Limit","titleSlug":"cache-with-time-limit"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2623,"title":"Memoize","titleSlug":"memoize"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2624,"title":"Snail Traversal","titleSlug":"snail-traversal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2625,"title":"Flatten Deeply Nested Array","titleSlug":"flatten-deeply-nested-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2626,"title":"Array Reduce Transformation","titleSlug":"array-reduce-transformation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2627,"title":"Debounce","titleSlug":"debounce"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2628,"title":"JSON Deep Equal","titleSlug":"json-deep-equal"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2629,"title":"Function Composition","titleSlug":"function-composition"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2630,"title":"Memoize II","titleSlug":"memoize-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2631,"title":"Group By","titleSlug":"group-by"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2632,"title":"Curry","titleSlug":"curry"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2633,"title":"Convert Object to JSON String","titleSlug":"convert-object-to-json-string"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2634,"title":"Filter Elements from Array","titleSlug":"filter-elements-from-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2635,"title":"Apply Transform Over Each Element in Array","titleSlug":"apply-transform-over-each-element-in-array"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2636,"title":"Promise Pool","titleSlug":"promise-pool"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2637,"title":"Promise Time Limit","titleSlug":"promise-time-limit"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2638,"title":"Count the Number of K-Free Subsets","titleSlug":"count-the-number-of-k-free-subsets"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2639,"title":"Find the Width of Columns of a Grid","titleSlug":"find-the-width-of-columns-of-a-grid"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2640,"title":"Find the Score of All Prefixes of an Array","titleSlug":"find-the-score-of-all-prefixes-of-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2641,"title":"Cousins in Binary Tree II","titleSlug":"cousins-in-binary-tree-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2642,"title":"Design Graph With Shortest Path Calculator","titleSlug":"design-graph-with-shortest-path-calculator"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2643,"title":"Row With Maximum Ones","titleSlug":"row-with-maximum-ones"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2644,"title":"Find the Maximum Divisibility Score","titleSlug":"find-the-maximum-divisibility-score"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2645,"title":"Minimum Additions to Make Valid String","titleSlug":"minimum-additions-to-make-valid-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2646,"title":"Minimize the Total Price of the Trips","titleSlug":"minimize-the-total-price-of-the-trips"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2647,"title":"Color the Triangle Red","titleSlug":"color-the-triangle-red"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2648,"title":"Generate Fibonacci Sequence","titleSlug":"generate-fibonacci-sequence"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2649,"title":"Nested Array Generator","titleSlug":"nested-array-generator"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2650,"title":"Design Cancellable Function","titleSlug":"design-cancellable-function"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2651,"title":"Calculate Delayed Arrival Time","titleSlug":"calculate-delayed-arrival-time"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2652,"title":"Sum Multiples","titleSlug":"sum-multiples"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2653,"title":"Sliding Subarray Beauty","titleSlug":"sliding-subarray-beauty"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2654,"title":"Minimum Number of Operations to Make All Array Elements Equal to 1","titleSlug":"minimum-number-of-operations-to-make-all-array-elements-equal-to-1"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2655,"title":"Find Maximal Uncovered Ranges","titleSlug":"find-maximal-uncovered-ranges"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2656,"title":"Maximum Sum With Exactly K Elements","titleSlug":"maximum-sum-with-exactly-k-elements"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2657,"title":"Find the Prefix Common Array of Two Arrays","titleSlug":"find-the-prefix-common-array-of-two-arrays"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2658,"title":"Maximum Number of Fish in a Grid","titleSlug":"maximum-number-of-fish-in-a-grid"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2659,"title":"Make Array Empty","titleSlug":"make-array-empty"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2660,"title":"Determine the Winner of a Bowling Game","titleSlug":"determine-the-winner-of-a-bowling-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2661,"title":"First Completely Painted Row or Column","titleSlug":"first-completely-painted-row-or-column"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2662,"title":"Minimum Cost of a Path With Special Roads","titleSlug":"minimum-cost-of-a-path-with-special-roads"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2663,"title":"Lexicographically Smallest Beautiful String","titleSlug":"lexicographically-smallest-beautiful-string"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2664,"title":"The Knight’s Tour","titleSlug":"the-knights-tour"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2665,"title":"Counter II","titleSlug":"counter-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2666,"title":"Allow One Function Call","titleSlug":"allow-one-function-call"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2667,"title":"Create Hello World Function","titleSlug":"create-hello-world-function"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2668,"title":"Find Latest Salaries","titleSlug":"find-latest-salaries"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2669,"title":"Count Artist Occurrences On Spotify Ranking List","titleSlug":"count-artist-occurrences-on-spotify-ranking-list"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2670,"title":"Find the Distinct Difference Array","titleSlug":"find-the-distinct-difference-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2671,"title":"Frequency Tracker","titleSlug":"frequency-tracker"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2672,"title":"Number of Adjacent Elements With the Same Color","titleSlug":"number-of-adjacent-elements-with-the-same-color"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2673,"title":"Make Costs of Paths Equal in a Binary Tree","titleSlug":"make-costs-of-paths-equal-in-a-binary-tree"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2674,"title":"Split a Circular Linked List","titleSlug":"split-a-circular-linked-list"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2675,"title":"Array of Objects to Matrix","titleSlug":"array-of-objects-to-matrix"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2676,"title":"Throttle","titleSlug":"throttle"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2677,"title":"Chunk Array","titleSlug":"chunk-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2678,"title":"Number of Senior Citizens","titleSlug":"number-of-senior-citizens"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2679,"title":"Sum in a Matrix","titleSlug":"sum-in-a-matrix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2680,"title":"Maximum OR","titleSlug":"maximum-or"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2681,"title":"Power of Heroes","titleSlug":"power-of-heroes"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2682,"title":"Find the Losers of the Circular Game","titleSlug":"find-the-losers-of-the-circular-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2683,"title":"Neighboring Bitwise XOR","titleSlug":"neighboring-bitwise-xor"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2684,"title":"Maximum Number of Moves in a Grid","titleSlug":"maximum-number-of-moves-in-a-grid"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2685,"title":"Count the Number of Complete Components","titleSlug":"count-the-number-of-complete-components"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2686,"title":"Immediate Food Delivery III","titleSlug":"immediate-food-delivery-iii"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2687,"title":"Bikes Last Time Used","titleSlug":"bikes-last-time-used"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2688,"title":"Find Active Users","titleSlug":"find-active-users"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2689,"title":"Extract Kth Character From The Rope Tree","titleSlug":"extract-kth-character-from-the-rope-tree"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2690,"title":"Infinite Method Object","titleSlug":"infinite-method-object"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2691,"title":"Immutability Helper","titleSlug":"immutability-helper"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2692,"title":"Make Object Immutable","titleSlug":"make-object-immutable"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2693,"title":"Call Function with Custom Context","titleSlug":"call-function-with-custom-context"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2694,"title":"Event Emitter","titleSlug":"event-emitter"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2695,"title":"Array Wrapper","titleSlug":"array-wrapper"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2696,"title":"Minimum String Length After Removing Substrings","titleSlug":"minimum-string-length-after-removing-substrings"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2697,"title":"Lexicographically Smallest Palindrome","titleSlug":"lexicographically-smallest-palindrome"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2698,"title":"Find the Punishment Number of an Integer","titleSlug":"find-the-punishment-number-of-an-integer"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2699,"title":"Modify Graph Edge Weights","titleSlug":"modify-graph-edge-weights"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2700,"title":"Differences Between Two Objects","titleSlug":"differences-between-two-objects"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2701,"title":"Consecutive Transactions with Increasing Amounts","titleSlug":"consecutive-transactions-with-increasing-amounts"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2702,"title":"Minimum Operations to Make Numbers Non-positive","titleSlug":"minimum-operations-to-make-numbers-non-positive"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2703,"title":"Return Length of Arguments Passed","titleSlug":"return-length-of-arguments-passed"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2704,"title":"To Be Or Not To Be","titleSlug":"to-be-or-not-to-be"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2705,"title":"Compact Object","titleSlug":"compact-object"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2706,"title":"Buy Two Chocolates","titleSlug":"buy-two-chocolates"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2707,"title":"Extra Characters in a String","titleSlug":"extra-characters-in-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2708,"title":"Maximum Strength of a Group","titleSlug":"maximum-strength-of-a-group"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2709,"title":"Greatest Common Divisor Traversal","titleSlug":"greatest-common-divisor-traversal"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2710,"title":"Remove Trailing Zeros From a String","titleSlug":"remove-trailing-zeros-from-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2711,"title":"Difference of Number of Distinct Values on Diagonals","titleSlug":"difference-of-number-of-distinct-values-on-diagonals"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2712,"title":"Minimum Cost to Make All Characters Equal","titleSlug":"minimum-cost-to-make-all-characters-equal"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2713,"title":"Maximum Strictly Increasing Cells in a Matrix","titleSlug":"maximum-strictly-increasing-cells-in-a-matrix"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2714,"title":"Find Shortest Path with K Hops","titleSlug":"find-shortest-path-with-k-hops"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2715,"title":"Timeout Cancellation","titleSlug":"timeout-cancellation"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2716,"title":"Minimize String Length","titleSlug":"minimize-string-length"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2717,"title":"Semi-Ordered Permutation","titleSlug":"semi-ordered-permutation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2718,"title":"Sum of Matrix After Queries","titleSlug":"sum-of-matrix-after-queries"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2719,"title":"Count of Integers","titleSlug":"count-of-integers"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2720,"title":"Popularity Percentage","titleSlug":"popularity-percentage"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2721,"title":"Execute Asynchronous Functions in Parallel","titleSlug":"execute-asynchronous-functions-in-parallel"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2722,"title":"Join Two Arrays by ID","titleSlug":"join-two-arrays-by-id"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2723,"title":"Add Two Promises","titleSlug":"add-two-promises"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2724,"title":"Sort By","titleSlug":"sort-by"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2725,"title":"Interval Cancellation","titleSlug":"interval-cancellation"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2726,"title":"Calculator with Method Chaining","titleSlug":"calculator-with-method-chaining"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2727,"title":"Is Object Empty","titleSlug":"is-object-empty"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2728,"title":"Count Houses in a Circular Street","titleSlug":"count-houses-in-a-circular-street"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2729,"title":"Check if The Number is Fascinating","titleSlug":"check-if-the-number-is-fascinating"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2730,"title":"Find the Longest Semi-Repetitive Substring","titleSlug":"find-the-longest-semi-repetitive-substring"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2731,"title":"Movement of Robots","titleSlug":"movement-of-robots"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2732,"title":"Find a Good Subset of the Matrix","titleSlug":"find-a-good-subset-of-the-matrix"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2733,"title":"Neither Minimum nor Maximum","titleSlug":"neither-minimum-nor-maximum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2734,"title":"Lexicographically Smallest String After Substring Operation","titleSlug":"lexicographically-smallest-string-after-substring-operation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2735,"title":"Collecting Chocolates","titleSlug":"collecting-chocolates"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2736,"title":"Maximum Sum Queries","titleSlug":"maximum-sum-queries"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2737,"title":"Find the Closest Marked Node","titleSlug":"find-the-closest-marked-node"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2738,"title":"Count Occurrences in Text","titleSlug":"count-occurrences-in-text"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2739,"title":"Total Distance Traveled","titleSlug":"total-distance-traveled"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2740,"title":"Find the Value of the Partition","titleSlug":"find-the-value-of-the-partition"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2741,"title":"Special Permutations","titleSlug":"special-permutations"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2742,"title":"Painting the Walls","titleSlug":"painting-the-walls"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2743,"title":"Count Substrings Without Repeating Character","titleSlug":"count-substrings-without-repeating-character"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2744,"title":"Find Maximum Number of String Pairs","titleSlug":"find-maximum-number-of-string-pairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2745,"title":"Construct the Longest New String","titleSlug":"construct-the-longest-new-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2746,"title":"Decremental String Concatenation","titleSlug":"decremental-string-concatenation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2747,"title":"Count Zero Request Servers","titleSlug":"count-zero-request-servers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2748,"title":"Number of Beautiful Pairs","titleSlug":"number-of-beautiful-pairs"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2749,"title":"Minimum Operations to Make the Integer Zero","titleSlug":"minimum-operations-to-make-the-integer-zero"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2750,"title":"Ways to Split Array Into Good Subarrays","titleSlug":"ways-to-split-array-into-good-subarrays"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2751,"title":"Robot Collisions","titleSlug":"robot-collisions"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2752,"title":"Customers with Maximum Number of Transactions on Consecutive Days","titleSlug":"customers-with-maximum-number-of-transactions-on-consecutive-days"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2753,"title":"Count Houses in a Circular Street II","titleSlug":"count-houses-in-a-circular-street-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2754,"title":"Bind Function to Context","titleSlug":"bind-function-to-context"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2755,"title":"Deep Merge of Two Objects","titleSlug":"deep-merge-of-two-objects"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2756,"title":"Query Batching","titleSlug":"query-batching"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2757,"title":"Generate Circular Array Values","titleSlug":"generate-circular-array-values"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2758,"title":"Next Day","titleSlug":"next-day"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2759,"title":"Convert JSON String to Object","titleSlug":"convert-json-string-to-object"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2760,"title":"Longest Even Odd Subarray With Threshold","titleSlug":"longest-even-odd-subarray-with-threshold"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2761,"title":"Prime Pairs With Target Sum","titleSlug":"prime-pairs-with-target-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2762,"title":"Continuous Subarrays","titleSlug":"continuous-subarrays"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2763,"title":"Sum of Imbalance Numbers of All Subarrays","titleSlug":"sum-of-imbalance-numbers-of-all-subarrays"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2764,"title":"Is Array a Preorder of Some ‌Binary Tree","titleSlug":"is-array-a-preorder-of-some-binary-tree"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2765,"title":"Longest Alternating Subarray","titleSlug":"longest-alternating-subarray"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2766,"title":"Relocate Marbles","titleSlug":"relocate-marbles"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2767,"title":"Partition String Into Minimum Beautiful Substrings","titleSlug":"partition-string-into-minimum-beautiful-substrings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2768,"title":"Number of Black Blocks","titleSlug":"number-of-black-blocks"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2769,"title":"Find the Maximum Achievable Number","titleSlug":"find-the-maximum-achievable-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2770,"title":"Maximum Number of Jumps to Reach the Last Index","titleSlug":"maximum-number-of-jumps-to-reach-the-last-index"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2771,"title":"Longest Non-decreasing Subarray From Two Arrays","titleSlug":"longest-non-decreasing-subarray-from-two-arrays"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2772,"title":"Apply Operations to Make All Array Elements Equal to Zero","titleSlug":"apply-operations-to-make-all-array-elements-equal-to-zero"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2773,"title":"Height of Special Binary Tree","titleSlug":"height-of-special-binary-tree"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2774,"title":"Array Upper Bound","titleSlug":"array-upper-bound"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2775,"title":"Undefined to Null","titleSlug":"undefined-to-null"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2776,"title":"Convert Callback Based Function to Promise Based Function","titleSlug":"convert-callback-based-function-to-promise-based-function"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2777,"title":"Date Range Generator","titleSlug":"date-range-generator"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2778,"title":"Sum of Squares of Special Elements","titleSlug":"sum-of-squares-of-special-elements"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2779,"title":"Maximum Beauty of an Array After Applying Operation","titleSlug":"maximum-beauty-of-an-array-after-applying-operation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2780,"title":"Minimum Index of a Valid Split","titleSlug":"minimum-index-of-a-valid-split"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2781,"title":"Length of the Longest Valid Substring","titleSlug":"length-of-the-longest-valid-substring"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2782,"title":"Number of Unique Categories","titleSlug":"number-of-unique-categories"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2783,"title":"Flight Occupancy and Waitlist Analysis","titleSlug":"flight-occupancy-and-waitlist-analysis"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2784,"title":"Check if Array is Good","titleSlug":"check-if-array-is-good"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2785,"title":"Sort Vowels in a String","titleSlug":"sort-vowels-in-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2786,"title":"Visit Array Positions to Maximize Score","titleSlug":"visit-array-positions-to-maximize-score"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2787,"title":"Ways to Express an Integer as Sum of Powers","titleSlug":"ways-to-express-an-integer-as-sum-of-powers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2788,"title":"Split Strings by Separator","titleSlug":"split-strings-by-separator"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2789,"title":"Largest Element in an Array after Merge Operations","titleSlug":"largest-element-in-an-array-after-merge-operations"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2790,"title":"Maximum Number of Groups With Increasing Length","titleSlug":"maximum-number-of-groups-with-increasing-length"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2791,"title":"Count Paths That Can Form a Palindrome in a Tree","titleSlug":"count-paths-that-can-form-a-palindrome-in-a-tree"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2792,"title":"Count Nodes That Are Great Enough","titleSlug":"count-nodes-that-are-great-enough"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2793,"title":"Status of Flight Tickets","titleSlug":"status-of-flight-tickets"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2794,"title":"Create Object from Two Arrays","titleSlug":"create-object-from-two-arrays"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2795,"title":"Parallel Execution of Promises for Individual Results Retrieval","titleSlug":"parallel-execution-of-promises-for-individual-results-retrieval"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2796,"title":"Repeat String","titleSlug":"repeat-string"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2797,"title":"Partial Function with Placeholders","titleSlug":"partial-function-with-placeholders"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2798,"title":"Number of Employees Who Met the Target","titleSlug":"number-of-employees-who-met-the-target"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2799,"title":"Count Complete Subarrays in an Array","titleSlug":"count-complete-subarrays-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2800,"title":"Shortest String That Contains Three Strings","titleSlug":"shortest-string-that-contains-three-strings"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2801,"title":"Count Stepping Numbers in Range","titleSlug":"count-stepping-numbers-in-range"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2802,"title":"Find The K-th Lucky Number","titleSlug":"find-the-k-th-lucky-number"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2803,"title":"Factorial Generator","titleSlug":"factorial-generator"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2804,"title":"Array Prototype ForEach","titleSlug":"array-prototype-foreach"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2805,"title":"Custom Interval","titleSlug":"custom-interval"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2806,"title":"Account Balance After Rounded Purchase","titleSlug":"account-balance-after-rounded-purchase"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2807,"title":"Insert Greatest Common Divisors in Linked List","titleSlug":"insert-greatest-common-divisors-in-linked-list"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2808,"title":"Minimum Seconds to Equalize a Circular Array","titleSlug":"minimum-seconds-to-equalize-a-circular-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2809,"title":"Minimum Time to Make Array Sum At Most x","titleSlug":"minimum-time-to-make-array-sum-at-most-x"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2810,"title":"Faulty Keyboard","titleSlug":"faulty-keyboard"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2811,"title":"Check if it is Possible to Split Array","titleSlug":"check-if-it-is-possible-to-split-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2812,"title":"Find the Safest Path in a Grid","titleSlug":"find-the-safest-path-in-a-grid"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2813,"title":"Maximum Elegance of a K-Length Subsequence","titleSlug":"maximum-elegance-of-a-k-length-subsequence"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2814,"title":"Minimum Time Takes to Reach Destination Without Drowning","titleSlug":"minimum-time-takes-to-reach-destination-without-drowning"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2815,"title":"Max Pair Sum in an Array","titleSlug":"max-pair-sum-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2816,"title":"Double a Number Represented as a Linked List","titleSlug":"double-a-number-represented-as-a-linked-list"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2817,"title":"Minimum Absolute Difference Between Elements With Constraint","titleSlug":"minimum-absolute-difference-between-elements-with-constraint"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2818,"title":"Apply Operations to Maximize Score","titleSlug":"apply-operations-to-maximize-score"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2819,"title":"Minimum Relative Loss After Buying Chocolates","titleSlug":"minimum-relative-loss-after-buying-chocolates"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2820,"title":"Election Results","titleSlug":"election-results"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2821,"title":"Delay the Resolution of Each Promise","titleSlug":"delay-the-resolution-of-each-promise"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2822,"title":"Inversion of Object","titleSlug":"inversion-of-object"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2823,"title":"Deep Object Filter","titleSlug":"deep-object-filter"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2824,"title":"Count Pairs Whose Sum is Less than Target","titleSlug":"count-pairs-whose-sum-is-less-than-target"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2825,"title":"Make String a Subsequence Using Cyclic Increments","titleSlug":"make-string-a-subsequence-using-cyclic-increments"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2826,"title":"Sorting Three Groups","titleSlug":"sorting-three-groups"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2827,"title":"Number of Beautiful Integers in the Range","titleSlug":"number-of-beautiful-integers-in-the-range"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2828,"title":"Check if a String Is an Acronym of Words","titleSlug":"check-if-a-string-is-an-acronym-of-words"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2829,"title":"Determine the Minimum Sum of a k-avoiding Array","titleSlug":"determine-the-minimum-sum-of-a-k-avoiding-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2830,"title":"Maximize the Profit as the Salesman","titleSlug":"maximize-the-profit-as-the-salesman"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2831,"title":"Find the Longest Equal Subarray","titleSlug":"find-the-longest-equal-subarray"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2832,"title":"Maximal Range That Each Element Is Maximum in It","titleSlug":"maximal-range-that-each-element-is-maximum-in-it"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2833,"title":"Furthest Point From Origin","titleSlug":"furthest-point-from-origin"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2834,"title":"Find the Minimum Possible Sum of a Beautiful Array","titleSlug":"find-the-minimum-possible-sum-of-a-beautiful-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2835,"title":"Minimum Operations to Form Subsequence With Target Sum","titleSlug":"minimum-operations-to-form-subsequence-with-target-sum"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2836,"title":"Maximize Value of Function in a Ball Passing Game","titleSlug":"maximize-value-of-function-in-a-ball-passing-game"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2837,"title":"Total Traveled Distance","titleSlug":"total-traveled-distance"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2838,"title":"Maximum Coins Heroes Can Collect","titleSlug":"maximum-coins-heroes-can-collect"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2839,"title":"Check if Strings Can be Made Equal With Operations I","titleSlug":"check-if-strings-can-be-made-equal-with-operations-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2840,"title":"Check if Strings Can be Made Equal With Operations II","titleSlug":"check-if-strings-can-be-made-equal-with-operations-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2841,"title":"Maximum Sum of Almost Unique Subarray","titleSlug":"maximum-sum-of-almost-unique-subarray"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2842,"title":"Count K-Subsequences of a String With Maximum Beauty","titleSlug":"count-k-subsequences-of-a-string-with-maximum-beauty"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2843,"title":"Count Symmetric Integers","titleSlug":"count-symmetric-integers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2844,"title":"Minimum Operations to Make a Special Number","titleSlug":"minimum-operations-to-make-a-special-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2845,"title":"Count of Interesting Subarrays","titleSlug":"count-of-interesting-subarrays"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2846,"title":"Minimum Edge Weight Equilibrium Queries in a Tree","titleSlug":"minimum-edge-weight-equilibrium-queries-in-a-tree"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2847,"title":"Smallest Number With Given Digit Product","titleSlug":"smallest-number-with-given-digit-product"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2848,"title":"Points That Intersect With Cars","titleSlug":"points-that-intersect-with-cars"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2849,"title":"Determine if a Cell Is Reachable at a Given Time","titleSlug":"determine-if-a-cell-is-reachable-at-a-given-time"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2850,"title":"Minimum Moves to Spread Stones Over Grid","titleSlug":"minimum-moves-to-spread-stones-over-grid"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2851,"title":"String Transformation","titleSlug":"string-transformation"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2852,"title":"Sum of Remoteness of All Cells","titleSlug":"sum-of-remoteness-of-all-cells"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2853,"title":"Highest Salaries Difference","titleSlug":"highest-salaries-difference"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2854,"title":"Rolling Average Steps","titleSlug":"rolling-average-steps"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2855,"title":"Minimum Right Shifts to Sort the Array","titleSlug":"minimum-right-shifts-to-sort-the-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2856,"title":"Minimum Array Length After Pair Removals","titleSlug":"minimum-array-length-after-pair-removals"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2857,"title":"Count Pairs of Points With Distance k","titleSlug":"count-pairs-of-points-with-distance-k"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2858,"title":"Minimum Edge Reversals So Every Node Is Reachable","titleSlug":"minimum-edge-reversals-so-every-node-is-reachable"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2859,"title":"Sum of Values at Indices With K Set Bits","titleSlug":"sum-of-values-at-indices-with-k-set-bits"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2860,"title":"Happy Students","titleSlug":"happy-students"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2861,"title":"Maximum Number of Alloys","titleSlug":"maximum-number-of-alloys"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2862,"title":"Maximum Element-Sum of a Complete Subset of Indices","titleSlug":"maximum-element-sum-of-a-complete-subset-of-indices"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2863,"title":"Maximum Length of Semi-Decreasing Subarrays","titleSlug":"maximum-length-of-semi-decreasing-subarrays"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2864,"title":"Maximum Odd Binary Number","titleSlug":"maximum-odd-binary-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2865,"title":"Beautiful Towers I","titleSlug":"beautiful-towers-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2866,"title":"Beautiful Towers II","titleSlug":"beautiful-towers-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2867,"title":"Count Valid Paths in a Tree","titleSlug":"count-valid-paths-in-a-tree"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2868,"title":"The Wording Game","titleSlug":"the-wording-game"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2869,"title":"Minimum Operations to Collect Elements","titleSlug":"minimum-operations-to-collect-elements"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2870,"title":"Minimum Number of Operations to Make Array Empty","titleSlug":"minimum-number-of-operations-to-make-array-empty"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2871,"title":"Split Array Into Maximum Number of Subarrays","titleSlug":"split-array-into-maximum-number-of-subarrays"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2872,"title":"Maximum Number of K-Divisible Components","titleSlug":"maximum-number-of-k-divisible-components"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2873,"title":"Maximum Value of an Ordered Triplet I","titleSlug":"maximum-value-of-an-ordered-triplet-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2874,"title":"Maximum Value of an Ordered Triplet II","titleSlug":"maximum-value-of-an-ordered-triplet-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2875,"title":"Minimum Size Subarray in Infinite Array","titleSlug":"minimum-size-subarray-in-infinite-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2876,"title":"Count Visited Nodes in a Directed Graph","titleSlug":"count-visited-nodes-in-a-directed-graph"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2877,"title":"Create a DataFrame from List","titleSlug":"create-a-dataframe-from-list"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2878,"title":"Get the Size of a DataFrame","titleSlug":"get-the-size-of-a-dataframe"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2879,"title":"Display the First Three Rows","titleSlug":"display-the-first-three-rows"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2880,"title":"Select Data","titleSlug":"select-data"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2881,"title":"Create a New Column","titleSlug":"create-a-new-column"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2882,"title":"Drop Duplicate Rows","titleSlug":"drop-duplicate-rows"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2883,"title":"Drop Missing Data","titleSlug":"drop-missing-data"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2884,"title":"Modify Columns","titleSlug":"modify-columns"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2885,"title":"Rename Columns","titleSlug":"rename-columns"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2886,"title":"Change Data Type","titleSlug":"change-data-type"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2887,"title":"Fill Missing Data","titleSlug":"fill-missing-data"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2888,"title":"Reshape Data: Concatenate","titleSlug":"reshape-data-concatenate"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2889,"title":"Reshape Data: Pivot","titleSlug":"reshape-data-pivot"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2890,"title":"Reshape Data: Melt","titleSlug":"reshape-data-melt"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2891,"title":"Method Chaining","titleSlug":"method-chaining"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2892,"title":"Minimizing Array After Replacing Pairs With Their Product","titleSlug":"minimizing-array-after-replacing-pairs-with-their-product"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2893,"title":"Calculate Orders Within Each Interval","titleSlug":"calculate-orders-within-each-interval"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2894,"title":"Divisible and Non-divisible Sums Difference","titleSlug":"divisible-and-non-divisible-sums-difference"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2895,"title":"Minimum Processing Time","titleSlug":"minimum-processing-time"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2896,"title":"Apply Operations to Make Two Strings Equal","titleSlug":"apply-operations-to-make-two-strings-equal"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2897,"title":"Apply Operations on Array to Maximize Sum of Squares","titleSlug":"apply-operations-on-array-to-maximize-sum-of-squares"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2898,"title":"Maximum Linear Stock Score","titleSlug":"maximum-linear-stock-score"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2899,"title":"Last Visited Integers","titleSlug":"last-visited-integers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2900,"title":"Longest Unequal Adjacent Groups Subsequence I","titleSlug":"longest-unequal-adjacent-groups-subsequence-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2901,"title":"Longest Unequal Adjacent Groups Subsequence II","titleSlug":"longest-unequal-adjacent-groups-subsequence-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2902,"title":"Count of Sub-Multisets With Bounded Sum","titleSlug":"count-of-sub-multisets-with-bounded-sum"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2903,"title":"Find Indices With Index and Value Difference I","titleSlug":"find-indices-with-index-and-value-difference-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2904,"title":"Shortest and Lexicographically Smallest Beautiful String","titleSlug":"shortest-and-lexicographically-smallest-beautiful-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2905,"title":"Find Indices With Index and Value Difference II","titleSlug":"find-indices-with-index-and-value-difference-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2906,"title":"Construct Product Matrix","titleSlug":"construct-product-matrix"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2907,"title":"Maximum Profitable Triplets With Increasing Prices I","titleSlug":"maximum-profitable-triplets-with-increasing-prices-i"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2908,"title":"Minimum Sum of Mountain Triplets I","titleSlug":"minimum-sum-of-mountain-triplets-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2909,"title":"Minimum Sum of Mountain Triplets II","titleSlug":"minimum-sum-of-mountain-triplets-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2910,"title":"Minimum Number of Groups to Create a Valid Assignment","titleSlug":"minimum-number-of-groups-to-create-a-valid-assignment"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2911,"title":"Minimum Changes to Make K Semi-palindromes","titleSlug":"minimum-changes-to-make-k-semi-palindromes"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2912,"title":"Number of Ways to Reach Destination in the Grid","titleSlug":"number-of-ways-to-reach-destination-in-the-grid"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2913,"title":"Subarrays Distinct Element Sum of Squares I","titleSlug":"subarrays-distinct-element-sum-of-squares-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2914,"title":"Minimum Number of Changes to Make Binary String Beautiful","titleSlug":"minimum-number-of-changes-to-make-binary-string-beautiful"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2915,"title":"Length of the Longest Subsequence That Sums to Target","titleSlug":"length-of-the-longest-subsequence-that-sums-to-target"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2916,"title":"Subarrays Distinct Element Sum of Squares II","titleSlug":"subarrays-distinct-element-sum-of-squares-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2917,"title":"Find the K-or of an Array","titleSlug":"find-the-k-or-of-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2918,"title":"Minimum Equal Sum of Two Arrays After Replacing Zeros","titleSlug":"minimum-equal-sum-of-two-arrays-after-replacing-zeros"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2919,"title":"Minimum Increment Operations to Make Array Beautiful","titleSlug":"minimum-increment-operations-to-make-array-beautiful"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2920,"title":"Maximum Points After Collecting Coins From All Nodes","titleSlug":"maximum-points-after-collecting-coins-from-all-nodes"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2921,"title":"Maximum Profitable Triplets With Increasing Prices II","titleSlug":"maximum-profitable-triplets-with-increasing-prices-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2922,"title":"Market Analysis III","titleSlug":"market-analysis-iii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2923,"title":"Find Champion I","titleSlug":"find-champion-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2924,"title":"Find Champion II","titleSlug":"find-champion-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2925,"title":"Maximum Score After Applying Operations on a Tree","titleSlug":"maximum-score-after-applying-operations-on-a-tree"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2926,"title":"Maximum Balanced Subsequence Sum","titleSlug":"maximum-balanced-subsequence-sum"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2927,"title":"Distribute Candies Among Children III","titleSlug":"distribute-candies-among-children-iii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2928,"title":"Distribute Candies Among Children I","titleSlug":"distribute-candies-among-children-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2929,"title":"Distribute Candies Among Children II","titleSlug":"distribute-candies-among-children-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2930,"title":"Number of Strings Which Can Be Rearranged to Contain Substring","titleSlug":"number-of-strings-which-can-be-rearranged-to-contain-substring"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2931,"title":"Maximum Spending After Buying Items","titleSlug":"maximum-spending-after-buying-items"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2932,"title":"Maximum Strong Pair XOR I","titleSlug":"maximum-strong-pair-xor-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2933,"title":"High-Access Employees","titleSlug":"high-access-employees"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2934,"title":"Minimum Operations to Maximize Last Elements in Arrays","titleSlug":"minimum-operations-to-maximize-last-elements-in-arrays"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2935,"title":"Maximum Strong Pair XOR II","titleSlug":"maximum-strong-pair-xor-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2936,"title":"Number of Equal Numbers Blocks","titleSlug":"number-of-equal-numbers-blocks"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2937,"title":"Make Three Strings Equal","titleSlug":"make-three-strings-equal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2938,"title":"Separate Black and White Balls","titleSlug":"separate-black-and-white-balls"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2939,"title":"Maximum Xor Product","titleSlug":"maximum-xor-product"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2940,"title":"Find Building Where Alice and Bob Can Meet","titleSlug":"find-building-where-alice-and-bob-can-meet"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2941,"title":"Maximum GCD-Sum of a Subarray","titleSlug":"maximum-gcd-sum-of-a-subarray"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2942,"title":"Find Words Containing Character","titleSlug":"find-words-containing-character"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2943,"title":"Maximize Area of Square Hole in Grid","titleSlug":"maximize-area-of-square-hole-in-grid"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2944,"title":"Minimum Number of Coins for Fruits","titleSlug":"minimum-number-of-coins-for-fruits"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2945,"title":"Find Maximum Non-decreasing Array Length","titleSlug":"find-maximum-non-decreasing-array-length"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2946,"title":"Matrix Similarity After Cyclic Shifts","titleSlug":"matrix-similarity-after-cyclic-shifts"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2947,"title":"Count Beautiful Substrings I","titleSlug":"count-beautiful-substrings-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2948,"title":"Make Lexicographically Smallest Array by Swapping Elements","titleSlug":"make-lexicographically-smallest-array-by-swapping-elements"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2949,"title":"Count Beautiful Substrings II","titleSlug":"count-beautiful-substrings-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2950,"title":"Number of Divisible Substrings","titleSlug":"number-of-divisible-substrings"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2951,"title":"Find the Peaks","titleSlug":"find-the-peaks"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2952,"title":"Minimum Number of Coins to be Added","titleSlug":"minimum-number-of-coins-to-be-added"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2953,"title":"Count Complete Substrings","titleSlug":"count-complete-substrings"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2954,"title":"Count the Number of Infection Sequences","titleSlug":"count-the-number-of-infection-sequences"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2955,"title":"Number of Same-End Substrings","titleSlug":"number-of-same-end-substrings"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2956,"title":"Find Common Elements Between Two Arrays","titleSlug":"find-common-elements-between-two-arrays"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2957,"title":"Remove Adjacent Almost-Equal Characters","titleSlug":"remove-adjacent-almost-equal-characters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2958,"title":"Length of Longest Subarray With at Most K Frequency","titleSlug":"length-of-longest-subarray-with-at-most-k-frequency"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2959,"title":"Number of Possible Sets of Closing Branches","titleSlug":"number-of-possible-sets-of-closing-branches"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2960,"title":"Count Tested Devices After Test Operations","titleSlug":"count-tested-devices-after-test-operations"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2961,"title":"Double Modular Exponentiation","titleSlug":"double-modular-exponentiation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2962,"title":"Count Subarrays Where Max Element Appears at Least K Times","titleSlug":"count-subarrays-where-max-element-appears-at-least-k-times"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2963,"title":"Count the Number of Good Partitions","titleSlug":"count-the-number-of-good-partitions"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2964,"title":"Number of Divisible Triplet Sums","titleSlug":"number-of-divisible-triplet-sums"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2965,"title":"Find Missing and Repeated Values","titleSlug":"find-missing-and-repeated-values"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2966,"title":"Divide Array Into Arrays With Max Difference","titleSlug":"divide-array-into-arrays-with-max-difference"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2967,"title":"Minimum Cost to Make Array Equalindromic","titleSlug":"minimum-cost-to-make-array-equalindromic"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2968,"title":"Apply Operations to Maximize Frequency Score","titleSlug":"apply-operations-to-maximize-frequency-score"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2969,"title":"Minimum Number of Coins for Fruits II","titleSlug":"minimum-number-of-coins-for-fruits-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2970,"title":"Count the Number of Incremovable Subarrays I","titleSlug":"count-the-number-of-incremovable-subarrays-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2971,"title":"Find Polygon With the Largest Perimeter","titleSlug":"find-polygon-with-the-largest-perimeter"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2972,"title":"Count the Number of Incremovable Subarrays II","titleSlug":"count-the-number-of-incremovable-subarrays-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2973,"title":"Find Number of Coins to Place in Tree Nodes","titleSlug":"find-number-of-coins-to-place-in-tree-nodes"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2974,"title":"Minimum Number Game","titleSlug":"minimum-number-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2975,"title":"Maximum Square Area by Removing Fences From a Field","titleSlug":"maximum-square-area-by-removing-fences-from-a-field"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2976,"title":"Minimum Cost to Convert String I","titleSlug":"minimum-cost-to-convert-string-i"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2977,"title":"Minimum Cost to Convert String II","titleSlug":"minimum-cost-to-convert-string-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2978,"title":"Symmetric Coordinates","titleSlug":"symmetric-coordinates"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2979,"title":"Most Expensive Item That Can Not Be Bought","titleSlug":"most-expensive-item-that-can-not-be-bought"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2980,"title":"Check if Bitwise OR Has Trailing Zeros","titleSlug":"check-if-bitwise-or-has-trailing-zeros"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2981,"title":"Find Longest Special Substring That Occurs Thrice I","titleSlug":"find-longest-special-substring-that-occurs-thrice-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2982,"title":"Find Longest Special Substring That Occurs Thrice II","titleSlug":"find-longest-special-substring-that-occurs-thrice-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2983,"title":"Palindrome Rearrangement Queries","titleSlug":"palindrome-rearrangement-queries"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2984,"title":"Find Peak Calling Hours for Each City","titleSlug":"find-peak-calling-hours-for-each-city"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2985,"title":"Calculate Compressed Mean","titleSlug":"calculate-compressed-mean"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2986,"title":"Find Third Transaction","titleSlug":"find-third-transaction"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2987,"title":"Find Expensive Cities","titleSlug":"find-expensive-cities"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2988,"title":"Manager of the Largest Department","titleSlug":"manager-of-the-largest-department"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2989,"title":"Class Performance","titleSlug":"class-performance"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2990,"title":"Loan Types","titleSlug":"loan-types"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2991,"title":"Top Three Wineries","titleSlug":"top-three-wineries"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2992,"title":"Number of Self-Divisible Permutations","titleSlug":"number-of-self-divisible-permutations"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2993,"title":"Friday Purchases I","titleSlug":"friday-purchases-i"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2994,"title":"Friday Purchases II","titleSlug":"friday-purchases-ii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2995,"title":"Viewers Turned Streamers","titleSlug":"viewers-turned-streamers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2996,"title":"Smallest Missing Integer Greater Than Sequential Prefix Sum","titleSlug":"smallest-missing-integer-greater-than-sequential-prefix-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2997,"title":"Minimum Number of Operations to Make Array XOR Equal to K","titleSlug":"minimum-number-of-operations-to-make-array-xor-equal-to-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2998,"title":"Minimum Number of Operations to Make X and Y Equal","titleSlug":"minimum-number-of-operations-to-make-x-and-y-equal"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2999,"title":"Count the Number of Powerful Integers","titleSlug":"count-the-number-of-powerful-integers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3000,"title":"Maximum Area of Longest Diagonal Rectangle","titleSlug":"maximum-area-of-longest-diagonal-rectangle"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3001,"title":"Minimum Moves to Capture The Queen","titleSlug":"minimum-moves-to-capture-the-queen"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3002,"title":"Maximum Size of a Set After Removals","titleSlug":"maximum-size-of-a-set-after-removals"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3003,"title":"Maximize the Number of Partitions After Operations","titleSlug":"maximize-the-number-of-partitions-after-operations"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3004,"title":"Maximum Subtree of the Same Color","titleSlug":"maximum-subtree-of-the-same-color"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3005,"title":"Count Elements With Maximum Frequency","titleSlug":"count-elements-with-maximum-frequency"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3006,"title":"Find Beautiful Indices in the Given Array I","titleSlug":"find-beautiful-indices-in-the-given-array-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3007,"title":"Maximum Number That Sum of the Prices Is Less Than or Equal to K","titleSlug":"maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3008,"title":"Find Beautiful Indices in the Given Array II","titleSlug":"find-beautiful-indices-in-the-given-array-ii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3009,"title":"Maximum Number of Intersections on the Chart","titleSlug":"maximum-number-of-intersections-on-the-chart"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3010,"title":"Divide an Array Into Subarrays With Minimum Cost I","titleSlug":"divide-an-array-into-subarrays-with-minimum-cost-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3011,"title":"Find if Array Can Be Sorted","titleSlug":"find-if-array-can-be-sorted"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3012,"title":"Minimize Length of Array Using Operations","titleSlug":"minimize-length-of-array-using-operations"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3013,"title":"Divide an Array Into Subarrays With Minimum Cost II","titleSlug":"divide-an-array-into-subarrays-with-minimum-cost-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3014,"title":"Minimum Number of Pushes to Type Word I","titleSlug":"minimum-number-of-pushes-to-type-word-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3015,"title":"Count the Number of Houses at a Certain Distance I","titleSlug":"count-the-number-of-houses-at-a-certain-distance-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3016,"title":"Minimum Number of Pushes to Type Word II","titleSlug":"minimum-number-of-pushes-to-type-word-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3017,"title":"Count the Number of Houses at a Certain Distance II","titleSlug":"count-the-number-of-houses-at-a-certain-distance-ii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3018,"title":"Maximum Number of Removal Queries That Can Be Processed I","titleSlug":"maximum-number-of-removal-queries-that-can-be-processed-i"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3019,"title":"Number of Changing Keys","titleSlug":"number-of-changing-keys"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3020,"title":"Find the Maximum Number of Elements in Subset","titleSlug":"find-the-maximum-number-of-elements-in-subset"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3021,"title":"Alice and Bob Playing Flower Game","titleSlug":"alice-and-bob-playing-flower-game"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3022,"title":"Minimize OR of Remaining Elements Using Operations","titleSlug":"minimize-or-of-remaining-elements-using-operations"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3023,"title":"Find Pattern in Infinite Stream I","titleSlug":"find-pattern-in-infinite-stream-i"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3024,"title":"Type of Triangle","titleSlug":"type-of-triangle"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3025,"title":"Find the Number of Ways to Place People I","titleSlug":"find-the-number-of-ways-to-place-people-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3026,"title":"Maximum Good Subarray Sum","titleSlug":"maximum-good-subarray-sum"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3027,"title":"Find the Number of Ways to Place People II","titleSlug":"find-the-number-of-ways-to-place-people-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3028,"title":"Ant on the Boundary","titleSlug":"ant-on-the-boundary"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3029,"title":"Minimum Time to Revert Word to Initial State I","titleSlug":"minimum-time-to-revert-word-to-initial-state-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3030,"title":"Find the Grid of Region Average","titleSlug":"find-the-grid-of-region-average"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3031,"title":"Minimum Time to Revert Word to Initial State II","titleSlug":"minimum-time-to-revert-word-to-initial-state-ii"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3032,"title":"Count Numbers With Unique Digits II","titleSlug":"count-numbers-with-unique-digits-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3033,"title":"Modify the Matrix","titleSlug":"modify-the-matrix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3034,"title":"Number of Subarrays That Match a Pattern I","titleSlug":"number-of-subarrays-that-match-a-pattern-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3035,"title":"Maximum Palindromes After Operations","titleSlug":"maximum-palindromes-after-operations"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3036,"title":"Number of Subarrays That Match a Pattern II","titleSlug":"number-of-subarrays-that-match-a-pattern-ii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3037,"title":"Find Pattern in Infinite Stream II","titleSlug":"find-pattern-in-infinite-stream-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3038,"title":"Maximum Number of Operations With the Same Score I","titleSlug":"maximum-number-of-operations-with-the-same-score-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3039,"title":"Apply Operations to Make String Empty","titleSlug":"apply-operations-to-make-string-empty"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3040,"title":"Maximum Number of Operations With the Same Score II","titleSlug":"maximum-number-of-operations-with-the-same-score-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3041,"title":"Maximize Consecutive Elements in an Array After Modification","titleSlug":"maximize-consecutive-elements-in-an-array-after-modification"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3042,"title":"Count Prefix and Suffix Pairs I","titleSlug":"count-prefix-and-suffix-pairs-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3043,"title":"Find the Length of the Longest Common Prefix","titleSlug":"find-the-length-of-the-longest-common-prefix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3044,"title":"Most Frequent Prime","titleSlug":"most-frequent-prime"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3045,"title":"Count Prefix and Suffix Pairs II","titleSlug":"count-prefix-and-suffix-pairs-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3046,"title":"Split the Array","titleSlug":"split-the-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3047,"title":"Find the Largest Area of Square Inside Two Rectangles","titleSlug":"find-the-largest-area-of-square-inside-two-rectangles"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3048,"title":"Earliest Second to Mark Indices I","titleSlug":"earliest-second-to-mark-indices-i"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3049,"title":"Earliest Second to Mark Indices II","titleSlug":"earliest-second-to-mark-indices-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3050,"title":"Pizza Toppings Cost Analysis","titleSlug":"pizza-toppings-cost-analysis"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3051,"title":"Find Candidates for Data Scientist Position","titleSlug":"find-candidates-for-data-scientist-position"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3052,"title":"Maximize Items","titleSlug":"maximize-items"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3053,"title":"Classifying Triangles by Lengths","titleSlug":"classifying-triangles-by-lengths"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3054,"title":"Binary Tree Nodes","titleSlug":"binary-tree-nodes"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3055,"title":"Top Percentile Fraud","titleSlug":"top-percentile-fraud"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3056,"title":"Snaps Analysis","titleSlug":"snaps-analysis"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3057,"title":"Employees Project Allocation","titleSlug":"employees-project-allocation"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3058,"title":"Friends With No Mutual Friends","titleSlug":"friends-with-no-mutual-friends"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3059,"title":"Find All Unique Email Domains","titleSlug":"find-all-unique-email-domains"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3060,"title":"User Activities within Time Bounds","titleSlug":"user-activities-within-time-bounds"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3061,"title":"Calculate Trapping Rain Water","titleSlug":"calculate-trapping-rain-water"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3062,"title":"Winner of the Linked List Game","titleSlug":"winner-of-the-linked-list-game"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3063,"title":"Linked List Frequency","titleSlug":"linked-list-frequency"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3064,"title":"Guess the Number Using Bitwise Questions I","titleSlug":"guess-the-number-using-bitwise-questions-i"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3065,"title":"Minimum Operations to Exceed Threshold Value I","titleSlug":"minimum-operations-to-exceed-threshold-value-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3066,"title":"Minimum Operations to Exceed Threshold Value II","titleSlug":"minimum-operations-to-exceed-threshold-value-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3067,"title":"Count Pairs of Connectable Servers in a Weighted Tree Network","titleSlug":"count-pairs-of-connectable-servers-in-a-weighted-tree-network"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3068,"title":"Find the Maximum Sum of Node Values","titleSlug":"find-the-maximum-sum-of-node-values"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3069,"title":"Distribute Elements Into Two Arrays I","titleSlug":"distribute-elements-into-two-arrays-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3070,"title":"Count Submatrices with Top-Left Element and Sum Less Than k","titleSlug":"count-submatrices-with-top-left-element-and-sum-less-than-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3071,"title":"Minimum Operations to Write the Letter Y on a Grid","titleSlug":"minimum-operations-to-write-the-letter-y-on-a-grid"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3072,"title":"Distribute Elements Into Two Arrays II","titleSlug":"distribute-elements-into-two-arrays-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3073,"title":"Maximum Increasing Triplet Value","titleSlug":"maximum-increasing-triplet-value"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3074,"title":"Apple Redistribution into Boxes","titleSlug":"apple-redistribution-into-boxes"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3075,"title":"Maximize Happiness of Selected Children","titleSlug":"maximize-happiness-of-selected-children"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3076,"title":"Shortest Uncommon Substring in an Array","titleSlug":"shortest-uncommon-substring-in-an-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3077,"title":"Maximum Strength of K Disjoint Subarrays","titleSlug":"maximum-strength-of-k-disjoint-subarrays"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3078,"title":"Match Alphanumerical Pattern in Matrix I","titleSlug":"match-alphanumerical-pattern-in-matrix-i"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3079,"title":"Find the Sum of Encrypted Integers","titleSlug":"find-the-sum-of-encrypted-integers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3080,"title":"Mark Elements on Array by Performing Queries","titleSlug":"mark-elements-on-array-by-performing-queries"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3081,"title":"Replace Question Marks in String to Minimize Its Value","titleSlug":"replace-question-marks-in-string-to-minimize-its-value"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3082,"title":"Find the Sum of the Power of All Subsequences","titleSlug":"find-the-sum-of-the-power-of-all-subsequences"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3083,"title":"Existence of a Substring in a String and Its Reverse","titleSlug":"existence-of-a-substring-in-a-string-and-its-reverse"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3084,"title":"Count Substrings Starting and Ending with Given Character","titleSlug":"count-substrings-starting-and-ending-with-given-character"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3085,"title":"Minimum Deletions to Make String K-Special","titleSlug":"minimum-deletions-to-make-string-k-special"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3086,"title":"Minimum Moves to Pick K Ones","titleSlug":"minimum-moves-to-pick-k-ones"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3087,"title":"Find Trending Hashtags","titleSlug":"find-trending-hashtags"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3088,"title":"Make String Anti-palindrome","titleSlug":"make-string-anti-palindrome"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3089,"title":"Find Bursty Behavior","titleSlug":"find-bursty-behavior"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3090,"title":"Maximum Length Substring With Two Occurrences","titleSlug":"maximum-length-substring-with-two-occurrences"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3091,"title":"Apply Operations to Make Sum of Array Greater Than or Equal to k","titleSlug":"apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3092,"title":"Most Frequent IDs","titleSlug":"most-frequent-ids"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3093,"title":"Longest Common Suffix Queries","titleSlug":"longest-common-suffix-queries"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3094,"title":"Guess the Number Using Bitwise Questions II","titleSlug":"guess-the-number-using-bitwise-questions-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3095,"title":"Shortest Subarray With OR at Least K I","titleSlug":"shortest-subarray-with-or-at-least-k-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3096,"title":"Minimum Levels to Gain More Points","titleSlug":"minimum-levels-to-gain-more-points"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3097,"title":"Shortest Subarray With OR at Least K II","titleSlug":"shortest-subarray-with-or-at-least-k-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3098,"title":"Find the Sum of Subsequence Powers","titleSlug":"find-the-sum-of-subsequence-powers"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3099,"title":"Harshad Number","titleSlug":"harshad-number"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3100,"title":"Water Bottles II","titleSlug":"water-bottles-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3101,"title":"Count Alternating Subarrays","titleSlug":"count-alternating-subarrays"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3102,"title":"Minimize Manhattan Distances","titleSlug":"minimize-manhattan-distances"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3103,"title":"Find Trending Hashtags II","titleSlug":"find-trending-hashtags-ii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3104,"title":"Find Longest Self-Contained Substring","titleSlug":"find-longest-self-contained-substring"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3105,"title":"Longest Strictly Increasing or Strictly Decreasing Subarray","titleSlug":"longest-strictly-increasing-or-strictly-decreasing-subarray"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3106,"title":"Lexicographically Smallest String After Operations With Constraint","titleSlug":"lexicographically-smallest-string-after-operations-with-constraint"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3107,"title":"Minimum Operations to Make Median of Array Equal to K","titleSlug":"minimum-operations-to-make-median-of-array-equal-to-k"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3108,"title":"Minimum Cost Walk in Weighted Graph","titleSlug":"minimum-cost-walk-in-weighted-graph"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3109,"title":"Find the Index of Permutation","titleSlug":"find-the-index-of-permutation"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3110,"title":"Score of a String","titleSlug":"score-of-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3111,"title":"Minimum Rectangles to Cover Points","titleSlug":"minimum-rectangles-to-cover-points"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3112,"title":"Minimum Time to Visit Disappearing Nodes","titleSlug":"minimum-time-to-visit-disappearing-nodes"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3113,"title":"Find the Number of Subarrays Where Boundary Elements Are Maximum","titleSlug":"find-the-number-of-subarrays-where-boundary-elements-are-maximum"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3114,"title":"Latest Time You Can Obtain After Replacing Characters","titleSlug":"latest-time-you-can-obtain-after-replacing-characters"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3115,"title":"Maximum Prime Difference","titleSlug":"maximum-prime-difference"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3116,"title":"Kth Smallest Amount With Single Denomination Combination","titleSlug":"kth-smallest-amount-with-single-denomination-combination"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3117,"title":"Minimum Sum of Values by Dividing Array","titleSlug":"minimum-sum-of-values-by-dividing-array"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3118,"title":"Friday Purchase III","titleSlug":"friday-purchase-iii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3119,"title":"Maximum Number of Potholes That Can Be Fixed","titleSlug":"maximum-number-of-potholes-that-can-be-fixed"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3120,"title":"Count the Number of Special Characters I","titleSlug":"count-the-number-of-special-characters-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3121,"title":"Count the Number of Special Characters II","titleSlug":"count-the-number-of-special-characters-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3122,"title":"Minimum Number of Operations to Satisfy Conditions","titleSlug":"minimum-number-of-operations-to-satisfy-conditions"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3123,"title":"Find Edges in Shortest Paths","titleSlug":"find-edges-in-shortest-paths"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3124,"title":"Find Longest Calls","titleSlug":"find-longest-calls"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3125,"title":"Maximum Number That Makes Result of Bitwise AND Zero","titleSlug":"maximum-number-that-makes-result-of-bitwise-and-zero"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3126,"title":"Server Utilization Time","titleSlug":"server-utilization-time"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3127,"title":"Make a Square with the Same Color","titleSlug":"make-a-square-with-the-same-color"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3128,"title":"Right Triangles","titleSlug":"right-triangles"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3129,"title":"Find All Possible Stable Binary Arrays I","titleSlug":"find-all-possible-stable-binary-arrays-i"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3130,"title":"Find All Possible Stable Binary Arrays II","titleSlug":"find-all-possible-stable-binary-arrays-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3131,"title":"Find the Integer Added to Array I","titleSlug":"find-the-integer-added-to-array-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3132,"title":"Find the Integer Added to Array II","titleSlug":"find-the-integer-added-to-array-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3133,"title":"Minimum Array End","titleSlug":"minimum-array-end"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3134,"title":"Find the Median of the Uniqueness Array","titleSlug":"find-the-median-of-the-uniqueness-array"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3135,"title":"Equalize Strings by Adding or Removing Characters at Ends","titleSlug":"equalize-strings-by-adding-or-removing-characters-at-ends"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3136,"title":"Valid Word","titleSlug":"valid-word"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3137,"title":"Minimum Number of Operations to Make Word K-Periodic","titleSlug":"minimum-number-of-operations-to-make-word-k-periodic"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3138,"title":"Minimum Length of Anagram Concatenation","titleSlug":"minimum-length-of-anagram-concatenation"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3139,"title":"Minimum Cost to Equalize Array","titleSlug":"minimum-cost-to-equalize-array"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3140,"title":"Consecutive Available Seats II","titleSlug":"consecutive-available-seats-ii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3141,"title":"Maximum Hamming Distances","titleSlug":"maximum-hamming-distances"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3142,"title":"Check if Grid Satisfies Conditions","titleSlug":"check-if-grid-satisfies-conditions"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3143,"title":"Maximum Points Inside the Square","titleSlug":"maximum-points-inside-the-square"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3144,"title":"Minimum Substring Partition of Equal Character Frequency","titleSlug":"minimum-substring-partition-of-equal-character-frequency"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3145,"title":"Find Products of Elements of Big Array","titleSlug":"find-products-of-elements-of-big-array"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3146,"title":"Permutation Difference between Two Strings","titleSlug":"permutation-difference-between-two-strings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3147,"title":"Taking Maximum Energy From the Mystic Dungeon","titleSlug":"taking-maximum-energy-from-the-mystic-dungeon"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3148,"title":"Maximum Difference Score in a Grid","titleSlug":"maximum-difference-score-in-a-grid"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3149,"title":"Find the Minimum Cost Array Permutation","titleSlug":"find-the-minimum-cost-array-permutation"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3150,"title":"Invalid Tweets II","titleSlug":"invalid-tweets-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3151,"title":"Special Array I","titleSlug":"special-array-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3152,"title":"Special Array II","titleSlug":"special-array-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3153,"title":"Sum of Digit Differences of All Pairs","titleSlug":"sum-of-digit-differences-of-all-pairs"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3154,"title":"Find Number of Ways to Reach the K-th Stair","titleSlug":"find-number-of-ways-to-reach-the-k-th-stair"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3155,"title":"Maximum Number of Upgradable Servers","titleSlug":"maximum-number-of-upgradable-servers"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3156,"title":"Employee Task Duration and Concurrent Tasks","titleSlug":"employee-task-duration-and-concurrent-tasks"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3157,"title":"Find the Level of Tree with Minimum Sum","titleSlug":"find-the-level-of-tree-with-minimum-sum"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3158,"title":"Find the XOR of Numbers Which Appear Twice","titleSlug":"find-the-xor-of-numbers-which-appear-twice"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3159,"title":"Find Occurrences of an Element in an Array","titleSlug":"find-occurrences-of-an-element-in-an-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3160,"title":"Find the Number of Distinct Colors Among the Balls","titleSlug":"find-the-number-of-distinct-colors-among-the-balls"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3161,"title":"Block Placement Queries","titleSlug":"block-placement-queries"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3162,"title":"Find the Number of Good Pairs I","titleSlug":"find-the-number-of-good-pairs-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3163,"title":"String Compression III","titleSlug":"string-compression-iii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3164,"title":"Find the Number of Good Pairs II","titleSlug":"find-the-number-of-good-pairs-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3165,"title":"Maximum Sum of Subsequence With Non-adjacent Elements","titleSlug":"maximum-sum-of-subsequence-with-non-adjacent-elements"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3166,"title":"Calculate Parking Fees and Duration","titleSlug":"calculate-parking-fees-and-duration"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3167,"title":"Better Compression of String","titleSlug":"better-compression-of-string"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3168,"title":"Minimum Number of Chairs in a Waiting Room","titleSlug":"minimum-number-of-chairs-in-a-waiting-room"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3169,"title":"Count Days Without Meetings","titleSlug":"count-days-without-meetings"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3170,"title":"Lexicographically Minimum String After Removing Stars","titleSlug":"lexicographically-minimum-string-after-removing-stars"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3171,"title":"Find Subarray With Bitwise OR Closest to K","titleSlug":"find-subarray-with-bitwise-or-closest-to-k"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3172,"title":"Second Day Verification","titleSlug":"second-day-verification"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3173,"title":"Bitwise OR of Adjacent Elements","titleSlug":"bitwise-or-of-adjacent-elements"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3174,"title":"Clear Digits","titleSlug":"clear-digits"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3175,"title":"Find The First Player to win K Games in a Row","titleSlug":"find-the-first-player-to-win-k-games-in-a-row"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3176,"title":"Find the Maximum Length of a Good Subsequence I","titleSlug":"find-the-maximum-length-of-a-good-subsequence-i"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3177,"title":"Find the Maximum Length of a Good Subsequence II","titleSlug":"find-the-maximum-length-of-a-good-subsequence-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3178,"title":"Find the Child Who Has the Ball After K Seconds","titleSlug":"find-the-child-who-has-the-ball-after-k-seconds"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3179,"title":"Find the N-th Value After K Seconds","titleSlug":"find-the-n-th-value-after-k-seconds"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3180,"title":"Maximum Total Reward Using Operations I","titleSlug":"maximum-total-reward-using-operations-i"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3181,"title":"Maximum Total Reward Using Operations II","titleSlug":"maximum-total-reward-using-operations-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3182,"title":"Find Top Scoring Students","titleSlug":"find-top-scoring-students"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3183,"title":"The Number of Ways to Make the Sum","titleSlug":"the-number-of-ways-to-make-the-sum"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3184,"title":"Count Pairs That Form a Complete Day I","titleSlug":"count-pairs-that-form-a-complete-day-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3185,"title":"Count Pairs That Form a Complete Day II","titleSlug":"count-pairs-that-form-a-complete-day-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3186,"title":"Maximum Total Damage With Spell Casting","titleSlug":"maximum-total-damage-with-spell-casting"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3187,"title":"Peaks in Array","titleSlug":"peaks-in-array"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3188,"title":"Find Top Scoring Students II","titleSlug":"find-top-scoring-students-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3189,"title":"Minimum Moves to Get a Peaceful Board","titleSlug":"minimum-moves-to-get-a-peaceful-board"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3190,"title":"Find Minimum Operations to Make All Elements Divisible by Three","titleSlug":"find-minimum-operations-to-make-all-elements-divisible-by-three"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3191,"title":"Minimum Operations to Make Binary Array Elements Equal to One I","titleSlug":"minimum-operations-to-make-binary-array-elements-equal-to-one-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3192,"title":"Minimum Operations to Make Binary Array Elements Equal to One II","titleSlug":"minimum-operations-to-make-binary-array-elements-equal-to-one-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3193,"title":"Count the Number of Inversions","titleSlug":"count-the-number-of-inversions"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3194,"title":"Minimum Average of Smallest and Largest Elements","titleSlug":"minimum-average-of-smallest-and-largest-elements"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3195,"title":"Find the Minimum Area to Cover All Ones I","titleSlug":"find-the-minimum-area-to-cover-all-ones-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3196,"title":"Maximize Total Cost of Alternating Subarrays","titleSlug":"maximize-total-cost-of-alternating-subarrays"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3197,"title":"Find the Minimum Area to Cover All Ones II","titleSlug":"find-the-minimum-area-to-cover-all-ones-ii"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3198,"title":"Find Cities in Each State","titleSlug":"find-cities-in-each-state"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3199,"title":"Count Triplets with Even XOR Set Bits I","titleSlug":"count-triplets-with-even-xor-set-bits-i"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3200,"title":"Maximum Height of a Triangle","titleSlug":"maximum-height-of-a-triangle"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3201,"title":"Find the Maximum Length of Valid Subsequence I","titleSlug":"find-the-maximum-length-of-valid-subsequence-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3202,"title":"Find the Maximum Length of Valid Subsequence II","titleSlug":"find-the-maximum-length-of-valid-subsequence-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3203,"title":"Find Minimum Diameter After Merging Two Trees","titleSlug":"find-minimum-diameter-after-merging-two-trees"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3204,"title":"Bitwise User Permissions Analysis","titleSlug":"bitwise-user-permissions-analysis"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3205,"title":"Maximum Array Hopping Score I","titleSlug":"maximum-array-hopping-score-i"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3206,"title":"Alternating Groups I","titleSlug":"alternating-groups-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3207,"title":"Maximum Points After Enemy Battles","titleSlug":"maximum-points-after-enemy-battles"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3208,"title":"Alternating Groups II","titleSlug":"alternating-groups-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3209,"title":"Number of Subarrays With AND Value of K","titleSlug":"number-of-subarrays-with-and-value-of-k"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3210,"title":"Find the Encrypted String","titleSlug":"find-the-encrypted-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3211,"title":"Generate Binary Strings Without Adjacent Zeros","titleSlug":"generate-binary-strings-without-adjacent-zeros"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3212,"title":"Count Submatrices With Equal Frequency of X and Y","titleSlug":"count-submatrices-with-equal-frequency-of-x-and-y"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3213,"title":"Construct String with Minimum Cost","titleSlug":"construct-string-with-minimum-cost"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3214,"title":"Year on Year Growth Rate","titleSlug":"year-on-year-growth-rate"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3215,"title":"Count Triplets with Even XOR Set Bits II","titleSlug":"count-triplets-with-even-xor-set-bits-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3216,"title":"Lexicographically Smallest String After a Swap","titleSlug":"lexicographically-smallest-string-after-a-swap"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3217,"title":"Delete Nodes From Linked List Present in Array","titleSlug":"delete-nodes-from-linked-list-present-in-array"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3218,"title":"Minimum Cost for Cutting Cake I","titleSlug":"minimum-cost-for-cutting-cake-i"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3219,"title":"Minimum Cost for Cutting Cake II","titleSlug":"minimum-cost-for-cutting-cake-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3220,"title":"Odd and Even Transactions","titleSlug":"odd-and-even-transactions"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3221,"title":"Maximum Array Hopping Score II","titleSlug":"maximum-array-hopping-score-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3222,"title":"Find the Winning Player in Coin Game","titleSlug":"find-the-winning-player-in-coin-game"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3223,"title":"Minimum Length of String After Operations","titleSlug":"minimum-length-of-string-after-operations"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3224,"title":"Minimum Array Changes to Make Differences Equal","titleSlug":"minimum-array-changes-to-make-differences-equal"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3225,"title":"Maximum Score From Grid Operations","titleSlug":"maximum-score-from-grid-operations"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3226,"title":"Number of Bit Changes to Make Two Integers Equal","titleSlug":"number-of-bit-changes-to-make-two-integers-equal"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3227,"title":"Vowels Game in a String","titleSlug":"vowels-game-in-a-string"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3228,"title":"Maximum Number of Operations to Move Ones to the End","titleSlug":"maximum-number-of-operations-to-move-ones-to-the-end"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3229,"title":"Minimum Operations to Make Array Equal to Target","titleSlug":"minimum-operations-to-make-array-equal-to-target"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3230,"title":"Customer Purchasing Behavior Analysis","titleSlug":"customer-purchasing-behavior-analysis"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3231,"title":"Minimum Number of Increasing Subsequence to Be Removed","titleSlug":"minimum-number-of-increasing-subsequence-to-be-removed"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3232,"title":"Find if Digit Game Can Be Won","titleSlug":"find-if-digit-game-can-be-won"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3233,"title":"Find the Count of Numbers Which Are Not Special","titleSlug":"find-the-count-of-numbers-which-are-not-special"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3234,"title":"Count the Number of Substrings With Dominant Ones","titleSlug":"count-the-number-of-substrings-with-dominant-ones"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3235,"title":"Check if the Rectangle Corner Is Reachable","titleSlug":"check-if-the-rectangle-corner-is-reachable"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3236,"title":"CEO Subordinate Hierarchy","titleSlug":"ceo-subordinate-hierarchy"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3237,"title":"Alt and Tab Simulation","titleSlug":"alt-and-tab-simulation"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3238,"title":"Find the Number of Winning Players","titleSlug":"find-the-number-of-winning-players"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3239,"title":"Minimum Number of Flips to Make Binary Grid Palindromic I","titleSlug":"minimum-number-of-flips-to-make-binary-grid-palindromic-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3240,"title":"Minimum Number of Flips to Make Binary Grid Palindromic II","titleSlug":"minimum-number-of-flips-to-make-binary-grid-palindromic-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3241,"title":"Time Taken to Mark All Nodes","titleSlug":"time-taken-to-mark-all-nodes"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3242,"title":"Design Neighbor Sum Service","titleSlug":"design-neighbor-sum-service"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3243,"title":"Shortest Distance After Road Addition Queries I","titleSlug":"shortest-distance-after-road-addition-queries-i"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3244,"title":"Shortest Distance After Road Addition Queries II","titleSlug":"shortest-distance-after-road-addition-queries-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3245,"title":"Alternating Groups III","titleSlug":"alternating-groups-iii"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3246,"title":"Premier League Table Ranking","titleSlug":"premier-league-table-ranking"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3247,"title":"Number of Subsequences with Odd Sum","titleSlug":"number-of-subsequences-with-odd-sum"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3248,"title":"Snake in Matrix","titleSlug":"snake-in-matrix"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3249,"title":"Count the Number of Good Nodes","titleSlug":"count-the-number-of-good-nodes"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3250,"title":"Find the Count of Monotonic Pairs I","titleSlug":"find-the-count-of-monotonic-pairs-i"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3251,"title":"Find the Count of Monotonic Pairs II","titleSlug":"find-the-count-of-monotonic-pairs-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3252,"title":"Premier League Table Ranking II","titleSlug":"premier-league-table-ranking-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3253,"title":"Construct String with Minimum Cost (Easy)","titleSlug":"construct-string-with-minimum-cost-easy"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3254,"title":"Find the Power of K-Size Subarrays I","titleSlug":"find-the-power-of-k-size-subarrays-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3255,"title":"Find the Power of K-Size Subarrays II","titleSlug":"find-the-power-of-k-size-subarrays-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3256,"title":"Maximum Value Sum by Placing Three Rooks I","titleSlug":"maximum-value-sum-by-placing-three-rooks-i"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3257,"title":"Maximum Value Sum by Placing Three Rooks II","titleSlug":"maximum-value-sum-by-placing-three-rooks-ii"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3258,"title":"Count Substrings That Satisfy K-Constraint I","titleSlug":"count-substrings-that-satisfy-k-constraint-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3259,"title":"Maximum Energy Boost From Two Drinks","titleSlug":"maximum-energy-boost-from-two-drinks"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3260,"title":"Find the Largest Palindrome Divisible by K","titleSlug":"find-the-largest-palindrome-divisible-by-k"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3261,"title":"Count Substrings That Satisfy K-Constraint II","titleSlug":"count-substrings-that-satisfy-k-constraint-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3262,"title":"Find Overlapping Shifts","titleSlug":"find-overlapping-shifts"}
-{"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3263,"title":"Convert Doubly Linked List to Array I","titleSlug":"convert-doubly-linked-list-to-array-i"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3264,"title":"Final Array State After K Multiplication Operations I","titleSlug":"final-array-state-after-k-multiplication-operations-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3265,"title":"Count Almost Equal Pairs I","titleSlug":"count-almost-equal-pairs-i"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3266,"title":"Final Array State After K Multiplication Operations II","titleSlug":"final-array-state-after-k-multiplication-operations-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3267,"title":"Count Almost Equal Pairs II","titleSlug":"count-almost-equal-pairs-ii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3268,"title":"Find Overlapping Shifts II","titleSlug":"find-overlapping-shifts-ii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3269,"title":"Constructing Two Increasing Arrays","titleSlug":"constructing-two-increasing-arrays"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3270,"title":"Find the Key of the Numbers","titleSlug":"find-the-key-of-the-numbers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3271,"title":"Hash Divided String","titleSlug":"hash-divided-string"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3272,"title":"Find the Count of Good Integers","titleSlug":"find-the-count-of-good-integers"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3273,"title":"Minimum Amount of Damage Dealt to Bob","titleSlug":"minimum-amount-of-damage-dealt-to-bob"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3274,"title":"Check if Two Chessboard Squares Have the Same Color","titleSlug":"check-if-two-chessboard-squares-have-the-same-color"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3275,"title":"K-th Nearest Obstacle Queries","titleSlug":"k-th-nearest-obstacle-queries"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3276,"title":"Select Cells in Grid With Maximum Score","titleSlug":"select-cells-in-grid-with-maximum-score"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3277,"title":"Maximum XOR Score Subarray Queries","titleSlug":"maximum-xor-score-subarray-queries"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3278,"title":"Find Candidates for Data Scientist Position II","titleSlug":"find-candidates-for-data-scientist-position-ii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3279,"title":"Maximum Total Area Occupied by Pistons","titleSlug":"maximum-total-area-occupied-by-pistons"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3280,"title":"Convert Date to Binary","titleSlug":"convert-date-to-binary"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3281,"title":"Maximize Score of Numbers in Ranges","titleSlug":"maximize-score-of-numbers-in-ranges"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3282,"title":"Reach End of Array With Max Score","titleSlug":"reach-end-of-array-with-max-score"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3283,"title":"Maximum Number of Moves to Kill All Pawns","titleSlug":"maximum-number-of-moves-to-kill-all-pawns"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3284,"title":"Sum of Consecutive Subarrays","titleSlug":"sum-of-consecutive-subarrays"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3285,"title":"Find Indices of Stable Mountains","titleSlug":"find-indices-of-stable-mountains"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3286,"title":"Find a Safe Walk Through a Grid","titleSlug":"find-a-safe-walk-through-a-grid"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3287,"title":"Find the Maximum Sequence Value of Array","titleSlug":"find-the-maximum-sequence-value-of-array"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3288,"title":"Length of the Longest Increasing Path","titleSlug":"length-of-the-longest-increasing-path"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3289,"title":"The Two Sneaky Numbers of Digitville","titleSlug":"the-two-sneaky-numbers-of-digitville"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3290,"title":"Maximum Multiplication Score","titleSlug":"maximum-multiplication-score"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3291,"title":"Minimum Number of Valid Strings to Form Target I","titleSlug":"minimum-number-of-valid-strings-to-form-target-i"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3292,"title":"Minimum Number of Valid Strings to Form Target II","titleSlug":"minimum-number-of-valid-strings-to-form-target-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3293,"title":"Calculate Product Final Price","titleSlug":"calculate-product-final-price"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3294,"title":"Convert Doubly Linked List to Array II","titleSlug":"convert-doubly-linked-list-to-array-ii"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3295,"title":"Report Spam Message","titleSlug":"report-spam-message"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3296,"title":"Minimum Number of Seconds to Make Mountain Height Zero","titleSlug":"minimum-number-of-seconds-to-make-mountain-height-zero"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3297,"title":"Count Substrings That Can Be Rearranged to Contain a String I","titleSlug":"count-substrings-that-can-be-rearranged-to-contain-a-string-i"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3298,"title":"Count Substrings That Can Be Rearranged to Contain a String II","titleSlug":"count-substrings-that-can-be-rearranged-to-contain-a-string-ii"}
-{"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3299,"title":"Sum of Consecutive Subsequences","titleSlug":"sum-of-consecutive-subsequences"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3300,"title":"Minimum Element After Replacement With Digit Sum","titleSlug":"minimum-element-after-replacement-with-digit-sum"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3301,"title":"Maximize the Total Height of Unique Towers","titleSlug":"maximize-the-total-height-of-unique-towers"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3302,"title":"Find the Lexicographically Smallest Valid Sequence","titleSlug":"find-the-lexicographically-smallest-valid-sequence"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3303,"title":"Find the Occurrence of First Almost Equal Substring","titleSlug":"find-the-occurrence-of-first-almost-equal-substring"}
-{"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3304,"title":"Find the K-th Character in String Game I","titleSlug":"find-the-k-th-character-in-string-game-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3305,"title":"Count of Substrings Containing Every Vowel and K Consonants I","titleSlug":"count-of-substrings-containing-every-vowel-and-k-consonants-i"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3306,"title":"Count of Substrings Containing Every Vowel and K Consonants II","titleSlug":"count-of-substrings-containing-every-vowel-and-k-consonants-ii"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3307,"title":"Find the K-th Character in String Game II","titleSlug":"find-the-k-th-character-in-string-game-ii"}
-{"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3308,"title":"Find Top Performing Driver","titleSlug":"find-top-performing-driver"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3309,"title":"Maximum Possible Number by Binary Concatenation","titleSlug":"maximum-possible-number-by-binary-concatenation"}
-{"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3310,"title":"Remove Methods From Project","titleSlug":"remove-methods-from-project"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3311,"title":"Construct 2D Grid Matching Graph Layout","titleSlug":"construct-2d-grid-matching-graph-layout"}
-{"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3312,"title":"Sorted GCD Pair Queries","titleSlug":"sorted-gcd-pair-queries"}
+{"chalengeQuestionDates":["2024-08-27","2021-08-02"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1,"title":"Two Sum","titleSlug":"two-sum"}
+{"chalengeQuestionDates":["2022-03-10","2021-01-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2,"title":"Add Two Numbers","titleSlug":"add-two-numbers"}
+{"chalengeQuestionDates":["2022-06-10","2021-01-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3,"title":"Longest Substring Without Repeating Characters","titleSlug":"longest-substring-without-repeating-characters"}
+{"chalengeQuestionDates":["2023-09-21"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":4,"title":"Median of Two Sorted Arrays","titleSlug":"median-of-two-sorted-arrays"}
+{"chalengeQuestionDates":["2023-10-27","2022-06-16","2021-01-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":5,"title":"Longest Palindromic Substring","titleSlug":"longest-palindromic-substring"}
+{"chalengeQuestionDates":["2023-02-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":6,"title":"Zigzag Conversion","titleSlug":"zigzag-conversion"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":7,"title":"Reverse Integer","titleSlug":"reverse-integer"}
+{"chalengeQuestionDates":["2022-01-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":8,"title":"String to Integer (atoi)","titleSlug":"string-to-integer-atoi"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":9,"title":"Palindrome Number","titleSlug":"palindrome-number"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":10,"title":"Regular Expression Matching","titleSlug":"regular-expression-matching"}
+{"chalengeQuestionDates":["2022-04-05","2021-02-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":11,"title":"Container With Most Water","titleSlug":"container-with-most-water"}
+{"chalengeQuestionDates":["2022-10-20","2021-03-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":12,"title":"Integer to Roman","titleSlug":"integer-to-roman"}
+{"chalengeQuestionDates":["2022-08-15","2021-02-20"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":13,"title":"Roman to Integer","titleSlug":"roman-to-integer"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":14,"title":"Longest Common Prefix","titleSlug":"longest-common-prefix"}
+{"chalengeQuestionDates":["2021-10-28","2020-07-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":15,"title":"3Sum","titleSlug":"3sum"}
+{"chalengeQuestionDates":["2022-10-08","2021-07-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":16,"title":"3Sum Closest","titleSlug":"3sum-closest"}
+{"chalengeQuestionDates":["2023-08-03","2022-05-09","2021-04-08"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":17,"title":"Letter Combinations of a Phone Number","titleSlug":"letter-combinations-of-a-phone-number"}
+{"chalengeQuestionDates":["2021-07-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":18,"title":"4Sum","titleSlug":"4sum"}
+{"chalengeQuestionDates":["2024-03-03","2022-09-28","2021-04-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":19,"title":"Remove Nth Node From End of List","titleSlug":"remove-nth-node-from-end-of-list"}
+{"chalengeQuestionDates":["2023-04-10","2022-03-13","2021-01-20"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":20,"title":"Valid Parentheses","titleSlug":"valid-parentheses"}
+{"chalengeQuestionDates":["2022-03-07","2021-01-04"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":21,"title":"Merge Two Sorted Lists","titleSlug":"merge-two-sorted-lists"}
+{"chalengeQuestionDates":["2021-06-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":22,"title":"Generate Parentheses","titleSlug":"generate-parentheses"}
+{"chalengeQuestionDates":["2023-03-12","2022-02-05","2021-01-24"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":23,"title":"Merge k Sorted Lists","titleSlug":"merge-k-sorted-lists"}
+{"chalengeQuestionDates":["2023-05-16","2022-02-16","2020-12-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":24,"title":"Swap Nodes in Pairs","titleSlug":"swap-nodes-in-pairs"}
+{"chalengeQuestionDates":["2021-07-18"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":25,"title":"Reverse Nodes in k-Group","titleSlug":"reverse-nodes-in-k-group"}
+{"chalengeQuestionDates":["2022-11-11"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":26,"title":"Remove Duplicates from Sorted Array","titleSlug":"remove-duplicates-from-sorted-array"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":27,"title":"Remove Element","titleSlug":"remove-element"}
+{"chalengeQuestionDates":["2023-03-03"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":28,"title":"Find the Index of the First Occurrence in a String","titleSlug":"find-the-index-of-the-first-occurrence-in-a-string"}
+{"chalengeQuestionDates":["2022-05-30","2021-02-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":29,"title":"Divide Two Integers","titleSlug":"divide-two-integers"}
+{"chalengeQuestionDates":["2022-08-13"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":30,"title":"Substring with Concatenation of All Words","titleSlug":"substring-with-concatenation-of-all-words"}
+{"chalengeQuestionDates":["2022-04-03","2021-01-31"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":31,"title":"Next Permutation","titleSlug":"next-permutation"}
+{"chalengeQuestionDates":["2022-05-24","2021-04-03"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":32,"title":"Longest Valid Parentheses","titleSlug":"longest-valid-parentheses"}
+{"chalengeQuestionDates":["2023-08-08","2020-04-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":33,"title":"Search in Rotated Sorted Array","titleSlug":"search-in-rotated-sorted-array"}
+{"chalengeQuestionDates":["2023-10-09","2022-07-25","2021-04-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":34,"title":"Find First and Last Position of Element in Sorted Array","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"}
+{"chalengeQuestionDates":["2023-02-20","2021-11-26","2020-06-10"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":35,"title":"Search Insert Position","titleSlug":"search-insert-position"}
+{"chalengeQuestionDates":["2022-11-23","2021-08-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":36,"title":"Valid Sudoku","titleSlug":"valid-sudoku"}
+{"chalengeQuestionDates":["2021-08-21"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":37,"title":"Sudoku Solver","titleSlug":"sudoku-solver"}
+{"chalengeQuestionDates":["2022-10-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":38,"title":"Count and Say","titleSlug":"count-and-say"}
+{"chalengeQuestionDates":["2022-02-17","2020-10-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":39,"title":"Combination Sum","titleSlug":"combination-sum"}
+{"chalengeQuestionDates":["2024-08-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":40,"title":"Combination Sum II","titleSlug":"combination-sum-ii"}
+{"chalengeQuestionDates":["2024-03-26","2020-09-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":41,"title":"First Missing Positive","titleSlug":"first-missing-positive"}
+{"chalengeQuestionDates":["2024-04-12","2022-09-18","2021-07-31"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":42,"title":"Trapping Rain Water","titleSlug":"trapping-rain-water"}
+{"chalengeQuestionDates":["2021-11-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":43,"title":"Multiply Strings","titleSlug":"multiply-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":44,"title":"Wildcard Matching","titleSlug":"wildcard-matching"}
+{"chalengeQuestionDates":["2023-02-08","2021-05-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":45,"title":"Jump Game II","titleSlug":"jump-game-ii"}
+{"chalengeQuestionDates":["2023-08-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":46,"title":"Permutations","titleSlug":"permutations"}
+{"chalengeQuestionDates":["2022-05-12","2020-11-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":47,"title":"Permutations II","titleSlug":"permutations-ii"}
+{"chalengeQuestionDates":["2022-08-30","2021-04-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":48,"title":"Rotate Image","titleSlug":"rotate-image"}
+{"chalengeQuestionDates":["2024-02-06","2022-10-28","2021-08-12","2020-04-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":49,"title":"Group Anagrams","titleSlug":"group-anagrams"}
+{"chalengeQuestionDates":["2023-07-24","2020-07-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":50,"title":"Pow(x, n)","titleSlug":"powx-n"}
+{"chalengeQuestionDates":["2022-06-04","2021-05-22"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":51,"title":"N-Queens","titleSlug":"n-queens"}
+{"chalengeQuestionDates":["2022-06-05","2021-05-29"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":52,"title":"N-Queens II","titleSlug":"n-queens-ii"}
+{"chalengeQuestionDates":["2021-11-25","2020-04-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":53,"title":"Maximum Subarray","titleSlug":"maximum-subarray"}
+{"chalengeQuestionDates":["2023-05-09","2021-09-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":54,"title":"Spiral Matrix","titleSlug":"spiral-matrix"}
+{"chalengeQuestionDates":["2022-12-26","2021-10-03","2020-04-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":55,"title":"Jump Game","titleSlug":"jump-game"}
+{"chalengeQuestionDates":["2021-12-24","2020-11-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":56,"title":"Merge Intervals","titleSlug":"merge-intervals"}
+{"chalengeQuestionDates":["2024-03-17","2023-01-16","2020-09-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":57,"title":"Insert Interval","titleSlug":"insert-interval"}
+{"chalengeQuestionDates":["2024-04-01","2020-09-15"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":58,"title":"Length of Last Word","titleSlug":"length-of-last-word"}
+{"chalengeQuestionDates":["2023-05-10","2022-04-13","2020-12-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":59,"title":"Spiral Matrix II","titleSlug":"spiral-matrix-ii"}
+{"chalengeQuestionDates":["2020-06-20"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":60,"title":"Permutation Sequence","titleSlug":"permutation-sequence"}
+{"chalengeQuestionDates":["2022-03-11","2020-10-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":61,"title":"Rotate List","titleSlug":"rotate-list"}
+{"chalengeQuestionDates":["2023-09-03","2022-08-01","2021-11-17","2020-06-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":62,"title":"Unique Paths","titleSlug":"unique-paths"}
+{"chalengeQuestionDates":["2023-08-12","2022-05-20","2021-04-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":63,"title":"Unique Paths II","titleSlug":"unique-paths-ii"}
+{"chalengeQuestionDates":["2023-03-27","2020-04-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":64,"title":"Minimum Path Sum","titleSlug":"minimum-path-sum"}
+{"chalengeQuestionDates":["2021-05-15"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":65,"title":"Valid Number","titleSlug":"valid-number"}
+{"chalengeQuestionDates":["2020-07-07"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":66,"title":"Plus One","titleSlug":"plus-one"}
+{"chalengeQuestionDates":["2023-02-14","2022-01-10","2020-07-20"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":67,"title":"Add Binary","titleSlug":"add-binary"}
+{"chalengeQuestionDates":["2023-08-24"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":68,"title":"Text Justification","titleSlug":"text-justification"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":69,"title":"Sqrt(x)","titleSlug":"sqrtx"}
+{"chalengeQuestionDates":["2024-01-18","2022-12-12","2021-10-05","2020-07-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":70,"title":"Climbing Stairs","titleSlug":"climbing-stairs"}
+{"chalengeQuestionDates":["2023-04-12","2022-03-14","2021-02-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":71,"title":"Simplify Path","titleSlug":"simplify-path"}
+{"chalengeQuestionDates":["2023-02-26","2020-05-31"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":72,"title":"Edit Distance","titleSlug":"edit-distance"}
+{"chalengeQuestionDates":["2021-08-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":73,"title":"Set Matrix Zeroes","titleSlug":"set-matrix-zeroes"}
+{"chalengeQuestionDates":["2023-08-07","2022-03-30","2020-10-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":74,"title":"Search a 2D Matrix","titleSlug":"search-a-2d-matrix"}
+{"chalengeQuestionDates":["2024-06-12","2021-10-27","2020-06-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":75,"title":"Sort Colors","titleSlug":"sort-colors"}
+{"chalengeQuestionDates":["2024-02-04","2022-10-22","2021-08-15"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":76,"title":"Minimum Window Substring","titleSlug":"minimum-window-substring"}
+{"chalengeQuestionDates":["2023-08-01"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":77,"title":"Combinations","titleSlug":"combinations"}
+{"chalengeQuestionDates":["2024-05-21","2022-02-13","2020-07-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":78,"title":"Subsets","titleSlug":"subsets"}
+{"chalengeQuestionDates":["2024-04-03","2022-11-24","2021-10-07","2020-07-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":79,"title":"Word Search","titleSlug":"word-search"}
+{"chalengeQuestionDates":["2022-02-06","2020-12-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":80,"title":"Remove Duplicates from Sorted Array II","titleSlug":"remove-duplicates-from-sorted-array-ii"}
+{"chalengeQuestionDates":["2023-08-10","2022-03-28","2020-11-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":81,"title":"Search in Rotated Sorted Array II","titleSlug":"search-in-rotated-sorted-array-ii"}
+{"chalengeQuestionDates":["2022-03-09","2021-01-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":82,"title":"Remove Duplicates from Sorted List II","titleSlug":"remove-duplicates-from-sorted-list-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":83,"title":"Remove Duplicates from Sorted List","titleSlug":"remove-duplicates-from-sorted-list"}
+{"chalengeQuestionDates":["2022-01-29","2020-12-31"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":84,"title":"Largest Rectangle in Histogram","titleSlug":"largest-rectangle-in-histogram"}
+{"chalengeQuestionDates":["2024-04-13","2021-11-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":85,"title":"Maximal Rectangle","titleSlug":"maximal-rectangle"}
+{"chalengeQuestionDates":["2023-08-15","2022-07-22","2021-04-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":86,"title":"Partition List","titleSlug":"partition-list"}
+{"chalengeQuestionDates":["2023-03-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":87,"title":"Scramble String","titleSlug":"scramble-string"}
+{"chalengeQuestionDates":["2022-06-07","2021-01-11"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":88,"title":"Merge Sorted Array","titleSlug":"merge-sorted-array"}
+{"chalengeQuestionDates":["2021-07-01"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":89,"title":"Gray Code","titleSlug":"gray-code"}
+{"chalengeQuestionDates":["2021-08-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":90,"title":"Subsets II","titleSlug":"subsets-ii"}
+{"chalengeQuestionDates":["2023-12-25","2022-10-01","2021-08-18","2020-12-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":91,"title":"Decode Ways","titleSlug":"decode-ways"}
+{"chalengeQuestionDates":["2023-09-07","2022-07-21","2021-06-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":92,"title":"Reverse Linked List II","titleSlug":"reverse-linked-list-ii"}
+{"chalengeQuestionDates":["2023-01-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":93,"title":"Restore IP Addresses","titleSlug":"restore-ip-addresses"}
+{"chalengeQuestionDates":["2023-12-09","2022-09-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":94,"title":"Binary Tree Inorder Traversal","titleSlug":"binary-tree-inorder-traversal"}
+{"chalengeQuestionDates":["2023-08-05","2021-09-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":95,"title":"Unique Binary Search Trees II","titleSlug":"unique-binary-search-trees-ii"}
+{"chalengeQuestionDates":["2021-11-08","2020-06-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":96,"title":"Unique Binary Search Trees","titleSlug":"unique-binary-search-trees"}
+{"chalengeQuestionDates":["2023-08-25","2022-07-07","2021-06-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":97,"title":"Interleaving String","titleSlug":"interleaving-string"}
+{"chalengeQuestionDates":["2022-08-11","2020-12-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":98,"title":"Validate Binary Search Tree","titleSlug":"validate-binary-search-tree"}
+{"chalengeQuestionDates":["2022-04-19","2020-10-31"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":99,"title":"Recover Binary Search Tree","titleSlug":"recover-binary-search-tree"}
+{"chalengeQuestionDates":["2024-02-26","2023-01-10","2020-07-14"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":100,"title":"Same Tree","titleSlug":"same-tree"}
+{"chalengeQuestionDates":["2023-03-13"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":101,"title":"Symmetric Tree","titleSlug":"symmetric-tree"}
+{"chalengeQuestionDates":["2022-07-13","2021-05-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":102,"title":"Binary Tree Level Order Traversal","titleSlug":"binary-tree-level-order-traversal"}
+{"chalengeQuestionDates":["2023-02-19","2020-07-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":103,"title":"Binary Tree Zigzag Level Order Traversal","titleSlug":"binary-tree-zigzag-level-order-traversal"}
+{"chalengeQuestionDates":["2023-02-16","2022-02-14","2020-12-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":104,"title":"Maximum Depth of Binary Tree","titleSlug":"maximum-depth-of-binary-tree"}
+{"chalengeQuestionDates":["2022-07-14","2021-06-08"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":105,"title":"Construct Binary Tree from Preorder and Inorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"}
+{"chalengeQuestionDates":["2023-03-16","2021-11-21","2020-07-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":106,"title":"Construct Binary Tree from Inorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"}
+{"chalengeQuestionDates":["2020-07-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":107,"title":"Binary Tree Level Order Traversal II","titleSlug":"binary-tree-level-order-traversal-ii"}
+{"chalengeQuestionDates":["2022-08-10","2021-07-26"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":108,"title":"Convert Sorted Array to Binary Search Tree","titleSlug":"convert-sorted-array-to-binary-search-tree"}
+{"chalengeQuestionDates":["2023-03-11","2021-05-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":109,"title":"Convert Sorted List to Binary Search Tree","titleSlug":"convert-sorted-list-to-binary-search-tree"}
+{"chalengeQuestionDates":["2020-12-22"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":110,"title":"Balanced Binary Tree","titleSlug":"balanced-binary-tree"}
+{"chalengeQuestionDates":["2023-07-10","2020-10-22"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":111,"title":"Minimum Depth of Binary Tree","titleSlug":"minimum-depth-of-binary-tree"}
+{"chalengeQuestionDates":["2022-10-04"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":112,"title":"Path Sum","titleSlug":"path-sum"}
+{"chalengeQuestionDates":["2022-09-24","2021-08-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":113,"title":"Path Sum II","titleSlug":"path-sum-ii"}
+{"chalengeQuestionDates":["2022-07-27","2021-05-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":114,"title":"Flatten Binary Tree to Linked List","titleSlug":"flatten-binary-tree-to-linked-list"}
+{"chalengeQuestionDates":["2021-09-19"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":115,"title":"Distinct Subsequences","titleSlug":"distinct-subsequences"}
+{"chalengeQuestionDates":["2021-12-29","2020-11-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":116,"title":"Populating Next Right Pointers in Each Node","titleSlug":"populating-next-right-pointers-in-each-node"}
+{"chalengeQuestionDates":["2022-05-13","2020-12-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":117,"title":"Populating Next Right Pointers in Each Node II","titleSlug":"populating-next-right-pointers-in-each-node-ii"}
+{"chalengeQuestionDates":["2023-09-08","2022-07-19","2021-06-21"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":118,"title":"Pascal's Triangle","titleSlug":"pascals-triangle"}
+{"chalengeQuestionDates":["2023-10-16","2020-08-12"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":119,"title":"Pascal's Triangle II","titleSlug":"pascals-triangle-ii"}
+{"chalengeQuestionDates":["2022-06-13","2021-04-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":120,"title":"Triangle","titleSlug":"triangle"}
+{"chalengeQuestionDates":["2023-02-25","2022-02-01","2020-09-18"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":121,"title":"Best Time to Buy and Sell Stock","titleSlug":"best-time-to-buy-and-sell-stock"}
+{"chalengeQuestionDates":["2021-11-10","2020-04-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":122,"title":"Best Time to Buy and Sell Stock II","titleSlug":"best-time-to-buy-and-sell-stock-ii"}
+{"chalengeQuestionDates":["2021-10-16","2020-08-16"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":123,"title":"Best Time to Buy and Sell Stock III","titleSlug":"best-time-to-buy-and-sell-stock-iii"}
+{"chalengeQuestionDates":["2022-12-11","2020-04-29"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":124,"title":"Binary Tree Maximum Path Sum","titleSlug":"binary-tree-maximum-path-sum"}
+{"chalengeQuestionDates":["2020-08-03"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":125,"title":"Valid Palindrome","titleSlug":"valid-palindrome"}
+{"chalengeQuestionDates":["2022-08-14","2021-07-24"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":126,"title":"Word Ladder II","titleSlug":"word-ladder-ii"}
+{"chalengeQuestionDates":["2022-02-12","2021-01-09"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":127,"title":"Word Ladder","titleSlug":"word-ladder"}
+{"chalengeQuestionDates":["2022-07-05","2021-06-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":128,"title":"Longest Consecutive Sequence","titleSlug":"longest-consecutive-sequence"}
+{"chalengeQuestionDates":["2024-04-15","2023-03-14","2021-11-03","2020-06-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":129,"title":"Sum Root to Leaf Numbers","titleSlug":"sum-root-to-leaf-numbers"}
+{"chalengeQuestionDates":["2021-11-01","2020-06-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":130,"title":"Surrounded Regions","titleSlug":"surrounded-regions"}
+{"chalengeQuestionDates":["2024-05-22","2023-01-22","2022-01-05","2020-12-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":131,"title":"Palindrome Partitioning","titleSlug":"palindrome-partitioning"}
+{"chalengeQuestionDates":["2021-08-07"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":132,"title":"Palindrome Partitioning II","titleSlug":"palindrome-partitioning-ii"}
+{"chalengeQuestionDates":["2023-04-08","2022-02-23","2020-10-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":133,"title":"Clone Graph","titleSlug":"clone-graph"}
+{"chalengeQuestionDates":["2023-01-07","2022-01-21","2020-09-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":134,"title":"Gas Station","titleSlug":"gas-station"}
+{"chalengeQuestionDates":["2023-09-13","2022-07-04","2021-06-27"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":135,"title":"Candy","titleSlug":"candy"}
+{"chalengeQuestionDates":["2022-02-15","2020-04-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":136,"title":"Single Number","titleSlug":"single-number"}
+{"chalengeQuestionDates":["2023-07-04","2020-06-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":137,"title":"Single Number II","titleSlug":"single-number-ii"}
+{"chalengeQuestionDates":["2023-09-05","2022-03-12","2021-02-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":138,"title":"Copy List with Random Pointer","titleSlug":"copy-list-with-random-pointer"}
+{"chalengeQuestionDates":["2023-08-04","2020-09-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":139,"title":"Word Break","titleSlug":"word-break"}
+{"chalengeQuestionDates":["2024-05-25","2020-07-31"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":140,"title":"Word Break II","titleSlug":"word-break-ii"}
+{"chalengeQuestionDates":["2024-03-06","2023-09-04","2022-03-08","2021-02-03"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":141,"title":"Linked List Cycle","titleSlug":"linked-list-cycle"}
+{"chalengeQuestionDates":["2023-03-09","2022-01-19","2020-10-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":142,"title":"Linked List Cycle II","titleSlug":"linked-list-cycle-ii"}
+{"chalengeQuestionDates":["2024-03-23","2021-12-22","2020-08-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":143,"title":"Reorder List","titleSlug":"reorder-list"}
+{"chalengeQuestionDates":["2023-01-09"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":144,"title":"Binary Tree Preorder Traversal","titleSlug":"binary-tree-preorder-traversal"}
+{"chalengeQuestionDates":["2024-08-25"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":145,"title":"Binary Tree Postorder Traversal","titleSlug":"binary-tree-postorder-traversal"}
+{"chalengeQuestionDates":["2023-07-18","2020-04-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":146,"title":"LRU Cache","titleSlug":"lru-cache"}
+{"chalengeQuestionDates":["2021-12-15","2020-11-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":147,"title":"Insertion Sort List","titleSlug":"insertion-sort-list"}
+{"chalengeQuestionDates":["2022-02-24","2020-10-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":148,"title":"Sort List","titleSlug":"sort-list"}
+{"chalengeQuestionDates":["2023-01-08"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":149,"title":"Max Points on a Line","titleSlug":"max-points-on-a-line"}
+{"chalengeQuestionDates":["2024-01-30","2022-12-17","2021-05-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":150,"title":"Evaluate Reverse Polish Notation","titleSlug":"evaluate-reverse-polish-notation"}
+{"chalengeQuestionDates":["2022-11-13","2021-10-20","2020-07-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":151,"title":"Reverse Words in a String","titleSlug":"reverse-words-in-a-string"}
+{"chalengeQuestionDates":["2021-12-03","2020-09-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":152,"title":"Maximum Product Subarray","titleSlug":"maximum-product-subarray"}
+{"chalengeQuestionDates":["2021-08-31"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":153,"title":"Find Minimum in Rotated Sorted Array","titleSlug":"find-minimum-in-rotated-sorted-array"}
+{"chalengeQuestionDates":["2021-10-23","2020-07-26"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":154,"title":"Find Minimum in Rotated Sorted Array II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"}
+{"chalengeQuestionDates":["2021-10-25","2020-04-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":155,"title":"Min Stack","titleSlug":"min-stack"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":156,"title":"Binary Tree Upside Down","titleSlug":"binary-tree-upside-down"}
+{"chalengeQuestionDates":["2020-09-01"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":157,"title":"Read N Characters Given Read4","titleSlug":"read-n-characters-given-read4"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":158,"title":"Read N Characters Given read4 II - Call Multiple Times","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"}
+{"chalengeQuestionDates":["2024-04-01","2023-12-22","2022-09-15","2020-11-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":159,"title":"Longest Substring with At Most Two Distinct Characters","titleSlug":"longest-substring-with-at-most-two-distinct-characters"}
+{"chalengeQuestionDates":["2022-06-06","2021-03-04"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":160,"title":"Intersection of Two Linked Lists","titleSlug":"intersection-of-two-linked-lists"}
+{"chalengeQuestionDates":["2021-01-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":161,"title":"One Edit Distance","titleSlug":"one-edit-distance"}
+{"chalengeQuestionDates":["2021-07-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":162,"title":"Find Peak Element","titleSlug":"find-peak-element"}
+{"chalengeQuestionDates":["2023-06-15","2020-12-08"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":163,"title":"Missing Ranges","titleSlug":"missing-ranges"}
+{"chalengeQuestionDates":["2021-05-30"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":164,"title":"Maximum Gap","titleSlug":"maximum-gap"}
+{"chalengeQuestionDates":["2024-05-03","2022-02-25","2020-09-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":165,"title":"Compare Version Numbers","titleSlug":"compare-version-numbers"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":166,"title":"Fraction to Recurring Decimal","titleSlug":"fraction-to-recurring-decimal"}
+{"chalengeQuestionDates":["2022-06-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":167,"title":"Two Sum II - Input Array Is Sorted","titleSlug":"two-sum-ii-input-array-is-sorted"}
+{"chalengeQuestionDates":["2023-08-22"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":168,"title":"Excel Sheet Column Title","titleSlug":"excel-sheet-column-title"}
+{"chalengeQuestionDates":["2024-02-12","2022-02-21","2020-05-06"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":169,"title":"Majority Element","titleSlug":"majority-element"}
+{"chalengeQuestionDates":["2020-10-08"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":170,"title":"Two Sum III - Data structure design","titleSlug":"two-sum-iii-data-structure-design"}
+{"chalengeQuestionDates":["2022-02-22","2020-08-10"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":171,"title":"Excel Sheet Column Number","titleSlug":"excel-sheet-column-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":172,"title":"Factorial Trailing Zeroes","titleSlug":"factorial-trailing-zeroes"}
+{"chalengeQuestionDates":["2022-04-20","2020-12-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":173,"title":"Binary Search Tree Iterator","titleSlug":"binary-search-tree-iterator"}
+{"chalengeQuestionDates":["2021-10-02","2020-06-21"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":174,"title":"Dungeon Game","titleSlug":"dungeon-game"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":175,"title":"Combine Two Tables","titleSlug":"combine-two-tables"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":176,"title":"Second Highest Salary","titleSlug":"second-highest-salary"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":177,"title":"Nth Highest Salary","titleSlug":"nth-highest-salary"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":178,"title":"Rank Scores","titleSlug":"rank-scores"}
+{"chalengeQuestionDates":["2024-09-18","2020-09-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":179,"title":"Largest Number","titleSlug":"largest-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":180,"title":"Consecutive Numbers","titleSlug":"consecutive-numbers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":181,"title":"Employees Earning More Than Their Managers","titleSlug":"employees-earning-more-than-their-managers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":182,"title":"Duplicate Emails","titleSlug":"duplicate-emails"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":183,"title":"Customers Who Never Order","titleSlug":"customers-who-never-order"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":184,"title":"Department Highest Salary","titleSlug":"department-highest-salary"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":185,"title":"Department Top Three Salaries","titleSlug":"department-top-three-salaries"}
+{"chalengeQuestionDates":["2021-07-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":186,"title":"Reverse Words in a String II","titleSlug":"reverse-words-in-a-string-ii"}
+{"chalengeQuestionDates":["2020-10-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":187,"title":"Repeated DNA Sequences","titleSlug":"repeated-dna-sequences"}
+{"chalengeQuestionDates":["2022-09-10","2020-10-18"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":188,"title":"Best Time to Buy and Sell Stock IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"}
+{"chalengeQuestionDates":["2022-01-30","2020-10-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":189,"title":"Rotate Array","titleSlug":"rotate-array"}
+{"chalengeQuestionDates":["2020-07-13"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":190,"title":"Reverse Bits","titleSlug":"reverse-bits"}
+{"chalengeQuestionDates":["2023-11-29","2022-05-26","2021-02-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":191,"title":"Number of 1 Bits","titleSlug":"number-of-1-bits"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":192,"title":"Word Frequency","titleSlug":"word-frequency"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":193,"title":"Valid Phone Numbers","titleSlug":"valid-phone-numbers"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":194,"title":"Transpose File","titleSlug":"transpose-file"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":195,"title":"Tenth Line","titleSlug":"tenth-line"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":196,"title":"Delete Duplicate Emails","titleSlug":"delete-duplicate-emails"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":197,"title":"Rising Temperature","titleSlug":"rising-temperature"}
+{"chalengeQuestionDates":["2024-01-21","2022-12-14","2021-12-01","2020-09-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":198,"title":"House Robber","titleSlug":"house-robber"}
+{"chalengeQuestionDates":["2022-07-11","2021-02-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":199,"title":"Binary Tree Right Side View","titleSlug":"binary-tree-right-side-view"}
+{"chalengeQuestionDates":["2024-04-19","2022-08-29","2020-04-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":200,"title":"Number of Islands","titleSlug":"number-of-islands"}
+{"chalengeQuestionDates":["2024-02-21","2021-10-10","2020-04-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":201,"title":"Bitwise AND of Numbers Range","titleSlug":"bitwise-and-of-numbers-range"}
+{"chalengeQuestionDates":["2020-04-02"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":202,"title":"Happy Number","titleSlug":"happy-number"}
+{"chalengeQuestionDates":["2021-11-12","2020-07-21"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":203,"title":"Remove Linked List Elements","titleSlug":"remove-linked-list-elements"}
+{"chalengeQuestionDates":["2021-05-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":204,"title":"Count Primes","titleSlug":"count-primes"}
+{"chalengeQuestionDates":["2024-04-02","2021-07-12"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":205,"title":"Isomorphic Strings","titleSlug":"isomorphic-strings"}
+{"chalengeQuestionDates":["2024-03-21","2021-09-07"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":206,"title":"Reverse Linked List","titleSlug":"reverse-linked-list"}
+{"chalengeQuestionDates":["2023-07-13","2020-05-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":207,"title":"Course Schedule","titleSlug":"course-schedule"}
+{"chalengeQuestionDates":["2023-03-17","2021-10-08","2020-05-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":208,"title":"Implement Trie (Prefix Tree)","titleSlug":"implement-trie-prefix-tree"}
+{"chalengeQuestionDates":["2023-07-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":209,"title":"Minimum Size Subarray Sum","titleSlug":"minimum-size-subarray-sum"}
+{"chalengeQuestionDates":["2021-12-23","2020-07-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":210,"title":"Course Schedule II","titleSlug":"course-schedule-ii"}
+{"chalengeQuestionDates":["2023-03-19","2022-01-28","2020-08-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":211,"title":"Design Add and Search Words Data Structure","titleSlug":"design-add-and-search-words-data-structure"}
+{"chalengeQuestionDates":["2022-11-05","2021-10-09","2020-06-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":212,"title":"Word Search II","titleSlug":"word-search-ii"}
+{"chalengeQuestionDates":["2020-10-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":213,"title":"House Robber II","titleSlug":"house-robber-ii"}
+{"chalengeQuestionDates":["2024-09-20"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":214,"title":"Shortest Palindrome","titleSlug":"shortest-palindrome"}
+{"chalengeQuestionDates":["2023-08-14","2022-06-22","2021-01-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":215,"title":"Kth Largest Element in an Array","titleSlug":"kth-largest-element-in-an-array"}
+{"chalengeQuestionDates":["2022-05-10","2020-09-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":216,"title":"Combination Sum III","titleSlug":"combination-sum-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":217,"title":"Contains Duplicate","titleSlug":"contains-duplicate"}
+{"chalengeQuestionDates":["2022-09-30","2020-11-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":218,"title":"The Skyline Problem","titleSlug":"the-skyline-problem"}
+{"chalengeQuestionDates":["2022-10-21"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":219,"title":"Contains Duplicate II","titleSlug":"contains-duplicate-ii"}
+{"chalengeQuestionDates":["2020-09-02"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":220,"title":"Contains Duplicate III","titleSlug":"contains-duplicate-iii"}
+{"chalengeQuestionDates":["2021-12-17","2020-04-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":221,"title":"Maximal Square","titleSlug":"maximal-square"}
+{"chalengeQuestionDates":["2022-11-15","2021-10-24","2020-06-23"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":222,"title":"Count Complete Tree Nodes","titleSlug":"count-complete-tree-nodes"}
+{"chalengeQuestionDates":["2022-11-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":223,"title":"Rectangle Area","titleSlug":"rectangle-area"}
+{"chalengeQuestionDates":["2022-11-20","2021-09-11"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":224,"title":"Basic Calculator","titleSlug":"basic-calculator"}
+{"chalengeQuestionDates":["2023-08-28","2022-05-05"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":225,"title":"Implement Stack using Queues","titleSlug":"implement-stack-using-queues"}
+{"chalengeQuestionDates":["2023-02-18","2021-10-26","2020-06-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":226,"title":"Invert Binary Tree","titleSlug":"invert-binary-tree"}
+{"chalengeQuestionDates":["2021-12-25","2020-11-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":227,"title":"Basic Calculator II","titleSlug":"basic-calculator-ii"}
+{"chalengeQuestionDates":["2023-06-12","2022-02-28","2020-10-28"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":228,"title":"Summary Ranges","titleSlug":"summary-ranges"}
+{"chalengeQuestionDates":["2023-10-05","2020-09-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":229,"title":"Majority Element II","titleSlug":"majority-element-ii"}
+{"chalengeQuestionDates":["2022-04-18","2020-05-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":230,"title":"Kth Smallest Element in a BST","titleSlug":"kth-smallest-element-in-a-bst"}
+{"chalengeQuestionDates":["2024-02-19","2021-12-21","2020-06-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":231,"title":"Power of Two","titleSlug":"power-of-two"}
+{"chalengeQuestionDates":["2024-01-29","2022-12-16"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":232,"title":"Implement Queue using Stacks","titleSlug":"implement-queue-using-stacks"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":233,"title":"Number of Digit One","titleSlug":"number-of-digit-one"}
+{"chalengeQuestionDates":["2024-03-22","2022-08-23","2021-04-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":234,"title":"Palindrome Linked List","titleSlug":"palindrome-linked-list"}
+{"chalengeQuestionDates":["2022-08-12","2021-07-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":235,"title":"Lowest Common Ancestor of a Binary Search Tree","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"}
+{"chalengeQuestionDates":["2022-07-26","2021-06-30"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":236,"title":"Lowest Common Ancestor of a Binary Tree","titleSlug":"lowest-common-ancestor-of-a-binary-tree"}
+{"chalengeQuestionDates":["2024-05-05","2022-10-13","2020-06-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":237,"title":"Delete Node in a Linked List","titleSlug":"delete-node-in-a-linked-list"}
+{"chalengeQuestionDates":["2024-03-15","2021-11-27","2020-04-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":238,"title":"Product of Array Except Self","titleSlug":"product-of-array-except-self"}
+{"chalengeQuestionDates":["2023-08-16","2020-11-28"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":239,"title":"Sliding Window Maximum","titleSlug":"sliding-window-maximum"}
+{"chalengeQuestionDates":["2022-07-24","2021-02-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":240,"title":"Search a 2D Matrix II","titleSlug":"search-a-2d-matrix-ii"}
+{"chalengeQuestionDates":["2024-09-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":241,"title":"Different Ways to Add Parentheses","titleSlug":"different-ways-to-add-parentheses"}
+{"chalengeQuestionDates":["2023-12-16","2022-07-28","2021-02-11"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":242,"title":"Valid Anagram","titleSlug":"valid-anagram"}
+{"chalengeQuestionDates":["2020-12-01"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":243,"title":"Shortest Word Distance","titleSlug":"shortest-word-distance"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":244,"title":"Shortest Word Distance II","titleSlug":"shortest-word-distance-ii"}
+{"chalengeQuestionDates":["2023-04-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":245,"title":"Shortest Word Distance III","titleSlug":"shortest-word-distance-iii"}
+{"chalengeQuestionDates":["2022-11-22","2021-03-08"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":246,"title":"Strobogrammatic Number","titleSlug":"strobogrammatic-number"}
+{"chalengeQuestionDates":["2022-03-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":247,"title":"Strobogrammatic Number II","titleSlug":"strobogrammatic-number-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":248,"title":"Strobogrammatic Number III","titleSlug":"strobogrammatic-number-iii"}
+{"chalengeQuestionDates":["2022-01-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":249,"title":"Group Shifted Strings","titleSlug":"group-shifted-strings"}
+{"chalengeQuestionDates":["2023-06-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":250,"title":"Count Univalue Subtrees","titleSlug":"count-univalue-subtrees"}
+{"chalengeQuestionDates":["2022-07-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":251,"title":"Flatten 2D Vector","titleSlug":"flatten-2d-vector"}
+{"chalengeQuestionDates":["2020-11-01"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":252,"title":"Meeting Rooms","titleSlug":"meeting-rooms"}
+{"chalengeQuestionDates":["2024-03-15","2023-05-22","2022-01-15","2020-10-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":253,"title":"Meeting Rooms II","titleSlug":"meeting-rooms-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":254,"title":"Factor Combinations","titleSlug":"factor-combinations"}
+{"chalengeQuestionDates":["2024-04-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":255,"title":"Verify Preorder Sequence in Binary Search Tree","titleSlug":"verify-preorder-sequence-in-binary-search-tree"}
+{"chalengeQuestionDates":["2024-01-29","2022-07-01","2021-06-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":256,"title":"Paint House","titleSlug":"paint-house"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":257,"title":"Binary Tree Paths","titleSlug":"binary-tree-paths"}
+{"chalengeQuestionDates":["2023-04-26","2022-02-08","2020-07-27"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":258,"title":"Add Digits","titleSlug":"add-digits"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":259,"title":"3Sum Smaller","titleSlug":"3sum-smaller"}
+{"chalengeQuestionDates":["2024-05-31","2021-11-06","2020-07-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":260,"title":"Single Number III","titleSlug":"single-number-iii"}
+{"chalengeQuestionDates":["2021-08-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":261,"title":"Graph Valid Tree","titleSlug":"graph-valid-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":262,"title":"Trips and Users","titleSlug":"trips-and-users"}
+{"chalengeQuestionDates":["2022-11-18"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":263,"title":"Ugly Number","titleSlug":"ugly-number"}
+{"chalengeQuestionDates":["2024-08-18","2020-07-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":264,"title":"Ugly Number II","titleSlug":"ugly-number-ii"}
+{"chalengeQuestionDates":["2024-10-29","2023-05-15","2021-08-15"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":265,"title":"Paint House II","titleSlug":"paint-house-ii"}
+{"chalengeQuestionDates":["2021-01-01"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":266,"title":"Palindrome Permutation","titleSlug":"palindrome-permutation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":267,"title":"Palindrome Permutation II","titleSlug":"palindrome-permutation-ii"}
+{"chalengeQuestionDates":["2024-02-20","2022-05-28","2021-03-03"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":268,"title":"Missing Number","titleSlug":"missing-number"}
+{"chalengeQuestionDates":["2021-07-22"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":269,"title":"Alien Dictionary","titleSlug":"alien-dictionary"}
+{"chalengeQuestionDates":["2020-08-08"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":270,"title":"Closest Binary Search Tree Value","titleSlug":"closest-binary-search-tree-value"}
+{"chalengeQuestionDates":["2023-08-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":271,"title":"Encode and Decode Strings","titleSlug":"encode-and-decode-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":272,"title":"Closest Binary Search Tree Value II","titleSlug":"closest-binary-search-tree-value-ii"}
+{"chalengeQuestionDates":["2024-08-07"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":273,"title":"Integer to English Words","titleSlug":"integer-to-english-words"}
+{"chalengeQuestionDates":["2020-08-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":274,"title":"H-Index","titleSlug":"h-index"}
+{"chalengeQuestionDates":["2020-06-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":275,"title":"H-Index II","titleSlug":"h-index-ii"}
+{"chalengeQuestionDates":["2024-02-08","2021-08-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":276,"title":"Paint Fence","titleSlug":"paint-fence"}
+{"chalengeQuestionDates":["2022-05-22","2021-02-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":277,"title":"Find the Celebrity","titleSlug":"find-the-celebrity"}
+{"chalengeQuestionDates":["2020-05-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":278,"title":"First Bad Version","titleSlug":"first-bad-version"}
+{"chalengeQuestionDates":["2024-02-08","2022-11-22","2021-10-14","2020-06-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":279,"title":"Perfect Squares","titleSlug":"perfect-squares"}
+{"chalengeQuestionDates":["2023-02-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":280,"title":"Wiggle Sort","titleSlug":"wiggle-sort"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":281,"title":"Zigzag Iterator","titleSlug":"zigzag-iterator"}
+{"chalengeQuestionDates":["2021-09-18"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":282,"title":"Expression Add Operators","titleSlug":"expression-add-operators"}
+{"chalengeQuestionDates":["2020-04-04"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":283,"title":"Move Zeroes","titleSlug":"move-zeroes"}
+{"chalengeQuestionDates":["2022-04-25","2021-02-08"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":284,"title":"Peeking Iterator","titleSlug":"peeking-iterator"}
+{"chalengeQuestionDates":["2021-04-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":285,"title":"Inorder Successor in BST","titleSlug":"inorder-successor-in-bst"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":286,"title":"Walls and Gates","titleSlug":"walls-and-gates"}
+{"chalengeQuestionDates":["2024-03-24","2023-09-19","2022-03-29","2020-06-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":287,"title":"Find the Duplicate Number","titleSlug":"find-the-duplicate-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":288,"title":"Unique Word Abbreviation","titleSlug":"unique-word-abbreviation"}
+{"chalengeQuestionDates":["2022-04-12","2020-12-30"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":289,"title":"Game of Life","titleSlug":"game-of-life"}
+{"chalengeQuestionDates":["2023-01-01","2022-01-17","2020-09-07"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":290,"title":"Word Pattern","titleSlug":"word-pattern"}
+{"chalengeQuestionDates":["2024-05-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":291,"title":"Word Pattern II","titleSlug":"word-pattern-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":292,"title":"Nim Game","titleSlug":"nim-game"}
+{"chalengeQuestionDates":["2024-02-01"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":293,"title":"Flip Game","titleSlug":"flip-game"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":294,"title":"Flip Game II","titleSlug":"flip-game-ii"}
+{"chalengeQuestionDates":["2022-11-12","2021-07-11"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":295,"title":"Find Median from Data Stream","titleSlug":"find-median-from-data-stream"}
+{"chalengeQuestionDates":["2023-12-15","2022-10-22","2021-09-08"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":296,"title":"Best Meeting Point","titleSlug":"best-meeting-point"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":297,"title":"Serialize and Deserialize Binary Tree","titleSlug":"serialize-and-deserialize-binary-tree"}
+{"chalengeQuestionDates":["2022-09-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":298,"title":"Binary Tree Longest Consecutive Sequence","titleSlug":"binary-tree-longest-consecutive-sequence"}
+{"chalengeQuestionDates":["2020-09-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":299,"title":"Bulls and Cows","titleSlug":"bulls-and-cows"}
+{"chalengeQuestionDates":["2024-01-05","2022-08-08","2021-07-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":300,"title":"Longest Increasing Subsequence","titleSlug":"longest-increasing-subsequence"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":301,"title":"Remove Invalid Parentheses","titleSlug":"remove-invalid-parentheses"}
+{"chalengeQuestionDates":["2021-10-15"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":302,"title":"Smallest Rectangle Enclosing Black Pixels","titleSlug":"smallest-rectangle-enclosing-black-pixels"}
+{"chalengeQuestionDates":["2021-08-16"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":303,"title":"Range Sum Query - Immutable","titleSlug":"range-sum-query-immutable"}
+{"chalengeQuestionDates":["2022-06-03","2021-05-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":304,"title":"Range Sum Query 2D - Immutable","titleSlug":"range-sum-query-2d-immutable"}
+{"chalengeQuestionDates":["2024-04-22","2023-02-15"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":305,"title":"Number of Islands II","titleSlug":"number-of-islands-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":306,"title":"Additive Number","titleSlug":"additive-number"}
+{"chalengeQuestionDates":["2022-07-31","2021-06-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":307,"title":"Range Sum Query - Mutable","titleSlug":"range-sum-query-mutable"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":308,"title":"Range Sum Query 2D - Mutable","titleSlug":"range-sum-query-2d-mutable"}
+{"chalengeQuestionDates":["2022-12-23","2021-10-15","2020-07-30"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":309,"title":"Best Time to Buy and Sell Stock with Cooldown","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"}
+{"chalengeQuestionDates":["2024-04-23","2021-12-16","2020-11-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":310,"title":"Minimum Height Trees","titleSlug":"minimum-height-trees"}
+{"chalengeQuestionDates":["2023-05-08","2022-03-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":311,"title":"Sparse Matrix Multiplication","titleSlug":"sparse-matrix-multiplication"}
+{"chalengeQuestionDates":["2022-01-01","2020-12-13"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":312,"title":"Burst Balloons","titleSlug":"burst-balloons"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":313,"title":"Super Ugly Number","titleSlug":"super-ugly-number"}
+{"chalengeQuestionDates":["2022-08-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":314,"title":"Binary Tree Vertical Order Traversal","titleSlug":"binary-tree-vertical-order-traversal"}
+{"chalengeQuestionDates":["2022-07-23","2021-06-26"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":315,"title":"Count of Smaller Numbers After Self","titleSlug":"count-of-smaller-numbers-after-self"}
+{"chalengeQuestionDates":["2023-09-26","2022-03-18","2020-10-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":316,"title":"Remove Duplicate Letters","titleSlug":"remove-duplicate-letters"}
+{"chalengeQuestionDates":["2021-09-22"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":317,"title":"Shortest Distance from All Buildings","titleSlug":"shortest-distance-from-all-buildings"}
+{"chalengeQuestionDates":["2022-05-29","2021-05-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":318,"title":"Maximum Product of Word Lengths","titleSlug":"maximum-product-of-word-lengths"}
+{"chalengeQuestionDates":["2023-04-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":319,"title":"Bulb Switcher","titleSlug":"bulb-switcher"}
+{"chalengeQuestionDates":["2024-08-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":320,"title":"Generalized Abbreviation","titleSlug":"generalized-abbreviation"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":321,"title":"Create Maximum Number","titleSlug":"create-maximum-number"}
+{"chalengeQuestionDates":["2022-05-21","2021-03-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":322,"title":"Coin Change","titleSlug":"coin-change"}
+{"chalengeQuestionDates":["2022-12-08","2021-05-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":323,"title":"Number of Connected Components in an Undirected Graph","titleSlug":"number-of-connected-components-in-an-undirected-graph"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":324,"title":"Wiggle Sort II","titleSlug":"wiggle-sort-ii"}
+{"chalengeQuestionDates":["2021-09-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":325,"title":"Maximum Size Subarray Sum Equals k","titleSlug":"maximum-size-subarray-sum-equals-k"}
+{"chalengeQuestionDates":["2022-08-24","2021-04-27"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":326,"title":"Power of Three","titleSlug":"power-of-three"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":327,"title":"Count of Range Sum","titleSlug":"count-of-range-sum"}
+{"chalengeQuestionDates":["2022-12-06","2021-12-02","2020-05-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":328,"title":"Odd Even Linked List","titleSlug":"odd-even-linked-list"}
+{"chalengeQuestionDates":["2022-05-19","2021-04-10"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":329,"title":"Longest Increasing Path in a Matrix","titleSlug":"longest-increasing-path-in-a-matrix"}
+{"chalengeQuestionDates":["2024-06-16","2021-08-29"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":330,"title":"Patching Array","titleSlug":"patching-array"}
+{"chalengeQuestionDates":["2021-08-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":331,"title":"Verify Preorder Serialization of a Binary Tree","titleSlug":"verify-preorder-serialization-of-a-binary-tree"}
+{"chalengeQuestionDates":["2023-09-14","2020-06-28"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":332,"title":"Reconstruct Itinerary","titleSlug":"reconstruct-itinerary"}
+{"chalengeQuestionDates":["2021-11-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":333,"title":"Largest BST Subtree","titleSlug":"largest-bst-subtree"}
+{"chalengeQuestionDates":["2022-10-11","2020-12-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":334,"title":"Increasing Triplet Subsequence","titleSlug":"increasing-triplet-subsequence"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":335,"title":"Self Crossing","titleSlug":"self-crossing"}
+{"chalengeQuestionDates":["2022-09-17","2021-06-13"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":336,"title":"Palindrome Pairs","titleSlug":"palindrome-pairs"}
+{"chalengeQuestionDates":["2021-12-05","2020-11-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":337,"title":"House Robber III","titleSlug":"house-robber-iii"}
+{"chalengeQuestionDates":["2023-09-01","2022-03-01","2020-05-28"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":338,"title":"Counting Bits","titleSlug":"counting-bits"}
+{"chalengeQuestionDates":["2022-11-08","2021-01-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":339,"title":"Nested List Weight Sum","titleSlug":"nested-list-weight-sum"}
+{"chalengeQuestionDates":["2024-03-29","2023-07-08","2020-12-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":340,"title":"Longest Substring with At Most K Distinct Characters","titleSlug":"longest-substring-with-at-most-k-distinct-characters"}
+{"chalengeQuestionDates":["2023-10-20","2022-05-08","2021-04-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":341,"title":"Flatten Nested List Iterator","titleSlug":"flatten-nested-list-iterator"}
+{"chalengeQuestionDates":["2023-10-23","2022-08-22","2020-08-04"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":342,"title":"Power of Four","titleSlug":"power-of-four"}
+{"chalengeQuestionDates":["2023-10-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":343,"title":"Integer Break","titleSlug":"integer-break"}
+{"chalengeQuestionDates":["2024-06-02","2022-04-01","2020-06-04"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":344,"title":"Reverse String","titleSlug":"reverse-string"}
+{"chalengeQuestionDates":["2022-11-04"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":345,"title":"Reverse Vowels of a String","titleSlug":"reverse-vowels-of-a-string"}
+{"chalengeQuestionDates":["2023-11-15","2020-09-08"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":346,"title":"Moving Average from Data Stream","titleSlug":"moving-average-from-data-stream"}
+{"chalengeQuestionDates":["2023-05-22","2022-04-09","2020-07-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":347,"title":"Top K Frequent Elements","titleSlug":"top-k-frequent-elements"}
+{"chalengeQuestionDates":["2023-05-29","2021-05-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":348,"title":"Design Tic-Tac-Toe","titleSlug":"design-tic-tac-toe"}
+{"chalengeQuestionDates":["2024-03-10"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":349,"title":"Intersection of Two Arrays","titleSlug":"intersection-of-two-arrays"}
+{"chalengeQuestionDates":["2024-07-02","2021-09-17"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":350,"title":"Intersection of Two Arrays II","titleSlug":"intersection-of-two-arrays-ii"}
+{"chalengeQuestionDates":["2024-08-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":351,"title":"Android Unlock Patterns","titleSlug":"android-unlock-patterns"}
+{"chalengeQuestionDates":["2023-01-28"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":352,"title":"Data Stream as Disjoint Intervals","titleSlug":"data-stream-as-disjoint-intervals"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":353,"title":"Design Snake Game","titleSlug":"design-snake-game"}
+{"chalengeQuestionDates":["2022-05-25","2021-03-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":354,"title":"Russian Doll Envelopes","titleSlug":"russian-doll-envelopes"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":355,"title":"Design Twitter","titleSlug":"design-twitter"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":356,"title":"Line Reflection","titleSlug":"line-reflection"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":357,"title":"Count Numbers with Unique Digits","titleSlug":"count-numbers-with-unique-digits"}
+{"chalengeQuestionDates":["2023-09-08"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":358,"title":"Rearrange String k Distance Apart","titleSlug":"rearrange-string-k-distance-apart"}
+{"chalengeQuestionDates":["2020-08-01"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":359,"title":"Logger Rate Limiter","titleSlug":"logger-rate-limiter"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":360,"title":"Sort Transformed Array","titleSlug":"sort-transformed-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":361,"title":"Bomb Enemy","titleSlug":"bomb-enemy"}
+{"chalengeQuestionDates":["2022-09-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":362,"title":"Design Hit Counter","titleSlug":"design-hit-counter"}
+{"chalengeQuestionDates":["2022-08-27","2021-07-03"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":363,"title":"Max Sum of Rectangle No Larger Than K","titleSlug":"max-sum-of-rectangle-no-larger-than-k"}
+{"chalengeQuestionDates":["2021-12-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":364,"title":"Nested List Weight Sum II","titleSlug":"nested-list-weight-sum-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":365,"title":"Water and Jug Problem","titleSlug":"water-and-jug-problem"}
+{"chalengeQuestionDates":["2022-08-01","2021-07-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":366,"title":"Find Leaves of Binary Tree","titleSlug":"find-leaves-of-binary-tree"}
+{"chalengeQuestionDates":["2020-05-09"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":367,"title":"Valid Perfect Square","titleSlug":"valid-perfect-square"}
+{"chalengeQuestionDates":["2024-02-09","2021-11-15","2020-06-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":368,"title":"Largest Divisible Subset","titleSlug":"largest-divisible-subset"}
+{"chalengeQuestionDates":["2020-12-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":369,"title":"Plus One Linked List","titleSlug":"plus-one-linked-list"}
+{"chalengeQuestionDates":["2021-07-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":370,"title":"Range Addition","titleSlug":"range-addition"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":371,"title":"Sum of Two Integers","titleSlug":"sum-of-two-integers"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":372,"title":"Super Pow","titleSlug":"super-pow"}
+{"chalengeQuestionDates":["2023-06-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":373,"title":"Find K Pairs with Smallest Sums","titleSlug":"find-k-pairs-with-smallest-sums"}
+{"chalengeQuestionDates":["2022-11-16","2021-10-12"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":374,"title":"Guess Number Higher or Lower","titleSlug":"guess-number-higher-or-lower"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":375,"title":"Guess Number Higher or Lower II","titleSlug":"guess-number-higher-or-lower-ii"}
+{"chalengeQuestionDates":["2022-07-03","2021-03-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":376,"title":"Wiggle Subsequence","titleSlug":"wiggle-subsequence"}
+{"chalengeQuestionDates":["2023-09-09","2022-08-05","2021-04-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":377,"title":"Combination Sum IV","titleSlug":"combination-sum-iv"}
+{"chalengeQuestionDates":["2022-08-02","2021-07-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":378,"title":"Kth Smallest Element in a Sorted Matrix","titleSlug":"kth-smallest-element-in-a-sorted-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":379,"title":"Design Phone Directory","titleSlug":"design-phone-directory"}
+{"chalengeQuestionDates":["2024-01-16","2022-11-29","2021-10-21","2020-06-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":380,"title":"Insert Delete GetRandom O(1)","titleSlug":"insert-delete-getrandom-o1"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":381,"title":"Insert Delete GetRandom O(1) - Duplicates allowed","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"}
+{"chalengeQuestionDates":["2023-03-10","2022-01-07","2020-12-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":382,"title":"Linked List Random Node","titleSlug":"linked-list-random-node"}
+{"chalengeQuestionDates":["2022-08-25","2020-05-03"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":383,"title":"Ransom Note","titleSlug":"ransom-note"}
+{"chalengeQuestionDates":["2021-07-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":384,"title":"Shuffle an Array","titleSlug":"shuffle-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":385,"title":"Mini Parser","titleSlug":"mini-parser"}
+{"chalengeQuestionDates":["2024-09-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":386,"title":"Lexicographical Numbers","titleSlug":"lexicographical-numbers"}
+{"chalengeQuestionDates":["2024-02-05","2022-08-16","2020-05-05"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":387,"title":"First Unique Character in a String","titleSlug":"first-unique-character-in-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":388,"title":"Longest Absolute File Path","titleSlug":"longest-absolute-file-path"}
+{"chalengeQuestionDates":["2023-09-25","2022-02-07","2020-09-24"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":389,"title":"Find the Difference","titleSlug":"find-the-difference"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":390,"title":"Elimination Game","titleSlug":"elimination-game"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":391,"title":"Perfect Rectangle","titleSlug":"perfect-rectangle"}
+{"chalengeQuestionDates":["2023-09-22","2022-03-02","2020-06-09"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":392,"title":"Is Subsequence","titleSlug":"is-subsequence"}
+{"chalengeQuestionDates":["2022-09-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":393,"title":"UTF-8 Validation","titleSlug":"utf-8-validation"}
+{"chalengeQuestionDates":["2021-12-19","2020-11-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":394,"title":"Decode String","titleSlug":"decode-string"}
+{"chalengeQuestionDates":["2020-11-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":395,"title":"Longest Substring with At Least K Repeating Characters","titleSlug":"longest-substring-with-at-least-k-repeating-characters"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":396,"title":"Rotate Function","titleSlug":"rotate-function"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":397,"title":"Integer Replacement","titleSlug":"integer-replacement"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":398,"title":"Random Pick Index","titleSlug":"random-pick-index"}
+{"chalengeQuestionDates":["2023-05-20","2022-04-30","2020-09-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":399,"title":"Evaluate Division","titleSlug":"evaluate-division"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":400,"title":"Nth Digit","titleSlug":"nth-digit"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":401,"title":"Binary Watch","titleSlug":"binary-watch"}
+{"chalengeQuestionDates":["2024-04-11","2022-02-18","2020-05-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":402,"title":"Remove K Digits","titleSlug":"remove-k-digits"}
+{"chalengeQuestionDates":["2023-08-27"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":403,"title":"Frog Jump","titleSlug":"frog-jump"}
+{"chalengeQuestionDates":["2024-04-14","2021-11-04","2020-08-24"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":404,"title":"Sum of Left Leaves","titleSlug":"sum-of-left-leaves"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":405,"title":"Convert a Number to Hexadecimal","titleSlug":"convert-a-number-to-hexadecimal"}
+{"chalengeQuestionDates":["2022-06-29","2020-06-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":406,"title":"Queue Reconstruction by Height","titleSlug":"queue-reconstruction-by-height"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":407,"title":"Trapping Rain Water II","titleSlug":"trapping-rain-water-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":408,"title":"Valid Word Abbreviation","titleSlug":"valid-word-abbreviation"}
+{"chalengeQuestionDates":["2024-06-04","2020-08-14"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":409,"title":"Longest Palindrome","titleSlug":"longest-palindrome"}
+{"chalengeQuestionDates":["2022-03-31"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":410,"title":"Split Array Largest Sum","titleSlug":"split-array-largest-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":411,"title":"Minimum Unique Word Abbreviation","titleSlug":"minimum-unique-word-abbreviation"}
+{"chalengeQuestionDates":["2020-08-26"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":412,"title":"Fizz Buzz","titleSlug":"fizz-buzz"}
+{"chalengeQuestionDates":["2022-03-03","2021-02-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":413,"title":"Arithmetic Slices","titleSlug":"arithmetic-slices"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":414,"title":"Third Maximum Number","titleSlug":"third-maximum-number"}
+{"chalengeQuestionDates":["2021-08-09"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":415,"title":"Add Strings","titleSlug":"add-strings"}
+{"chalengeQuestionDates":["2021-12-12","2020-11-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":416,"title":"Partition Equal Subset Sum","titleSlug":"partition-equal-subset-sum"}
+{"chalengeQuestionDates":["2022-08-31","2021-03-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":417,"title":"Pacific Atlantic Water Flow","titleSlug":"pacific-atlantic-water-flow"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":418,"title":"Sentence Screen Fitting","titleSlug":"sentence-screen-fitting"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":419,"title":"Battleships in a Board","titleSlug":"battleships-in-a-board"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":420,"title":"Strong Password Checker","titleSlug":"strong-password-checker"}
+{"chalengeQuestionDates":["2022-01-27","2020-09-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":421,"title":"Maximum XOR of Two Numbers in an Array","titleSlug":"maximum-xor-of-two-numbers-in-an-array"}
+{"chalengeQuestionDates":["2023-03-01"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":422,"title":"Valid Word Square","titleSlug":"valid-word-square"}
+{"chalengeQuestionDates":["2021-03-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":423,"title":"Reconstruct Original Digits from English","titleSlug":"reconstruct-original-digits-from-english"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":424,"title":"Longest Repeating Character Replacement","titleSlug":"longest-repeating-character-replacement"}
+{"chalengeQuestionDates":["2021-11-08","2020-09-29"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":425,"title":"Word Squares","titleSlug":"word-squares"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":426,"title":"Convert Binary Search Tree to Sorted Doubly Linked List","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"}
+{"chalengeQuestionDates":["2023-02-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":427,"title":"Construct Quad Tree","titleSlug":"construct-quad-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":428,"title":"Serialize and Deserialize N-ary Tree","titleSlug":"serialize-and-deserialize-n-ary-tree"}
+{"chalengeQuestionDates":["2022-09-05","2021-08-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":429,"title":"N-ary Tree Level Order Traversal","titleSlug":"n-ary-tree-level-order-traversal"}
+{"chalengeQuestionDates":["2021-10-31","2020-07-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":430,"title":"Flatten a Multilevel Doubly Linked List","titleSlug":"flatten-a-multilevel-doubly-linked-list"}
+{"chalengeQuestionDates":["2022-04-29","2020-10-29"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":431,"title":"Encode N-ary Tree to Binary Tree","titleSlug":"encode-n-ary-tree-to-binary-tree"}
+{"chalengeQuestionDates":["2024-09-29"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":432,"title":"All O`one Data Structure","titleSlug":"all-oone-data-structure"}
+{"chalengeQuestionDates":["2022-11-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":433,"title":"Minimum Genetic Mutation","titleSlug":"minimum-genetic-mutation"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":434,"title":"Number of Segments in a String","titleSlug":"number-of-segments-in-a-string"}
+{"chalengeQuestionDates":["2023-07-19","2020-08-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":435,"title":"Non-overlapping Intervals","titleSlug":"non-overlapping-intervals"}
+{"chalengeQuestionDates":["2020-08-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":436,"title":"Find Right Interval","titleSlug":"find-right-interval"}
+{"chalengeQuestionDates":["2021-10-17","2020-08-08"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":437,"title":"Path Sum III","titleSlug":"path-sum-iii"}
+{"chalengeQuestionDates":["2023-02-05","2022-02-02","2020-05-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":438,"title":"Find All Anagrams in a String","titleSlug":"find-all-anagrams-in-a-string"}
+{"chalengeQuestionDates":["2023-07-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":439,"title":"Ternary Expression Parser","titleSlug":"ternary-expression-parser"}
+{"chalengeQuestionDates":["2024-09-22"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":440,"title":"K-th Smallest in Lexicographical Order","titleSlug":"k-th-smallest-in-lexicographical-order"}
+{"chalengeQuestionDates":["2021-11-05","2020-07-02"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":441,"title":"Arranging Coins","titleSlug":"arranging-coins"}
+{"chalengeQuestionDates":["2024-03-25","2021-10-06","2020-08-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":442,"title":"Find All Duplicates in an Array","titleSlug":"find-all-duplicates-in-an-array"}
+{"chalengeQuestionDates":["2023-03-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":443,"title":"String Compression","titleSlug":"string-compression"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":444,"title":"Sequence Reconstruction","titleSlug":"sequence-reconstruction"}
+{"chalengeQuestionDates":["2023-07-17","2020-11-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":445,"title":"Add Two Numbers II","titleSlug":"add-two-numbers-ii"}
+{"chalengeQuestionDates":["2024-01-07","2022-11-27","2021-09-10"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":446,"title":"Arithmetic Slices II - Subsequence","titleSlug":"arithmetic-slices-ii-subsequence"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":447,"title":"Number of Boomerangs","titleSlug":"number-of-boomerangs"}
+{"chalengeQuestionDates":["2021-11-18"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":448,"title":"Find All Numbers Disappeared in an Array","titleSlug":"find-all-numbers-disappeared-in-an-array"}
+{"chalengeQuestionDates":["2020-10-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":449,"title":"Serialize and Deserialize BST","titleSlug":"serialize-and-deserialize-bst"}
+{"chalengeQuestionDates":["2021-11-22","2020-08-31"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":450,"title":"Delete Node in a BST","titleSlug":"delete-node-in-a-bst"}
+{"chalengeQuestionDates":["2024-02-07","2022-12-03","2021-10-22","2020-05-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":451,"title":"Sort Characters By Frequency","titleSlug":"sort-characters-by-frequency"}
+{"chalengeQuestionDates":["2024-03-18","2023-01-05","2022-01-13","2020-10-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":452,"title":"Minimum Number of Arrows to Burst Balloons","titleSlug":"minimum-number-of-arrows-to-burst-balloons"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":453,"title":"Minimum Moves to Equal Array Elements","titleSlug":"minimum-moves-to-equal-array-elements"}
+{"chalengeQuestionDates":["2022-02-03","2020-12-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":454,"title":"4Sum II","titleSlug":"4sum-ii"}
+{"chalengeQuestionDates":["2024-01-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":455,"title":"Assign Cookies","titleSlug":"assign-cookies"}
+{"chalengeQuestionDates":["2023-09-30","2022-05-07","2020-10-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":456,"title":"132 Pattern","titleSlug":"132-pattern"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":457,"title":"Circular Array Loop","titleSlug":"circular-array-loop"}
+{"chalengeQuestionDates":["2023-10-29","2022-08-06","2020-11-14"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":458,"title":"Poor Pigs","titleSlug":"poor-pigs"}
+{"chalengeQuestionDates":["2023-08-21","2020-09-03"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":459,"title":"Repeated Substring Pattern","titleSlug":"repeated-substring-pattern"}
+{"chalengeQuestionDates":["2023-01-29"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":460,"title":"LFU Cache","titleSlug":"lfu-cache"}
+{"chalengeQuestionDates":["2021-11-19","2020-07-06"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":461,"title":"Hamming Distance","titleSlug":"hamming-distance"}
+{"chalengeQuestionDates":["2022-06-30","2021-05-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":462,"title":"Minimum Moves to Equal Array Elements II","titleSlug":"minimum-moves-to-equal-array-elements-ii"}
+{"chalengeQuestionDates":["2024-04-18","2021-10-04","2020-07-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":463,"title":"Island Perimeter","titleSlug":"island-perimeter"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":464,"title":"Can I Win","titleSlug":"can-i-win"}
+{"chalengeQuestionDates":["2023-07-01"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":465,"title":"Optimal Account Balancing","titleSlug":"optimal-account-balancing"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":466,"title":"Count The Repetitions","titleSlug":"count-the-repetitions"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":467,"title":"Unique Substrings in Wraparound String","titleSlug":"unique-substrings-in-wraparound-string"}
+{"chalengeQuestionDates":["2020-06-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":468,"title":"Validate IP Address","titleSlug":"validate-ip-address"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":469,"title":"Convex Polygon","titleSlug":"convex-polygon"}
+{"chalengeQuestionDates":["2020-08-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":470,"title":"Implement Rand10() Using Rand7()","titleSlug":"implement-rand10-using-rand7"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":471,"title":"Encode String with Shortest Length","titleSlug":"encode-string-with-shortest-length"}
+{"chalengeQuestionDates":["2023-01-27"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":472,"title":"Concatenated Words","titleSlug":"concatenated-words"}
+{"chalengeQuestionDates":["2022-07-12","2021-06-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":473,"title":"Matchsticks to Square","titleSlug":"matchsticks-to-square"}
+{"chalengeQuestionDates":["2022-05-23","2021-04-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":474,"title":"Ones and Zeroes","titleSlug":"ones-and-zeroes"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":475,"title":"Heaters","titleSlug":"heaters"}
+{"chalengeQuestionDates":["2024-08-22","2021-12-27","2020-05-04"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":476,"title":"Number Complement","titleSlug":"number-complement"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":477,"title":"Total Hamming Distance","titleSlug":"total-hamming-distance"}
+{"chalengeQuestionDates":["2021-03-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":478,"title":"Generate Random Point in a Circle","titleSlug":"generate-random-point-in-a-circle"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":479,"title":"Largest Palindrome Product","titleSlug":"largest-palindrome-product"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":480,"title":"Sliding Window Median","titleSlug":"sliding-window-median"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":481,"title":"Magical String","titleSlug":"magical-string"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":482,"title":"License Key Formatting","titleSlug":"license-key-formatting"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":483,"title":"Smallest Good Base","titleSlug":"smallest-good-base"}
+{"chalengeQuestionDates":["2022-05-01","2020-08-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":484,"title":"Find Permutation","titleSlug":"find-permutation"}
+{"chalengeQuestionDates":["2021-09-21"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":485,"title":"Max Consecutive Ones","titleSlug":"max-consecutive-ones"}
+{"chalengeQuestionDates":["2023-07-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":486,"title":"Predict the Winner","titleSlug":"predict-the-winner"}
+{"chalengeQuestionDates":["2023-11-29","2022-10-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":487,"title":"Max Consecutive Ones II","titleSlug":"max-consecutive-ones-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":488,"title":"Zuma Game","titleSlug":"zuma-game"}
+{"chalengeQuestionDates":["2022-05-08","2020-08-29"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":489,"title":"Robot Room Cleaner","titleSlug":"robot-room-cleaner"}
+{"chalengeQuestionDates":["2023-08-15","2020-08-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":490,"title":"The Maze","titleSlug":"the-maze"}
+{"chalengeQuestionDates":["2023-01-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":491,"title":"Non-decreasing Subsequences","titleSlug":"non-decreasing-subsequences"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":492,"title":"Construct the Rectangle","titleSlug":"construct-the-rectangle"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":493,"title":"Reverse Pairs","titleSlug":"reverse-pairs"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":494,"title":"Target Sum","titleSlug":"target-sum"}
+{"chalengeQuestionDates":["2020-09-26"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":495,"title":"Teemo Attacking","titleSlug":"teemo-attacking"}
+{"chalengeQuestionDates":["2021-10-19"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":496,"title":"Next Greater Element I","titleSlug":"next-greater-element-i"}
+{"chalengeQuestionDates":["2020-08-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":497,"title":"Random Point in Non-overlapping Rectangles","titleSlug":"random-point-in-non-overlapping-rectangles"}
+{"chalengeQuestionDates":["2020-12-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":498,"title":"Diagonal Traverse","titleSlug":"diagonal-traverse"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":499,"title":"The Maze III","titleSlug":"the-maze-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":500,"title":"Keyboard Row","titleSlug":"keyboard-row"}
+{"chalengeQuestionDates":["2023-11-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":501,"title":"Find Mode in Binary Search Tree","titleSlug":"find-mode-in-binary-search-tree"}
+{"chalengeQuestionDates":["2024-06-15","2023-02-23"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":502,"title":"IPO","titleSlug":"ipo"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":503,"title":"Next Greater Element II","titleSlug":"next-greater-element-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":504,"title":"Base 7","titleSlug":"base-7"}
+{"chalengeQuestionDates":["2023-10-08","2022-08-29","2021-06-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":505,"title":"The Maze II","titleSlug":"the-maze-ii"}
+{"chalengeQuestionDates":["2024-05-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":506,"title":"Relative Ranks","titleSlug":"relative-ranks"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":507,"title":"Perfect Number","titleSlug":"perfect-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":508,"title":"Most Frequent Subtree Sum","titleSlug":"most-frequent-subtree-sum"}
+{"chalengeQuestionDates":["2022-07-06","2021-04-15"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":509,"title":"Fibonacci Number","titleSlug":"fibonacci-number"}
+{"chalengeQuestionDates":["2022-07-08","2020-09-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":510,"title":"Inorder Successor in BST II","titleSlug":"inorder-successor-in-bst-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":511,"title":"Game Play Analysis I","titleSlug":"game-play-analysis-i"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":512,"title":"Game Play Analysis II","titleSlug":"game-play-analysis-ii"}
+{"chalengeQuestionDates":["2024-02-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":513,"title":"Find Bottom Left Tree Value","titleSlug":"find-bottom-left-tree-value"}
+{"chalengeQuestionDates":["2024-04-27"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":514,"title":"Freedom Trail","titleSlug":"freedom-trail"}
+{"chalengeQuestionDates":["2023-10-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":515,"title":"Find Largest Value in Each Tree Row","titleSlug":"find-largest-value-in-each-tree-row"}
+{"chalengeQuestionDates":["2023-04-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":516,"title":"Longest Palindromic Subsequence","titleSlug":"longest-palindromic-subsequence"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":517,"title":"Super Washing Machines","titleSlug":"super-washing-machines"}
+{"chalengeQuestionDates":["2023-08-11","2020-06-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":518,"title":"Coin Change II","titleSlug":"coin-change-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":519,"title":"Random Flip Matrix","titleSlug":"random-flip-matrix"}
+{"chalengeQuestionDates":["2023-01-02","2022-01-24","2020-08-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":520,"title":"Detect Capital","titleSlug":"detect-capital"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":521,"title":"Longest Uncommon Subsequence I","titleSlug":"longest-uncommon-subsequence-i"}
+{"chalengeQuestionDates":["2021-08-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":522,"title":"Longest Uncommon Subsequence II","titleSlug":"longest-uncommon-subsequence-ii"}
+{"chalengeQuestionDates":["2024-06-08","2022-10-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":523,"title":"Continuous Subarray Sum","titleSlug":"continuous-subarray-sum"}
+{"chalengeQuestionDates":["2021-02-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":524,"title":"Longest Word in Dictionary through Deleting","titleSlug":"longest-word-in-dictionary-through-deleting"}
+{"chalengeQuestionDates":["2024-03-16","2022-02-04","2020-05-26","2020-04-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":525,"title":"Contiguous Array","titleSlug":"contiguous-array"}
+{"chalengeQuestionDates":["2021-01-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":526,"title":"Beautiful Arrangement","titleSlug":"beautiful-arrangement"}
+{"chalengeQuestionDates":["2022-06-15"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":527,"title":"Word Abbreviation","titleSlug":"word-abbreviation"}
+{"chalengeQuestionDates":["2020-06-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":528,"title":"Random Pick with Weight","titleSlug":"random-pick-with-weight"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":529,"title":"Minesweeper","titleSlug":"minesweeper"}
+{"chalengeQuestionDates":["2023-06-14"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":530,"title":"Minimum Absolute Difference in BST","titleSlug":"minimum-absolute-difference-in-bst"}
+{"chalengeQuestionDates":["2022-10-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":531,"title":"Lonely Pixel I","titleSlug":"lonely-pixel-i"}
+{"chalengeQuestionDates":["2022-02-09","2020-10-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":532,"title":"K-diff Pairs in an Array","titleSlug":"k-diff-pairs-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":533,"title":"Lonely Pixel II","titleSlug":"lonely-pixel-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":534,"title":"Game Play Analysis III","titleSlug":"game-play-analysis-iii"}
+{"chalengeQuestionDates":["2022-04-23","2021-03-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":535,"title":"Encode and Decode TinyURL","titleSlug":"encode-and-decode-tinyurl"}
+{"chalengeQuestionDates":["2021-03-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":536,"title":"Construct Binary Tree from String","titleSlug":"construct-binary-tree-from-string"}
+{"chalengeQuestionDates":["2021-08-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":537,"title":"Complex Number Multiplication","titleSlug":"complex-number-multiplication"}
+{"chalengeQuestionDates":["2022-04-16","2021-02-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":538,"title":"Convert BST to Greater Tree","titleSlug":"convert-bst-to-greater-tree"}
+{"chalengeQuestionDates":["2024-09-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":539,"title":"Minimum Time Difference","titleSlug":"minimum-time-difference"}
+{"chalengeQuestionDates":["2023-02-21","2021-11-20","2020-05-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":540,"title":"Single Element in a Sorted Array","titleSlug":"single-element-in-a-sorted-array"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":541,"title":"Reverse String II","titleSlug":"reverse-string-ii"}
+{"chalengeQuestionDates":["2023-08-17","2021-07-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":542,"title":"01 Matrix","titleSlug":"01-matrix"}
+{"chalengeQuestionDates":["2024-02-27","2021-10-11","2020-04-11"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":543,"title":"Diameter of Binary Tree","titleSlug":"diameter-of-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":544,"title":"Output Contest Matches","titleSlug":"output-contest-matches"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":545,"title":"Boundary of Binary Tree","titleSlug":"boundary-of-binary-tree"}
+{"chalengeQuestionDates":["2021-08-14"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":546,"title":"Remove Boxes","titleSlug":"remove-boxes"}
+{"chalengeQuestionDates":["2023-06-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":547,"title":"Number of Provinces","titleSlug":"number-of-provinces"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":548,"title":"Split Array with Equal Sum","titleSlug":"split-array-with-equal-sum"}
+{"chalengeQuestionDates":["2022-08-22","2021-07-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":549,"title":"Binary Tree Longest Consecutive Sequence II","titleSlug":"binary-tree-longest-consecutive-sequence-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":550,"title":"Game Play Analysis IV","titleSlug":"game-play-analysis-iv"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":551,"title":"Student Attendance Record I","titleSlug":"student-attendance-record-i"}
+{"chalengeQuestionDates":["2024-05-26"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":552,"title":"Student Attendance Record II","titleSlug":"student-attendance-record-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":553,"title":"Optimal Division","titleSlug":"optimal-division"}
+{"chalengeQuestionDates":["2021-04-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":554,"title":"Brick Wall","titleSlug":"brick-wall"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":555,"title":"Split Concatenated Strings","titleSlug":"split-concatenated-strings"}
+{"chalengeQuestionDates":["2020-12-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":556,"title":"Next Greater Element III","titleSlug":"next-greater-element-iii"}
+{"chalengeQuestionDates":["2023-10-01","2022-09-22"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":557,"title":"Reverse Words in a String III","titleSlug":"reverse-words-in-a-string-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":558,"title":"Logical OR of Two Binary Grids Represented as Quad-Trees","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":559,"title":"Maximum Depth of N-ary Tree","titleSlug":"maximum-depth-of-n-ary-tree"}
+{"chalengeQuestionDates":["2022-02-10","2020-04-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":560,"title":"Subarray Sum Equals K","titleSlug":"subarray-sum-equals-k"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":561,"title":"Array Partition","titleSlug":"array-partition"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":562,"title":"Longest Line of Consecutive One in Matrix","titleSlug":"longest-line-of-consecutive-one-in-matrix"}
+{"chalengeQuestionDates":["2021-12-08","2020-11-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":563,"title":"Binary Tree Tilt","titleSlug":"binary-tree-tilt"}
+{"chalengeQuestionDates":["2024-08-24"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":564,"title":"Find the Closest Palindrome","titleSlug":"find-the-closest-palindrome"}
+{"chalengeQuestionDates":["2021-09-01"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":565,"title":"Array Nesting","titleSlug":"array-nesting"}
+{"chalengeQuestionDates":["2021-07-05"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":566,"title":"Reshape the Matrix","titleSlug":"reshape-the-matrix"}
+{"chalengeQuestionDates":["2024-10-05","2023-02-04","2022-02-11","2020-05-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":567,"title":"Permutation in String","titleSlug":"permutation-in-string"}
+{"chalengeQuestionDates":["2022-01-01"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":568,"title":"Maximum Vacation Days","titleSlug":"maximum-vacation-days"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":569,"title":"Median Employee Salary","titleSlug":"median-employee-salary"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":570,"title":"Managers with at Least 5 Direct Reports","titleSlug":"managers-with-at-least-5-direct-reports"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":571,"title":"Find Median Given Frequency of Numbers","titleSlug":"find-median-given-frequency-of-numbers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":572,"title":"Subtree of Another Tree","titleSlug":"subtree-of-another-tree"}
+{"chalengeQuestionDates":["2023-11-08","2021-02-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":573,"title":"Squirrel Simulation","titleSlug":"squirrel-simulation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":574,"title":"Winning Candidate","titleSlug":"winning-candidate"}
+{"chalengeQuestionDates":["2021-03-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":575,"title":"Distribute Candies","titleSlug":"distribute-candies"}
+{"chalengeQuestionDates":["2024-01-26","2022-07-16","2021-06-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":576,"title":"Out of Boundary Paths","titleSlug":"out-of-boundary-paths"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":577,"title":"Employee Bonus","titleSlug":"employee-bonus"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":578,"title":"Get Highest Answer Rate Question","titleSlug":"get-highest-answer-rate-question"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":579,"title":"Find Cumulative Salary of an Employee","titleSlug":"find-cumulative-salary-of-an-employee"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":580,"title":"Count Student Number in Departments","titleSlug":"count-student-number-in-departments"}
+{"chalengeQuestionDates":["2022-05-03","2021-02-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":581,"title":"Shortest Unsorted Continuous Subarray","titleSlug":"shortest-unsorted-continuous-subarray"}
+{"chalengeQuestionDates":["2022-09-29","2021-02-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":582,"title":"Kill Process","titleSlug":"kill-process"}
+{"chalengeQuestionDates":["2022-06-14","2021-05-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":583,"title":"Delete Operation for Two Strings","titleSlug":"delete-operation-for-two-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":584,"title":"Find Customer Referee","titleSlug":"find-customer-referee"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":585,"title":"Investments in 2016","titleSlug":"investments-in-2016"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":586,"title":"Customer Placing the Largest Number of Orders","titleSlug":"customer-placing-the-largest-number-of-orders"}
+{"chalengeQuestionDates":["2022-11-19","2021-09-03"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":587,"title":"Erect the Fence","titleSlug":"erect-the-fence"}
+{"chalengeQuestionDates":["2022-01-08"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":588,"title":"Design In-Memory File System","titleSlug":"design-in-memory-file-system"}
+{"chalengeQuestionDates":["2021-04-20"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":589,"title":"N-ary Tree Preorder Traversal","titleSlug":"n-ary-tree-preorder-traversal"}
+{"chalengeQuestionDates":["2024-08-26"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":590,"title":"N-ary Tree Postorder Traversal","titleSlug":"n-ary-tree-postorder-traversal"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":591,"title":"Tag Validator","titleSlug":"tag-validator"}
+{"chalengeQuestionDates":["2024-08-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":592,"title":"Fraction Addition and Subtraction","titleSlug":"fraction-addition-and-subtraction"}
+{"chalengeQuestionDates":["2020-11-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":593,"title":"Valid Square","titleSlug":"valid-square"}
+{"chalengeQuestionDates":["2021-02-04"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":594,"title":"Longest Harmonious Subsequence","titleSlug":"longest-harmonious-subsequence"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":595,"title":"Big Countries","titleSlug":"big-countries"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":596,"title":"Classes More Than 5 Students","titleSlug":"classes-more-than-5-students"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":597,"title":"Friend Requests I: Overall Acceptance Rate","titleSlug":"friend-requests-i-overall-acceptance-rate"}
+{"chalengeQuestionDates":["2021-08-30"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":598,"title":"Range Addition II","titleSlug":"range-addition-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":599,"title":"Minimum Index Sum of Two Lists","titleSlug":"minimum-index-sum-of-two-lists"}
+{"chalengeQuestionDates":["2021-07-25"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":600,"title":"Non-negative Integers without Consecutive Ones","titleSlug":"non-negative-integers-without-consecutive-ones"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":601,"title":"Human Traffic of Stadium","titleSlug":"human-traffic-of-stadium"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":602,"title":"Friend Requests II: Who Has the Most Friends","titleSlug":"friend-requests-ii-who-has-the-most-friends"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":603,"title":"Consecutive Available Seats","titleSlug":"consecutive-available-seats"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":604,"title":"Design Compressed String Iterator","titleSlug":"design-compressed-string-iterator"}
+{"chalengeQuestionDates":["2023-03-20","2022-01-18","2020-12-05"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":605,"title":"Can Place Flowers","titleSlug":"can-place-flowers"}
+{"chalengeQuestionDates":["2023-12-08","2022-09-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":606,"title":"Construct String from Binary Tree","titleSlug":"construct-string-from-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":607,"title":"Sales Person","titleSlug":"sales-person"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":608,"title":"Tree Node","titleSlug":"tree-node"}
+{"chalengeQuestionDates":["2022-09-19","2021-05-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":609,"title":"Find Duplicate File in System","titleSlug":"find-duplicate-file-in-system"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":610,"title":"Triangle Judgement","titleSlug":"triangle-judgement"}
+{"chalengeQuestionDates":["2021-07-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":611,"title":"Valid Triangle Number","titleSlug":"valid-triangle-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":612,"title":"Shortest Distance in a Plane","titleSlug":"shortest-distance-in-a-plane"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":613,"title":"Shortest Distance in a Line","titleSlug":"shortest-distance-in-a-line"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":614,"title":"Second Degree Follower","titleSlug":"second-degree-follower"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":615,"title":"Average Salary: Departments VS Company","titleSlug":"average-salary-departments-vs-company"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":616,"title":"Add Bold Tag in String","titleSlug":"add-bold-tag-in-string"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":617,"title":"Merge Two Binary Trees","titleSlug":"merge-two-binary-trees"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":618,"title":"Students Report By Geography","titleSlug":"students-report-by-geography"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":619,"title":"Biggest Single Number","titleSlug":"biggest-single-number"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":620,"title":"Not Boring Movies","titleSlug":"not-boring-movies"}
+{"chalengeQuestionDates":["2024-03-19","2020-07-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":621,"title":"Task Scheduler","titleSlug":"task-scheduler"}
+{"chalengeQuestionDates":["2022-09-25","2021-04-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":622,"title":"Design Circular Queue","titleSlug":"design-circular-queue"}
+{"chalengeQuestionDates":["2024-04-16","2022-10-05","2021-03-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":623,"title":"Add One Row to Tree","titleSlug":"add-one-row-to-tree"}
+{"chalengeQuestionDates":["2024-08-16","2023-11-22","2021-12-15","2020-10-01"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":624,"title":"Maximum Distance in Arrays","titleSlug":"maximum-distance-in-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":625,"title":"Minimum Factorization","titleSlug":"minimum-factorization"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":626,"title":"Exchange Seats","titleSlug":"exchange-seats"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":627,"title":"Swap Salary","titleSlug":"swap-salary"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":628,"title":"Maximum Product of Three Numbers","titleSlug":"maximum-product-of-three-numbers"}
+{"chalengeQuestionDates":["2024-01-27","2022-07-17","2021-06-19"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":629,"title":"K Inverse Pairs Array","titleSlug":"k-inverse-pairs-array"}
+{"chalengeQuestionDates":["2022-06-23","2021-05-02"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":630,"title":"Course Schedule III","titleSlug":"course-schedule-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":631,"title":"Design Excel Sum Formula","titleSlug":"design-excel-sum-formula"}
+{"chalengeQuestionDates":["2024-10-13"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":632,"title":"Smallest Range Covering Elements from K Lists","titleSlug":"smallest-range-covering-elements-from-k-lists"}
+{"chalengeQuestionDates":["2024-06-17","2021-08-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":633,"title":"Sum of Square Numbers","titleSlug":"sum-of-square-numbers"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":634,"title":"Find the Derangement of An Array","titleSlug":"find-the-derangement-of-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":635,"title":"Design Log Storage System","titleSlug":"design-log-storage-system"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":636,"title":"Exclusive Time of Functions","titleSlug":"exclusive-time-of-functions"}
+{"chalengeQuestionDates":["2022-09-02","2021-03-05"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":637,"title":"Average of Levels in Binary Tree","titleSlug":"average-of-levels-in-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":638,"title":"Shopping Offers","titleSlug":"shopping-offers"}
+{"chalengeQuestionDates":["2021-07-10"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":639,"title":"Decode Ways II","titleSlug":"decode-ways-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":640,"title":"Solve the Equation","titleSlug":"solve-the-equation"}
+{"chalengeQuestionDates":["2024-09-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":641,"title":"Design Circular Deque","titleSlug":"design-circular-deque"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":642,"title":"Design Search Autocomplete System","titleSlug":"design-search-autocomplete-system"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":643,"title":"Maximum Average Subarray I","titleSlug":"maximum-average-subarray-i"}
+{"chalengeQuestionDates":["2020-11-29"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":644,"title":"Maximum Average Subarray II","titleSlug":"maximum-average-subarray-ii"}
+{"chalengeQuestionDates":["2024-01-22","2022-10-23","2021-03-02"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":645,"title":"Set Mismatch","titleSlug":"set-mismatch"}
+{"chalengeQuestionDates":["2023-08-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":646,"title":"Maximum Length of Pair Chain","titleSlug":"maximum-length-of-pair-chain"}
+{"chalengeQuestionDates":["2024-02-10","2022-05-22","2021-03-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":647,"title":"Palindromic Substrings","titleSlug":"palindromic-substrings"}
+{"chalengeQuestionDates":["2024-06-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":648,"title":"Replace Words","titleSlug":"replace-words"}
+{"chalengeQuestionDates":["2023-05-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":649,"title":"Dota2 Senate","titleSlug":"dota2-senate"}
+{"chalengeQuestionDates":["2024-08-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":650,"title":"2 Keys Keyboard","titleSlug":"2-keys-keyboard"}
+{"chalengeQuestionDates":["2023-03-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":651,"title":"4 Keys Keyboard","titleSlug":"4-keys-keyboard"}
+{"chalengeQuestionDates":["2023-02-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":652,"title":"Find Duplicate Subtrees","titleSlug":"find-duplicate-subtrees"}
+{"chalengeQuestionDates":["2022-10-09","2021-08-23"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":653,"title":"Two Sum IV - Input is a BST","titleSlug":"two-sum-iv-input-is-a-bst"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":654,"title":"Maximum Binary Tree","titleSlug":"maximum-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":655,"title":"Print Binary Tree","titleSlug":"print-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":656,"title":"Coin Path","titleSlug":"coin-path"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":657,"title":"Robot Return to Origin","titleSlug":"robot-return-to-origin"}
+{"chalengeQuestionDates":["2022-09-29","2021-07-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":658,"title":"Find K Closest Elements","titleSlug":"find-k-closest-elements"}
+{"chalengeQuestionDates":["2022-08-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":659,"title":"Split Array into Consecutive Subsequences","titleSlug":"split-array-into-consecutive-subsequences"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":660,"title":"Remove 9","titleSlug":"remove-9"}
+{"chalengeQuestionDates":["2023-12-19"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":661,"title":"Image Smoother","titleSlug":"image-smoother"}
+{"chalengeQuestionDates":["2023-04-20","2022-02-27","2020-07-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":662,"title":"Maximum Width of Binary Tree","titleSlug":"maximum-width-of-binary-tree"}
+{"chalengeQuestionDates":["2021-08-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":663,"title":"Equal Tree Partition","titleSlug":"equal-tree-partition"}
+{"chalengeQuestionDates":["2024-08-21","2023-07-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":664,"title":"Strange Printer","titleSlug":"strange-printer"}
+{"chalengeQuestionDates":["2022-06-25","2021-05-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":665,"title":"Non-decreasing Array","titleSlug":"non-decreasing-array"}
+{"chalengeQuestionDates":["2024-08-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":666,"title":"Path Sum IV","titleSlug":"path-sum-iv"}
+{"chalengeQuestionDates":["2021-04-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":667,"title":"Beautiful Arrangement II","titleSlug":"beautiful-arrangement-ii"}
+{"chalengeQuestionDates":["2021-11-16"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":668,"title":"Kth Smallest Number in Multiplication Table","titleSlug":"kth-smallest-number-in-multiplication-table"}
+{"chalengeQuestionDates":["2022-04-15","2021-02-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":669,"title":"Trim a Binary Search Tree","titleSlug":"trim-a-binary-search-tree"}
+{"chalengeQuestionDates":["2024-10-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":670,"title":"Maximum Swap","titleSlug":"maximum-swap"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":671,"title":"Second Minimum Node In a Binary Tree","titleSlug":"second-minimum-node-in-a-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":672,"title":"Bulb Switcher II","titleSlug":"bulb-switcher-ii"}
+{"chalengeQuestionDates":["2023-07-21","2020-10-30"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":673,"title":"Number of Longest Increasing Subsequence","titleSlug":"number-of-longest-increasing-subsequence"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":674,"title":"Longest Continuous Increasing Subsequence","titleSlug":"longest-continuous-increasing-subsequence"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":675,"title":"Cut Off Trees for Golf Event","titleSlug":"cut-off-trees-for-golf-event"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":676,"title":"Implement Magic Dictionary","titleSlug":"implement-magic-dictionary"}
+{"chalengeQuestionDates":["2021-07-30"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":677,"title":"Map Sum Pairs","titleSlug":"map-sum-pairs"}
+{"chalengeQuestionDates":["2024-04-07","2020-04-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":678,"title":"Valid Parenthesis String","titleSlug":"valid-parenthesis-string"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":679,"title":"24 Game","titleSlug":"24-game"}
+{"chalengeQuestionDates":["2022-04-02"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":680,"title":"Valid Palindrome II","titleSlug":"valid-palindrome-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":681,"title":"Next Closest Time","titleSlug":"next-closest-time"}
+{"chalengeQuestionDates":["2022-04-10"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":682,"title":"Baseball Game","titleSlug":"baseball-game"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":683,"title":"K Empty Slots","titleSlug":"k-empty-slots"}
+{"chalengeQuestionDates":["2021-06-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":684,"title":"Redundant Connection","titleSlug":"redundant-connection"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":685,"title":"Redundant Connection II","titleSlug":"redundant-connection-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":686,"title":"Repeated String Match","titleSlug":"repeated-string-match"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":687,"title":"Longest Univalue Path","titleSlug":"longest-univalue-path"}
+{"chalengeQuestionDates":["2023-07-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":688,"title":"Knight Probability in Chessboard","titleSlug":"knight-probability-in-chessboard"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":689,"title":"Maximum Sum of 3 Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":690,"title":"Employee Importance","titleSlug":"employee-importance"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":691,"title":"Stickers to Spell Word","titleSlug":"stickers-to-spell-word"}
+{"chalengeQuestionDates":["2022-10-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":692,"title":"Top K Frequent Words","titleSlug":"top-k-frequent-words"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":693,"title":"Binary Number with Alternating Bits","titleSlug":"binary-number-with-alternating-bits"}
+{"chalengeQuestionDates":["2022-05-15","2021-02-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":694,"title":"Number of Distinct Islands","titleSlug":"number-of-distinct-islands"}
+{"chalengeQuestionDates":["2022-07-15","2021-06-01"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":695,"title":"Max Area of Island","titleSlug":"max-area-of-island"}
+{"chalengeQuestionDates":["2021-04-23"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":696,"title":"Count Binary Substrings","titleSlug":"count-binary-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":697,"title":"Degree of an Array","titleSlug":"degree-of-an-array"}
+{"chalengeQuestionDates":["2021-09-30"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":698,"title":"Partition to K Equal Sum Subsets","titleSlug":"partition-to-k-equal-sum-subsets"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":699,"title":"Falling Squares","titleSlug":"falling-squares"}
+{"chalengeQuestionDates":["2022-04-14","2020-06-15"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":700,"title":"Search in a Binary Search Tree","titleSlug":"search-in-a-binary-search-tree"}
+{"chalengeQuestionDates":["2022-01-12","2020-10-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":701,"title":"Insert into a Binary Search Tree","titleSlug":"insert-into-a-binary-search-tree"}
+{"chalengeQuestionDates":["2020-10-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":702,"title":"Search in a Sorted Array of Unknown Size","titleSlug":"search-in-a-sorted-array-of-unknown-size"}
+{"chalengeQuestionDates":["2024-08-12","2023-05-23","2022-04-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":703,"title":"Kth Largest Element in a Stream","titleSlug":"kth-largest-element-in-a-stream"}
+{"chalengeQuestionDates":["2023-04-01","2022-03-26","2020-10-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":704,"title":"Binary Search","titleSlug":"binary-search"}
+{"chalengeQuestionDates":["2023-05-30","2022-04-21","2020-08-02"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":705,"title":"Design HashSet","titleSlug":"design-hashset"}
+{"chalengeQuestionDates":["2023-10-04","2022-04-22","2021-03-07"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":706,"title":"Design HashMap","titleSlug":"design-hashmap"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":707,"title":"Design Linked List","titleSlug":"design-linked-list"}
+{"chalengeQuestionDates":["2021-12-01","2020-09-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":708,"title":"Insert into a Sorted Circular Linked List","titleSlug":"insert-into-a-sorted-circular-linked-list"}
+{"chalengeQuestionDates":["2021-05-24"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":709,"title":"To Lower Case","titleSlug":"to-lower-case"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":710,"title":"Random Pick with Blacklist","titleSlug":"random-pick-with-blacklist"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":711,"title":"Number of Distinct Islands II","titleSlug":"number-of-distinct-islands-ii"}
+{"chalengeQuestionDates":["2023-07-31"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":712,"title":"Minimum ASCII Delete Sum for Two Strings","titleSlug":"minimum-ascii-delete-sum-for-two-strings"}
+{"chalengeQuestionDates":["2024-03-27","2020-09-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":713,"title":"Subarray Product Less Than K","titleSlug":"subarray-product-less-than-k"}
+{"chalengeQuestionDates":["2023-06-22","2021-03-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":714,"title":"Best Time to Buy and Sell Stock with Transaction Fee","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":715,"title":"Range Module","titleSlug":"range-module"}
+{"chalengeQuestionDates":["2022-10-08"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":716,"title":"Max Stack","titleSlug":"max-stack"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":717,"title":"1-bit and 2-bit Characters","titleSlug":"1-bit-and-2-bit-characters"}
+{"chalengeQuestionDates":["2022-09-20","2021-07-08"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":718,"title":"Maximum Length of Repeated Subarray","titleSlug":"maximum-length-of-repeated-subarray"}
+{"chalengeQuestionDates":["2024-08-14"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":719,"title":"Find K-th Smallest Pair Distance","titleSlug":"find-k-th-smallest-pair-distance"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":720,"title":"Longest Word in Dictionary","titleSlug":"longest-word-in-dictionary"}
+{"chalengeQuestionDates":["2021-11-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":721,"title":"Accounts Merge","titleSlug":"accounts-merge"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":722,"title":"Remove Comments","titleSlug":"remove-comments"}
+{"chalengeQuestionDates":["2023-08-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":723,"title":"Candy Crush","titleSlug":"candy-crush"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":724,"title":"Find Pivot Index","titleSlug":"find-pivot-index"}
+{"chalengeQuestionDates":["2024-09-08","2023-09-06","2021-09-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":725,"title":"Split Linked List in Parts","titleSlug":"split-linked-list-in-parts"}
+{"chalengeQuestionDates":["2024-07-14"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":726,"title":"Number of Atoms","titleSlug":"number-of-atoms"}
+{"chalengeQuestionDates":["2023-04-22"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":727,"title":"Minimum Window Subsequence","titleSlug":"minimum-window-subsequence"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":728,"title":"Self Dividing Numbers","titleSlug":"self-dividing-numbers"}
+{"chalengeQuestionDates":["2024-09-26","2022-08-03","2021-06-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":729,"title":"My Calendar I","titleSlug":"my-calendar-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":730,"title":"Count Different Palindromic Subsequences","titleSlug":"count-different-palindromic-subsequences"}
+{"chalengeQuestionDates":["2024-09-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":731,"title":"My Calendar II","titleSlug":"my-calendar-ii"}
+{"chalengeQuestionDates":["2022-10-07"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":732,"title":"My Calendar III","titleSlug":"my-calendar-iii"}
+{"chalengeQuestionDates":["2020-05-11"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":733,"title":"Flood Fill","titleSlug":"flood-fill"}
+{"chalengeQuestionDates":["2023-02-01"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":734,"title":"Sentence Similarity","titleSlug":"sentence-similarity"}
+{"chalengeQuestionDates":["2023-07-20","2020-10-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":735,"title":"Asteroid Collision","titleSlug":"asteroid-collision"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":736,"title":"Parse Lisp Expression","titleSlug":"parse-lisp-expression"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":737,"title":"Sentence Similarity II","titleSlug":"sentence-similarity-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":738,"title":"Monotone Increasing Digits","titleSlug":"monotone-increasing-digits"}
+{"chalengeQuestionDates":["2024-01-31","2022-12-18","2021-11-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":739,"title":"Daily Temperatures","titleSlug":"daily-temperatures"}
+{"chalengeQuestionDates":["2022-03-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":740,"title":"Delete and Earn","titleSlug":"delete-and-earn"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":741,"title":"Cherry Pickup","titleSlug":"cherry-pickup"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":742,"title":"Closest Leaf in a Binary Tree","titleSlug":"closest-leaf-in-a-binary-tree"}
+{"chalengeQuestionDates":["2022-05-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":743,"title":"Network Delay Time","titleSlug":"network-delay-time"}
+{"chalengeQuestionDates":["2023-06-09"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":744,"title":"Find Smallest Letter Greater Than Target","titleSlug":"find-smallest-letter-greater-than-target"}
+{"chalengeQuestionDates":["2022-06-18","2021-05-01"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":745,"title":"Prefix and Suffix Search","titleSlug":"prefix-and-suffix-search"}
+{"chalengeQuestionDates":["2023-10-13","2022-07-10","2021-06-07"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":746,"title":"Min Cost Climbing Stairs","titleSlug":"min-cost-climbing-stairs"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":747,"title":"Largest Number At Least Twice of Others","titleSlug":"largest-number-at-least-twice-of-others"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":748,"title":"Shortest Completing Word","titleSlug":"shortest-completing-word"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":749,"title":"Contain Virus","titleSlug":"contain-virus"}
+{"chalengeQuestionDates":["2021-01-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":750,"title":"Number Of Corner Rectangles","titleSlug":"number-of-corner-rectangles"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":751,"title":"IP to CIDR","titleSlug":"ip-to-cidr"}
+{"chalengeQuestionDates":["2024-04-22","2021-06-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":752,"title":"Open the Lock","titleSlug":"open-the-lock"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":753,"title":"Cracking the Safe","titleSlug":"cracking-the-safe"}
+{"chalengeQuestionDates":["2020-12-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":754,"title":"Reach a Number","titleSlug":"reach-a-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":755,"title":"Pour Water","titleSlug":"pour-water"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":756,"title":"Pyramid Transition Matrix","titleSlug":"pyramid-transition-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":757,"title":"Set Intersection Size At Least Two","titleSlug":"set-intersection-size-at-least-two"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":758,"title":"Bold Words in String","titleSlug":"bold-words-in-string"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":759,"title":"Employee Free Time","titleSlug":"employee-free-time"}
+{"chalengeQuestionDates":["2023-04-08"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":760,"title":"Find Anagram Mappings","titleSlug":"find-anagram-mappings"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":761,"title":"Special Binary String","titleSlug":"special-binary-string"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":762,"title":"Prime Number of Set Bits in Binary Representation","titleSlug":"prime-number-of-set-bits-in-binary-representation"}
+{"chalengeQuestionDates":["2022-03-21","2020-09-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":763,"title":"Partition Labels","titleSlug":"partition-labels"}
+{"chalengeQuestionDates":["2021-09-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":764,"title":"Largest Plus Sign","titleSlug":"largest-plus-sign"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":765,"title":"Couples Holding Hands","titleSlug":"couples-holding-hands"}
+{"chalengeQuestionDates":["2022-10-31"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":766,"title":"Toeplitz Matrix","titleSlug":"toeplitz-matrix"}
+{"chalengeQuestionDates":["2023-08-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":767,"title":"Reorganize String","titleSlug":"reorganize-string"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":768,"title":"Max Chunks To Make Sorted II","titleSlug":"max-chunks-to-make-sorted-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":769,"title":"Max Chunks To Make Sorted","titleSlug":"max-chunks-to-make-sorted"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":770,"title":"Basic Calculator IV","titleSlug":"basic-calculator-iv"}
+{"chalengeQuestionDates":["2020-05-02"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":771,"title":"Jewels and Stones","titleSlug":"jewels-and-stones"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":772,"title":"Basic Calculator III","titleSlug":"basic-calculator-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":773,"title":"Sliding Puzzle","titleSlug":"sliding-puzzle"}
+{"chalengeQuestionDates":["2021-09-15"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":774,"title":"Minimize Max Distance to Gas Station","titleSlug":"minimize-max-distance-to-gas-station"}
+{"chalengeQuestionDates":["2021-04-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":775,"title":"Global and Local Inversions","titleSlug":"global-and-local-inversions"}
+{"chalengeQuestionDates":["2024-06-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":776,"title":"Split BST","titleSlug":"split-bst"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":777,"title":"Swap Adjacent in LR String","titleSlug":"swap-adjacent-in-lr-string"}
+{"chalengeQuestionDates":["2021-06-20"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":778,"title":"Swim in Rising Water","titleSlug":"swim-in-rising-water"}
+{"chalengeQuestionDates":["2023-10-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":779,"title":"K-th Symbol in Grammar","titleSlug":"k-th-symbol-in-grammar"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":780,"title":"Reaching Points","titleSlug":"reaching-points"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":781,"title":"Rabbits in Forest","titleSlug":"rabbits-in-forest"}
+{"chalengeQuestionDates":["2021-09-26"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":782,"title":"Transform to Chessboard","titleSlug":"transform-to-chessboard"}
+{"chalengeQuestionDates":["2023-02-17"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":783,"title":"Minimum Distance Between BST Nodes","titleSlug":"minimum-distance-between-bst-nodes"}
+{"chalengeQuestionDates":["2021-02-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":784,"title":"Letter Case Permutation","titleSlug":"letter-case-permutation"}
+{"chalengeQuestionDates":["2023-05-19","2022-04-29","2021-02-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":785,"title":"Is Graph Bipartite?","titleSlug":"is-graph-bipartite"}
+{"chalengeQuestionDates":["2024-05-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":786,"title":"K-th Smallest Prime Fraction","titleSlug":"k-th-smallest-prime-fraction"}
+{"chalengeQuestionDates":["2024-02-23","2023-01-26","2020-06-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":787,"title":"Cheapest Flights Within K Stops","titleSlug":"cheapest-flights-within-k-stops"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":788,"title":"Rotated Digits","titleSlug":"rotated-digits"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":789,"title":"Escape The Ghosts","titleSlug":"escape-the-ghosts"}
+{"chalengeQuestionDates":["2022-12-24","2021-12-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":790,"title":"Domino and Tromino Tiling","titleSlug":"domino-and-tromino-tiling"}
+{"chalengeQuestionDates":["2024-03-11","2021-07-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":791,"title":"Custom Sort String","titleSlug":"custom-sort-string"}
+{"chalengeQuestionDates":["2022-07-20","2021-06-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":792,"title":"Number of Matching Subsequences","titleSlug":"number-of-matching-subsequences"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":793,"title":"Preimage Size of Factorial Zeroes Function","titleSlug":"preimage-size-of-factorial-zeroes-function"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":794,"title":"Valid Tic-Tac-Toe State","titleSlug":"valid-tic-tac-toe-state"}
+{"chalengeQuestionDates":["2021-06-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":795,"title":"Number of Subarrays with Bounded Maximum","titleSlug":"number-of-subarrays-with-bounded-maximum"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":796,"title":"Rotate String","titleSlug":"rotate-string"}
+{"chalengeQuestionDates":["2022-12-30","2021-11-28","2020-07-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":797,"title":"All Paths From Source to Target","titleSlug":"all-paths-from-source-to-target"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":798,"title":"Smallest Rotation with Highest Score","titleSlug":"smallest-rotation-with-highest-score"}
+{"chalengeQuestionDates":["2023-09-24","2022-03-04","2020-10-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":799,"title":"Champagne Tower","titleSlug":"champagne-tower"}
+{"chalengeQuestionDates":["2022-10-15"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":800,"title":"Similar RGB Color","titleSlug":"similar-rgb-color"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":801,"title":"Minimum Swaps To Make Sequences Increasing","titleSlug":"minimum-swaps-to-make-sequences-increasing"}
+{"chalengeQuestionDates":["2023-07-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":802,"title":"Find Eventual Safe States","titleSlug":"find-eventual-safe-states"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":803,"title":"Bricks Falling When Hit","titleSlug":"bricks-falling-when-hit"}
+{"chalengeQuestionDates":["2022-08-17","2020-11-22"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":804,"title":"Unique Morse Code Words","titleSlug":"unique-morse-code-words"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":805,"title":"Split Array With Same Average","titleSlug":"split-array-with-same-average"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":806,"title":"Number of Lines To Write String","titleSlug":"number-of-lines-to-write-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":807,"title":"Max Increase to Keep City Skyline","titleSlug":"max-increase-to-keep-city-skyline"}
+{"chalengeQuestionDates":["2023-07-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":808,"title":"Soup Servings","titleSlug":"soup-servings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":809,"title":"Expressive Words","titleSlug":"expressive-words"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":810,"title":"Chalkboard XOR Game","titleSlug":"chalkboard-xor-game"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":811,"title":"Subdomain Visit Count","titleSlug":"subdomain-visit-count"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":812,"title":"Largest Triangle Area","titleSlug":"largest-triangle-area"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":813,"title":"Largest Sum of Averages","titleSlug":"largest-sum-of-averages"}
+{"chalengeQuestionDates":["2022-09-06","2021-07-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":814,"title":"Binary Tree Pruning","titleSlug":"binary-tree-pruning"}
+{"chalengeQuestionDates":["2023-11-12"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":815,"title":"Bus Routes","titleSlug":"bus-routes"}
+{"chalengeQuestionDates":["2021-05-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":816,"title":"Ambiguous Coordinates","titleSlug":"ambiguous-coordinates"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":817,"title":"Linked List Components","titleSlug":"linked-list-components"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":818,"title":"Race Car","titleSlug":"race-car"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":819,"title":"Most Common Word","titleSlug":"most-common-word"}
+{"chalengeQuestionDates":["2022-06-20","2021-03-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":820,"title":"Short Encoding of Words","titleSlug":"short-encoding-of-words"}
+{"chalengeQuestionDates":["2021-02-07"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":821,"title":"Shortest Distance to a Character","titleSlug":"shortest-distance-to-a-character"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":822,"title":"Card Flipping Game","titleSlug":"card-flipping-game"}
+{"chalengeQuestionDates":["2023-10-26","2022-08-09","2021-03-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":823,"title":"Binary Trees With Factors","titleSlug":"binary-trees-with-factors"}
+{"chalengeQuestionDates":["2020-08-19"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":824,"title":"Goat Latin","titleSlug":"goat-latin"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":825,"title":"Friends Of Appropriate Ages","titleSlug":"friends-of-appropriate-ages"}
+{"chalengeQuestionDates":["2024-06-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":826,"title":"Most Profit Assigning Work","titleSlug":"most-profit-assigning-work"}
+{"chalengeQuestionDates":["2021-08-01"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":827,"title":"Making A Large Island","titleSlug":"making-a-large-island"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":828,"title":"Count Unique Characters of All Substrings of a Given String","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":829,"title":"Consecutive Numbers Sum","titleSlug":"consecutive-numbers-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":830,"title":"Positions of Large Groups","titleSlug":"positions-of-large-groups"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":831,"title":"Masking Personal Information","titleSlug":"masking-personal-information"}
+{"chalengeQuestionDates":["2020-11-10"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":832,"title":"Flipping an Image","titleSlug":"flipping-an-image"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":833,"title":"Find And Replace in String","titleSlug":"find-and-replace-in-string"}
+{"chalengeQuestionDates":["2024-04-28","2022-12-22","2021-09-04"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":834,"title":"Sum of Distances in Tree","titleSlug":"sum-of-distances-in-tree"}
+{"chalengeQuestionDates":["2022-10-27","2020-09-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":835,"title":"Image Overlap","titleSlug":"image-overlap"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":836,"title":"Rectangle Overlap","titleSlug":"rectangle-overlap"}
+{"chalengeQuestionDates":["2023-05-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":837,"title":"New 21 Game","titleSlug":"new-21-game"}
+{"chalengeQuestionDates":["2022-09-27","2021-07-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":838,"title":"Push Dominoes","titleSlug":"push-dominoes"}
+{"chalengeQuestionDates":["2023-04-28"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":839,"title":"Similar String Groups","titleSlug":"similar-string-groups"}
+{"chalengeQuestionDates":["2024-08-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":840,"title":"Magic Squares In Grid","titleSlug":"magic-squares-in-grid"}
+{"chalengeQuestionDates":["2022-12-20","2021-03-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":841,"title":"Keys and Rooms","titleSlug":"keys-and-rooms"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":842,"title":"Split Array into Fibonacci Sequence","titleSlug":"split-array-into-fibonacci-sequence"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":843,"title":"Guess the Word","titleSlug":"guess-the-word"}
+{"chalengeQuestionDates":["2023-10-19","2022-05-01","2020-04-09"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":844,"title":"Backspace String Compare","titleSlug":"backspace-string-compare"}
+{"chalengeQuestionDates":["2020-11-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":845,"title":"Longest Mountain in Array","titleSlug":"longest-mountain-in-array"}
+{"chalengeQuestionDates":["2024-06-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":846,"title":"Hand of Straights","titleSlug":"hand-of-straights"}
+{"chalengeQuestionDates":["2023-09-17","2022-02-26"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":847,"title":"Shortest Path Visiting All Nodes","titleSlug":"shortest-path-visiting-all-nodes"}
+{"chalengeQuestionDates":["2021-09-08"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":848,"title":"Shifting Letters","titleSlug":"shifting-letters"}
+{"chalengeQuestionDates":["2022-01-16","2020-10-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":849,"title":"Maximize Distance to Closest Person","titleSlug":"maximize-distance-to-closest-person"}
+{"chalengeQuestionDates":["2021-08-22"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":850,"title":"Rectangle Area II","titleSlug":"rectangle-area-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":851,"title":"Loud and Rich","titleSlug":"loud-and-rich"}
+{"chalengeQuestionDates":["2023-07-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":852,"title":"Peak Index in a Mountain Array","titleSlug":"peak-index-in-a-mountain-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":853,"title":"Car Fleet","titleSlug":"car-fleet"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":854,"title":"K-Similar Strings","titleSlug":"k-similar-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":855,"title":"Exam Room","titleSlug":"exam-room"}
+{"chalengeQuestionDates":["2022-03-17","2021-02-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":856,"title":"Score of Parentheses","titleSlug":"score-of-parentheses"}
+{"chalengeQuestionDates":["2024-05-11"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":857,"title":"Minimum Cost to Hire K Workers","titleSlug":"minimum-cost-to-hire-k-workers"}
+{"chalengeQuestionDates":["2022-08-04","2020-11-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":858,"title":"Mirror Reflection","titleSlug":"mirror-reflection"}
+{"chalengeQuestionDates":["2023-07-03","2020-10-12"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":859,"title":"Buddy Strings","titleSlug":"buddy-strings"}
+{"chalengeQuestionDates":["2024-08-15"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":860,"title":"Lemonade Change","titleSlug":"lemonade-change"}
+{"chalengeQuestionDates":["2024-05-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":861,"title":"Score After Flipping Matrix","titleSlug":"score-after-flipping-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":862,"title":"Shortest Subarray with Sum at Least K","titleSlug":"shortest-subarray-with-sum-at-least-k"}
+{"chalengeQuestionDates":["2023-07-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":863,"title":"All Nodes Distance K in Binary Tree","titleSlug":"all-nodes-distance-k-in-binary-tree"}
+{"chalengeQuestionDates":["2023-06-29"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":864,"title":"Shortest Path to Get All Keys","titleSlug":"shortest-path-to-get-all-keys"}
+{"chalengeQuestionDates":["2020-12-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":865,"title":"Smallest Subtree with all the Deepest Nodes","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":866,"title":"Prime Palindrome","titleSlug":"prime-palindrome"}
+{"chalengeQuestionDates":["2023-12-10","2022-06-02"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":867,"title":"Transpose Matrix","titleSlug":"transpose-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":868,"title":"Binary Gap","titleSlug":"binary-gap"}
+{"chalengeQuestionDates":["2022-08-26","2021-03-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":869,"title":"Reordered Power of 2","titleSlug":"reordered-power-of-2"}
+{"chalengeQuestionDates":["2021-03-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":870,"title":"Advantage Shuffle","titleSlug":"advantage-shuffle"}
+{"chalengeQuestionDates":["2022-08-20","2021-06-12"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":871,"title":"Minimum Number of Refueling Stops","titleSlug":"minimum-number-of-refueling-stops"}
+{"chalengeQuestionDates":["2024-01-09","2022-12-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":872,"title":"Leaf-Similar Trees","titleSlug":"leaf-similar-trees"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":873,"title":"Length of Longest Fibonacci Subsequence","titleSlug":"length-of-longest-fibonacci-subsequence"}
+{"chalengeQuestionDates":["2024-09-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":874,"title":"Walking Robot Simulation","titleSlug":"walking-robot-simulation"}
+{"chalengeQuestionDates":["2023-03-08","2022-01-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":875,"title":"Koko Eating Bananas","titleSlug":"koko-eating-bananas"}
+{"chalengeQuestionDates":["2024-03-07","2022-12-05","2021-12-28","2020-04-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":876,"title":"Middle of the Linked List","titleSlug":"middle-of-the-linked-list"}
+{"chalengeQuestionDates":["2021-08-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":877,"title":"Stone Game","titleSlug":"stone-game"}
+{"chalengeQuestionDates":["2021-12-11"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":878,"title":"Nth Magical Number","titleSlug":"nth-magical-number"}
+{"chalengeQuestionDates":["2023-04-21"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":879,"title":"Profitable Schemes","titleSlug":"profitable-schemes"}
+{"chalengeQuestionDates":["2023-09-27","2020-12-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":880,"title":"Decoded String at Index","titleSlug":"decoded-string-at-index"}
+{"chalengeQuestionDates":["2024-05-04","2023-04-03","2022-03-24","2021-01-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":881,"title":"Boats to Save People","titleSlug":"boats-to-save-people"}
+{"chalengeQuestionDates":["2021-09-12"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":882,"title":"Reachable Nodes In Subdivided Graph","titleSlug":"reachable-nodes-in-subdivided-graph"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":883,"title":"Projection Area of 3D Shapes","titleSlug":"projection-area-of-3d-shapes"}
+{"chalengeQuestionDates":["2024-09-17"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":884,"title":"Uncommon Words from Two Sentences","titleSlug":"uncommon-words-from-two-sentences"}
+{"chalengeQuestionDates":["2024-08-08"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":885,"title":"Spiral Matrix III","titleSlug":"spiral-matrix-iii"}
+{"chalengeQuestionDates":["2022-12-21","2020-05-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":886,"title":"Possible Bipartition","titleSlug":"possible-bipartition"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":887,"title":"Super Egg Drop","titleSlug":"super-egg-drop"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":888,"title":"Fair Candy Swap","titleSlug":"fair-candy-swap"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":889,"title":"Construct Binary Tree from Preorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"}
+{"chalengeQuestionDates":["2022-07-29","2021-05-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":890,"title":"Find and Replace Pattern","titleSlug":"find-and-replace-pattern"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":891,"title":"Sum of Subsequence Widths","titleSlug":"sum-of-subsequence-widths"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":892,"title":"Surface Area of 3D Shapes","titleSlug":"surface-area-of-3d-shapes"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":893,"title":"Groups of Special-Equivalent Strings","titleSlug":"groups-of-special-equivalent-strings"}
+{"chalengeQuestionDates":["2023-07-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":894,"title":"All Possible Full Binary Trees","titleSlug":"all-possible-full-binary-trees"}
+{"chalengeQuestionDates":["2022-03-19","2021-02-28"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":895,"title":"Maximum Frequency Stack","titleSlug":"maximum-frequency-stack"}
+{"chalengeQuestionDates":["2023-09-29"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":896,"title":"Monotonic Array","titleSlug":"monotonic-array"}
+{"chalengeQuestionDates":["2022-04-17","2020-12-03"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":897,"title":"Increasing Order Search Tree","titleSlug":"increasing-order-search-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":898,"title":"Bitwise ORs of Subarrays","titleSlug":"bitwise-ors-of-subarrays"}
+{"chalengeQuestionDates":["2022-11-06","2021-09-05"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":899,"title":"Orderly Queue","titleSlug":"orderly-queue"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":900,"title":"RLE Iterator","titleSlug":"rle-iterator"}
+{"chalengeQuestionDates":["2022-11-09","2020-05-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":901,"title":"Online Stock Span","titleSlug":"online-stock-span"}
+{"chalengeQuestionDates":["2021-12-18","2020-11-21"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":902,"title":"Numbers At Most N Given Digit Set","titleSlug":"numbers-at-most-n-given-digit-set"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":903,"title":"Valid Permutations for DI Sequence","titleSlug":"valid-permutations-for-di-sequence"}
+{"chalengeQuestionDates":["2023-02-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":904,"title":"Fruit Into Baskets","titleSlug":"fruit-into-baskets"}
+{"chalengeQuestionDates":["2023-09-28","2022-05-02","2020-08-21"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":905,"title":"Sort Array By Parity","titleSlug":"sort-array-by-parity"}
+{"chalengeQuestionDates":["2021-05-08"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":906,"title":"Super Palindromes","titleSlug":"super-palindromes"}
+{"chalengeQuestionDates":["2024-01-20","2022-11-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":907,"title":"Sum of Subarray Minimums","titleSlug":"sum-of-subarray-minimums"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":908,"title":"Smallest Range I","titleSlug":"smallest-range-i"}
+{"chalengeQuestionDates":["2023-01-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":909,"title":"Snakes and Ladders","titleSlug":"snakes-and-ladders"}
+{"chalengeQuestionDates":["2020-12-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":910,"title":"Smallest Range II","titleSlug":"smallest-range-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":911,"title":"Online Election","titleSlug":"online-election"}
+{"chalengeQuestionDates":["2024-07-25","2023-03-01"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":912,"title":"Sort an Array","titleSlug":"sort-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":913,"title":"Cat and Mouse","titleSlug":"cat-and-mouse"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":914,"title":"X of a Kind in a Deck of Cards","titleSlug":"x-of-a-kind-in-a-deck-of-cards"}
+{"chalengeQuestionDates":["2021-07-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":915,"title":"Partition Array into Disjoint Intervals","titleSlug":"partition-array-into-disjoint-intervals"}
+{"chalengeQuestionDates":["2022-07-30","2021-03-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":916,"title":"Word Subsets","titleSlug":"word-subsets"}
+{"chalengeQuestionDates":["2021-09-14"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":917,"title":"Reverse Only Letters","titleSlug":"reverse-only-letters"}
+{"chalengeQuestionDates":["2023-01-18","2020-05-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":918,"title":"Maximum Sum Circular Subarray","titleSlug":"maximum-sum-circular-subarray"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":919,"title":"Complete Binary Tree Inserter","titleSlug":"complete-binary-tree-inserter"}
+{"chalengeQuestionDates":["2023-08-06"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":920,"title":"Number of Music Playlists","titleSlug":"number-of-music-playlists"}
+{"chalengeQuestionDates":["2024-10-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":921,"title":"Minimum Add to Make Parentheses Valid","titleSlug":"minimum-add-to-make-parentheses-valid"}
+{"chalengeQuestionDates":["2021-09-28"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":922,"title":"Sort Array By Parity II","titleSlug":"sort-array-by-parity-ii"}
+{"chalengeQuestionDates":["2022-04-06","2021-03-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":923,"title":"3Sum With Multiplicity","titleSlug":"3sum-with-multiplicity"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":924,"title":"Minimize Malware Spread","titleSlug":"minimize-malware-spread"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":925,"title":"Long Pressed Name","titleSlug":"long-pressed-name"}
+{"chalengeQuestionDates":["2023-01-17","2021-08-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":926,"title":"Flip String to Monotone Increasing","titleSlug":"flip-string-to-monotone-increasing"}
+{"chalengeQuestionDates":["2021-07-17"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":927,"title":"Three Equal Parts","titleSlug":"three-equal-parts"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":928,"title":"Minimize Malware Spread II","titleSlug":"minimize-malware-spread-ii"}
+{"chalengeQuestionDates":["2021-09-27"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":929,"title":"Unique Email Addresses","titleSlug":"unique-email-addresses"}
+{"chalengeQuestionDates":["2024-03-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":930,"title":"Binary Subarrays With Sum","titleSlug":"binary-subarrays-with-sum"}
+{"chalengeQuestionDates":["2024-01-19","2022-12-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":931,"title":"Minimum Falling Path Sum","titleSlug":"minimum-falling-path-sum"}
+{"chalengeQuestionDates":["2021-07-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":932,"title":"Beautiful Array","titleSlug":"beautiful-array"}
+{"chalengeQuestionDates":["2020-10-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":933,"title":"Number of Recent Calls","titleSlug":"number-of-recent-calls"}
+{"chalengeQuestionDates":["2023-05-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":934,"title":"Shortest Bridge","titleSlug":"shortest-bridge"}
+{"chalengeQuestionDates":["2023-11-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":935,"title":"Knight Dialer","titleSlug":"knight-dialer"}
+{"chalengeQuestionDates":["2022-08-21","2021-03-31"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":936,"title":"Stamping The Sequence","titleSlug":"stamping-the-sequence"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":937,"title":"Reorder Data in Log Files","titleSlug":"reorder-data-in-log-files"}
+{"chalengeQuestionDates":["2024-01-08","2022-12-07","2021-12-14","2020-11-15"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":938,"title":"Range Sum of BST","titleSlug":"range-sum-of-bst"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":939,"title":"Minimum Area Rectangle","titleSlug":"minimum-area-rectangle"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":940,"title":"Distinct Subsequences II","titleSlug":"distinct-subsequences-ii"}
+{"chalengeQuestionDates":["2022-01-25","2020-12-10"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":941,"title":"Valid Mountain Array","titleSlug":"valid-mountain-array"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":942,"title":"DI String Match","titleSlug":"di-string-match"}
+{"chalengeQuestionDates":["2021-05-23"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":943,"title":"Find the Shortest Superstring","titleSlug":"find-the-shortest-superstring"}
+{"chalengeQuestionDates":["2023-01-03"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":944,"title":"Delete Columns to Make Sorted","titleSlug":"delete-columns-to-make-sorted"}
+{"chalengeQuestionDates":["2024-06-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":945,"title":"Minimum Increment to Make Array Unique","titleSlug":"minimum-increment-to-make-array-unique"}
+{"chalengeQuestionDates":["2023-04-13","2022-03-16","2021-02-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":946,"title":"Validate Stack Sequences","titleSlug":"validate-stack-sequences"}
+{"chalengeQuestionDates":["2024-08-29","2022-11-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":947,"title":"Most Stones Removed with Same Row or Column","titleSlug":"most-stones-removed-with-same-row-or-column"}
+{"chalengeQuestionDates":["2024-03-04","2022-09-12","2020-10-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":948,"title":"Bag of Tokens","titleSlug":"bag-of-tokens"}
+{"chalengeQuestionDates":["2020-09-01"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":949,"title":"Largest Time for Given Digits","titleSlug":"largest-time-for-given-digits"}
+{"chalengeQuestionDates":["2024-04-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":950,"title":"Reveal Cards In Increasing Order","titleSlug":"reveal-cards-in-increasing-order"}
+{"chalengeQuestionDates":["2024-10-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":951,"title":"Flip Equivalent Binary Trees","titleSlug":"flip-equivalent-binary-trees"}
+{"chalengeQuestionDates":["2021-11-23","2020-08-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":952,"title":"Largest Component Size by Common Factor","titleSlug":"largest-component-size-by-common-factor"}
+{"chalengeQuestionDates":["2023-02-02","2021-04-09"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":953,"title":"Verifying an Alien Dictionary","titleSlug":"verifying-an-alien-dictionary"}
+{"chalengeQuestionDates":["2021-08-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":954,"title":"Array of Doubled Pairs","titleSlug":"array-of-doubled-pairs"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":955,"title":"Delete Columns to Make Sorted II","titleSlug":"delete-columns-to-make-sorted-ii"}
+{"chalengeQuestionDates":["2023-06-24"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":956,"title":"Tallest Billboard","titleSlug":"tallest-billboard"}
+{"chalengeQuestionDates":["2020-07-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":957,"title":"Prison Cells After N Days","titleSlug":"prison-cells-after-n-days"}
+{"chalengeQuestionDates":["2023-03-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":958,"title":"Check Completeness of a Binary Tree","titleSlug":"check-completeness-of-a-binary-tree"}
+{"chalengeQuestionDates":["2024-08-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":959,"title":"Regions Cut By Slashes","titleSlug":"regions-cut-by-slashes"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":960,"title":"Delete Columns to Make Sorted III","titleSlug":"delete-columns-to-make-sorted-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":961,"title":"N-Repeated Element in Size 2N Array","titleSlug":"n-repeated-element-in-size-2n-array"}
+{"chalengeQuestionDates":["2024-10-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":962,"title":"Maximum Width Ramp","titleSlug":"maximum-width-ramp"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":963,"title":"Minimum Area Rectangle II","titleSlug":"minimum-area-rectangle-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":964,"title":"Least Operators to Express Number","titleSlug":"least-operators-to-express-number"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":965,"title":"Univalued Binary Tree","titleSlug":"univalued-binary-tree"}
+{"chalengeQuestionDates":["2021-03-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":966,"title":"Vowel Spellchecker","titleSlug":"vowel-spellchecker"}
+{"chalengeQuestionDates":["2022-09-03","2020-08-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":967,"title":"Numbers With Same Consecutive Differences","titleSlug":"numbers-with-same-consecutive-differences"}
+{"chalengeQuestionDates":["2022-06-17","2021-05-16"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":968,"title":"Binary Tree Cameras","titleSlug":"binary-tree-cameras"}
+{"chalengeQuestionDates":["2020-08-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":969,"title":"Pancake Sorting","titleSlug":"pancake-sorting"}
+{"chalengeQuestionDates":["2021-04-30"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":970,"title":"Powerful Integers","titleSlug":"powerful-integers"}
+{"chalengeQuestionDates":["2021-03-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":971,"title":"Flip Binary Tree To Match Preorder Traversal","titleSlug":"flip-binary-tree-to-match-preorder-traversal"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":972,"title":"Equal Rational Numbers","titleSlug":"equal-rational-numbers"}
+{"chalengeQuestionDates":["2021-12-26","2020-05-30"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":973,"title":"K Closest Points to Origin","titleSlug":"k-closest-points-to-origin"}
+{"chalengeQuestionDates":["2024-06-09","2023-01-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":974,"title":"Subarray Sums Divisible by K","titleSlug":"subarray-sums-divisible-by-k"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":975,"title":"Odd Even Jump","titleSlug":"odd-even-jump"}
+{"chalengeQuestionDates":["2022-10-12"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":976,"title":"Largest Perimeter Triangle","titleSlug":"largest-perimeter-triangle"}
+{"chalengeQuestionDates":["2024-03-02","2020-12-15"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":977,"title":"Squares of a Sorted Array","titleSlug":"squares-of-a-sorted-array"}
+{"chalengeQuestionDates":["2021-09-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":978,"title":"Longest Turbulent Subarray","titleSlug":"longest-turbulent-subarray"}
+{"chalengeQuestionDates":["2024-05-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":979,"title":"Distribute Coins in Binary Tree","titleSlug":"distribute-coins-in-binary-tree"}
+{"chalengeQuestionDates":["2022-12-31","2021-11-02","2020-09-20"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":980,"title":"Unique Paths III","titleSlug":"unique-paths-iii"}
+{"chalengeQuestionDates":["2022-10-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":981,"title":"Time Based Key-Value Store","titleSlug":"time-based-key-value-store"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":982,"title":"Triples with Bitwise AND Equal To Zero","titleSlug":"triples-with-bitwise-and-equal-to-zero"}
+{"chalengeQuestionDates":["2023-03-28","2020-08-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":983,"title":"Minimum Cost For Tickets","titleSlug":"minimum-cost-for-tickets"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":984,"title":"String Without AAA or BBB","titleSlug":"string-without-aaa-or-bbb"}
+{"chalengeQuestionDates":["2022-09-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":985,"title":"Sum of Even Numbers After Queries","titleSlug":"sum-of-even-numbers-after-queries"}
+{"chalengeQuestionDates":["2021-11-24","2020-05-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":986,"title":"Interval List Intersections","titleSlug":"interval-list-intersections"}
+{"chalengeQuestionDates":["2022-09-04","2021-01-29","2020-08-07"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":987,"title":"Vertical Order Traversal of a Binary Tree","titleSlug":"vertical-order-traversal-of-a-binary-tree"}
+{"chalengeQuestionDates":["2024-04-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":988,"title":"Smallest String Starting From Leaf","titleSlug":"smallest-string-starting-from-leaf"}
+{"chalengeQuestionDates":["2023-02-15"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":989,"title":"Add to Array-Form of Integer","titleSlug":"add-to-array-form-of-integer"}
+{"chalengeQuestionDates":["2022-09-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":990,"title":"Satisfiability of Equality Equations","titleSlug":"satisfiability-of-equality-equations"}
+{"chalengeQuestionDates":["2022-03-23","2021-02-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":991,"title":"Broken Calculator","titleSlug":"broken-calculator"}
+{"chalengeQuestionDates":["2024-03-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":992,"title":"Subarrays with K Different Integers","titleSlug":"subarrays-with-k-different-integers"}
+{"chalengeQuestionDates":["2021-10-18","2020-05-07"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":993,"title":"Cousins in Binary Tree","titleSlug":"cousins-in-binary-tree"}
+{"chalengeQuestionDates":["2021-10-29","2020-08-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":994,"title":"Rotting Oranges","titleSlug":"rotting-oranges"}
+{"chalengeQuestionDates":["2024-06-24"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":995,"title":"Minimum Number of K Consecutive Bit Flips","titleSlug":"minimum-number-of-k-consecutive-bit-flips"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":996,"title":"Number of Squareful Arrays","titleSlug":"number-of-squareful-arrays"}
+{"chalengeQuestionDates":["2024-02-22","2023-01-23","2022-01-03","2020-05-10"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":997,"title":"Find the Town Judge","titleSlug":"find-the-town-judge"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":998,"title":"Maximum Binary Tree II","titleSlug":"maximum-binary-tree-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":999,"title":"Available Captures for Rook","titleSlug":"available-captures-for-rook"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1000,"title":"Minimum Cost to Merge Stones","titleSlug":"minimum-cost-to-merge-stones"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1001,"title":"Grid Illumination","titleSlug":"grid-illumination"}
+{"chalengeQuestionDates":["2024-06-05"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1002,"title":"Find Common Characters","titleSlug":"find-common-characters"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1003,"title":"Check If Word Is Valid After Substitutions","titleSlug":"check-if-word-is-valid-after-substitutions"}
+{"chalengeQuestionDates":["2021-06-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1004,"title":"Max Consecutive Ones III","titleSlug":"max-consecutive-ones-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1005,"title":"Maximize Sum Of Array After K Negations","titleSlug":"maximize-sum-of-array-after-k-negations"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1006,"title":"Clumsy Factorial","titleSlug":"clumsy-factorial"}
+{"chalengeQuestionDates":["2022-03-20","2020-10-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1007,"title":"Minimum Domino Rotations For Equal Row","titleSlug":"minimum-domino-rotations-for-equal-row"}
+{"chalengeQuestionDates":["2021-10-13","2020-05-24","2020-04-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1008,"title":"Construct Binary Search Tree from Preorder Traversal","titleSlug":"construct-binary-search-tree-from-preorder-traversal"}
+{"chalengeQuestionDates":["2022-01-04","2020-10-05"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1009,"title":"Complement of Base 10 Integer","titleSlug":"complement-of-base-10-integer"}
+{"chalengeQuestionDates":["2022-01-02","2020-12-08"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1010,"title":"Pairs of Songs With Total Durations Divisible by 60","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"}
+{"chalengeQuestionDates":["2023-02-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1011,"title":"Capacity To Ship Packages Within D Days","titleSlug":"capacity-to-ship-packages-within-d-days"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1012,"title":"Numbers With Repeated Digits","titleSlug":"numbers-with-repeated-digits"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1013,"title":"Partition Array Into Three Parts With Equal Sum","titleSlug":"partition-array-into-three-parts-with-equal-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1014,"title":"Best Sightseeing Pair","titleSlug":"best-sightseeing-pair"}
+{"chalengeQuestionDates":["2021-12-30","2020-11-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1015,"title":"Smallest Integer Divisible by K","titleSlug":"smallest-integer-divisible-by-k"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1016,"title":"Binary String With Substrings Representing 1 To N","titleSlug":"binary-string-with-substrings-representing-1-to-n"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1017,"title":"Convert to Base -2","titleSlug":"convert-to-base-2"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1018,"title":"Binary Prefix Divisible By 5","titleSlug":"binary-prefix-divisible-by-5"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1019,"title":"Next Greater Node In Linked List","titleSlug":"next-greater-node-in-linked-list"}
+{"chalengeQuestionDates":["2023-04-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1020,"title":"Number of Enclaves","titleSlug":"number-of-enclaves"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1021,"title":"Remove Outermost Parentheses","titleSlug":"remove-outermost-parentheses"}
+{"chalengeQuestionDates":["2022-01-11","2020-09-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1022,"title":"Sum of Root To Leaf Binary Numbers","titleSlug":"sum-of-root-to-leaf-binary-numbers"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1023,"title":"Camelcase Matching","titleSlug":"camelcase-matching"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1024,"title":"Video Stitching","titleSlug":"video-stitching"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1025,"title":"Divisor Game","titleSlug":"divisor-game"}
+{"chalengeQuestionDates":["2024-01-11","2022-12-09","2021-12-31","2020-11-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1026,"title":"Maximum Difference Between Node and Ancestor","titleSlug":"maximum-difference-between-node-and-ancestor"}
+{"chalengeQuestionDates":["2023-06-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1027,"title":"Longest Arithmetic Subsequence","titleSlug":"longest-arithmetic-subsequence"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1028,"title":"Recover a Tree From Preorder Traversal","titleSlug":"recover-a-tree-from-preorder-traversal"}
+{"chalengeQuestionDates":["2022-03-25","2020-06-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1029,"title":"Two City Scheduling","titleSlug":"two-city-scheduling"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1030,"title":"Matrix Cells in Distance Order","titleSlug":"matrix-cells-in-distance-order"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1031,"title":"Maximum Sum of Two Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"}
+{"chalengeQuestionDates":["2021-12-04","2020-08-23"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1032,"title":"Stream of Characters","titleSlug":"stream-of-characters"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1033,"title":"Moving Stones Until Consecutive","titleSlug":"moving-stones-until-consecutive"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1034,"title":"Coloring A Border","titleSlug":"coloring-a-border"}
+{"chalengeQuestionDates":["2023-05-11","2020-05-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1035,"title":"Uncrossed Lines","titleSlug":"uncrossed-lines"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1036,"title":"Escape a Large Maze","titleSlug":"escape-a-large-maze"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1037,"title":"Valid Boomerang","titleSlug":"valid-boomerang"}
+{"chalengeQuestionDates":["2024-06-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1038,"title":"Binary Search Tree to Greater Sum Tree","titleSlug":"binary-search-tree-to-greater-sum-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1039,"title":"Minimum Score Triangulation of Polygon","titleSlug":"minimum-score-triangulation-of-polygon"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1040,"title":"Moving Stones Until Consecutive II","titleSlug":"moving-stones-until-consecutive-ii"}
+{"chalengeQuestionDates":["2022-01-09","2020-09-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1041,"title":"Robot Bounded In Circle","titleSlug":"robot-bounded-in-circle"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1042,"title":"Flower Planting With No Adjacent","titleSlug":"flower-planting-with-no-adjacent"}
+{"chalengeQuestionDates":["2024-02-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1043,"title":"Partition Array for Maximum Sum","titleSlug":"partition-array-for-maximum-sum"}
+{"chalengeQuestionDates":["2021-10-30","2020-06-19"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1044,"title":"Longest Duplicate Substring","titleSlug":"longest-duplicate-substring"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1045,"title":"Customers Who Bought All Products","titleSlug":"customers-who-bought-all-products"}
+{"chalengeQuestionDates":["2023-04-24","2022-04-07","2020-04-12"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1046,"title":"Last Stone Weight","titleSlug":"last-stone-weight"}
+{"chalengeQuestionDates":["2022-11-10","2021-06-28"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1047,"title":"Remove All Adjacent Duplicates In String","titleSlug":"remove-all-adjacent-duplicates-in-string"}
+{"chalengeQuestionDates":["2023-09-23","2022-06-15","2021-05-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1048,"title":"Longest String Chain","titleSlug":"longest-string-chain"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1049,"title":"Last Stone Weight II","titleSlug":"last-stone-weight-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1050,"title":"Actors and Directors Who Cooperated At Least Three Times","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"}
+{"chalengeQuestionDates":["2024-06-10"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1051,"title":"Height Checker","titleSlug":"height-checker"}
+{"chalengeQuestionDates":["2024-06-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1052,"title":"Grumpy Bookstore Owner","titleSlug":"grumpy-bookstore-owner"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1053,"title":"Previous Permutation With One Swap","titleSlug":"previous-permutation-with-one-swap"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1054,"title":"Distant Barcodes","titleSlug":"distant-barcodes"}
+{"chalengeQuestionDates":["2023-03-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1055,"title":"Shortest Way to Form String","titleSlug":"shortest-way-to-form-string"}
+{"chalengeQuestionDates":["2023-01-01"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1056,"title":"Confusing Number","titleSlug":"confusing-number"}
+{"chalengeQuestionDates":["2023-11-01","2022-03-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1057,"title":"Campus Bikes","titleSlug":"campus-bikes"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1058,"title":"Minimize Rounding Error to Meet Target","titleSlug":"minimize-rounding-error-to-meet-target"}
+{"chalengeQuestionDates":["2022-07-22","2021-06-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1059,"title":"All Paths from Source Lead to Destination","titleSlug":"all-paths-from-source-lead-to-destination"}
+{"chalengeQuestionDates":["2023-07-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1060,"title":"Missing Element in Sorted Array","titleSlug":"missing-element-in-sorted-array"}
+{"chalengeQuestionDates":["2023-01-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1061,"title":"Lexicographically Smallest Equivalent String","titleSlug":"lexicographically-smallest-equivalent-string"}
+{"chalengeQuestionDates":["2024-08-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1062,"title":"Longest Repeating Substring","titleSlug":"longest-repeating-substring"}
+{"chalengeQuestionDates":["2023-09-22"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1063,"title":"Number of Valid Subarrays","titleSlug":"number-of-valid-subarrays"}
+{"chalengeQuestionDates":["2022-02-22"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1064,"title":"Fixed Point","titleSlug":"fixed-point"}
+{"chalengeQuestionDates":["2023-05-01"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1065,"title":"Index Pairs of a String","titleSlug":"index-pairs-of-a-string"}
+{"chalengeQuestionDates":["2024-01-01","2022-12-15","2021-10-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1066,"title":"Campus Bikes II","titleSlug":"campus-bikes-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1067,"title":"Digit Count in Range","titleSlug":"digit-count-in-range"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1068,"title":"Product Sales Analysis I","titleSlug":"product-sales-analysis-i"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1069,"title":"Product Sales Analysis II","titleSlug":"product-sales-analysis-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1070,"title":"Product Sales Analysis III","titleSlug":"product-sales-analysis-iii"}
+{"chalengeQuestionDates":["2023-02-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1071,"title":"Greatest Common Divisor of Strings","titleSlug":"greatest-common-divisor-of-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1072,"title":"Flip Columns For Maximum Number of Equal Rows","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1073,"title":"Adding Two Negabinary Numbers","titleSlug":"adding-two-negabinary-numbers"}
+{"chalengeQuestionDates":["2024-01-28","2022-07-18","2021-04-17"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1074,"title":"Number of Submatrices That Sum to Target","titleSlug":"number-of-submatrices-that-sum-to-target"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1075,"title":"Project Employees I","titleSlug":"project-employees-i"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1076,"title":"Project Employees II","titleSlug":"project-employees-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1077,"title":"Project Employees III","titleSlug":"project-employees-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1078,"title":"Occurrences After Bigram","titleSlug":"occurrences-after-bigram"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1079,"title":"Letter Tile Possibilities","titleSlug":"letter-tile-possibilities"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1080,"title":"Insufficient Nodes in Root to Leaf Paths","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1081,"title":"Smallest Subsequence of Distinct Characters","titleSlug":"smallest-subsequence-of-distinct-characters"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1082,"title":"Sales Analysis I","titleSlug":"sales-analysis-i"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1083,"title":"Sales Analysis II","titleSlug":"sales-analysis-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1084,"title":"Sales Analysis III","titleSlug":"sales-analysis-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1085,"title":"Sum of Digits in the Minimum Number","titleSlug":"sum-of-digits-in-the-minimum-number"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1086,"title":"High Five","titleSlug":"high-five"}
+{"chalengeQuestionDates":["2022-04-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1087,"title":"Brace Expansion","titleSlug":"brace-expansion"}
+{"chalengeQuestionDates":["2023-01-22"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1088,"title":"Confusing Number II","titleSlug":"confusing-number-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1089,"title":"Duplicate Zeros","titleSlug":"duplicate-zeros"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1090,"title":"Largest Values From Labels","titleSlug":"largest-values-from-labels"}
+{"chalengeQuestionDates":["2023-06-01","2022-05-16","2021-02-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1091,"title":"Shortest Path in Binary Matrix","titleSlug":"shortest-path-in-binary-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1092,"title":"Shortest Common Supersequence","titleSlug":"shortest-common-supersequence"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1093,"title":"Statistics from a Large Sample","titleSlug":"statistics-from-a-large-sample"}
+{"chalengeQuestionDates":["2022-01-06","2020-09-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1094,"title":"Car Pooling","titleSlug":"car-pooling"}
+{"chalengeQuestionDates":["2023-10-12"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1095,"title":"Find in Mountain Array","titleSlug":"find-in-mountain-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1096,"title":"Brace Expansion II","titleSlug":"brace-expansion-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1097,"title":"Game Play Analysis V","titleSlug":"game-play-analysis-v"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1098,"title":"Unpopular Books","titleSlug":"unpopular-books"}
+{"chalengeQuestionDates":["2023-12-01","2022-11-15","2020-11-08"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1099,"title":"Two Sum Less Than K","titleSlug":"two-sum-less-than-k"}
+{"chalengeQuestionDates":["2022-02-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1100,"title":"Find K-Length Substrings With No Repeated Characters","titleSlug":"find-k-length-substrings-with-no-repeated-characters"}
+{"chalengeQuestionDates":["2024-07-01","2022-02-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1101,"title":"The Earliest Moment When Everyone Become Friends","titleSlug":"the-earliest-moment-when-everyone-become-friends"}
+{"chalengeQuestionDates":["2022-03-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1102,"title":"Path With Maximum Minimum Value","titleSlug":"path-with-maximum-minimum-value"}
+{"chalengeQuestionDates":["2020-08-17"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1103,"title":"Distribute Candies to People","titleSlug":"distribute-candies-to-people"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1104,"title":"Path In Zigzag Labelled Binary Tree","titleSlug":"path-in-zigzag-labelled-binary-tree"}
+{"chalengeQuestionDates":["2024-07-31"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1105,"title":"Filling Bookcase Shelves","titleSlug":"filling-bookcase-shelves"}
+{"chalengeQuestionDates":["2024-10-20"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1106,"title":"Parsing A Boolean Expression","titleSlug":"parsing-a-boolean-expression"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1107,"title":"New Users Daily Count","titleSlug":"new-users-daily-count"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1108,"title":"Defanging an IP Address","titleSlug":"defanging-an-ip-address"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1109,"title":"Corporate Flight Bookings","titleSlug":"corporate-flight-bookings"}
+{"chalengeQuestionDates":["2024-07-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1110,"title":"Delete Nodes And Return Forest","titleSlug":"delete-nodes-and-return-forest"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1111,"title":"Maximum Nesting Depth of Two Valid Parentheses Strings","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1112,"title":"Highest Grade For Each Student","titleSlug":"highest-grade-for-each-student"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1113,"title":"Reported Posts","titleSlug":"reported-posts"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1114,"title":"Print in Order","titleSlug":"print-in-order"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1115,"title":"Print FooBar Alternately","titleSlug":"print-foobar-alternately"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1116,"title":"Print Zero Even Odd","titleSlug":"print-zero-even-odd"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1117,"title":"Building H2O","titleSlug":"building-h2o"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1118,"title":"Number of Days in a Month","titleSlug":"number-of-days-in-a-month"}
+{"chalengeQuestionDates":["2024-03-22"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1119,"title":"Remove Vowels from a String","titleSlug":"remove-vowels-from-a-string"}
+{"chalengeQuestionDates":["2023-12-08","2021-09-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1120,"title":"Maximum Average Subtree","titleSlug":"maximum-average-subtree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1121,"title":"Divide Array Into Increasing Sequences","titleSlug":"divide-array-into-increasing-sequences"}
+{"chalengeQuestionDates":["2024-06-11"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1122,"title":"Relative Sort Array","titleSlug":"relative-sort-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1123,"title":"Lowest Common Ancestor of Deepest Leaves","titleSlug":"lowest-common-ancestor-of-deepest-leaves"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1124,"title":"Longest Well-Performing Interval","titleSlug":"longest-well-performing-interval"}
+{"chalengeQuestionDates":["2023-07-16"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1125,"title":"Smallest Sufficient Team","titleSlug":"smallest-sufficient-team"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1126,"title":"Active Businesses","titleSlug":"active-businesses"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1127,"title":"User Purchase Platform","titleSlug":"user-purchase-platform"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1128,"title":"Number of Equivalent Domino Pairs","titleSlug":"number-of-equivalent-domino-pairs"}
+{"chalengeQuestionDates":["2023-02-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1129,"title":"Shortest Path with Alternating Colors","titleSlug":"shortest-path-with-alternating-colors"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1130,"title":"Minimum Cost Tree From Leaf Values","titleSlug":"minimum-cost-tree-from-leaf-values"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1131,"title":"Maximum of Absolute Value Expression","titleSlug":"maximum-of-absolute-value-expression"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1132,"title":"Reported Posts II","titleSlug":"reported-posts-ii"}
+{"chalengeQuestionDates":["2024-10-01","2021-04-01"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1133,"title":"Largest Unique Number","titleSlug":"largest-unique-number"}
+{"chalengeQuestionDates":["2021-06-29"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1134,"title":"Armstrong Number","titleSlug":"armstrong-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1135,"title":"Connecting Cities With Minimum Cost","titleSlug":"connecting-cities-with-minimum-cost"}
+{"chalengeQuestionDates":["2023-09-15","2022-05-29","2021-03-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1136,"title":"Parallel Courses","titleSlug":"parallel-courses"}
+{"chalengeQuestionDates":["2024-04-24","2023-01-30","2021-09-24"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1137,"title":"N-th Tribonacci Number","titleSlug":"n-th-tribonacci-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1138,"title":"Alphabet Board Path","titleSlug":"alphabet-board-path"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1139,"title":"Largest 1-Bordered Square","titleSlug":"largest-1-bordered-square"}
+{"chalengeQuestionDates":["2024-08-20","2023-05-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1140,"title":"Stone Game II","titleSlug":"stone-game-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1141,"title":"User Activity for the Past 30 Days I","titleSlug":"user-activity-for-the-past-30-days-i"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1142,"title":"User Activity for the Past 30 Days II","titleSlug":"user-activity-for-the-past-30-days-ii"}
+{"chalengeQuestionDates":["2024-01-25","2022-12-15","2021-10-01","2020-04-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1143,"title":"Longest Common Subsequence","titleSlug":"longest-common-subsequence"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1144,"title":"Decrease Elements To Make Array Zigzag","titleSlug":"decrease-elements-to-make-array-zigzag"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1145,"title":"Binary Tree Coloring Game","titleSlug":"binary-tree-coloring-game"}
+{"chalengeQuestionDates":["2023-06-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1146,"title":"Snapshot Array","titleSlug":"snapshot-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1147,"title":"Longest Chunked Palindrome Decomposition","titleSlug":"longest-chunked-palindrome-decomposition"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1148,"title":"Article Views I","titleSlug":"article-views-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1149,"title":"Article Views II","titleSlug":"article-views-ii"}
+{"chalengeQuestionDates":["2023-06-08"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1150,"title":"Check If a Number Is Majority Element in a Sorted Array","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"}
+{"chalengeQuestionDates":["2022-06-08","2021-04-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1151,"title":"Minimum Swaps to Group All 1's Together","titleSlug":"minimum-swaps-to-group-all-1s-together"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1152,"title":"Analyze User Website Visit Pattern","titleSlug":"analyze-user-website-visit-pattern"}
+{"chalengeQuestionDates":["2021-12-22"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1153,"title":"String Transforms Into Another String","titleSlug":"string-transforms-into-another-string"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1154,"title":"Day of the Year","titleSlug":"day-of-the-year"}
+{"chalengeQuestionDates":["2023-12-26","2022-10-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1155,"title":"Number of Dice Rolls With Target Sum","titleSlug":"number-of-dice-rolls-with-target-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1156,"title":"Swap For Longest Repeated Character Substring","titleSlug":"swap-for-longest-repeated-character-substring"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1157,"title":"Online Majority Element In Subarray","titleSlug":"online-majority-element-in-subarray"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1158,"title":"Market Analysis I","titleSlug":"market-analysis-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1159,"title":"Market Analysis II","titleSlug":"market-analysis-ii"}
+{"chalengeQuestionDates":["2023-12-02"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1160,"title":"Find Words That Can Be Formed by Characters","titleSlug":"find-words-that-can-be-formed-by-characters"}
+{"chalengeQuestionDates":["2023-06-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1161,"title":"Maximum Level Sum of a Binary Tree","titleSlug":"maximum-level-sum-of-a-binary-tree"}
+{"chalengeQuestionDates":["2023-02-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1162,"title":"As Far from Land as Possible","titleSlug":"as-far-from-land-as-possible"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1163,"title":"Last Substring in Lexicographical Order","titleSlug":"last-substring-in-lexicographical-order"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1164,"title":"Product Price at a Given Date","titleSlug":"product-price-at-a-given-date"}
+{"chalengeQuestionDates":["2024-01-15","2022-12-01","2021-03-01"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1165,"title":"Single-Row Keyboard","titleSlug":"single-row-keyboard"}
+{"chalengeQuestionDates":["2022-04-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1166,"title":"Design File System","titleSlug":"design-file-system"}
+{"chalengeQuestionDates":["2024-01-22","2022-12-22","2021-05-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1167,"title":"Minimum Cost to Connect Sticks","titleSlug":"minimum-cost-to-connect-sticks"}
+{"chalengeQuestionDates":["2021-08-01"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1168,"title":"Optimize Water Distribution in a Village","titleSlug":"optimize-water-distribution-in-a-village"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1169,"title":"Invalid Transactions","titleSlug":"invalid-transactions"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1170,"title":"Compare Strings by Frequency of the Smallest Character","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"}
+{"chalengeQuestionDates":["2024-03-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1171,"title":"Remove Zero Sum Consecutive Nodes from Linked List","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1172,"title":"Dinner Plate Stacks","titleSlug":"dinner-plate-stacks"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1173,"title":"Immediate Food Delivery I","titleSlug":"immediate-food-delivery-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1174,"title":"Immediate Food Delivery II","titleSlug":"immediate-food-delivery-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1175,"title":"Prime Arrangements","titleSlug":"prime-arrangements"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1176,"title":"Diet Plan Performance","titleSlug":"diet-plan-performance"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1177,"title":"Can Make Palindrome from Substring","titleSlug":"can-make-palindrome-from-substring"}
+{"chalengeQuestionDates":["2021-11-09"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1178,"title":"Number of Valid Words for Each Puzzle","titleSlug":"number-of-valid-words-for-each-puzzle"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1179,"title":"Reformat Department Table","titleSlug":"reformat-department-table"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1180,"title":"Count Substrings with Only One Distinct Letter","titleSlug":"count-substrings-with-only-one-distinct-letter"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1181,"title":"Before and After Puzzle","titleSlug":"before-and-after-puzzle"}
+{"chalengeQuestionDates":["2022-07-15","2021-06-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1182,"title":"Shortest Distance to Target Color","titleSlug":"shortest-distance-to-target-color"}
+{"chalengeQuestionDates":["2023-08-29"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1183,"title":"Maximum Number of Ones","titleSlug":"maximum-number-of-ones"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1184,"title":"Distance Between Bus Stops","titleSlug":"distance-between-bus-stops"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1185,"title":"Day of the Week","titleSlug":"day-of-the-week"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1186,"title":"Maximum Subarray Sum with One Deletion","titleSlug":"maximum-subarray-sum-with-one-deletion"}
+{"chalengeQuestionDates":["2023-06-17"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1187,"title":"Make Array Strictly Increasing","titleSlug":"make-array-strictly-increasing"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1188,"title":"Design Bounded Blocking Queue","titleSlug":"design-bounded-blocking-queue"}
+{"chalengeQuestionDates":["2021-09-13"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1189,"title":"Maximum Number of Balloons","titleSlug":"maximum-number-of-balloons"}
+{"chalengeQuestionDates":["2024-07-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1190,"title":"Reverse Substrings Between Each Pair of Parentheses","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1191,"title":"K-Concatenation Maximum Sum","titleSlug":"k-concatenation-maximum-sum"}
+{"chalengeQuestionDates":["2022-05-18","2021-04-24"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1192,"title":"Critical Connections in a Network","titleSlug":"critical-connections-in-a-network"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1193,"title":"Monthly Transactions I","titleSlug":"monthly-transactions-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1194,"title":"Tournament Winners","titleSlug":"tournament-winners"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1195,"title":"Fizz Buzz Multithreaded","titleSlug":"fizz-buzz-multithreaded"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1196,"title":"How Many Apples Can You Put into the Basket","titleSlug":"how-many-apples-can-you-put-into-the-basket"}
+{"chalengeQuestionDates":["2023-10-29","2022-06-01","2021-05-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1197,"title":"Minimum Knight Moves","titleSlug":"minimum-knight-moves"}
+{"chalengeQuestionDates":["2022-11-01","2021-03-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1198,"title":"Find Smallest Common Element in All Rows","titleSlug":"find-smallest-common-element-in-all-rows"}
+{"chalengeQuestionDates":["2023-09-01"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1199,"title":"Minimum Time to Build Blocks","titleSlug":"minimum-time-to-build-blocks"}
+{"chalengeQuestionDates":["2021-12-20"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1200,"title":"Minimum Absolute Difference","titleSlug":"minimum-absolute-difference"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1201,"title":"Ugly Number III","titleSlug":"ugly-number-iii"}
+{"chalengeQuestionDates":["2022-04-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1202,"title":"Smallest String With Swaps","titleSlug":"smallest-string-with-swaps"}
+{"chalengeQuestionDates":["2023-08-20"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1203,"title":"Sort Items by Groups Respecting Dependencies","titleSlug":"sort-items-by-groups-respecting-dependencies"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1204,"title":"Last Person to Fit in the Bus","titleSlug":"last-person-to-fit-in-the-bus"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1205,"title":"Monthly Transactions II","titleSlug":"monthly-transactions-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1206,"title":"Design Skiplist","titleSlug":"design-skiplist"}
+{"chalengeQuestionDates":["2024-01-17","2022-11-30"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1207,"title":"Unique Number of Occurrences","titleSlug":"unique-number-of-occurrences"}
+{"chalengeQuestionDates":["2024-05-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1208,"title":"Get Equal Substrings Within Budget","titleSlug":"get-equal-substrings-within-budget"}
+{"chalengeQuestionDates":["2022-05-06","2021-04-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1209,"title":"Remove All Adjacent Duplicates in String II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1210,"title":"Minimum Moves to Reach Target with Rotations","titleSlug":"minimum-moves-to-reach-target-with-rotations"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1211,"title":"Queries Quality and Percentage","titleSlug":"queries-quality-and-percentage"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1212,"title":"Team Scores in Football Tournament","titleSlug":"team-scores-in-football-tournament"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1213,"title":"Intersection of Three Sorted Arrays","titleSlug":"intersection-of-three-sorted-arrays"}
+{"chalengeQuestionDates":["2023-06-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1214,"title":"Two Sum BSTs","titleSlug":"two-sum-bsts"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1215,"title":"Stepping Numbers","titleSlug":"stepping-numbers"}
+{"chalengeQuestionDates":["2023-12-29","2022-11-29","2021-10-08"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1216,"title":"Valid Palindrome III","titleSlug":"valid-palindrome-iii"}
+{"chalengeQuestionDates":["2021-12-06","2020-11-05"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1217,"title":"Minimum Cost to Move Chips to The Same Position","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"}
+{"chalengeQuestionDates":["2023-07-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1218,"title":"Longest Arithmetic Subsequence of Given Difference","titleSlug":"longest-arithmetic-subsequence-of-given-difference"}
+{"chalengeQuestionDates":["2024-05-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1219,"title":"Path with Maximum Gold","titleSlug":"path-with-maximum-gold"}
+{"chalengeQuestionDates":["2023-10-28","2022-08-07","2021-07-04"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1220,"title":"Count Vowels Permutation","titleSlug":"count-vowels-permutation"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1221,"title":"Split a String in Balanced Strings","titleSlug":"split-a-string-in-balanced-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1222,"title":"Queens That Can Attack the King","titleSlug":"queens-that-can-attack-the-king"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1223,"title":"Dice Roll Simulation","titleSlug":"dice-roll-simulation"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1224,"title":"Maximum Equal Frequency","titleSlug":"maximum-equal-frequency"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1225,"title":"Report Contiguous Dates","titleSlug":"report-contiguous-dates"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1226,"title":"The Dining Philosophers","titleSlug":"the-dining-philosophers"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1227,"title":"Airplane Seat Assignment Probability","titleSlug":"airplane-seat-assignment-probability"}
+{"chalengeQuestionDates":["2021-04-22"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1228,"title":"Missing Number In Arithmetic Progression","titleSlug":"missing-number-in-arithmetic-progression"}
+{"chalengeQuestionDates":["2024-09-08","2022-06-22","2021-04-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1229,"title":"Meeting Scheduler","titleSlug":"meeting-scheduler"}
+{"chalengeQuestionDates":["2024-07-29","2023-06-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1230,"title":"Toss Strange Coins","titleSlug":"toss-strange-coins"}
+{"chalengeQuestionDates":["2021-11-01"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1231,"title":"Divide Chocolate","titleSlug":"divide-chocolate"}
+{"chalengeQuestionDates":["2023-06-05","2020-05-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1232,"title":"Check If It Is a Straight Line","titleSlug":"check-if-it-is-a-straight-line"}
+{"chalengeQuestionDates":["2024-10-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1233,"title":"Remove Sub-Folders from the Filesystem","titleSlug":"remove-sub-folders-from-the-filesystem"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1234,"title":"Replace the Substring for Balanced String","titleSlug":"replace-the-substring-for-balanced-string"}
+{"chalengeQuestionDates":["2024-01-06","2022-11-26","2021-08-28"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1235,"title":"Maximum Profit in Job Scheduling","titleSlug":"maximum-profit-in-job-scheduling"}
+{"chalengeQuestionDates":["2023-03-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1236,"title":"Web Crawler","titleSlug":"web-crawler"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1237,"title":"Find Positive Integer Solution for a Given Equation","titleSlug":"find-positive-integer-solution-for-a-given-equation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1238,"title":"Circular Permutation in Binary Representation","titleSlug":"circular-permutation-in-binary-representation"}
+{"chalengeQuestionDates":["2024-01-23","2022-10-24","2021-09-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1239,"title":"Maximum Length of a Concatenated String with Unique Characters","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1240,"title":"Tiling a Rectangle with the Fewest Squares","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1241,"title":"Number of Comments per Post","titleSlug":"number-of-comments-per-post"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1242,"title":"Web Crawler Multithreaded","titleSlug":"web-crawler-multithreaded"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1243,"title":"Array Transformation","titleSlug":"array-transformation"}
+{"chalengeQuestionDates":["2021-12-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1244,"title":"Design A Leaderboard","titleSlug":"design-a-leaderboard"}
+{"chalengeQuestionDates":["2024-02-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1245,"title":"Tree Diameter","titleSlug":"tree-diameter"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1246,"title":"Palindrome Removal","titleSlug":"palindrome-removal"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1247,"title":"Minimum Swaps to Make Strings Equal","titleSlug":"minimum-swaps-to-make-strings-equal"}
+{"chalengeQuestionDates":["2024-06-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1248,"title":"Count Number of Nice Subarrays","titleSlug":"count-number-of-nice-subarrays"}
+{"chalengeQuestionDates":["2024-04-06","2022-03-15","2021-02-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1249,"title":"Minimum Remove to Make Valid Parentheses","titleSlug":"minimum-remove-to-make-valid-parentheses"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1250,"title":"Check If It Is a Good Array","titleSlug":"check-if-it-is-a-good-array"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1251,"title":"Average Selling Price","titleSlug":"average-selling-price"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1252,"title":"Cells with Odd Values in a Matrix","titleSlug":"cells-with-odd-values-in-a-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1253,"title":"Reconstruct a 2-Row Binary Matrix","titleSlug":"reconstruct-a-2-row-binary-matrix"}
+{"chalengeQuestionDates":["2023-04-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1254,"title":"Number of Closed Islands","titleSlug":"number-of-closed-islands"}
+{"chalengeQuestionDates":["2024-05-24"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1255,"title":"Maximum Score Words Formed by Letters","titleSlug":"maximum-score-words-formed-by-letters"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1256,"title":"Encode Number","titleSlug":"encode-number"}
+{"chalengeQuestionDates":["2024-09-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1257,"title":"Smallest Common Region","titleSlug":"smallest-common-region"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1258,"title":"Synonymous Sentences","titleSlug":"synonymous-sentences"}
+{"chalengeQuestionDates":["2023-02-22"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1259,"title":"Handshakes That Don't Cross","titleSlug":"handshakes-that-dont-cross"}
+{"chalengeQuestionDates":["2022-04-11"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1260,"title":"Shift 2D Grid","titleSlug":"shift-2d-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1261,"title":"Find Elements in a Contaminated Binary Tree","titleSlug":"find-elements-in-a-contaminated-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1262,"title":"Greatest Sum Divisible by Three","titleSlug":"greatest-sum-divisible-by-three"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1263,"title":"Minimum Moves to Move a Box to Their Target Location","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1264,"title":"Page Recommendations","titleSlug":"page-recommendations"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1265,"title":"Print Immutable Linked List in Reverse","titleSlug":"print-immutable-linked-list-in-reverse"}
+{"chalengeQuestionDates":["2023-12-03"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1266,"title":"Minimum Time Visiting All Points","titleSlug":"minimum-time-visiting-all-points"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1267,"title":"Count Servers that Communicate","titleSlug":"count-servers-that-communicate"}
+{"chalengeQuestionDates":["2022-06-19","2021-05-31"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1268,"title":"Search Suggestions System","titleSlug":"search-suggestions-system"}
+{"chalengeQuestionDates":["2023-10-15"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1269,"title":"Number of Ways to Stay in the Same Place After Some Steps","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1270,"title":"All People Report to the Given Manager","titleSlug":"all-people-report-to-the-given-manager"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1271,"title":"Hexspeak","titleSlug":"hexspeak"}
+{"chalengeQuestionDates":["2024-02-15","2022-09-22","2020-11-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1272,"title":"Remove Interval","titleSlug":"remove-interval"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1273,"title":"Delete Tree Nodes","titleSlug":"delete-tree-nodes"}
+{"chalengeQuestionDates":["2022-02-08"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1274,"title":"Number of Ships in a Rectangle","titleSlug":"number-of-ships-in-a-rectangle"}
+{"chalengeQuestionDates":["2021-09-20"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1275,"title":"Find Winner on a Tic Tac Toe Game","titleSlug":"find-winner-on-a-tic-tac-toe-game"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1276,"title":"Number of Burgers with No Waste of Ingredients","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"}
+{"chalengeQuestionDates":["2024-10-27","2020-05-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1277,"title":"Count Square Submatrices with All Ones","titleSlug":"count-square-submatrices-with-all-ones"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1278,"title":"Palindrome Partitioning III","titleSlug":"palindrome-partitioning-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1279,"title":"Traffic Light Controlled Intersection","titleSlug":"traffic-light-controlled-intersection"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1280,"title":"Students and Examinations","titleSlug":"students-and-examinations"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1281,"title":"Subtract the Product and Sum of Digits of an Integer","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"}
+{"chalengeQuestionDates":["2023-09-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1282,"title":"Group the People Given the Group Size They Belong To","titleSlug":"group-the-people-given-the-group-size-they-belong-to"}
+{"chalengeQuestionDates":["2020-11-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1283,"title":"Find the Smallest Divisor Given a Threshold","titleSlug":"find-the-smallest-divisor-given-a-threshold"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1284,"title":"Minimum Number of Flips to Convert Binary Matrix to Zero Matrix","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1285,"title":"Find the Start and End Number of Continuous Ranges","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"}
+{"chalengeQuestionDates":["2021-11-14","2020-08-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1286,"title":"Iterator for Combination","titleSlug":"iterator-for-combination"}
+{"chalengeQuestionDates":["2023-12-11"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1287,"title":"Element Appearing More Than 25% In Sorted Array","titleSlug":"element-appearing-more-than-25-in-sorted-array"}
+{"chalengeQuestionDates":["2022-02-20","2020-10-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1288,"title":"Remove Covered Intervals","titleSlug":"remove-covered-intervals"}
+{"chalengeQuestionDates":["2024-04-26"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1289,"title":"Minimum Falling Path Sum II","titleSlug":"minimum-falling-path-sum-ii"}
+{"chalengeQuestionDates":["2021-12-07","2020-11-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1290,"title":"Convert Binary Number in a Linked List to Integer","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"}
+{"chalengeQuestionDates":["2024-02-02","2022-01-23","2020-09-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1291,"title":"Sequential Digits","titleSlug":"sequential-digits"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1292,"title":"Maximum Side Length of a Square with Sum Less than or Equal to Threshold","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"}
+{"chalengeQuestionDates":["2022-10-30","2021-09-25"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1293,"title":"Shortest Path in a Grid with Obstacles Elimination","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1294,"title":"Weather Type in Each Country","titleSlug":"weather-type-in-each-country"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1295,"title":"Find Numbers with Even Number of Digits","titleSlug":"find-numbers-with-even-number-of-digits"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1296,"title":"Divide Array in Sets of K Consecutive Numbers","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1297,"title":"Maximum Number of Occurrences of a Substring","titleSlug":"maximum-number-of-occurrences-of-a-substring"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1298,"title":"Maximum Candies You Can Get from Boxes","titleSlug":"maximum-candies-you-can-get-from-boxes"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1299,"title":"Replace Elements with Greatest Element on Right Side","titleSlug":"replace-elements-with-greatest-element-on-right-side"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1300,"title":"Sum of Mutated Array Closest to Target","titleSlug":"sum-of-mutated-array-closest-to-target"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1301,"title":"Number of Paths with Max Score","titleSlug":"number-of-paths-with-max-score"}
+{"chalengeQuestionDates":["2022-05-15","2021-04-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1302,"title":"Deepest Leaves Sum","titleSlug":"deepest-leaves-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1303,"title":"Find the Team Size","titleSlug":"find-the-team-size"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1304,"title":"Find N Unique Integers Sum up to Zero","titleSlug":"find-n-unique-integers-sum-up-to-zero"}
+{"chalengeQuestionDates":["2022-01-26","2020-09-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1305,"title":"All Elements in Two Binary Search Trees","titleSlug":"all-elements-in-two-binary-search-trees"}
+{"chalengeQuestionDates":["2021-12-09","2020-11-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1306,"title":"Jump Game III","titleSlug":"jump-game-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1307,"title":"Verbal Arithmetic Puzzle","titleSlug":"verbal-arithmetic-puzzle"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1308,"title":"Running Total for Different Genders","titleSlug":"running-total-for-different-genders"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1309,"title":"Decrypt String from Alphabet to Integer Mapping","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"}
+{"chalengeQuestionDates":["2024-09-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1310,"title":"XOR Queries of a Subarray","titleSlug":"xor-queries-of-a-subarray"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1311,"title":"Get Watched Videos by Your Friends","titleSlug":"get-watched-videos-by-your-friends"}
+{"chalengeQuestionDates":["2023-04-22"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1312,"title":"Minimum Insertion Steps to Make a String Palindrome","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1313,"title":"Decompress Run-Length Encoded List","titleSlug":"decompress-run-length-encoded-list"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1314,"title":"Matrix Block Sum","titleSlug":"matrix-block-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1315,"title":"Sum of Nodes with Even-Valued Grandparent","titleSlug":"sum-of-nodes-with-even-valued-grandparent"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1316,"title":"Distinct Echo Substrings","titleSlug":"distinct-echo-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1317,"title":"Convert Integer to the Sum of Two No-Zero Integers","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"}
+{"chalengeQuestionDates":["2023-06-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1318,"title":"Minimum Flips to Make a OR b Equal to c","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"}
+{"chalengeQuestionDates":["2023-03-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1319,"title":"Number of Operations to Make Network Connected","titleSlug":"number-of-operations-to-make-network-connected"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1320,"title":"Minimum Distance to Type a Word Using Two Fingers","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1321,"title":"Restaurant Growth","titleSlug":"restaurant-growth"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1322,"title":"Ads Performance","titleSlug":"ads-performance"}
+{"chalengeQuestionDates":["2022-11-07"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1323,"title":"Maximum 69 Number","titleSlug":"maximum-69-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1324,"title":"Print Words Vertically","titleSlug":"print-words-vertically"}
+{"chalengeQuestionDates":["2024-05-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1325,"title":"Delete Leaves With a Given Value","titleSlug":"delete-leaves-with-a-given-value"}
+{"chalengeQuestionDates":["2023-08-31"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1326,"title":"Minimum Number of Taps to Open to Water a Garden","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1327,"title":"List the Products Ordered in a Period","titleSlug":"list-the-products-ordered-in-a-period"}
+{"chalengeQuestionDates":["2022-10-10","2021-09-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1328,"title":"Break a Palindrome","titleSlug":"break-a-palindrome"}
+{"chalengeQuestionDates":["2022-08-28","2021-01-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1329,"title":"Sort the Matrix Diagonally","titleSlug":"sort-the-matrix-diagonally"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1330,"title":"Reverse Subarray To Maximize Array Value","titleSlug":"reverse-subarray-to-maximize-array-value"}
+{"chalengeQuestionDates":["2024-10-02"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1331,"title":"Rank Transform of an Array","titleSlug":"rank-transform-of-an-array"}
+{"chalengeQuestionDates":["2022-06-08","2021-03-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1332,"title":"Remove Palindromic Subsequences","titleSlug":"remove-palindromic-subsequences"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1333,"title":"Filter Restaurants by Vegan-Friendly, Price and Distance","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"}
+{"chalengeQuestionDates":["2024-07-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1334,"title":"Find the City With the Smallest Number of Neighbors at a Threshold Distance","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"}
+{"chalengeQuestionDates":["2023-12-29","2022-10-16"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1335,"title":"Minimum Difficulty of a Job Schedule","titleSlug":"minimum-difficulty-of-a-job-schedule"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1336,"title":"Number of Transactions per Visit","titleSlug":"number-of-transactions-per-visit"}
+{"chalengeQuestionDates":["2023-09-18","2022-03-27","2021-02-15"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1337,"title":"The K Weakest Rows in a Matrix","titleSlug":"the-k-weakest-rows-in-a-matrix"}
+{"chalengeQuestionDates":["2022-08-18","2021-07-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1338,"title":"Reduce Array Size to The Half","titleSlug":"reduce-array-size-to-the-half"}
+{"chalengeQuestionDates":["2022-12-10","2021-08-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1339,"title":"Maximum Product of Splitted Binary Tree","titleSlug":"maximum-product-of-splitted-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1340,"title":"Jump Game V","titleSlug":"jump-game-v"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1341,"title":"Movie Rating","titleSlug":"movie-rating"}
+{"chalengeQuestionDates":["2022-05-27","2021-02-12"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1342,"title":"Number of Steps to Reduce a Number to Zero","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1343,"title":"Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"}
+{"chalengeQuestionDates":["2020-07-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1344,"title":"Angle Between Hands of a Clock","titleSlug":"angle-between-hands-of-a-clock"}
+{"chalengeQuestionDates":["2023-03-05","2022-01-15","2020-12-27"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1345,"title":"Jump Game IV","titleSlug":"jump-game-iv"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1346,"title":"Check If N and Its Double Exist","titleSlug":"check-if-n-and-its-double-exist"}
+{"chalengeQuestionDates":["2024-01-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1347,"title":"Minimum Number of Steps to Make Two Strings Anagram","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1348,"title":"Tweet Counts Per Frequency","titleSlug":"tweet-counts-per-frequency"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1349,"title":"Maximum Students Taking Exam","titleSlug":"maximum-students-taking-exam"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1350,"title":"Students With Invalid Departments","titleSlug":"students-with-invalid-departments"}
+{"chalengeQuestionDates":["2023-06-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1351,"title":"Count Negative Numbers in a Sorted Matrix","titleSlug":"count-negative-numbers-in-a-sorted-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1352,"title":"Product of the Last K Numbers","titleSlug":"product-of-the-last-k-numbers"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1353,"title":"Maximum Number of Events That Can Be Attended","titleSlug":"maximum-number-of-events-that-can-be-attended"}
+{"chalengeQuestionDates":["2022-06-24","2021-05-09"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1354,"title":"Construct Target Array With Multiple Sums","titleSlug":"construct-target-array-with-multiple-sums"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1355,"title":"Activity Participants","titleSlug":"activity-participants"}
+{"chalengeQuestionDates":["2023-10-30"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1356,"title":"Sort Integers by The Number of 1 Bits","titleSlug":"sort-integers-by-the-number-of-1-bits"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1357,"title":"Apply Discount Every n Orders","titleSlug":"apply-discount-every-n-orders"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1358,"title":"Number of Substrings Containing All Three Characters","titleSlug":"number-of-substrings-containing-all-three-characters"}
+{"chalengeQuestionDates":["2023-09-10","2022-03-06"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1359,"title":"Count All Valid Pickup and Delivery Options","titleSlug":"count-all-valid-pickup-and-delivery-options"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1360,"title":"Number of Days Between Two Dates","titleSlug":"number-of-days-between-two-dates"}
+{"chalengeQuestionDates":["2023-10-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1361,"title":"Validate Binary Tree Nodes","titleSlug":"validate-binary-tree-nodes"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1362,"title":"Closest Divisors","titleSlug":"closest-divisors"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1363,"title":"Largest Multiple of Three","titleSlug":"largest-multiple-of-three"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1364,"title":"Number of Trusted Contacts of a Customer","titleSlug":"number-of-trusted-contacts-of-a-customer"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1365,"title":"How Many Numbers Are Smaller Than the Current Number","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1366,"title":"Rank Teams by Votes","titleSlug":"rank-teams-by-votes"}
+{"chalengeQuestionDates":["2024-09-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1367,"title":"Linked List in Binary Tree","titleSlug":"linked-list-in-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1368,"title":"Minimum Cost to Make at Least One Valid Path in a Grid","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1369,"title":"Get the Second Most Recent Activity","titleSlug":"get-the-second-most-recent-activity"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1370,"title":"Increasing Decreasing String","titleSlug":"increasing-decreasing-string"}
+{"chalengeQuestionDates":["2024-09-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1371,"title":"Find the Longest Substring Containing Vowels in Even Counts","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"}
+{"chalengeQuestionDates":["2023-04-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1372,"title":"Longest ZigZag Path in a Binary Tree","titleSlug":"longest-zigzag-path-in-a-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1373,"title":"Maximum Sum BST in Binary Tree","titleSlug":"maximum-sum-bst-in-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1374,"title":"Generate a String With Characters That Have Odd Counts","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1375,"title":"Number of Times Binary String Is Prefix-Aligned","titleSlug":"number-of-times-binary-string-is-prefix-aligned"}
+{"chalengeQuestionDates":["2023-06-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1376,"title":"Time Needed to Inform All Employees","titleSlug":"time-needed-to-inform-all-employees"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1377,"title":"Frog Position After T Seconds","titleSlug":"frog-position-after-t-seconds"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1378,"title":"Replace Employee ID With The Unique Identifier","titleSlug":"replace-employee-id-with-the-unique-identifier"}
+{"chalengeQuestionDates":["2022-05-17","2021-01-02"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1379,"title":"Find a Corresponding Node of a Binary Tree in a Clone of That Tree","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"}
+{"chalengeQuestionDates":["2024-07-19"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1380,"title":"Lucky Numbers in a Matrix","titleSlug":"lucky-numbers-in-a-matrix"}
+{"chalengeQuestionDates":["2024-09-30"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1381,"title":"Design a Stack With Increment Operation","titleSlug":"design-a-stack-with-increment-operation"}
+{"chalengeQuestionDates":["2024-06-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1382,"title":"Balance a Binary Search Tree","titleSlug":"balance-a-binary-search-tree"}
+{"chalengeQuestionDates":["2022-09-11","2021-06-05"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1383,"title":"Maximum Performance of a Team","titleSlug":"maximum-performance-of-a-team"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1384,"title":"Total Sales Amount by Year","titleSlug":"total-sales-amount-by-year"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1385,"title":"Find the Distance Value Between Two Arrays","titleSlug":"find-the-distance-value-between-two-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1386,"title":"Cinema Seat Allocation","titleSlug":"cinema-seat-allocation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1387,"title":"Sort Integers by The Power Value","titleSlug":"sort-integers-by-the-power-value"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1388,"title":"Pizza With 3n Slices","titleSlug":"pizza-with-3n-slices"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1389,"title":"Create Target Array in the Given Order","titleSlug":"create-target-array-in-the-given-order"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1390,"title":"Four Divisors","titleSlug":"four-divisors"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1391,"title":"Check if There is a Valid Path in a Grid","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1392,"title":"Longest Happy Prefix","titleSlug":"longest-happy-prefix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1393,"title":"Capital Gain/Loss","titleSlug":"capital-gainloss"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1394,"title":"Find Lucky Integer in an Array","titleSlug":"find-lucky-integer-in-an-array"}
+{"chalengeQuestionDates":["2024-07-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1395,"title":"Count Number of Teams","titleSlug":"count-number-of-teams"}
+{"chalengeQuestionDates":["2023-05-31","2022-04-24","2021-03-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1396,"title":"Design Underground System","titleSlug":"design-underground-system"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1397,"title":"Find All Good Strings","titleSlug":"find-all-good-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1398,"title":"Customers Who Bought Products A and B but Not C","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1399,"title":"Count Largest Group","titleSlug":"count-largest-group"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1400,"title":"Construct K Palindrome Strings","titleSlug":"construct-k-palindrome-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1401,"title":"Circle and Rectangle Overlapping","titleSlug":"circle-and-rectangle-overlapping"}
+{"chalengeQuestionDates":["2023-03-29"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1402,"title":"Reducing Dishes","titleSlug":"reducing-dishes"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1403,"title":"Minimum Subsequence in Non-Increasing Order","titleSlug":"minimum-subsequence-in-non-increasing-order"}
+{"chalengeQuestionDates":["2024-05-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1404,"title":"Number of Steps to Reduce a Number in Binary Representation to One","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"}
+{"chalengeQuestionDates":["2024-10-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1405,"title":"Longest Happy String","titleSlug":"longest-happy-string"}
+{"chalengeQuestionDates":["2023-05-27"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1406,"title":"Stone Game III","titleSlug":"stone-game-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1407,"title":"Top Travellers","titleSlug":"top-travellers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1408,"title":"String Matching in an Array","titleSlug":"string-matching-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1409,"title":"Queries on a Permutation With Key","titleSlug":"queries-on-a-permutation-with-key"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1410,"title":"HTML Entity Parser","titleSlug":"html-entity-parser"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1411,"title":"Number of Ways to Paint N × 3 Grid","titleSlug":"number-of-ways-to-paint-n-3-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1412,"title":"Find the Quiet Students in All Exams","titleSlug":"find-the-quiet-students-in-all-exams"}
+{"chalengeQuestionDates":["2021-11-11"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1413,"title":"Minimum Value to Get Positive Step by Step Sum","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1414,"title":"Find the Minimum Number of Fibonacci Numbers Whose Sum Is K","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1415,"title":"The k-th Lexicographical String of All Happy Strings of Length n","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"}
+{"chalengeQuestionDates":["2023-04-23"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1416,"title":"Restore The Array","titleSlug":"restore-the-array"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1417,"title":"Reformat The String","titleSlug":"reformat-the-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1418,"title":"Display Table of Food Orders in a Restaurant","titleSlug":"display-table-of-food-orders-in-a-restaurant"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1419,"title":"Minimum Number of Frogs Croaking","titleSlug":"minimum-number-of-frogs-croaking"}
+{"chalengeQuestionDates":["2023-10-07"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1420,"title":"Build Array Where You Can Find The Maximum Exactly K Comparisons","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1421,"title":"NPV Queries","titleSlug":"npv-queries"}
+{"chalengeQuestionDates":["2023-12-22"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1422,"title":"Maximum Score After Splitting a String","titleSlug":"maximum-score-after-splitting-a-string"}
+{"chalengeQuestionDates":["2022-06-26","2021-05-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1423,"title":"Maximum Points You Can Obtain from Cards","titleSlug":"maximum-points-you-can-obtain-from-cards"}
+{"chalengeQuestionDates":["2023-11-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1424,"title":"Diagonal Traverse II","titleSlug":"diagonal-traverse-ii"}
+{"chalengeQuestionDates":["2023-10-21"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1425,"title":"Constrained Subsequence Sum","titleSlug":"constrained-subsequence-sum"}
+{"chalengeQuestionDates":["2020-04-07"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1426,"title":"Counting Elements","titleSlug":"counting-elements"}
+{"chalengeQuestionDates":["2020-04-14"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1427,"title":"Perform String Shifts","titleSlug":"perform-string-shifts"}
+{"chalengeQuestionDates":["2024-01-08","2022-12-29","2021-10-01","2020-04-21"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1428,"title":"Leftmost Column with at Least a One","titleSlug":"leftmost-column-with-at-least-a-one"}
+{"chalengeQuestionDates":["2024-10-15","2021-11-22","2020-04-28"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1429,"title":"First Unique Number","titleSlug":"first-unique-number"}
+{"chalengeQuestionDates":["2020-04-30"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1430,"title":"Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"}
+{"chalengeQuestionDates":["2023-04-17"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1431,"title":"Kids With the Greatest Number of Candies","titleSlug":"kids-with-the-greatest-number-of-candies"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1432,"title":"Max Difference You Can Get From Changing an Integer","titleSlug":"max-difference-you-can-get-from-changing-an-integer"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1433,"title":"Check If a String Can Break Another String","titleSlug":"check-if-a-string-can-break-another-string"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1434,"title":"Number of Ways to Wear Different Hats to Each Other","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1435,"title":"Create a Session Bar Chart","titleSlug":"create-a-session-bar-chart"}
+{"chalengeQuestionDates":["2023-12-15"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1436,"title":"Destination City","titleSlug":"destination-city"}
+{"chalengeQuestionDates":["2021-01-25"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1437,"title":"Check If All 1's Are at Least Length K Places Away","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"}
+{"chalengeQuestionDates":["2024-06-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1438,"title":"Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1439,"title":"Find the Kth Smallest Sum of a Matrix With Sorted Rows","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1440,"title":"Evaluate Boolean Expression","titleSlug":"evaluate-boolean-expression"}
+{"chalengeQuestionDates":["2023-11-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1441,"title":"Build an Array With Stack Operations","titleSlug":"build-an-array-with-stack-operations"}
+{"chalengeQuestionDates":["2024-05-30"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1442,"title":"Count Triplets That Can Form Two Arrays of Equal XOR","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"}
+{"chalengeQuestionDates":["2023-01-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1443,"title":"Minimum Time to Collect All Apples in a Tree","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"}
+{"chalengeQuestionDates":["2023-03-31"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1444,"title":"Number of Ways of Cutting a Pizza","titleSlug":"number-of-ways-of-cutting-a-pizza"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1445,"title":"Apples & Oranges","titleSlug":"apples-oranges"}
+{"chalengeQuestionDates":["2021-12-13","2020-11-03"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1446,"title":"Consecutive Characters","titleSlug":"consecutive-characters"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1447,"title":"Simplified Fractions","titleSlug":"simplified-fractions"}
+{"chalengeQuestionDates":["2022-09-01","2021-08-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1448,"title":"Count Good Nodes in Binary Tree","titleSlug":"count-good-nodes-in-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1449,"title":"Form Largest Integer With Digits That Add up to Target","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1450,"title":"Number of Students Doing Homework at a Given Time","titleSlug":"number-of-students-doing-homework-at-a-given-time"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1451,"title":"Rearrange Words in a Sentence","titleSlug":"rearrange-words-in-a-sentence"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1452,"title":"People Whose List of Favorite Companies Is Not a Subset of Another List","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1453,"title":"Maximum Number of Darts Inside of a Circular Dartboard","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1454,"title":"Active Users","titleSlug":"active-users"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1455,"title":"Check If a Word Occurs As a Prefix of Any Word in a Sentence","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"}
+{"chalengeQuestionDates":["2023-05-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1456,"title":"Maximum Number of Vowels in a Substring of Given Length","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"}
+{"chalengeQuestionDates":["2024-01-24","2022-09-14","2020-12-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1457,"title":"Pseudo-Palindromic Paths in a Binary Tree","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"}
+{"chalengeQuestionDates":["2023-10-08"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1458,"title":"Max Dot Product of Two Subsequences","titleSlug":"max-dot-product-of-two-subsequences"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1459,"title":"Rectangles Area","titleSlug":"rectangles-area"}
+{"chalengeQuestionDates":["2024-08-03"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1460,"title":"Make Two Arrays Equal by Reversing Subarrays","titleSlug":"make-two-arrays-equal-by-reversing-subarrays"}
+{"chalengeQuestionDates":["2022-05-31","2021-03-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1461,"title":"Check If a String Contains All Binary Codes of Size K","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1462,"title":"Course Schedule IV","titleSlug":"course-schedule-iv"}
+{"chalengeQuestionDates":["2024-02-11","2022-01-08","2020-12-19"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1463,"title":"Cherry Pickup II","titleSlug":"cherry-pickup-ii"}
+{"chalengeQuestionDates":["2023-12-12"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1464,"title":"Maximum Product of Two Elements in an Array","titleSlug":"maximum-product-of-two-elements-in-an-array"}
+{"chalengeQuestionDates":["2022-07-02","2021-06-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1465,"title":"Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"}
+{"chalengeQuestionDates":["2023-03-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1466,"title":"Reorder Routes to Make All Paths Lead to the City Zero","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1467,"title":"Probability of a Two Boxes Having The Same Number of Distinct Balls","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1468,"title":"Calculate Salaries","titleSlug":"calculate-salaries"}
+{"chalengeQuestionDates":["2024-04-15"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1469,"title":"Find All The Lonely Nodes","titleSlug":"find-all-the-lonely-nodes"}
+{"chalengeQuestionDates":["2023-02-06"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1470,"title":"Shuffle the Array","titleSlug":"shuffle-the-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1471,"title":"The k Strongest Values in an Array","titleSlug":"the-k-strongest-values-in-an-array"}
+{"chalengeQuestionDates":["2023-03-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1472,"title":"Design Browser History","titleSlug":"design-browser-history"}
+{"chalengeQuestionDates":["2022-07-08"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1473,"title":"Paint House III","titleSlug":"paint-house-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1474,"title":"Delete N Nodes After M Nodes of a Linked List","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1475,"title":"Final Prices With a Special Discount in a Shop","titleSlug":"final-prices-with-a-special-discount-in-a-shop"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1476,"title":"Subrectangle Queries","titleSlug":"subrectangle-queries"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1477,"title":"Find Two Non-overlapping Sub-arrays Each With Target Sum","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1478,"title":"Allocate Mailboxes","titleSlug":"allocate-mailboxes"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1479,"title":"Sales by Day of the Week","titleSlug":"sales-by-day-of-the-week"}
+{"chalengeQuestionDates":["2022-06-01","2021-05-03"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1480,"title":"Running Sum of 1d Array","titleSlug":"running-sum-of-1d-array"}
+{"chalengeQuestionDates":["2024-02-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1481,"title":"Least Number of Unique Integers after K Removals","titleSlug":"least-number-of-unique-integers-after-k-removals"}
+{"chalengeQuestionDates":["2024-06-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1482,"title":"Minimum Number of Days to Make m Bouquets","titleSlug":"minimum-number-of-days-to-make-m-bouquets"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1483,"title":"Kth Ancestor of a Tree Node","titleSlug":"kth-ancestor-of-a-tree-node"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1484,"title":"Group Sold Products By The Date","titleSlug":"group-sold-products-by-the-date"}
+{"chalengeQuestionDates":["2023-03-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1485,"title":"Clone Binary Tree With Random Pointer","titleSlug":"clone-binary-tree-with-random-pointer"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1486,"title":"XOR Operation in an Array","titleSlug":"xor-operation-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1487,"title":"Making File Names Unique","titleSlug":"making-file-names-unique"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1488,"title":"Avoid Flood in The City","titleSlug":"avoid-flood-in-the-city"}
+{"chalengeQuestionDates":["2023-08-19"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1489,"title":"Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"}
+{"chalengeQuestionDates":["2022-03-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1490,"title":"Clone N-ary Tree","titleSlug":"clone-n-ary-tree"}
+{"chalengeQuestionDates":["2023-05-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1491,"title":"Average Salary Excluding the Minimum and Maximum Salary","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"}
+{"chalengeQuestionDates":["2020-12-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1492,"title":"The kth Factor of n","titleSlug":"the-kth-factor-of-n"}
+{"chalengeQuestionDates":["2023-07-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1493,"title":"Longest Subarray of 1's After Deleting One Element","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1494,"title":"Parallel Courses II","titleSlug":"parallel-courses-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1495,"title":"Friendly Movies Streamed Last Month","titleSlug":"friendly-movies-streamed-last-month"}
+{"chalengeQuestionDates":["2023-12-23"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1496,"title":"Path Crossing","titleSlug":"path-crossing"}
+{"chalengeQuestionDates":["2024-10-01"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1497,"title":"Check If Array Pairs Are Divisible by k","titleSlug":"check-if-array-pairs-are-divisible-by-k"}
+{"chalengeQuestionDates":["2023-05-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1498,"title":"Number of Subsequences That Satisfy the Given Sum Condition","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1499,"title":"Max Value of Equation","titleSlug":"max-value-of-equation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1500,"title":"Design a File Sharing System","titleSlug":"design-a-file-sharing-system"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1501,"title":"Countries You Can Safely Invest In","titleSlug":"countries-you-can-safely-invest-in"}
+{"chalengeQuestionDates":["2023-06-06"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1502,"title":"Can Make Arithmetic Progression From Sequence","titleSlug":"can-make-arithmetic-progression-from-sequence"}
+{"chalengeQuestionDates":["2023-11-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1503,"title":"Last Moment Before All Ants Fall Out of a Plank","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1504,"title":"Count Submatrices With All Ones","titleSlug":"count-submatrices-with-all-ones"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1505,"title":"Minimum Possible Integer After at Most K Adjacent Swaps On Digits","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"}
+{"chalengeQuestionDates":["2021-01-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1506,"title":"Find Root of N-Ary Tree","titleSlug":"find-root-of-n-ary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1507,"title":"Reformat Date","titleSlug":"reformat-date"}
+{"chalengeQuestionDates":["2024-08-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1508,"title":"Range Sum of Sorted Subarray Sums","titleSlug":"range-sum-of-sorted-subarray-sums"}
+{"chalengeQuestionDates":["2024-07-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1509,"title":"Minimum Difference Between Largest and Smallest Value in Three Moves","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"}
+{"chalengeQuestionDates":["2022-01-22","2020-10-25"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1510,"title":"Stone Game IV","titleSlug":"stone-game-iv"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1511,"title":"Customer Order Frequency","titleSlug":"customer-order-frequency"}
+{"chalengeQuestionDates":["2023-10-03"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1512,"title":"Number of Good Pairs","titleSlug":"number-of-good-pairs"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1513,"title":"Number of Substrings With Only 1s","titleSlug":"number-of-substrings-with-only-1s"}
+{"chalengeQuestionDates":["2024-08-31","2023-06-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1514,"title":"Path with Maximum Probability","titleSlug":"path-with-maximum-probability"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1515,"title":"Best Position for a Service Centre","titleSlug":"best-position-for-a-service-centre"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1516,"title":"Move Sub-Tree of N-Ary Tree","titleSlug":"move-sub-tree-of-n-ary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1517,"title":"Find Users With Valid E-Mails","titleSlug":"find-users-with-valid-e-mails"}
+{"chalengeQuestionDates":["2024-07-07"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1518,"title":"Water Bottles","titleSlug":"water-bottles"}
+{"chalengeQuestionDates":["2023-01-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1519,"title":"Number of Nodes in the Sub-Tree With the Same Label","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1520,"title":"Maximum Number of Non-Overlapping Substrings","titleSlug":"maximum-number-of-non-overlapping-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1521,"title":"Find a Value of a Mysterious Function Closest to Target","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"}
+{"chalengeQuestionDates":["2021-11-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1522,"title":"Diameter of N-Ary Tree","titleSlug":"diameter-of-n-ary-tree"}
+{"chalengeQuestionDates":["2023-02-13"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1523,"title":"Count Odd Numbers in an Interval Range","titleSlug":"count-odd-numbers-in-an-interval-range"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1524,"title":"Number of Sub-arrays With Odd Sum","titleSlug":"number-of-sub-arrays-with-odd-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1525,"title":"Number of Good Ways to Split a String","titleSlug":"number-of-good-ways-to-split-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1526,"title":"Minimum Number of Increments on Subarrays to Form a Target Array","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1527,"title":"Patients With a Condition","titleSlug":"patients-with-a-condition"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1528,"title":"Shuffle String","titleSlug":"shuffle-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1529,"title":"Minimum Suffix Flips","titleSlug":"minimum-suffix-flips"}
+{"chalengeQuestionDates":["2024-07-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1530,"title":"Number of Good Leaf Nodes Pairs","titleSlug":"number-of-good-leaf-nodes-pairs"}
+{"chalengeQuestionDates":["2023-12-28","2022-10-15"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1531,"title":"String Compression II","titleSlug":"string-compression-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1532,"title":"The Most Recent Three Orders","titleSlug":"the-most-recent-three-orders"}
+{"chalengeQuestionDates":["2023-01-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1533,"title":"Find the Index of the Large Integer","titleSlug":"find-the-index-of-the-large-integer"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1534,"title":"Count Good Triplets","titleSlug":"count-good-triplets"}
+{"chalengeQuestionDates":["2023-11-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1535,"title":"Find the Winner of an Array Game","titleSlug":"find-the-winner-of-an-array-game"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1536,"title":"Minimum Swaps to Arrange a Binary Grid","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1537,"title":"Get the Maximum Score","titleSlug":"get-the-maximum-score"}
+{"chalengeQuestionDates":["2023-04-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1538,"title":"Guess the Majority in a Hidden Array","titleSlug":"guess-the-majority-in-a-hidden-array"}
+{"chalengeQuestionDates":["2023-03-06","2021-01-06"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1539,"title":"Kth Missing Positive Number","titleSlug":"kth-missing-positive-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1540,"title":"Can Convert String in K Moves","titleSlug":"can-convert-string-in-k-moves"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1541,"title":"Minimum Insertions to Balance a Parentheses String","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1542,"title":"Find Longest Awesome Substring","titleSlug":"find-longest-awesome-substring"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1543,"title":"Fix Product Name Format","titleSlug":"fix-product-name-format"}
+{"chalengeQuestionDates":["2024-04-05","2022-11-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1544,"title":"Make The String Great","titleSlug":"make-the-string-great"}
+{"chalengeQuestionDates":["2024-10-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1545,"title":"Find Kth Bit in Nth Binary String","titleSlug":"find-kth-bit-in-nth-binary-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1546,"title":"Maximum Number of Non-Overlapping Subarrays With Sum Equals Target","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"}
+{"chalengeQuestionDates":["2023-05-28"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1547,"title":"Minimum Cost to Cut a Stick","titleSlug":"minimum-cost-to-cut-a-stick"}
+{"chalengeQuestionDates":["2023-04-15"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1548,"title":"The Most Similar Path in a Graph","titleSlug":"the-most-similar-path-in-a-graph"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1549,"title":"The Most Recent Orders for Each Product","titleSlug":"the-most-recent-orders-for-each-product"}
+{"chalengeQuestionDates":["2024-07-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1550,"title":"Three Consecutive Odds","titleSlug":"three-consecutive-odds"}
+{"chalengeQuestionDates":["2021-04-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1551,"title":"Minimum Operations to Make Array Equal","titleSlug":"minimum-operations-to-make-array-equal"}
+{"chalengeQuestionDates":["2024-06-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1552,"title":"Magnetic Force Between Two Balls","titleSlug":"magnetic-force-between-two-balls"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1553,"title":"Minimum Number of Days to Eat N Oranges","titleSlug":"minimum-number-of-days-to-eat-n-oranges"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1554,"title":"Strings Differ by One Character","titleSlug":"strings-differ-by-one-character"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1555,"title":"Bank Account Summary","titleSlug":"bank-account-summary"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1556,"title":"Thousand Separator","titleSlug":"thousand-separator"}
+{"chalengeQuestionDates":["2023-05-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1557,"title":"Minimum Number of Vertices to Reach All Nodes","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1558,"title":"Minimum Numbers of Function Calls to Make Target Array","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1559,"title":"Detect Cycles in 2D Grid","titleSlug":"detect-cycles-in-2d-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1560,"title":"Most Visited Sector in  a Circular Track","titleSlug":"most-visited-sector-in-a-circular-track"}
+{"chalengeQuestionDates":["2023-11-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1561,"title":"Maximum Number of Coins You Can Get","titleSlug":"maximum-number-of-coins-you-can-get"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1562,"title":"Find Latest Group of Size M","titleSlug":"find-latest-group-of-size-m"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1563,"title":"Stone Game V","titleSlug":"stone-game-v"}
+{"chalengeQuestionDates":["2022-06-29","2021-05-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1564,"title":"Put Boxes Into the Warehouse I","titleSlug":"put-boxes-into-the-warehouse-i"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1565,"title":"Unique Orders and Customers Per Month","titleSlug":"unique-orders-and-customers-per-month"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1566,"title":"Detect Pattern of Length M Repeated K or More Times","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1567,"title":"Maximum Length of Subarray With Positive Product","titleSlug":"maximum-length-of-subarray-with-positive-product"}
+{"chalengeQuestionDates":["2024-08-11"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1568,"title":"Minimum Number of Days to Disconnect Island","titleSlug":"minimum-number-of-days-to-disconnect-island"}
+{"chalengeQuestionDates":["2023-06-16"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1569,"title":"Number of Ways to Reorder Array to Get Same BST","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"}
+{"chalengeQuestionDates":["2022-08-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1570,"title":"Dot Product of Two Sparse Vectors","titleSlug":"dot-product-of-two-sparse-vectors"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1571,"title":"Warehouse Manager","titleSlug":"warehouse-manager"}
+{"chalengeQuestionDates":["2023-05-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1572,"title":"Matrix Diagonal Sum","titleSlug":"matrix-diagonal-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1573,"title":"Number of Ways to Split a String","titleSlug":"number-of-ways-to-split-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1574,"title":"Shortest Subarray to be Removed to Make Array Sorted","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"}
+{"chalengeQuestionDates":["2023-06-25"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1575,"title":"Count All Possible Routes","titleSlug":"count-all-possible-routes"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1576,"title":"Replace All ?'s to Avoid Consecutive Repeating Characters","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1577,"title":"Number of Ways Where Square of Number Is Equal to Product of Two Numbers","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"}
+{"chalengeQuestionDates":["2023-12-27","2022-10-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1578,"title":"Minimum Time to Make Rope Colorful","titleSlug":"minimum-time-to-make-rope-colorful"}
+{"chalengeQuestionDates":["2024-06-30","2023-04-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1579,"title":"Remove Max Number of Edges to Keep Graph Fully Traversable","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"}
+{"chalengeQuestionDates":["2024-06-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1580,"title":"Put Boxes Into the Warehouse II","titleSlug":"put-boxes-into-the-warehouse-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1581,"title":"Customer Who Visited but Did Not Make Any Transactions","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"}
+{"chalengeQuestionDates":["2023-12-13"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1582,"title":"Special Positions in a Binary Matrix","titleSlug":"special-positions-in-a-binary-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1583,"title":"Count Unhappy Friends","titleSlug":"count-unhappy-friends"}
+{"chalengeQuestionDates":["2023-09-15","2022-04-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1584,"title":"Min Cost to Connect All Points","titleSlug":"min-cost-to-connect-all-points"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1585,"title":"Check If String Is Transformable With Substring Sort Operations","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"}
+{"chalengeQuestionDates":["2022-04-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1586,"title":"Binary Search Tree Iterator II","titleSlug":"binary-search-tree-iterator-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1587,"title":"Bank Account Summary II","titleSlug":"bank-account-summary-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1588,"title":"Sum of All Odd Length Subarrays","titleSlug":"sum-of-all-odd-length-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1589,"title":"Maximum Sum Obtained of Any Permutation","titleSlug":"maximum-sum-obtained-of-any-permutation"}
+{"chalengeQuestionDates":["2024-10-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1590,"title":"Make Sum Divisible by P","titleSlug":"make-sum-divisible-by-p"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1591,"title":"Strange Printer II","titleSlug":"strange-printer-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1592,"title":"Rearrange Spaces Between Words","titleSlug":"rearrange-spaces-between-words"}
+{"chalengeQuestionDates":["2024-10-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1593,"title":"Split a String Into the Max Number of Unique Substrings","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1594,"title":"Maximum Non Negative Product in a Matrix","titleSlug":"maximum-non-negative-product-in-a-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1595,"title":"Minimum Cost to Connect Two Groups of Points","titleSlug":"minimum-cost-to-connect-two-groups-of-points"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1596,"title":"The Most Frequently Ordered Products for Each Customer","titleSlug":"the-most-frequently-ordered-products-for-each-customer"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1597,"title":"Build Binary Expression Tree From Infix Expression","titleSlug":"build-binary-expression-tree-from-infix-expression"}
+{"chalengeQuestionDates":["2024-07-10"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1598,"title":"Crawler Log Folder","titleSlug":"crawler-log-folder"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1599,"title":"Maximum Profit of Operating a Centennial Wheel","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1600,"title":"Throne Inheritance","titleSlug":"throne-inheritance"}
+{"chalengeQuestionDates":["2023-07-02"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1601,"title":"Maximum Number of Achievable Transfer Requests","titleSlug":"maximum-number-of-achievable-transfer-requests"}
+{"chalengeQuestionDates":["2022-01-22","2020-12-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1602,"title":"Find Nearest Right Node in Binary Tree","titleSlug":"find-nearest-right-node-in-binary-tree"}
+{"chalengeQuestionDates":["2023-05-29"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1603,"title":"Design Parking System","titleSlug":"design-parking-system"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1604,"title":"Alert Using Same Key-Card Three or More Times in a One Hour Period","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"}
+{"chalengeQuestionDates":["2024-07-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1605,"title":"Find Valid Matrix Given Row and Column Sums","titleSlug":"find-valid-matrix-given-row-and-column-sums"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1606,"title":"Find Servers That Handled Most Number of Requests","titleSlug":"find-servers-that-handled-most-number-of-requests"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1607,"title":"Sellers With No Sales","titleSlug":"sellers-with-no-sales"}
+{"chalengeQuestionDates":["2024-05-27"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1608,"title":"Special Array With X Elements Greater Than or Equal X","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"}
+{"chalengeQuestionDates":["2024-02-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1609,"title":"Even Odd Tree","titleSlug":"even-odd-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1610,"title":"Maximum Number of Visible Points","titleSlug":"maximum-number-of-visible-points"}
+{"chalengeQuestionDates":["2023-11-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1611,"title":"Minimum One Bit Operations to Make Integers Zero","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1612,"title":"Check If Two Expression Trees are Equivalent","titleSlug":"check-if-two-expression-trees-are-equivalent"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1613,"title":"Find the Missing IDs","titleSlug":"find-the-missing-ids"}
+{"chalengeQuestionDates":["2024-04-04"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1614,"title":"Maximum Nesting Depth of the Parentheses","titleSlug":"maximum-nesting-depth-of-the-parentheses"}
+{"chalengeQuestionDates":["2023-08-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1615,"title":"Maximal Network Rank","titleSlug":"maximal-network-rank"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1616,"title":"Split Two Strings to Make Palindrome","titleSlug":"split-two-strings-to-make-palindrome"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1617,"title":"Count Subtrees With Max Distance Between Cities","titleSlug":"count-subtrees-with-max-distance-between-cities"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1618,"title":"Maximum Font to Fit a Sentence in a Screen","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1619,"title":"Mean of Array After Removing Some Elements","titleSlug":"mean-of-array-after-removing-some-elements"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1620,"title":"Coordinate With Maximum Network Quality","titleSlug":"coordinate-with-maximum-network-quality"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1621,"title":"Number of Sets of K Non-Overlapping Line Segments","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1622,"title":"Fancy Sequence","titleSlug":"fancy-sequence"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1623,"title":"All Valid Triplets That Can Represent a Country","titleSlug":"all-valid-triplets-that-can-represent-a-country"}
+{"chalengeQuestionDates":["2023-12-31"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1624,"title":"Largest Substring Between Two Equal Characters","titleSlug":"largest-substring-between-two-equal-characters"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1625,"title":"Lexicographically Smallest String After Applying Operations","titleSlug":"lexicographically-smallest-string-after-applying-operations"}
+{"chalengeQuestionDates":["2023-01-31"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1626,"title":"Best Team With No Conflicts","titleSlug":"best-team-with-no-conflicts"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1627,"title":"Graph Connectivity With Threshold","titleSlug":"graph-connectivity-with-threshold"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1628,"title":"Design an Expression Tree With Evaluate Function","titleSlug":"design-an-expression-tree-with-evaluate-function"}
+{"chalengeQuestionDates":["2021-09-06"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1629,"title":"Slowest Key","titleSlug":"slowest-key"}
+{"chalengeQuestionDates":["2023-11-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1630,"title":"Arithmetic Subarrays","titleSlug":"arithmetic-subarrays"}
+{"chalengeQuestionDates":["2023-09-16","2022-04-28","2021-01-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1631,"title":"Path With Minimum Effort","titleSlug":"path-with-minimum-effort"}
+{"chalengeQuestionDates":["2021-08-08"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1632,"title":"Rank Transform of a Matrix","titleSlug":"rank-transform-of-a-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1633,"title":"Percentage of Users Attended a Contest","titleSlug":"percentage-of-users-attended-a-contest"}
+{"chalengeQuestionDates":["2024-09-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1634,"title":"Add Two Polynomials Represented as Linked Lists","titleSlug":"add-two-polynomials-represented-as-linked-lists"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1635,"title":"Hopper Company Queries I","titleSlug":"hopper-company-queries-i"}
+{"chalengeQuestionDates":["2024-07-23"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1636,"title":"Sort Array by Increasing Frequency","titleSlug":"sort-array-by-increasing-frequency"}
+{"chalengeQuestionDates":["2023-12-21"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1637,"title":"Widest Vertical Area Between Two Points Containing No Points","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1638,"title":"Count Substrings That Differ by One Character","titleSlug":"count-substrings-that-differ-by-one-character"}
+{"chalengeQuestionDates":["2023-04-16"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1639,"title":"Number of Ways to Form a Target String Given a Dictionary","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"}
+{"chalengeQuestionDates":["2021-01-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1640,"title":"Check Array Formation Through Concatenation","titleSlug":"check-array-formation-through-concatenation"}
+{"chalengeQuestionDates":["2022-05-11","2021-01-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1641,"title":"Count Sorted Vowel Strings","titleSlug":"count-sorted-vowel-strings"}
+{"chalengeQuestionDates":["2024-02-17","2022-06-21","2021-04-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1642,"title":"Furthest Building You Can Reach","titleSlug":"furthest-building-you-can-reach"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1643,"title":"Kth Smallest Instructions","titleSlug":"kth-smallest-instructions"}
+{"chalengeQuestionDates":["2023-07-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1644,"title":"Lowest Common Ancestor of a Binary Tree II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1645,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"}
+{"chalengeQuestionDates":["2021-01-15"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1646,"title":"Get Maximum in Generated Array","titleSlug":"get-maximum-in-generated-array"}
+{"chalengeQuestionDates":["2023-09-12","2022-06-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1647,"title":"Minimum Deletions to Make Character Frequencies Unique","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1648,"title":"Sell Diminishing-Valued Colored Balls","titleSlug":"sell-diminishing-valued-colored-balls"}
+{"chalengeQuestionDates":["2021-01-10"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1649,"title":"Create Sorted Array through Instructions","titleSlug":"create-sorted-array-through-instructions"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1650,"title":"Lowest Common Ancestor of a Binary Tree III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1651,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1652,"title":"Defuse the Bomb","titleSlug":"defuse-the-bomb"}
+{"chalengeQuestionDates":["2024-07-30"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1653,"title":"Minimum Deletions to Make String Balanced","titleSlug":"minimum-deletions-to-make-string-balanced"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1654,"title":"Minimum Jumps to Reach Home","titleSlug":"minimum-jumps-to-reach-home"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1655,"title":"Distribute Repeating Integers","titleSlug":"distribute-repeating-integers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1656,"title":"Design an Ordered Stream","titleSlug":"design-an-ordered-stream"}
+{"chalengeQuestionDates":["2024-01-14","2022-12-02","2021-01-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1657,"title":"Determine if Two Strings Are Close","titleSlug":"determine-if-two-strings-are-close"}
+{"chalengeQuestionDates":["2023-09-20","2022-06-11","2021-01-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1658,"title":"Minimum Operations to Reduce X to Zero","titleSlug":"minimum-operations-to-reduce-x-to-zero"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1659,"title":"Maximize Grid Happiness","titleSlug":"maximize-grid-happiness"}
+{"chalengeQuestionDates":["2023-10-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1660,"title":"Correct a Binary Tree","titleSlug":"correct-a-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1661,"title":"Average Time of Process per Machine","titleSlug":"average-time-of-process-per-machine"}
+{"chalengeQuestionDates":["2023-12-01","2022-10-25","2021-01-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1662,"title":"Check If Two String Arrays are Equivalent","titleSlug":"check-if-two-string-arrays-are-equivalent"}
+{"chalengeQuestionDates":["2022-03-22","2021-01-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1663,"title":"Smallest String With A Given Numeric Value","titleSlug":"smallest-string-with-a-given-numeric-value"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1664,"title":"Ways to Make a Fair Array","titleSlug":"ways-to-make-a-fair-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1665,"title":"Minimum Initial Energy to Finish Tasks","titleSlug":"minimum-initial-energy-to-finish-tasks"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1666,"title":"Change the Root of a Binary Tree","titleSlug":"change-the-root-of-a-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1667,"title":"Fix Names in a Table","titleSlug":"fix-names-in-a-table"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1668,"title":"Maximum Repeating Substring","titleSlug":"maximum-repeating-substring"}
+{"chalengeQuestionDates":["2024-03-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1669,"title":"Merge In Between Linked Lists","titleSlug":"merge-in-between-linked-lists"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1670,"title":"Design Front Middle Back Queue","titleSlug":"design-front-middle-back-queue"}
+{"chalengeQuestionDates":["2024-10-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1671,"title":"Minimum Number of Removals to Make Mountain Array","titleSlug":"minimum-number-of-removals-to-make-mountain-array"}
+{"chalengeQuestionDates":["2022-01-31"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1672,"title":"Richest Customer Wealth","titleSlug":"richest-customer-wealth"}
+{"chalengeQuestionDates":["2021-01-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1673,"title":"Find the Most Competitive Subsequence","titleSlug":"find-the-most-competitive-subsequence"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1674,"title":"Minimum Moves to Make Array Complementary","titleSlug":"minimum-moves-to-make-array-complementary"}
+{"chalengeQuestionDates":["2023-02-24","2022-02-19","2021-01-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1675,"title":"Minimize Deviation in Array","titleSlug":"minimize-deviation-in-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1676,"title":"Lowest Common Ancestor of a Binary Tree IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1677,"title":"Product's Worth Over Invoices","titleSlug":"products-worth-over-invoices"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1678,"title":"Goal Parser Interpretation","titleSlug":"goal-parser-interpretation"}
+{"chalengeQuestionDates":["2022-05-04","2021-01-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1679,"title":"Max Number of K-Sum Pairs","titleSlug":"max-number-of-k-sum-pairs"}
+{"chalengeQuestionDates":["2022-09-23","2021-01-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1680,"title":"Concatenation of Consecutive Binary Numbers","titleSlug":"concatenation-of-consecutive-binary-numbers"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1681,"title":"Minimum Incompatibility","titleSlug":"minimum-incompatibility"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1682,"title":"Longest Palindromic Subsequence II","titleSlug":"longest-palindromic-subsequence-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1683,"title":"Invalid Tweets","titleSlug":"invalid-tweets"}
+{"chalengeQuestionDates":["2024-09-12"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1684,"title":"Count the Number of Consistent Strings","titleSlug":"count-the-number-of-consistent-strings"}
+{"chalengeQuestionDates":["2023-11-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1685,"title":"Sum of Absolute Differences in a Sorted Array","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1686,"title":"Stone Game VI","titleSlug":"stone-game-vi"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1687,"title":"Delivering Boxes from Storage to Ports","titleSlug":"delivering-boxes-from-storage-to-ports"}
+{"chalengeQuestionDates":["2023-12-05"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1688,"title":"Count of Matches in Tournament","titleSlug":"count-of-matches-in-tournament"}
+{"chalengeQuestionDates":["2022-06-27","2021-05-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1689,"title":"Partitioning Into Minimum Number Of Deci-Binary Numbers","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"}
+{"chalengeQuestionDates":["2021-06-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1690,"title":"Stone Game VII","titleSlug":"stone-game-vii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1691,"title":"Maximum Height by Stacking Cuboids","titleSlug":"maximum-height-by-stacking-cuboids"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1692,"title":"Count Ways to Distribute Candies","titleSlug":"count-ways-to-distribute-candies"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1693,"title":"Daily Leads and Partners","titleSlug":"daily-leads-and-partners"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1694,"title":"Reformat Phone Number","titleSlug":"reformat-phone-number"}
+{"chalengeQuestionDates":["2022-06-12","2021-05-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1695,"title":"Maximum Erasure Value","titleSlug":"maximum-erasure-value"}
+{"chalengeQuestionDates":["2022-07-09","2021-06-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1696,"title":"Jump Game VI","titleSlug":"jump-game-vi"}
+{"chalengeQuestionDates":["2023-04-29"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1697,"title":"Checking Existence of Edge Length Limited Paths","titleSlug":"checking-existence-of-edge-length-limited-paths"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1698,"title":"Number of Distinct Substrings in a String","titleSlug":"number-of-distinct-substrings-in-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1699,"title":"Number of Calls Between Two Persons","titleSlug":"number-of-calls-between-two-persons"}
+{"chalengeQuestionDates":["2024-04-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1700,"title":"Number of Students Unable to Eat Lunch","titleSlug":"number-of-students-unable-to-eat-lunch"}
+{"chalengeQuestionDates":["2024-07-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1701,"title":"Average Waiting Time","titleSlug":"average-waiting-time"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1702,"title":"Maximum Binary String After Change","titleSlug":"maximum-binary-string-after-change"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1703,"title":"Minimum Adjacent Swaps for K Consecutive Ones","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"}
+{"chalengeQuestionDates":["2024-01-12","2022-12-01","2021-04-07"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1704,"title":"Determine if String Halves Are Alike","titleSlug":"determine-if-string-halves-are-alike"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1705,"title":"Maximum Number of Eaten Apples","titleSlug":"maximum-number-of-eaten-apples"}
+{"chalengeQuestionDates":["2022-11-01"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1706,"title":"Where Will the Ball Fall","titleSlug":"where-will-the-ball-fall"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1707,"title":"Maximum XOR With an Element From Array","titleSlug":"maximum-xor-with-an-element-from-array"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1708,"title":"Largest Subarray Length K","titleSlug":"largest-subarray-length-k"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1709,"title":"Biggest Window Between Visits","titleSlug":"biggest-window-between-visits"}
+{"chalengeQuestionDates":["2022-07-01","2021-06-14"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1710,"title":"Maximum Units on a Truck","titleSlug":"maximum-units-on-a-truck"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1711,"title":"Count Good Meals","titleSlug":"count-good-meals"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1712,"title":"Ways to Split Array Into Three Subarrays","titleSlug":"ways-to-split-array-into-three-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1713,"title":"Minimum Operations to Make a Subsequence","titleSlug":"minimum-operations-to-make-a-subsequence"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1714,"title":"Sum Of Special Evenly-Spaced Elements In Array","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1715,"title":"Count Apples and Oranges","titleSlug":"count-apples-and-oranges"}
+{"chalengeQuestionDates":["2023-12-06"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1716,"title":"Calculate Money in Leetcode Bank","titleSlug":"calculate-money-in-leetcode-bank"}
+{"chalengeQuestionDates":["2024-07-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1717,"title":"Maximum Score From Removing Substrings","titleSlug":"maximum-score-from-removing-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1718,"title":"Construct the Lexicographically Largest Valid Sequence","titleSlug":"construct-the-lexicographically-largest-valid-sequence"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1719,"title":"Number Of Ways To Reconstruct A Tree","titleSlug":"number-of-ways-to-reconstruct-a-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1720,"title":"Decode XORed Array","titleSlug":"decode-xored-array"}
+{"chalengeQuestionDates":["2023-05-15","2022-04-04","2021-03-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1721,"title":"Swapping Nodes in a Linked List","titleSlug":"swapping-nodes-in-a-linked-list"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1722,"title":"Minimize Hamming Distance After Swap Operations","titleSlug":"minimize-hamming-distance-after-swap-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1723,"title":"Find Minimum Time to Finish All Jobs","titleSlug":"find-minimum-time-to-finish-all-jobs"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1724,"title":"Checking Existence of Edge Length Limited Paths II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1725,"title":"Number Of Rectangles That Can Form The Largest Square","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1726,"title":"Tuple with Same Product","titleSlug":"tuple-with-same-product"}
+{"chalengeQuestionDates":["2023-11-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1727,"title":"Largest Submatrix With Rearrangements","titleSlug":"largest-submatrix-with-rearrangements"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1728,"title":"Cat and Mouse II","titleSlug":"cat-and-mouse-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1729,"title":"Find Followers Count","titleSlug":"find-followers-count"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1730,"title":"Shortest Path to Get Food","titleSlug":"shortest-path-to-get-food"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1731,"title":"The Number of Employees Which Report to Each Employee","titleSlug":"the-number-of-employees-which-report-to-each-employee"}
+{"chalengeQuestionDates":["2023-06-19"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1732,"title":"Find the Highest Altitude","titleSlug":"find-the-highest-altitude"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1733,"title":"Minimum Number of People to Teach","titleSlug":"minimum-number-of-people-to-teach"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1734,"title":"Decode XORed Permutation","titleSlug":"decode-xored-permutation"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1735,"title":"Count Ways to Make Array With Product","titleSlug":"count-ways-to-make-array-with-product"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1736,"title":"Latest Time by Replacing Hidden Digits","titleSlug":"latest-time-by-replacing-hidden-digits"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1737,"title":"Change Minimum Characters to Satisfy One of Three Conditions","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1738,"title":"Find Kth Largest XOR Coordinate Value","titleSlug":"find-kth-largest-xor-coordinate-value"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1739,"title":"Building Boxes","titleSlug":"building-boxes"}
+{"chalengeQuestionDates":["2024-07-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1740,"title":"Find Distance in a Binary Tree","titleSlug":"find-distance-in-a-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1741,"title":"Find Total Time Spent by Each Employee","titleSlug":"find-total-time-spent-by-each-employee"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1742,"title":"Maximum Number of Balls in a Box","titleSlug":"maximum-number-of-balls-in-a-box"}
+{"chalengeQuestionDates":["2023-11-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1743,"title":"Restore the Array From Adjacent Pairs","titleSlug":"restore-the-array-from-adjacent-pairs"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1744,"title":"Can You Eat Your Favorite Candy on Your Favorite Day?","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1745,"title":"Palindrome Partitioning IV","titleSlug":"palindrome-partitioning-iv"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1746,"title":"Maximum Subarray Sum After One Operation","titleSlug":"maximum-subarray-sum-after-one-operation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1747,"title":"Leetflex Banned Accounts","titleSlug":"leetflex-banned-accounts"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1748,"title":"Sum of Unique Elements","titleSlug":"sum-of-unique-elements"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1749,"title":"Maximum Absolute Sum of Any Subarray","titleSlug":"maximum-absolute-sum-of-any-subarray"}
+{"chalengeQuestionDates":["2024-03-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1750,"title":"Minimum Length of String After Deleting Similar Ends","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"}
+{"chalengeQuestionDates":["2023-07-15"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1751,"title":"Maximum Number of Events That Can Be Attended II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1752,"title":"Check if Array Is Sorted and Rotated","titleSlug":"check-if-array-is-sorted-and-rotated"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1753,"title":"Maximum Score From Removing Stones","titleSlug":"maximum-score-from-removing-stones"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1754,"title":"Largest Merge Of Two Strings","titleSlug":"largest-merge-of-two-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1755,"title":"Closest Subsequence Sum","titleSlug":"closest-subsequence-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1756,"title":"Design Most Recently Used Queue","titleSlug":"design-most-recently-used-queue"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1757,"title":"Recyclable and Low Fat Products","titleSlug":"recyclable-and-low-fat-products"}
+{"chalengeQuestionDates":["2023-12-24"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1758,"title":"Minimum Changes To Make Alternating Binary String","titleSlug":"minimum-changes-to-make-alternating-binary-string"}
+{"chalengeQuestionDates":["2023-11-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1759,"title":"Count Number of Homogenous Substrings","titleSlug":"count-number-of-homogenous-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1760,"title":"Minimum Limit of Balls in a Bag","titleSlug":"minimum-limit-of-balls-in-a-bag"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1761,"title":"Minimum Degree of a Connected Trio in a Graph","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"}
+{"chalengeQuestionDates":["2021-10-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1762,"title":"Buildings With an Ocean View","titleSlug":"buildings-with-an-ocean-view"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1763,"title":"Longest Nice Substring","titleSlug":"longest-nice-substring"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1764,"title":"Form Array by Concatenating Subarrays of Another Array","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1765,"title":"Map of Highest Peak","titleSlug":"map-of-highest-peak"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1766,"title":"Tree of Coprimes","titleSlug":"tree-of-coprimes"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1767,"title":"Find the Subtasks That Did Not Execute","titleSlug":"find-the-subtasks-that-did-not-execute"}
+{"chalengeQuestionDates":["2023-04-18"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1768,"title":"Merge Strings Alternately","titleSlug":"merge-strings-alternately"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1769,"title":"Minimum Number of Operations to Move All Balls to Each Box","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"}
+{"chalengeQuestionDates":["2022-09-16"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1770,"title":"Maximum Score from Performing Multiplication Operations","titleSlug":"maximum-score-from-performing-multiplication-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1771,"title":"Maximize Palindrome Length From Subsequences","titleSlug":"maximize-palindrome-length-from-subsequences"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1772,"title":"Sort Features by Popularity","titleSlug":"sort-features-by-popularity"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1773,"title":"Count Items Matching a Rule","titleSlug":"count-items-matching-a-rule"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1774,"title":"Closest Dessert Cost","titleSlug":"closest-dessert-cost"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1775,"title":"Equal Sum Arrays With Minimum Number of Operations","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1776,"title":"Car Fleet II","titleSlug":"car-fleet-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1777,"title":"Product's Price for Each Store","titleSlug":"products-price-for-each-store"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1778,"title":"Shortest Path in a Hidden Grid","titleSlug":"shortest-path-in-a-hidden-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1779,"title":"Find Nearest Point That Has the Same X or Y Coordinate","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1780,"title":"Check if Number is a Sum of Powers of Three","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1781,"title":"Sum of Beauty of All Substrings","titleSlug":"sum-of-beauty-of-all-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1782,"title":"Count Pairs Of Nodes","titleSlug":"count-pairs-of-nodes"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1783,"title":"Grand Slam Titles","titleSlug":"grand-slam-titles"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1784,"title":"Check if Binary String Has at Most One Segment of Ones","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1785,"title":"Minimum Elements to Add to Form a Given Sum","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1786,"title":"Number of Restricted Paths From First to Last Node","titleSlug":"number-of-restricted-paths-from-first-to-last-node"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1787,"title":"Make the XOR of All Segments Equal to Zero","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1788,"title":"Maximize the Beauty of the Garden","titleSlug":"maximize-the-beauty-of-the-garden"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1789,"title":"Primary Department for Each Employee","titleSlug":"primary-department-for-each-employee"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1790,"title":"Check if One String Swap Can Make Strings Equal","titleSlug":"check-if-one-string-swap-can-make-strings-equal"}
+{"chalengeQuestionDates":["2024-06-27"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1791,"title":"Find Center of Star Graph","titleSlug":"find-center-of-star-graph"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1792,"title":"Maximum Average Pass Ratio","titleSlug":"maximum-average-pass-ratio"}
+{"chalengeQuestionDates":["2023-10-22"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1793,"title":"Maximum Score of a Good Subarray","titleSlug":"maximum-score-of-a-good-subarray"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1794,"title":"Count Pairs of Equal Substrings With Minimum Difference","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1795,"title":"Rearrange Products Table","titleSlug":"rearrange-products-table"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1796,"title":"Second Largest Digit in a String","titleSlug":"second-largest-digit-in-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1797,"title":"Design Authentication Manager","titleSlug":"design-authentication-manager"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1798,"title":"Maximum Number of Consecutive Values You Can Make","titleSlug":"maximum-number-of-consecutive-values-you-can-make"}
+{"chalengeQuestionDates":["2023-05-14"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1799,"title":"Maximize Score After N Operations","titleSlug":"maximize-score-after-n-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1800,"title":"Maximum Ascending Subarray Sum","titleSlug":"maximum-ascending-subarray-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1801,"title":"Number of Orders in the Backlog","titleSlug":"number-of-orders-in-the-backlog"}
+{"chalengeQuestionDates":["2023-06-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1802,"title":"Maximum Value at a Given Index in a Bounded Array","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1803,"title":"Count Pairs With XOR in a Range","titleSlug":"count-pairs-with-xor-in-a-range"}
+{"chalengeQuestionDates":["2024-09-29","2023-10-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1804,"title":"Implement Trie II (Prefix Tree)","titleSlug":"implement-trie-ii-prefix-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1805,"title":"Number of Different Integers in a String","titleSlug":"number-of-different-integers-in-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1806,"title":"Minimum Number of Operations to Reinitialize a Permutation","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1807,"title":"Evaluate the Bracket Pairs of a String","titleSlug":"evaluate-the-bracket-pairs-of-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1808,"title":"Maximize Number of Nice Divisors","titleSlug":"maximize-number-of-nice-divisors"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1809,"title":"Ad-Free Sessions","titleSlug":"ad-free-sessions"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1810,"title":"Minimum Path Cost in a Hidden Grid","titleSlug":"minimum-path-cost-in-a-hidden-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1811,"title":"Find Interview Candidates","titleSlug":"find-interview-candidates"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1812,"title":"Determine Color of a Chessboard Square","titleSlug":"determine-color-of-a-chessboard-square"}
+{"chalengeQuestionDates":["2024-10-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1813,"title":"Sentence Similarity III","titleSlug":"sentence-similarity-iii"}
+{"chalengeQuestionDates":["2023-11-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1814,"title":"Count Nice Pairs in an Array","titleSlug":"count-nice-pairs-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1815,"title":"Maximum Number of Groups Getting Fresh Donuts","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1816,"title":"Truncate Sentence","titleSlug":"truncate-sentence"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1817,"title":"Finding the Users Active Minutes","titleSlug":"finding-the-users-active-minutes"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1818,"title":"Minimum Absolute Sum Difference","titleSlug":"minimum-absolute-sum-difference"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1819,"title":"Number of Different Subsequences GCDs","titleSlug":"number-of-different-subsequences-gcds"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1820,"title":"Maximum Number of Accepted Invitations","titleSlug":"maximum-number-of-accepted-invitations"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1821,"title":"Find Customers With Positive Revenue this Year","titleSlug":"find-customers-with-positive-revenue-this-year"}
+{"chalengeQuestionDates":["2023-05-02"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1822,"title":"Sign of the Product of an Array","titleSlug":"sign-of-the-product-of-an-array"}
+{"chalengeQuestionDates":["2024-07-08"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1823,"title":"Find the Winner of the Circular Game","titleSlug":"find-the-winner-of-the-circular-game"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1824,"title":"Minimum Sideway Jumps","titleSlug":"minimum-sideway-jumps"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1825,"title":"Finding MK Average","titleSlug":"finding-mk-average"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1826,"title":"Faulty Sensor","titleSlug":"faulty-sensor"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1827,"title":"Minimum Operations to Make the Array Increasing","titleSlug":"minimum-operations-to-make-the-array-increasing"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1828,"title":"Queries on Number of Points Inside a Circle","titleSlug":"queries-on-number-of-points-inside-a-circle"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1829,"title":"Maximum XOR for Each Query","titleSlug":"maximum-xor-for-each-query"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1830,"title":"Minimum Number of Operations to Make String Sorted","titleSlug":"minimum-number-of-operations-to-make-string-sorted"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1831,"title":"Maximum Transaction Each Day","titleSlug":"maximum-transaction-each-day"}
+{"chalengeQuestionDates":["2022-10-17"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1832,"title":"Check if the Sentence Is Pangram","titleSlug":"check-if-the-sentence-is-pangram"}
+{"chalengeQuestionDates":["2023-01-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1833,"title":"Maximum Ice Cream Bars","titleSlug":"maximum-ice-cream-bars"}
+{"chalengeQuestionDates":["2022-12-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1834,"title":"Single-Threaded CPU","titleSlug":"single-threaded-cpu"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1835,"title":"Find XOR Sum of All Pairs Bitwise AND","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"}
+{"chalengeQuestionDates":["2024-07-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1836,"title":"Remove Duplicates From an Unsorted Linked List","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1837,"title":"Sum of Digits in Base K","titleSlug":"sum-of-digits-in-base-k"}
+{"chalengeQuestionDates":["2023-11-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1838,"title":"Frequency of the Most Frequent Element","titleSlug":"frequency-of-the-most-frequent-element"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1839,"title":"Longest Substring Of All Vowels in Order","titleSlug":"longest-substring-of-all-vowels-in-order"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1840,"title":"Maximum Building Height","titleSlug":"maximum-building-height"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1841,"title":"League Statistics","titleSlug":"league-statistics"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1842,"title":"Next Palindrome Using Same Digits","titleSlug":"next-palindrome-using-same-digits"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1843,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1844,"title":"Replace All Digits with Characters","titleSlug":"replace-all-digits-with-characters"}
+{"chalengeQuestionDates":["2023-11-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1845,"title":"Seat Reservation Manager","titleSlug":"seat-reservation-manager"}
+{"chalengeQuestionDates":["2023-11-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1846,"title":"Maximum Element After Decreasing and Rearranging","titleSlug":"maximum-element-after-decreasing-and-rearranging"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1847,"title":"Closest Room","titleSlug":"closest-room"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1848,"title":"Minimum Distance to the Target Element","titleSlug":"minimum-distance-to-the-target-element"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1849,"title":"Splitting a String Into Descending Consecutive Values","titleSlug":"splitting-a-string-into-descending-consecutive-values"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1850,"title":"Minimum Adjacent Swaps to Reach the Kth Smallest Number","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1851,"title":"Minimum Interval to Include Each Query","titleSlug":"minimum-interval-to-include-each-query"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1852,"title":"Distinct Numbers in Each Subarray","titleSlug":"distinct-numbers-in-each-subarray"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1853,"title":"Convert Date Format","titleSlug":"convert-date-format"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1854,"title":"Maximum Population Year","titleSlug":"maximum-population-year"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1855,"title":"Maximum Distance Between a Pair of Values","titleSlug":"maximum-distance-between-a-pair-of-values"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1856,"title":"Maximum Subarray Min-Product","titleSlug":"maximum-subarray-min-product"}
+{"chalengeQuestionDates":["2023-04-09"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1857,"title":"Largest Color Value in a Directed Graph","titleSlug":"largest-color-value-in-a-directed-graph"}
+{"chalengeQuestionDates":["2024-09-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1858,"title":"Longest Word With All Prefixes","titleSlug":"longest-word-with-all-prefixes"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1859,"title":"Sorting the Sentence","titleSlug":"sorting-the-sentence"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1860,"title":"Incremental Memory Leak","titleSlug":"incremental-memory-leak"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1861,"title":"Rotating the Box","titleSlug":"rotating-the-box"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1862,"title":"Sum of Floored Pairs","titleSlug":"sum-of-floored-pairs"}
+{"chalengeQuestionDates":["2024-05-20"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1863,"title":"Sum of All Subset XOR Totals","titleSlug":"sum-of-all-subset-xor-totals"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1864,"title":"Minimum Number of Swaps to Make the Binary String Alternating","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1865,"title":"Finding Pairs With a Certain Sum","titleSlug":"finding-pairs-with-a-certain-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1866,"title":"Number of Ways to Rearrange Sticks With K Sticks Visible","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1867,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1868,"title":"Product of Two Run-Length Encoded Arrays","titleSlug":"product-of-two-run-length-encoded-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1869,"title":"Longer Contiguous Segments of Ones than Zeros","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"}
+{"chalengeQuestionDates":["2023-07-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1870,"title":"Minimum Speed to Arrive on Time","titleSlug":"minimum-speed-to-arrive-on-time"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1871,"title":"Jump Game VII","titleSlug":"jump-game-vii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1872,"title":"Stone Game VIII","titleSlug":"stone-game-viii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1873,"title":"Calculate Special Bonus","titleSlug":"calculate-special-bonus"}
+{"chalengeQuestionDates":["2022-04-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1874,"title":"Minimize Product Sum of Two Arrays","titleSlug":"minimize-product-sum-of-two-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1875,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1876,"title":"Substrings of Size Three with Distinct Characters","titleSlug":"substrings-of-size-three-with-distinct-characters"}
+{"chalengeQuestionDates":["2023-11-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1877,"title":"Minimize Maximum Pair Sum in Array","titleSlug":"minimize-maximum-pair-sum-in-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1878,"title":"Get Biggest Three Rhombus Sums in a Grid","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1879,"title":"Minimum XOR Sum of Two Arrays","titleSlug":"minimum-xor-sum-of-two-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1880,"title":"Check if Word Equals Summation of Two Words","titleSlug":"check-if-word-equals-summation-of-two-words"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1881,"title":"Maximum Value after Insertion","titleSlug":"maximum-value-after-insertion"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1882,"title":"Process Tasks Using Servers","titleSlug":"process-tasks-using-servers"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1883,"title":"Minimum Skips to Arrive at Meeting On Time","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1884,"title":"Egg Drop With 2 Eggs and N Floors","titleSlug":"egg-drop-with-2-eggs-and-n-floors"}
+{"chalengeQuestionDates":["2024-05-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1885,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1886,"title":"Determine Whether Matrix Can Be Obtained By Rotation","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"}
+{"chalengeQuestionDates":["2023-11-19"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1887,"title":"Reduction Operations to Make the Array Elements Equal","titleSlug":"reduction-operations-to-make-the-array-elements-equal"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1888,"title":"Minimum Number of Flips to Make the Binary String Alternating","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1889,"title":"Minimum Space Wasted From Packaging","titleSlug":"minimum-space-wasted-from-packaging"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1890,"title":"The Latest Login in 2020","titleSlug":"the-latest-login-in-2020"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1891,"title":"Cutting Ribbons","titleSlug":"cutting-ribbons"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1892,"title":"Page Recommendations II","titleSlug":"page-recommendations-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1893,"title":"Check if All the Integers in a Range Are Covered","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"}
+{"chalengeQuestionDates":["2024-09-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1894,"title":"Find the Student that Will Replace the Chalk","titleSlug":"find-the-student-that-will-replace-the-chalk"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1895,"title":"Largest Magic Square","titleSlug":"largest-magic-square"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1896,"title":"Minimum Cost to Change the Final Value of Expression","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"}
+{"chalengeQuestionDates":["2023-12-30"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1897,"title":"Redistribute Characters to Make All Strings Equal","titleSlug":"redistribute-characters-to-make-all-strings-equal"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1898,"title":"Maximum Number of Removable Characters","titleSlug":"maximum-number-of-removable-characters"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1899,"title":"Merge Triplets to Form Target Triplet","titleSlug":"merge-triplets-to-form-target-triplet"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1900,"title":"The Earliest and Latest Rounds Where Players Compete","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1901,"title":"Find a Peak Element II","titleSlug":"find-a-peak-element-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1902,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"}
+{"chalengeQuestionDates":["2023-12-07"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1903,"title":"Largest Odd Number in String","titleSlug":"largest-odd-number-in-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1904,"title":"The Number of Full Rounds You Have Played","titleSlug":"the-number-of-full-rounds-you-have-played"}
+{"chalengeQuestionDates":["2024-08-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1905,"title":"Count Sub Islands","titleSlug":"count-sub-islands"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1906,"title":"Minimum Absolute Difference Queries","titleSlug":"minimum-absolute-difference-queries"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1907,"title":"Count Salary Categories","titleSlug":"count-salary-categories"}
+{"chalengeQuestionDates":["2023-01-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1908,"title":"Game of Nim","titleSlug":"game-of-nim"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1909,"title":"Remove One Element to Make the Array Strictly Increasing","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1910,"title":"Remove All Occurrences of a Substring","titleSlug":"remove-all-occurrences-of-a-substring"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1911,"title":"Maximum Alternating Subsequence Sum","titleSlug":"maximum-alternating-subsequence-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1912,"title":"Design Movie Rental System","titleSlug":"design-movie-rental-system"}
+{"chalengeQuestionDates":["2023-12-18"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1913,"title":"Maximum Product Difference Between Two Pairs","titleSlug":"maximum-product-difference-between-two-pairs"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1914,"title":"Cyclically Rotating a Grid","titleSlug":"cyclically-rotating-a-grid"}
+{"chalengeQuestionDates":["2024-04-30"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1915,"title":"Number of Wonderful Substrings","titleSlug":"number-of-wonderful-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1916,"title":"Count Ways to Build Rooms in an Ant Colony","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1917,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1918,"title":"Kth Smallest Subarray Sum","titleSlug":"kth-smallest-subarray-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1919,"title":"Leetcodify Similar Friends","titleSlug":"leetcodify-similar-friends"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1920,"title":"Build Array from Permutation","titleSlug":"build-array-from-permutation"}
+{"chalengeQuestionDates":["2023-11-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1921,"title":"Eliminate Maximum Number of Monsters","titleSlug":"eliminate-maximum-number-of-monsters"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1922,"title":"Count Good Numbers","titleSlug":"count-good-numbers"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1923,"title":"Longest Common Subpath","titleSlug":"longest-common-subpath"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1924,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1925,"title":"Count Square Sum Triples","titleSlug":"count-square-sum-triples"}
+{"chalengeQuestionDates":["2022-11-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1926,"title":"Nearest Exit from Entrance in Maze","titleSlug":"nearest-exit-from-entrance-in-maze"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1927,"title":"Sum Game","titleSlug":"sum-game"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1928,"title":"Minimum Cost to Reach Destination in Time","titleSlug":"minimum-cost-to-reach-destination-in-time"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1929,"title":"Concatenation of Array","titleSlug":"concatenation-of-array"}
+{"chalengeQuestionDates":["2023-11-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1930,"title":"Unique Length-3 Palindromic Subsequences","titleSlug":"unique-length-3-palindromic-subsequences"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1931,"title":"Painting a Grid With Three Different Colors","titleSlug":"painting-a-grid-with-three-different-colors"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1932,"title":"Merge BSTs to Create Single BST","titleSlug":"merge-bsts-to-create-single-bst"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1933,"title":"Check if String Is Decomposable Into Value-Equal Substrings","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1934,"title":"Confirmation Rate","titleSlug":"confirmation-rate"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1935,"title":"Maximum Number of Words You Can Type","titleSlug":"maximum-number-of-words-you-can-type"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1936,"title":"Add Minimum Number of Rungs","titleSlug":"add-minimum-number-of-rungs"}
+{"chalengeQuestionDates":["2024-08-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1937,"title":"Maximum Number of Points with Cost","titleSlug":"maximum-number-of-points-with-cost"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1938,"title":"Maximum Genetic Difference Query","titleSlug":"maximum-genetic-difference-query"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1939,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"}
+{"chalengeQuestionDates":["2024-06-01"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1940,"title":"Longest Common Subsequence Between Sorted Arrays","titleSlug":"longest-common-subsequence-between-sorted-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1941,"title":"Check if All Characters Have Equal Number of Occurrences","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"}
+{"chalengeQuestionDates":["2024-10-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1942,"title":"The Number of the Smallest Unoccupied Chair","titleSlug":"the-number-of-the-smallest-unoccupied-chair"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1943,"title":"Describe the Painting","titleSlug":"describe-the-painting"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1944,"title":"Number of Visible People in a Queue","titleSlug":"number-of-visible-people-in-a-queue"}
+{"chalengeQuestionDates":["2024-09-03"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1945,"title":"Sum of Digits of String After Convert","titleSlug":"sum-of-digits-of-string-after-convert"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1946,"title":"Largest Number After Mutating Substring","titleSlug":"largest-number-after-mutating-substring"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1947,"title":"Maximum Compatibility Score Sum","titleSlug":"maximum-compatibility-score-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1948,"title":"Delete Duplicate Folders in System","titleSlug":"delete-duplicate-folders-in-system"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1949,"title":"Strong Friendship","titleSlug":"strong-friendship"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1950,"title":"Maximum of Minimum Values in All Subarrays","titleSlug":"maximum-of-minimum-values-in-all-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1951,"title":"All the Pairs With the Maximum Number of Common Followers","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1952,"title":"Three Divisors","titleSlug":"three-divisors"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1953,"title":"Maximum Number of Weeks for Which You Can Work","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1954,"title":"Minimum Garden Perimeter to Collect Enough Apples","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1955,"title":"Count Number of Special Subsequences","titleSlug":"count-number-of-special-subsequences"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1956,"title":"Minimum Time For K Virus Variants to Spread","titleSlug":"minimum-time-for-k-virus-variants-to-spread"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1957,"title":"Delete Characters to Make Fancy String","titleSlug":"delete-characters-to-make-fancy-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1958,"title":"Check if Move is Legal","titleSlug":"check-if-move-is-legal"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1959,"title":"Minimum Total Space Wasted With K Resizing Operations","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1960,"title":"Maximum Product of the Length of Two Palindromic Substrings","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1961,"title":"Check If String Is a Prefix of Array","titleSlug":"check-if-string-is-a-prefix-of-array"}
+{"chalengeQuestionDates":["2022-12-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1962,"title":"Remove Stones to Minimize the Total","titleSlug":"remove-stones-to-minimize-the-total"}
+{"chalengeQuestionDates":["2024-10-08"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1963,"title":"Minimum Number of Swaps to Make the String Balanced","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"}
+{"chalengeQuestionDates":["2023-05-07"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1964,"title":"Find the Longest Valid Obstacle Course at Each Position","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1965,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1966,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1967,"title":"Number of Strings That Appear as Substrings in Word","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1968,"title":"Array With Elements Not Equal to Average of Neighbors","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1969,"title":"Minimum Non-Zero Product of the Array Elements","titleSlug":"minimum-non-zero-product-of-the-array-elements"}
+{"chalengeQuestionDates":["2023-06-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1970,"title":"Last Day Where You Can Still Cross","titleSlug":"last-day-where-you-can-still-cross"}
+{"chalengeQuestionDates":["2024-04-21","2022-12-19"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1971,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1972,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"}
+{"chalengeQuestionDates":["2024-02-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1973,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1974,"title":"Minimum Time to Type Word Using Special Typewriter","titleSlug":"minimum-time-to-type-word-using-special-typewriter"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1975,"title":"Maximum Matrix Sum","titleSlug":"maximum-matrix-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1976,"title":"Number of Ways to Arrive at Destination","titleSlug":"number-of-ways-to-arrive-at-destination"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1977,"title":"Number of Ways to Separate Numbers","titleSlug":"number-of-ways-to-separate-numbers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1978,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1979,"title":"Find Greatest Common Divisor of Array","titleSlug":"find-greatest-common-divisor-of-array"}
+{"chalengeQuestionDates":["2023-11-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1980,"title":"Find Unique Binary String","titleSlug":"find-unique-binary-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1981,"title":"Minimize the Difference Between Target and Chosen Elements","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1982,"title":"Find Array Given Subset Sums","titleSlug":"find-array-given-subset-sums"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1983,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1984,"title":"Minimum Difference Between Highest and Lowest of K Scores","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1985,"title":"Find the Kth Largest Integer in the Array","titleSlug":"find-the-kth-largest-integer-in-the-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1986,"title":"Minimum Number of Work Sessions to Finish the Tasks","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1987,"title":"Number of Unique Good Subsequences","titleSlug":"number-of-unique-good-subsequences"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1988,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1989,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1990,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1991,"title":"Find the Middle Index in Array","titleSlug":"find-the-middle-index-in-array"}
+{"chalengeQuestionDates":["2024-04-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1992,"title":"Find All Groups of Farmland","titleSlug":"find-all-groups-of-farmland"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1993,"title":"Operations on Tree","titleSlug":"operations-on-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1994,"title":"The Number of Good Subsets","titleSlug":"the-number-of-good-subsets"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1995,"title":"Count Special Quadruplets","titleSlug":"count-special-quadruplets"}
+{"chalengeQuestionDates":["2022-09-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1996,"title":"The Number of Weak Characters in the Game","titleSlug":"the-number-of-weak-characters-in-the-game"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1997,"title":"First Day Where You Have Been in All the Rooms","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1998,"title":"GCD Sort of an Array","titleSlug":"gcd-sort-of-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1999,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"}
+{"chalengeQuestionDates":["2024-05-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2000,"title":"Reverse Prefix of Word","titleSlug":"reverse-prefix-of-word"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2001,"title":"Number of Pairs of Interchangeable Rectangles","titleSlug":"number-of-pairs-of-interchangeable-rectangles"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2002,"title":"Maximum Product of the Length of Two Palindromic Subsequences","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2003,"title":"Smallest Missing Genetic Value in Each Subtree","titleSlug":"smallest-missing-genetic-value-in-each-subtree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2004,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2005,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2006,"title":"Count Number of Pairs With Absolute Difference K","titleSlug":"count-number-of-pairs-with-absolute-difference-k"}
+{"chalengeQuestionDates":["2022-09-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2007,"title":"Find Original Array From Doubled Array","titleSlug":"find-original-array-from-doubled-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2008,"title":"Maximum Earnings From Taxi","titleSlug":"maximum-earnings-from-taxi"}
+{"chalengeQuestionDates":["2023-10-10"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2009,"title":"Minimum Number of Operations to Make Array Continuous","titleSlug":"minimum-number-of-operations-to-make-array-continuous"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2010,"title":"The Number of Seniors and Juniors to Join the Company II","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2011,"title":"Final Value of Variable After Performing Operations","titleSlug":"final-value-of-variable-after-performing-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2012,"title":"Sum of Beauty in the Array","titleSlug":"sum-of-beauty-in-the-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2013,"title":"Detect Squares","titleSlug":"detect-squares"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2014,"title":"Longest Subsequence Repeated k Times","titleSlug":"longest-subsequence-repeated-k-times"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2015,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2016,"title":"Maximum Difference Between Increasing Elements","titleSlug":"maximum-difference-between-increasing-elements"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2017,"title":"Grid Game","titleSlug":"grid-game"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2018,"title":"Check if Word Can Be Placed In Crossword","titleSlug":"check-if-word-can-be-placed-in-crossword"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2019,"title":"The Score of Students Solving Math Expression","titleSlug":"the-score-of-students-solving-math-expression"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2020,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2021,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"}
+{"chalengeQuestionDates":["2024-09-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2022,"title":"Convert 1D Array Into 2D Array","titleSlug":"convert-1d-array-into-2d-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2023,"title":"Number of Pairs of Strings With Concatenation Equal to Target","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"}
+{"chalengeQuestionDates":["2023-07-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2024,"title":"Maximize the Confusion of an Exam","titleSlug":"maximize-the-confusion-of-an-exam"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2025,"title":"Maximum Number of Ways to Partition an Array","titleSlug":"maximum-number-of-ways-to-partition-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2026,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2027,"title":"Minimum Moves to Convert String","titleSlug":"minimum-moves-to-convert-string"}
+{"chalengeQuestionDates":["2024-09-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2028,"title":"Find Missing Observations","titleSlug":"find-missing-observations"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2029,"title":"Stone Game IX","titleSlug":"stone-game-ix"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2030,"title":"Smallest K-Length Subsequence With Occurrences of a Letter","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2031,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2032,"title":"Two Out of Three","titleSlug":"two-out-of-three"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2033,"title":"Minimum Operations to Make a Uni-Value Grid","titleSlug":"minimum-operations-to-make-a-uni-value-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2034,"title":"Stock Price Fluctuation","titleSlug":"stock-price-fluctuation"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2035,"title":"Partition Array Into Two Arrays to Minimize Sum Difference","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2036,"title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum"}
+{"chalengeQuestionDates":["2024-06-13"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2037,"title":"Minimum Number of Moves to Seat Everyone","titleSlug":"minimum-number-of-moves-to-seat-everyone"}
+{"chalengeQuestionDates":["2023-10-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2038,"title":"Remove Colored Pieces if Both Neighbors are the Same Color","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2039,"title":"The Time When the Network Becomes Idle","titleSlug":"the-time-when-the-network-becomes-idle"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2040,"title":"Kth Smallest Product of Two Sorted Arrays","titleSlug":"kth-smallest-product-of-two-sorted-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2041,"title":"Accepted Candidates From the Interviews","titleSlug":"accepted-candidates-from-the-interviews"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2042,"title":"Check if Numbers Are Ascending in a Sentence","titleSlug":"check-if-numbers-are-ascending-in-a-sentence"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2043,"title":"Simple Bank System","titleSlug":"simple-bank-system"}
+{"chalengeQuestionDates":["2024-10-18"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2044,"title":"Count Number of Maximum Bitwise-OR Subsets","titleSlug":"count-number-of-maximum-bitwise-or-subsets"}
+{"chalengeQuestionDates":["2024-07-28"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2045,"title":"Second Minimum Time to Reach Destination","titleSlug":"second-minimum-time-to-reach-destination"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2046,"title":"Sort Linked List Already Sorted Using Absolute Values","titleSlug":"sort-linked-list-already-sorted-using-absolute-values"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2047,"title":"Number of Valid Words in a Sentence","titleSlug":"number-of-valid-words-in-a-sentence"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2048,"title":"Next Greater Numerically Balanced Number","titleSlug":"next-greater-numerically-balanced-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2049,"title":"Count Nodes With the Highest Score","titleSlug":"count-nodes-with-the-highest-score"}
+{"chalengeQuestionDates":["2023-10-18"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2050,"title":"Parallel Courses III","titleSlug":"parallel-courses-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2051,"title":"The Category of Each Member in the Store","titleSlug":"the-category-of-each-member-in-the-store"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2052,"title":"Minimum Cost to Separate Sentence Into Rows","titleSlug":"minimum-cost-to-separate-sentence-into-rows"}
+{"chalengeQuestionDates":["2024-08-05"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2053,"title":"Kth Distinct String in an Array","titleSlug":"kth-distinct-string-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2054,"title":"Two Best Non-Overlapping Events","titleSlug":"two-best-non-overlapping-events"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2055,"title":"Plates Between Candles","titleSlug":"plates-between-candles"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2056,"title":"Number of Valid Move Combinations On Chessboard","titleSlug":"number-of-valid-move-combinations-on-chessboard"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2057,"title":"Smallest Index With Equal Value","titleSlug":"smallest-index-with-equal-value"}
+{"chalengeQuestionDates":["2024-07-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2058,"title":"Find the Minimum and Maximum Number of Nodes Between Critical Points","titleSlug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2059,"title":"Minimum Operations to Convert Number","titleSlug":"minimum-operations-to-convert-number"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2060,"title":"Check if an Original String Exists Given Two Encoded Strings","titleSlug":"check-if-an-original-string-exists-given-two-encoded-strings"}
+{"chalengeQuestionDates":["2024-05-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2061,"title":"Number of Spaces Cleaning Robot Cleaned","titleSlug":"number-of-spaces-cleaning-robot-cleaned"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2062,"title":"Count Vowel Substrings of a String","titleSlug":"count-vowel-substrings-of-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2063,"title":"Vowels of All Substrings","titleSlug":"vowels-of-all-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2064,"title":"Minimized Maximum of Products Distributed to Any Store","titleSlug":"minimized-maximum-of-products-distributed-to-any-store"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2065,"title":"Maximum Path Quality of a Graph","titleSlug":"maximum-path-quality-of-a-graph"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2066,"title":"Account Balance","titleSlug":"account-balance"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2067,"title":"Number of Equal Count Substrings","titleSlug":"number-of-equal-count-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2068,"title":"Check Whether Two Strings are Almost Equivalent","titleSlug":"check-whether-two-strings-are-almost-equivalent"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2069,"title":"Walking Robot Simulation II","titleSlug":"walking-robot-simulation-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2070,"title":"Most Beautiful Item for Each Query","titleSlug":"most-beautiful-item-for-each-query"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2071,"title":"Maximum Number of Tasks You Can Assign","titleSlug":"maximum-number-of-tasks-you-can-assign"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2072,"title":"The Winner University","titleSlug":"the-winner-university"}
+{"chalengeQuestionDates":["2024-04-09"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2073,"title":"Time Needed to Buy Tickets","titleSlug":"time-needed-to-buy-tickets"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2074,"title":"Reverse Nodes in Even Length Groups","titleSlug":"reverse-nodes-in-even-length-groups"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2075,"title":"Decode the Slanted Ciphertext","titleSlug":"decode-the-slanted-ciphertext"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2076,"title":"Process Restricted Friend Requests","titleSlug":"process-restricted-friend-requests"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2077,"title":"Paths in Maze That Lead to Same Room","titleSlug":"paths-in-maze-that-lead-to-same-room"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2078,"title":"Two Furthest Houses With Different Colors","titleSlug":"two-furthest-houses-with-different-colors"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2079,"title":"Watering Plants","titleSlug":"watering-plants"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2080,"title":"Range Frequency Queries","titleSlug":"range-frequency-queries"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2081,"title":"Sum of k-Mirror Numbers","titleSlug":"sum-of-k-mirror-numbers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2082,"title":"The Number of Rich Customers","titleSlug":"the-number-of-rich-customers"}
+{"chalengeQuestionDates":["2024-06-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2083,"title":"Substrings That Begin and End With the Same Letter","titleSlug":"substrings-that-begin-and-end-with-the-same-letter"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2084,"title":"Drop Type 1 Orders for Customers With Type 0 Orders","titleSlug":"drop-type-1-orders-for-customers-with-type-0-orders"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2085,"title":"Count Common Words With One Occurrence","titleSlug":"count-common-words-with-one-occurrence"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2086,"title":"Minimum Number of Food Buckets to Feed the Hamsters","titleSlug":"minimum-number-of-food-buckets-to-feed-the-hamsters"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2087,"title":"Minimum Cost Homecoming of a Robot in a Grid","titleSlug":"minimum-cost-homecoming-of-a-robot-in-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2088,"title":"Count Fertile Pyramids in a Land","titleSlug":"count-fertile-pyramids-in-a-land"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2089,"title":"Find Target Indices After Sorting Array","titleSlug":"find-target-indices-after-sorting-array"}
+{"chalengeQuestionDates":["2023-06-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2090,"title":"K Radius Subarray Averages","titleSlug":"k-radius-subarray-averages"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2091,"title":"Removing Minimum and Maximum From Array","titleSlug":"removing-minimum-and-maximum-from-array"}
+{"chalengeQuestionDates":["2024-02-24"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2092,"title":"Find All People With Secret","titleSlug":"find-all-people-with-secret"}
+{"chalengeQuestionDates":["2024-07-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2093,"title":"Minimum Cost to Reach City With Discounts","titleSlug":"minimum-cost-to-reach-city-with-discounts"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2094,"title":"Finding 3-Digit Even Numbers","titleSlug":"finding-3-digit-even-numbers"}
+{"chalengeQuestionDates":["2022-10-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2095,"title":"Delete the Middle Node of a Linked List","titleSlug":"delete-the-middle-node-of-a-linked-list"}
+{"chalengeQuestionDates":["2024-07-16"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2096,"title":"Step-By-Step Directions From a Binary Tree Node to Another","titleSlug":"step-by-step-directions-from-a-binary-tree-node-to-another"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2097,"title":"Valid Arrangement of Pairs","titleSlug":"valid-arrangement-of-pairs"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2098,"title":"Subsequence of Size K With the Largest Even Sum","titleSlug":"subsequence-of-size-k-with-the-largest-even-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2099,"title":"Find Subsequence of Length K With the Largest Sum","titleSlug":"find-subsequence-of-length-k-with-the-largest-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2100,"title":"Find Good Days to Rob the Bank","titleSlug":"find-good-days-to-rob-the-bank"}
+{"chalengeQuestionDates":["2023-06-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2101,"title":"Detonate the Maximum Bombs","titleSlug":"detonate-the-maximum-bombs"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2102,"title":"Sequentially Ordinal Rank Tracker","titleSlug":"sequentially-ordinal-rank-tracker"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2103,"title":"Rings and Rods","titleSlug":"rings-and-rods"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2104,"title":"Sum of Subarray Ranges","titleSlug":"sum-of-subarray-ranges"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2105,"title":"Watering Plants II","titleSlug":"watering-plants-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2106,"title":"Maximum Fruits Harvested After at Most K Steps","titleSlug":"maximum-fruits-harvested-after-at-most-k-steps"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2107,"title":"Number of Unique Flavors After Sharing K Candies","titleSlug":"number-of-unique-flavors-after-sharing-k-candies"}
+{"chalengeQuestionDates":["2024-02-13"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2108,"title":"Find First Palindromic String in the Array","titleSlug":"find-first-palindromic-string-in-the-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2109,"title":"Adding Spaces to a String","titleSlug":"adding-spaces-to-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2110,"title":"Number of Smooth Descent Periods of a Stock","titleSlug":"number-of-smooth-descent-periods-of-a-stock"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2111,"title":"Minimum Operations to Make the Array K-Increasing","titleSlug":"minimum-operations-to-make-the-array-k-increasing"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2112,"title":"The Airport With the Most Traffic","titleSlug":"the-airport-with-the-most-traffic"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2113,"title":"Elements in Array After Removing and Replacing Elements","titleSlug":"elements-in-array-after-removing-and-replacing-elements"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2114,"title":"Maximum Number of Words Found in Sentences","titleSlug":"maximum-number-of-words-found-in-sentences"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2115,"title":"Find All Possible Recipes from Given Supplies","titleSlug":"find-all-possible-recipes-from-given-supplies"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2116,"title":"Check if a Parentheses String Can Be Valid","titleSlug":"check-if-a-parentheses-string-can-be-valid"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2117,"title":"Abbreviating the Product of a Range","titleSlug":"abbreviating-the-product-of-a-range"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2118,"title":"Build the Equation","titleSlug":"build-the-equation"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2119,"title":"A Number After a Double Reversal","titleSlug":"a-number-after-a-double-reversal"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2120,"title":"Execution of All Suffix Instructions Staying in a Grid","titleSlug":"execution-of-all-suffix-instructions-staying-in-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2121,"title":"Intervals Between Identical Elements","titleSlug":"intervals-between-identical-elements"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2122,"title":"Recover the Original Array","titleSlug":"recover-the-original-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2123,"title":"Minimum Operations to Remove Adjacent Ones in Matrix","titleSlug":"minimum-operations-to-remove-adjacent-ones-in-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2124,"title":"Check if All A's Appears Before All B's","titleSlug":"check-if-all-as-appears-before-all-bs"}
+{"chalengeQuestionDates":["2024-01-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2125,"title":"Number of Laser Beams in a Bank","titleSlug":"number-of-laser-beams-in-a-bank"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2126,"title":"Destroying Asteroids","titleSlug":"destroying-asteroids"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2127,"title":"Maximum Employees to Be Invited to a Meeting","titleSlug":"maximum-employees-to-be-invited-to-a-meeting"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2128,"title":"Remove All Ones With Row and Column Flips","titleSlug":"remove-all-ones-with-row-and-column-flips"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2129,"title":"Capitalize the Title","titleSlug":"capitalize-the-title"}
+{"chalengeQuestionDates":["2023-05-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2130,"title":"Maximum Twin Sum of a Linked List","titleSlug":"maximum-twin-sum-of-a-linked-list"}
+{"chalengeQuestionDates":["2022-11-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2131,"title":"Longest Palindrome by Concatenating Two Letter Words","titleSlug":"longest-palindrome-by-concatenating-two-letter-words"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2132,"title":"Stamping the Grid","titleSlug":"stamping-the-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2133,"title":"Check if Every Row and Column Contains All Numbers","titleSlug":"check-if-every-row-and-column-contains-all-numbers"}
+{"chalengeQuestionDates":["2024-08-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2134,"title":"Minimum Swaps to Group All 1's Together II","titleSlug":"minimum-swaps-to-group-all-1s-together-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2135,"title":"Count Words Obtained After Adding a Letter","titleSlug":"count-words-obtained-after-adding-a-letter"}
+{"chalengeQuestionDates":["2022-10-29"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2136,"title":"Earliest Possible Day of Full Bloom","titleSlug":"earliest-possible-day-of-full-bloom"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2137,"title":"Pour Water Between Buckets to Make Water Levels Equal","titleSlug":"pour-water-between-buckets-to-make-water-levels-equal"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2138,"title":"Divide a String Into Groups of Size k","titleSlug":"divide-a-string-into-groups-of-size-k"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2139,"title":"Minimum Moves to Reach Target Score","titleSlug":"minimum-moves-to-reach-target-score"}
+{"chalengeQuestionDates":["2023-05-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2140,"title":"Solving Questions With Brainpower","titleSlug":"solving-questions-with-brainpower"}
+{"chalengeQuestionDates":["2023-07-27"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2141,"title":"Maximum Running Time of N Computers","titleSlug":"maximum-running-time-of-n-computers"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2142,"title":"The Number of Passengers in Each Bus I","titleSlug":"the-number-of-passengers-in-each-bus-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2143,"title":"Choose Numbers From Two Arrays in Range","titleSlug":"choose-numbers-from-two-arrays-in-range"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2144,"title":"Minimum Cost of Buying Candies With Discount","titleSlug":"minimum-cost-of-buying-candies-with-discount"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2145,"title":"Count the Hidden Sequences","titleSlug":"count-the-hidden-sequences"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2146,"title":"K Highest Ranked Items Within a Price Range","titleSlug":"k-highest-ranked-items-within-a-price-range"}
+{"chalengeQuestionDates":["2023-11-28"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2147,"title":"Number of Ways to Divide a Long Corridor","titleSlug":"number-of-ways-to-divide-a-long-corridor"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2148,"title":"Count Elements With Strictly Smaller and Greater Elements","titleSlug":"count-elements-with-strictly-smaller-and-greater-elements"}
+{"chalengeQuestionDates":["2024-02-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2149,"title":"Rearrange Array Elements by Sign","titleSlug":"rearrange-array-elements-by-sign"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2150,"title":"Find All Lonely Numbers in the Array","titleSlug":"find-all-lonely-numbers-in-the-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2151,"title":"Maximum Good People Based on Statements","titleSlug":"maximum-good-people-based-on-statements"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2152,"title":"Minimum Number of Lines to Cover Points","titleSlug":"minimum-number-of-lines-to-cover-points"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2153,"title":"The Number of Passengers in Each Bus II","titleSlug":"the-number-of-passengers-in-each-bus-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2154,"title":"Keep Multiplying Found Values by Two","titleSlug":"keep-multiplying-found-values-by-two"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2155,"title":"All Divisions With the Highest Score of a Binary Array","titleSlug":"all-divisions-with-the-highest-score-of-a-binary-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2156,"title":"Find Substring With Given Hash Value","titleSlug":"find-substring-with-given-hash-value"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2157,"title":"Groups of Strings","titleSlug":"groups-of-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2158,"title":"Amount of New Area Painted Each Day","titleSlug":"amount-of-new-area-painted-each-day"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2159,"title":"Order Two Columns Independently","titleSlug":"order-two-columns-independently"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2160,"title":"Minimum Sum of Four Digit Number After Splitting Digits","titleSlug":"minimum-sum-of-four-digit-number-after-splitting-digits"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2161,"title":"Partition Array According to Given Pivot","titleSlug":"partition-array-according-to-given-pivot"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2162,"title":"Minimum Cost to Set Cooking Time","titleSlug":"minimum-cost-to-set-cooking-time"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2163,"title":"Minimum Difference in Sums After Removal of Elements","titleSlug":"minimum-difference-in-sums-after-removal-of-elements"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2164,"title":"Sort Even and Odd Indices Independently","titleSlug":"sort-even-and-odd-indices-independently"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2165,"title":"Smallest Value of the Rearranged Number","titleSlug":"smallest-value-of-the-rearranged-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2166,"title":"Design Bitset","titleSlug":"design-bitset"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2167,"title":"Minimum Time to Remove All Cars Containing Illegal Goods","titleSlug":"minimum-time-to-remove-all-cars-containing-illegal-goods"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2168,"title":"Unique Substrings With Equal Digit Frequency","titleSlug":"unique-substrings-with-equal-digit-frequency"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2169,"title":"Count Operations to Obtain Zero","titleSlug":"count-operations-to-obtain-zero"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2170,"title":"Minimum Operations to Make the Array Alternating","titleSlug":"minimum-operations-to-make-the-array-alternating"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2171,"title":"Removing Minimum Number of Magic Beans","titleSlug":"removing-minimum-number-of-magic-beans"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2172,"title":"Maximum AND Sum of Array","titleSlug":"maximum-and-sum-of-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2173,"title":"Longest Winning Streak","titleSlug":"longest-winning-streak"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2174,"title":"Remove All Ones With Row and Column Flips II","titleSlug":"remove-all-ones-with-row-and-column-flips-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2175,"title":"The Change in Global Rankings","titleSlug":"the-change-in-global-rankings"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2176,"title":"Count Equal and Divisible Pairs in an Array","titleSlug":"count-equal-and-divisible-pairs-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2177,"title":"Find Three Consecutive Integers That Sum to a Given Number","titleSlug":"find-three-consecutive-integers-that-sum-to-a-given-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2178,"title":"Maximum Split of Positive Even Integers","titleSlug":"maximum-split-of-positive-even-integers"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2179,"title":"Count Good Triplets in an Array","titleSlug":"count-good-triplets-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2180,"title":"Count Integers With Even Digit Sum","titleSlug":"count-integers-with-even-digit-sum"}
+{"chalengeQuestionDates":["2024-07-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2181,"title":"Merge Nodes in Between Zeros","titleSlug":"merge-nodes-in-between-zeros"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2182,"title":"Construct String With Repeat Limit","titleSlug":"construct-string-with-repeat-limit"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2183,"title":"Count Array Pairs Divisible by K","titleSlug":"count-array-pairs-divisible-by-k"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2184,"title":"Number of Ways to Build Sturdy Brick Wall","titleSlug":"number-of-ways-to-build-sturdy-brick-wall"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2185,"title":"Counting Words With a Given Prefix","titleSlug":"counting-words-with-a-given-prefix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2186,"title":"Minimum Number of Steps to Make Two Strings Anagram II","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram-ii"}
+{"chalengeQuestionDates":["2023-03-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2187,"title":"Minimum Time to Complete Trips","titleSlug":"minimum-time-to-complete-trips"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2188,"title":"Minimum Time to Finish the Race","titleSlug":"minimum-time-to-finish-the-race"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2189,"title":"Number of Ways to Build House of Cards","titleSlug":"number-of-ways-to-build-house-of-cards"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2190,"title":"Most Frequent Number Following Key In an Array","titleSlug":"most-frequent-number-following-key-in-an-array"}
+{"chalengeQuestionDates":["2024-07-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2191,"title":"Sort the Jumbled Numbers","titleSlug":"sort-the-jumbled-numbers"}
+{"chalengeQuestionDates":["2024-06-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2192,"title":"All Ancestors of a Node in a Directed Acyclic Graph","titleSlug":"all-ancestors-of-a-node-in-a-directed-acyclic-graph"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2193,"title":"Minimum Number of Moves to Make Palindrome","titleSlug":"minimum-number-of-moves-to-make-palindrome"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2194,"title":"Cells in a Range on an Excel Sheet","titleSlug":"cells-in-a-range-on-an-excel-sheet"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2195,"title":"Append K Integers With Minimal Sum","titleSlug":"append-k-integers-with-minimal-sum"}
+{"chalengeQuestionDates":["2024-07-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2196,"title":"Create Binary Tree From Descriptions","titleSlug":"create-binary-tree-from-descriptions"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2197,"title":"Replace Non-Coprime Numbers in Array","titleSlug":"replace-non-coprime-numbers-in-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2198,"title":"Number of Single Divisor Triplets","titleSlug":"number-of-single-divisor-triplets"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2199,"title":"Finding the Topic of Each Post","titleSlug":"finding-the-topic-of-each-post"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2200,"title":"Find All K-Distant Indices in an Array","titleSlug":"find-all-k-distant-indices-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2201,"title":"Count Artifacts That Can Be Extracted","titleSlug":"count-artifacts-that-can-be-extracted"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2202,"title":"Maximize the Topmost Element After K Moves","titleSlug":"maximize-the-topmost-element-after-k-moves"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2203,"title":"Minimum Weighted Subgraph With the Required Paths","titleSlug":"minimum-weighted-subgraph-with-the-required-paths"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2204,"title":"Distance to a Cycle in Undirected Graph","titleSlug":"distance-to-a-cycle-in-undirected-graph"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2205,"title":"The Number of Users That Are Eligible for Discount","titleSlug":"the-number-of-users-that-are-eligible-for-discount"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2206,"title":"Divide Array Into Equal Pairs","titleSlug":"divide-array-into-equal-pairs"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2207,"title":"Maximize Number of Subsequences in a String","titleSlug":"maximize-number-of-subsequences-in-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2208,"title":"Minimum Operations to Halve Array Sum","titleSlug":"minimum-operations-to-halve-array-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2209,"title":"Minimum White Tiles After Covering With Carpets","titleSlug":"minimum-white-tiles-after-covering-with-carpets"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2210,"title":"Count Hills and Valleys in an Array","titleSlug":"count-hills-and-valleys-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2211,"title":"Count Collisions on a Road","titleSlug":"count-collisions-on-a-road"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2212,"title":"Maximum Points in an Archery Competition","titleSlug":"maximum-points-in-an-archery-competition"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2213,"title":"Longest Substring of One Repeating Character","titleSlug":"longest-substring-of-one-repeating-character"}
+{"chalengeQuestionDates":["2023-01-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2214,"title":"Minimum Health to Beat Game","titleSlug":"minimum-health-to-beat-game"}
+{"chalengeQuestionDates":["2023-05-03"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2215,"title":"Find the Difference of Two Arrays","titleSlug":"find-the-difference-of-two-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2216,"title":"Minimum Deletions to Make Array Beautiful","titleSlug":"minimum-deletions-to-make-array-beautiful"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2217,"title":"Find Palindrome With Fixed Length","titleSlug":"find-palindrome-with-fixed-length"}
+{"chalengeQuestionDates":["2023-04-15"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2218,"title":"Maximum Value of K Coins From Piles","titleSlug":"maximum-value-of-k-coins-from-piles"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2219,"title":"Maximum Sum Score of Array","titleSlug":"maximum-sum-score-of-array"}
+{"chalengeQuestionDates":["2024-09-11"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2220,"title":"Minimum Bit Flips to Convert Number","titleSlug":"minimum-bit-flips-to-convert-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2221,"title":"Find Triangular Sum of an Array","titleSlug":"find-triangular-sum-of-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2222,"title":"Number of Ways to Select Buildings","titleSlug":"number-of-ways-to-select-buildings"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2223,"title":"Sum of Scores of Built Strings","titleSlug":"sum-of-scores-of-built-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2224,"title":"Minimum Number of Operations to Convert Time","titleSlug":"minimum-number-of-operations-to-convert-time"}
+{"chalengeQuestionDates":["2024-01-15","2022-11-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2225,"title":"Find Players With Zero or One Losses","titleSlug":"find-players-with-zero-or-one-losses"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2226,"title":"Maximum Candies Allocated to K Children","titleSlug":"maximum-candies-allocated-to-k-children"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2227,"title":"Encrypt and Decrypt Strings","titleSlug":"encrypt-and-decrypt-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2228,"title":"Users With Two Purchases Within Seven Days","titleSlug":"users-with-two-purchases-within-seven-days"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2229,"title":"Check if an Array Is Consecutive","titleSlug":"check-if-an-array-is-consecutive"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2230,"title":"The Users That Are Eligible for Discount","titleSlug":"the-users-that-are-eligible-for-discount"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2231,"title":"Largest Number After Digit Swaps by Parity","titleSlug":"largest-number-after-digit-swaps-by-parity"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2232,"title":"Minimize Result by Adding Parentheses to Expression","titleSlug":"minimize-result-by-adding-parentheses-to-expression"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2233,"title":"Maximum Product After K Increments","titleSlug":"maximum-product-after-k-increments"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2234,"title":"Maximum Total Beauty of the Gardens","titleSlug":"maximum-total-beauty-of-the-gardens"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2235,"title":"Add Two Integers","titleSlug":"add-two-integers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2236,"title":"Root Equals Sum of Children","titleSlug":"root-equals-sum-of-children"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2237,"title":"Count Positions on Street With Required Brightness","titleSlug":"count-positions-on-street-with-required-brightness"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2238,"title":"Number of Times a Driver Was a Passenger","titleSlug":"number-of-times-a-driver-was-a-passenger"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2239,"title":"Find Closest Number to Zero","titleSlug":"find-closest-number-to-zero"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2240,"title":"Number of Ways to Buy Pens and Pencils","titleSlug":"number-of-ways-to-buy-pens-and-pencils"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2241,"title":"Design an ATM Machine","titleSlug":"design-an-atm-machine"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2242,"title":"Maximum Score of a Node Sequence","titleSlug":"maximum-score-of-a-node-sequence"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2243,"title":"Calculate Digit Sum of a String","titleSlug":"calculate-digit-sum-of-a-string"}
+{"chalengeQuestionDates":["2023-01-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2244,"title":"Minimum Rounds to Complete All Tasks","titleSlug":"minimum-rounds-to-complete-all-tasks"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2245,"title":"Maximum Trailing Zeros in a Cornered Path","titleSlug":"maximum-trailing-zeros-in-a-cornered-path"}
+{"chalengeQuestionDates":["2023-01-13"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2246,"title":"Longest Path With Different Adjacent Characters","titleSlug":"longest-path-with-different-adjacent-characters"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2247,"title":"Maximum Cost of Trip With K Highways","titleSlug":"maximum-cost-of-trip-with-k-highways"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2248,"title":"Intersection of Multiple Arrays","titleSlug":"intersection-of-multiple-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2249,"title":"Count Lattice Points Inside a Circle","titleSlug":"count-lattice-points-inside-a-circle"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2250,"title":"Count Number of Rectangles Containing Each Point","titleSlug":"count-number-of-rectangles-containing-each-point"}
+{"chalengeQuestionDates":["2023-10-11"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2251,"title":"Number of Flowers in Full Bloom","titleSlug":"number-of-flowers-in-full-bloom"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2252,"title":"Dynamic Pivoting of a Table","titleSlug":"dynamic-pivoting-of-a-table"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2253,"title":"Dynamic Unpivoting of a Table","titleSlug":"dynamic-unpivoting-of-a-table"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2254,"title":"Design Video Sharing Platform","titleSlug":"design-video-sharing-platform"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2255,"title":"Count Prefixes of a Given String","titleSlug":"count-prefixes-of-a-given-string"}
+{"chalengeQuestionDates":["2022-12-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2256,"title":"Minimum Average Difference","titleSlug":"minimum-average-difference"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2257,"title":"Count Unguarded Cells in the Grid","titleSlug":"count-unguarded-cells-in-the-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2258,"title":"Escape the Spreading Fire","titleSlug":"escape-the-spreading-fire"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2259,"title":"Remove Digit From Number to Maximize Result","titleSlug":"remove-digit-from-number-to-maximize-result"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2260,"title":"Minimum Consecutive Cards to Pick Up","titleSlug":"minimum-consecutive-cards-to-pick-up"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2261,"title":"K Divisible Elements Subarrays","titleSlug":"k-divisible-elements-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2262,"title":"Total Appeal of A String","titleSlug":"total-appeal-of-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2263,"title":"Make Array Non-decreasing or Non-increasing","titleSlug":"make-array-non-decreasing-or-non-increasing"}
+{"chalengeQuestionDates":["2023-12-04"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2264,"title":"Largest 3-Same-Digit Number in String","titleSlug":"largest-3-same-digit-number-in-string"}
+{"chalengeQuestionDates":["2023-11-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2265,"title":"Count Nodes Equal to Average of Subtree","titleSlug":"count-nodes-equal-to-average-of-subtree"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2266,"title":"Count Number of Texts","titleSlug":"count-number-of-texts"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2267,"title":"Check if There Is a Valid Parentheses String Path","titleSlug":"check-if-there-is-a-valid-parentheses-string-path"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2268,"title":"Minimum Number of Keypresses","titleSlug":"minimum-number-of-keypresses"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2269,"title":"Find the K-Beauty of a Number","titleSlug":"find-the-k-beauty-of-a-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2270,"title":"Number of Ways to Split Array","titleSlug":"number-of-ways-to-split-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2271,"title":"Maximum White Tiles Covered by a Carpet","titleSlug":"maximum-white-tiles-covered-by-a-carpet"}
+{"chalengeQuestionDates":["2023-07-09"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2272,"title":"Substring With Largest Variance","titleSlug":"substring-with-largest-variance"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2273,"title":"Find Resultant Array After Removing Anagrams","titleSlug":"find-resultant-array-after-removing-anagrams"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2274,"title":"Maximum Consecutive Floors Without Special Floors","titleSlug":"maximum-consecutive-floors-without-special-floors"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2275,"title":"Largest Combination With Bitwise AND Greater Than Zero","titleSlug":"largest-combination-with-bitwise-and-greater-than-zero"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2276,"title":"Count Integers in Intervals","titleSlug":"count-integers-in-intervals"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2277,"title":"Closest Node to Path in Tree","titleSlug":"closest-node-to-path-in-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2278,"title":"Percentage of Letter in String","titleSlug":"percentage-of-letter-in-string"}
+{"chalengeQuestionDates":["2022-12-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2279,"title":"Maximum Bags With Full Capacity of Rocks","titleSlug":"maximum-bags-with-full-capacity-of-rocks"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2280,"title":"Minimum Lines to Represent a Line Chart","titleSlug":"minimum-lines-to-represent-a-line-chart"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2281,"title":"Sum of Total Strength of Wizards","titleSlug":"sum-of-total-strength-of-wizards"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2282,"title":"Number of People That Can Be Seen in a Grid","titleSlug":"number-of-people-that-can-be-seen-in-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2283,"title":"Check if Number Has Equal Digit Count and Digit Value","titleSlug":"check-if-number-has-equal-digit-count-and-digit-value"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2284,"title":"Sender With Largest Word Count","titleSlug":"sender-with-largest-word-count"}
+{"chalengeQuestionDates":["2024-06-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2285,"title":"Maximum Total Importance of Roads","titleSlug":"maximum-total-importance-of-roads"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2286,"title":"Booking Concert Tickets in Groups","titleSlug":"booking-concert-tickets-in-groups"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2287,"title":"Rearrange Characters to Make Target String","titleSlug":"rearrange-characters-to-make-target-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2288,"title":"Apply Discount to Prices","titleSlug":"apply-discount-to-prices"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2289,"title":"Steps to Make Array Non-decreasing","titleSlug":"steps-to-make-array-non-decreasing"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2290,"title":"Minimum Obstacle Removal to Reach Corner","titleSlug":"minimum-obstacle-removal-to-reach-corner"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2291,"title":"Maximum Profit From Trading Stocks","titleSlug":"maximum-profit-from-trading-stocks"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2292,"title":"Products With Three or More Orders in Two Consecutive Years","titleSlug":"products-with-three-or-more-orders-in-two-consecutive-years"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2293,"title":"Min Max Game","titleSlug":"min-max-game"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2294,"title":"Partition Array Such That Maximum Difference Is K","titleSlug":"partition-array-such-that-maximum-difference-is-k"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2295,"title":"Replace Elements in an Array","titleSlug":"replace-elements-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2296,"title":"Design a Text Editor","titleSlug":"design-a-text-editor"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2297,"title":"Jump Game VIII","titleSlug":"jump-game-viii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2298,"title":"Tasks Count in the Weekend","titleSlug":"tasks-count-in-the-weekend"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2299,"title":"Strong Password Checker II","titleSlug":"strong-password-checker-ii"}
+{"chalengeQuestionDates":["2023-04-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2300,"title":"Successful Pairs of Spells and Potions","titleSlug":"successful-pairs-of-spells-and-potions"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2301,"title":"Match Substring After Replacement","titleSlug":"match-substring-after-replacement"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2302,"title":"Count Subarrays With Score Less Than K","titleSlug":"count-subarrays-with-score-less-than-k"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2303,"title":"Calculate Amount Paid in Taxes","titleSlug":"calculate-amount-paid-in-taxes"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2304,"title":"Minimum Path Cost in a Grid","titleSlug":"minimum-path-cost-in-a-grid"}
+{"chalengeQuestionDates":["2023-07-01"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2305,"title":"Fair Distribution of Cookies","titleSlug":"fair-distribution-of-cookies"}
+{"chalengeQuestionDates":["2023-02-09"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2306,"title":"Naming a Company","titleSlug":"naming-a-company"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2307,"title":"Check for Contradictions in Equations","titleSlug":"check-for-contradictions-in-equations"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2308,"title":"Arrange Table by Gender","titleSlug":"arrange-table-by-gender"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2309,"title":"Greatest English Letter in Upper and Lower Case","titleSlug":"greatest-english-letter-in-upper-and-lower-case"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2310,"title":"Sum of Numbers With Units Digit K","titleSlug":"sum-of-numbers-with-units-digit-k"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2311,"title":"Longest Binary Subsequence Less Than or Equal to K","titleSlug":"longest-binary-subsequence-less-than-or-equal-to-k"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2312,"title":"Selling Pieces of Wood","titleSlug":"selling-pieces-of-wood"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2313,"title":"Minimum Flips in Binary Tree to Get Result","titleSlug":"minimum-flips-in-binary-tree-to-get-result"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2314,"title":"The First Day of the Maximum Recorded Degree in Each City","titleSlug":"the-first-day-of-the-maximum-recorded-degree-in-each-city"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2315,"title":"Count Asterisks","titleSlug":"count-asterisks"}
+{"chalengeQuestionDates":["2023-03-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2316,"title":"Count Unreachable Pairs of Nodes in an Undirected Graph","titleSlug":"count-unreachable-pairs-of-nodes-in-an-undirected-graph"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2317,"title":"Maximum XOR After Operations","titleSlug":"maximum-xor-after-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2318,"title":"Number of Distinct Roll Sequences","titleSlug":"number-of-distinct-roll-sequences"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2319,"title":"Check if Matrix Is X-Matrix","titleSlug":"check-if-matrix-is-x-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2320,"title":"Count Number of Ways to Place Houses","titleSlug":"count-number-of-ways-to-place-houses"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2321,"title":"Maximum Score Of Spliced Array","titleSlug":"maximum-score-of-spliced-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2322,"title":"Minimum Score After Removals on a Tree","titleSlug":"minimum-score-after-removals-on-a-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2323,"title":"Find Minimum Time to Finish All Jobs II","titleSlug":"find-minimum-time-to-finish-all-jobs-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2324,"title":"Product Sales Analysis IV","titleSlug":"product-sales-analysis-iv"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2325,"title":"Decode the Message","titleSlug":"decode-the-message"}
+{"chalengeQuestionDates":["2024-09-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2326,"title":"Spiral Matrix IV","titleSlug":"spiral-matrix-iv"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2327,"title":"Number of People Aware of a Secret","titleSlug":"number-of-people-aware-of-a-secret"}
+{"chalengeQuestionDates":["2023-06-18"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2328,"title":"Number of Increasing Paths in a Grid","titleSlug":"number-of-increasing-paths-in-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2329,"title":"Product Sales Analysis V","titleSlug":"product-sales-analysis-v"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2330,"title":"Valid Palindrome IV","titleSlug":"valid-palindrome-iv"}
+{"chalengeQuestionDates":["2024-05-16"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2331,"title":"Evaluate Boolean Binary Tree","titleSlug":"evaluate-boolean-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2332,"title":"The Latest Time to Catch a Bus","titleSlug":"the-latest-time-to-catch-a-bus"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2333,"title":"Minimum Sum of Squared Difference","titleSlug":"minimum-sum-of-squared-difference"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2334,"title":"Subarray With Elements Greater Than Varying Threshold","titleSlug":"subarray-with-elements-greater-than-varying-threshold"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2335,"title":"Minimum Amount of Time to Fill Cups","titleSlug":"minimum-amount-of-time-to-fill-cups"}
+{"chalengeQuestionDates":["2023-04-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2336,"title":"Smallest Number in Infinite Set","titleSlug":"smallest-number-in-infinite-set"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2337,"title":"Move Pieces to Obtain a String","titleSlug":"move-pieces-to-obtain-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2338,"title":"Count the Number of Ideal Arrays","titleSlug":"count-the-number-of-ideal-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2339,"title":"All the Matches of the League","titleSlug":"all-the-matches-of-the-league"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2340,"title":"Minimum Adjacent Swaps to Make a Valid Array","titleSlug":"minimum-adjacent-swaps-to-make-a-valid-array"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2341,"title":"Maximum Number of Pairs in Array","titleSlug":"maximum-number-of-pairs-in-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2342,"title":"Max Sum of a Pair With Equal Sum of Digits","titleSlug":"max-sum-of-a-pair-with-equal-sum-of-digits"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2343,"title":"Query Kth Smallest Trimmed Number","titleSlug":"query-kth-smallest-trimmed-number"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2344,"title":"Minimum Deletions to Make Array Divisible","titleSlug":"minimum-deletions-to-make-array-divisible"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2345,"title":"Finding the Number of Visible Mountains","titleSlug":"finding-the-number-of-visible-mountains"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2346,"title":"Compute the Rank as a Percentage","titleSlug":"compute-the-rank-as-a-percentage"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2347,"title":"Best Poker Hand","titleSlug":"best-poker-hand"}
+{"chalengeQuestionDates":["2023-03-21"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2348,"title":"Number of Zero-Filled Subarrays","titleSlug":"number-of-zero-filled-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2349,"title":"Design a Number Container System","titleSlug":"design-a-number-container-system"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2350,"title":"Shortest Impossible Sequence of Rolls","titleSlug":"shortest-impossible-sequence-of-rolls"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2351,"title":"First Letter to Appear Twice","titleSlug":"first-letter-to-appear-twice"}
+{"chalengeQuestionDates":["2023-06-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2352,"title":"Equal Row and Column Pairs","titleSlug":"equal-row-and-column-pairs"}
+{"chalengeQuestionDates":["2023-12-17"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2353,"title":"Design a Food Rating System","titleSlug":"design-a-food-rating-system"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2354,"title":"Number of Excellent Pairs","titleSlug":"number-of-excellent-pairs"}
+{"chalengeQuestionDates":["2023-10-15"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2355,"title":"Maximum Number of Books You Can Take","titleSlug":"maximum-number-of-books-you-can-take"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2356,"title":"Number of Unique Subjects Taught by Each Teacher","titleSlug":"number-of-unique-subjects-taught-by-each-teacher"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2357,"title":"Make Array Zero by Subtracting Equal Amounts","titleSlug":"make-array-zero-by-subtracting-equal-amounts"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2358,"title":"Maximum Number of Groups Entering a Competition","titleSlug":"maximum-number-of-groups-entering-a-competition"}
+{"chalengeQuestionDates":["2023-01-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2359,"title":"Find Closest Node to Given Two Nodes","titleSlug":"find-closest-node-to-given-two-nodes"}
+{"chalengeQuestionDates":["2023-03-26"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2360,"title":"Longest Cycle in a Graph","titleSlug":"longest-cycle-in-a-graph"}
+{"chalengeQuestionDates":["2023-08-01"],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2361,"title":"Minimum Costs Using the Train Line","titleSlug":"minimum-costs-using-the-train-line"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2362,"title":"Generate the Invoice","titleSlug":"generate-the-invoice"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2363,"title":"Merge Similar Items","titleSlug":"merge-similar-items"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2364,"title":"Count Number of Bad Pairs","titleSlug":"count-number-of-bad-pairs"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2365,"title":"Task Scheduler II","titleSlug":"task-scheduler-ii"}
+{"chalengeQuestionDates":["2023-08-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2366,"title":"Minimum Replacements to Sort the Array","titleSlug":"minimum-replacements-to-sort-the-array"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2367,"title":"Number of Arithmetic Triplets","titleSlug":"number-of-arithmetic-triplets"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2368,"title":"Reachable Nodes With Restrictions","titleSlug":"reachable-nodes-with-restrictions"}
+{"chalengeQuestionDates":["2023-08-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2369,"title":"Check if There is a Valid Partition For The Array","titleSlug":"check-if-there-is-a-valid-partition-for-the-array"}
+{"chalengeQuestionDates":["2024-04-25"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2370,"title":"Longest Ideal Subsequence","titleSlug":"longest-ideal-subsequence"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2371,"title":"Minimize Maximum Value in a Grid","titleSlug":"minimize-maximum-value-in-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2372,"title":"Calculate the Influence of Each Salesperson","titleSlug":"calculate-the-influence-of-each-salesperson"}
+{"chalengeQuestionDates":["2024-05-12"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2373,"title":"Largest Local Values in a Matrix","titleSlug":"largest-local-values-in-a-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2374,"title":"Node With Highest Edge Score","titleSlug":"node-with-highest-edge-score"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2375,"title":"Construct Smallest Number From DI String","titleSlug":"construct-smallest-number-from-di-string"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2376,"title":"Count Special Integers","titleSlug":"count-special-integers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2377,"title":"Sort the Olympic Table","titleSlug":"sort-the-olympic-table"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2378,"title":"Choose Edges to Maximize Score in a Tree","titleSlug":"choose-edges-to-maximize-score-in-a-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2379,"title":"Minimum Recolors to Get K Consecutive Black Blocks","titleSlug":"minimum-recolors-to-get-k-consecutive-black-blocks"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2380,"title":"Time Needed to Rearrange a Binary String","titleSlug":"time-needed-to-rearrange-a-binary-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2381,"title":"Shifting Letters II","titleSlug":"shifting-letters-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2382,"title":"Maximum Segment Sum After Removals","titleSlug":"maximum-segment-sum-after-removals"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2383,"title":"Minimum Hours of Training to Win a Competition","titleSlug":"minimum-hours-of-training-to-win-a-competition"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2384,"title":"Largest Palindromic Number","titleSlug":"largest-palindromic-number"}
+{"chalengeQuestionDates":["2024-01-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2385,"title":"Amount of Time for Binary Tree to Be Infected","titleSlug":"amount-of-time-for-binary-tree-to-be-infected"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2386,"title":"Find the K-Sum of an Array","titleSlug":"find-the-k-sum-of-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2387,"title":"Median of a Row Wise Sorted Matrix","titleSlug":"median-of-a-row-wise-sorted-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2388,"title":"Change Null Values in a Table to the Previous Value","titleSlug":"change-null-values-in-a-table-to-the-previous-value"}
+{"chalengeQuestionDates":["2022-12-25"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2389,"title":"Longest Subsequence With Limited Sum","titleSlug":"longest-subsequence-with-limited-sum"}
+{"chalengeQuestionDates":["2023-04-11"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2390,"title":"Removing Stars From a String","titleSlug":"removing-stars-from-a-string"}
+{"chalengeQuestionDates":["2023-11-20"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2391,"title":"Minimum Amount of Time to Collect Garbage","titleSlug":"minimum-amount-of-time-to-collect-garbage"}
+{"chalengeQuestionDates":["2024-07-21"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2392,"title":"Build a Matrix With Conditions","titleSlug":"build-a-matrix-with-conditions"}
+{"chalengeQuestionDates":["2023-09-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2393,"title":"Count Strictly Increasing Subarrays","titleSlug":"count-strictly-increasing-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2394,"title":"Employees With Deductions","titleSlug":"employees-with-deductions"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2395,"title":"Find Subarrays With Equal Sum","titleSlug":"find-subarrays-with-equal-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2396,"title":"Strictly Palindromic Number","titleSlug":"strictly-palindromic-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2397,"title":"Maximum Rows Covered by Columns","titleSlug":"maximum-rows-covered-by-columns"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2398,"title":"Maximum Number of Robots Within Budget","titleSlug":"maximum-number-of-robots-within-budget"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2399,"title":"Check Distances Between Same Letters","titleSlug":"check-distances-between-same-letters"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2400,"title":"Number of Ways to Reach a Position After Exactly k Steps","titleSlug":"number-of-ways-to-reach-a-position-after-exactly-k-steps"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2401,"title":"Longest Nice Subarray","titleSlug":"longest-nice-subarray"}
+{"chalengeQuestionDates":["2024-02-18"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2402,"title":"Meeting Rooms III","titleSlug":"meeting-rooms-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2403,"title":"Minimum Time to Kill All Monsters","titleSlug":"minimum-time-to-kill-all-monsters"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2404,"title":"Most Frequent Even Element","titleSlug":"most-frequent-even-element"}
+{"chalengeQuestionDates":["2023-04-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2405,"title":"Optimal Partition of String","titleSlug":"optimal-partition-of-string"}
+{"chalengeQuestionDates":["2024-10-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2406,"title":"Divide Intervals Into Minimum Number of Groups","titleSlug":"divide-intervals-into-minimum-number-of-groups"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2407,"title":"Longest Increasing Subsequence II","titleSlug":"longest-increasing-subsequence-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2408,"title":"Design SQL","titleSlug":"design-sql"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2409,"title":"Count Days Spent Together","titleSlug":"count-days-spent-together"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2410,"title":"Maximum Matching of Players With Trainers","titleSlug":"maximum-matching-of-players-with-trainers"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2411,"title":"Smallest Subarrays With Maximum Bitwise OR","titleSlug":"smallest-subarrays-with-maximum-bitwise-or"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2412,"title":"Minimum Money Required Before Transactions","titleSlug":"minimum-money-required-before-transactions"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2413,"title":"Smallest Even Multiple","titleSlug":"smallest-even-multiple"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2414,"title":"Length of the Longest Alphabetical Continuous Substring","titleSlug":"length-of-the-longest-alphabetical-continuous-substring"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2415,"title":"Reverse Odd Levels of Binary Tree","titleSlug":"reverse-odd-levels-of-binary-tree"}
+{"chalengeQuestionDates":["2024-09-25"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2416,"title":"Sum of Prefix Scores of Strings","titleSlug":"sum-of-prefix-scores-of-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2417,"title":"Closest Fair Integer","titleSlug":"closest-fair-integer"}
+{"chalengeQuestionDates":["2024-07-22"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2418,"title":"Sort the People","titleSlug":"sort-the-people"}
+{"chalengeQuestionDates":["2024-09-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2419,"title":"Longest Subarray With Maximum Bitwise AND","titleSlug":"longest-subarray-with-maximum-bitwise-and"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2420,"title":"Find All Good Indices","titleSlug":"find-all-good-indices"}
+{"chalengeQuestionDates":["2023-01-15"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2421,"title":"Number of Good Paths","titleSlug":"number-of-good-paths"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2422,"title":"Merge Operations to Turn Array Into a Palindrome","titleSlug":"merge-operations-to-turn-array-into-a-palindrome"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2423,"title":"Remove Letter To Equalize Frequency","titleSlug":"remove-letter-to-equalize-frequency"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2424,"title":"Longest Uploaded Prefix","titleSlug":"longest-uploaded-prefix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2425,"title":"Bitwise XOR of All Pairings","titleSlug":"bitwise-xor-of-all-pairings"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2426,"title":"Number of Pairs Satisfying Inequality","titleSlug":"number-of-pairs-satisfying-inequality"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2427,"title":"Number of Common Factors","titleSlug":"number-of-common-factors"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2428,"title":"Maximum Sum of an Hourglass","titleSlug":"maximum-sum-of-an-hourglass"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2429,"title":"Minimize XOR","titleSlug":"minimize-xor"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2430,"title":"Maximum Deletions on a String","titleSlug":"maximum-deletions-on-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2431,"title":"Maximize Total Tastiness of Purchased Fruits","titleSlug":"maximize-total-tastiness-of-purchased-fruits"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2432,"title":"The Employee That Worked on the Longest Task","titleSlug":"the-employee-that-worked-on-the-longest-task"}
+{"chalengeQuestionDates":["2023-10-31"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2433,"title":"Find The Original Array of Prefix Xor","titleSlug":"find-the-original-array-of-prefix-xor"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2434,"title":"Using a Robot to Print the Lexicographically Smallest String","titleSlug":"using-a-robot-to-print-the-lexicographically-smallest-string"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2435,"title":"Paths in Matrix Whose Sum Is Divisible by K","titleSlug":"paths-in-matrix-whose-sum-is-divisible-by-k"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2436,"title":"Minimum Split Into Subarrays With GCD Greater Than One","titleSlug":"minimum-split-into-subarrays-with-gcd-greater-than-one"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2437,"title":"Number of Valid Clock Times","titleSlug":"number-of-valid-clock-times"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2438,"title":"Range Product Queries of Powers","titleSlug":"range-product-queries-of-powers"}
+{"chalengeQuestionDates":["2023-04-05"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2439,"title":"Minimize Maximum of Array","titleSlug":"minimize-maximum-of-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2440,"title":"Create Components With Same Value","titleSlug":"create-components-with-same-value"}
+{"chalengeQuestionDates":["2024-05-02"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2441,"title":"Largest Positive Integer That Exists With Its Negative","titleSlug":"largest-positive-integer-that-exists-with-its-negative"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2442,"title":"Count Number of Distinct Integers After Reverse Operations","titleSlug":"count-number-of-distinct-integers-after-reverse-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2443,"title":"Sum of Number and Its Reverse","titleSlug":"sum-of-number-and-its-reverse"}
+{"chalengeQuestionDates":["2024-03-31","2023-03-04"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2444,"title":"Count Subarrays With Fixed Bounds","titleSlug":"count-subarrays-with-fixed-bounds"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2445,"title":"Number of Nodes With Value One","titleSlug":"number-of-nodes-with-value-one"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2446,"title":"Determine if Two Events Have Conflict","titleSlug":"determine-if-two-events-have-conflict"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2447,"title":"Number of Subarrays With GCD Equal to K","titleSlug":"number-of-subarrays-with-gcd-equal-to-k"}
+{"chalengeQuestionDates":["2023-06-21"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2448,"title":"Minimum Cost to Make Array Equal","titleSlug":"minimum-cost-to-make-array-equal"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2449,"title":"Minimum Number of Operations to Make Arrays Similar","titleSlug":"minimum-number-of-operations-to-make-arrays-similar"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2450,"title":"Number of Distinct Binary Strings After Applying Operations","titleSlug":"number-of-distinct-binary-strings-after-applying-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2451,"title":"Odd String Difference","titleSlug":"odd-string-difference"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2452,"title":"Words Within Two Edits of Dictionary","titleSlug":"words-within-two-edits-of-dictionary"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2453,"title":"Destroy Sequential Targets","titleSlug":"destroy-sequential-targets"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2454,"title":"Next Greater Element IV","titleSlug":"next-greater-element-iv"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2455,"title":"Average Value of Even Numbers That Are Divisible by Three","titleSlug":"average-value-of-even-numbers-that-are-divisible-by-three"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2456,"title":"Most Popular Video Creator","titleSlug":"most-popular-video-creator"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2457,"title":"Minimum Addition to Make Integer Beautiful","titleSlug":"minimum-addition-to-make-integer-beautiful"}
+{"chalengeQuestionDates":["2024-10-26"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2458,"title":"Height of Binary Tree After Subtree Removal Queries","titleSlug":"height-of-binary-tree-after-subtree-removal-queries"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2459,"title":"Sort Array by Moving Items to Empty Space","titleSlug":"sort-array-by-moving-items-to-empty-space"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2460,"title":"Apply Operations to an Array","titleSlug":"apply-operations-to-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2461,"title":"Maximum Sum of Distinct Subarrays With Length K","titleSlug":"maximum-sum-of-distinct-subarrays-with-length-k"}
+{"chalengeQuestionDates":["2023-06-26"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2462,"title":"Total Cost to Hire K Workers","titleSlug":"total-cost-to-hire-k-workers"}
+{"chalengeQuestionDates":["2024-10-31"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2463,"title":"Minimum Total Distance Traveled","titleSlug":"minimum-total-distance-traveled"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2464,"title":"Minimum Subarrays in a Valid Split","titleSlug":"minimum-subarrays-in-a-valid-split"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2465,"title":"Number of Distinct Averages","titleSlug":"number-of-distinct-averages"}
+{"chalengeQuestionDates":["2023-05-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2466,"title":"Count Ways To Build Good Strings","titleSlug":"count-ways-to-build-good-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2467,"title":"Most Profitable Path in a Tree","titleSlug":"most-profitable-path-in-a-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2468,"title":"Split Message Based on Limit","titleSlug":"split-message-based-on-limit"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2469,"title":"Convert the Temperature","titleSlug":"convert-the-temperature"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2470,"title":"Number of Subarrays With LCM Equal to K","titleSlug":"number-of-subarrays-with-lcm-equal-to-k"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2471,"title":"Minimum Number of Operations to Sort a Binary Tree by Level","titleSlug":"minimum-number-of-operations-to-sort-a-binary-tree-by-level"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2472,"title":"Maximum Number of Non-overlapping Palindrome Substrings","titleSlug":"maximum-number-of-non-overlapping-palindrome-substrings"}
+{"chalengeQuestionDates":["2024-05-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2473,"title":"Minimum Cost to Buy Apples","titleSlug":"minimum-cost-to-buy-apples"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2474,"title":"Customers With Strictly Increasing Purchases","titleSlug":"customers-with-strictly-increasing-purchases"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2475,"title":"Number of Unequal Triplets in Array","titleSlug":"number-of-unequal-triplets-in-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2476,"title":"Closest Nodes Queries in a Binary Search Tree","titleSlug":"closest-nodes-queries-in-a-binary-search-tree"}
+{"chalengeQuestionDates":["2023-02-12"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2477,"title":"Minimum Fuel Cost to Report to the Capital","titleSlug":"minimum-fuel-cost-to-report-to-the-capital"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2478,"title":"Number of Beautiful Partitions","titleSlug":"number-of-beautiful-partitions"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2479,"title":"Maximum XOR of Two Non-Overlapping Subtrees","titleSlug":"maximum-xor-of-two-non-overlapping-subtrees"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2480,"title":"Form a Chemical Bond","titleSlug":"form-a-chemical-bond"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2481,"title":"Minimum Cuts to Divide a Circle","titleSlug":"minimum-cuts-to-divide-a-circle"}
+{"chalengeQuestionDates":["2023-12-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2482,"title":"Difference Between Ones and Zeros in Row and Column","titleSlug":"difference-between-ones-and-zeros-in-row-and-column"}
+{"chalengeQuestionDates":["2023-08-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2483,"title":"Minimum Penalty for a Shop","titleSlug":"minimum-penalty-for-a-shop"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2484,"title":"Count Palindromic Subsequences","titleSlug":"count-palindromic-subsequences"}
+{"chalengeQuestionDates":["2024-03-13"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2485,"title":"Find the Pivot Integer","titleSlug":"find-the-pivot-integer"}
+{"chalengeQuestionDates":["2024-06-03"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2486,"title":"Append Characters to String to Make Subsequence","titleSlug":"append-characters-to-string-to-make-subsequence"}
+{"chalengeQuestionDates":["2024-05-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2487,"title":"Remove Nodes From Linked List","titleSlug":"remove-nodes-from-linked-list"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2488,"title":"Count Subarrays With Median K","titleSlug":"count-subarrays-with-median-k"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2489,"title":"Number of Substrings With Fixed Ratio","titleSlug":"number-of-substrings-with-fixed-ratio"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2490,"title":"Circular Sentence","titleSlug":"circular-sentence"}
+{"chalengeQuestionDates":["2024-10-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2491,"title":"Divide Players Into Teams of Equal Skill","titleSlug":"divide-players-into-teams-of-equal-skill"}
+{"chalengeQuestionDates":["2023-03-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2492,"title":"Minimum Score of a Path Between Two Cities","titleSlug":"minimum-score-of-a-path-between-two-cities"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2493,"title":"Divide Nodes Into the Maximum Number of Groups","titleSlug":"divide-nodes-into-the-maximum-number-of-groups"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2494,"title":"Merge Overlapping Events in the Same Hall","titleSlug":"merge-overlapping-events-in-the-same-hall"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2495,"title":"Number of Subarrays Having Even Product","titleSlug":"number-of-subarrays-having-even-product"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2496,"title":"Maximum Value of a String in an Array","titleSlug":"maximum-value-of-a-string-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2497,"title":"Maximum Star Sum of a Graph","titleSlug":"maximum-star-sum-of-a-graph"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2498,"title":"Frog Jump II","titleSlug":"frog-jump-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2499,"title":"Minimum Total Cost to Make Arrays Unequal","titleSlug":"minimum-total-cost-to-make-arrays-unequal"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2500,"title":"Delete Greatest Value in Each Row","titleSlug":"delete-greatest-value-in-each-row"}
+{"chalengeQuestionDates":["2024-10-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2501,"title":"Longest Square Streak in an Array","titleSlug":"longest-square-streak-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2502,"title":"Design Memory Allocator","titleSlug":"design-memory-allocator"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2503,"title":"Maximum Number of Points From Grid Queries","titleSlug":"maximum-number-of-points-from-grid-queries"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2504,"title":"Concatenate the Name and the Profession","titleSlug":"concatenate-the-name-and-the-profession"}
+{"chalengeQuestionDates":["2024-04-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2505,"title":"Bitwise OR of All Subsequence Sums","titleSlug":"bitwise-or-of-all-subsequence-sums"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2506,"title":"Count Pairs Of Similar Strings","titleSlug":"count-pairs-of-similar-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2507,"title":"Smallest Value After Replacing With Sum of Prime Factors","titleSlug":"smallest-value-after-replacing-with-sum-of-prime-factors"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2508,"title":"Add Edges to Make Degrees of All Nodes Even","titleSlug":"add-edges-to-make-degrees-of-all-nodes-even"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2509,"title":"Cycle Length Queries in a Tree","titleSlug":"cycle-length-queries-in-a-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2510,"title":"Check if There is a Path With Equal Number of 0's And 1's","titleSlug":"check-if-there-is-a-path-with-equal-number-of-0s-and-1s"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2511,"title":"Maximum Enemy Forts That Can Be Captured","titleSlug":"maximum-enemy-forts-that-can-be-captured"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2512,"title":"Reward Top K Students","titleSlug":"reward-top-k-students"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2513,"title":"Minimize the Maximum of Two Arrays","titleSlug":"minimize-the-maximum-of-two-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2514,"title":"Count Anagrams","titleSlug":"count-anagrams"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2515,"title":"Shortest Distance to Target String in a Circular Array","titleSlug":"shortest-distance-to-target-string-in-a-circular-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2516,"title":"Take K of Each Character From Left and Right","titleSlug":"take-k-of-each-character-from-left-and-right"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2517,"title":"Maximum Tastiness of Candy Basket","titleSlug":"maximum-tastiness-of-candy-basket"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2518,"title":"Number of Great Partitions","titleSlug":"number-of-great-partitions"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2519,"title":"Count the Number of K-Big Indices","titleSlug":"count-the-number-of-k-big-indices"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2520,"title":"Count the Digits That Divide a Number","titleSlug":"count-the-digits-that-divide-a-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2521,"title":"Distinct Prime Factors of Product of Array","titleSlug":"distinct-prime-factors-of-product-of-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2522,"title":"Partition String Into Substrings With Values at Most K","titleSlug":"partition-string-into-substrings-with-values-at-most-k"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2523,"title":"Closest Prime Numbers in Range","titleSlug":"closest-prime-numbers-in-range"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2524,"title":"Maximum Frequency Score of a Subarray","titleSlug":"maximum-frequency-score-of-a-subarray"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2525,"title":"Categorize Box According to Criteria","titleSlug":"categorize-box-according-to-criteria"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2526,"title":"Find Consecutive Integers from a Data Stream","titleSlug":"find-consecutive-integers-from-a-data-stream"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2527,"title":"Find Xor-Beauty of Array","titleSlug":"find-xor-beauty-of-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2528,"title":"Maximize the Minimum Powered City","titleSlug":"maximize-the-minimum-powered-city"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2529,"title":"Maximum Count of Positive Integer and Negative Integer","titleSlug":"maximum-count-of-positive-integer-and-negative-integer"}
+{"chalengeQuestionDates":["2024-10-14"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2530,"title":"Maximal Score After Applying K Operations","titleSlug":"maximal-score-after-applying-k-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2531,"title":"Make Number of Distinct Characters Equal","titleSlug":"make-number-of-distinct-characters-equal"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2532,"title":"Time to Cross a Bridge","titleSlug":"time-to-cross-a-bridge"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2533,"title":"Number of Good Binary Strings","titleSlug":"number-of-good-binary-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2534,"title":"Time Taken to Cross the Door","titleSlug":"time-taken-to-cross-the-door"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2535,"title":"Difference Between Element Sum and Digit Sum of an Array","titleSlug":"difference-between-element-sum-and-digit-sum-of-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2536,"title":"Increment Submatrices by One","titleSlug":"increment-submatrices-by-one"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2537,"title":"Count the Number of Good Subarrays","titleSlug":"count-the-number-of-good-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2538,"title":"Difference Between Maximum and Minimum Price Sum","titleSlug":"difference-between-maximum-and-minimum-price-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2539,"title":"Count the Number of Good Subsequences","titleSlug":"count-the-number-of-good-subsequences"}
+{"chalengeQuestionDates":["2024-03-09"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2540,"title":"Minimum Common Value","titleSlug":"minimum-common-value"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2541,"title":"Minimum Operations to Make Array Equal II","titleSlug":"minimum-operations-to-make-array-equal-ii"}
+{"chalengeQuestionDates":["2023-05-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2542,"title":"Maximum Subsequence Score","titleSlug":"maximum-subsequence-score"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2543,"title":"Check if Point Is Reachable","titleSlug":"check-if-point-is-reachable"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2544,"title":"Alternating Digit Sum","titleSlug":"alternating-digit-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2545,"title":"Sort the Students by Their Kth Score","titleSlug":"sort-the-students-by-their-kth-score"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2546,"title":"Apply Bitwise Operations to Make Strings Equal","titleSlug":"apply-bitwise-operations-to-make-strings-equal"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2547,"title":"Minimum Cost to Split an Array","titleSlug":"minimum-cost-to-split-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2548,"title":"Maximum Price to Fill a Bag","titleSlug":"maximum-price-to-fill-a-bag"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2549,"title":"Count Distinct Numbers on Board","titleSlug":"count-distinct-numbers-on-board"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2550,"title":"Count Collisions of Monkeys on a Polygon","titleSlug":"count-collisions-of-monkeys-on-a-polygon"}
+{"chalengeQuestionDates":["2023-07-08"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2551,"title":"Put Marbles in Bags","titleSlug":"put-marbles-in-bags"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2552,"title":"Count Increasing Quadruplets","titleSlug":"count-increasing-quadruplets"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2553,"title":"Separate the Digits in an Array","titleSlug":"separate-the-digits-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2554,"title":"Maximum Number of Integers to Choose From a Range I","titleSlug":"maximum-number-of-integers-to-choose-from-a-range-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2555,"title":"Maximize Win From Two Segments","titleSlug":"maximize-win-from-two-segments"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2556,"title":"Disconnect Path in a Binary Matrix by at Most One Flip","titleSlug":"disconnect-path-in-a-binary-matrix-by-at-most-one-flip"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2557,"title":"Maximum Number of Integers to Choose From a Range II","titleSlug":"maximum-number-of-integers-to-choose-from-a-range-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2558,"title":"Take Gifts From the Richest Pile","titleSlug":"take-gifts-from-the-richest-pile"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2559,"title":"Count Vowel Strings in Ranges","titleSlug":"count-vowel-strings-in-ranges"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2560,"title":"House Robber IV","titleSlug":"house-robber-iv"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2561,"title":"Rearranging Fruits","titleSlug":"rearranging-fruits"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2562,"title":"Find the Array Concatenation Value","titleSlug":"find-the-array-concatenation-value"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2563,"title":"Count the Number of Fair Pairs","titleSlug":"count-the-number-of-fair-pairs"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2564,"title":"Substring XOR Queries","titleSlug":"substring-xor-queries"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2565,"title":"Subsequence With the Minimum Score","titleSlug":"subsequence-with-the-minimum-score"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2566,"title":"Maximum Difference by Remapping a Digit","titleSlug":"maximum-difference-by-remapping-a-digit"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2567,"title":"Minimum Score by Changing Two Elements","titleSlug":"minimum-score-by-changing-two-elements"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2568,"title":"Minimum Impossible OR","titleSlug":"minimum-impossible-or"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2569,"title":"Handling Sum Queries After Update","titleSlug":"handling-sum-queries-after-update"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2570,"title":"Merge Two 2D Arrays by Summing Values","titleSlug":"merge-two-2d-arrays-by-summing-values"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2571,"title":"Minimum Operations to Reduce an Integer to 0","titleSlug":"minimum-operations-to-reduce-an-integer-to-0"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2572,"title":"Count the Number of Square-Free Subsets","titleSlug":"count-the-number-of-square-free-subsets"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2573,"title":"Find the String with LCP","titleSlug":"find-the-string-with-lcp"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2574,"title":"Left and Right Sum Differences","titleSlug":"left-and-right-sum-differences"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2575,"title":"Find the Divisibility Array of a String","titleSlug":"find-the-divisibility-array-of-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2576,"title":"Find the Maximum Number of Marked Indices","titleSlug":"find-the-maximum-number-of-marked-indices"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2577,"title":"Minimum Time to Visit a Cell In a Grid","titleSlug":"minimum-time-to-visit-a-cell-in-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2578,"title":"Split With Minimum Sum","titleSlug":"split-with-minimum-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2579,"title":"Count Total Number of Colored Cells","titleSlug":"count-total-number-of-colored-cells"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2580,"title":"Count Ways to Group Overlapping Ranges","titleSlug":"count-ways-to-group-overlapping-ranges"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2581,"title":"Count Number of Possible Root Nodes","titleSlug":"count-number-of-possible-root-nodes"}
+{"chalengeQuestionDates":["2024-07-06"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2582,"title":"Pass the Pillow","titleSlug":"pass-the-pillow"}
+{"chalengeQuestionDates":["2024-10-22"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2583,"title":"Kth Largest Sum in a Binary Tree","titleSlug":"kth-largest-sum-in-a-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2584,"title":"Split the Array to Make Coprime Products","titleSlug":"split-the-array-to-make-coprime-products"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2585,"title":"Number of Ways to Earn Points","titleSlug":"number-of-ways-to-earn-points"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2586,"title":"Count the Number of Vowel Strings in Range","titleSlug":"count-the-number-of-vowel-strings-in-range"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2587,"title":"Rearrange Array to Maximize Prefix Score","titleSlug":"rearrange-array-to-maximize-prefix-score"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2588,"title":"Count the Number of Beautiful Subarrays","titleSlug":"count-the-number-of-beautiful-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2589,"title":"Minimum Time to Complete All Tasks","titleSlug":"minimum-time-to-complete-all-tasks"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2590,"title":"Design a Todo List","titleSlug":"design-a-todo-list"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2591,"title":"Distribute Money to Maximum Children","titleSlug":"distribute-money-to-maximum-children"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2592,"title":"Maximize Greatness of an Array","titleSlug":"maximize-greatness-of-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2593,"title":"Find Score of an Array After Marking All Elements","titleSlug":"find-score-of-an-array-after-marking-all-elements"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2594,"title":"Minimum Time to Repair Cars","titleSlug":"minimum-time-to-repair-cars"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2595,"title":"Number of Even and Odd Bits","titleSlug":"number-of-even-and-odd-bits"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2596,"title":"Check Knight Tour Configuration","titleSlug":"check-knight-tour-configuration"}
+{"chalengeQuestionDates":["2024-05-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2597,"title":"The Number of Beautiful Subsets","titleSlug":"the-number-of-beautiful-subsets"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2598,"title":"Smallest Missing Non-negative Integer After Operations","titleSlug":"smallest-missing-non-negative-integer-after-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2599,"title":"Make the Prefix Sum Non-negative","titleSlug":"make-the-prefix-sum-non-negative"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2600,"title":"K Items With the Maximum Sum","titleSlug":"k-items-with-the-maximum-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2601,"title":"Prime Subtraction Operation","titleSlug":"prime-subtraction-operation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2602,"title":"Minimum Operations to Make All Array Elements Equal","titleSlug":"minimum-operations-to-make-all-array-elements-equal"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2603,"title":"Collect Coins in a Tree","titleSlug":"collect-coins-in-a-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2604,"title":"Minimum Time to Eat All Grains","titleSlug":"minimum-time-to-eat-all-grains"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2605,"title":"Form Smallest Number From Two Digit Arrays","titleSlug":"form-smallest-number-from-two-digit-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2606,"title":"Find the Substring With Maximum Cost","titleSlug":"find-the-substring-with-maximum-cost"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2607,"title":"Make K-Subarray Sums Equal","titleSlug":"make-k-subarray-sums-equal"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2608,"title":"Shortest Cycle in a Graph","titleSlug":"shortest-cycle-in-a-graph"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2609,"title":"Find the Longest Balanced Substring of a Binary String","titleSlug":"find-the-longest-balanced-substring-of-a-binary-string"}
+{"chalengeQuestionDates":["2024-01-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2610,"title":"Convert an Array Into a 2D Array With Conditions","titleSlug":"convert-an-array-into-a-2d-array-with-conditions"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2611,"title":"Mice and Cheese","titleSlug":"mice-and-cheese"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2612,"title":"Minimum Reverse Operations","titleSlug":"minimum-reverse-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2613,"title":"Beautiful Pairs","titleSlug":"beautiful-pairs"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2614,"title":"Prime In Diagonal","titleSlug":"prime-in-diagonal"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2615,"title":"Sum of Distances","titleSlug":"sum-of-distances"}
+{"chalengeQuestionDates":["2023-08-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2616,"title":"Minimize the Maximum Difference of Pairs","titleSlug":"minimize-the-maximum-difference-of-pairs"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2617,"title":"Minimum Number of Visited Cells in a Grid","titleSlug":"minimum-number-of-visited-cells-in-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2618,"title":"Check if Object Instance of Class","titleSlug":"check-if-object-instance-of-class"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2619,"title":"Array Prototype Last","titleSlug":"array-prototype-last"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2620,"title":"Counter","titleSlug":"counter"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2621,"title":"Sleep","titleSlug":"sleep"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2622,"title":"Cache With Time Limit","titleSlug":"cache-with-time-limit"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2623,"title":"Memoize","titleSlug":"memoize"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2624,"title":"Snail Traversal","titleSlug":"snail-traversal"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2625,"title":"Flatten Deeply Nested Array","titleSlug":"flatten-deeply-nested-array"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2626,"title":"Array Reduce Transformation","titleSlug":"array-reduce-transformation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2627,"title":"Debounce","titleSlug":"debounce"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2628,"title":"JSON Deep Equal","titleSlug":"json-deep-equal"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2629,"title":"Function Composition","titleSlug":"function-composition"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2630,"title":"Memoize II","titleSlug":"memoize-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2631,"title":"Group By","titleSlug":"group-by"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2632,"title":"Curry","titleSlug":"curry"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2633,"title":"Convert Object to JSON String","titleSlug":"convert-object-to-json-string"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2634,"title":"Filter Elements from Array","titleSlug":"filter-elements-from-array"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2635,"title":"Apply Transform Over Each Element in Array","titleSlug":"apply-transform-over-each-element-in-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2636,"title":"Promise Pool","titleSlug":"promise-pool"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2637,"title":"Promise Time Limit","titleSlug":"promise-time-limit"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2638,"title":"Count the Number of K-Free Subsets","titleSlug":"count-the-number-of-k-free-subsets"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2639,"title":"Find the Width of Columns of a Grid","titleSlug":"find-the-width-of-columns-of-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2640,"title":"Find the Score of All Prefixes of an Array","titleSlug":"find-the-score-of-all-prefixes-of-an-array"}
+{"chalengeQuestionDates":["2024-10-23"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2641,"title":"Cousins in Binary Tree II","titleSlug":"cousins-in-binary-tree-ii"}
+{"chalengeQuestionDates":["2023-11-11"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2642,"title":"Design Graph With Shortest Path Calculator","titleSlug":"design-graph-with-shortest-path-calculator"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2643,"title":"Row With Maximum Ones","titleSlug":"row-with-maximum-ones"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2644,"title":"Find the Maximum Divisibility Score","titleSlug":"find-the-maximum-divisibility-score"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2645,"title":"Minimum Additions to Make Valid String","titleSlug":"minimum-additions-to-make-valid-string"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2646,"title":"Minimize the Total Price of the Trips","titleSlug":"minimize-the-total-price-of-the-trips"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2647,"title":"Color the Triangle Red","titleSlug":"color-the-triangle-red"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2648,"title":"Generate Fibonacci Sequence","titleSlug":"generate-fibonacci-sequence"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2649,"title":"Nested Array Generator","titleSlug":"nested-array-generator"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2650,"title":"Design Cancellable Function","titleSlug":"design-cancellable-function"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2651,"title":"Calculate Delayed Arrival Time","titleSlug":"calculate-delayed-arrival-time"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2652,"title":"Sum Multiples","titleSlug":"sum-multiples"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2653,"title":"Sliding Subarray Beauty","titleSlug":"sliding-subarray-beauty"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2654,"title":"Minimum Number of Operations to Make All Array Elements Equal to 1","titleSlug":"minimum-number-of-operations-to-make-all-array-elements-equal-to-1"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2655,"title":"Find Maximal Uncovered Ranges","titleSlug":"find-maximal-uncovered-ranges"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2656,"title":"Maximum Sum With Exactly K Elements","titleSlug":"maximum-sum-with-exactly-k-elements"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2657,"title":"Find the Prefix Common Array of Two Arrays","titleSlug":"find-the-prefix-common-array-of-two-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2658,"title":"Maximum Number of Fish in a Grid","titleSlug":"maximum-number-of-fish-in-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2659,"title":"Make Array Empty","titleSlug":"make-array-empty"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2660,"title":"Determine the Winner of a Bowling Game","titleSlug":"determine-the-winner-of-a-bowling-game"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2661,"title":"First Completely Painted Row or Column","titleSlug":"first-completely-painted-row-or-column"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2662,"title":"Minimum Cost of a Path With Special Roads","titleSlug":"minimum-cost-of-a-path-with-special-roads"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2663,"title":"Lexicographically Smallest Beautiful String","titleSlug":"lexicographically-smallest-beautiful-string"}
+{"chalengeQuestionDates":["2024-10-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2664,"title":"The Knight’s Tour","titleSlug":"the-knights-tour"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2665,"title":"Counter II","titleSlug":"counter-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2666,"title":"Allow One Function Call","titleSlug":"allow-one-function-call"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2667,"title":"Create Hello World Function","titleSlug":"create-hello-world-function"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2668,"title":"Find Latest Salaries","titleSlug":"find-latest-salaries"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2669,"title":"Count Artist Occurrences On Spotify Ranking List","titleSlug":"count-artist-occurrences-on-spotify-ranking-list"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2670,"title":"Find the Distinct Difference Array","titleSlug":"find-the-distinct-difference-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2671,"title":"Frequency Tracker","titleSlug":"frequency-tracker"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2672,"title":"Number of Adjacent Elements With the Same Color","titleSlug":"number-of-adjacent-elements-with-the-same-color"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2673,"title":"Make Costs of Paths Equal in a Binary Tree","titleSlug":"make-costs-of-paths-equal-in-a-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2674,"title":"Split a Circular Linked List","titleSlug":"split-a-circular-linked-list"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2675,"title":"Array of Objects to Matrix","titleSlug":"array-of-objects-to-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2676,"title":"Throttle","titleSlug":"throttle"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2677,"title":"Chunk Array","titleSlug":"chunk-array"}
+{"chalengeQuestionDates":["2024-08-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2678,"title":"Number of Senior Citizens","titleSlug":"number-of-senior-citizens"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2679,"title":"Sum in a Matrix","titleSlug":"sum-in-a-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2680,"title":"Maximum OR","titleSlug":"maximum-or"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2681,"title":"Power of Heroes","titleSlug":"power-of-heroes"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2682,"title":"Find the Losers of the Circular Game","titleSlug":"find-the-losers-of-the-circular-game"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2683,"title":"Neighboring Bitwise XOR","titleSlug":"neighboring-bitwise-xor"}
+{"chalengeQuestionDates":["2024-10-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2684,"title":"Maximum Number of Moves in a Grid","titleSlug":"maximum-number-of-moves-in-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2685,"title":"Count the Number of Complete Components","titleSlug":"count-the-number-of-complete-components"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2686,"title":"Immediate Food Delivery III","titleSlug":"immediate-food-delivery-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2687,"title":"Bikes Last Time Used","titleSlug":"bikes-last-time-used"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2688,"title":"Find Active Users","titleSlug":"find-active-users"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2689,"title":"Extract Kth Character From The Rope Tree","titleSlug":"extract-kth-character-from-the-rope-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2690,"title":"Infinite Method Object","titleSlug":"infinite-method-object"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2691,"title":"Immutability Helper","titleSlug":"immutability-helper"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2692,"title":"Make Object Immutable","titleSlug":"make-object-immutable"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2693,"title":"Call Function with Custom Context","titleSlug":"call-function-with-custom-context"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2694,"title":"Event Emitter","titleSlug":"event-emitter"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2695,"title":"Array Wrapper","titleSlug":"array-wrapper"}
+{"chalengeQuestionDates":["2024-10-07"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2696,"title":"Minimum String Length After Removing Substrings","titleSlug":"minimum-string-length-after-removing-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2697,"title":"Lexicographically Smallest Palindrome","titleSlug":"lexicographically-smallest-palindrome"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2698,"title":"Find the Punishment Number of an Integer","titleSlug":"find-the-punishment-number-of-an-integer"}
+{"chalengeQuestionDates":["2024-08-30"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2699,"title":"Modify Graph Edge Weights","titleSlug":"modify-graph-edge-weights"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2700,"title":"Differences Between Two Objects","titleSlug":"differences-between-two-objects"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2701,"title":"Consecutive Transactions with Increasing Amounts","titleSlug":"consecutive-transactions-with-increasing-amounts"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2702,"title":"Minimum Operations to Make Numbers Non-positive","titleSlug":"minimum-operations-to-make-numbers-non-positive"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2703,"title":"Return Length of Arguments Passed","titleSlug":"return-length-of-arguments-passed"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2704,"title":"To Be Or Not To Be","titleSlug":"to-be-or-not-to-be"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2705,"title":"Compact Object","titleSlug":"compact-object"}
+{"chalengeQuestionDates":["2023-12-20"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2706,"title":"Buy Two Chocolates","titleSlug":"buy-two-chocolates"}
+{"chalengeQuestionDates":["2024-09-23","2023-09-02"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2707,"title":"Extra Characters in a String","titleSlug":"extra-characters-in-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2708,"title":"Maximum Strength of a Group","titleSlug":"maximum-strength-of-a-group"}
+{"chalengeQuestionDates":["2024-02-25"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2709,"title":"Greatest Common Divisor Traversal","titleSlug":"greatest-common-divisor-traversal"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2710,"title":"Remove Trailing Zeros From a String","titleSlug":"remove-trailing-zeros-from-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2711,"title":"Difference of Number of Distinct Values on Diagonals","titleSlug":"difference-of-number-of-distinct-values-on-diagonals"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2712,"title":"Minimum Cost to Make All Characters Equal","titleSlug":"minimum-cost-to-make-all-characters-equal"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2713,"title":"Maximum Strictly Increasing Cells in a Matrix","titleSlug":"maximum-strictly-increasing-cells-in-a-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2714,"title":"Find Shortest Path with K Hops","titleSlug":"find-shortest-path-with-k-hops"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2715,"title":"Timeout Cancellation","titleSlug":"timeout-cancellation"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2716,"title":"Minimize String Length","titleSlug":"minimize-string-length"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2717,"title":"Semi-Ordered Permutation","titleSlug":"semi-ordered-permutation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2718,"title":"Sum of Matrix After Queries","titleSlug":"sum-of-matrix-after-queries"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2719,"title":"Count of Integers","titleSlug":"count-of-integers"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2720,"title":"Popularity Percentage","titleSlug":"popularity-percentage"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2721,"title":"Execute Asynchronous Functions in Parallel","titleSlug":"execute-asynchronous-functions-in-parallel"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2722,"title":"Join Two Arrays by ID","titleSlug":"join-two-arrays-by-id"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2723,"title":"Add Two Promises","titleSlug":"add-two-promises"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2724,"title":"Sort By","titleSlug":"sort-by"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2725,"title":"Interval Cancellation","titleSlug":"interval-cancellation"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2726,"title":"Calculator with Method Chaining","titleSlug":"calculator-with-method-chaining"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2727,"title":"Is Object Empty","titleSlug":"is-object-empty"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2728,"title":"Count Houses in a Circular Street","titleSlug":"count-houses-in-a-circular-street"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2729,"title":"Check if The Number is Fascinating","titleSlug":"check-if-the-number-is-fascinating"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2730,"title":"Find the Longest Semi-Repetitive Substring","titleSlug":"find-the-longest-semi-repetitive-substring"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2731,"title":"Movement of Robots","titleSlug":"movement-of-robots"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2732,"title":"Find a Good Subset of the Matrix","titleSlug":"find-a-good-subset-of-the-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2733,"title":"Neither Minimum nor Maximum","titleSlug":"neither-minimum-nor-maximum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2734,"title":"Lexicographically Smallest String After Substring Operation","titleSlug":"lexicographically-smallest-string-after-substring-operation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2735,"title":"Collecting Chocolates","titleSlug":"collecting-chocolates"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2736,"title":"Maximum Sum Queries","titleSlug":"maximum-sum-queries"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2737,"title":"Find the Closest Marked Node","titleSlug":"find-the-closest-marked-node"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2738,"title":"Count Occurrences in Text","titleSlug":"count-occurrences-in-text"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2739,"title":"Total Distance Traveled","titleSlug":"total-distance-traveled"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2740,"title":"Find the Value of the Partition","titleSlug":"find-the-value-of-the-partition"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2741,"title":"Special Permutations","titleSlug":"special-permutations"}
+{"chalengeQuestionDates":["2023-10-14"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2742,"title":"Painting the Walls","titleSlug":"painting-the-walls"}
+{"chalengeQuestionDates":["2024-06-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2743,"title":"Count Substrings Without Repeating Character","titleSlug":"count-substrings-without-repeating-character"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2744,"title":"Find Maximum Number of String Pairs","titleSlug":"find-maximum-number-of-string-pairs"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2745,"title":"Construct the Longest New String","titleSlug":"construct-the-longest-new-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2746,"title":"Decremental String Concatenation","titleSlug":"decremental-string-concatenation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2747,"title":"Count Zero Request Servers","titleSlug":"count-zero-request-servers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2748,"title":"Number of Beautiful Pairs","titleSlug":"number-of-beautiful-pairs"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2749,"title":"Minimum Operations to Make the Integer Zero","titleSlug":"minimum-operations-to-make-the-integer-zero"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2750,"title":"Ways to Split Array Into Good Subarrays","titleSlug":"ways-to-split-array-into-good-subarrays"}
+{"chalengeQuestionDates":["2024-07-13"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2751,"title":"Robot Collisions","titleSlug":"robot-collisions"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2752,"title":"Customers with Maximum Number of Transactions on Consecutive Days","titleSlug":"customers-with-maximum-number-of-transactions-on-consecutive-days"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2753,"title":"Count Houses in a Circular Street II","titleSlug":"count-houses-in-a-circular-street-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2754,"title":"Bind Function to Context","titleSlug":"bind-function-to-context"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2755,"title":"Deep Merge of Two Objects","titleSlug":"deep-merge-of-two-objects"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2756,"title":"Query Batching","titleSlug":"query-batching"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2757,"title":"Generate Circular Array Values","titleSlug":"generate-circular-array-values"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2758,"title":"Next Day","titleSlug":"next-day"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2759,"title":"Convert JSON String to Object","titleSlug":"convert-json-string-to-object"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2760,"title":"Longest Even Odd Subarray With Threshold","titleSlug":"longest-even-odd-subarray-with-threshold"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2761,"title":"Prime Pairs With Target Sum","titleSlug":"prime-pairs-with-target-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2762,"title":"Continuous Subarrays","titleSlug":"continuous-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2763,"title":"Sum of Imbalance Numbers of All Subarrays","titleSlug":"sum-of-imbalance-numbers-of-all-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2764,"title":"Is Array a Preorder of Some ‌Binary Tree","titleSlug":"is-array-a-preorder-of-some-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2765,"title":"Longest Alternating Subarray","titleSlug":"longest-alternating-subarray"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2766,"title":"Relocate Marbles","titleSlug":"relocate-marbles"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2767,"title":"Partition String Into Minimum Beautiful Substrings","titleSlug":"partition-string-into-minimum-beautiful-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2768,"title":"Number of Black Blocks","titleSlug":"number-of-black-blocks"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2769,"title":"Find the Maximum Achievable Number","titleSlug":"find-the-maximum-achievable-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2770,"title":"Maximum Number of Jumps to Reach the Last Index","titleSlug":"maximum-number-of-jumps-to-reach-the-last-index"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2771,"title":"Longest Non-decreasing Subarray From Two Arrays","titleSlug":"longest-non-decreasing-subarray-from-two-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2772,"title":"Apply Operations to Make All Array Elements Equal to Zero","titleSlug":"apply-operations-to-make-all-array-elements-equal-to-zero"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2773,"title":"Height of Special Binary Tree","titleSlug":"height-of-special-binary-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2774,"title":"Array Upper Bound","titleSlug":"array-upper-bound"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2775,"title":"Undefined to Null","titleSlug":"undefined-to-null"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2776,"title":"Convert Callback Based Function to Promise Based Function","titleSlug":"convert-callback-based-function-to-promise-based-function"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2777,"title":"Date Range Generator","titleSlug":"date-range-generator"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2778,"title":"Sum of Squares of Special Elements","titleSlug":"sum-of-squares-of-special-elements"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2779,"title":"Maximum Beauty of an Array After Applying Operation","titleSlug":"maximum-beauty-of-an-array-after-applying-operation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2780,"title":"Minimum Index of a Valid Split","titleSlug":"minimum-index-of-a-valid-split"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2781,"title":"Length of the Longest Valid Substring","titleSlug":"length-of-the-longest-valid-substring"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2782,"title":"Number of Unique Categories","titleSlug":"number-of-unique-categories"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2783,"title":"Flight Occupancy and Waitlist Analysis","titleSlug":"flight-occupancy-and-waitlist-analysis"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2784,"title":"Check if Array is Good","titleSlug":"check-if-array-is-good"}
+{"chalengeQuestionDates":["2023-11-13"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2785,"title":"Sort Vowels in a String","titleSlug":"sort-vowels-in-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2786,"title":"Visit Array Positions to Maximize Score","titleSlug":"visit-array-positions-to-maximize-score"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2787,"title":"Ways to Express an Integer as Sum of Powers","titleSlug":"ways-to-express-an-integer-as-sum-of-powers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2788,"title":"Split Strings by Separator","titleSlug":"split-strings-by-separator"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2789,"title":"Largest Element in an Array after Merge Operations","titleSlug":"largest-element-in-an-array-after-merge-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2790,"title":"Maximum Number of Groups With Increasing Length","titleSlug":"maximum-number-of-groups-with-increasing-length"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2791,"title":"Count Paths That Can Form a Palindrome in a Tree","titleSlug":"count-paths-that-can-form-a-palindrome-in-a-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2792,"title":"Count Nodes That Are Great Enough","titleSlug":"count-nodes-that-are-great-enough"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2793,"title":"Status of Flight Tickets","titleSlug":"status-of-flight-tickets"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2794,"title":"Create Object from Two Arrays","titleSlug":"create-object-from-two-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2795,"title":"Parallel Execution of Promises for Individual Results Retrieval","titleSlug":"parallel-execution-of-promises-for-individual-results-retrieval"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2796,"title":"Repeat String","titleSlug":"repeat-string"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2797,"title":"Partial Function with Placeholders","titleSlug":"partial-function-with-placeholders"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2798,"title":"Number of Employees Who Met the Target","titleSlug":"number-of-employees-who-met-the-target"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2799,"title":"Count Complete Subarrays in an Array","titleSlug":"count-complete-subarrays-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2800,"title":"Shortest String That Contains Three Strings","titleSlug":"shortest-string-that-contains-three-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2801,"title":"Count Stepping Numbers in Range","titleSlug":"count-stepping-numbers-in-range"}
+{"chalengeQuestionDates":["2024-05-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2802,"title":"Find The K-th Lucky Number","titleSlug":"find-the-k-th-lucky-number"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2803,"title":"Factorial Generator","titleSlug":"factorial-generator"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2804,"title":"Array Prototype ForEach","titleSlug":"array-prototype-foreach"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2805,"title":"Custom Interval","titleSlug":"custom-interval"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2806,"title":"Account Balance After Rounded Purchase","titleSlug":"account-balance-after-rounded-purchase"}
+{"chalengeQuestionDates":["2024-09-10"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2807,"title":"Insert Greatest Common Divisors in Linked List","titleSlug":"insert-greatest-common-divisors-in-linked-list"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2808,"title":"Minimum Seconds to Equalize a Circular Array","titleSlug":"minimum-seconds-to-equalize-a-circular-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2809,"title":"Minimum Time to Make Array Sum At Most x","titleSlug":"minimum-time-to-make-array-sum-at-most-x"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2810,"title":"Faulty Keyboard","titleSlug":"faulty-keyboard"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2811,"title":"Check if it is Possible to Split Array","titleSlug":"check-if-it-is-possible-to-split-array"}
+{"chalengeQuestionDates":["2024-05-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2812,"title":"Find the Safest Path in a Grid","titleSlug":"find-the-safest-path-in-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2813,"title":"Maximum Elegance of a K-Length Subsequence","titleSlug":"maximum-elegance-of-a-k-length-subsequence"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2814,"title":"Minimum Time Takes to Reach Destination Without Drowning","titleSlug":"minimum-time-takes-to-reach-destination-without-drowning"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2815,"title":"Max Pair Sum in an Array","titleSlug":"max-pair-sum-in-an-array"}
+{"chalengeQuestionDates":["2024-05-07"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2816,"title":"Double a Number Represented as a Linked List","titleSlug":"double-a-number-represented-as-a-linked-list"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2817,"title":"Minimum Absolute Difference Between Elements With Constraint","titleSlug":"minimum-absolute-difference-between-elements-with-constraint"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2818,"title":"Apply Operations to Maximize Score","titleSlug":"apply-operations-to-maximize-score"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2819,"title":"Minimum Relative Loss After Buying Chocolates","titleSlug":"minimum-relative-loss-after-buying-chocolates"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2820,"title":"Election Results","titleSlug":"election-results"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2821,"title":"Delay the Resolution of Each Promise","titleSlug":"delay-the-resolution-of-each-promise"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2822,"title":"Inversion of Object","titleSlug":"inversion-of-object"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2823,"title":"Deep Object Filter","titleSlug":"deep-object-filter"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2824,"title":"Count Pairs Whose Sum is Less than Target","titleSlug":"count-pairs-whose-sum-is-less-than-target"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2825,"title":"Make String a Subsequence Using Cyclic Increments","titleSlug":"make-string-a-subsequence-using-cyclic-increments"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2826,"title":"Sorting Three Groups","titleSlug":"sorting-three-groups"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2827,"title":"Number of Beautiful Integers in the Range","titleSlug":"number-of-beautiful-integers-in-the-range"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2828,"title":"Check if a String Is an Acronym of Words","titleSlug":"check-if-a-string-is-an-acronym-of-words"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2829,"title":"Determine the Minimum Sum of a k-avoiding Array","titleSlug":"determine-the-minimum-sum-of-a-k-avoiding-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2830,"title":"Maximize the Profit as the Salesman","titleSlug":"maximize-the-profit-as-the-salesman"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2831,"title":"Find the Longest Equal Subarray","titleSlug":"find-the-longest-equal-subarray"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2832,"title":"Maximal Range That Each Element Is Maximum in It","titleSlug":"maximal-range-that-each-element-is-maximum-in-it"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2833,"title":"Furthest Point From Origin","titleSlug":"furthest-point-from-origin"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2834,"title":"Find the Minimum Possible Sum of a Beautiful Array","titleSlug":"find-the-minimum-possible-sum-of-a-beautiful-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2835,"title":"Minimum Operations to Form Subsequence With Target Sum","titleSlug":"minimum-operations-to-form-subsequence-with-target-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2836,"title":"Maximize Value of Function in a Ball Passing Game","titleSlug":"maximize-value-of-function-in-a-ball-passing-game"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2837,"title":"Total Traveled Distance","titleSlug":"total-traveled-distance"}
+{"chalengeQuestionDates":["2024-10-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2838,"title":"Maximum Coins Heroes Can Collect","titleSlug":"maximum-coins-heroes-can-collect"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2839,"title":"Check if Strings Can be Made Equal With Operations I","titleSlug":"check-if-strings-can-be-made-equal-with-operations-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2840,"title":"Check if Strings Can be Made Equal With Operations II","titleSlug":"check-if-strings-can-be-made-equal-with-operations-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2841,"title":"Maximum Sum of Almost Unique Subarray","titleSlug":"maximum-sum-of-almost-unique-subarray"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2842,"title":"Count K-Subsequences of a String With Maximum Beauty","titleSlug":"count-k-subsequences-of-a-string-with-maximum-beauty"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2843,"title":"Count Symmetric Integers","titleSlug":"count-symmetric-integers"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2844,"title":"Minimum Operations to Make a Special Number","titleSlug":"minimum-operations-to-make-a-special-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2845,"title":"Count of Interesting Subarrays","titleSlug":"count-of-interesting-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2846,"title":"Minimum Edge Weight Equilibrium Queries in a Tree","titleSlug":"minimum-edge-weight-equilibrium-queries-in-a-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2847,"title":"Smallest Number With Given Digit Product","titleSlug":"smallest-number-with-given-digit-product"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2848,"title":"Points That Intersect With Cars","titleSlug":"points-that-intersect-with-cars"}
+{"chalengeQuestionDates":["2023-11-08"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2849,"title":"Determine if a Cell Is Reachable at a Given Time","titleSlug":"determine-if-a-cell-is-reachable-at-a-given-time"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2850,"title":"Minimum Moves to Spread Stones Over Grid","titleSlug":"minimum-moves-to-spread-stones-over-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2851,"title":"String Transformation","titleSlug":"string-transformation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2852,"title":"Sum of Remoteness of All Cells","titleSlug":"sum-of-remoteness-of-all-cells"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2853,"title":"Highest Salaries Difference","titleSlug":"highest-salaries-difference"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2854,"title":"Rolling Average Steps","titleSlug":"rolling-average-steps"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2855,"title":"Minimum Right Shifts to Sort the Array","titleSlug":"minimum-right-shifts-to-sort-the-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2856,"title":"Minimum Array Length After Pair Removals","titleSlug":"minimum-array-length-after-pair-removals"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2857,"title":"Count Pairs of Points With Distance k","titleSlug":"count-pairs-of-points-with-distance-k"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2858,"title":"Minimum Edge Reversals So Every Node Is Reachable","titleSlug":"minimum-edge-reversals-so-every-node-is-reachable"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2859,"title":"Sum of Values at Indices With K Set Bits","titleSlug":"sum-of-values-at-indices-with-k-set-bits"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2860,"title":"Happy Students","titleSlug":"happy-students"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2861,"title":"Maximum Number of Alloys","titleSlug":"maximum-number-of-alloys"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2862,"title":"Maximum Element-Sum of a Complete Subset of Indices","titleSlug":"maximum-element-sum-of-a-complete-subset-of-indices"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2863,"title":"Maximum Length of Semi-Decreasing Subarrays","titleSlug":"maximum-length-of-semi-decreasing-subarrays"}
+{"chalengeQuestionDates":["2024-03-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2864,"title":"Maximum Odd Binary Number","titleSlug":"maximum-odd-binary-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2865,"title":"Beautiful Towers I","titleSlug":"beautiful-towers-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2866,"title":"Beautiful Towers II","titleSlug":"beautiful-towers-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2867,"title":"Count Valid Paths in a Tree","titleSlug":"count-valid-paths-in-a-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2868,"title":"The Wording Game","titleSlug":"the-wording-game"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2869,"title":"Minimum Operations to Collect Elements","titleSlug":"minimum-operations-to-collect-elements"}
+{"chalengeQuestionDates":["2024-01-04"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2870,"title":"Minimum Number of Operations to Make Array Empty","titleSlug":"minimum-number-of-operations-to-make-array-empty"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2871,"title":"Split Array Into Maximum Number of Subarrays","titleSlug":"split-array-into-maximum-number-of-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2872,"title":"Maximum Number of K-Divisible Components","titleSlug":"maximum-number-of-k-divisible-components"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2873,"title":"Maximum Value of an Ordered Triplet I","titleSlug":"maximum-value-of-an-ordered-triplet-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2874,"title":"Maximum Value of an Ordered Triplet II","titleSlug":"maximum-value-of-an-ordered-triplet-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2875,"title":"Minimum Size Subarray in Infinite Array","titleSlug":"minimum-size-subarray-in-infinite-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2876,"title":"Count Visited Nodes in a Directed Graph","titleSlug":"count-visited-nodes-in-a-directed-graph"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2877,"title":"Create a DataFrame from List","titleSlug":"create-a-dataframe-from-list"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2878,"title":"Get the Size of a DataFrame","titleSlug":"get-the-size-of-a-dataframe"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2879,"title":"Display the First Three Rows","titleSlug":"display-the-first-three-rows"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2880,"title":"Select Data","titleSlug":"select-data"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2881,"title":"Create a New Column","titleSlug":"create-a-new-column"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2882,"title":"Drop Duplicate Rows","titleSlug":"drop-duplicate-rows"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2883,"title":"Drop Missing Data","titleSlug":"drop-missing-data"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2884,"title":"Modify Columns","titleSlug":"modify-columns"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2885,"title":"Rename Columns","titleSlug":"rename-columns"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2886,"title":"Change Data Type","titleSlug":"change-data-type"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2887,"title":"Fill Missing Data","titleSlug":"fill-missing-data"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2888,"title":"Reshape Data: Concatenate","titleSlug":"reshape-data-concatenate"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2889,"title":"Reshape Data: Pivot","titleSlug":"reshape-data-pivot"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2890,"title":"Reshape Data: Melt","titleSlug":"reshape-data-melt"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2891,"title":"Method Chaining","titleSlug":"method-chaining"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2892,"title":"Minimizing Array After Replacing Pairs With Their Product","titleSlug":"minimizing-array-after-replacing-pairs-with-their-product"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2893,"title":"Calculate Orders Within Each Interval","titleSlug":"calculate-orders-within-each-interval"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2894,"title":"Divisible and Non-divisible Sums Difference","titleSlug":"divisible-and-non-divisible-sums-difference"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2895,"title":"Minimum Processing Time","titleSlug":"minimum-processing-time"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2896,"title":"Apply Operations to Make Two Strings Equal","titleSlug":"apply-operations-to-make-two-strings-equal"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2897,"title":"Apply Operations on Array to Maximize Sum of Squares","titleSlug":"apply-operations-on-array-to-maximize-sum-of-squares"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2898,"title":"Maximum Linear Stock Score","titleSlug":"maximum-linear-stock-score"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2899,"title":"Last Visited Integers","titleSlug":"last-visited-integers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2900,"title":"Longest Unequal Adjacent Groups Subsequence I","titleSlug":"longest-unequal-adjacent-groups-subsequence-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2901,"title":"Longest Unequal Adjacent Groups Subsequence II","titleSlug":"longest-unequal-adjacent-groups-subsequence-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2902,"title":"Count of Sub-Multisets With Bounded Sum","titleSlug":"count-of-sub-multisets-with-bounded-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2903,"title":"Find Indices With Index and Value Difference I","titleSlug":"find-indices-with-index-and-value-difference-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2904,"title":"Shortest and Lexicographically Smallest Beautiful String","titleSlug":"shortest-and-lexicographically-smallest-beautiful-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2905,"title":"Find Indices With Index and Value Difference II","titleSlug":"find-indices-with-index-and-value-difference-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2906,"title":"Construct Product Matrix","titleSlug":"construct-product-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2907,"title":"Maximum Profitable Triplets With Increasing Prices I","titleSlug":"maximum-profitable-triplets-with-increasing-prices-i"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2908,"title":"Minimum Sum of Mountain Triplets I","titleSlug":"minimum-sum-of-mountain-triplets-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2909,"title":"Minimum Sum of Mountain Triplets II","titleSlug":"minimum-sum-of-mountain-triplets-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2910,"title":"Minimum Number of Groups to Create a Valid Assignment","titleSlug":"minimum-number-of-groups-to-create-a-valid-assignment"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2911,"title":"Minimum Changes to Make K Semi-palindromes","titleSlug":"minimum-changes-to-make-k-semi-palindromes"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2912,"title":"Number of Ways to Reach Destination in the Grid","titleSlug":"number-of-ways-to-reach-destination-in-the-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2913,"title":"Subarrays Distinct Element Sum of Squares I","titleSlug":"subarrays-distinct-element-sum-of-squares-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2914,"title":"Minimum Number of Changes to Make Binary String Beautiful","titleSlug":"minimum-number-of-changes-to-make-binary-string-beautiful"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2915,"title":"Length of the Longest Subsequence That Sums to Target","titleSlug":"length-of-the-longest-subsequence-that-sums-to-target"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2916,"title":"Subarrays Distinct Element Sum of Squares II","titleSlug":"subarrays-distinct-element-sum-of-squares-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2917,"title":"Find the K-or of an Array","titleSlug":"find-the-k-or-of-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2918,"title":"Minimum Equal Sum of Two Arrays After Replacing Zeros","titleSlug":"minimum-equal-sum-of-two-arrays-after-replacing-zeros"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2919,"title":"Minimum Increment Operations to Make Array Beautiful","titleSlug":"minimum-increment-operations-to-make-array-beautiful"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2920,"title":"Maximum Points After Collecting Coins From All Nodes","titleSlug":"maximum-points-after-collecting-coins-from-all-nodes"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2921,"title":"Maximum Profitable Triplets With Increasing Prices II","titleSlug":"maximum-profitable-triplets-with-increasing-prices-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2922,"title":"Market Analysis III","titleSlug":"market-analysis-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2923,"title":"Find Champion I","titleSlug":"find-champion-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2924,"title":"Find Champion II","titleSlug":"find-champion-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2925,"title":"Maximum Score After Applying Operations on a Tree","titleSlug":"maximum-score-after-applying-operations-on-a-tree"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2926,"title":"Maximum Balanced Subsequence Sum","titleSlug":"maximum-balanced-subsequence-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2927,"title":"Distribute Candies Among Children III","titleSlug":"distribute-candies-among-children-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2928,"title":"Distribute Candies Among Children I","titleSlug":"distribute-candies-among-children-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2929,"title":"Distribute Candies Among Children II","titleSlug":"distribute-candies-among-children-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2930,"title":"Number of Strings Which Can Be Rearranged to Contain Substring","titleSlug":"number-of-strings-which-can-be-rearranged-to-contain-substring"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2931,"title":"Maximum Spending After Buying Items","titleSlug":"maximum-spending-after-buying-items"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2932,"title":"Maximum Strong Pair XOR I","titleSlug":"maximum-strong-pair-xor-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2933,"title":"High-Access Employees","titleSlug":"high-access-employees"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2934,"title":"Minimum Operations to Maximize Last Elements in Arrays","titleSlug":"minimum-operations-to-maximize-last-elements-in-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2935,"title":"Maximum Strong Pair XOR II","titleSlug":"maximum-strong-pair-xor-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2936,"title":"Number of Equal Numbers Blocks","titleSlug":"number-of-equal-numbers-blocks"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2937,"title":"Make Three Strings Equal","titleSlug":"make-three-strings-equal"}
+{"chalengeQuestionDates":["2024-10-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2938,"title":"Separate Black and White Balls","titleSlug":"separate-black-and-white-balls"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2939,"title":"Maximum Xor Product","titleSlug":"maximum-xor-product"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2940,"title":"Find Building Where Alice and Bob Can Meet","titleSlug":"find-building-where-alice-and-bob-can-meet"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2941,"title":"Maximum GCD-Sum of a Subarray","titleSlug":"maximum-gcd-sum-of-a-subarray"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2942,"title":"Find Words Containing Character","titleSlug":"find-words-containing-character"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2943,"title":"Maximize Area of Square Hole in Grid","titleSlug":"maximize-area-of-square-hole-in-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2944,"title":"Minimum Number of Coins for Fruits","titleSlug":"minimum-number-of-coins-for-fruits"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2945,"title":"Find Maximum Non-decreasing Array Length","titleSlug":"find-maximum-non-decreasing-array-length"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2946,"title":"Matrix Similarity After Cyclic Shifts","titleSlug":"matrix-similarity-after-cyclic-shifts"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2947,"title":"Count Beautiful Substrings I","titleSlug":"count-beautiful-substrings-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2948,"title":"Make Lexicographically Smallest Array by Swapping Elements","titleSlug":"make-lexicographically-smallest-array-by-swapping-elements"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2949,"title":"Count Beautiful Substrings II","titleSlug":"count-beautiful-substrings-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2950,"title":"Number of Divisible Substrings","titleSlug":"number-of-divisible-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2951,"title":"Find the Peaks","titleSlug":"find-the-peaks"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2952,"title":"Minimum Number of Coins to be Added","titleSlug":"minimum-number-of-coins-to-be-added"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2953,"title":"Count Complete Substrings","titleSlug":"count-complete-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2954,"title":"Count the Number of Infection Sequences","titleSlug":"count-the-number-of-infection-sequences"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2955,"title":"Number of Same-End Substrings","titleSlug":"number-of-same-end-substrings"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2956,"title":"Find Common Elements Between Two Arrays","titleSlug":"find-common-elements-between-two-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2957,"title":"Remove Adjacent Almost-Equal Characters","titleSlug":"remove-adjacent-almost-equal-characters"}
+{"chalengeQuestionDates":["2024-03-28"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2958,"title":"Length of Longest Subarray With at Most K Frequency","titleSlug":"length-of-longest-subarray-with-at-most-k-frequency"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2959,"title":"Number of Possible Sets of Closing Branches","titleSlug":"number-of-possible-sets-of-closing-branches"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2960,"title":"Count Tested Devices After Test Operations","titleSlug":"count-tested-devices-after-test-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2961,"title":"Double Modular Exponentiation","titleSlug":"double-modular-exponentiation"}
+{"chalengeQuestionDates":["2024-03-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2962,"title":"Count Subarrays Where Max Element Appears at Least K Times","titleSlug":"count-subarrays-where-max-element-appears-at-least-k-times"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2963,"title":"Count the Number of Good Partitions","titleSlug":"count-the-number-of-good-partitions"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2964,"title":"Number of Divisible Triplet Sums","titleSlug":"number-of-divisible-triplet-sums"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2965,"title":"Find Missing and Repeated Values","titleSlug":"find-missing-and-repeated-values"}
+{"chalengeQuestionDates":["2024-02-01"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2966,"title":"Divide Array Into Arrays With Max Difference","titleSlug":"divide-array-into-arrays-with-max-difference"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2967,"title":"Minimum Cost to Make Array Equalindromic","titleSlug":"minimum-cost-to-make-array-equalindromic"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2968,"title":"Apply Operations to Maximize Frequency Score","titleSlug":"apply-operations-to-maximize-frequency-score"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2969,"title":"Minimum Number of Coins for Fruits II","titleSlug":"minimum-number-of-coins-for-fruits-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2970,"title":"Count the Number of Incremovable Subarrays I","titleSlug":"count-the-number-of-incremovable-subarrays-i"}
+{"chalengeQuestionDates":["2024-02-15"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2971,"title":"Find Polygon With the Largest Perimeter","titleSlug":"find-polygon-with-the-largest-perimeter"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2972,"title":"Count the Number of Incremovable Subarrays II","titleSlug":"count-the-number-of-incremovable-subarrays-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2973,"title":"Find Number of Coins to Place in Tree Nodes","titleSlug":"find-number-of-coins-to-place-in-tree-nodes"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2974,"title":"Minimum Number Game","titleSlug":"minimum-number-game"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2975,"title":"Maximum Square Area by Removing Fences From a Field","titleSlug":"maximum-square-area-by-removing-fences-from-a-field"}
+{"chalengeQuestionDates":["2024-07-27"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2976,"title":"Minimum Cost to Convert String I","titleSlug":"minimum-cost-to-convert-string-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2977,"title":"Minimum Cost to Convert String II","titleSlug":"minimum-cost-to-convert-string-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2978,"title":"Symmetric Coordinates","titleSlug":"symmetric-coordinates"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2979,"title":"Most Expensive Item That Can Not Be Bought","titleSlug":"most-expensive-item-that-can-not-be-bought"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2980,"title":"Check if Bitwise OR Has Trailing Zeros","titleSlug":"check-if-bitwise-or-has-trailing-zeros"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2981,"title":"Find Longest Special Substring That Occurs Thrice I","titleSlug":"find-longest-special-substring-that-occurs-thrice-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2982,"title":"Find Longest Special Substring That Occurs Thrice II","titleSlug":"find-longest-special-substring-that-occurs-thrice-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2983,"title":"Palindrome Rearrangement Queries","titleSlug":"palindrome-rearrangement-queries"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2984,"title":"Find Peak Calling Hours for Each City","titleSlug":"find-peak-calling-hours-for-each-city"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2985,"title":"Calculate Compressed Mean","titleSlug":"calculate-compressed-mean"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2986,"title":"Find Third Transaction","titleSlug":"find-third-transaction"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2987,"title":"Find Expensive Cities","titleSlug":"find-expensive-cities"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2988,"title":"Manager of the Largest Department","titleSlug":"manager-of-the-largest-department"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2989,"title":"Class Performance","titleSlug":"class-performance"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2990,"title":"Loan Types","titleSlug":"loan-types"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2991,"title":"Top Three Wineries","titleSlug":"top-three-wineries"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2992,"title":"Number of Self-Divisible Permutations","titleSlug":"number-of-self-divisible-permutations"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2993,"title":"Friday Purchases I","titleSlug":"friday-purchases-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2994,"title":"Friday Purchases II","titleSlug":"friday-purchases-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2995,"title":"Viewers Turned Streamers","titleSlug":"viewers-turned-streamers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2996,"title":"Smallest Missing Integer Greater Than Sequential Prefix Sum","titleSlug":"smallest-missing-integer-greater-than-sequential-prefix-sum"}
+{"chalengeQuestionDates":["2024-04-29"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2997,"title":"Minimum Number of Operations to Make Array XOR Equal to K","titleSlug":"minimum-number-of-operations-to-make-array-xor-equal-to-k"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2998,"title":"Minimum Number of Operations to Make X and Y Equal","titleSlug":"minimum-number-of-operations-to-make-x-and-y-equal"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2999,"title":"Count the Number of Powerful Integers","titleSlug":"count-the-number-of-powerful-integers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3000,"title":"Maximum Area of Longest Diagonal Rectangle","titleSlug":"maximum-area-of-longest-diagonal-rectangle"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3001,"title":"Minimum Moves to Capture The Queen","titleSlug":"minimum-moves-to-capture-the-queen"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3002,"title":"Maximum Size of a Set After Removals","titleSlug":"maximum-size-of-a-set-after-removals"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3003,"title":"Maximize the Number of Partitions After Operations","titleSlug":"maximize-the-number-of-partitions-after-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3004,"title":"Maximum Subtree of the Same Color","titleSlug":"maximum-subtree-of-the-same-color"}
+{"chalengeQuestionDates":["2024-03-08"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3005,"title":"Count Elements With Maximum Frequency","titleSlug":"count-elements-with-maximum-frequency"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3006,"title":"Find Beautiful Indices in the Given Array I","titleSlug":"find-beautiful-indices-in-the-given-array-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3007,"title":"Maximum Number That Sum of the Prices Is Less Than or Equal to K","titleSlug":"maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3008,"title":"Find Beautiful Indices in the Given Array II","titleSlug":"find-beautiful-indices-in-the-given-array-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3009,"title":"Maximum Number of Intersections on the Chart","titleSlug":"maximum-number-of-intersections-on-the-chart"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3010,"title":"Divide an Array Into Subarrays With Minimum Cost I","titleSlug":"divide-an-array-into-subarrays-with-minimum-cost-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3011,"title":"Find if Array Can Be Sorted","titleSlug":"find-if-array-can-be-sorted"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3012,"title":"Minimize Length of Array Using Operations","titleSlug":"minimize-length-of-array-using-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3013,"title":"Divide an Array Into Subarrays With Minimum Cost II","titleSlug":"divide-an-array-into-subarrays-with-minimum-cost-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3014,"title":"Minimum Number of Pushes to Type Word I","titleSlug":"minimum-number-of-pushes-to-type-word-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3015,"title":"Count the Number of Houses at a Certain Distance I","titleSlug":"count-the-number-of-houses-at-a-certain-distance-i"}
+{"chalengeQuestionDates":["2024-08-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3016,"title":"Minimum Number of Pushes to Type Word II","titleSlug":"minimum-number-of-pushes-to-type-word-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3017,"title":"Count the Number of Houses at a Certain Distance II","titleSlug":"count-the-number-of-houses-at-a-certain-distance-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3018,"title":"Maximum Number of Removal Queries That Can Be Processed I","titleSlug":"maximum-number-of-removal-queries-that-can-be-processed-i"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3019,"title":"Number of Changing Keys","titleSlug":"number-of-changing-keys"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3020,"title":"Find the Maximum Number of Elements in Subset","titleSlug":"find-the-maximum-number-of-elements-in-subset"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3021,"title":"Alice and Bob Playing Flower Game","titleSlug":"alice-and-bob-playing-flower-game"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3022,"title":"Minimize OR of Remaining Elements Using Operations","titleSlug":"minimize-or-of-remaining-elements-using-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3023,"title":"Find Pattern in Infinite Stream I","titleSlug":"find-pattern-in-infinite-stream-i"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3024,"title":"Type of Triangle","titleSlug":"type-of-triangle"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3025,"title":"Find the Number of Ways to Place People I","titleSlug":"find-the-number-of-ways-to-place-people-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3026,"title":"Maximum Good Subarray Sum","titleSlug":"maximum-good-subarray-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3027,"title":"Find the Number of Ways to Place People II","titleSlug":"find-the-number-of-ways-to-place-people-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3028,"title":"Ant on the Boundary","titleSlug":"ant-on-the-boundary"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3029,"title":"Minimum Time to Revert Word to Initial State I","titleSlug":"minimum-time-to-revert-word-to-initial-state-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3030,"title":"Find the Grid of Region Average","titleSlug":"find-the-grid-of-region-average"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3031,"title":"Minimum Time to Revert Word to Initial State II","titleSlug":"minimum-time-to-revert-word-to-initial-state-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3032,"title":"Count Numbers With Unique Digits II","titleSlug":"count-numbers-with-unique-digits-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3033,"title":"Modify the Matrix","titleSlug":"modify-the-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3034,"title":"Number of Subarrays That Match a Pattern I","titleSlug":"number-of-subarrays-that-match-a-pattern-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3035,"title":"Maximum Palindromes After Operations","titleSlug":"maximum-palindromes-after-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3036,"title":"Number of Subarrays That Match a Pattern II","titleSlug":"number-of-subarrays-that-match-a-pattern-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3037,"title":"Find Pattern in Infinite Stream II","titleSlug":"find-pattern-in-infinite-stream-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3038,"title":"Maximum Number of Operations With the Same Score I","titleSlug":"maximum-number-of-operations-with-the-same-score-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3039,"title":"Apply Operations to Make String Empty","titleSlug":"apply-operations-to-make-string-empty"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3040,"title":"Maximum Number of Operations With the Same Score II","titleSlug":"maximum-number-of-operations-with-the-same-score-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3041,"title":"Maximize Consecutive Elements in an Array After Modification","titleSlug":"maximize-consecutive-elements-in-an-array-after-modification"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3042,"title":"Count Prefix and Suffix Pairs I","titleSlug":"count-prefix-and-suffix-pairs-i"}
+{"chalengeQuestionDates":["2024-09-24"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3043,"title":"Find the Length of the Longest Common Prefix","titleSlug":"find-the-length-of-the-longest-common-prefix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3044,"title":"Most Frequent Prime","titleSlug":"most-frequent-prime"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3045,"title":"Count Prefix and Suffix Pairs II","titleSlug":"count-prefix-and-suffix-pairs-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3046,"title":"Split the Array","titleSlug":"split-the-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3047,"title":"Find the Largest Area of Square Inside Two Rectangles","titleSlug":"find-the-largest-area-of-square-inside-two-rectangles"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3048,"title":"Earliest Second to Mark Indices I","titleSlug":"earliest-second-to-mark-indices-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3049,"title":"Earliest Second to Mark Indices II","titleSlug":"earliest-second-to-mark-indices-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3050,"title":"Pizza Toppings Cost Analysis","titleSlug":"pizza-toppings-cost-analysis"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3051,"title":"Find Candidates for Data Scientist Position","titleSlug":"find-candidates-for-data-scientist-position"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3052,"title":"Maximize Items","titleSlug":"maximize-items"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3053,"title":"Classifying Triangles by Lengths","titleSlug":"classifying-triangles-by-lengths"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3054,"title":"Binary Tree Nodes","titleSlug":"binary-tree-nodes"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3055,"title":"Top Percentile Fraud","titleSlug":"top-percentile-fraud"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3056,"title":"Snaps Analysis","titleSlug":"snaps-analysis"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3057,"title":"Employees Project Allocation","titleSlug":"employees-project-allocation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3058,"title":"Friends With No Mutual Friends","titleSlug":"friends-with-no-mutual-friends"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3059,"title":"Find All Unique Email Domains","titleSlug":"find-all-unique-email-domains"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3060,"title":"User Activities within Time Bounds","titleSlug":"user-activities-within-time-bounds"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3061,"title":"Calculate Trapping Rain Water","titleSlug":"calculate-trapping-rain-water"}
+{"chalengeQuestionDates":["2024-03-01"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3062,"title":"Winner of the Linked List Game","titleSlug":"winner-of-the-linked-list-game"}
+{"chalengeQuestionDates":["2024-03-08"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3063,"title":"Linked List Frequency","titleSlug":"linked-list-frequency"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3064,"title":"Guess the Number Using Bitwise Questions I","titleSlug":"guess-the-number-using-bitwise-questions-i"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3065,"title":"Minimum Operations to Exceed Threshold Value I","titleSlug":"minimum-operations-to-exceed-threshold-value-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3066,"title":"Minimum Operations to Exceed Threshold Value II","titleSlug":"minimum-operations-to-exceed-threshold-value-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3067,"title":"Count Pairs of Connectable Servers in a Weighted Tree Network","titleSlug":"count-pairs-of-connectable-servers-in-a-weighted-tree-network"}
+{"chalengeQuestionDates":["2024-05-19"],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3068,"title":"Find the Maximum Sum of Node Values","titleSlug":"find-the-maximum-sum-of-node-values"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3069,"title":"Distribute Elements Into Two Arrays I","titleSlug":"distribute-elements-into-two-arrays-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3070,"title":"Count Submatrices with Top-Left Element and Sum Less Than k","titleSlug":"count-submatrices-with-top-left-element-and-sum-less-than-k"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3071,"title":"Minimum Operations to Write the Letter Y on a Grid","titleSlug":"minimum-operations-to-write-the-letter-y-on-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3072,"title":"Distribute Elements Into Two Arrays II","titleSlug":"distribute-elements-into-two-arrays-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3073,"title":"Maximum Increasing Triplet Value","titleSlug":"maximum-increasing-triplet-value"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3074,"title":"Apple Redistribution into Boxes","titleSlug":"apple-redistribution-into-boxes"}
+{"chalengeQuestionDates":["2024-05-09"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3075,"title":"Maximize Happiness of Selected Children","titleSlug":"maximize-happiness-of-selected-children"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3076,"title":"Shortest Uncommon Substring in an Array","titleSlug":"shortest-uncommon-substring-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3077,"title":"Maximum Strength of K Disjoint Subarrays","titleSlug":"maximum-strength-of-k-disjoint-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3078,"title":"Match Alphanumerical Pattern in Matrix I","titleSlug":"match-alphanumerical-pattern-in-matrix-i"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3079,"title":"Find the Sum of Encrypted Integers","titleSlug":"find-the-sum-of-encrypted-integers"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3080,"title":"Mark Elements on Array by Performing Queries","titleSlug":"mark-elements-on-array-by-performing-queries"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3081,"title":"Replace Question Marks in String to Minimize Its Value","titleSlug":"replace-question-marks-in-string-to-minimize-its-value"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3082,"title":"Find the Sum of the Power of All Subsequences","titleSlug":"find-the-sum-of-the-power-of-all-subsequences"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3083,"title":"Existence of a Substring in a String and Its Reverse","titleSlug":"existence-of-a-substring-in-a-string-and-its-reverse"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3084,"title":"Count Substrings Starting and Ending with Given Character","titleSlug":"count-substrings-starting-and-ending-with-given-character"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3085,"title":"Minimum Deletions to Make String K-Special","titleSlug":"minimum-deletions-to-make-string-k-special"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3086,"title":"Minimum Moves to Pick K Ones","titleSlug":"minimum-moves-to-pick-k-ones"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3087,"title":"Find Trending Hashtags","titleSlug":"find-trending-hashtags"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3088,"title":"Make String Anti-palindrome","titleSlug":"make-string-anti-palindrome"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3089,"title":"Find Bursty Behavior","titleSlug":"find-bursty-behavior"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3090,"title":"Maximum Length Substring With Two Occurrences","titleSlug":"maximum-length-substring-with-two-occurrences"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3091,"title":"Apply Operations to Make Sum of Array Greater Than or Equal to k","titleSlug":"apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3092,"title":"Most Frequent IDs","titleSlug":"most-frequent-ids"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3093,"title":"Longest Common Suffix Queries","titleSlug":"longest-common-suffix-queries"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3094,"title":"Guess the Number Using Bitwise Questions II","titleSlug":"guess-the-number-using-bitwise-questions-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3095,"title":"Shortest Subarray With OR at Least K I","titleSlug":"shortest-subarray-with-or-at-least-k-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3096,"title":"Minimum Levels to Gain More Points","titleSlug":"minimum-levels-to-gain-more-points"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3097,"title":"Shortest Subarray With OR at Least K II","titleSlug":"shortest-subarray-with-or-at-least-k-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3098,"title":"Find the Sum of Subsequence Powers","titleSlug":"find-the-sum-of-subsequence-powers"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3099,"title":"Harshad Number","titleSlug":"harshad-number"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3100,"title":"Water Bottles II","titleSlug":"water-bottles-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3101,"title":"Count Alternating Subarrays","titleSlug":"count-alternating-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3102,"title":"Minimize Manhattan Distances","titleSlug":"minimize-manhattan-distances"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3103,"title":"Find Trending Hashtags II","titleSlug":"find-trending-hashtags-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3104,"title":"Find Longest Self-Contained Substring","titleSlug":"find-longest-self-contained-substring"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3105,"title":"Longest Strictly Increasing or Strictly Decreasing Subarray","titleSlug":"longest-strictly-increasing-or-strictly-decreasing-subarray"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3106,"title":"Lexicographically Smallest String After Operations With Constraint","titleSlug":"lexicographically-smallest-string-after-operations-with-constraint"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3107,"title":"Minimum Operations to Make Median of Array Equal to K","titleSlug":"minimum-operations-to-make-median-of-array-equal-to-k"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3108,"title":"Minimum Cost Walk in Weighted Graph","titleSlug":"minimum-cost-walk-in-weighted-graph"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3109,"title":"Find the Index of Permutation","titleSlug":"find-the-index-of-permutation"}
+{"chalengeQuestionDates":["2024-06-01"],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3110,"title":"Score of a String","titleSlug":"score-of-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3111,"title":"Minimum Rectangles to Cover Points","titleSlug":"minimum-rectangles-to-cover-points"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3112,"title":"Minimum Time to Visit Disappearing Nodes","titleSlug":"minimum-time-to-visit-disappearing-nodes"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3113,"title":"Find the Number of Subarrays Where Boundary Elements Are Maximum","titleSlug":"find-the-number-of-subarrays-where-boundary-elements-are-maximum"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3114,"title":"Latest Time You Can Obtain After Replacing Characters","titleSlug":"latest-time-you-can-obtain-after-replacing-characters"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3115,"title":"Maximum Prime Difference","titleSlug":"maximum-prime-difference"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3116,"title":"Kth Smallest Amount With Single Denomination Combination","titleSlug":"kth-smallest-amount-with-single-denomination-combination"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3117,"title":"Minimum Sum of Values by Dividing Array","titleSlug":"minimum-sum-of-values-by-dividing-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3118,"title":"Friday Purchase III","titleSlug":"friday-purchase-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3119,"title":"Maximum Number of Potholes That Can Be Fixed","titleSlug":"maximum-number-of-potholes-that-can-be-fixed"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3120,"title":"Count the Number of Special Characters I","titleSlug":"count-the-number-of-special-characters-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3121,"title":"Count the Number of Special Characters II","titleSlug":"count-the-number-of-special-characters-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3122,"title":"Minimum Number of Operations to Satisfy Conditions","titleSlug":"minimum-number-of-operations-to-satisfy-conditions"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3123,"title":"Find Edges in Shortest Paths","titleSlug":"find-edges-in-shortest-paths"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3124,"title":"Find Longest Calls","titleSlug":"find-longest-calls"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3125,"title":"Maximum Number That Makes Result of Bitwise AND Zero","titleSlug":"maximum-number-that-makes-result-of-bitwise-and-zero"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3126,"title":"Server Utilization Time","titleSlug":"server-utilization-time"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3127,"title":"Make a Square with the Same Color","titleSlug":"make-a-square-with-the-same-color"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3128,"title":"Right Triangles","titleSlug":"right-triangles"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3129,"title":"Find All Possible Stable Binary Arrays I","titleSlug":"find-all-possible-stable-binary-arrays-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3130,"title":"Find All Possible Stable Binary Arrays II","titleSlug":"find-all-possible-stable-binary-arrays-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3131,"title":"Find the Integer Added to Array I","titleSlug":"find-the-integer-added-to-array-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3132,"title":"Find the Integer Added to Array II","titleSlug":"find-the-integer-added-to-array-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3133,"title":"Minimum Array End","titleSlug":"minimum-array-end"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3134,"title":"Find the Median of the Uniqueness Array","titleSlug":"find-the-median-of-the-uniqueness-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3135,"title":"Equalize Strings by Adding or Removing Characters at Ends","titleSlug":"equalize-strings-by-adding-or-removing-characters-at-ends"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3136,"title":"Valid Word","titleSlug":"valid-word"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3137,"title":"Minimum Number of Operations to Make Word K-Periodic","titleSlug":"minimum-number-of-operations-to-make-word-k-periodic"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3138,"title":"Minimum Length of Anagram Concatenation","titleSlug":"minimum-length-of-anagram-concatenation"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3139,"title":"Minimum Cost to Equalize Array","titleSlug":"minimum-cost-to-equalize-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3140,"title":"Consecutive Available Seats II","titleSlug":"consecutive-available-seats-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3141,"title":"Maximum Hamming Distances","titleSlug":"maximum-hamming-distances"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3142,"title":"Check if Grid Satisfies Conditions","titleSlug":"check-if-grid-satisfies-conditions"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3143,"title":"Maximum Points Inside the Square","titleSlug":"maximum-points-inside-the-square"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3144,"title":"Minimum Substring Partition of Equal Character Frequency","titleSlug":"minimum-substring-partition-of-equal-character-frequency"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3145,"title":"Find Products of Elements of Big Array","titleSlug":"find-products-of-elements-of-big-array"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3146,"title":"Permutation Difference between Two Strings","titleSlug":"permutation-difference-between-two-strings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3147,"title":"Taking Maximum Energy From the Mystic Dungeon","titleSlug":"taking-maximum-energy-from-the-mystic-dungeon"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3148,"title":"Maximum Difference Score in a Grid","titleSlug":"maximum-difference-score-in-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3149,"title":"Find the Minimum Cost Array Permutation","titleSlug":"find-the-minimum-cost-array-permutation"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3150,"title":"Invalid Tweets II","titleSlug":"invalid-tweets-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3151,"title":"Special Array I","titleSlug":"special-array-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3152,"title":"Special Array II","titleSlug":"special-array-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3153,"title":"Sum of Digit Differences of All Pairs","titleSlug":"sum-of-digit-differences-of-all-pairs"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3154,"title":"Find Number of Ways to Reach the K-th Stair","titleSlug":"find-number-of-ways-to-reach-the-k-th-stair"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3155,"title":"Maximum Number of Upgradable Servers","titleSlug":"maximum-number-of-upgradable-servers"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3156,"title":"Employee Task Duration and Concurrent Tasks","titleSlug":"employee-task-duration-and-concurrent-tasks"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3157,"title":"Find the Level of Tree with Minimum Sum","titleSlug":"find-the-level-of-tree-with-minimum-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3158,"title":"Find the XOR of Numbers Which Appear Twice","titleSlug":"find-the-xor-of-numbers-which-appear-twice"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3159,"title":"Find Occurrences of an Element in an Array","titleSlug":"find-occurrences-of-an-element-in-an-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3160,"title":"Find the Number of Distinct Colors Among the Balls","titleSlug":"find-the-number-of-distinct-colors-among-the-balls"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3161,"title":"Block Placement Queries","titleSlug":"block-placement-queries"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3162,"title":"Find the Number of Good Pairs I","titleSlug":"find-the-number-of-good-pairs-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3163,"title":"String Compression III","titleSlug":"string-compression-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3164,"title":"Find the Number of Good Pairs II","titleSlug":"find-the-number-of-good-pairs-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3165,"title":"Maximum Sum of Subsequence With Non-adjacent Elements","titleSlug":"maximum-sum-of-subsequence-with-non-adjacent-elements"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3166,"title":"Calculate Parking Fees and Duration","titleSlug":"calculate-parking-fees-and-duration"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3167,"title":"Better Compression of String","titleSlug":"better-compression-of-string"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3168,"title":"Minimum Number of Chairs in a Waiting Room","titleSlug":"minimum-number-of-chairs-in-a-waiting-room"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3169,"title":"Count Days Without Meetings","titleSlug":"count-days-without-meetings"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3170,"title":"Lexicographically Minimum String After Removing Stars","titleSlug":"lexicographically-minimum-string-after-removing-stars"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3171,"title":"Find Subarray With Bitwise OR Closest to K","titleSlug":"find-subarray-with-bitwise-or-closest-to-k"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3172,"title":"Second Day Verification","titleSlug":"second-day-verification"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3173,"title":"Bitwise OR of Adjacent Elements","titleSlug":"bitwise-or-of-adjacent-elements"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3174,"title":"Clear Digits","titleSlug":"clear-digits"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3175,"title":"Find The First Player to win K Games in a Row","titleSlug":"find-the-first-player-to-win-k-games-in-a-row"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3176,"title":"Find the Maximum Length of a Good Subsequence I","titleSlug":"find-the-maximum-length-of-a-good-subsequence-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3177,"title":"Find the Maximum Length of a Good Subsequence II","titleSlug":"find-the-maximum-length-of-a-good-subsequence-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3178,"title":"Find the Child Who Has the Ball After K Seconds","titleSlug":"find-the-child-who-has-the-ball-after-k-seconds"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3179,"title":"Find the N-th Value After K Seconds","titleSlug":"find-the-n-th-value-after-k-seconds"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3180,"title":"Maximum Total Reward Using Operations I","titleSlug":"maximum-total-reward-using-operations-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3181,"title":"Maximum Total Reward Using Operations II","titleSlug":"maximum-total-reward-using-operations-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3182,"title":"Find Top Scoring Students","titleSlug":"find-top-scoring-students"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3183,"title":"The Number of Ways to Make the Sum","titleSlug":"the-number-of-ways-to-make-the-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3184,"title":"Count Pairs That Form a Complete Day I","titleSlug":"count-pairs-that-form-a-complete-day-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3185,"title":"Count Pairs That Form a Complete Day II","titleSlug":"count-pairs-that-form-a-complete-day-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3186,"title":"Maximum Total Damage With Spell Casting","titleSlug":"maximum-total-damage-with-spell-casting"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3187,"title":"Peaks in Array","titleSlug":"peaks-in-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3188,"title":"Find Top Scoring Students II","titleSlug":"find-top-scoring-students-ii"}
+{"chalengeQuestionDates":["2024-08-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3189,"title":"Minimum Moves to Get a Peaceful Board","titleSlug":"minimum-moves-to-get-a-peaceful-board"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3190,"title":"Find Minimum Operations to Make All Elements Divisible by Three","titleSlug":"find-minimum-operations-to-make-all-elements-divisible-by-three"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3191,"title":"Minimum Operations to Make Binary Array Elements Equal to One I","titleSlug":"minimum-operations-to-make-binary-array-elements-equal-to-one-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3192,"title":"Minimum Operations to Make Binary Array Elements Equal to One II","titleSlug":"minimum-operations-to-make-binary-array-elements-equal-to-one-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3193,"title":"Count the Number of Inversions","titleSlug":"count-the-number-of-inversions"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3194,"title":"Minimum Average of Smallest and Largest Elements","titleSlug":"minimum-average-of-smallest-and-largest-elements"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3195,"title":"Find the Minimum Area to Cover All Ones I","titleSlug":"find-the-minimum-area-to-cover-all-ones-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3196,"title":"Maximize Total Cost of Alternating Subarrays","titleSlug":"maximize-total-cost-of-alternating-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3197,"title":"Find the Minimum Area to Cover All Ones II","titleSlug":"find-the-minimum-area-to-cover-all-ones-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3198,"title":"Find Cities in Each State","titleSlug":"find-cities-in-each-state"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3199,"title":"Count Triplets with Even XOR Set Bits I","titleSlug":"count-triplets-with-even-xor-set-bits-i"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3200,"title":"Maximum Height of a Triangle","titleSlug":"maximum-height-of-a-triangle"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3201,"title":"Find the Maximum Length of Valid Subsequence I","titleSlug":"find-the-maximum-length-of-valid-subsequence-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3202,"title":"Find the Maximum Length of Valid Subsequence II","titleSlug":"find-the-maximum-length-of-valid-subsequence-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3203,"title":"Find Minimum Diameter After Merging Two Trees","titleSlug":"find-minimum-diameter-after-merging-two-trees"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3204,"title":"Bitwise User Permissions Analysis","titleSlug":"bitwise-user-permissions-analysis"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3205,"title":"Maximum Array Hopping Score I","titleSlug":"maximum-array-hopping-score-i"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3206,"title":"Alternating Groups I","titleSlug":"alternating-groups-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3207,"title":"Maximum Points After Enemy Battles","titleSlug":"maximum-points-after-enemy-battles"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3208,"title":"Alternating Groups II","titleSlug":"alternating-groups-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3209,"title":"Number of Subarrays With AND Value of K","titleSlug":"number-of-subarrays-with-and-value-of-k"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3210,"title":"Find the Encrypted String","titleSlug":"find-the-encrypted-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3211,"title":"Generate Binary Strings Without Adjacent Zeros","titleSlug":"generate-binary-strings-without-adjacent-zeros"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3212,"title":"Count Submatrices With Equal Frequency of X and Y","titleSlug":"count-submatrices-with-equal-frequency-of-x-and-y"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3213,"title":"Construct String with Minimum Cost","titleSlug":"construct-string-with-minimum-cost"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3214,"title":"Year on Year Growth Rate","titleSlug":"year-on-year-growth-rate"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3215,"title":"Count Triplets with Even XOR Set Bits II","titleSlug":"count-triplets-with-even-xor-set-bits-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3216,"title":"Lexicographically Smallest String After a Swap","titleSlug":"lexicographically-smallest-string-after-a-swap"}
+{"chalengeQuestionDates":["2024-09-06"],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3217,"title":"Delete Nodes From Linked List Present in Array","titleSlug":"delete-nodes-from-linked-list-present-in-array"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3218,"title":"Minimum Cost for Cutting Cake I","titleSlug":"minimum-cost-for-cutting-cake-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3219,"title":"Minimum Cost for Cutting Cake II","titleSlug":"minimum-cost-for-cutting-cake-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3220,"title":"Odd and Even Transactions","titleSlug":"odd-and-even-transactions"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3221,"title":"Maximum Array Hopping Score II","titleSlug":"maximum-array-hopping-score-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3222,"title":"Find the Winning Player in Coin Game","titleSlug":"find-the-winning-player-in-coin-game"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3223,"title":"Minimum Length of String After Operations","titleSlug":"minimum-length-of-string-after-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3224,"title":"Minimum Array Changes to Make Differences Equal","titleSlug":"minimum-array-changes-to-make-differences-equal"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3225,"title":"Maximum Score From Grid Operations","titleSlug":"maximum-score-from-grid-operations"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3226,"title":"Number of Bit Changes to Make Two Integers Equal","titleSlug":"number-of-bit-changes-to-make-two-integers-equal"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3227,"title":"Vowels Game in a String","titleSlug":"vowels-game-in-a-string"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3228,"title":"Maximum Number of Operations to Move Ones to the End","titleSlug":"maximum-number-of-operations-to-move-ones-to-the-end"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3229,"title":"Minimum Operations to Make Array Equal to Target","titleSlug":"minimum-operations-to-make-array-equal-to-target"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3230,"title":"Customer Purchasing Behavior Analysis","titleSlug":"customer-purchasing-behavior-analysis"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3231,"title":"Minimum Number of Increasing Subsequence to Be Removed","titleSlug":"minimum-number-of-increasing-subsequence-to-be-removed"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3232,"title":"Find if Digit Game Can Be Won","titleSlug":"find-if-digit-game-can-be-won"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3233,"title":"Find the Count of Numbers Which Are Not Special","titleSlug":"find-the-count-of-numbers-which-are-not-special"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3234,"title":"Count the Number of Substrings With Dominant Ones","titleSlug":"count-the-number-of-substrings-with-dominant-ones"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3235,"title":"Check if the Rectangle Corner Is Reachable","titleSlug":"check-if-the-rectangle-corner-is-reachable"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3236,"title":"CEO Subordinate Hierarchy","titleSlug":"ceo-subordinate-hierarchy"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3237,"title":"Alt and Tab Simulation","titleSlug":"alt-and-tab-simulation"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3238,"title":"Find the Number of Winning Players","titleSlug":"find-the-number-of-winning-players"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3239,"title":"Minimum Number of Flips to Make Binary Grid Palindromic I","titleSlug":"minimum-number-of-flips-to-make-binary-grid-palindromic-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3240,"title":"Minimum Number of Flips to Make Binary Grid Palindromic II","titleSlug":"minimum-number-of-flips-to-make-binary-grid-palindromic-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3241,"title":"Time Taken to Mark All Nodes","titleSlug":"time-taken-to-mark-all-nodes"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3242,"title":"Design Neighbor Sum Service","titleSlug":"design-neighbor-sum-service"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3243,"title":"Shortest Distance After Road Addition Queries I","titleSlug":"shortest-distance-after-road-addition-queries-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3244,"title":"Shortest Distance After Road Addition Queries II","titleSlug":"shortest-distance-after-road-addition-queries-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3245,"title":"Alternating Groups III","titleSlug":"alternating-groups-iii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3246,"title":"Premier League Table Ranking","titleSlug":"premier-league-table-ranking"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3247,"title":"Number of Subsequences with Odd Sum","titleSlug":"number-of-subsequences-with-odd-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3248,"title":"Snake in Matrix","titleSlug":"snake-in-matrix"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3249,"title":"Count the Number of Good Nodes","titleSlug":"count-the-number-of-good-nodes"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3250,"title":"Find the Count of Monotonic Pairs I","titleSlug":"find-the-count-of-monotonic-pairs-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3251,"title":"Find the Count of Monotonic Pairs II","titleSlug":"find-the-count-of-monotonic-pairs-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3252,"title":"Premier League Table Ranking II","titleSlug":"premier-league-table-ranking-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3253,"title":"Construct String with Minimum Cost (Easy)","titleSlug":"construct-string-with-minimum-cost-easy"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3254,"title":"Find the Power of K-Size Subarrays I","titleSlug":"find-the-power-of-k-size-subarrays-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3255,"title":"Find the Power of K-Size Subarrays II","titleSlug":"find-the-power-of-k-size-subarrays-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3256,"title":"Maximum Value Sum by Placing Three Rooks I","titleSlug":"maximum-value-sum-by-placing-three-rooks-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3257,"title":"Maximum Value Sum by Placing Three Rooks II","titleSlug":"maximum-value-sum-by-placing-three-rooks-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3258,"title":"Count Substrings That Satisfy K-Constraint I","titleSlug":"count-substrings-that-satisfy-k-constraint-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3259,"title":"Maximum Energy Boost From Two Drinks","titleSlug":"maximum-energy-boost-from-two-drinks"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3260,"title":"Find the Largest Palindrome Divisible by K","titleSlug":"find-the-largest-palindrome-divisible-by-k"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3261,"title":"Count Substrings That Satisfy K-Constraint II","titleSlug":"count-substrings-that-satisfy-k-constraint-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3262,"title":"Find Overlapping Shifts","titleSlug":"find-overlapping-shifts"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3263,"title":"Convert Doubly Linked List to Array I","titleSlug":"convert-doubly-linked-list-to-array-i"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3264,"title":"Final Array State After K Multiplication Operations I","titleSlug":"final-array-state-after-k-multiplication-operations-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3265,"title":"Count Almost Equal Pairs I","titleSlug":"count-almost-equal-pairs-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3266,"title":"Final Array State After K Multiplication Operations II","titleSlug":"final-array-state-after-k-multiplication-operations-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3267,"title":"Count Almost Equal Pairs II","titleSlug":"count-almost-equal-pairs-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3268,"title":"Find Overlapping Shifts II","titleSlug":"find-overlapping-shifts-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3269,"title":"Constructing Two Increasing Arrays","titleSlug":"constructing-two-increasing-arrays"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3270,"title":"Find the Key of the Numbers","titleSlug":"find-the-key-of-the-numbers"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3271,"title":"Hash Divided String","titleSlug":"hash-divided-string"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3272,"title":"Find the Count of Good Integers","titleSlug":"find-the-count-of-good-integers"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3273,"title":"Minimum Amount of Damage Dealt to Bob","titleSlug":"minimum-amount-of-damage-dealt-to-bob"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3274,"title":"Check if Two Chessboard Squares Have the Same Color","titleSlug":"check-if-two-chessboard-squares-have-the-same-color"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3275,"title":"K-th Nearest Obstacle Queries","titleSlug":"k-th-nearest-obstacle-queries"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3276,"title":"Select Cells in Grid With Maximum Score","titleSlug":"select-cells-in-grid-with-maximum-score"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3277,"title":"Maximum XOR Score Subarray Queries","titleSlug":"maximum-xor-score-subarray-queries"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3278,"title":"Find Candidates for Data Scientist Position II","titleSlug":"find-candidates-for-data-scientist-position-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3279,"title":"Maximum Total Area Occupied by Pistons","titleSlug":"maximum-total-area-occupied-by-pistons"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3280,"title":"Convert Date to Binary","titleSlug":"convert-date-to-binary"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3281,"title":"Maximize Score of Numbers in Ranges","titleSlug":"maximize-score-of-numbers-in-ranges"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3282,"title":"Reach End of Array With Max Score","titleSlug":"reach-end-of-array-with-max-score"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3283,"title":"Maximum Number of Moves to Kill All Pawns","titleSlug":"maximum-number-of-moves-to-kill-all-pawns"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3284,"title":"Sum of Consecutive Subarrays","titleSlug":"sum-of-consecutive-subarrays"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3285,"title":"Find Indices of Stable Mountains","titleSlug":"find-indices-of-stable-mountains"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3286,"title":"Find a Safe Walk Through a Grid","titleSlug":"find-a-safe-walk-through-a-grid"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3287,"title":"Find the Maximum Sequence Value of Array","titleSlug":"find-the-maximum-sequence-value-of-array"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3288,"title":"Length of the Longest Increasing Path","titleSlug":"length-of-the-longest-increasing-path"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3289,"title":"The Two Sneaky Numbers of Digitville","titleSlug":"the-two-sneaky-numbers-of-digitville"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3290,"title":"Maximum Multiplication Score","titleSlug":"maximum-multiplication-score"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3291,"title":"Minimum Number of Valid Strings to Form Target I","titleSlug":"minimum-number-of-valid-strings-to-form-target-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3292,"title":"Minimum Number of Valid Strings to Form Target II","titleSlug":"minimum-number-of-valid-strings-to-form-target-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3293,"title":"Calculate Product Final Price","titleSlug":"calculate-product-final-price"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3294,"title":"Convert Doubly Linked List to Array II","titleSlug":"convert-doubly-linked-list-to-array-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3295,"title":"Report Spam Message","titleSlug":"report-spam-message"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3296,"title":"Minimum Number of Seconds to Make Mountain Height Zero","titleSlug":"minimum-number-of-seconds-to-make-mountain-height-zero"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3297,"title":"Count Substrings That Can Be Rearranged to Contain a String I","titleSlug":"count-substrings-that-can-be-rearranged-to-contain-a-string-i"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3298,"title":"Count Substrings That Can Be Rearranged to Contain a String II","titleSlug":"count-substrings-that-can-be-rearranged-to-contain-a-string-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3299,"title":"Sum of Consecutive Subsequences","titleSlug":"sum-of-consecutive-subsequences"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3300,"title":"Minimum Element After Replacement With Digit Sum","titleSlug":"minimum-element-after-replacement-with-digit-sum"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3301,"title":"Maximize the Total Height of Unique Towers","titleSlug":"maximize-the-total-height-of-unique-towers"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3302,"title":"Find the Lexicographically Smallest Valid Sequence","titleSlug":"find-the-lexicographically-smallest-valid-sequence"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3303,"title":"Find the Occurrence of First Almost Equal Substring","titleSlug":"find-the-occurrence-of-first-almost-equal-substring"}
+{"chalengeQuestionDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3304,"title":"Find the K-th Character in String Game I","titleSlug":"find-the-k-th-character-in-string-game-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3305,"title":"Count of Substrings Containing Every Vowel and K Consonants I","titleSlug":"count-of-substrings-containing-every-vowel-and-k-consonants-i"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3306,"title":"Count of Substrings Containing Every Vowel and K Consonants II","titleSlug":"count-of-substrings-containing-every-vowel-and-k-consonants-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3307,"title":"Find the K-th Character in String Game II","titleSlug":"find-the-k-th-character-in-string-game-ii"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3308,"title":"Find Top Performing Driver","titleSlug":"find-top-performing-driver"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3309,"title":"Maximum Possible Number by Binary Concatenation","titleSlug":"maximum-possible-number-by-binary-concatenation"}
+{"chalengeQuestionDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3310,"title":"Remove Methods From Project","titleSlug":"remove-methods-from-project"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3311,"title":"Construct 2D Grid Matching Graph Layout","titleSlug":"construct-2d-grid-matching-graph-layout"}
+{"chalengeQuestionDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3312,"title":"Sorted GCD Pair Queries","titleSlug":"sorted-gcd-pair-queries"}
diff --git a/workspaces/leetcode-api/graphql-codegen.config.ts b/workspaces/leetcode-api/graphql-codegen.config.ts
index 5036f491..39083700 100644
--- a/workspaces/leetcode-api/graphql-codegen.config.ts
+++ b/workspaces/leetcode-api/graphql-codegen.config.ts
@@ -11,18 +11,30 @@ const commonTypeScriptPluginConfig: GraphQLCodegen.PluginConfig = {
   skipTypename: true,
   useTypeImports: true,
 
+  strictScalars: true,
   scalars: {
+    Date: {
+      input: "unknown",
+      output: "string",
+    },
     DateTime: {
       input: "unknown",
       output: "string",
     },
+    Decimal: {
+      input: "unknown",
+      // For example: "4.816"
+      output: "string",
+    },
     JSONString: {
       input: "unknown",
       output: "string",
     },
+    UUID: {
+      input: "string",
+      output: "string",
+    },
   },
-
-  // TODO: add strictScalars: true
 };
 
 const headerPlugin: GraphQLCodegen.OutputConfig = {
diff --git a/workspaces/leetcode-api/src/api/question-list/fetchGraphQL.generated.ts b/workspaces/leetcode-api/src/api/question-list/fetchGraphQL.generated.ts
index 5f9b2fa2..44459a54 100644
--- a/workspaces/leetcode-api/src/api/question-list/fetchGraphQL.generated.ts
+++ b/workspaces/leetcode-api/src/api/question-list/fetchGraphQL.generated.ts
@@ -10,7 +10,7 @@ import type {
 } from "./queryTypes.generated.ts";
 
 export const QUERY =
-  "query($categorySlug:String!,$limit:Int,$skip:Int,$filters:QuestionListFilterInput!){questionList(categorySlug:$categorySlug limit:$limit skip:$skip filters:$filters){data{difficulty isPaidOnly questionFrontendId title titleSlug}totalNum}}";
+  "query($categorySlug:String!,$limit:Int,$skip:Int,$filters:QuestionListFilterInput!){questionList(categorySlug:$categorySlug limit:$limit skip:$skip filters:$filters){data{challengeQuestionsV2{date}difficulty isPaidOnly questionFrontendId title titleSlug}totalNum}}";
 
 export const queryResultZodType = z.object({
   questionList: z.object({
@@ -22,6 +22,11 @@ export const queryResultZodType = z.object({
         questionFrontendId: z.string(),
         title: z.string(),
         titleSlug: z.string(),
+        challengeQuestionsV2: z.array(
+          z.object({
+            date: z.string(),
+          }),
+        ),
       }),
     ),
   }),
diff --git a/workspaces/leetcode-api/src/api/question-list/main.ts b/workspaces/leetcode-api/src/api/question-list/main.ts
index bda40b92..80c8068b 100644
--- a/workspaces/leetcode-api/src/api/question-list/main.ts
+++ b/workspaces/leetcode-api/src/api/question-list/main.ts
@@ -1,18 +1,29 @@
 import { z } from "zod";
 
+import { compareStringsCaseInsensitive } from "@code-chronicles/util/compareStringsCaseInsensitive";
 import { numericIdAsNumberZodType } from "@code-chronicles/util/numericIdAsNumberZodType";
 
 import { fetchGraphQL, type QueryVariables } from "./fetchGraphQL.generated.ts";
 import { questionDifficultyZodType } from "../../zod-types/questionDifficultyZodType.ts";
 import { questionTitleSlugZodType } from "../../zod-types/questionTitleSlugZodType.ts";
 
-const questionZodType = z.object({
-  difficulty: questionDifficultyZodType,
-  isPaidOnly: z.boolean(),
-  questionFrontendId: numericIdAsNumberZodType,
-  title: z.string().trim().min(1),
-  titleSlug: questionTitleSlugZodType,
-});
+const questionZodType = z
+  .object({
+    challengeQuestionsV2: z
+      .array(z.object({ date: z.string() }).transform(({ date }) => date))
+      .transform((dates) =>
+        [...dates].sort(compareStringsCaseInsensitive).reverse(),
+      ),
+    difficulty: questionDifficultyZodType,
+    isPaidOnly: z.boolean(),
+    questionFrontendId: numericIdAsNumberZodType,
+    title: z.string().trim().min(1),
+    titleSlug: questionTitleSlugZodType,
+  })
+  .transform(({ challengeQuestionsV2, ...rest }) => ({
+    chalengeQuestionDates: challengeQuestionsV2,
+    ...rest,
+  }));
 
 export type QuestionListQuestion = z.infer<typeof questionZodType>;
 
diff --git a/workspaces/leetcode-api/src/api/question-list/query.graphql b/workspaces/leetcode-api/src/api/question-list/query.graphql
index ebef6ceb..5149d904 100644
--- a/workspaces/leetcode-api/src/api/question-list/query.graphql
+++ b/workspaces/leetcode-api/src/api/question-list/query.graphql
@@ -11,6 +11,9 @@ query QuestionList(
     filters: $filters
   ) {
     data {
+      challengeQuestionsV2 {
+        date
+      }
       difficulty
       isPaidOnly
       questionFrontendId
diff --git a/workspaces/leetcode-api/src/api/question-list/queryTypes.generated.ts b/workspaces/leetcode-api/src/api/question-list/queryTypes.generated.ts
index d66adbb5..d10cc142 100644
--- a/workspaces/leetcode-api/src/api/question-list/queryTypes.generated.ts
+++ b/workspaces/leetcode-api/src/api/question-list/queryTypes.generated.ts
@@ -19,6 +19,7 @@ export type QuestionListQuery = {
       questionFrontendId: string;
       title: string;
       titleSlug: string;
+      challengeQuestionsV2: Array<{ date: string }>;
     }>;
   };
 };
diff --git a/workspaces/leetcode-api/src/graphqlTypes.generated.ts b/workspaces/leetcode-api/src/graphqlTypes.generated.ts
index df40955c..405e9621 100644
--- a/workspaces/leetcode-api/src/graphqlTypes.generated.ts
+++ b/workspaces/leetcode-api/src/graphqlTypes.generated.ts
@@ -33,7 +33,7 @@ export type Scalars = {
    * value as specified by
    * [iso8601](https://en.wikipedia.org/wiki/ISO_8601).
    */
-  Date: { input: unknown; output: unknown };
+  Date: { input: unknown; output: string };
   /**
    * The `DateTime` scalar type represents a DateTime
    * value as specified by
@@ -41,7 +41,7 @@ export type Scalars = {
    */
   DateTime: { input: unknown; output: string };
   /** The `Decimal` scalar type represents a python Decimal. */
-  Decimal: { input: unknown; output: unknown };
+  Decimal: { input: unknown; output: string };
   /**
    * Allows use of a JSON String for input / output from the GraphQL schema.
    *
@@ -53,7 +53,7 @@ export type Scalars = {
    * Leverages the internal Python implmeentation of UUID (uuid.UUID) to provide native UUID objects
    * in fields, resolvers and input.
    */
-  UUID: { input: unknown; output: unknown };
+  UUID: { input: string; output: string };
 };
 
 export type AcStatsNode = {