leetcode_questions.json

[
    {
        "question_id": 3521,
        "question_title": "Count Triplets with Even XOR Set Bits II"
    },
    {
        "question_id": 3513,
        "question_title": "Maximum Array Hopping Score I"
    },
    {
        "question_id": 3506,
        "question_title": "Count Triplets with Even XOR Set Bits I"
    },
    {
        "question_id": 3504,
        "question_title": "Minimum Moves to Get a Peaceful Board"
    },
    {
        "question_id": 3501,
        "question_title": "Delete Nodes From Linked List Present in Array"
    },
    {
        "question_id": 3500,
        "question_title": "Minimum Cost for Cutting Cake II"
    },
    {
        "question_id": 3494,
        "question_title": "Minimum Cost for Cutting Cake I"
    },
    {
        "question_id": 3492,
        "question_title": "Count Submatrices With Equal Frequency of X and Y"
    },
    {
        "question_id": 3491,
        "question_title": "Find the Maximum Length of Valid Subsequence II"
    },
    {
        "question_id": 3490,
        "question_title": "Find the Maximum Length of Valid Subsequence I"
    },
    {
        "question_id": 3489,
        "question_title": "The Number of Ways to Make the Sum"
    },
    {
        "question_id": 3484,
        "question_title": "Lexicographically Smallest String After a Swap"
    },
    {
        "question_id": 3483,
        "question_title": "Alternating Groups II"
    },
    {
        "question_id": 3482,
        "question_title": "Construct String with Minimum Cost"
    },
    {
        "question_id": 3477,
        "question_title": "Minimum Operations to Make Binary Array Elements Equal to One II"
    },
    {
        "question_id": 3476,
        "question_title": "Find Minimum Operations to Make All Elements Divisible by Three"
    },
    {
        "question_id": 3475,
        "question_title": "Minimum Operations to Make Binary Array Elements Equal to One I"
    },
    {
        "question_id": 3474,
        "question_title": "Better Compression of String"
    },
    {
        "question_id": 3472,
        "question_title": "Bitwise OR of Adjacent Elements"
    },
    {
        "question_id": 3471,
        "question_title": "Minimum Average of Smallest and Largest Elements"
    },
    {
        "question_id": 3469,
        "question_title": "Maximum Height of a Triangle"
    },
    {
        "question_id": 3468,
        "question_title": "Find the Encrypted String"
    },
    {
        "question_id": 3467,
        "question_title": "Find the Level of Tree with Minimum Sum"
    },
    {
        "question_id": 3466,
        "question_title": "Number of Subarrays With AND Value of K"
    },
    {
        "question_id": 3464,
        "question_title": "Maximize Total Cost of Alternating Subarrays"
    },
    {
        "question_id": 3463,
        "question_title": "Alternating Groups I"
    },
    {
        "question_id": 3461,
        "question_title": "Find the Minimum Area to Cover All Ones I"
    },
    {
        "question_id": 3460,
        "question_title": "Count the Number of Inversions"
    },
    {
        "question_id": 3459,
        "question_title": "Find the Minimum Area to Cover All Ones II"
    },
    {
        "question_id": 3458,
        "question_title": "Maximum Number of Upgradable Servers"
    },
    {
        "question_id": 3456,
        "question_title": "Find the Maximum Length of a Good Subsequence I"
    },
    {
        "question_id": 3453,
        "question_title": "Generate Binary Strings Without Adjacent Zeros"
    },
    {
        "question_id": 3452,
        "question_title": "Find the Maximum Length of a Good Subsequence II"
    },
    {
        "question_id": 3451,
        "question_title": "String Compression III"
    },
    {
        "question_id": 3450,
        "question_title": "Find the Child Who Has the Ball After K Seconds"
    },
    {
        "question_id": 3449,
        "question_title": "Maximum Hamming Distances"
    },
    {
        "question_id": 3447,
        "question_title": "Clear Digits"
    },
    {
        "question_id": 3446,
        "question_title": "Find the Number of Good Pairs I"
    },
    {
        "question_id": 3445,
        "question_title": "Lexicographically Minimum String After Removing Stars"
    },
    {
        "question_id": 3444,
        "question_title": "Find the Number of Good Pairs II"
    },
    {
        "question_id": 3443,
        "question_title": "Maximum Total Reward Using Operations II"
    },
    {
        "question_id": 3442,
        "question_title": "Maximum Total Reward Using Operations I"
    },
    {
        "question_id": 3441,
        "question_title": "Equalize Strings by Adding or Removing Characters at Ends"
    },
    {
        "question_id": 3439,
        "question_title": "Find Minimum Diameter After Merging Two Trees"
    },
    {
        "question_id": 3438,
        "question_title": "Peaks in Array"
    },
    {
        "question_id": 3437,
        "question_title": "Maximum Total Damage With Spell Casting"
    },
    {
        "question_id": 3436,
        "question_title": "Find Subarray With Bitwise OR Closest to K"
    },
    {
        "question_id": 3435,
        "question_title": "Block Placement Queries"
    },
    {
        "question_id": 3434,
        "question_title": "Find the Number of Distinct Colors Among the Balls"
    },
    {
        "question_id": 3433,
        "question_title": "Maximum Number That Makes Result of Bitwise AND Zero"
    },
    {
        "question_id": 3431,
        "question_title": "Find the Minimum Cost Array Permutation"
    },
    {
        "question_id": 3430,
        "question_title": "Count Days Without Meetings"
    },
    {
        "question_id": 3429,
        "question_title": "Special Array I"
    },
    {
        "question_id": 3428,
        "question_title": "Find the XOR of Numbers Which Appear Twice"
    },
    {
        "question_id": 3427,
        "question_title": "Special Array II"
    },
    {
        "question_id": 3426,
        "question_title": "Minimum Number of Chairs in a Waiting Room"
    },
    {
        "question_id": 3425,
        "question_title": "Maximum Number of Potholes That Can Be Fixed"
    },
    {
        "question_id": 3423,
        "question_title": "Maximum Sum of Subsequence With Non-adjacent Elements"
    },
    {
        "question_id": 3422,
        "question_title": "Find the N-th Value After K Seconds"
    },
    {
        "question_id": 3421,
        "question_title": "Count Pairs That Form a Complete Day I"
    },
    {
        "question_id": 3420,
        "question_title": "Find Occurrences of an Element in an Array"
    },
    {
        "question_id": 3419,
        "question_title": "Maximum Points Inside the Square"
    },
    {
        "question_id": 3418,
        "question_title": "Count Pairs That Form a Complete Day II"
    },
    {
        "question_id": 3417,
        "question_title": "Find the Index of Permutation"
    },
    {
        "question_id": 3416,
        "question_title": "Sum of Digit Differences of All Pairs"
    },
    {
        "question_id": 3415,
        "question_title": "Check if Grid Satisfies Conditions"
    },
    {
        "question_id": 3414,
        "question_title": "Find Number of Ways to Reach the K-th Stair"
    },
    {
        "question_id": 3413,
        "question_title": "Find The First Player to win K Games in a Row"
    },
    {
        "question_id": 3412,
        "question_title": "Permutation Difference between Two Strings"
    },
    {
        "question_id": 3411,
        "question_title": "Find Products of Elements of Big Array"
    },
    {
        "question_id": 3410,
        "question_title": "Find Longest Self-Contained Substring"
    },
    {
        "question_id": 3408,
        "question_title": "Count the Number of Special Characters I"
    },
    {
        "question_id": 3407,
        "question_title": "Find All Possible Stable Binary Arrays II"
    },
    {
        "question_id": 3406,
        "question_title": "Find All Possible Stable Binary Arrays I"
    },
    {
        "question_id": 3405,
        "question_title": "Count the Number of Special Characters II"
    },
    {
        "question_id": 3404,
        "question_title": "Minimum Number of Operations to Satisfy Conditions"
    },
    {
        "question_id": 3403,
        "question_title": "Minimum Substring Partition of Equal Character Frequency"
    },
    {
        "question_id": 3402,
        "question_title": "Minimum Cost to Equalize Array"
    },
    {
        "question_id": 3401,
        "question_title": "Guess the Number Using Bitwise Questions II"
    },
    {
        "question_id": 3399,
        "question_title": "Find the Integer Added to Array II"
    },
    {
        "question_id": 3398,
        "question_title": "Make a Square with the Same Color"
    },
    {
        "question_id": 3397,
        "question_title": "Find the Integer Added to Array I"
    },
    {
        "question_id": 3396,
        "question_title": "Valid Word"
    },
    {
        "question_id": 3395,
        "question_title": "Minimum Length of Anagram Concatenation"
    },
    {
        "question_id": 3394,
        "question_title": "Minimum Array End"
    },
    {
        "question_id": 3393,
        "question_title": "Make String Anti-palindrome"
    },
    {
        "question_id": 3391,
        "question_title": "Maximum Difference Score in a Grid"
    },
    {
        "question_id": 3390,
        "question_title": "Minimum Rectangles to Cover Points"
    },
    {
        "question_id": 3389,
        "question_title": "Minimum Time to Visit Disappearing Nodes"
    },
    {
        "question_id": 3388,
        "question_title": "Right Triangles"
    },
    {
        "question_id": 3387,
        "question_title": "Minimum Operations to Make Median of Array Equal to K"
    },
    {
        "question_id": 3386,
        "question_title": "Find Edges in Shortest Paths"
    },
    {
        "question_id": 3385,
        "question_title": "Match Alphanumerical Pattern in Matrix I"
    },
    {
        "question_id": 3384,
        "question_title": "Minimum Number of Operations to Make Word K-Periodic"
    },
    {
        "question_id": 3383,
        "question_title": "Taking Maximum Energy From the Mystic Dungeon"
    },
    {
        "question_id": 3382,
        "question_title": "Find the Number of Subarrays Where Boundary Elements Are Maximum"
    },
    {
        "question_id": 3381,
        "question_title": "Shortest Subarray With OR at Least K I"
    },
    {
        "question_id": 3380,
        "question_title": "Shortest Subarray With OR at Least K II"
    },
    {
        "question_id": 3379,
        "question_title": "Score of a String"
    },
    {
        "question_id": 3378,
        "question_title": "Maximum Increasing Triplet Value"
    },
    {
        "question_id": 3376,
        "question_title": "Longest Common Suffix Queries"
    },
    {
        "question_id": 3375,
        "question_title": "Kth Smallest Amount With Single Denomination Combination"
    },
    {
        "question_id": 3374,
        "question_title": "Count Alternating Subarrays"
    },
    {
        "question_id": 3373,
        "question_title": "Maximum Prime Difference"
    },
    {
        "question_id": 3372,
        "question_title": "Longest Strictly Increasing or Strictly Decreasing Subarray"
    },
    {
        "question_id": 3371,
        "question_title": "Harshad Number"
    },
    {
        "question_id": 3370,
        "question_title": "Guess the Number Using Bitwise Questions I"
    },
    {
        "question_id": 3368,
        "question_title": "Winner of the Linked List Game"
    },
    {
        "question_id": 3367,
        "question_title": "Find the Sum of Encrypted Integers"
    },
    {
        "question_id": 3364,
        "question_title": "Minimum Sum of Values by Dividing Array"
    },
    {
        "question_id": 3363,
        "question_title": "Most Frequent IDs"
    },
    {
        "question_id": 3362,
        "question_title": "Find the Median of the Uniqueness Array"
    },
    {
        "question_id": 3361,
        "question_title": "Latest Time You Can Obtain After Replacing Characters"
    },
    {
        "question_id": 3360,
        "question_title": "Minimum Deletions to Make String K-Special"
    },
    {
        "question_id": 3359,
        "question_title": "Linked List Frequency"
    },
    {
        "question_id": 3356,
        "question_title": "Shortest Uncommon Substring in an Array"
    },
    {
        "question_id": 3355,
        "question_title": "Minimum Levels to Gain More Points"
    },
    {
        "question_id": 3354,
        "question_title": "Replace Question Marks in String to Minimize Its Value"
    },
    {
        "question_id": 3353,
        "question_title": "Existence of a Substring in a String and Its Reverse"
    },
    {
        "question_id": 3352,
        "question_title": "Find Pattern in Infinite Stream II"
    },
    {
        "question_id": 3351,
        "question_title": "Maximize Happiness of Selected Children"
    },
    {
        "question_id": 3350,
        "question_title": "Distribute Elements Into Two Arrays II"
    },
    {
        "question_id": 3349,
        "question_title": "Maximum Length Substring With Two Occurrences"
    },
    {
        "question_id": 3348,
        "question_title": "Minimum Cost Walk in Weighted Graph"
    },
    {
        "question_id": 3347,
        "question_title": "Distribute Elements Into Two Arrays I"
    },
    {
        "question_id": 3346,
        "question_title": "Lexicographically Smallest String After Operations With Constraint"
    },
    {
        "question_id": 3345,
        "question_title": "Find the Sum of the Power of All Subsequences"
    },
    {
        "question_id": 3344,
        "question_title": "Minimize Manhattan Distances"
    },
    {
        "question_id": 3343,
        "question_title": "Count Numbers With Unique Digits II"
    },
    {
        "question_id": 3338,
        "question_title": "Count Submatrices with Top-Left Element and Sum Less Than k"
    },
    {
        "question_id": 3337,
        "question_title": "Count Substrings Starting and Ending with Given Character"
    },
    {
        "question_id": 3336,
        "question_title": "Water Bottles II"
    },
    {
        "question_id": 3335,
        "question_title": "Minimum Operations to Write the Letter Y on a Grid"
    },
    {
        "question_id": 3334,
        "question_title": "Apple Redistribution into Boxes"
    },
    {
        "question_id": 3333,
        "question_title": "Find Pattern in Infinite Stream I"
    },
    {
        "question_id": 3332,
        "question_title": "Minimum Operations to Exceed Threshold Value II"
    },
    {
        "question_id": 3331,
        "question_title": "Minimum Operations to Exceed Threshold Value I"
    },
    {
        "question_id": 3330,
        "question_title": "Modify the Matrix"
    },
    {
        "question_id": 3329,
        "question_title": "Find the Length of the Longest Common Prefix"
    },
    {
        "question_id": 3328,
        "question_title": "Apply Operations to Make Sum of Array Greater Than or Equal to k"
    },
    {
        "question_id": 3327,
        "question_title": "Minimum Moves to Pick K Ones"
    },
    {
        "question_id": 3326,
        "question_title": "Count Pairs of Connectable Servers in a Weighted Tree Network"
    },
    {
        "question_id": 3325,
        "question_title": "Find the Largest Area of Square Inside Two Rectangles"
    },
    {
        "question_id": 3324,
        "question_title": "Split the Array"
    },
    {
        "question_id": 3323,
        "question_title": "Maximum Number of Removal Queries That Can Be Processed I"
    },
    {
        "question_id": 3321,
        "question_title": "Type of Triangle"
    },
    {
        "question_id": 3320,
        "question_title": "Maximum Number of Operations With the Same Score I"
    },
    {
        "question_id": 3318,
        "question_title": "Maximum Number of Operations With the Same Score II"
    },
    {
        "question_id": 3317,
        "question_title": "Maximum Palindromes After Operations"
    },
    {
        "question_id": 3316,
        "question_title": "Find the Sum of Subsequence Powers"
    },
    {
        "question_id": 3315,
        "question_title": "Maximum Number of Intersections on the Chart"
    },
    {
        "question_id": 3314,
        "question_title": "Most Frequent Prime"
    },
    {
        "question_id": 3313,
        "question_title": "Maximum Strength of K Disjoint Subarrays"
    },
    {
        "question_id": 3312,
        "question_title": "Number of Changing Keys"
    },
    {
        "question_id": 3311,
        "question_title": "Ant on the Boundary"
    },
    {
        "question_id": 3310,
        "question_title": "Count the Number of Houses at a Certain Distance II"
    },
    {
        "question_id": 3309,
        "question_title": "Count Prefix and Suffix Pairs I"
    },
    {
        "question_id": 3308,
        "question_title": "Apply Operations to Make String Empty"
    },
    {
        "question_id": 3307,
        "question_title": "Find the Maximum Sum of Node Values"
    },
    {
        "question_id": 3306,
        "question_title": "Mark Elements on Array by Performing Queries"
    },
    {
        "question_id": 3305,
        "question_title": "Count Prefix and Suffix Pairs II"
    },
    {
        "question_id": 3304,
        "question_title": "Maximum Subtree of the Same Color"
    },
    {
        "question_id": 3303,
        "question_title": "Find Beautiful Indices in the Given Array II"
    },
    {
        "question_id": 3299,
        "question_title": "Find the Maximum Number of Elements in Subset"
    },
    {
        "question_id": 3298,
        "question_title": "Maximize Consecutive Elements in an Array After Modification"
    },
    {
        "question_id": 3297,
        "question_title": "Minimum Time to Revert Word to Initial State I"
    },
    {
        "question_id": 3296,
        "question_title": "Minimum Time to Revert Word to Initial State II"
    },
    {
        "question_id": 3294,
        "question_title": "Number of Self-Divisible Permutations"
    },
    {
        "question_id": 3292,
        "question_title": "Earliest Second to Mark Indices I"
    },
    {
        "question_id": 3291,
        "question_title": "Find if Array Can Be Sorted"
    },
    {
        "question_id": 3290,
        "question_title": "Number of Subarrays That Match a Pattern II"
    },
    {
        "question_id": 3289,
        "question_title": "Earliest Second to Mark Indices II"
    },
    {
        "question_id": 3279,
        "question_title": "Alice and Bob Playing Flower Game"
    },
    {
        "question_id": 3278,
        "question_title": "Find the Number of Ways to Place People I"
    },
    {
        "question_id": 3277,
        "question_title": "Find the Number of Ways to Place People II"
    },
    {
        "question_id": 3276,
        "question_title": "Minimum Number of Pushes to Type Word II"
    },
    {
        "question_id": 3275,
        "question_title": "Minimum Number of Pushes to Type Word I"
    },
    {
        "question_id": 3273,
        "question_title": "Most Expensive Item That Can Not Be Bought"
    },
    {
        "question_id": 3272,
        "question_title": "Find the Grid of Region Average"
    },
    {
        "question_id": 3271,
        "question_title": "Count the Number of Houses at a Certain Distance I"
    },
    {
        "question_id": 3270,
        "question_title": "Minimum Moves to Capture The Queen"
    },
    {
        "question_id": 3269,
        "question_title": "Number of Subarrays That Match a Pattern I"
    },
    {
        "question_id": 3268,
        "question_title": "Minimum Number of Coins for Fruits II"
    },
    {
        "question_id": 3267,
        "question_title": "Find Longest Special Substring That Occurs Thrice I"
    },
    {
        "question_id": 3266,
        "question_title": "Find Longest Special Substring That Occurs Thrice II"
    },
    {
        "question_id": 3265,
        "question_title": "Maximum Good Subarray Sum"
    },
    {
        "question_id": 3264,
        "question_title": "Maximum Points After Enemy Battles"
    },
    {
        "question_id": 3263,
        "question_title": "Divide an Array Into Subarrays With Minimum Cost I"
    },
    {
        "question_id": 3262,
        "question_title": "Find Polygon With the Largest Perimeter"
    },
    {
        "question_id": 3261,
        "question_title": "Minimize OR of Remaining Elements Using Operations"
    },
    {
        "question_id": 3260,
        "question_title": "Divide an Array Into Subarrays With Minimum Cost II"
    },
    {
        "question_id": 3254,
        "question_title": "Number of Divisible Triplet Sums"
    },
    {
        "question_id": 3252,
        "question_title": "Count the Number of Incremovable Subarrays I"
    },
    {
        "question_id": 3251,
        "question_title": "Maximum Area of Longest Diagonal Rectangle"
    },
    {
        "question_id": 3250,
        "question_title": "Maximum Square Area by Removing Fences From a Field"
    },
    {
        "question_id": 3249,
        "question_title": "Minimum Number of Operations to Make Array XOR Equal to K"
    },
    {
        "question_id": 3248,
        "question_title": "Count the Number of Incremovable Subarrays II"
    },
    {
        "question_id": 3247,
        "question_title": "Number of Same-End Substrings"
    },
    {
        "question_id": 3246,
        "question_title": "Check if Bitwise OR Has Trailing Zeros"
    },
    {
        "question_id": 3245,
        "question_title": "Find Beautiful Indices in the Given Array I"
    },
    {
        "question_id": 3244,
        "question_title": "Minimize Length of Array Using Operations"
    },
    {
        "question_id": 3243,
        "question_title": "Count the Number of Powerful Integers"
    },
    {
        "question_id": 3242,
        "question_title": "Count Elements With Maximum Frequency"
    },
    {
        "question_id": 3241,
        "question_title": "Divide Array Into Arrays With Max Difference"
    },
    {
        "question_id": 3240,
        "question_title": "Maximum Number That Sum of the Prices Is Less Than or Equal to K"
    },
    {
        "question_id": 3239,
        "question_title": "Minimum Number of Operations to Make X and Y Equal"
    },
    {
        "question_id": 3238,
        "question_title": "Minimum Cost to Convert String II"
    },
    {
        "question_id": 3237,
        "question_title": "Number of Divisible Substrings"
    },
    {
        "question_id": 3236,
        "question_title": "Smallest Missing Integer Greater Than Sequential Prefix Sum"
    },
    {
        "question_id": 3235,
        "question_title": "Minimum Cost to Convert String I"
    },
    {
        "question_id": 3234,
        "question_title": "Double Modular Exponentiation"
    },
    {
        "question_id": 3233,
        "question_title": "Maximize the Number of Partitions After Operations"
    },
    {
        "question_id": 3232,
        "question_title": "Maximum GCD-Sum of a Subarray"
    },
    {
        "question_id": 3231,
        "question_title": "Minimum Number of Coins to be Added"
    },
    {
        "question_id": 3230,
        "question_title": "Remove Adjacent Almost-Equal Characters"
    },
    {
        "question_id": 3229,
        "question_title": "Minimum Cost to Make Array Equalindromic"
    },
    {
        "question_id": 3228,
        "question_title": "Maximum Size of a Set After Removals"
    },
    {
        "question_id": 3227,
        "question_title": "Find Missing and Repeated Values"
    },
    {
        "question_id": 3226,
        "question_title": "Minimum Number Game"
    },
    {
        "question_id": 3225,
        "question_title": "Length of Longest Subarray With at Most K Frequency"
    },
    {
        "question_id": 3224,
        "question_title": "Count the Number of Infection Sequences"
    },
    {
        "question_id": 3223,
        "question_title": "Count Complete Substrings"
    },
    {
        "question_id": 3222,
        "question_title": "Number of Equal Numbers Blocks"
    },
    {
        "question_id": 3221,
        "question_title": "Find the Peaks"
    },
    {
        "question_id": 3220,
        "question_title": "Count Tested Devices After Test Operations"
    },
    {
        "question_id": 3219,
        "question_title": "Make Lexicographically Smallest Array by Swapping Elements"
    },
    {
        "question_id": 3218,
        "question_title": "Find Number of Coins to Place in Tree Nodes"
    },
    {
        "question_id": 3217,
        "question_title": "Number of Possible Sets of Closing Branches"
    },
    {
        "question_id": 3216,
        "question_title": "Distribute Candies Among Children III"
    },
    {
        "question_id": 3215,
        "question_title": "Matrix Similarity After Cyclic Shifts"
    },
    {
        "question_id": 3214,
        "question_title": "Maximize Area of Square Hole in Grid"
    },
    {
        "question_id": 3213,
        "question_title": "Count Subarrays Where Max Element Appears at Least K Times"
    },
    {
        "question_id": 3212,
        "question_title": "Count the Number of Good Partitions"
    },
    {
        "question_id": 3211,
        "question_title": "Find Maximum Non-decreasing Array Length"
    },
    {
        "question_id": 3210,
        "question_title": "Count Beautiful Substrings I"
    },
    {
        "question_id": 3209,
        "question_title": "Minimum Number of Coins for Fruits"
    },
    {
        "question_id": 3208,
        "question_title": "Count Beautiful Substrings II"
    },
    {
        "question_id": 3207,
        "question_title": "Make Three Strings Equal"
    },
    {
        "question_id": 3206,
        "question_title": "Find Common Elements Between Two Arrays"
    },
    {
        "question_id": 3204,
        "question_title": "Maximum Profitable Triplets With Increasing Prices II"
    },
    {
        "question_id": 3203,
        "question_title": "Palindrome Rearrangement Queries"
    },
    {
        "question_id": 3202,
        "question_title": "High-Access Employees"
    },
    {
        "question_id": 3201,
        "question_title": "Distribute Candies Among Children II"
    },
    {
        "question_id": 3200,
        "question_title": "Number of Strings Which Can Be Rearranged to Contain Substring"
    },
    {
        "question_id": 3199,
        "question_title": "Distribute Candies Among Children I"
    },
    {
        "question_id": 3198,
        "question_title": "Number of Ways to Reach Destination in the Grid"
    },
    {
        "question_id": 3197,
        "question_title": "Maximum Strong Pair XOR II"
    },
    {
        "question_id": 3196,
        "question_title": "Apply Operations to Maximize Frequency Score"
    },
    {
        "question_id": 3195,
        "question_title": "Separate Black and White Balls"
    },
    {
        "question_id": 3194,
        "question_title": "Find Words Containing Character"
    },
    {
        "question_id": 3193,
        "question_title": "Maximum Strong Pair XOR I"
    },
    {
        "question_id": 3192,
        "question_title": "Maximum Xor Product"
    },
    {
        "question_id": 3191,
        "question_title": "Maximum Score After Applying Operations on a Tree"
    },
    {
        "question_id": 3190,
        "question_title": "Minimum Operations to Maximize Last Elements in Arrays"
    },
    {
        "question_id": 3189,
        "question_title": "Find Champion II"
    },
    {
        "question_id": 3188,
        "question_title": "Find Champion I"
    },
    {
        "question_id": 3187,
        "question_title": "Maximum Profitable Triplets With Increasing Prices I"
    },
    {
        "question_id": 3186,
        "question_title": "Minimum Sum of Mountain Triplets II"
    },
    {
        "question_id": 3184,
        "question_title": "Maximum Balanced Subsequence Sum"
    },
    {
        "question_id": 3183,
        "question_title": "Find the K-or of an Array"
    },
    {
        "question_id": 3182,
        "question_title": "Maximum Linear Stock Score"
    },
    {
        "question_id": 3181,
        "question_title": "Find Building Where Alice and Bob Can Meet"
    },
    {
        "question_id": 3179,
        "question_title": "Maximum Points After Collecting Coins From All Nodes"
    },
    {
        "question_id": 3178,
        "question_title": "Minimum Increment Operations to Make Array Beautiful"
    },
    {
        "question_id": 3177,
        "question_title": "Minimizing Array After Replacing Pairs With Their Product"
    },
    {
        "question_id": 3176,
        "question_title": "Minimum Sum of Mountain Triplets I"
    },
    {
        "question_id": 3174,
        "question_title": "Minimum Number of Changes to Make Binary String Beautiful"
    },
    {
        "question_id": 3173,
        "question_title": "The Wording Game"
    },
    {
        "question_id": 3172,
        "question_title": "Divisible and Non-divisible Sums Difference"
    },
    {
        "question_id": 3171,
        "question_title": "Minimum Equal Sum of Two Arrays After Replacing Zeros"
    },
    {
        "question_id": 3170,
        "question_title": "Find Indices With Index and Value Difference II"
    },
    {
        "question_id": 3166,
        "question_title": "Minimum Number of Groups to Create a Valid Assignment"
    },
    {
        "question_id": 3165,
        "question_title": "Find Indices With Index and Value Difference I"
    },
    {
        "question_id": 3164,
        "question_title": "Last Visited Integers"
    },
    {
        "question_id": 3163,
        "question_title": "Subarrays Distinct Element Sum of Squares I"
    },
    {
        "question_id": 3158,
        "question_title": "Maximum Length of Semi-Decreasing Subarrays"
    },
    {
        "question_id": 3154,
        "question_title": "Maximum Value of an Ordered Triplet I"
    },
    {
        "question_id": 3153,
        "question_title": "Apply Operations on Array to Maximize Sum of Squares"
    },
    {
        "question_id": 3152,
        "question_title": "Maximum Value of an Ordered Triplet II"
    },
    {
        "question_id": 3151,
        "question_title": "Minimum Processing Time"
    },
    {
        "question_id": 3150,
        "question_title": "Shortest and Lexicographically Smallest Beautiful String"
    },
    {
        "question_id": 3148,
        "question_title": "Sum of Remoteness of All Cells"
    },
    {
        "question_id": 3143,
        "question_title": "Longest Unequal Adjacent Groups Subsequence I"
    },
    {
        "question_id": 3142,
        "question_title": "Longest Unequal Adjacent Groups Subsequence II"
    },
    {
        "question_id": 3141,
        "question_title": "Minimum Size Subarray in Infinite Array"
    },
    {
        "question_id": 3140,
        "question_title": "Count Visited Nodes in a Directed Graph"
    },
    {
        "question_id": 3139,
        "question_title": "Subarrays Distinct Element Sum of Squares II"
    },
    {
        "question_id": 3114,
        "question_title": "Beautiful Towers I"
    },
    {
        "question_id": 3113,
        "question_title": "Beautiful Towers II"
    },
    {
        "question_id": 3112,
        "question_title": "Count Valid Paths in a Tree"
    },
    {
        "question_id": 3111,
        "question_title": "Smallest Number With Given Digit Product"
    },
    {
        "question_id": 3107,
        "question_title": "Maximum Spending After Buying Items"
    },
    {
        "question_id": 3106,
        "question_title": "Length of the Longest Subsequence That Sums to Target"
    },
    {
        "question_id": 3105,
        "question_title": "Minimum Edge Reversals So Every Node Is Reachable"
    },
    {
        "question_id": 3104,
        "question_title": "Happy Students"
    },
    {
        "question_id": 3101,
        "question_title": "Maximum Coins Heroes Can Collect"
    },
    {
        "question_id": 3095,
        "question_title": "Maximum Number of Alloys"
    },
    {
        "question_id": 3094,
        "question_title": "Minimum Number of Operations to Make Array Empty"
    },
    {
        "question_id": 3093,
        "question_title": "Sum of Values at Indices With K Set Bits"
    },
    {
        "question_id": 3092,
        "question_title": "Minimum Moves to Spread Stones Over Grid"
    },
    {
        "question_id": 3091,
        "question_title": "Count of Sub-Multisets With Bounded Sum"
    },
    {
        "question_id": 3088,
        "question_title": "Maximal Range That Each Element Is Maximum in It"
    },
    {
        "question_id": 3081,
        "question_title": "Minimum Array Length After Pair Removals"
    },
    {
        "question_id": 3080,
        "question_title": "Split Array Into Maximum Number of Subarrays"
    },
    {
        "question_id": 3079,
        "question_title": "Minimum Edge Weight Equilibrium Queries in a Tree"
    },
    {
        "question_id": 3077,
        "question_title": "Minimum Relative Loss After Buying Chocolates"
    },
    {
        "question_id": 3058,
        "question_title": "Maximum Number of K-Divisible Components"
    },
    {
        "question_id": 3057,
        "question_title": "Count K-Subsequences of a String With Maximum Beauty"
    },
    {
        "question_id": 3056,
        "question_title": "Determine if a Cell Is Reachable at a Given Time"
    },
    {
        "question_id": 3055,
        "question_title": "Maximum Odd Binary Number"
    },
    {
        "question_id": 3047,
        "question_title": "Maximum Element-Sum of a Complete Subset of Indices"
    },
    {
        "question_id": 3046,
        "question_title": "Minimum Operations to Make a Special Number"
    },
    {
        "question_id": 3045,
        "question_title": "Minimum Right Shifts to Sort the Array"
    },
    {
        "question_id": 3044,
        "question_title": "Minimum Operations to Collect Elements"
    },
    {
        "question_id": 3043,
        "question_title": "Minimum Time Takes to Reach Destination Without Drowning"
    },
    {
        "question_id": 3034,
        "question_title": "Points That Intersect With Cars"
    },
    {
        "question_id": 3033,
        "question_title": "Apply Operations to Make Two Strings Equal"
    },
    {
        "question_id": 3032,
        "question_title": "Maximize Value of Function in a Ball Passing Game"
    },
    {
        "question_id": 3031,
        "question_title": "Construct Product Matrix"
    },
    {
        "question_id": 3030,
        "question_title": "Find The K-th Lucky Number"
    },
    {
        "question_id": 3026,
        "question_title": "Find the Minimum Possible Sum of a Beautiful Array"
    },
    {
        "question_id": 3025,
        "question_title": "Minimum Operations to Form Subsequence With Target Sum"
    },
    {
        "question_id": 3024,
        "question_title": "String Transformation"
    },
    {
        "question_id": 3019,
        "question_title": "Furthest Point From Origin"
    },
    {
        "question_id": 3018,
        "question_title": "Make String a Subsequence Using Cyclic Increments"
    },
    {
        "question_id": 3017,
        "question_title": "Number of Beautiful Integers in the Range"
    },
    {
        "question_id": 3016,
        "question_title": "Count Nodes That Are Great Enough"
    },
    {
        "question_id": 3001,
        "question_title": "Apply Operations to Maximize Score"
    },
    {
        "question_id": 3000,
        "question_title": "Minimum Absolute Difference Between Elements With Constraint"
    },
    {
        "question_id": 2999,
        "question_title": "Check if Strings Can be Made Equal With Operations I"
    },
    {
        "question_id": 2998,
        "question_title": "  Count Symmetric Integers"
    },
    {
        "question_id": 2995,
        "question_title": "Number of Unique Categories"
    },
    {
        "question_id": 2979,
        "question_title": "Maximize the Profit as the Salesman"
    },
    {
        "question_id": 2978,
        "question_title": "Check if Strings Can be Made Equal With Operations II"
    },
    {
        "question_id": 2977,
        "question_title": "Check if a String Is an Acronym of Words"
    },
    {
        "question_id": 2955,
        "question_title": "Account Balance After Rounded Purchase"
    },
    {
        "question_id": 2954,
        "question_title": "Maximum Sum of Almost Unique Subarray"
    },
    {
        "question_id": 2953,
        "question_title": "Count Pairs of Points With Distance k"
    },
    {
        "question_id": 2952,
        "question_title": "Minimum Time to Make Array Sum At Most x"
    },
    {
        "question_id": 2944,
        "question_title": "Height of Special Binary Tree"
    },
    {
        "question_id": 2921,
        "question_title": "Count Stepping Numbers in Range"
    },
    {
        "question_id": 2920,
        "question_title": "Minimum Seconds to Equalize a Circular Array"
    },
    {
        "question_id": 2919,
        "question_title": "Maximum Number of Groups With Increasing Length"
    },
    {
        "question_id": 2918,
        "question_title": "Is Array a Preorder of Some \u200cBinary Tree"
    },
    {
        "question_id": 2917,
        "question_title": "Count Pairs Whose Sum is Less than Target"
    },
    {
        "question_id": 2916,
        "question_title": "Check if it is Possible to Split Array"
    },
    {
        "question_id": 2915,
        "question_title": "Count of Interesting Subarrays"
    },
    {
        "question_id": 2914,
        "question_title": "Find the Safest Path in a Grid"
    },
    {
        "question_id": 2905,
        "question_title": "Count Paths That Can Form a Palindrome in a Tree"
    },
    {
        "question_id": 2904,
        "question_title": "Sorting Three Groups"
    },
    {
        "question_id": 2903,
        "question_title": "Insert Greatest Common Divisors in Linked List"
    },
    {
        "question_id": 2902,
        "question_title": "Max Pair Sum in an Array"
    },
    {
        "question_id": 2897,
        "question_title": "Count Houses in a Circular Street II"
    },
    {
        "question_id": 2894,
        "question_title": "Maximum Elegance of a K-Length Subsequence"
    },
    {
        "question_id": 2893,
        "question_title": "Visit Array Positions to Maximize Score"
    },
    {
        "question_id": 2892,
        "question_title": "Check if Array is Good"
    },
    {
        "question_id": 2891,
        "question_title": "Maximum Beauty of an Array After Applying Operation"
    },
    {
        "question_id": 2890,
        "question_title": "Count Substrings Without Repeating Character"
    },
    {
        "question_id": 2889,
        "question_title": "Number of Black Blocks"
    },
    {
        "question_id": 2888,
        "question_title": "Minimum Index of a Valid Split"
    },
    {
        "question_id": 2887,
        "question_title": "Sort Vowels in a String"
    },
    {
        "question_id": 2886,
        "question_title": "Faulty Keyboard"
    },
    {
        "question_id": 2884,
        "question_title": "Length of the Longest Valid Substring"
    },
    {
        "question_id": 2883,
        "question_title": "Partition String Into Minimum Beautiful Substrings"
    },
    {
        "question_id": 2882,
        "question_title": "Ways to Express an Integer as Sum of Powers"
    },
    {
        "question_id": 2881,
        "question_title": "Split Strings by Separator"
    },
    {
        "question_id": 2880,
        "question_title": "Find the Closest Marked Node"
    },
    {
        "question_id": 2879,
        "question_title": "Minimum Changes to Make K Semi-palindromes"
    },
    {
        "question_id": 2878,
        "question_title": "Apply Operations to Make All Array Elements Equal to Zero"
    },
    {
        "question_id": 2877,
        "question_title": "Shortest String That Contains Three Strings"
    },
    {
        "question_id": 2876,
        "question_title": "Number of Employees Who Met the Target"
    },
    {
        "question_id": 2875,
        "question_title": "Count Houses in a Circular Street"
    },
    {
        "question_id": 2873,
        "question_title": "Prime Pairs With Target Sum"
    },
    {
        "question_id": 2872,
        "question_title": "Largest Element in an Array after Merge Operations"
    },
    {
        "question_id": 2871,
        "question_title": "Double a Number Represented as a Linked List"
    },
    {
        "question_id": 2870,
        "question_title": "Longest Alternating Subarray"
    },
    {
        "question_id": 2869,
        "question_title": "Longest Non-decreasing Subarray From Two Arrays"
    },
    {
        "question_id": 2868,
        "question_title": "Continuous Subarrays"
    },
    {
        "question_id": 2867,
        "question_title": "Ways to Split Array Into Good Subarrays"
    },
    {
        "question_id": 2866,
        "question_title": "Longest Even Odd Subarray With Threshold"
    },
    {
        "question_id": 2865,
        "question_title": "Find Shortest Path with K Hops"
    },
    {
        "question_id": 2857,
        "question_title": "Total Distance Traveled"
    },
    {
        "question_id": 2856,
        "question_title": "Count Complete Subarrays in an Array"
    },
    {
        "question_id": 2855,
        "question_title": "Maximum Number of Jumps to Reach the Last Index"
    },
    {
        "question_id": 2854,
        "question_title": "Decremental String Concatenation"
    },
    {
        "question_id": 2850,
        "question_title": "Construct the Longest New String"
    },
    {
        "question_id": 2849,
        "question_title": "Sum of Imbalance Numbers of All Subarrays"
    },
    {
        "question_id": 2848,
        "question_title": "Special Permutations"
    },
    {
        "question_id": 2847,
        "question_title": "Find Maximum Number of String Pairs"
    },
    {
        "question_id": 2846,
        "question_title": "Robot Collisions"
    },
    {
        "question_id": 2845,
        "question_title": "Find the Value of the Partition"
    },
    {
        "question_id": 2844,
        "question_title": "Sum of Squares of Special Elements "
    },
    {
        "question_id": 2843,
        "question_title": "Extract Kth Character From The Rope Tree"
    },
    {
        "question_id": 2839,
        "question_title": "Maximum Sum Queries"
    },
    {
        "question_id": 2838,
        "question_title": "Sum of Matrix After Queries"
    },
    {
        "question_id": 2837,
        "question_title": "Minimum Operations to Make the Integer Zero"
    },
    {
        "question_id": 2836,
        "question_title": "Neither Minimum nor Maximum"
    },
    {
        "question_id": 2835,
        "question_title": "Split a Circular Linked List"
    },
    {
        "question_id": 2834,
        "question_title": "Relocate Marbles"
    },
    {
        "question_id": 2833,
        "question_title": "Count Zero Request Servers"
    },
    {
        "question_id": 2832,
        "question_title": "Find the Longest Equal Subarray"
    },
    {
        "question_id": 2831,
        "question_title": "Number of Beautiful Pairs"
    },
    {
        "question_id": 2828,
        "question_title": "Lexicographically Smallest String After Substring Operation"
    },
    {
        "question_id": 2827,
        "question_title": "Greatest Common Divisor Traversal"
    },
    {
        "question_id": 2826,
        "question_title": "Find a Good Subset of the Matrix"
    },
    {
        "question_id": 2825,
        "question_title": "Minimize String Length"
    },
    {
        "question_id": 2824,
        "question_title": "Check if The Number is Fascinating"
    },
    {
        "question_id": 2823,
        "question_title": "The Knight\u2019s Tour"
    },
    {
        "question_id": 2819,
        "question_title": "Remove Trailing Zeros From a String"
    },
    {
        "question_id": 2818,
        "question_title": "Maximum Strictly Increasing Cells in a Matrix"
    },
    {
        "question_id": 2817,
        "question_title": "Minimum Cost to Make All Characters Equal"
    },
    {
        "question_id": 2816,
        "question_title": "Lexicographically Smallest Palindrome"
    },
    {
        "question_id": 2815,
        "question_title": "Find Maximal Uncovered Ranges"
    },
    {
        "question_id": 2812,
        "question_title": "Find the Maximum Achievable Number"
    },
    {
        "question_id": 2811,
        "question_title": "Determine the Minimum Sum of a k-avoiding Array"
    },
    {
        "question_id": 2810,
        "question_title": "Collecting Chocolates"
    },
    {
        "question_id": 2808,
        "question_title": "Painting the Walls"
    },
    {
        "question_id": 2803,
        "question_title": "Modify Graph Edge Weights"
    },
    {
        "question_id": 2802,
        "question_title": "Find the Punishment Number of an Integer"
    },
    {
        "question_id": 2801,
        "question_title": "Difference of Number of Distinct Values on Diagonals"
    },
    {
        "question_id": 2800,
        "question_title": "Minimum String Length After Removing Substrings"
    },
    {
        "question_id": 2794,
        "question_title": "Maximum Number of Moves in a Grid"
    },
    {
        "question_id": 2793,
        "question_title": "Count the Number of Complete Components"
    },
    {
        "question_id": 2792,
        "question_title": "Neighboring Bitwise XOR"
    },
    {
        "question_id": 2791,
        "question_title": "Find the Losers of the Circular Game"
    },
    {
        "question_id": 2787,
        "question_title": "Movement of Robots"
    },
    {
        "question_id": 2786,
        "question_title": "Find the Longest Semi-Repetitive Substring"
    },
    {
        "question_id": 2785,
        "question_title": "Semi-Ordered Permutation"
    },
    {
        "question_id": 2784,
        "question_title": "Power of Heroes"
    },
    {
        "question_id": 2780,
        "question_title": "Make Costs of Paths Equal in a Binary Tree"
    },
    {
        "question_id": 2779,
        "question_title": "Number of Adjacent Elements With the Same Color"
    },
    {
        "question_id": 2778,
        "question_title": "Frequency Tracker"
    },
    {
        "question_id": 2777,
        "question_title": "Find the Distinct Difference Array"
    },
    {
        "question_id": 2767,
        "question_title": "Maximum Sum With Exactly K Elements "
    },
    {
        "question_id": 2766,
        "question_title": "Find the Prefix Common Array of Two Arrays"
    },
    {
        "question_id": 2765,
        "question_title": "Make Array Empty"
    },
    {
        "question_id": 2764,
        "question_title": "Maximum Number of Fish in a Grid"
    },
    {
        "question_id": 2757,
        "question_title": "Count of Integers"
    },
    {
        "question_id": 2756,
        "question_title": "Buy Two Chocolates"
    },
    {
        "question_id": 2755,
        "question_title": "Extra Characters in a String"
    },
    {
        "question_id": 2754,
        "question_title": "Maximum Strength of a Group"
    },
    {
        "question_id": 2753,
        "question_title": "Minimum Number of Operations to Make All Array Elements Equal to 1"
    },
    {
        "question_id": 2752,
        "question_title": "Sum Multiples"
    },
    {
        "question_id": 2751,
        "question_title": "Sliding Subarray Beauty"
    },
    {
        "question_id": 2748,
        "question_title": "Calculate Delayed Arrival Time"
    },
    {
        "question_id": 2739,
        "question_title": "Minimize the Total Price of the Trips"
    },
    {
        "question_id": 2738,
        "question_title": "Count the Number of K-Free Subsets"
    },
    {
        "question_id": 2737,
        "question_title": "Row With Maximum Ones"
    },
    {
        "question_id": 2736,
        "question_title": "Minimum Additions to Make Valid String"
    },
    {
        "question_id": 2730,
        "question_title": "Maximum OR"
    },
    {
        "question_id": 2729,
        "question_title": "Minimum Operations to Make Numbers Non-positive"
    },
    {
        "question_id": 2728,
        "question_title": "Sum in a Matrix"
    },
    {
        "question_id": 2727,
        "question_title": "Number of Senior Citizens"
    },
    {
        "question_id": 2726,
        "question_title": "Minimum Reverse Operations"
    },
    {
        "question_id": 2725,
        "question_title": "Mice and Cheese"
    },
    {
        "question_id": 2724,
        "question_title": "Convert an Array Into a 2D Array With Conditions"
    },
    {
        "question_id": 2723,
        "question_title": "Find the Longest Balanced Substring of a Binary String"
    },
    {
        "question_id": 2722,
        "question_title": "Prime In Diagonal"
    },
    {
        "question_id": 2721,
        "question_title": "Sum of Distances"
    },
    {
        "question_id": 2720,
        "question_title": "Minimize the Maximum Difference of Pairs"
    },
    {
        "question_id": 2719,
        "question_title": "Beautiful Pairs"
    },
    {
        "question_id": 2718,
        "question_title": "Minimum Operations to Make All Array Elements Equal"
    },
    {
        "question_id": 2717,
        "question_title": "Collect Coins in a Tree"
    },
    {
        "question_id": 2716,
        "question_title": "Prime Subtraction Operation"
    },
    {
        "question_id": 2715,
        "question_title": "K Items With the Maximum Sum"
    },
    {
        "question_id": 2714,
        "question_title": "Left and Right Sum Differences"
    },
    {
        "question_id": 2713,
        "question_title": "Find the Divisibility Array of a String"
    },
    {
        "question_id": 2712,
        "question_title": "Find the Maximum Number of Marked Indices"
    },
    {
        "question_id": 2711,
        "question_title": "Minimum Time to Visit a Cell In a Grid"
    },
    {
        "question_id": 2710,
        "question_title": "Minimum Operations to Reduce an Integer to 0"
    },
    {
        "question_id": 2709,
        "question_title": "Count the Number of Square-Free Subsets"
    },
    {
        "question_id": 2708,
        "question_title": "Find the String with LCP"
    },
    {
        "question_id": 2707,
        "question_title": "Merge Two 2D Arrays by Summing Values"
    },
    {
        "question_id": 2706,
        "question_title": "Minimum Score by Changing Two Elements"
    },
    {
        "question_id": 2705,
        "question_title": "Minimum Impossible OR"
    },
    {
        "question_id": 2704,
        "question_title": "Maximum Difference by Remapping a Digit"
    },
    {
        "question_id": 2703,
        "question_title": "Handling Sum Queries After Update"
    },
    {
        "question_id": 2702,
        "question_title": "Maximum Number of Integers to Choose From a Range II"
    },
    {
        "question_id": 2701,
        "question_title": "Subsequence With the Minimum Score"
    },
    {
        "question_id": 2700,
        "question_title": "Substring XOR Queries"
    },
    {
        "question_id": 2699,
        "question_title": "Count the Number of Fair Pairs"
    },
    {
        "question_id": 2698,
        "question_title": "Find the Array Concatenation Value"
    },
    {
        "question_id": 2697,
        "question_title": "Minimum Number of Visited Cells in a Grid"
    },
    {
        "question_id": 2696,
        "question_title": "The Number of Beautiful Subsets"
    },
    {
        "question_id": 2695,
        "question_title": "Find Score of an Array After Marking All Elements"
    },
    {
        "question_id": 2694,
        "question_title": "Find the Maximum Divisibility Score"
    },
    {
        "question_id": 2693,
        "question_title": "Maximum Price to Fill a Bag"
    },
    {
        "question_id": 2692,
        "question_title": "Take Gifts From the Richest Pile"
    },
    {
        "question_id": 2691,
        "question_title": "Count Vowel Strings in Ranges"
    },
    {
        "question_id": 2690,
        "question_title": "House Robber IV"
    },
    {
        "question_id": 2689,
        "question_title": "Rearranging Fruits"
    },
    {
        "question_id": 2688,
        "question_title": "Design a Todo List"
    },
    {
        "question_id": 2687,
        "question_title": "Lexicographically Smallest Beautiful String"
    },
    {
        "question_id": 2686,
        "question_title": "Minimum Cost of a Path With Special Roads"
    },
    {
        "question_id": 2685,
        "question_title": "First Completely Painted Row or Column"
    },
    {
        "question_id": 2684,
        "question_title": "Determine the Winner of a Bowling Game"
    },
    {
        "question_id": 2683,
        "question_title": "Count the Number of Good Subsequences"
    },
    {
        "question_id": 2682,
        "question_title": "Count Increasing Quadruplets"
    },
    {
        "question_id": 2681,
        "question_title": "Put Marbles in Bags"
    },
    {
        "question_id": 2680,
        "question_title": "Count Collisions of Monkeys on a Polygon"
    },
    {
        "question_id": 2679,
        "question_title": "Count Distinct Numbers on Board"
    },
    {
        "question_id": 2678,
        "question_title": "Design Graph With Shortest Path Calculator"
    },
    {
        "question_id": 2677,
        "question_title": "Cousins in Binary Tree II"
    },
    {
        "question_id": 2676,
        "question_title": "Find the Score of All Prefixes of an Array"
    },
    {
        "question_id": 2675,
        "question_title": "Find the Width of Columns of a Grid"
    },
    {
        "question_id": 2674,
        "question_title": "Make the Prefix Sum Non-negative"
    },
    {
        "question_id": 2673,
        "question_title": "Maximize Win From Two Segments"
    },
    {
        "question_id": 2672,
        "question_title": "Number of Good Binary Strings"
    },
    {
        "question_id": 2671,
        "question_title": "Shortest Cycle in a Graph"
    },
    {
        "question_id": 2670,
        "question_title": "Make K-Subarray Sums Equal"
    },
    {
        "question_id": 2669,
        "question_title": "Find the Substring With Maximum Cost"
    },
    {
        "question_id": 2668,
        "question_title": "Form Smallest Number From Two Digit Arrays"
    },
    {
        "question_id": 2667,
        "question_title": "Maximum Frequency Score of a Subarray"
    },
    {
        "question_id": 2666,
        "question_title": "Minimum Time to Eat All Grains"
    },
    {
        "question_id": 2665,
        "question_title": "Minimum Time to Repair Cars"
    },
    {
        "question_id": 2664,
        "question_title": "Maximize Greatness of an Array"
    },
    {
        "question_id": 2663,
        "question_title": "Distribute Money to Maximum Children"
    },
    {
        "question_id": 2662,
        "question_title": "Check Knight Tour Configuration"
    },
    {
        "question_id": 2661,
        "question_title": "Smallest Missing Non-negative Integer After Operations"
    },
    {
        "question_id": 2659,
        "question_title": "Number of Even and Odd Bits"
    },
    {
        "question_id": 2658,
        "question_title": "Count the Number of K-Big Indices"
    },
    {
        "question_id": 2657,
        "question_title": "Minimum Time to Complete All Tasks"
    },
    {
        "question_id": 2656,
        "question_title": "Count the Number of Beautiful Subarrays"
    },
    {
        "question_id": 2655,
        "question_title": "Rearrange Array to Maximize Prefix Score"
    },
    {
        "question_id": 2654,
        "question_title": "Count the Number of Vowel Strings in Range"
    },
    {
        "question_id": 2653,
        "question_title": "Check if There is a Path With Equal Number of 0's And 1's"
    },
    {
        "question_id": 2652,
        "question_title": "Count Number of Possible Root Nodes"
    },
    {
        "question_id": 2651,
        "question_title": "Count Ways to Group Overlapping Ranges"
    },
    {
        "question_id": 2650,
        "question_title": "Split With Minimum Sum"
    },
    {
        "question_id": 2649,
        "question_title": "Count Total Number of Colored Cells"
    },
    {
        "question_id": 2648,
        "question_title": "Number of Ways to Earn Points"
    },
    {
        "question_id": 2647,
        "question_title": "Split the Array to Make Coprime Products"
    },
    {
        "question_id": 2646,
        "question_title": "Kth Largest Sum in a Binary Tree"
    },
    {
        "question_id": 2645,
        "question_title": "Pass the Pillow"
    },
    {
        "question_id": 2644,
        "question_title": "Bitwise OR of All Subsequence Sums"
    },
    {
        "question_id": 2642,
        "question_title": "Time to Cross a Bridge"
    },
    {
        "question_id": 2641,
        "question_title": "Disconnect Path in a Binary Matrix by at Most One Flip"
    },
    {
        "question_id": 2640,
        "question_title": "Maximum Number of Integers to Choose From a Range I"
    },
    {
        "question_id": 2639,
        "question_title": "Separate the Digits in an Array"
    },
    {
        "question_id": 2638,
        "question_title": "Number of Subarrays Having Even Product"
    },
    {
        "question_id": 2636,
        "question_title": "Maximum Subsequence Score"
    },
    {
        "question_id": 2635,
        "question_title": "Check if Point Is Reachable"
    },
    {
        "question_id": 2634,
        "question_title": "Minimum Common Value"
    },
    {
        "question_id": 2633,
        "question_title": "Minimum Cost to Split an Array"
    },
    {
        "question_id": 2632,
        "question_title": "Apply Bitwise Operations to Make Strings Equal"
    },
    {
        "question_id": 2631,
        "question_title": "Sort the Students by Their Kth Score"
    },
    {
        "question_id": 2630,
        "question_title": "Alternating Digit Sum"
    },
    {
        "question_id": 2629,
        "question_title": "Number of Substrings With Fixed Ratio"
    },
    {
        "question_id": 2628,
        "question_title": "Minimize the Maximum of Two Arrays"
    },
    {
        "question_id": 2627,
        "question_title": "Difference Between Maximum and Minimum Price Sum"
    },
    {
        "question_id": 2626,
        "question_title": "Count the Number of Good Subarrays"
    },
    {
        "question_id": 2625,
        "question_title": "Increment Submatrices by One"
    },
    {
        "question_id": 2624,
        "question_title": "Difference Between Element Sum and Digit Sum of an Array"
    },
    {
        "question_id": 2623,
        "question_title": "Maximum XOR of Two Non-Overlapping Subtrees"
    },
    {
        "question_id": 2621,
        "question_title": "Find Xor-Beauty of Array"
    },
    {
        "question_id": 2620,
        "question_title": "Find Consecutive Integers from a Data Stream"
    },
    {
        "question_id": 2619,
        "question_title": "Categorize Box According to Criteria"
    },
    {
        "question_id": 2618,
        "question_title": "Maximize the Minimum Powered City"
    },
    {
        "question_id": 2617,
        "question_title": "Time Taken to Cross the Door"
    },
    {
        "question_id": 2616,
        "question_title": "Maximal Score After Applying K Operations"
    },
    {
        "question_id": 2615,
        "question_title": "Make Number of Distinct Characters Equal"
    },
    {
        "question_id": 2614,
        "question_title": "Maximum Count of Positive Integer and Negative Integer"
    },
    {
        "question_id": 2612,
        "question_title": "Minimum Cost to Buy Apples"
    },
    {
        "question_id": 2610,
        "question_title": "Closest Prime Numbers in Range"
    },
    {
        "question_id": 2609,
        "question_title": "Distinct Prime Factors of Product of Array"
    },
    {
        "question_id": 2608,
        "question_title": "Count the Digits That Divide a Number"
    },
    {
        "question_id": 2607,
        "question_title": "Minimum Subarrays in a Valid Split"
    },
    {
        "question_id": 2606,
        "question_title": "Difference Between Ones and Zeros in Row and Column"
    },
    {
        "question_id": 2605,
        "question_title": "Count Anagrams"
    },
    {
        "question_id": 2604,
        "question_title": "Minimum Operations to Make Array Equal II"
    },
    {
        "question_id": 2603,
        "question_title": "Reward Top K Students"
    },
    {
        "question_id": 2602,
        "question_title": "Maximum Enemy Forts That Can Be Captured"
    },
    {
        "question_id": 2601,
        "question_title": "Number of Great Partitions"
    },
    {
        "question_id": 2600,
        "question_title": "Maximum Tastiness of Candy Basket"
    },
    {
        "question_id": 2599,
        "question_title": "Take K of Each Character From Left and Right"
    },
    {
        "question_id": 2598,
        "question_title": "Shortest Distance to Target String in a Circular Array"
    },
    {
        "question_id": 2597,
        "question_title": "Cycle Length Queries in a Tree"
    },
    {
        "question_id": 2596,
        "question_title": "Add Edges to Make Degrees of All Nodes Even"
    },
    {
        "question_id": 2595,
        "question_title": "Smallest Value After Replacing With Sum of Prime Factors"
    },
    {
        "question_id": 2594,
        "question_title": "Count Pairs Of Similar Strings"
    },
    {
        "question_id": 2593,
        "question_title": "Number of Distinct Binary Strings After Applying Operations"
    },
    {
        "question_id": 2592,
        "question_title": "Minimum Total Cost to Make Arrays Unequal"
    },
    {
        "question_id": 2591,
        "question_title": "Frog Jump II"
    },
    {
        "question_id": 2590,
        "question_title": "Maximum Star Sum of a Graph"
    },
    {
        "question_id": 2589,
        "question_title": "Maximum Value of a String in an Array"
    },
    {
        "question_id": 2588,
        "question_title": "Maximum Number of Points From Grid Queries"
    },
    {
        "question_id": 2587,
        "question_title": "Design Memory Allocator"
    },
    {
        "question_id": 2586,
        "question_title": "Longest Square Streak in an Array"
    },
    {
        "question_id": 2585,
        "question_title": "Delete Greatest Value in Each Row"
    },
    {
        "question_id": 2584,
        "question_title": "Number of Nodes With Value One"
    },
    {
        "question_id": 2583,
        "question_title": "Divide Nodes Into the Maximum Number of Groups"
    },
    {
        "question_id": 2582,
        "question_title": "Minimum Score of a Path Between Two Cities"
    },
    {
        "question_id": 2581,
        "question_title": "Divide Players Into Teams of Equal Skill"
    },
    {
        "question_id": 2580,
        "question_title": "Circular Sentence"
    },
    {
        "question_id": 2579,
        "question_title": "Minimum Split Into Subarrays With GCD Greater Than One"
    },
    {
        "question_id": 2577,
        "question_title": "Count Palindromic Subsequences"
    },
    {
        "question_id": 2576,
        "question_title": "Minimum Penalty for a Shop"
    },
    {
        "question_id": 2575,
        "question_title": "Minimum Cuts to Divide a Circle"
    },
    {
        "question_id": 2574,
        "question_title": "Count Subarrays With Median K"
    },
    {
        "question_id": 2573,
        "question_title": "Remove Nodes From Linked List"
    },
    {
        "question_id": 2572,
        "question_title": "Append Characters to String to Make Subsequence"
    },
    {
        "question_id": 2571,
        "question_title": "Find the Pivot Integer"
    },
    {
        "question_id": 2570,
        "question_title": "Maximize Total Tastiness of Purchased Fruits"
    },
    {
        "question_id": 2569,
        "question_title": "Number of Beautiful Partitions"
    },
    {
        "question_id": 2568,
        "question_title": "Minimum Fuel Cost to Report to the Capital"
    },
    {
        "question_id": 2567,
        "question_title": "Closest Nodes Queries in a Binary Search Tree"
    },
    {
        "question_id": 2566,
        "question_title": "Number of Unequal Triplets in Array"
    },
    {
        "question_id": 2565,
        "question_title": "Merge Operations to Turn Array Into a Palindrome"
    },
    {
        "question_id": 2564,
        "question_title": "Most Profitable Path in a Tree"
    },
    {
        "question_id": 2563,
        "question_title": "Split Message Based on Limit"
    },
    {
        "question_id": 2562,
        "question_title": "Count Ways To Build Good Strings"
    },
    {
        "question_id": 2561,
        "question_title": "Number of Distinct Averages"
    },
    {
        "question_id": 2560,
        "question_title": "Closest Fair Integer"
    },
    {
        "question_id": 2559,
        "question_title": "Maximum Number of Non-overlapping Palindrome Substrings"
    },
    {
        "question_id": 2558,
        "question_title": "Minimum Number of Operations to Sort a Binary Tree by Level"
    },
    {
        "question_id": 2557,
        "question_title": "Number of Subarrays With LCM Equal to K"
    },
    {
        "question_id": 2556,
        "question_title": "Convert the Temperature"
    },
    {
        "question_id": 2555,
        "question_title": "Design SQL"
    },
    {
        "question_id": 2554,
        "question_title": "Minimum Total Distance Traveled"
    },
    {
        "question_id": 2553,
        "question_title": "Total Cost to Hire K Workers"
    },
    {
        "question_id": 2552,
        "question_title": "Maximum Sum of Distinct Subarrays With Length K"
    },
    {
        "question_id": 2551,
        "question_title": "Apply Operations to an Array"
    },
    {
        "question_id": 2550,
        "question_title": "Words Within Two Edits of Dictionary"
    },
    {
        "question_id": 2549,
        "question_title": "Next Greater Element IV"
    },
    {
        "question_id": 2548,
        "question_title": "Destroy Sequential Targets"
    },
    {
        "question_id": 2547,
        "question_title": "Odd String Difference"
    },
    {
        "question_id": 2546,
        "question_title": "Number of Subarrays With GCD Equal to K"
    },
    {
        "question_id": 2545,
        "question_title": "Height of Binary Tree After Subtree Removal Queries"
    },
    {
        "question_id": 2544,
        "question_title": "Minimum Addition to Make Integer Beautiful"
    },
    {
        "question_id": 2543,
        "question_title": "Most Popular Video Creator"
    },
    {
        "question_id": 2542,
        "question_title": "Average Value of Even Numbers That Are Divisible by Three"
    },
    {
        "question_id": 2541,
        "question_title": "Sum of Number and Its Reverse"
    },
    {
        "question_id": 2540,
        "question_title": "Color the Triangle Red"
    },
    {
        "question_id": 2539,
        "question_title": "Minimum Number of Operations to Make Arrays Similar"
    },
    {
        "question_id": 2538,
        "question_title": "Minimum Cost to Make Array Equal"
    },
    {
        "question_id": 2537,
        "question_title": "Minimum Time to Kill All Monsters"
    },
    {
        "question_id": 2536,
        "question_title": "Determine if Two Events Have Conflict"
    },
    {
        "question_id": 2535,
        "question_title": "Count Strictly Increasing Subarrays"
    },
    {
        "question_id": 2533,
        "question_title": "Bitwise XOR of All Pairings"
    },
    {
        "question_id": 2532,
        "question_title": "Remove Letter To Equalize Frequency"
    },
    {
        "question_id": 2531,
        "question_title": "Create Components With Same Value"
    },
    {
        "question_id": 2530,
        "question_title": "Minimize Maximum of Array"
    },
    {
        "question_id": 2529,
        "question_title": "Range Product Queries of Powers"
    },
    {
        "question_id": 2528,
        "question_title": "Number of Valid Clock Times"
    },
    {
        "question_id": 2527,
        "question_title": "Count Subarrays With Fixed Bounds"
    },
    {
        "question_id": 2526,
        "question_title": "Longest Increasing Subsequence II"
    },
    {
        "question_id": 2525,
        "question_title": "Count Number of Distinct Integers After Reverse Operations"
    },
    {
        "question_id": 2524,
        "question_title": "Largest Positive Integer That Exists With Its Negative"
    },
    {
        "question_id": 2522,
        "question_title": "Median of a Row Wise Sorted Matrix"
    },
    {
        "question_id": 2521,
        "question_title": "Paths in Matrix Whose Sum Is Divisible by K"
    },
    {
        "question_id": 2520,
        "question_title": "Using a Robot to Print the Lexicographically Smallest String"
    },
    {
        "question_id": 2519,
        "question_title": "Find The Original Array of Prefix Xor"
    },
    {
        "question_id": 2518,
        "question_title": "The Employee That Worked on the Longest Task"
    },
    {
        "question_id": 2517,
        "question_title": "Choose Edges to Maximize Score in a Tree"
    },
    {
        "question_id": 2513,
        "question_title": "Number of Pairs Satisfying Inequality"
    },
    {
        "question_id": 2512,
        "question_title": "Longest Uploaded Prefix"
    },
    {
        "question_id": 2511,
        "question_title": "Partition String Into Substrings With Values at Most K"
    },
    {
        "question_id": 2510,
        "question_title": "Maximum Deletions on a String"
    },
    {
        "question_id": 2509,
        "question_title": "Minimize XOR"
    },
    {
        "question_id": 2508,
        "question_title": "Maximum Sum of an Hourglass"
    },
    {
        "question_id": 2507,
        "question_title": "Number of Common Factors"
    },
    {
        "question_id": 2506,
        "question_title": "Minimize Maximum Value in a Grid"
    },
    {
        "question_id": 2505,
        "question_title": "Number of Good Paths"
    },
    {
        "question_id": 2504,
        "question_title": "Find All Good Indices"
    },
    {
        "question_id": 2503,
        "question_title": "Longest Subarray With Maximum Bitwise AND"
    },
    {
        "question_id": 2502,
        "question_title": "Sort the People"
    },
    {
        "question_id": 2500,
        "question_title": "Minimum Costs Using the Train Line"
    },
    {
        "question_id": 2499,
        "question_title": "Minimum Money Required Before Transactions"
    },
    {
        "question_id": 2498,
        "question_title": "Smallest Subarrays With Maximum Bitwise OR"
    },
    {
        "question_id": 2497,
        "question_title": "Maximum Matching of Players With Trainers"
    },
    {
        "question_id": 2496,
        "question_title": "Count Days Spent Together"
    },
    {
        "question_id": 2494,
        "question_title": "Sum of Prefix Scores of Strings"
    },
    {
        "question_id": 2493,
        "question_title": "Reverse Odd Levels of Binary Tree"
    },
    {
        "question_id": 2492,
        "question_title": "Length of the Longest Alphabetical Continuous Substring"
    },
    {
        "question_id": 2491,
        "question_title": "Smallest Even Multiple"
    },
    {
        "question_id": 2490,
        "question_title": "Maximum Number of Books You Can Take"
    },
    {
        "question_id": 2489,
        "question_title": "Sort Array by Moving Items to Empty Space"
    },
    {
        "question_id": 2488,
        "question_title": "Divide Intervals Into Minimum Number of Groups"
    },
    {
        "question_id": 2487,
        "question_title": "Optimal Partition of String"
    },
    {
        "question_id": 2486,
        "question_title": "Most Frequent Even Element"
    },
    {
        "question_id": 2485,
        "question_title": "Finding the Number of Visible Mountains"
    },
    {
        "question_id": 2483,
        "question_title": "Task Scheduler II"
    },
    {
        "question_id": 2482,
        "question_title": "Maximum Rows Covered by Columns"
    },
    {
        "question_id": 2481,
        "question_title": "Strictly Palindromic Number"
    },
    {
        "question_id": 2480,
        "question_title": "Find Subarrays With Equal Sum"
    },
    {
        "question_id": 2479,
        "question_title": "Meeting Rooms III"
    },
    {
        "question_id": 2478,
        "question_title": "Longest Nice Subarray"
    },
    {
        "question_id": 2477,
        "question_title": "Number of Ways to Reach a Position After Exactly k Steps"
    },
    {
        "question_id": 2476,
        "question_title": "Check Distances Between Same Letters"
    },
    {
        "question_id": 2475,
        "question_title": "Largest Palindromic Number"
    },
    {
        "question_id": 2474,
        "question_title": "Minimum Adjacent Swaps to Make a Valid Array"
    },
    {
        "question_id": 2473,
        "question_title": "Max Sum of a Pair With Equal Sum of Digits"
    },
    {
        "question_id": 2472,
        "question_title": "Build a Matrix With Conditions"
    },
    {
        "question_id": 2471,
        "question_title": "Minimum Amount of Time to Collect Garbage"
    },
    {
        "question_id": 2470,
        "question_title": "Removing Stars From a String"
    },
    {
        "question_id": 2469,
        "question_title": "Longest Subsequence With Limited Sum"
    },
    {
        "question_id": 2468,
        "question_title": "Valid Palindrome IV"
    },
    {
        "question_id": 2466,
        "question_title": "Maximum Segment Sum After Removals"
    },
    {
        "question_id": 2465,
        "question_title": "Shifting Letters II"
    },
    {
        "question_id": 2464,
        "question_title": "Time Needed to Rearrange a Binary String"
    },
    {
        "question_id": 2463,
        "question_title": "Minimum Recolors to Get K Consecutive Black Blocks"
    },
    {
        "question_id": 2462,
        "question_title": "Find the K-Sum of an Array"
    },
    {
        "question_id": 2461,
        "question_title": "Amount of Time for Binary Tree to Be Infected"
    },
    {
        "question_id": 2459,
        "question_title": "Minimum Hours of Training to Win a Competition"
    },
    {
        "question_id": 2458,
        "question_title": "Find Minimum Time to Finish All Jobs II"
    },
    {
        "question_id": 2457,
        "question_title": "Count Special Integers"
    },
    {
        "question_id": 2456,
        "question_title": "Construct Smallest Number From DI String"
    },
    {
        "question_id": 2455,
        "question_title": "Node With Highest Edge Score"
    },
    {
        "question_id": 2454,
        "question_title": "Largest Local Values in a Matrix"
    },
    {
        "question_id": 2450,
        "question_title": "Minimum Replacements to Sort the Array"
    },
    {
        "question_id": 2449,
        "question_title": "Maximum Number of Robots Within Budget"
    },
    {
        "question_id": 2448,
        "question_title": "Count Number of Bad Pairs"
    },
    {
        "question_id": 2447,
        "question_title": "Merge Similar Items"
    },
    {
        "question_id": 2445,
        "question_title": "Reachable Nodes With Restrictions"
    },
    {
        "question_id": 2444,
        "question_title": "Longest Ideal Subsequence"
    },
    {
        "question_id": 2443,
        "question_title": "Check if There is a Valid Partition For The Array"
    },
    {
        "question_id": 2442,
        "question_title": "Number of Arithmetic Triplets"
    },
    {
        "question_id": 2439,
        "question_title": "Longest Cycle in a Graph"
    },
    {
        "question_id": 2438,
        "question_title": "Find Closest Node to Given Two Nodes"
    },
    {
        "question_id": 2437,
        "question_title": "Maximum Number of Groups Entering a Competition"
    },
    {
        "question_id": 2436,
        "question_title": "Make Array Zero by Subtracting Equal Amounts"
    },
    {
        "question_id": 2435,
        "question_title": "Shortest Impossible Sequence of Rolls"
    },
    {
        "question_id": 2434,
        "question_title": "Design a Number Container System"
    },
    {
        "question_id": 2433,
        "question_title": "Best Poker Hand"
    },
    {
        "question_id": 2432,
        "question_title": "Number of Zero-Filled Subarrays"
    },
    {
        "question_id": 2430,
        "question_title": "Number of Excellent Pairs"
    },
    {
        "question_id": 2429,
        "question_title": "Design a Food Rating System"
    },
    {
        "question_id": 2428,
        "question_title": "Equal Row and Column Pairs"
    },
    {
        "question_id": 2427,
        "question_title": "First Letter to Appear Twice"
    },
    {
        "question_id": 2426,
        "question_title": "Maximum Profit From Trading Stocks"
    },
    {
        "question_id": 2425,
        "question_title": "Number of People That Can Be Seen in a Grid"
    },
    {
        "question_id": 2423,
        "question_title": "Minimum Deletions to Make Array Divisible"
    },
    {
        "question_id": 2422,
        "question_title": "Query Kth Smallest Trimmed Number"
    },
    {
        "question_id": 2421,
        "question_title": "Maximum Number of Pairs in Array"
    },
    {
        "question_id": 2420,
        "question_title": "Closest Node to Path in Tree"
    },
    {
        "question_id": 2419,
        "question_title": "Subarray With Elements Greater Than Varying Threshold"
    },
    {
        "question_id": 2418,
        "question_title": "Minimum Sum of Squared Difference"
    },
    {
        "question_id": 2417,
        "question_title": "The Latest Time to Catch a Bus"
    },
    {
        "question_id": 2416,
        "question_title": "Evaluate Boolean Binary Tree"
    },
    {
        "question_id": 2415,
        "question_title": "Count the Number of Ideal Arrays"
    },
    {
        "question_id": 2414,
        "question_title": "Move Pieces to Obtain a String"
    },
    {
        "question_id": 2413,
        "question_title": "Smallest Number in Infinite Set"
    },
    {
        "question_id": 2412,
        "question_title": "Minimum Amount of Time to Fill Cups"
    },
    {
        "question_id": 2411,
        "question_title": "Spiral Matrix IV"
    },
    {
        "question_id": 2409,
        "question_title": "Number of Increasing Paths in a Grid"
    },
    {
        "question_id": 2408,
        "question_title": "Number of People Aware of a Secret"
    },
    {
        "question_id": 2406,
        "question_title": "Decode the Message"
    },
    {
        "question_id": 2405,
        "question_title": "Minimum Number of Keypresses"
    },
    {
        "question_id": 2404,
        "question_title": "Number of Distinct Roll Sequences"
    },
    {
        "question_id": 2403,
        "question_title": "Count Unreachable Pairs of Nodes in an Undirected Graph"
    },
    {
        "question_id": 2402,
        "question_title": "Maximum XOR After Operations "
    },
    {
        "question_id": 2401,
        "question_title": "Count Asterisks"
    },
    {
        "question_id": 2400,
        "question_title": "Minimum Score After Removals on a Tree"
    },
    {
        "question_id": 2399,
        "question_title": "Minimum Flips in Binary Tree to Get Result"
    },
    {
        "question_id": 2398,
        "question_title": "Check if Matrix Is X-Matrix"
    },
    {
        "question_id": 2397,
        "question_title": "Count Number of Ways to Place Houses"
    },
    {
        "question_id": 2396,
        "question_title": "Design Video Sharing Platform"
    },
    {
        "question_id": 2395,
        "question_title": "Longest Binary Subsequence Less Than or Equal to K"
    },
    {
        "question_id": 2394,
        "question_title": "Count Subarrays With Score Less Than K"
    },
    {
        "question_id": 2393,
        "question_title": "Match Substring After Replacement"
    },
    {
        "question_id": 2392,
        "question_title": "Successful Pairs of Spells and Potions"
    },
    {
        "question_id": 2391,
        "question_title": "Strong Password Checker II"
    },
    {
        "question_id": 2390,
        "question_title": "Naming a Company"
    },
    {
        "question_id": 2389,
        "question_title": "Design a Text Editor"
    },
    {
        "question_id": 2388,
        "question_title": "Replace Elements in an Array"
    },
    {
        "question_id": 2387,
        "question_title": "Partition Array Such That Maximum Difference Is K"
    },
    {
        "question_id": 2386,
        "question_title": "Min Max Game"
    },
    {
        "question_id": 2385,
        "question_title": "Count Positions on Street With Required Brightness"
    },
    {
        "question_id": 2384,
        "question_title": "Root Equals Sum of Children"
    },
    {
        "question_id": 2383,
        "question_title": "Add Two Integers"
    },
    {
        "question_id": 2380,
        "question_title": "Booking Concert Tickets in Groups"
    },
    {
        "question_id": 2379,
        "question_title": "Maximum Total Importance of Roads"
    },
    {
        "question_id": 2378,
        "question_title": "Sender With Largest Word Count"
    },
    {
        "question_id": 2377,
        "question_title": "Check if Number Has Equal Digit Count and Digit Value"
    },
    {
        "question_id": 2375,
        "question_title": "Minimum Obstacle Removal to Reach Corner"
    },
    {
        "question_id": 2374,
        "question_title": "Steps to Make Array Non-decreasing"
    },
    {
        "question_id": 2373,
        "question_title": "Apply Discount to Prices"
    },
    {
        "question_id": 2372,
        "question_title": "Rearrange Characters to Make Target String"
    },
    {
        "question_id": 2369,
        "question_title": "Maximum Sum Score of Array"
    },
    {
        "question_id": 2368,
        "question_title": "Sum of Total Strength of Wizards"
    },
    {
        "question_id": 2367,
        "question_title": "Minimum Lines to Represent a Line Chart"
    },
    {
        "question_id": 2366,
        "question_title": "Maximum Bags With Full Capacity of Rocks"
    },
    {
        "question_id": 2365,
        "question_title": "Percentage of Letter in String"
    },
    {
        "question_id": 2364,
        "question_title": "Longest Path With Different Adjacent Characters"
    },
    {
        "question_id": 2363,
        "question_title": "Maximum Trailing Zeros in a Cornered Path"
    },
    {
        "question_id": 2362,
        "question_title": "Minimum Rounds to Complete All Tasks"
    },
    {
        "question_id": 2361,
        "question_title": "Calculate Digit Sum of a String"
    },
    {
        "question_id": 2360,
        "question_title": "Substring With Largest Variance"
    },
    {
        "question_id": 2359,
        "question_title": "Maximum White Tiles Covered by a Carpet"
    },
    {
        "question_id": 2358,
        "question_title": "Number of Ways to Split Array"
    },
    {
        "question_id": 2357,
        "question_title": "Count Integers in Intervals"
    },
    {
        "question_id": 2356,
        "question_title": "Largest Combination With Bitwise AND Greater Than Zero"
    },
    {
        "question_id": 2355,
        "question_title": "Maximum Consecutive Floors Without Special Floors"
    },
    {
        "question_id": 2354,
        "question_title": "Minimum Health to Beat Game"
    },
    {
        "question_id": 2353,
        "question_title": "Maximum Score of a Node Sequence"
    },
    {
        "question_id": 2352,
        "question_title": "Design an ATM Machine"
    },
    {
        "question_id": 2351,
        "question_title": "Number of Ways to Buy Pens and Pencils"
    },
    {
        "question_id": 2350,
        "question_title": "Find Closest Number to Zero"
    },
    {
        "question_id": 2349,
        "question_title": " Check if There Is a Valid Parentheses String Path"
    },
    {
        "question_id": 2348,
        "question_title": "Count Number of Texts"
    },
    {
        "question_id": 2347,
        "question_title": "Count Nodes Equal to Average of Subtree"
    },
    {
        "question_id": 2346,
        "question_title": "Largest 3-Same-Digit Number in String"
    },
    {
        "question_id": 2345,
        "question_title": "Minimum Number of Operations to Convert Time"
    },
    {
        "question_id": 2344,
        "question_title": "Escape the Spreading Fire"
    },
    {
        "question_id": 2343,
        "question_title": "Count Unguarded Cells in the Grid"
    },
    {
        "question_id": 2342,
        "question_title": "Minimum Average Difference"
    },
    {
        "question_id": 2341,
        "question_title": "Count Prefixes of a Given String"
    },
    {
        "question_id": 2340,
        "question_title": "Total Appeal of A String"
    },
    {
        "question_id": 2339,
        "question_title": "K Divisible Elements Subarrays"
    },
    {
        "question_id": 2338,
        "question_title": "Minimum Consecutive Cards to Pick Up"
    },
    {
        "question_id": 2337,
        "question_title": "Remove Digit From Number to Maximize Result"
    },
    {
        "question_id": 2334,
        "question_title": "Number of Flowers in Full Bloom"
    },
    {
        "question_id": 2333,
        "question_title": "Count Number of Rectangles Containing Each Point"
    },
    {
        "question_id": 2332,
        "question_title": "Count Lattice Points Inside a Circle"
    },
    {
        "question_id": 2331,
        "question_title": "Intersection of Multiple Arrays"
    },
    {
        "question_id": 2330,
        "question_title": "Maximum Total Beauty of the Gardens"
    },
    {
        "question_id": 2329,
        "question_title": "Maximum Product After K Increments"
    },
    {
        "question_id": 2328,
        "question_title": "Minimize Result by Adding Parentheses to Expression"
    },
    {
        "question_id": 2327,
        "question_title": "Largest Number After Digit Swaps by Parity"
    },
    {
        "question_id": 2326,
        "question_title": "Sum of Scores of Built Strings"
    },
    {
        "question_id": 2325,
        "question_title": "Number of Ways to Select Buildings"
    },
    {
        "question_id": 2324,
        "question_title": "Find Triangular Sum of an Array"
    },
    {
        "question_id": 2323,
        "question_title": "Minimum Bit Flips to Convert Number"
    },
    {
        "question_id": 2322,
        "question_title": "Number of Ways to Build Sturdy Brick Wall"
    },
    {
        "question_id": 2321,
        "question_title": "Minimum Weighted Subgraph With the Required Paths"
    },
    {
        "question_id": 2320,
        "question_title": "Find All K-Distant Indices in an Array"
    },
    {
        "question_id": 2319,
        "question_title": "Longest Substring of One Repeating Character"
    },
    {
        "question_id": 2318,
        "question_title": "Maximum Points in an Archery Competition"
    },
    {
        "question_id": 2317,
        "question_title": "Count Collisions on a Road"
    },
    {
        "question_id": 2316,
        "question_title": "Count Hills and Valleys in an Array"
    },
    {
        "question_id": 2314,
        "question_title": "Remove All Ones With Row and Column Flips II"
    },
    {
        "question_id": 2312,
        "question_title": "Most Frequent Number Following Key In an Array"
    },
    {
        "question_id": 2311,
        "question_title": "Minimum White Tiles After Covering With Carpets"
    },
    {
        "question_id": 2310,
        "question_title": "Minimum Operations to Halve Array Sum"
    },
    {
        "question_id": 2309,
        "question_title": "Maximize Number of Subsequences in a String"
    },
    {
        "question_id": 2308,
        "question_title": "Divide Array Into Equal Pairs"
    },
    {
        "question_id": 2307,
        "question_title": "Replace Non-Coprime Numbers in Array"
    },
    {
        "question_id": 2306,
        "question_title": "Create Binary Tree From Descriptions"
    },
    {
        "question_id": 2305,
        "question_title": "Append K Integers With Minimal Sum"
    },
    {
        "question_id": 2304,
        "question_title": "Cells in a Range on an Excel Sheet"
    },
    {
        "question_id": 2303,
        "question_title": "Unique Substrings With Equal Digit Frequency"
    },
    {
        "question_id": 2301,
        "question_title": "Count Array Pairs Divisible by K"
    },
    {
        "question_id": 2300,
        "question_title": "Construct String With Repeat Limit"
    },
    {
        "question_id": 2299,
        "question_title": "Merge Nodes in Between Zeros"
    },
    {
        "question_id": 2298,
        "question_title": "Count Integers With Even Digit Sum"
    },
    {
        "question_id": 2297,
        "question_title": "Amount of New Area Painted Each Day"
    },
    {
        "question_id": 2295,
        "question_title": "Minimum Time to Finish the Race"
    },
    {
        "question_id": 2294,
        "question_title": "Minimum Time to Complete Trips"
    },
    {
        "question_id": 2293,
        "question_title": "Minimum Number of Steps to Make Two Strings Anagram II"
    },
    {
        "question_id": 2292,
        "question_title": "Counting Words With a Given Prefix"
    },
    {
        "question_id": 2291,
        "question_title": "Maximum AND Sum of Array"
    },
    {
        "question_id": 2290,
        "question_title": "Removing Minimum Number of Magic Beans"
    },
    {
        "question_id": 2289,
        "question_title": "Minimum Operations to Make the Array Alternating"
    },
    {
        "question_id": 2288,
        "question_title": "Count Operations to Obtain Zero"
    },
    {
        "question_id": 2287,
        "question_title": "Minimum Number of Lines to Cover Points"
    },
    {
        "question_id": 2286,
        "question_title": "Minimum Time to Remove All Cars Containing Illegal Goods"
    },
    {
        "question_id": 2285,
        "question_title": "Design Bitset"
    },
    {
        "question_id": 2284,
        "question_title": "Smallest Value of the Rearranged Number"
    },
    {
        "question_id": 2283,
        "question_title": "Sort Even and Odd Indices Independently"
    },
    {
        "question_id": 2282,
        "question_title": "Choose Numbers From Two Arrays in Range"
    },
    {
        "question_id": 2280,
        "question_title": "Count Good Triplets in an Array"
    },
    {
        "question_id": 2279,
        "question_title": "Maximum Split of Positive Even Integers"
    },
    {
        "question_id": 2278,
        "question_title": "Find Three Consecutive Integers That Sum to a Given Number"
    },
    {
        "question_id": 2277,
        "question_title": "Count Equal and Divisible Pairs in an Array"
    },
    {
        "question_id": 2276,
        "question_title": "Groups of Strings"
    },
    {
        "question_id": 2275,
        "question_title": "Find Substring With Given Hash Value"
    },
    {
        "question_id": 2274,
        "question_title": "Keep Multiplying Found Values by Two"
    },
    {
        "question_id": 2273,
        "question_title": "Pour Water Between Buckets to Make Water Levels Equal"
    },
    {
        "question_id": 2272,
        "question_title": "Maximum Good People Based on Statements"
    },
    {
        "question_id": 2271,
        "question_title": "Rearrange Array Elements by Sign"
    },
    {
        "question_id": 2270,
        "question_title": "Find All Lonely Numbers in the Array"
    },
    {
        "question_id": 2269,
        "question_title": "Count Elements With Strictly Smaller and Greater Elements "
    },
    {
        "question_id": 2268,
        "question_title": "Remove All Ones With Row and Column Flips"
    },
    {
        "question_id": 2267,
        "question_title": "Minimum Difference in Sums After Removal of Elements"
    },
    {
        "question_id": 2266,
        "question_title": "Minimum Cost to Set Cooking Time"
    },
    {
        "question_id": 2265,
        "question_title": "Partition Array According to Given Pivot"
    },
    {
        "question_id": 2264,
        "question_title": "Minimum Sum of Four Digit Number After Splitting Digits"
    },
    {
        "question_id": 2263,
        "question_title": "Maximum Running Time of N Computers"
    },
    {
        "question_id": 2262,
        "question_title": "Solving Questions With Brainpower"
    },
    {
        "question_id": 2261,
        "question_title": "All Divisions With the Highest Score of a Binary Array"
    },
    {
        "question_id": 2260,
        "question_title": "Divide a String Into Groups of Size k"
    },
    {
        "question_id": 2259,
        "question_title": "Minimum Operations to Remove Adjacent Ones in Matrix"
    },
    {
        "question_id": 2258,
        "question_title": "Elements in Array After Removing and Replacing Elements"
    },
    {
        "question_id": 2257,
        "question_title": "Earliest Possible Day of Full Bloom"
    },
    {
        "question_id": 2256,
        "question_title": "Count Words Obtained After Adding a Letter"
    },
    {
        "question_id": 2255,
        "question_title": "Minimum Swaps to Group All 1's Together II"
    },
    {
        "question_id": 2254,
        "question_title": "Check if Every Row and Column Contains All Numbers"
    },
    {
        "question_id": 2251,
        "question_title": "Number of Ways to Divide a Long Corridor"
    },
    {
        "question_id": 2250,
        "question_title": "K Highest Ranked Items Within a Price Range"
    },
    {
        "question_id": 2249,
        "question_title": "Count the Hidden Sequences"
    },
    {
        "question_id": 2248,
        "question_title": "Minimum Cost of Buying Candies With Discount"
    },
    {
        "question_id": 2247,
        "question_title": "Number of Unique Flavors After Sharing K Candies"
    },
    {
        "question_id": 2246,
        "question_title": "Maximum Employees to Be Invited to a Meeting"
    },
    {
        "question_id": 2245,
        "question_title": "Destroying Asteroids"
    },
    {
        "question_id": 2244,
        "question_title": "Number of Laser Beams in a Bank"
    },
    {
        "question_id": 2243,
        "question_title": "Check if All A's Appears Before All B's"
    },
    {
        "question_id": 2242,
        "question_title": "Subsequence of Size K With the Largest Even Sum"
    },
    {
        "question_id": 2241,
        "question_title": "Recover the Original Array"
    },
    {
        "question_id": 2240,
        "question_title": "Intervals Between Identical Elements"
    },
    {
        "question_id": 2239,
        "question_title": "Execution of All Suffix Instructions Staying in a Grid"
    },
    {
        "question_id": 2238,
        "question_title": "A Number After a Double Reversal"
    },
    {
        "question_id": 2237,
        "question_title": "Longest Palindrome by Concatenating Two Letter Words"
    },
    {
        "question_id": 2236,
        "question_title": "Maximum Twin Sum of a Linked List"
    },
    {
        "question_id": 2235,
        "question_title": "Capitalize the Title"
    },
    {
        "question_id": 2234,
        "question_title": "Minimum Operations to Make the Array K-Increasing"
    },
    {
        "question_id": 2233,
        "question_title": "Number of Smooth Descent Periods of a Stock"
    },
    {
        "question_id": 2232,
        "question_title": "Adding Spaces to a String"
    },
    {
        "question_id": 2231,
        "question_title": "Find First Palindromic String in the Array"
    },
    {
        "question_id": 2230,
        "question_title": "Minimum Cost to Reach City With Discounts"
    },
    {
        "question_id": 2229,
        "question_title": "Maximum Fruits Harvested After at Most K Steps"
    },
    {
        "question_id": 2228,
        "question_title": "Watering Plants II"
    },
    {
        "question_id": 2227,
        "question_title": "Sum of Subarray Ranges"
    },
    {
        "question_id": 2226,
        "question_title": "Rings and Rods"
    },
    {
        "question_id": 2225,
        "question_title": "Substrings That Begin and End With the Same Letter"
    },
    {
        "question_id": 2222,
        "question_title": "Abbreviating the Product of a Range"
    },
    {
        "question_id": 2221,
        "question_title": "Check if a Parentheses String Can Be Valid"
    },
    {
        "question_id": 2220,
        "question_title": "Find All Possible Recipes from Given Supplies"
    },
    {
        "question_id": 2219,
        "question_title": "Maximum Number of Words Found in Sentences"
    },
    {
        "question_id": 2218,
        "question_title": "Paths in Maze That Lead to Same Room"
    },
    {
        "question_id": 2217,
        "question_title": "Step-By-Step Directions From a Binary Tree Node to Another"
    },
    {
        "question_id": 2216,
        "question_title": "Delete the Middle Node of a Linked List"
    },
    {
        "question_id": 2215,
        "question_title": "Finding 3-Digit Even Numbers"
    },
    {
        "question_id": 2213,
        "question_title": "Find All People With Secret"
    },
    {
        "question_id": 2212,
        "question_title": "Removing Minimum and Maximum From Array"
    },
    {
        "question_id": 2211,
        "question_title": "K Radius Subarray Averages"
    },
    {
        "question_id": 2210,
        "question_title": "Find Target Indices After Sorting Array"
    },
    {
        "question_id": 2209,
        "question_title": "Number of Equal Count Substrings"
    },
    {
        "question_id": 2207,
        "question_title": "Sequentially Ordinal Rank Tracker"
    },
    {
        "question_id": 2206,
        "question_title": "Detonate the Maximum Bombs"
    },
    {
        "question_id": 2205,
        "question_title": "Find Good Days to Rob the Bank"
    },
    {
        "question_id": 2204,
        "question_title": "Find Subsequence of Length K With the Largest Sum"
    },
    {
        "question_id": 2203,
        "question_title": "Number of Spaces Cleaning Robot Cleaned"
    },
    {
        "question_id": 2202,
        "question_title": "Sum of k-Mirror Numbers"
    },
    {
        "question_id": 2201,
        "question_title": "Valid Arrangement of Pairs"
    },
    {
        "question_id": 2200,
        "question_title": "Stamping the Grid"
    },
    {
        "question_id": 2199,
        "question_title": "Two Furthest Houses With Different Colors"
    },
    {
        "question_id": 2198,
        "question_title": "Process Restricted Friend Requests"
    },
    {
        "question_id": 2197,
        "question_title": "Decode the Slanted Ciphertext"
    },
    {
        "question_id": 2196,
        "question_title": "Reverse Nodes in Even Length Groups"
    },
    {
        "question_id": 2195,
        "question_title": "Time Needed to Buy Tickets"
    },
    {
        "question_id": 2193,
        "question_title": "Count Fertile Pyramids in a Land"
    },
    {
        "question_id": 2192,
        "question_title": "Minimum Cost Homecoming of a Robot in a Grid"
    },
    {
        "question_id": 2191,
        "question_title": "Minimum Number of Food Buckets to Feed the Hamsters"
    },
    {
        "question_id": 2190,
        "question_title": "Count Common Words With One Occurrence"
    },
    {
        "question_id": 2189,
        "question_title": "Maximum Path Quality of a Graph"
    },
    {
        "question_id": 2188,
        "question_title": "Minimized Maximum of Products Distributed to Any Store"
    },
    {
        "question_id": 2187,
        "question_title": "Vowels of All Substrings"
    },
    {
        "question_id": 2186,
        "question_title": "Count Vowel Substrings of a String"
    },
    {
        "question_id": 2184,
        "question_title": "Check if an Original String Exists Given Two Encoded Strings"
    },
    {
        "question_id": 2183,
        "question_title": "Minimum Operations to Convert Number"
    },
    {
        "question_id": 2182,
        "question_title": "Find the Minimum and Maximum Number of Nodes Between Critical Points"
    },
    {
        "question_id": 2181,
        "question_title": "Smallest Index With Equal Value"
    },
    {
        "question_id": 2180,
        "question_title": "Maximum Number of Tasks You Can Assign"
    },
    {
        "question_id": 2179,
        "question_title": "Most Beautiful Item for Each Query"
    },
    {
        "question_id": 2178,
        "question_title": "Walking Robot Simulation II"
    },
    {
        "question_id": 2177,
        "question_title": "Check Whether Two Strings are Almost Equivalent"
    },
    {
        "question_id": 2176,
        "question_title": "Parallel Courses III"
    },
    {
        "question_id": 2175,
        "question_title": "Count Nodes With the Highest Score"
    },
    {
        "question_id": 2174,
        "question_title": "Next Greater Numerically Balanced Number"
    },
    {
        "question_id": 2173,
        "question_title": "Number of Valid Words in a Sentence"
    },
    {
        "question_id": 2171,
        "question_title": "Second Minimum Time to Reach Destination"
    },
    {
        "question_id": 2170,
        "question_title": "Count Number of Maximum Bitwise-OR Subsets"
    },
    {
        "question_id": 2169,
        "question_title": "Simple Bank System"
    },
    {
        "question_id": 2168,
        "question_title": "Check if Numbers Are Ascending in a Sentence"
    },
    {
        "question_id": 2166,
        "question_title": "Number of Valid Move Combinations On Chessboard"
    },
    {
        "question_id": 2165,
        "question_title": "Plates Between Candles"
    },
    {
        "question_id": 2164,
        "question_title": "Two Best Non-Overlapping Events"
    },
    {
        "question_id": 2163,
        "question_title": "Kth Distinct String in an Array"
    },
    {
        "question_id": 2162,
        "question_title": "Partition Array Into Two Arrays to Minimize Sum Difference"
    },
    {
        "question_id": 2161,
        "question_title": "Stock Price Fluctuation "
    },
    {
        "question_id": 2160,
        "question_title": "Minimum Operations to Make a Uni-Value Grid"
    },
    {
        "question_id": 2159,
        "question_title": "Two Out of Three"
    },
    {
        "question_id": 2157,
        "question_title": "Smallest K-Length Subsequence With Occurrences of a Letter"
    },
    {
        "question_id": 2156,
        "question_title": "Stone Game IX"
    },
    {
        "question_id": 2155,
        "question_title": "Find Missing Observations"
    },
    {
        "question_id": 2154,
        "question_title": "Minimum Moves to Convert String"
    },
    {
        "question_id": 2153,
        "question_title": "Subtree Removal Game with Fibonacci Tree"
    },
    {
        "question_id": 2151,
        "question_title": "The Time When the Network Becomes Idle"
    },
    {
        "question_id": 2150,
        "question_title": "Kth Smallest Product of Two Sorted Arrays"
    },
    {
        "question_id": 2149,
        "question_title": "Remove Colored Pieces if Both Neighbors are the Same Color"
    },
    {
        "question_id": 2148,
        "question_title": "Minimum Number of Moves to Seat Everyone"
    },
    {
        "question_id": 2147,
        "question_title": "The Score of Students Solving Math Expression"
    },
    {
        "question_id": 2146,
        "question_title": "Check if Word Can Be Placed In Crossword"
    },
    {
        "question_id": 2145,
        "question_title": "Grid Game"
    },
    {
        "question_id": 2144,
        "question_title": "Maximum Difference Between Increasing Elements"
    },
    {
        "question_id": 2142,
        "question_title": "Average Height of Buildings in Each Segment"
    },
    {
        "question_id": 2141,
        "question_title": "Smallest Greater Multiple Made of Two Digits"
    },
    {
        "question_id": 2140,
        "question_title": "Longest Subsequence Repeated k Times"
    },
    {
        "question_id": 2139,
        "question_title": "Detect Squares"
    },
    {
        "question_id": 2138,
        "question_title": "Sum of Beauty in the Array"
    },
    {
        "question_id": 2137,
        "question_title": "Final Value of Variable After Performing Operations"
    },
    {
        "question_id": 2135,
        "question_title": "Maximum Number of Ways to Partition an Array"
    },
    {
        "question_id": 2134,
        "question_title": "Maximize the Confusion of an Exam"
    },
    {
        "question_id": 2133,
        "question_title": "Number of Pairs of Strings With Concatenation Equal to Target"
    },
    {
        "question_id": 2132,
        "question_title": "Convert 1D Array Into 2D Array"
    },
    {
        "question_id": 2131,
        "question_title": "Smallest Missing Genetic Value in Each Subtree"
    },
    {
        "question_id": 2130,
        "question_title": "Maximum Product of the Length of Two Palindromic Subsequences"
    },
    {
        "question_id": 2129,
        "question_title": "Number of Pairs of Interchangeable Rectangles"
    },
    {
        "question_id": 2128,
        "question_title": "Reverse Prefix of Word"
    },
    {
        "question_id": 2126,
        "question_title": "Count Nodes Equal to Sum of Descendants"
    },
    {
        "question_id": 2125,
        "question_title": "GCD Sort of an Array"
    },
    {
        "question_id": 2124,
        "question_title": "First Day Where You Have Been in All the Rooms"
    },
    {
        "question_id": 2123,
        "question_title": "The Number of Weak Characters in the Game"
    },
    {
        "question_id": 2122,
        "question_title": "Count Special Quadruplets"
    },
    {
        "question_id": 2121,
        "question_title": "Find if Path Exists in Graph"
    },
    {
        "question_id": 2119,
        "question_title": "Minimum Number of Operations to Make Array Continuous"
    },
    {
        "question_id": 2118,
        "question_title": "Maximum Earnings From Taxi"
    },
    {
        "question_id": 2117,
        "question_title": "Find Original Array From Doubled Array"
    },
    {
        "question_id": 2116,
        "question_title": "Count Number of Pairs With Absolute Difference K"
    },
    {
        "question_id": 2115,
        "question_title": "Number of Unique Good Subsequences"
    },
    {
        "question_id": 2114,
        "question_title": "Minimum Number of Work Sessions to Finish the Tasks"
    },
    {
        "question_id": 2113,
        "question_title": "Find the Kth Largest Integer in the Array"
    },
    {
        "question_id": 2112,
        "question_title": "Minimum Difference Between Highest and Lowest of K Scores"
    },
    {
        "question_id": 2111,
        "question_title": "Binary Searchable Numbers in an Unsorted Array"
    },
    {
        "question_id": 2109,
        "question_title": "Find Array Given Subset Sums"
    },
    {
        "question_id": 2108,
        "question_title": "Minimize the Difference Between Target and Chosen Elements"
    },
    {
        "question_id": 2107,
        "question_title": "Find Unique Binary String"
    },
    {
        "question_id": 2106,
        "question_title": "Find Greatest Common Divisor of Array"
    },
    {
        "question_id": 2105,
        "question_title": "The Number of Good Subsets"
    },
    {
        "question_id": 2104,
        "question_title": "Operations on Tree"
    },
    {
        "question_id": 2103,
        "question_title": "Find All Groups of Farmland"
    },
    {
        "question_id": 2102,
        "question_title": "Find the Middle Index in Array"
    },
    {
        "question_id": 2101,
        "question_title": "Last Day Where You Can Still Cross"
    },
    {
        "question_id": 2100,
        "question_title": "Minimum Non-Zero Product of the Array Elements"
    },
    {
        "question_id": 2099,
        "question_title": "Number of Strings That Appear as Substrings in Word"
    },
    {
        "question_id": 2096,
        "question_title": "Find the Longest Valid Obstacle Course at Each Position"
    },
    {
        "question_id": 2095,
        "question_title": "Minimum Number of Swaps to Make the String Balanced"
    },
    {
        "question_id": 2094,
        "question_title": "Remove Stones to Minimize the Total"
    },
    {
        "question_id": 2093,
        "question_title": "Check If String Is a Prefix of Array"
    },
    {
        "question_id": 2091,
        "question_title": "Number of Ways to Separate Numbers"
    },
    {
        "question_id": 2090,
        "question_title": "Number of Ways to Arrive at Destination"
    },
    {
        "question_id": 2089,
        "question_title": "Maximum Matrix Sum"
    },
    {
        "question_id": 2088,
        "question_title": "Minimum Time to Type Word Using Special Typewriter"
    },
    {
        "question_id": 2086,
        "question_title": "Count Number of Special Subsequences"
    },
    {
        "question_id": 2085,
        "question_title": "Array With Elements Not Equal to Average of Neighbors"
    },
    {
        "question_id": 2084,
        "question_title": "Maximum Number of Weeks for Which You Can Work"
    },
    {
        "question_id": 2083,
        "question_title": "Three Divisors"
    },
    {
        "question_id": 2082,
        "question_title": "Minimum Cost to Separate Sentence Into Rows"
    },
    {
        "question_id": 2081,
        "question_title": "Minimum Total Space Wasted With K Resizing Operations"
    },
    {
        "question_id": 2080,
        "question_title": "Check if Move is Legal"
    },
    {
        "question_id": 2079,
        "question_title": "Delete Duplicate Folders in System"
    },
    {
        "question_id": 2078,
        "question_title": "Maximum Compatibility Score Sum"
    },
    {
        "question_id": 2077,
        "question_title": "Largest Number After Mutating Substring"
    },
    {
        "question_id": 2076,
        "question_title": "Sum of Digits of String After Convert"
    },
    {
        "question_id": 2075,
        "question_title": "Brightest Position on Street"
    },
    {
        "question_id": 2074,
        "question_title": "Erect the Fence II"
    },
    {
        "question_id": 2073,
        "question_title": "Minimum Time For K Virus Variants to Spread"
    },
    {
        "question_id": 2072,
        "question_title": "Maximum of Minimum Values in All Subarrays"
    },
    {
        "question_id": 2071,
        "question_title": "Longest Common Subsequence Between Sorted Arrays"
    },
    {
        "question_id": 2070,
        "question_title": "Check if String Is Decomposable Into Value-Equal Substrings"
    },
    {
        "question_id": 2069,
        "question_title": "Kth Smallest Subarray Sum"
    },
    {
        "question_id": 2068,
        "question_title": "Maximum Genetic Difference Query"
    },
    {
        "question_id": 2067,
        "question_title": "Maximum Number of Points with Cost"
    },
    {
        "question_id": 2066,
        "question_title": "Add Minimum Number of Rungs"
    },
    {
        "question_id": 2065,
        "question_title": "Check for Contradictions in Equations"
    },
    {
        "question_id": 2062,
        "question_title": "Game of Nim"
    },
    {
        "question_id": 2061,
        "question_title": "Painting a Grid With Three Different Colors"
    },
    {
        "question_id": 2060,
        "question_title": "Merge BSTs to Create Single BST"
    },
    {
        "question_id": 2059,
        "question_title": "Unique Length-3 Palindromic Subsequences"
    },
    {
        "question_id": 2058,
        "question_title": "Concatenation of Array"
    },
    {
        "question_id": 2056,
        "question_title": "Jump Game VIII"
    },
    {
        "question_id": 2055,
        "question_title": "Describe the Painting"
    },
    {
        "question_id": 2054,
        "question_title": "The Number of the Smallest Unoccupied Chair"
    },
    {
        "question_id": 2053,
        "question_title": "Check if All Characters Have Equal Number of Occurrences"
    },
    {
        "question_id": 2052,
        "question_title": "Depth of BST Given Insertion Order"
    },
    {
        "question_id": 2051,
        "question_title": "Longest Common Subpath"
    },
    {
        "question_id": 2050,
        "question_title": "Count Good Numbers"
    },
    {
        "question_id": 2049,
        "question_title": "Eliminate Maximum Number of Monsters"
    },
    {
        "question_id": 2048,
        "question_title": "Build Array from Permutation"
    },
    {
        "question_id": 2047,
        "question_title": "Find a Peak Element II"
    },
    {
        "question_id": 2045,
        "question_title": "Cutting Ribbons"
    },
    {
        "question_id": 2044,
        "question_title": "Number of Wonderful Substrings"
    },
    {
        "question_id": 2043,
        "question_title": "Cyclically Rotating a Grid"
    },
    {
        "question_id": 2042,
        "question_title": "Maximum Product Difference Between Two Pairs"
    },
    {
        "question_id": 2040,
        "question_title": "Minimum Cost to Reach Destination in Time"
    },
    {
        "question_id": 2039,
        "question_title": "Sum Game"
    },
    {
        "question_id": 2038,
        "question_title": "Nearest Exit from Entrance in Maze"
    },
    {
        "question_id": 2037,
        "question_title": "Count Square Sum Triples"
    },
    {
        "question_id": 2036,
        "question_title": "Count Pairs in Two Arrays"
    },
    {
        "question_id": 2035,
        "question_title": "Count Sub Islands"
    },
    {
        "question_id": 2034,
        "question_title": "Minimum Absolute Difference Queries"
    },
    {
        "question_id": 2033,
        "question_title": "The Number of Full Rounds You Have Played"
    },
    {
        "question_id": 2032,
        "question_title": "Largest Odd Number in String"
    },
    {
        "question_id": 2031,
        "question_title": "Egg Drop With 2 Eggs and N Floors"
    },
    {
        "question_id": 2029,
        "question_title": "Minimize Product Sum of Two Arrays"
    },
    {
        "question_id": 2028,
        "question_title": "The Earliest and Latest Rounds Where Players Compete"
    },
    {
        "question_id": 2027,
        "question_title": "Maximum Number of Removable Characters"
    },
    {
        "question_id": 2026,
        "question_title": "Merge Triplets to Form Target Triplet"
    },
    {
        "question_id": 2025,
        "question_title": "Redistribute Characters to Make All Strings Equal"
    },
    {
        "question_id": 2023,
        "question_title": "Design Movie Rental System"
    },
    {
        "question_id": 2022,
        "question_title": "Maximum Alternating Subsequence Sum"
    },
    {
        "question_id": 2021,
        "question_title": "Remove All Occurrences of a Substring"
    },
    {
        "question_id": 2020,
        "question_title": "Remove One Element to Make the Array Strictly Increasing"
    },
    {
        "question_id": 2019,
        "question_title": "Product of Two Run-Length Encoded Arrays"
    },
    {
        "question_id": 2018,
        "question_title": "Minimum Space Wasted From Packaging"
    },
    {
        "question_id": 2017,
        "question_title": "Minimum Number of Flips to Make the Binary String Alternating"
    },
    {
        "question_id": 2016,
        "question_title": "Reduction Operations to Make the Array Elements Equal"
    },
    {
        "question_id": 2015,
        "question_title": "Determine Whether Matrix Can Be Obtained By Rotation"
    },
    {
        "question_id": 2013,
        "question_title": "Minimum Skips to Arrive at Meeting On Time"
    },
    {
        "question_id": 2012,
        "question_title": "Process Tasks Using Servers"
    },
    {
        "question_id": 2011,
        "question_title": "Maximum Value after Insertion"
    },
    {
        "question_id": 2010,
        "question_title": "Check if Word Equals Summation of Two Words"
    },
    {
        "question_id": 2009,
        "question_title": "Longest Word With All Prefixes"
    },
    {
        "question_id": 2008,
        "question_title": "Minimum Cost to Change the Final Value of Expression"
    },
    {
        "question_id": 2007,
        "question_title": "Maximum Cost of Trip With K Highways"
    },
    {
        "question_id": 2006,
        "question_title": "Find the Student that Will Replace the Chalk"
    },
    {
        "question_id": 2005,
        "question_title": "Check if All the Integers in a Range Are Covered"
    },
    {
        "question_id": 2003,
        "question_title": "Distinct Numbers in Each Subarray"
    },
    {
        "question_id": 2002,
        "question_title": "Stone Game VIII"
    },
    {
        "question_id": 2001,
        "question_title": "Jump Game VII"
    },
    {
        "question_id": 2000,
        "question_title": "Minimum Speed to Arrive on Time"
    },
    {
        "question_id": 1999,
        "question_title": "Longer Contiguous Segments of Ones than Zeros"
    },
    {
        "question_id": 1997,
        "question_title": "Next Palindrome Using Same Digits"
    },
    {
        "question_id": 1996,
        "question_title": "Number of Ways to Rearrange Sticks With K Sticks Visible"
    },
    {
        "question_id": 1995,
        "question_title": "Finding Pairs With a Certain Sum"
    },
    {
        "question_id": 1994,
        "question_title": "Minimum Number of Swaps to Make the Binary String Alternating"
    },
    {
        "question_id": 1993,
        "question_title": "Sum of All Subset XOR Totals"
    },
    {
        "question_id": 1992,
        "question_title": "Sort Linked List Already Sorted Using Absolute Values"
    },
    {
        "question_id": 1990,
        "question_title": "Get Biggest Three Rhombus Sums in a Grid"
    },
    {
        "question_id": 1989,
        "question_title": "Minimum XOR Sum of Two Arrays"
    },
    {
        "question_id": 1988,
        "question_title": "Minimize Maximum Pair Sum in Array"
    },
    {
        "question_id": 1987,
        "question_title": "Substrings of Size Three with Distinct Characters"
    },
    {
        "question_id": 1986,
        "question_title": "Largest Color Value in a Directed Graph"
    },
    {
        "question_id": 1985,
        "question_title": "Maximum Subarray Min-Product"
    },
    {
        "question_id": 1984,
        "question_title": "Maximum Distance Between a Pair of Values"
    },
    {
        "question_id": 1983,
        "question_title": "Maximum Population Year"
    },
    {
        "question_id": 1982,
        "question_title": "Remove Duplicates From an Unsorted Linked List"
    },
    {
        "question_id": 1980,
        "question_title": "Faulty Sensor"
    },
    {
        "question_id": 1979,
        "question_title": "Maximum Number of People That Can Be Caught in Tag"
    },
    {
        "question_id": 1978,
        "question_title": "Minimum Adjacent Swaps to Reach the Kth Smallest Number"
    },
    {
        "question_id": 1977,
        "question_title": "Minimum Interval to Include Each Query"
    },
    {
        "question_id": 1976,
        "question_title": "Splitting a String Into Descending Consecutive Values"
    },
    {
        "question_id": 1975,
        "question_title": "Minimum Distance to the Target Element"
    },
    {
        "question_id": 1972,
        "question_title": "Rotating the Box"
    },
    {
        "question_id": 1971,
        "question_title": "Incremental Memory Leak"
    },
    {
        "question_id": 1970,
        "question_title": "Sorting the Sentence"
    },
    {
        "question_id": 1969,
        "question_title": "Maximum Number of Accepted Invitations"
    },
    {
        "question_id": 1968,
        "question_title": "Maximum Building Height"
    },
    {
        "question_id": 1967,
        "question_title": "Longest Substring Of All Vowels in Order"
    },
    {
        "question_id": 1966,
        "question_title": "Frequency of the Most Frequent Element"
    },
    {
        "question_id": 1965,
        "question_title": "Sum of Digits in Base K"
    },
    {
        "question_id": 1963,
        "question_title": "Find XOR Sum of All Pairs Bitwise AND"
    },
    {
        "question_id": 1962,
        "question_title": "Single-Threaded CPU"
    },
    {
        "question_id": 1961,
        "question_title": "Maximum Ice Cream Bars"
    },
    {
        "question_id": 1960,
        "question_title": "Check if the Sentence Is Pangram"
    },
    {
        "question_id": 1959,
        "question_title": "Minimum Path Cost in a Hidden Grid"
    },
    {
        "question_id": 1957,
        "question_title": "Closest Room"
    },
    {
        "question_id": 1956,
        "question_title": "Maximum Element After Decreasing and Rearranging"
    },
    {
        "question_id": 1955,
        "question_title": "Seat Reservation Manager"
    },
    {
        "question_id": 1954,
        "question_title": "Replace All Digits with Characters"
    },
    {
        "question_id": 1953,
        "question_title": "Finding MK Average"
    },
    {
        "question_id": 1952,
        "question_title": "Minimum Sideway Jumps"
    },
    {
        "question_id": 1951,
        "question_title": "Find the Winner of the Circular Game"
    },
    {
        "question_id": 1950,
        "question_title": "Sign of the Product of an Array"
    },
    {
        "question_id": 1949,
        "question_title": "Implement Trie II (Prefix Tree)"
    },
    {
        "question_id": 1947,
        "question_title": "Number of Different Subsequences GCDs"
    },
    {
        "question_id": 1946,
        "question_title": "Minimum Absolute Sum Difference"
    },
    {
        "question_id": 1945,
        "question_title": "Finding the Users Active Minutes"
    },
    {
        "question_id": 1944,
        "question_title": "Truncate Sentence"
    },
    {
        "question_id": 1943,
        "question_title": "Count Pairs of Equal Substrings With Minimum Difference"
    },
    {
        "question_id": 1941,
        "question_title": "Minimum Number of Operations to Make String Sorted"
    },
    {
        "question_id": 1940,
        "question_title": "Maximum XOR for Each Query"
    },
    {
        "question_id": 1939,
        "question_title": "Queries on Number of Points Inside a Circle"
    },
    {
        "question_id": 1938,
        "question_title": "Minimum Operations to Make the Array Increasing"
    },
    {
        "question_id": 1937,
        "question_title": "Maximize the Beauty of the Garden"
    },
    {
        "question_id": 1936,
        "question_title": "Maximize Number of Nice Divisors"
    },
    {
        "question_id": 1935,
        "question_title": "Minimum Number of Operations to Reinitialize a Permutation"
    },
    {
        "question_id": 1934,
        "question_title": "Evaluate the Bracket Pairs of a String"
    },
    {
        "question_id": 1933,
        "question_title": "Number of Different Integers in a String"
    },
    {
        "question_id": 1931,
        "question_title": "Shortest Path in a Hidden Grid"
    },
    {
        "question_id": 1930,
        "question_title": "Maximum Number of Consecutive Values You Can Make"
    },
    {
        "question_id": 1929,
        "question_title": "Maximum Value at a Given Index in a Bounded Array"
    },
    {
        "question_id": 1928,
        "question_title": "Number of Orders in the Backlog"
    },
    {
        "question_id": 1927,
        "question_title": "Maximum Ascending Subarray Sum"
    },
    {
        "question_id": 1925,
        "question_title": "Count Nice Pairs in an Array"
    },
    {
        "question_id": 1924,
        "question_title": "Maximum Number of Groups Getting Fresh Donuts"
    },
    {
        "question_id": 1923,
        "question_title": "Sentence Similarity III"
    },
    {
        "question_id": 1920,
        "question_title": "Determine Color of a Chessboard Square"
    },
    {
        "question_id": 1919,
        "question_title": "Sort Features by Popularity"
    },
    {
        "question_id": 1918,
        "question_title": "Maximum Score of a Good Subarray"
    },
    {
        "question_id": 1917,
        "question_title": "Maximum Average Pass Ratio"
    },
    {
        "question_id": 1916,
        "question_title": "Find Center of Star Graph"
    },
    {
        "question_id": 1915,
        "question_title": "Check if One String Swap Can Make Strings Equal"
    },
    {
        "question_id": 1913,
        "question_title": "Make the XOR of All Segments Equal to Zero"
    },
    {
        "question_id": 1912,
        "question_title": "Number of Restricted Paths From First to Last Node"
    },
    {
        "question_id": 1911,
        "question_title": "Minimum Elements to Add to Form a Given Sum"
    },
    {
        "question_id": 1910,
        "question_title": "Check if Binary String Has at Most One Segment of Ones"
    },
    {
        "question_id": 1909,
        "question_title": "Buildings With an Ocean View"
    },
    {
        "question_id": 1907,
        "question_title": "Count Pairs With XOR in a Range"
    },
    {
        "question_id": 1906,
        "question_title": "Maximize Score After N Operations"
    },
    {
        "question_id": 1905,
        "question_title": "Design Authentication Manager"
    },
    {
        "question_id": 1904,
        "question_title": "Second Largest Digit in a String"
    },
    {
        "question_id": 1903,
        "question_title": "Design Most Recently Used Queue"
    },
    {
        "question_id": 1902,
        "question_title": "Car Fleet II"
    },
    {
        "question_id": 1901,
        "question_title": "Equal Sum Arrays With Minimum Number of Operations"
    },
    {
        "question_id": 1900,
        "question_title": "Closest Dessert Cost"
    },
    {
        "question_id": 1899,
        "question_title": "Count Items Matching a Rule"
    },
    {
        "question_id": 1897,
        "question_title": "Maximize Palindrome Length From Subsequences"
    },
    {
        "question_id": 1896,
        "question_title": "Maximum Score from Performing Multiplication Operations"
    },
    {
        "question_id": 1895,
        "question_title": "Minimum Number of Operations to Move All Balls to Each Box"
    },
    {
        "question_id": 1894,
        "question_title": "Merge Strings Alternately"
    },
    {
        "question_id": 1893,
        "question_title": "Maximum Subarray Sum After One Operation"
    },
    {
        "question_id": 1891,
        "question_title": "Count Pairs Of Nodes"
    },
    {
        "question_id": 1890,
        "question_title": "Sum of Beauty of All Substrings"
    },
    {
        "question_id": 1889,
        "question_title": "Check if Number is a Sum of Powers of Three"
    },
    {
        "question_id": 1888,
        "question_title": "Find Nearest Point That Has the Same X or Y Coordinate"
    },
    {
        "question_id": 1887,
        "question_title": "Minimum Degree of a Connected Trio in a Graph"
    },
    {
        "question_id": 1886,
        "question_title": "Minimum Limit of Balls in a Bag"
    },
    {
        "question_id": 1885,
        "question_title": "Count Number of Homogenous Substrings"
    },
    {
        "question_id": 1884,
        "question_title": "Minimum Changes To Make Alternating Binary String"
    },
    {
        "question_id": 1883,
        "question_title": "Find Distance in a Binary Tree"
    },
    {
        "question_id": 1881,
        "question_title": "Closest Subsequence Sum"
    },
    {
        "question_id": 1880,
        "question_title": "Largest Merge Of Two Strings"
    },
    {
        "question_id": 1879,
        "question_title": "Maximum Score From Removing Stones"
    },
    {
        "question_id": 1878,
        "question_title": "Check if Array Is Sorted and Rotated"
    },
    {
        "question_id": 1876,
        "question_title": "Map of Highest Peak"
    },
    {
        "question_id": 1875,
        "question_title": "Tree of Coprimes"
    },
    {
        "question_id": 1874,
        "question_title": "Form Array by Concatenating Subarrays of Another Array"
    },
    {
        "question_id": 1873,
        "question_title": "Longest Nice Substring"
    },
    {
        "question_id": 1872,
        "question_title": "Can You Eat Your Favorite Candy on Your Favorite Day?"
    },
    {
        "question_id": 1871,
        "question_title": "Palindrome Partitioning IV"
    },
    {
        "question_id": 1866,
        "question_title": "Restore the Array From Adjacent Pairs"
    },
    {
        "question_id": 1865,
        "question_title": "Checking Existence of Edge Length Limited Paths II"
    },
    {
        "question_id": 1861,
        "question_title": "Building Boxes"
    },
    {
        "question_id": 1860,
        "question_title": "Find Kth Largest XOR Coordinate Value"
    },
    {
        "question_id": 1859,
        "question_title": "Change Minimum Characters to Satisfy One of Three Conditions"
    },
    {
        "question_id": 1858,
        "question_title": "Latest Time by Replacing Hidden Digits"
    },
    {
        "question_id": 1851,
        "question_title": "Maximum Number of Events That Can Be Attended II"
    },
    {
        "question_id": 1850,
        "question_title": "Minimum Length of String After Deleting Similar Ends"
    },
    {
        "question_id": 1849,
        "question_title": "Maximum Absolute Sum of Any Subarray"
    },
    {
        "question_id": 1848,
        "question_title": "Sum of Unique Elements"
    },
    {
        "question_id": 1847,
        "question_title": "Largest Subarray Length K"
    },
    {
        "question_id": 1845,
        "question_title": "Largest Submatrix With Rearrangements"
    },
    {
        "question_id": 1844,
        "question_title": "Maximum Number of Balls in a Box"
    },
    {
        "question_id": 1843,
        "question_title": "Number Of Rectangles That Can Form The Largest Square"
    },
    {
        "question_id": 1840,
        "question_title": "Minimize Hamming Distance After Swap Operations"
    },
    {
        "question_id": 1839,
        "question_title": "Decode XORed Array"
    },
    {
        "question_id": 1838,
        "question_title": "Number of Distinct Substrings in a String"
    },
    {
        "question_id": 1836,
        "question_title": "Count Ways to Make Array With Product"
    },
    {
        "question_id": 1835,
        "question_title": "Decode XORed Permutation"
    },
    {
        "question_id": 1834,
        "question_title": "Minimum Number of People to Teach"
    },
    {
        "question_id": 1833,
        "question_title": "Find the Highest Altitude"
    },
    {
        "question_id": 1832,
        "question_title": "Minimum Operations to Make a Subsequence"
    },
    {
        "question_id": 1831,
        "question_title": "Ways to Split Array Into Three Subarrays"
    },
    {
        "question_id": 1830,
        "question_title": "Count Good Meals"
    },
    {
        "question_id": 1829,
        "question_title": "Maximum Units on a Truck"
    },
    {
        "question_id": 1828,
        "question_title": "Count Ways to Distribute Candies"
    },
    {
        "question_id": 1826,
        "question_title": "Maximum XOR With an Element From Array"
    },
    {
        "question_id": 1825,
        "question_title": "Find Minimum Time to Finish All Jobs"
    },
    {
        "question_id": 1824,
        "question_title": "Maximum Number of Eaten Apples"
    },
    {
        "question_id": 1823,
        "question_title": "Determine if String Halves Are Alike"
    },
    {
        "question_id": 1822,
        "question_title": "Longest Palindromic Subsequence II"
    },
    {
        "question_id": 1820,
        "question_title": "Number Of Ways To Reconstruct A Tree"
    },
    {
        "question_id": 1819,
        "question_title": "Construct the Lexicographically Largest Valid Sequence"
    },
    {
        "question_id": 1818,
        "question_title": "Maximum Score From Removing Substrings"
    },
    {
        "question_id": 1817,
        "question_title": "Calculate Money in Leetcode Bank"
    },
    {
        "question_id": 1816,
        "question_title": "Lowest Common Ancestor of a Binary Tree IV"
    },
    {
        "question_id": 1815,
        "question_title": "Checking Existence of Edge Length Limited Paths"
    },
    {
        "question_id": 1814,
        "question_title": "Jump Game VI"
    },
    {
        "question_id": 1813,
        "question_title": "Maximum Erasure Value"
    },
    {
        "question_id": 1812,
        "question_title": "Reformat Phone Number"
    },
    {
        "question_id": 1810,
        "question_title": "Change the Root of a Binary Tree"
    },
    {
        "question_id": 1809,
        "question_title": "Sum Of Special Evenly-Spaced Elements In Array"
    },
    {
        "question_id": 1808,
        "question_title": "Stone Game VII"
    },
    {
        "question_id": 1807,
        "question_title": "Partitioning Into Minimum Number Of Deci-Binary Numbers"
    },
    {
        "question_id": 1806,
        "question_title": "Count of Matches in Tournament"
    },
    {
        "question_id": 1805,
        "question_title": "Minimum Adjacent Swaps for K Consecutive Ones"
    },
    {
        "question_id": 1804,
        "question_title": "Maximum Binary String After Change"
    },
    {
        "question_id": 1803,
        "question_title": "Average Waiting Time"
    },
    {
        "question_id": 1802,
        "question_title": "Number of Students Unable to Eat Lunch"
    },
    {
        "question_id": 1800,
        "question_title": "Concatenation of Consecutive Binary Numbers"
    },
    {
        "question_id": 1799,
        "question_title": "Minimum Incompatibility"
    },
    {
        "question_id": 1798,
        "question_title": "Max Number of K-Sum Pairs"
    },
    {
        "question_id": 1797,
        "question_title": "Goal Parser Interpretation"
    },
    {
        "question_id": 1796,
        "question_title": "Correct a Binary Tree"
    },
    {
        "question_id": 1794,
        "question_title": "Minimize Deviation in Array"
    },
    {
        "question_id": 1793,
        "question_title": "Minimum Moves to Make Array Complementary"
    },
    {
        "question_id": 1792,
        "question_title": "Find the Most Competitive Subsequence"
    },
    {
        "question_id": 1791,
        "question_title": "Richest Customer Wealth"
    },
    {
        "question_id": 1790,
        "question_title": "Lowest Common Ancestor of a Binary Tree III"
    },
    {
        "question_id": 1789,
        "question_title": "Delivering Boxes from Storage to Ports"
    },
    {
        "question_id": 1788,
        "question_title": "Stone Game VI"
    },
    {
        "question_id": 1787,
        "question_title": "Sum of Absolute Differences in a Sorted Array"
    },
    {
        "question_id": 1786,
        "question_title": "Count the Number of Consistent Strings"
    },
    {
        "question_id": 1784,
        "question_title": "Minimum Initial Energy to Finish Tasks"
    },
    {
        "question_id": 1783,
        "question_title": "Ways to Make a Fair Array"
    },
    {
        "question_id": 1782,
        "question_title": "Smallest String With A Given Numeric Value"
    },
    {
        "question_id": 1781,
        "question_title": "Check If Two String Arrays are Equivalent"
    },
    {
        "question_id": 1780,
        "question_title": "Lowest Common Ancestor of a Binary Tree II"
    },
    {
        "question_id": 1778,
        "question_title": "Maximize Grid Happiness"
    },
    {
        "question_id": 1777,
        "question_title": "Determine if Two Strings Are Close"
    },
    {
        "question_id": 1776,
        "question_title": "Minimum Operations to Reduce X to Zero"
    },
    {
        "question_id": 1775,
        "question_title": "Design an Ordered Stream"
    },
    {
        "question_id": 1774,
        "question_title": "Add Two Polynomials Represented as Linked Lists"
    },
    {
        "question_id": 1772,
        "question_title": "Create Sorted Array through Instructions"
    },
    {
        "question_id": 1771,
        "question_title": "Sell Diminishing-Valued Colored Balls"
    },
    {
        "question_id": 1770,
        "question_title": "Minimum Deletions to Make Character Frequencies Unique"
    },
    {
        "question_id": 1769,
        "question_title": "Get Maximum in Generated Array"
    },
    {
        "question_id": 1768,
        "question_title": "Design an Expression Tree With Evaluate Function"
    },
    {
        "question_id": 1767,
        "question_title": "Design Front Middle Back Queue"
    },
    {
        "question_id": 1766,
        "question_title": "Minimum Number of Removals to Make Mountain Array"
    },
    {
        "question_id": 1765,
        "question_title": "Merge In Between Linked Lists"
    },
    {
        "question_id": 1764,
        "question_title": "Maximum Repeating Substring"
    },
    {
        "question_id": 1762,
        "question_title": "Furthest Building You Can Reach"
    },
    {
        "question_id": 1761,
        "question_title": "Count Sorted Vowel Strings"
    },
    {
        "question_id": 1760,
        "question_title": "Check Array Formation Through Concatenation"
    },
    {
        "question_id": 1758,
        "question_title": "Distribute Repeating Integers"
    },
    {
        "question_id": 1757,
        "question_title": "Minimum Jumps to Reach Home"
    },
    {
        "question_id": 1756,
        "question_title": "Minimum Deletions to Make String Balanced"
    },
    {
        "question_id": 1755,
        "question_title": "Defuse the Bomb"
    },
    {
        "question_id": 1753,
        "question_title": "Path With Minimum Effort"
    },
    {
        "question_id": 1752,
        "question_title": "Arithmetic Subarrays"
    },
    {
        "question_id": 1751,
        "question_title": "Slowest Key"
    },
    {
        "question_id": 1750,
        "question_title": "Check If Two Expression Trees are Equivalent"
    },
    {
        "question_id": 1748,
        "question_title": "Best Team With No Conflicts"
    },
    {
        "question_id": 1747,
        "question_title": "Lexicographically Smallest String After Applying Operations"
    },
    {
        "question_id": 1746,
        "question_title": "Largest Substring Between Two Equal Characters"
    },
    {
        "question_id": 1745,
        "question_title": "Find Nearest Right Node in Binary Tree"
    },
    {
        "question_id": 1744,
        "question_title": "Number of Ways to Form a Target String Given a Dictionary"
    },
    {
        "question_id": 1743,
        "question_title": "Count Substrings That Differ by One Character"
    },
    {
        "question_id": 1742,
        "question_title": "Widest Vertical Area Between Two Points Containing No Points"
    },
    {
        "question_id": 1741,
        "question_title": "Sort Array by Increasing Frequency"
    },
    {
        "question_id": 1740,
        "question_title": "Count Subtrees With Max Distance Between Cities"
    },
    {
        "question_id": 1739,
        "question_title": "Split Two Strings to Make Palindrome"
    },
    {
        "question_id": 1738,
        "question_title": "Maximal Network Rank"
    },
    {
        "question_id": 1737,
        "question_title": "Maximum Nesting Depth of the Parentheses"
    },
    {
        "question_id": 1736,
        "question_title": "Build Binary Expression Tree From Infix Expression"
    },
    {
        "question_id": 1733,
        "question_title": "Maximum Number of Visible Points"
    },
    {
        "question_id": 1732,
        "question_title": "Minimum One Bit Operations to Make Integers Zero"
    },
    {
        "question_id": 1731,
        "question_title": "Even Odd Tree"
    },
    {
        "question_id": 1730,
        "question_title": "Special Array With X Elements Greater Than or Equal X"
    },
    {
        "question_id": 1729,
        "question_title": "Binary Search Tree Iterator II"
    },
    {
        "question_id": 1728,
        "question_title": "Fancy Sequence"
    },
    {
        "question_id": 1727,
        "question_title": "Cat and Mouse II"
    },
    {
        "question_id": 1726,
        "question_title": "Coordinate With Maximum Network Quality"
    },
    {
        "question_id": 1725,
        "question_title": "Number of Sets of K Non-Overlapping Line Segments"
    },
    {
        "question_id": 1723,
        "question_title": "Maximum Number of Achievable Transfer Requests"
    },
    {
        "question_id": 1722,
        "question_title": "Throne Inheritance"
    },
    {
        "question_id": 1721,
        "question_title": "Maximum Profit of Operating a Centennial Wheel"
    },
    {
        "question_id": 1720,
        "question_title": "Crawler Log Folder"
    },
    {
        "question_id": 1719,
        "question_title": "Put Boxes Into the Warehouse II"
    },
    {
        "question_id": 1717,
        "question_title": "Minimum Cost to Connect Two Groups of Points"
    },
    {
        "question_id": 1716,
        "question_title": "Maximum Non Negative Product in a Matrix"
    },
    {
        "question_id": 1715,
        "question_title": "Split a String Into the Max Number of Unique Substrings"
    },
    {
        "question_id": 1714,
        "question_title": "Rearrange Spaces Between Words"
    },
    {
        "question_id": 1713,
        "question_title": "Dot Product of Two Sparse Vectors"
    },
    {
        "question_id": 1711,
        "question_title": "Find Valid Matrix Given Row and Column Sums"
    },
    {
        "question_id": 1710,
        "question_title": "Find Servers That Handled Most Number of Requests"
    },
    {
        "question_id": 1709,
        "question_title": "Alert Using Same Key-Card Three or More Times in a One Hour Period"
    },
    {
        "question_id": 1708,
        "question_title": "Design Parking System"
    },
    {
        "question_id": 1707,
        "question_title": "Check If String Is Transformable With Substring Sort Operations"
    },
    {
        "question_id": 1706,
        "question_title": "Min Cost to Connect All Points"
    },
    {
        "question_id": 1705,
        "question_title": "Count Unhappy Friends"
    },
    {
        "question_id": 1704,
        "question_title": "Special Positions in a Binary Matrix"
    },
    {
        "question_id": 1703,
        "question_title": "Put Boxes Into the Warehouse I"
    },
    {
        "question_id": 1701,
        "question_title": "Remove Max Number of Edges to Keep Graph Fully Traversable"
    },
    {
        "question_id": 1700,
        "question_title": "Minimum Time to Make Rope Colorful"
    },
    {
        "question_id": 1699,
        "question_title": "Number of Ways Where Square of Number Is Equal to Product of Two Numbers"
    },
    {
        "question_id": 1698,
        "question_title": "Replace All ?'s to Avoid Consecutive Repeating Characters"
    },
    {
        "question_id": 1697,
        "question_title": "Strings Differ by One Character"
    },
    {
        "question_id": 1696,
        "question_title": "Strange Printer II"
    },
    {
        "question_id": 1695,
        "question_title": "Maximum Sum Obtained of Any Permutation"
    },
    {
        "question_id": 1694,
        "question_title": "Make Sum Divisible by P"
    },
    {
        "question_id": 1693,
        "question_title": "Sum of All Odd Length Subarrays"
    },
    {
        "question_id": 1692,
        "question_title": "Number of Ways to Reorder Array to Get Same BST"
    },
    {
        "question_id": 1691,
        "question_title": "Minimum Number of Days to Disconnect Island"
    },
    {
        "question_id": 1690,
        "question_title": "Maximum Length of Subarray With Positive Product"
    },
    {
        "question_id": 1689,
        "question_title": "Detect Pattern of Length M Repeated K or More Times"
    },
    {
        "question_id": 1687,
        "question_title": "The Most Similar Path in a Graph"
    },
    {
        "question_id": 1685,
        "question_title": "Stone Game V"
    },
    {
        "question_id": 1684,
        "question_title": "Find Latest Group of Size M"
    },
    {
        "question_id": 1683,
        "question_title": "Maximum Number of Coins You Can Get"
    },
    {
        "question_id": 1682,
        "question_title": "Most Visited Sector in  a Circular Track"
    },
    {
        "question_id": 1681,
        "question_title": "Guess the Majority in a Hidden Array"
    },
    {
        "question_id": 1680,
        "question_title": "Count All Possible Routes"
    },
    {
        "question_id": 1679,
        "question_title": "Shortest Subarray to be Removed to Make Array Sorted"
    },
    {
        "question_id": 1678,
        "question_title": "Number of Ways to Split a String"
    },
    {
        "question_id": 1677,
        "question_title": "Matrix Diagonal Sum"
    },
    {
        "question_id": 1676,
        "question_title": "Minimum Number of Days to Eat N Oranges"
    },
    {
        "question_id": 1675,
        "question_title": "Magnetic Force Between Two Balls"
    },
    {
        "question_id": 1674,
        "question_title": "Minimum Operations to Make Array Equal"
    },
    {
        "question_id": 1672,
        "question_title": "Find the Index of the Large Integer"
    },
    {
        "question_id": 1669,
        "question_title": "Minimum Cost to Cut a Stick"
    },
    {
        "question_id": 1668,
        "question_title": "Find Longest Awesome Substring"
    },
    {
        "question_id": 1667,
        "question_title": "Find Kth Bit in Nth Binary String"
    },
    {
        "question_id": 1666,
        "question_title": "Make The String Great"
    },
    {
        "question_id": 1665,
        "question_title": "Diameter of N-Ary Tree"
    },
    {
        "question_id": 1663,
        "question_title": "Detect Cycles in 2D Grid"
    },
    {
        "question_id": 1662,
        "question_title": "Minimum Numbers of Function Calls to Make Target Array"
    },
    {
        "question_id": 1661,
        "question_title": "Minimum Number of Vertices to Reach All Nodes"
    },
    {
        "question_id": 1660,
        "question_title": "Thousand Separator"
    },
    {
        "question_id": 1659,
        "question_title": "Get the Maximum Score"
    },
    {
        "question_id": 1658,
        "question_title": "Minimum Swaps to Arrange a Binary Grid"
    },
    {
        "question_id": 1657,
        "question_title": "Find the Winner of an Array Game"
    },
    {
        "question_id": 1656,
        "question_title": "Count Good Triplets"
    },
    {
        "question_id": 1655,
        "question_title": "Move Sub-Tree of N-Ary Tree"
    },
    {
        "question_id": 1653,
        "question_title": "Number of Good Leaf Nodes Pairs"
    },
    {
        "question_id": 1652,
        "question_title": "Minimum Suffix Flips"
    },
    {
        "question_id": 1651,
        "question_title": "Shuffle String"
    },
    {
        "question_id": 1650,
        "question_title": "Find Root of N-Ary Tree"
    },
    {
        "question_id": 1649,
        "question_title": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target"
    },
    {
        "question_id": 1648,
        "question_title": "Minimum Insertions to Balance a Parentheses String"
    },
    {
        "question_id": 1647,
        "question_title": "Can Convert String in K Moves"
    },
    {
        "question_id": 1646,
        "question_title": "Kth Missing Positive Number"
    },
    {
        "question_id": 1645,
        "question_title": "Find a Value of a Mysterious Function Closest to Target"
    },
    {
        "question_id": 1644,
        "question_title": "Maximum Number of Non-Overlapping Substrings"
    },
    {
        "question_id": 1643,
        "question_title": "Number of Nodes in the Sub-Tree With the Same Label"
    },
    {
        "question_id": 1642,
        "question_title": "Water Bottles"
    },
    {
        "question_id": 1640,
        "question_title": "Design a File Sharing System"
    },
    {
        "question_id": 1638,
        "question_title": "Best Position for a Service Centre"
    },
    {
        "question_id": 1637,
        "question_title": "String Compression II"
    },
    {
        "question_id": 1636,
        "question_title": "Number of Substrings With Only 1s"
    },
    {
        "question_id": 1635,
        "question_title": "Number of Good Pairs"
    },
    {
        "question_id": 1634,
        "question_title": "Clone N-ary Tree"
    },
    {
        "question_id": 1633,
        "question_title": "Minimum Number of Increments on Subarrays to Form a Target Array"
    },
    {
        "question_id": 1632,
        "question_title": "Number of Good Ways to Split a String"
    },
    {
        "question_id": 1631,
        "question_title": "Number of Sub-arrays With Odd Sum"
    },
    {
        "question_id": 1630,
        "question_title": "Count Odd Numbers in an Interval Range"
    },
    {
        "question_id": 1629,
        "question_title": "Minimum Possible Integer After at Most K Adjacent Swaps On Digits"
    },
    {
        "question_id": 1628,
        "question_title": "Count Submatrices With All Ones"
    },
    {
        "question_id": 1627,
        "question_title": "Last Moment Before All Ants Fall Out of a Plank"
    },
    {
        "question_id": 1626,
        "question_title": "Can Make Arithmetic Progression From Sequence"
    },
    {
        "question_id": 1624,
        "question_title": "Clone Binary Tree With Random Pointer"
    },
    {
        "question_id": 1622,
        "question_title": "Max Value of Equation"
    },
    {
        "question_id": 1621,
        "question_title": "Number of Subsequences That Satisfy the Given Sum Condition"
    },
    {
        "question_id": 1620,
        "question_title": "Check If Array Pairs Are Divisible by k"
    },
    {
        "question_id": 1619,
        "question_title": "Path Crossing"
    },
    {
        "question_id": 1618,
        "question_title": "Delete N Nodes After M Nodes of a Linked List"
    },
    {
        "question_id": 1617,
        "question_title": "Stone Game IV"
    },
    {
        "question_id": 1616,
        "question_title": "Minimum Difference Between Largest and Smallest Value in Three Moves"
    },
    {
        "question_id": 1615,
        "question_title": "Range Sum of Sorted Subarray Sums"
    },
    {
        "question_id": 1613,
        "question_title": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree"
    },
    {
        "question_id": 1612,
        "question_title": "Avoid Flood in The City"
    },
    {
        "question_id": 1611,
        "question_title": "Making File Names Unique"
    },
    {
        "question_id": 1610,
        "question_title": "XOR Operation in an Array"
    },
    {
        "question_id": 1609,
        "question_title": "Find All The Lonely Nodes"
    },
    {
        "question_id": 1605,
        "question_title": "Minimum Number of Days to Make m Bouquets"
    },
    {
        "question_id": 1604,
        "question_title": "Least Number of Unique Integers after K Removals"
    },
    {
        "question_id": 1603,
        "question_title": "Running Sum of 1d Array"
    },
    {
        "question_id": 1587,
        "question_title": "Parallel Courses II"
    },
    {
        "question_id": 1586,
        "question_title": "Longest Subarray of 1's After Deleting One Element"
    },
    {
        "question_id": 1585,
        "question_title": "The kth Factor of n"
    },
    {
        "question_id": 1584,
        "question_title": "Average Salary Excluding the Minimum and Maximum Salary"
    },
    {
        "question_id": 1583,
        "question_title": "Paint House III"
    },
    {
        "question_id": 1582,
        "question_title": "Design Browser History"
    },
    {
        "question_id": 1581,
        "question_title": "The k Strongest Values in an Array"
    },
    {
        "question_id": 1580,
        "question_title": "Shuffle the Array"
    },
    {
        "question_id": 1577,
        "question_title": "Probability of a Two Boxes Having The Same Number of Distinct Balls"
    },
    {
        "question_id": 1576,
        "question_title": "Reorder Routes to Make All Paths Lead to the City Zero"
    },
    {
        "question_id": 1575,
        "question_title": "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts"
    },
    {
        "question_id": 1574,
        "question_title": "Maximum Product of Two Elements in an Array"
    },
    {
        "question_id": 1573,
        "question_title": "Find Two Non-overlapping Sub-arrays Each With Target Sum"
    },
    {
        "question_id": 1572,
        "question_title": "Subrectangle Queries"
    },
    {
        "question_id": 1571,
        "question_title": "Allocate Mailboxes"
    },
    {
        "question_id": 1570,
        "question_title": "Final Prices With a Special Discount in a Shop"
    },
    {
        "question_id": 1569,
        "question_title": "Max Dot Product of Two Subsequences"
    },
    {
        "question_id": 1568,
        "question_title": "Pseudo-Palindromic Paths in a Binary Tree"
    },
    {
        "question_id": 1567,
        "question_title": "Maximum Number of Vowels in a Substring of Given Length"
    },
    {
        "question_id": 1566,
        "question_title": "Check If a Word Occurs As a Prefix of Any Word in a Sentence"
    },
    {
        "question_id": 1563,
        "question_title": "Maximum Number of Darts Inside of a Circular Dartboard"
    },
    {
        "question_id": 1562,
        "question_title": "People Whose List of Favorite Companies Is Not a Subset of Another List"
    },
    {
        "question_id": 1561,
        "question_title": "Rearrange Words in a Sentence"
    },
    {
        "question_id": 1560,
        "question_title": "Number of Students Doing Homework at a Given Time"
    },
    {
        "question_id": 1559,
        "question_title": "Cherry Pickup II"
    },
    {
        "question_id": 1558,
        "question_title": "Course Schedule IV"
    },
    {
        "question_id": 1557,
        "question_title": "Check If a String Contains All Binary Codes of Size K"
    },
    {
        "question_id": 1556,
        "question_title": "Make Two Arrays Equal by Reversing Subarrays"
    },
    {
        "question_id": 1555,
        "question_title": "Number of Ways of Cutting a Pizza"
    },
    {
        "question_id": 1554,
        "question_title": "Minimum Time to Collect All Apples in a Tree"
    },
    {
        "question_id": 1553,
        "question_title": "Count Triplets That Can Form Two Arrays of Equal XOR"
    },
    {
        "question_id": 1552,
        "question_title": "Build an Array With Stack Operations"
    },
    {
        "question_id": 1550,
        "question_title": "Find the Kth Smallest Sum of a Matrix With Sorted Rows"
    },
    {
        "question_id": 1549,
        "question_title": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit"
    },
    {
        "question_id": 1548,
        "question_title": "Check If All 1's Are at Least Length K Places Away"
    },
    {
        "question_id": 1547,
        "question_title": "Destination City"
    },
    {
        "question_id": 1545,
        "question_title": "Form Largest Integer With Digits That Add up to Target"
    },
    {
        "question_id": 1544,
        "question_title": "Count Good Nodes in Binary Tree"
    },
    {
        "question_id": 1543,
        "question_title": "Simplified Fractions"
    },
    {
        "question_id": 1542,
        "question_title": "Consecutive Characters"
    },
    {
        "question_id": 1539,
        "question_title": "Diagonal Traverse II"
    },
    {
        "question_id": 1538,
        "question_title": "Maximum Points You Can Obtain from Cards"
    },
    {
        "question_id": 1537,
        "question_title": "Maximum Score After Splitting a String"
    },
    {
        "question_id": 1535,
        "question_title": "Build Array Where You Can Find The Maximum Exactly K Comparisons"
    },
    {
        "question_id": 1534,
        "question_title": "Minimum Number of Frogs Croaking"
    },
    {
        "question_id": 1533,
        "question_title": "Display Table of Food Orders in a Restaurant"
    },
    {
        "question_id": 1532,
        "question_title": "Reformat The String"
    },
    {
        "question_id": 1531,
        "question_title": "Number of Ways to Wear Different Hats to Each Other"
    },
    {
        "question_id": 1530,
        "question_title": "Check If a String Can Break Another String"
    },
    {
        "question_id": 1529,
        "question_title": "Max Difference You Can Get From Changing an Integer"
    },
    {
        "question_id": 1528,
        "question_title": "Kids With the Greatest Number of Candies"
    },
    {
        "question_id": 1527,
        "question_title": "Number of Ways to Paint N \u00d7 3 Grid"
    },
    {
        "question_id": 1526,
        "question_title": "HTML Entity Parser"
    },
    {
        "question_id": 1525,
        "question_title": "Queries on a Permutation With Key"
    },
    {
        "question_id": 1524,
        "question_title": "String Matching in an Array"
    },
    {
        "question_id": 1522,
        "question_title": "Stone Game III"
    },
    {
        "question_id": 1520,
        "question_title": "Number of Steps to Reduce a Number in Binary Representation to One"
    },
    {
        "question_id": 1519,
        "question_title": "Minimum Subsequence in Non-Increasing Order"
    },
    {
        "question_id": 1517,
        "question_title": "Restore The Array"
    },
    {
        "question_id": 1516,
        "question_title": "The k-th Lexicographical String of All Happy Strings of Length n"
    },
    {
        "question_id": 1515,
        "question_title": "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K"
    },
    {
        "question_id": 1514,
        "question_title": "Minimum Value to Get Positive Step by Step Sum"
    },
    {
        "question_id": 1513,
        "question_title": "Find All Good Strings"
    },
    {
        "question_id": 1512,
        "question_title": "Design Underground System"
    },
    {
        "question_id": 1511,
        "question_title": "Count Number of Teams"
    },
    {
        "question_id": 1510,
        "question_title": "Find Lucky Integer in an Array"
    },
    {
        "question_id": 1508,
        "question_title": "Longest Happy Prefix"
    },
    {
        "question_id": 1507,
        "question_title": "Check if There is a Valid Path in a Grid"
    },
    {
        "question_id": 1505,
        "question_title": "Create Target Array in the Given Order"
    },
    {
        "question_id": 1503,
        "question_title": "Reducing Dishes"
    },
    {
        "question_id": 1502,
        "question_title": "Construct K Palindrome Strings"
    },
    {
        "question_id": 1501,
        "question_title": "Circle and Rectangle Overlapping"
    },
    {
        "question_id": 1500,
        "question_title": "Count Largest Group"
    },
    {
        "question_id": 1499,
        "question_title": "Maximum Performance of a Team"
    },
    {
        "question_id": 1498,
        "question_title": "Find a Corresponding Node of a Binary Tree in a Clone of That Tree"
    },
    {
        "question_id": 1497,
        "question_title": "Design a Stack With Increment Operation"
    },
    {
        "question_id": 1496,
        "question_title": "Lucky Numbers in a Matrix"
    },
    {
        "question_id": 1493,
        "question_title": "Frog Position After T Seconds"
    },
    {
        "question_id": 1492,
        "question_title": "Time Needed to Inform All Employees"
    },
    {
        "question_id": 1491,
        "question_title": "Number of Times Binary String Is Prefix-Aligned"
    },
    {
        "question_id": 1490,
        "question_title": "Generate a String With Characters That Have Odd Counts"
    },
    {
        "question_id": 1489,
        "question_title": "Pizza With 3n Slices"
    },
    {
        "question_id": 1488,
        "question_title": "Sort Integers by The Power Value"
    },
    {
        "question_id": 1487,
        "question_title": "Cinema Seat Allocation"
    },
    {
        "question_id": 1486,
        "question_title": "Find the Distance Value Between Two Arrays"
    },
    {
        "question_id": 1485,
        "question_title": "Minimum Cost to Make at Least One Valid Path in a Grid"
    },
    {
        "question_id": 1484,
        "question_title": "Linked List in Binary Tree"
    },
    {
        "question_id": 1483,
        "question_title": "Rank Teams by Votes"
    },
    {
        "question_id": 1482,
        "question_title": "How Many Numbers Are Smaller Than the Current Number"
    },
    {
        "question_id": 1479,
        "question_title": "Construct Target Array With Multiple Sums"
    },
    {
        "question_id": 1478,
        "question_title": "Maximum Number of Events That Can Be Attended"
    },
    {
        "question_id": 1477,
        "question_title": "Product of the Last K Numbers"
    },
    {
        "question_id": 1476,
        "question_title": "Count Negative Numbers in a Sorted Matrix"
    },
    {
        "question_id": 1475,
        "question_title": "Maximum Sum BST in Binary Tree"
    },
    {
        "question_id": 1474,
        "question_title": "Longest ZigZag Path in a Binary Tree"
    },
    {
        "question_id": 1473,
        "question_title": "Find the Longest Substring Containing Vowels in Even Counts"
    },
    {
        "question_id": 1472,
        "question_title": "Increasing Decreasing String"
    },
    {
        "question_id": 1471,
        "question_title": "Maximum Students Taking Exam"
    },
    {
        "question_id": 1470,
        "question_title": "Tweet Counts Per Frequency"
    },
    {
        "question_id": 1469,
        "question_title": "Minimum Number of Steps to Make Two Strings Anagram"
    },
    {
        "question_id": 1468,
        "question_title": "Check If N and Its Double Exist"
    },
    {
        "question_id": 1466,
        "question_title": "Jump Game V"
    },
    {
        "question_id": 1465,
        "question_title": "Maximum Product of Splitted Binary Tree"
    },
    {
        "question_id": 1464,
        "question_title": "Reduce Array Size to The Half"
    },
    {
        "question_id": 1463,
        "question_title": "The K Weakest Rows in a Matrix"
    },
    {
        "question_id": 1461,
        "question_title": "Count All Valid Pickup and Delivery Options"
    },
    {
        "question_id": 1460,
        "question_title": "Number of Substrings Containing All Three Characters"
    },
    {
        "question_id": 1459,
        "question_title": "Apply Discount Every n Orders"
    },
    {
        "question_id": 1458,
        "question_title": "Sort Integers by The Number of 1 Bits"
    },
    {
        "question_id": 1457,
        "question_title": "Minimum Difficulty of a Job Schedule"
    },
    {
        "question_id": 1456,
        "question_title": "Find the City With the Smallest Number of Neighbors at a Threshold Distance"
    },
    {
        "question_id": 1455,
        "question_title": "Filter Restaurants by Vegan-Friendly, Price and Distance"
    },
    {
        "question_id": 1454,
        "question_title": "Remove Palindromic Subsequences"
    },
    {
        "question_id": 1451,
        "question_title": "Minimum Number of Taps to Open to Water a Garden"
    },
    {
        "question_id": 1450,
        "question_title": "Delete Leaves With a Given Value"
    },
    {
        "question_id": 1449,
        "question_title": "Print Words Vertically"
    },
    {
        "question_id": 1448,
        "question_title": "Maximum 69 Number"
    },
    {
        "question_id": 1447,
        "question_title": "Jump Game IV"
    },
    {
        "question_id": 1446,
        "question_title": "Angle Between Hands of a Clock"
    },
    {
        "question_id": 1445,
        "question_title": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold"
    },
    {
        "question_id": 1444,
        "question_title": "Number of Steps to Reduce a Number to Zero"
    },
    {
        "question_id": 1443,
        "question_title": "Minimum Distance to Type a Word Using Two Fingers"
    },
    {
        "question_id": 1442,
        "question_title": "Number of Operations to Make Network Connected"
    },
    {
        "question_id": 1441,
        "question_title": "Minimum Flips to Make a OR b Equal to c"
    },
    {
        "question_id": 1440,
        "question_title": "Convert Integer to the Sum of Two No-Zero Integers"
    },
    {
        "question_id": 1437,
        "question_title": "Minimum Insertion Steps to Make a String Palindrome"
    },
    {
        "question_id": 1436,
        "question_title": "Get Watched Videos by Your Friends"
    },
    {
        "question_id": 1435,
        "question_title": "XOR Queries of a Subarray"
    },
    {
        "question_id": 1434,
        "question_title": "Decrypt String from Alphabet to Integer Mapping"
    },
    {
        "question_id": 1433,
        "question_title": "Encrypt and Decrypt Strings"
    },
    {
        "question_id": 1432,
        "question_title": "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree"
    },
    {
        "question_id": 1431,
        "question_title": "All Ancestors of a Node in a Directed Acyclic Graph"
    },
    {
        "question_id": 1430,
        "question_title": "Find the K-Beauty of a Number"
    },
    {
        "question_id": 1429,
        "question_title": "Verbal Arithmetic Puzzle"
    },
    {
        "question_id": 1428,
        "question_title": "Jump Game III"
    },
    {
        "question_id": 1427,
        "question_title": "All Elements in Two Binary Search Trees"
    },
    {
        "question_id": 1426,
        "question_title": "Find N Unique Integers Sum up to Zero"
    },
    {
        "question_id": 1424,
        "question_title": "Maximum Candies You Can Get from Boxes"
    },
    {
        "question_id": 1423,
        "question_title": "Maximum Number of Occurrences of a Substring"
    },
    {
        "question_id": 1422,
        "question_title": "Divide Array in Sets of K Consecutive Numbers"
    },
    {
        "question_id": 1421,
        "question_title": "Find Numbers with Even Number of Digits"
    },
    {
        "question_id": 1419,
        "question_title": "Make Array Non-decreasing or Non-increasing"
    },
    {
        "question_id": 1418,
        "question_title": "Fair Distribution of Cookies"
    },
    {
        "question_id": 1416,
        "question_title": "Check if an Array Is Consecutive"
    },
    {
        "question_id": 1414,
        "question_title": "Shortest Path in a Grid with Obstacles Elimination"
    },
    {
        "question_id": 1413,
        "question_title": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold"
    },
    {
        "question_id": 1411,
        "question_title": "Convert Binary Number in a Linked List to Integer"
    },
    {
        "question_id": 1409,
        "question_title": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix"
    },
    {
        "question_id": 1408,
        "question_title": "Find the Smallest Divisor Given a Threshold"
    },
    {
        "question_id": 1407,
        "question_title": "Group the People Given the Group Size They Belong To"
    },
    {
        "question_id": 1406,
        "question_title": "Subtract the Product and Sum of Digits of an Integer"
    },
    {
        "question_id": 1404,
        "question_title": "Print Immutable Linked List in Reverse"
    },
    {
        "question_id": 1403,
        "question_title": "Palindrome Partitioning III"
    },
    {
        "question_id": 1402,
        "question_title": "Count Square Submatrices with All Ones"
    },
    {
        "question_id": 1401,
        "question_title": "Number of Burgers with No Waste of Ingredients"
    },
    {
        "question_id": 1400,
        "question_title": "Find Winner on a Tic Tac Toe Game"
    },
    {
        "question_id": 1398,
        "question_title": "Number of Ways to Stay in the Same Place After Some Steps"
    },
    {
        "question_id": 1397,
        "question_title": "Search Suggestions System"
    },
    {
        "question_id": 1396,
        "question_title": "Count Servers that Communicate"
    },
    {
        "question_id": 1395,
        "question_title": "Minimum Time Visiting All Points"
    },
    {
        "question_id": 1394,
        "question_title": "Minimum Path Cost in a Grid"
    },
    {
        "question_id": 1393,
        "question_title": "Maximum Value of K Coins From Piles"
    },
    {
        "question_id": 1392,
        "question_title": "Find the Difference of Two Arrays"
    },
    {
        "question_id": 1391,
        "question_title": "Counting Elements"
    },
    {
        "question_id": 1389,
        "question_title": "Minimum Moves to Move a Box to Their Target Location"
    },
    {
        "question_id": 1388,
        "question_title": "Greatest Sum Divisible by Three"
    },
    {
        "question_id": 1387,
        "question_title": "Find Elements in a Contaminated Binary Tree"
    },
    {
        "question_id": 1386,
        "question_title": "Shift 2D Grid"
    },
    {
        "question_id": 1385,
        "question_title": "Number of Ways to Build House of Cards"
    },
    {
        "question_id": 1384,
        "question_title": "Maximum Font to Fit a Sentence in a Screen"
    },
    {
        "question_id": 1383,
        "question_title": "Number of Single Divisor Triplets"
    },
    {
        "question_id": 1382,
        "question_title": "Calculate Amount Paid in Taxes"
    },
    {
        "question_id": 1381,
        "question_title": "Maximum Score Words Formed by Letters"
    },
    {
        "question_id": 1380,
        "question_title": "Number of Closed Islands"
    },
    {
        "question_id": 1379,
        "question_title": "Reconstruct a 2-Row Binary Matrix"
    },
    {
        "question_id": 1378,
        "question_title": "Cells with Odd Values in a Matrix"
    },
    {
        "question_id": 1376,
        "question_title": "Selling Pieces of Wood"
    },
    {
        "question_id": 1375,
        "question_title": "Find Palindrome With Fixed Length"
    },
    {
        "question_id": 1374,
        "question_title": "Leftmost Column with at Least a One"
    },
    {
        "question_id": 1372,
        "question_title": "Check If It Is a Good Array"
    },
    {
        "question_id": 1371,
        "question_title": "Minimum Remove to Make Valid Parentheses"
    },
    {
        "question_id": 1370,
        "question_title": "Count Number of Nice Subarrays"
    },
    {
        "question_id": 1369,
        "question_title": "Minimum Swaps to Make Strings Equal"
    },
    {
        "question_id": 1367,
        "question_title": "Maximum Height by Stacking Cuboids "
    },
    {
        "question_id": 1366,
        "question_title": "First Unique Number"
    },
    {
        "question_id": 1364,
        "question_title": "Tuple with Same Product"
    },
    {
        "question_id": 1363,
        "question_title": "Greatest English Letter in Upper and Lower Case"
    },
    {
        "question_id": 1362,
        "question_title": "Airplane Seat Assignment Probability"
    },
    {
        "question_id": 1361,
        "question_title": "Tiling a Rectangle with the Fewest Squares"
    },
    {
        "question_id": 1360,
        "question_title": "Maximum Length of a Concatenated String with Unique Characters"
    },
    {
        "question_id": 1359,
        "question_title": "Circular Permutation in Binary Representation"
    },
    {
        "question_id": 1358,
        "question_title": "Find Positive Integer Solution for a Given Equation"
    },
    {
        "question_id": 1356,
        "question_title": "Minimum Number of Moves to Make Palindrome"
    },
    {
        "question_id": 1355,
        "question_title": "Minimum Deletions to Make Array Beautiful"
    },
    {
        "question_id": 1354,
        "question_title": "Find Players With Zero or One Losses"
    },
    {
        "question_id": 1353,
        "question_title": "Find Resultant Array After Removing Anagrams"
    },
    {
        "question_id": 1352,
        "question_title": "Maximum Profit in Job Scheduling"
    },
    {
        "question_id": 1351,
        "question_title": "Replace the Substring for Balanced String"
    },
    {
        "question_id": 1350,
        "question_title": "Remove Sub-Folders from the Filesystem"
    },
    {
        "question_id": 1349,
        "question_title": "Check If It Is a Straight Line"
    },
    {
        "question_id": 1348,
        "question_title": "Maximum Score Of Spliced Array"
    },
    {
        "question_id": 1347,
        "question_title": "Distance to a Cycle in Undirected Graph"
    },
    {
        "question_id": 1346,
        "question_title": "Maximize the Topmost Element After K Moves"
    },
    {
        "question_id": 1345,
        "question_title": "Perform String Shifts"
    },
    {
        "question_id": 1344,
        "question_title": "Maximum Equal Frequency"
    },
    {
        "question_id": 1343,
        "question_title": "Dice Roll Simulation"
    },
    {
        "question_id": 1342,
        "question_title": "Queens That Can Attack the King"
    },
    {
        "question_id": 1341,
        "question_title": "Split a String in Balanced Strings"
    },
    {
        "question_id": 1337,
        "question_title": "Design Skiplist"
    },
    {
        "question_id": 1336,
        "question_title": "Maximum Product of the Length of Two Palindromic Substrings"
    },
    {
        "question_id": 1335,
        "question_title": "Maximum Candies Allocated to K Children"
    },
    {
        "question_id": 1334,
        "question_title": "Sum of Numbers With Units Digit K"
    },
    {
        "question_id": 1333,
        "question_title": "Sort the Jumbled Numbers"
    },
    {
        "question_id": 1332,
        "question_title": "Count Vowels Permutation"
    },
    {
        "question_id": 1331,
        "question_title": "Path with Maximum Gold"
    },
    {
        "question_id": 1330,
        "question_title": "Longest Arithmetic Subsequence of Given Difference"
    },
    {
        "question_id": 1329,
        "question_title": "Minimum Cost to Move Chips to The Same Position"
    },
    {
        "question_id": 1326,
        "question_title": "Sum of Floored Pairs"
    },
    {
        "question_id": 1325,
        "question_title": "Path with Maximum Probability"
    },
    {
        "question_id": 1324,
        "question_title": "Where Will the Ball Fall"
    },
    {
        "question_id": 1322,
        "question_title": "Minimum Moves to Reach Target with Rotations"
    },
    {
        "question_id": 1321,
        "question_title": "Get Equal Substrings Within Budget"
    },
    {
        "question_id": 1320,
        "question_title": "Remove All Adjacent Duplicates in String II"
    },
    {
        "question_id": 1319,
        "question_title": "Unique Number of Occurrences"
    },
    {
        "question_id": 1313,
        "question_title": "Count Ways to Build Rooms in an Ant Colony"
    },
    {
        "question_id": 1312,
        "question_title": "Count Artifacts That Can Be Extracted"
    },
    {
        "question_id": 1311,
        "question_title": "Largest Magic Square"
    },
    {
        "question_id": 1310,
        "question_title": "Watering Plants"
    },
    {
        "question_id": 1309,
        "question_title": "Sort Items by Groups Respecting Dependencies"
    },
    {
        "question_id": 1308,
        "question_title": "Smallest String With Swaps"
    },
    {
        "question_id": 1307,
        "question_title": "Ugly Number III"
    },
    {
        "question_id": 1306,
        "question_title": "Minimum Absolute Difference"
    },
    {
        "question_id": 1305,
        "question_title": "Number of Visible People in a Queue"
    },
    {
        "question_id": 1304,
        "question_title": "Longest Happy String"
    },
    {
        "question_id": 1303,
        "question_title": "Minimum Moves to Reach Target Score"
    },
    {
        "question_id": 1302,
        "question_title": "Delete Characters to Make Fancy String"
    },
    {
        "question_id": 1300,
        "question_title": "Critical Connections in a Network"
    },
    {
        "question_id": 1299,
        "question_title": "K-Concatenation Maximum Sum"
    },
    {
        "question_id": 1298,
        "question_title": "Reverse Substrings Between Each Pair of Parentheses"
    },
    {
        "question_id": 1297,
        "question_title": "Maximum Number of Balloons"
    },
    {
        "question_id": 1296,
        "question_title": "Kth Ancestor of a Tree Node"
    },
    {
        "question_id": 1295,
        "question_title": "Minimum Garden Perimeter to Collect Enough Apples"
    },
    {
        "question_id": 1294,
        "question_title": "Range Frequency Queries"
    },
    {
        "question_id": 1293,
        "question_title": "Three Consecutive Odds"
    },
    {
        "question_id": 1290,
        "question_title": "Make Array Strictly Increasing"
    },
    {
        "question_id": 1289,
        "question_title": "Day of the Week"
    },
    {
        "question_id": 1288,
        "question_title": "Maximum Subarray Sum with One Deletion"
    },
    {
        "question_id": 1287,
        "question_title": "Distance Between Bus Stops"
    },
    {
        "question_id": 1286,
        "question_title": "Constrained Subsequence Sum"
    },
    {
        "question_id": 1285,
        "question_title": "Balance a Binary Search Tree"
    },
    {
        "question_id": 1284,
        "question_title": "Four Divisors"
    },
    {
        "question_id": 1283,
        "question_title": "Reformat Date"
    },
    {
        "question_id": 1282,
        "question_title": "Number of Valid Words for Each Puzzle"
    },
    {
        "question_id": 1281,
        "question_title": "Can Make Palindrome from Substring"
    },
    {
        "question_id": 1280,
        "question_title": "Diet Plan Performance"
    },
    {
        "question_id": 1279,
        "question_title": "Prime Arrangements"
    },
    {
        "question_id": 1277,
        "question_title": "Largest Multiple of Three"
    },
    {
        "question_id": 1276,
        "question_title": "Closest Divisors"
    },
    {
        "question_id": 1275,
        "question_title": "Validate Binary Tree Nodes"
    },
    {
        "question_id": 1274,
        "question_title": "Number of Days Between Two Dates"
    },
    {
        "question_id": 1273,
        "question_title": "Compare Strings by Frequency of the Smallest Character"
    },
    {
        "question_id": 1272,
        "question_title": "Invalid Transactions"
    },
    {
        "question_id": 1271,
        "question_title": "Web Crawler"
    },
    {
        "question_id": 1270,
        "question_title": "Dinner Plate Stacks"
    },
    {
        "question_id": 1267,
        "question_title": "Remove Zero Sum Consecutive Nodes from Linked List"
    },
    {
        "question_id": 1264,
        "question_title": "Maximum Number of Words You Can Type"
    },
    {
        "question_id": 1263,
        "question_title": "Number of Dice Rolls With Target Sum"
    },
    {
        "question_id": 1262,
        "question_title": "Online Majority Element In Subarray"
    },
    {
        "question_id": 1261,
        "question_title": "Swap For Longest Repeated Character Substring"
    },
    {
        "question_id": 1260,
        "question_title": "Day of the Year"
    },
    {
        "question_id": 1257,
        "question_title": "Rank Transform of a Matrix"
    },
    {
        "question_id": 1256,
        "question_title": "Rank Transform of an Array"
    },
    {
        "question_id": 1255,
        "question_title": "Reverse Subarray To Maximize Array Value"
    },
    {
        "question_id": 1254,
        "question_title": "Deepest Leaves Sum"
    },
    {
        "question_id": 1253,
        "question_title": "Sort the Matrix Diagonally"
    },
    {
        "question_id": 1252,
        "question_title": "Break a Palindrome"
    },
    {
        "question_id": 1251,
        "question_title": "Longest Chunked Palindrome Decomposition"
    },
    {
        "question_id": 1250,
        "question_title": "Longest Common Subsequence"
    },
    {
        "question_id": 1249,
        "question_title": "Snapshot Array"
    },
    {
        "question_id": 1248,
        "question_title": "Binary Tree Coloring Game"
    },
    {
        "question_id": 1247,
        "question_title": "Decrease Elements To Make Array Zigzag"
    },
    {
        "question_id": 1244,
        "question_title": "Distinct Echo Substrings"
    },
    {
        "question_id": 1243,
        "question_title": "Sum of Nodes with Even-Valued Grandparent"
    },
    {
        "question_id": 1242,
        "question_title": "Matrix Block Sum"
    },
    {
        "question_id": 1241,
        "question_title": "Decompress Run-Length Encoded List"
    },
    {
        "question_id": 1240,
        "question_title": "Stone Game II"
    },
    {
        "question_id": 1239,
        "question_title": "Largest 1-Bordered Square"
    },
    {
        "question_id": 1238,
        "question_title": "Alphabet Board Path"
    },
    {
        "question_id": 1236,
        "question_title": "N-th Tribonacci Number"
    },
    {
        "question_id": 1234,
        "question_title": "Number of Paths with Max Score"
    },
    {
        "question_id": 1233,
        "question_title": "Number of Ships in a Rectangle"
    },
    {
        "question_id": 1232,
        "question_title": "Sum of Mutated Array Closest to Target"
    },
    {
        "question_id": 1231,
        "question_title": "Replace Elements with Greatest Element on Right Side"
    },
    {
        "question_id": 1230,
        "question_title": "Maximum of Absolute Value Expression"
    },
    {
        "question_id": 1229,
        "question_title": "Shortest Path with Alternating Colors"
    },
    {
        "question_id": 1228,
        "question_title": "Minimum Cost Tree From Leaf Values"
    },
    {
        "question_id": 1227,
        "question_title": "Number of Equivalent Domino Pairs"
    },
    {
        "question_id": 1224,
        "question_title": "Minimum Falling Path Sum II"
    },
    {
        "question_id": 1223,
        "question_title": "Graph Connectivity With Threshold"
    },
    {
        "question_id": 1222,
        "question_title": "Remove Covered Intervals"
    },
    {
        "question_id": 1221,
        "question_title": "Element Appearing More Than 25% In Sorted Array"
    },
    {
        "question_id": 1220,
        "question_title": "Smallest Sufficient Team"
    },
    {
        "question_id": 1219,
        "question_title": "Longest Well-Performing Interval"
    },
    {
        "question_id": 1218,
        "question_title": "Lowest Common Ancestor of Deepest Leaves"
    },
    {
        "question_id": 1217,
        "question_title": "Relative Sort Array"
    },
    {
        "question_id": 1213,
        "question_title": "Handshakes That Don't Cross"
    },
    {
        "question_id": 1212,
        "question_title": "Sequential Digits"
    },
    {
        "question_id": 1211,
        "question_title": "Iterator for Combination"
    },
    {
        "question_id": 1210,
        "question_title": "Mean of Array After Removing Some Elements"
    },
    {
        "question_id": 1208,
        "question_title": "Maximum Nesting Depth of Two Valid Parentheses Strings"
    },
    {
        "question_id": 1207,
        "question_title": "Delete Nodes And Return Forest"
    },
    {
        "question_id": 1206,
        "question_title": "Corporate Flight Bookings"
    },
    {
        "question_id": 1205,
        "question_title": "Defanging an IP Address"
    },
    {
        "question_id": 1202,
        "question_title": "Palindrome Removal"
    },
    {
        "question_id": 1201,
        "question_title": "Delete Tree Nodes"
    },
    {
        "question_id": 1200,
        "question_title": "Remove Interval"
    },
    {
        "question_id": 1199,
        "question_title": "Hexspeak"
    },
    {
        "question_id": 1197,
        "question_title": "Parsing A Boolean Expression"
    },
    {
        "question_id": 1196,
        "question_title": "Filling Bookcase Shelves"
    },
    {
        "question_id": 1195,
        "question_title": "Distribute Candies to People"
    },
    {
        "question_id": 1194,
        "question_title": "Path In Zigzag Labelled Binary Tree"
    },
    {
        "question_id": 1192,
        "question_title": "Divide Chocolate"
    },
    {
        "question_id": 1191,
        "question_title": "Synonymous Sentences"
    },
    {
        "question_id": 1190,
        "question_title": "Smallest Common Region"
    },
    {
        "question_id": 1189,
        "question_title": "Encode Number"
    },
    {
        "question_id": 1188,
        "question_title": "Brace Expansion II"
    },
    {
        "question_id": 1185,
        "question_title": "Find in Mountain Array"
    },
    {
        "question_id": 1184,
        "question_title": "Car Pooling"
    },
    {
        "question_id": 1183,
        "question_title": "Statistics from a Large Sample"
    },
    {
        "question_id": 1178,
        "question_title": "Valid Palindrome III"
    },
    {
        "question_id": 1177,
        "question_title": "Tree Diameter"
    },
    {
        "question_id": 1176,
        "question_title": "Design A Leaderboard"
    },
    {
        "question_id": 1175,
        "question_title": "Array Transformation"
    },
    {
        "question_id": 1171,
        "question_title": "Shortest Path in Binary Matrix"
    },
    {
        "question_id": 1170,
        "question_title": "Shortest Common Supersequence "
    },
    {
        "question_id": 1169,
        "question_title": "Largest Values From Labels"
    },
    {
        "question_id": 1168,
        "question_title": "Duplicate Zeros"
    },
    {
        "question_id": 1167,
        "question_title": "Minimum Time to Build Blocks"
    },
    {
        "question_id": 1166,
        "question_title": "Toss Strange Coins"
    },
    {
        "question_id": 1165,
        "question_title": "Meeting Scheduler"
    },
    {
        "question_id": 1164,
        "question_title": "Missing Number In Arithmetic Progression"
    },
    {
        "question_id": 1160,
        "question_title": "Letter Tile Possibilities"
    },
    {
        "question_id": 1159,
        "question_title": "Smallest Subsequence of Distinct Characters"
    },
    {
        "question_id": 1157,
        "question_title": "Insufficient Nodes in Root to Leaf Paths"
    },
    {
        "question_id": 1156,
        "question_title": "Occurrences After Bigram"
    },
    {
        "question_id": 1152,
        "question_title": "Maximum Number of Ones"
    },
    {
        "question_id": 1151,
        "question_title": "Stepping Numbers"
    },
    {
        "question_id": 1150,
        "question_title": "Two Sum BSTs"
    },
    {
        "question_id": 1149,
        "question_title": "Intersection of Three Sorted Arrays"
    },
    {
        "question_id": 1148,
        "question_title": "Adding Two Negabinary Numbers"
    },
    {
        "question_id": 1147,
        "question_title": "Flip Columns For Maximum Number of Equal Rows"
    },
    {
        "question_id": 1146,
        "question_title": "Greatest Common Divisor of Strings"
    },
    {
        "question_id": 1145,
        "question_title": "Number of Submatrices That Sum to Target"
    },
    {
        "question_id": 1144,
        "question_title": "Optimize Water Distribution in a Village"
    },
    {
        "question_id": 1143,
        "question_title": "Find Smallest Common Element in All Rows"
    },
    {
        "question_id": 1142,
        "question_title": "Minimum Knight Moves"
    },
    {
        "question_id": 1141,
        "question_title": "How Many Apples Can You Put into the Basket"
    },
    {
        "question_id": 1140,
        "question_title": "Distant Barcodes"
    },
    {
        "question_id": 1139,
        "question_title": "Previous Permutation With One Swap"
    },
    {
        "question_id": 1138,
        "question_title": "Grumpy Bookstore Owner"
    },
    {
        "question_id": 1137,
        "question_title": "Height Checker"
    },
    {
        "question_id": 1134,
        "question_title": "Shortest Distance to Target Color"
    },
    {
        "question_id": 1133,
        "question_title": "Last Substring in Lexicographical Order"
    },
    {
        "question_id": 1132,
        "question_title": "Before and After Puzzle"
    },
    {
        "question_id": 1131,
        "question_title": "Count Substrings with Only One Distinct Letter"
    },
    {
        "question_id": 1130,
        "question_title": "Last Stone Weight II"
    },
    {
        "question_id": 1129,
        "question_title": "Longest String Chain"
    },
    {
        "question_id": 1128,
        "question_title": "Remove All Adjacent Duplicates In String"
    },
    {
        "question_id": 1127,
        "question_title": "Last Stone Weight"
    },
    {
        "question_id": 1126,
        "question_title": "Minimum Cost to Connect Sticks"
    },
    {
        "question_id": 1125,
        "question_title": "Design File System"
    },
    {
        "question_id": 1124,
        "question_title": "String Transforms Into Another String"
    },
    {
        "question_id": 1123,
        "question_title": "Single-Row Keyboard"
    },
    {
        "question_id": 1122,
        "question_title": "Longest Duplicate Substring"
    },
    {
        "question_id": 1121,
        "question_title": "Partition Array for Maximum Sum"
    },
    {
        "question_id": 1120,
        "question_title": "Flower Planting With No Adjacent"
    },
    {
        "question_id": 1119,
        "question_title": "Robot Bounded In Circle"
    },
    {
        "question_id": 1118,
        "question_title": "Divide Array Into Increasing Sequences"
    },
    {
        "question_id": 1117,
        "question_title": "As Far from Land as Possible"
    },
    {
        "question_id": 1116,
        "question_title": "Maximum Level Sum of a Binary Tree"
    },
    {
        "question_id": 1115,
        "question_title": "Valid Boomerang"
    },
    {
        "question_id": 1114,
        "question_title": "Binary Search Tree to Greater Sum Tree"
    },
    {
        "question_id": 1113,
        "question_title": "Moving Stones Until Consecutive II"
    },
    {
        "question_id": 1112,
        "question_title": "Find Words That Can Be Formed by Characters"
    },
    {
        "question_id": 1111,
        "question_title": "Minimum Score Triangulation of Polygon"
    },
    {
        "question_id": 1108,
        "question_title": "Analyze User Website Visit Pattern"
    },
    {
        "question_id": 1107,
        "question_title": "Minimum Swaps to Group All 1's Together"
    },
    {
        "question_id": 1106,
        "question_title": "Escape a Large Maze"
    },
    {
        "question_id": 1105,
        "question_title": "Uncrossed Lines"
    },
    {
        "question_id": 1104,
        "question_title": "Coloring A Border"
    },
    {
        "question_id": 1103,
        "question_title": "Moving Stones Until Consecutive"
    },
    {
        "question_id": 1102,
        "question_title": "Check If a Number Is Majority Element in a Sorted Array"
    },
    {
        "question_id": 1101,
        "question_title": "Parallel Courses"
    },
    {
        "question_id": 1100,
        "question_title": "Connecting Cities With Minimum Cost"
    },
    {
        "question_id": 1099,
        "question_title": "Path With Maximum Minimum Value"
    },
    {
        "question_id": 1098,
        "question_title": "Largest Unique Number"
    },
    {
        "question_id": 1097,
        "question_title": "Stream of Characters"
    },
    {
        "question_id": 1096,
        "question_title": "Maximum Sum of Two Non-Overlapping Subarrays"
    },
    {
        "question_id": 1095,
        "question_title": "Two City Scheduling"
    },
    {
        "question_id": 1094,
        "question_title": "Matrix Cells in Distance Order"
    },
    {
        "question_id": 1093,
        "question_title": "Recover a Tree From Preorder Traversal"
    },
    {
        "question_id": 1092,
        "question_title": "Maximum Difference Between Node and Ancestor"
    },
    {
        "question_id": 1091,
        "question_title": "Maximum Average Subtree"
    },
    {
        "question_id": 1090,
        "question_title": "Armstrong Number"
    },
    {
        "question_id": 1089,
        "question_title": "Remove Vowels from a String"
    },
    {
        "question_id": 1088,
        "question_title": "Number of Days in a Month"
    },
    {
        "question_id": 1087,
        "question_title": "Longest Arithmetic Subsequence"
    },
    {
        "question_id": 1086,
        "question_title": "Divisor Game"
    },
    {
        "question_id": 1085,
        "question_title": "The Earliest Moment When Everyone Become Friends"
    },
    {
        "question_id": 1084,
        "question_title": "Find K-Length Substrings With No Repeated Characters"
    },
    {
        "question_id": 1083,
        "question_title": "Two Sum Less Than K"
    },
    {
        "question_id": 1082,
        "question_title": "Sum of Digits in the Minimum Number"
    },
    {
        "question_id": 1081,
        "question_title": "Video Stitching"
    },
    {
        "question_id": 1080,
        "question_title": "Camelcase Matching"
    },
    {
        "question_id": 1079,
        "question_title": "Sum of Root To Leaf Binary Numbers"
    },
    {
        "question_id": 1078,
        "question_title": "Remove Outermost Parentheses"
    },
    {
        "question_id": 1077,
        "question_title": "Confusing Number II"
    },
    {
        "question_id": 1076,
        "question_title": "Brace Expansion"
    },
    {
        "question_id": 1075,
        "question_title": "Index Pairs of a String"
    },
    {
        "question_id": 1074,
        "question_title": "High Five"
    },
    {
        "question_id": 1073,
        "question_title": "Number of Enclaves"
    },
    {
        "question_id": 1072,
        "question_title": "Next Greater Node In Linked List"
    },
    {
        "question_id": 1071,
        "question_title": "Binary Prefix Divisible By 5"
    },
    {
        "question_id": 1070,
        "question_title": "Convert to Base -2"
    },
    {
        "question_id": 1069,
        "question_title": "Confusing Number"
    },
    {
        "question_id": 1068,
        "question_title": "Digit Count in Range"
    },
    {
        "question_id": 1067,
        "question_title": "Campus Bikes II"
    },
    {
        "question_id": 1066,
        "question_title": "Fixed Point"
    },
    {
        "question_id": 1065,
        "question_title": "Binary String With Substrings Representing 1 To N"
    },
    {
        "question_id": 1064,
        "question_title": "Smallest Integer Divisible by K"
    },
    {
        "question_id": 1063,
        "question_title": "Best Sightseeing Pair"
    },
    {
        "question_id": 1062,
        "question_title": "Partition Array Into Three Parts With Equal Sum"
    },
    {
        "question_id": 1061,
        "question_title": "Number of Valid Subarrays"
    },
    {
        "question_id": 1060,
        "question_title": "Longest Repeating Substring"
    },
    {
        "question_id": 1059,
        "question_title": "Missing Element in Sorted Array"
    },
    {
        "question_id": 1058,
        "question_title": "Lexicographically Smallest Equivalent String"
    },
    {
        "question_id": 1057,
        "question_title": "Numbers With Repeated Digits"
    },
    {
        "question_id": 1056,
        "question_title": "Capacity To Ship Packages Within D Days"
    },
    {
        "question_id": 1055,
        "question_title": "Pairs of Songs With Total Durations Divisible by 60"
    },
    {
        "question_id": 1054,
        "question_title": "Complement of Base 10 Integer"
    },
    {
        "question_id": 1053,
        "question_title": "Minimize Rounding Error to Meet Target"
    },
    {
        "question_id": 1052,
        "question_title": "Campus Bikes"
    },
    {
        "question_id": 1051,
        "question_title": "Shortest Way to Form String"
    },
    {
        "question_id": 1050,
        "question_title": "Construct Binary Search Tree from Preorder Traversal"
    },
    {
        "question_id": 1049,
        "question_title": "Minimum Domino Rotations For Equal Row"
    },
    {
        "question_id": 1048,
        "question_title": "Clumsy Factorial"
    },
    {
        "question_id": 1047,
        "question_title": "Maximize Sum Of Array After K Negations"
    },
    {
        "question_id": 1046,
        "question_title": "Max Consecutive Ones III"
    },
    {
        "question_id": 1045,
        "question_title": "Check If Word Is Valid After Substitutions"
    },
    {
        "question_id": 1044,
        "question_title": "Find Common Characters"
    },
    {
        "question_id": 1043,
        "question_title": "Grid Illumination"
    },
    {
        "question_id": 1042,
        "question_title": "Minimum Cost to Merge Stones"
    },
    {
        "question_id": 1041,
        "question_title": "Available Captures for Rook"
    },
    {
        "question_id": 1040,
        "question_title": "Maximum Binary Tree II"
    },
    {
        "question_id": 1039,
        "question_title": "Find the Town Judge"
    },
    {
        "question_id": 1038,
        "question_title": "Number of Squareful Arrays"
    },
    {
        "question_id": 1037,
        "question_title": "Minimum Number of K Consecutive Bit Flips"
    },
    {
        "question_id": 1036,
        "question_title": "Rotting Oranges"
    },
    {
        "question_id": 1035,
        "question_title": "Cousins in Binary Tree"
    },
    {
        "question_id": 1034,
        "question_title": "Subarrays with K Different Integers"
    },
    {
        "question_id": 1033,
        "question_title": "Broken Calculator"
    },
    {
        "question_id": 1032,
        "question_title": "Satisfiability of Equality Equations"
    },
    {
        "question_id": 1031,
        "question_title": "Add to Array-Form of Integer"
    },
    {
        "question_id": 1030,
        "question_title": "Smallest String Starting From Leaf"
    },
    {
        "question_id": 1029,
        "question_title": "Vertical Order Traversal of a Binary Tree"
    },
    {
        "question_id": 1028,
        "question_title": "Interval List Intersections"
    },
    {
        "question_id": 1027,
        "question_title": "Sum of Even Numbers After Queries"
    },
    {
        "question_id": 1026,
        "question_title": "String Without AAA or BBB"
    },
    {
        "question_id": 1025,
        "question_title": "Minimum Cost For Tickets"
    },
    {
        "question_id": 1024,
        "question_title": "Triples with Bitwise AND Equal To Zero"
    },
    {
        "question_id": 1023,
        "question_title": "Time Based Key-Value Store"
    },
    {
        "question_id": 1022,
        "question_title": "Unique Paths III"
    },
    {
        "question_id": 1021,
        "question_title": "Distribute Coins in Binary Tree"
    },
    {
        "question_id": 1020,
        "question_title": "Longest Turbulent Subarray"
    },
    {
        "question_id": 1019,
        "question_title": "Squares of a Sorted Array"
    },
    {
        "question_id": 1018,
        "question_title": "Largest Perimeter Triangle"
    },
    {
        "question_id": 1017,
        "question_title": "Odd Even Jump"
    },
    {
        "question_id": 1016,
        "question_title": "Subarray Sums Divisible by K"
    },
    {
        "question_id": 1014,
        "question_title": "K Closest Points to Origin"
    },
    {
        "question_id": 1013,
        "question_title": "Fibonacci Number"
    },
    {
        "question_id": 1012,
        "question_title": "Equal Rational Numbers"
    },
    {
        "question_id": 1011,
        "question_title": "Flip Binary Tree To Match Preorder Traversal"
    },
    {
        "question_id": 1010,
        "question_title": "Powerful Integers"
    },
    {
        "question_id": 1009,
        "question_title": "Pancake Sorting"
    },
    {
        "question_id": 1008,
        "question_title": "Binary Tree Cameras"
    },
    {
        "question_id": 1007,
        "question_title": "Numbers With Same Consecutive Differences"
    },
    {
        "question_id": 1006,
        "question_title": "Vowel Spellchecker"
    },
    {
        "question_id": 1005,
        "question_title": "Univalued Binary Tree"
    },
    {
        "question_id": 1004,
        "question_title": "Least Operators to Express Number"
    },
    {
        "question_id": 1003,
        "question_title": "Minimum Area Rectangle II"
    },
    {
        "question_id": 1002,
        "question_title": "Maximum Width Ramp"
    },
    {
        "question_id": 1001,
        "question_title": "N-Repeated Element in Size 2N Array"
    },
    {
        "question_id": 1000,
        "question_title": "Delete Columns to Make Sorted III"
    },
    {
        "question_id": 999,
        "question_title": "Regions Cut By Slashes"
    },
    {
        "question_id": 998,
        "question_title": "Check Completeness of a Binary Tree"
    },
    {
        "question_id": 994,
        "question_title": "Prison Cells After N Days"
    },
    {
        "question_id": 993,
        "question_title": "Tallest Billboard"
    },
    {
        "question_id": 992,
        "question_title": "Delete Columns to Make Sorted II"
    },
    {
        "question_id": 991,
        "question_title": "Array of Doubled Pairs"
    },
    {
        "question_id": 990,
        "question_title": "Verifying an Alien Dictionary"
    },
    {
        "question_id": 989,
        "question_title": "Largest Component Size by Common Factor"
    },
    {
        "question_id": 988,
        "question_title": "Flip Equivalent Binary Trees"
    },
    {
        "question_id": 987,
        "question_title": "Reveal Cards In Increasing Order"
    },
    {
        "question_id": 986,
        "question_title": "Largest Time for Given Digits"
    },
    {
        "question_id": 985,
        "question_title": "Bag of Tokens"
    },
    {
        "question_id": 984,
        "question_title": "Most Stones Removed with Same Row or Column"
    },
    {
        "question_id": 983,
        "question_title": "Validate Stack Sequences"
    },
    {
        "question_id": 982,
        "question_title": "Minimum Increment to Make Array Unique"
    },
    {
        "question_id": 981,
        "question_title": "Delete Columns to Make Sorted"
    },
    {
        "question_id": 980,
        "question_title": "Find the Shortest Superstring"
    },
    {
        "question_id": 979,
        "question_title": "DI String Match"
    },
    {
        "question_id": 978,
        "question_title": "Valid Mountain Array"
    },
    {
        "question_id": 977,
        "question_title": "Distinct Subsequences II"
    },
    {
        "question_id": 976,
        "question_title": "Minimum Area Rectangle"
    },
    {
        "question_id": 975,
        "question_title": "Range Sum of BST"
    },
    {
        "question_id": 974,
        "question_title": "Reorder Data in Log Files"
    },
    {
        "question_id": 973,
        "question_title": "Stamping The Sequence"
    },
    {
        "question_id": 972,
        "question_title": "Knight Dialer"
    },
    {
        "question_id": 971,
        "question_title": "Shortest Bridge"
    },
    {
        "question_id": 969,
        "question_title": "Number of Recent Calls"
    },
    {
        "question_id": 968,
        "question_title": "Beautiful Array"
    },
    {
        "question_id": 967,
        "question_title": "Minimum Falling Path Sum"
    },
    {
        "question_id": 966,
        "question_title": "Binary Subarrays With Sum"
    },
    {
        "question_id": 965,
        "question_title": "Unique Email Addresses"
    },
    {
        "question_id": 964,
        "question_title": "Minimize Malware Spread II"
    },
    {
        "question_id": 963,
        "question_title": "Three Equal Parts"
    },
    {
        "question_id": 962,
        "question_title": "Flip String to Monotone Increasing"
    },
    {
        "question_id": 961,
        "question_title": "Long Pressed Name"
    },
    {
        "question_id": 960,
        "question_title": "Minimize Malware Spread"
    },
    {
        "question_id": 959,
        "question_title": "3Sum With Multiplicity"
    },
    {
        "question_id": 958,
        "question_title": "Sort Array By Parity II"
    },
    {
        "question_id": 957,
        "question_title": "Minimum Add to Make Parentheses Valid"
    },
    {
        "question_id": 956,
        "question_title": "Number of Music Playlists"
    },
    {
        "question_id": 955,
        "question_title": "Complete Binary Tree Inserter"
    },
    {
        "question_id": 954,
        "question_title": "Maximum Sum Circular Subarray"
    },
    {
        "question_id": 953,
        "question_title": "Reverse Only Letters"
    },
    {
        "question_id": 952,
        "question_title": "Word Subsets"
    },
    {
        "question_id": 951,
        "question_title": "Partition Array into Disjoint Intervals"
    },
    {
        "question_id": 950,
        "question_title": "X of a Kind in a Deck of Cards"
    },
    {
        "question_id": 949,
        "question_title": "Cat and Mouse"
    },
    {
        "question_id": 948,
        "question_title": "Sort an Array"
    },
    {
        "question_id": 947,
        "question_title": "Online Election"
    },
    {
        "question_id": 946,
        "question_title": "Smallest Range II"
    },
    {
        "question_id": 945,
        "question_title": "Snakes and Ladders"
    },
    {
        "question_id": 944,
        "question_title": "Smallest Range I"
    },
    {
        "question_id": 943,
        "question_title": "Sum of Subarray Minimums"
    },
    {
        "question_id": 942,
        "question_title": "Super Palindromes"
    },
    {
        "question_id": 941,
        "question_title": "Sort Array By Parity"
    },
    {
        "question_id": 940,
        "question_title": "Fruit Into Baskets"
    },
    {
        "question_id": 939,
        "question_title": "Valid Permutations for DI Sequence"
    },
    {
        "question_id": 938,
        "question_title": "Numbers At Most N Given Digit Set"
    },
    {
        "question_id": 937,
        "question_title": "Online Stock Span"
    },
    {
        "question_id": 936,
        "question_title": "RLE Iterator"
    },
    {
        "question_id": 935,
        "question_title": "Orderly Queue"
    },
    {
        "question_id": 934,
        "question_title": "Bitwise ORs of Subarrays"
    },
    {
        "question_id": 933,
        "question_title": "Increasing Order Search Tree"
    },
    {
        "question_id": 932,
        "question_title": "Monotonic Array"
    },
    {
        "question_id": 931,
        "question_title": "Maximum Frequency Stack"
    },
    {
        "question_id": 930,
        "question_title": "All Possible Full Binary Trees"
    },
    {
        "question_id": 929,
        "question_title": "Groups of Special-Equivalent Strings"
    },
    {
        "question_id": 928,
        "question_title": "Surface Area of 3D Shapes"
    },
    {
        "question_id": 927,
        "question_title": "Sum of Subsequence Widths"
    },
    {
        "question_id": 926,
        "question_title": "Find and Replace Pattern"
    },
    {
        "question_id": 925,
        "question_title": "Construct Binary Tree from Preorder and Postorder Traversal"
    },
    {
        "question_id": 924,
        "question_title": "Fair Candy Swap"
    },
    {
        "question_id": 923,
        "question_title": "Super Egg Drop"
    },
    {
        "question_id": 922,
        "question_title": "Possible Bipartition"
    },
    {
        "question_id": 921,
        "question_title": "Spiral Matrix III"
    },
    {
        "question_id": 920,
        "question_title": "Uncommon Words from Two Sentences"
    },
    {
        "question_id": 919,
        "question_title": "Projection Area of 3D Shapes"
    },
    {
        "question_id": 918,
        "question_title": "Reachable Nodes In Subdivided Graph"
    },
    {
        "question_id": 917,
        "question_title": "Boats to Save People"
    },
    {
        "question_id": 916,
        "question_title": "Decoded String at Index"
    },
    {
        "question_id": 915,
        "question_title": "Generate Random Point in a Circle"
    },
    {
        "question_id": 914,
        "question_title": "Random Point in Non-overlapping Rectangles"
    },
    {
        "question_id": 913,
        "question_title": "Random Flip Matrix"
    },
    {
        "question_id": 912,
        "question_title": "Random Pick with Weight"
    },
    {
        "question_id": 911,
        "question_title": "Profitable Schemes"
    },
    {
        "question_id": 910,
        "question_title": "Nth Magical Number"
    },
    {
        "question_id": 909,
        "question_title": "Stone Game"
    },
    {
        "question_id": 908,
        "question_title": "Middle of the Linked List"
    },
    {
        "question_id": 907,
        "question_title": "Koko Eating Bananas"
    },
    {
        "question_id": 906,
        "question_title": "Walking Robot Simulation"
    },
    {
        "question_id": 905,
        "question_title": "Length of Longest Fibonacci Subsequence"
    },
    {
        "question_id": 904,
        "question_title": "Leaf-Similar Trees"
    },
    {
        "question_id": 903,
        "question_title": "Implement Rand10() Using Rand7()"
    },
    {
        "question_id": 902,
        "question_title": "Minimum Number of Refueling Stops"
    },
    {
        "question_id": 901,
        "question_title": "Advantage Shuffle"
    },
    {
        "question_id": 900,
        "question_title": "Reordered Power of 2"
    },
    {
        "question_id": 899,
        "question_title": "Binary Gap"
    },
    {
        "question_id": 898,
        "question_title": "Transpose Matrix"
    },
    {
        "question_id": 897,
        "question_title": "Prime Palindrome"
    },
    {
        "question_id": 896,
        "question_title": "Smallest Subtree with all the Deepest Nodes"
    },
    {
        "question_id": 895,
        "question_title": "Shortest Path to Get All Keys"
    },
    {
        "question_id": 894,
        "question_title": "Random Pick with Blacklist"
    },
    {
        "question_id": 893,
        "question_title": "All Nodes Distance K in Binary Tree"
    },
    {
        "question_id": 892,
        "question_title": "Shortest Subarray with Sum at Least K"
    },
    {
        "question_id": 891,
        "question_title": "Score After Flipping Matrix"
    },
    {
        "question_id": 890,
        "question_title": "Lemonade Change"
    },
    {
        "question_id": 889,
        "question_title": "Buddy Strings"
    },
    {
        "question_id": 888,
        "question_title": "Mirror Reflection"
    },
    {
        "question_id": 887,
        "question_title": "Minimum Cost to Hire K Workers"
    },
    {
        "question_id": 886,
        "question_title": "Score of Parentheses"
    },
    {
        "question_id": 885,
        "question_title": "Exam Room"
    },
    {
        "question_id": 884,
        "question_title": "K-Similar Strings"
    },
    {
        "question_id": 883,
        "question_title": "Car Fleet"
    },
    {
        "question_id": 882,
        "question_title": "Peak Index in a Mountain Array"
    },
    {
        "question_id": 881,
        "question_title": "Loud and Rich"
    },
    {
        "question_id": 880,
        "question_title": "Rectangle Area II"
    },
    {
        "question_id": 879,
        "question_title": "Maximize Distance to Closest Person"
    },
    {
        "question_id": 878,
        "question_title": "Shifting Letters"
    },
    {
        "question_id": 877,
        "question_title": "Shortest Path Visiting All Nodes"
    },
    {
        "question_id": 876,
        "question_title": "Hand of Straights"
    },
    {
        "question_id": 875,
        "question_title": "Longest Mountain in Array"
    },
    {
        "question_id": 874,
        "question_title": "Backspace String Compare"
    },
    {
        "question_id": 873,
        "question_title": "Guess the Word"
    },
    {
        "question_id": 872,
        "question_title": "Split Array into Fibonacci Sequence"
    },
    {
        "question_id": 871,
        "question_title": "Keys and Rooms"
    },
    {
        "question_id": 870,
        "question_title": "Magic Squares In Grid"
    },
    {
        "question_id": 869,
        "question_title": "Similar String Groups"
    },
    {
        "question_id": 868,
        "question_title": "Push Dominoes"
    },
    {
        "question_id": 867,
        "question_title": "New 21 Game"
    },
    {
        "question_id": 866,
        "question_title": "Rectangle Overlap"
    },
    {
        "question_id": 865,
        "question_title": "Robot Room Cleaner"
    },
    {
        "question_id": 864,
        "question_title": "Image Overlap"
    },
    {
        "question_id": 863,
        "question_title": "Sum of Distances in Tree"
    },
    {
        "question_id": 862,
        "question_title": "Find And Replace in String"
    },
    {
        "question_id": 861,
        "question_title": "Flipping an Image"
    },
    {
        "question_id": 860,
        "question_title": "Design Circular Queue"
    },
    {
        "question_id": 859,
        "question_title": "Design Circular Deque"
    },
    {
        "question_id": 858,
        "question_title": "Masking Personal Information"
    },
    {
        "question_id": 857,
        "question_title": "Positions of Large Groups"
    },
    {
        "question_id": 856,
        "question_title": "Consecutive Numbers Sum"
    },
    {
        "question_id": 855,
        "question_title": "Count Unique Characters of All Substrings of a Given String"
    },
    {
        "question_id": 854,
        "question_title": "Making A Large Island"
    },
    {
        "question_id": 853,
        "question_title": "Most Profit Assigning Work"
    },
    {
        "question_id": 852,
        "question_title": "Friends Of Appropriate Ages"
    },
    {
        "question_id": 851,
        "question_title": "Goat Latin"
    },
    {
        "question_id": 850,
        "question_title": "Insert into a Sorted Circular Linked List"
    },
    {
        "question_id": 843,
        "question_title": "Binary Trees With Factors"
    },
    {
        "question_id": 842,
        "question_title": "Card Flipping Game"
    },
    {
        "question_id": 841,
        "question_title": "Shortest Distance to a Character"
    },
    {
        "question_id": 839,
        "question_title": "Short Encoding of Words"
    },
    {
        "question_id": 838,
        "question_title": "Design Linked List"
    },
    {
        "question_id": 837,
        "question_title": "Most Common Word"
    },
    {
        "question_id": 836,
        "question_title": "Race Car"
    },
    {
        "question_id": 835,
        "question_title": "Linked List Components"
    },
    {
        "question_id": 834,
        "question_title": "Ambiguous Coordinates"
    },
    {
        "question_id": 833,
        "question_title": "Bus Routes"
    },
    {
        "question_id": 832,
        "question_title": "Binary Tree Pruning"
    },
    {
        "question_id": 831,
        "question_title": "Largest Sum of Averages"
    },
    {
        "question_id": 830,
        "question_title": "Largest Triangle Area"
    },
    {
        "question_id": 829,
        "question_title": "Subdomain Visit Count"
    },
    {
        "question_id": 828,
        "question_title": "Chalkboard XOR Game"
    },
    {
        "question_id": 827,
        "question_title": "Expressive Words"
    },
    {
        "question_id": 826,
        "question_title": "Soup Servings"
    },
    {
        "question_id": 825,
        "question_title": "Max Increase to Keep City Skyline"
    },
    {
        "question_id": 824,
        "question_title": "Number of Lines To Write String"
    },
    {
        "question_id": 823,
        "question_title": "Split Array With Same Average"
    },
    {
        "question_id": 822,
        "question_title": "Unique Morse Code Words"
    },
    {
        "question_id": 821,
        "question_title": "Bricks Falling When Hit"
    },
    {
        "question_id": 820,
        "question_title": "Find Eventual Safe States"
    },
    {
        "question_id": 819,
        "question_title": "Minimum Swaps To Make Sequences Increasing"
    },
    {
        "question_id": 818,
        "question_title": "Similar RGB Color"
    },
    {
        "question_id": 817,
        "question_title": "Design HashMap"
    },
    {
        "question_id": 816,
        "question_title": "Design HashSet"
    },
    {
        "question_id": 815,
        "question_title": "Champagne Tower"
    },
    {
        "question_id": 814,
        "question_title": "Smallest Rotation with Highest Score"
    },
    {
        "question_id": 813,
        "question_title": "All Paths From Source to Target"
    },
    {
        "question_id": 812,
        "question_title": "Rotate String"
    },
    {
        "question_id": 811,
        "question_title": "Number of Subarrays with Bounded Maximum"
    },
    {
        "question_id": 810,
        "question_title": "Valid Tic-Tac-Toe State"
    },
    {
        "question_id": 809,
        "question_title": "Preimage Size of Factorial Zeroes Function"
    },
    {
        "question_id": 808,
        "question_title": "Number of Matching Subsequences"
    },
    {
        "question_id": 807,
        "question_title": "Custom Sort String"
    },
    {
        "question_id": 806,
        "question_title": "Domino and Tromino Tiling"
    },
    {
        "question_id": 805,
        "question_title": "Escape The Ghosts"
    },
    {
        "question_id": 804,
        "question_title": "Rotated Digits"
    },
    {
        "question_id": 803,
        "question_title": "Cheapest Flights Within K Stops"
    },
    {
        "question_id": 802,
        "question_title": "K-th Smallest Prime Fraction"
    },
    {
        "question_id": 801,
        "question_title": "Is Graph Bipartite?"
    },
    {
        "question_id": 800,
        "question_title": "Letter Case Permutation"
    },
    {
        "question_id": 799,
        "question_title": "Minimum Distance Between BST Nodes"
    },
    {
        "question_id": 798,
        "question_title": "Transform to Chessboard"
    },
    {
        "question_id": 797,
        "question_title": "Rabbits in Forest"
    },
    {
        "question_id": 796,
        "question_title": "Reaching Points"
    },
    {
        "question_id": 795,
        "question_title": "K-th Symbol in Grammar"
    },
    {
        "question_id": 794,
        "question_title": "Swim in Rising Water"
    },
    {
        "question_id": 793,
        "question_title": "Swap Adjacent in LR String"
    },
    {
        "question_id": 792,
        "question_title": "Binary Search"
    },
    {
        "question_id": 791,
        "question_title": "Split BST"
    },
    {
        "question_id": 790,
        "question_title": "Global and Local Inversions"
    },
    {
        "question_id": 789,
        "question_title": "Kth Largest Element in a Stream"
    },
    {
        "question_id": 788,
        "question_title": "Minimize Max Distance to Gas Station"
    },
    {
        "question_id": 787,
        "question_title": "Sliding Puzzle"
    },
    {
        "question_id": 786,
        "question_title": "Search in a Sorted Array of Unknown Size"
    },
    {
        "question_id": 785,
        "question_title": "Basic Calculator III"
    },
    {
        "question_id": 784,
        "question_title": "Insert into a Binary Search Tree"
    },
    {
        "question_id": 783,
        "question_title": "Search in a Binary Search Tree"
    },
    {
        "question_id": 782,
        "question_title": "Jewels and Stones"
    },
    {
        "question_id": 781,
        "question_title": "Basic Calculator IV"
    },
    {
        "question_id": 780,
        "question_title": "Max Chunks To Make Sorted"
    },
    {
        "question_id": 779,
        "question_title": "Max Chunks To Make Sorted II"
    },
    {
        "question_id": 778,
        "question_title": "Reorganize String"
    },
    {
        "question_id": 777,
        "question_title": "Toeplitz Matrix"
    },
    {
        "question_id": 776,
        "question_title": "N-ary Tree Postorder Traversal"
    },
    {
        "question_id": 775,
        "question_title": "N-ary Tree Preorder Traversal"
    },
    {
        "question_id": 774,
        "question_title": "Maximum Depth of N-ary Tree"
    },
    {
        "question_id": 773,
        "question_title": "Logical OR of Two Binary Grids Represented as Quad-Trees"
    },
    {
        "question_id": 772,
        "question_title": "Construct Quad Tree"
    },
    {
        "question_id": 771,
        "question_title": "Encode N-ary Tree to Binary Tree"
    },
    {
        "question_id": 770,
        "question_title": "Couples Holding Hands"
    },
    {
        "question_id": 769,
        "question_title": "Largest Plus Sign"
    },
    {
        "question_id": 768,
        "question_title": "Partition Labels"
    },
    {
        "question_id": 767,
        "question_title": "Prime Number of Set Bits in Binary Representation"
    },
    {
        "question_id": 766,
        "question_title": "Flatten a Multilevel Doubly Linked List"
    },
    {
        "question_id": 765,
        "question_title": "Serialize and Deserialize N-ary Tree"
    },
    {
        "question_id": 764,
        "question_title": "N-ary Tree Level Order Traversal"
    },
    {
        "question_id": 763,
        "question_title": "Special Binary String"
    },
    {
        "question_id": 762,
        "question_title": "Find Anagram Mappings"
    },
    {
        "question_id": 761,
        "question_title": "Employee Free Time"
    },
    {
        "question_id": 760,
        "question_title": "Bold Words in String"
    },
    {
        "question_id": 759,
        "question_title": "Set Intersection Size At Least Two"
    },
    {
        "question_id": 758,
        "question_title": "Convert Binary Search Tree to Sorted Doubly Linked List"
    },
    {
        "question_id": 757,
        "question_title": "Pyramid Transition Matrix"
    },
    {
        "question_id": 756,
        "question_title": "Pour Water"
    },
    {
        "question_id": 755,
        "question_title": "Reach a Number"
    },
    {
        "question_id": 754,
        "question_title": "Cracking the Safe"
    },
    {
        "question_id": 753,
        "question_title": "Open the Lock"
    },
    {
        "question_id": 752,
        "question_title": "IP to CIDR"
    },
    {
        "question_id": 751,
        "question_title": "Number Of Corner Rectangles"
    },
    {
        "question_id": 750,
        "question_title": "Contain Virus"
    },
    {
        "question_id": 749,
        "question_title": "Shortest Completing Word"
    },
    {
        "question_id": 748,
        "question_title": "Largest Number At Least Twice of Others"
    },
    {
        "question_id": 747,
        "question_title": "Min Cost Climbing Stairs"
    },
    {
        "question_id": 746,
        "question_title": "Prefix and Suffix Search"
    },
    {
        "question_id": 745,
        "question_title": "Find Smallest Letter Greater Than Target"
    },
    {
        "question_id": 744,
        "question_title": "Network Delay Time"
    },
    {
        "question_id": 743,
        "question_title": "Closest Leaf in a Binary Tree"
    },
    {
        "question_id": 742,
        "question_title": "To Lower Case"
    },
    {
        "question_id": 741,
        "question_title": "Cherry Pickup"
    },
    {
        "question_id": 740,
        "question_title": "Delete and Earn"
    },
    {
        "question_id": 739,
        "question_title": "Daily Temperatures"
    },
    {
        "question_id": 738,
        "question_title": "Monotone Increasing Digits"
    },
    {
        "question_id": 737,
        "question_title": "Sentence Similarity II"
    },
    {
        "question_id": 736,
        "question_title": "Parse Lisp Expression"
    },
    {
        "question_id": 735,
        "question_title": "Asteroid Collision"
    },
    {
        "question_id": 734,
        "question_title": "Sentence Similarity"
    },
    {
        "question_id": 733,
        "question_title": "Flood Fill"
    },
    {
        "question_id": 732,
        "question_title": "My Calendar III"
    },
    {
        "question_id": 731,
        "question_title": "My Calendar II"
    },
    {
        "question_id": 730,
        "question_title": "Count Different Palindromic Subsequences"
    },
    {
        "question_id": 729,
        "question_title": "My Calendar I"
    },
    {
        "question_id": 728,
        "question_title": "Self Dividing Numbers"
    },
    {
        "question_id": 727,
        "question_title": "Minimum Window Subsequence"
    },
    {
        "question_id": 726,
        "question_title": "Number of Atoms"
    },
    {
        "question_id": 725,
        "question_title": "Split Linked List in Parts"
    },
    {
        "question_id": 724,
        "question_title": "Find Pivot Index"
    },
    {
        "question_id": 723,
        "question_title": "Candy Crush"
    },
    {
        "question_id": 722,
        "question_title": "Remove Comments"
    },
    {
        "question_id": 721,
        "question_title": "Accounts Merge"
    },
    {
        "question_id": 720,
        "question_title": "Longest Word in Dictionary"
    },
    {
        "question_id": 719,
        "question_title": "Find K-th Smallest Pair Distance"
    },
    {
        "question_id": 718,
        "question_title": "Maximum Length of Repeated Subarray"
    },
    {
        "question_id": 717,
        "question_title": "1-bit and 2-bit Characters"
    },
    {
        "question_id": 716,
        "question_title": "Max Stack"
    },
    {
        "question_id": 715,
        "question_title": "Range Module"
    },
    {
        "question_id": 714,
        "question_title": "Best Time to Buy and Sell Stock with Transaction Fee"
    },
    {
        "question_id": 713,
        "question_title": "Subarray Product Less Than K"
    },
    {
        "question_id": 712,
        "question_title": "Minimum ASCII Delete Sum for Two Strings"
    },
    {
        "question_id": 711,
        "question_title": "Number of Distinct Islands II"
    },
    {
        "question_id": 699,
        "question_title": "Falling Squares"
    },
    {
        "question_id": 698,
        "question_title": "Partition to K Equal Sum Subsets"
    },
    {
        "question_id": 697,
        "question_title": "Degree of an Array"
    },
    {
        "question_id": 696,
        "question_title": "Count Binary Substrings"
    },
    {
        "question_id": 695,
        "question_title": "Max Area of Island"
    },
    {
        "question_id": 694,
        "question_title": "Number of Distinct Islands"
    },
    {
        "question_id": 693,
        "question_title": "Binary Number with Alternating Bits"
    },
    {
        "question_id": 692,
        "question_title": "Top K Frequent Words"
    },
    {
        "question_id": 691,
        "question_title": "Stickers to Spell Word"
    },
    {
        "question_id": 690,
        "question_title": "Employee Importance"
    },
    {
        "question_id": 689,
        "question_title": "Maximum Sum of 3 Non-Overlapping Subarrays"
    },
    {
        "question_id": 688,
        "question_title": "Knight Probability in Chessboard"
    },
    {
        "question_id": 687,
        "question_title": "Longest Univalue Path"
    },
    {
        "question_id": 686,
        "question_title": "Repeated String Match"
    },
    {
        "question_id": 685,
        "question_title": "Redundant Connection II"
    },
    {
        "question_id": 684,
        "question_title": "Redundant Connection"
    },
    {
        "question_id": 683,
        "question_title": "K Empty Slots"
    },
    {
        "question_id": 682,
        "question_title": "Baseball Game"
    },
    {
        "question_id": 681,
        "question_title": "Next Closest Time"
    },
    {
        "question_id": 680,
        "question_title": "Valid Palindrome II"
    },
    {
        "question_id": 679,
        "question_title": "24 Game"
    },
    {
        "question_id": 678,
        "question_title": "Valid Parenthesis String"
    },
    {
        "question_id": 677,
        "question_title": "Map Sum Pairs"
    },
    {
        "question_id": 676,
        "question_title": "Implement Magic Dictionary"
    },
    {
        "question_id": 675,
        "question_title": "Cut Off Trees for Golf Event"
    },
    {
        "question_id": 674,
        "question_title": "Longest Continuous Increasing Subsequence"
    },
    {
        "question_id": 673,
        "question_title": "Number of Longest Increasing Subsequence"
    },
    {
        "question_id": 672,
        "question_title": "Bulb Switcher II"
    },
    {
        "question_id": 671,
        "question_title": "Second Minimum Node In a Binary Tree"
    },
    {
        "question_id": 670,
        "question_title": "Maximum Swap"
    },
    {
        "question_id": 669,
        "question_title": "Trim a Binary Search Tree"
    },
    {
        "question_id": 668,
        "question_title": "Kth Smallest Number in Multiplication Table"
    },
    {
        "question_id": 667,
        "question_title": "Beautiful Arrangement II"
    },
    {
        "question_id": 666,
        "question_title": "Path Sum IV"
    },
    {
        "question_id": 665,
        "question_title": "Non-decreasing Array"
    },
    {
        "question_id": 664,
        "question_title": "Strange Printer"
    },
    {
        "question_id": 663,
        "question_title": "Equal Tree Partition"
    },
    {
        "question_id": 662,
        "question_title": "Maximum Width of Binary Tree"
    },
    {
        "question_id": 661,
        "question_title": "Image Smoother"
    },
    {
        "question_id": 660,
        "question_title": "Remove 9"
    },
    {
        "question_id": 659,
        "question_title": "Split Array into Consecutive Subsequences"
    },
    {
        "question_id": 658,
        "question_title": "Find K Closest Elements"
    },
    {
        "question_id": 657,
        "question_title": "Robot Return to Origin"
    },
    {
        "question_id": 656,
        "question_title": "Coin Path"
    },
    {
        "question_id": 655,
        "question_title": "Print Binary Tree"
    },
    {
        "question_id": 654,
        "question_title": "Maximum Binary Tree"
    },
    {
        "question_id": 653,
        "question_title": "Two Sum IV - Input is a BST"
    },
    {
        "question_id": 652,
        "question_title": "Find Duplicate Subtrees"
    },
    {
        "question_id": 651,
        "question_title": "4 Keys Keyboard"
    },
    {
        "question_id": 650,
        "question_title": "2 Keys Keyboard"
    },
    {
        "question_id": 649,
        "question_title": "Dota2 Senate"
    },
    {
        "question_id": 648,
        "question_title": "Replace Words"
    },
    {
        "question_id": 647,
        "question_title": "Palindromic Substrings"
    },
    {
        "question_id": 646,
        "question_title": "Maximum Length of Pair Chain"
    },
    {
        "question_id": 645,
        "question_title": "Set Mismatch"
    },
    {
        "question_id": 644,
        "question_title": "Maximum Average Subarray II"
    },
    {
        "question_id": 643,
        "question_title": "Maximum Average Subarray I"
    },
    {
        "question_id": 642,
        "question_title": "Design Search Autocomplete System"
    },
    {
        "question_id": 640,
        "question_title": "Solve the Equation"
    },
    {
        "question_id": 639,
        "question_title": "Decode Ways II"
    },
    {
        "question_id": 638,
        "question_title": "Shopping Offers"
    },
    {
        "question_id": 637,
        "question_title": "Average of Levels in Binary Tree"
    },
    {
        "question_id": 636,
        "question_title": "Exclusive Time of Functions"
    },
    {
        "question_id": 635,
        "question_title": "Design Log Storage System"
    },
    {
        "question_id": 634,
        "question_title": "Find the Derangement of An Array"
    },
    {
        "question_id": 633,
        "question_title": "Sum of Square Numbers"
    },
    {
        "question_id": 632,
        "question_title": "Smallest Range Covering Elements from K Lists"
    },
    {
        "question_id": 631,
        "question_title": "Design Excel Sum Formula"
    },
    {
        "question_id": 630,
        "question_title": "Course Schedule III"
    },
    {
        "question_id": 629,
        "question_title": "K Inverse Pairs Array"
    },
    {
        "question_id": 628,
        "question_title": "Maximum Product of Three Numbers"
    },
    {
        "question_id": 625,
        "question_title": "Minimum Factorization"
    },
    {
        "question_id": 624,
        "question_title": "Maximum Distance in Arrays"
    },
    {
        "question_id": 623,
        "question_title": "Add One Row to Tree"
    },
    {
        "question_id": 621,
        "question_title": "Task Scheduler"
    },
    {
        "question_id": 617,
        "question_title": "Merge Two Binary Trees"
    },
    {
        "question_id": 616,
        "question_title": "Add Bold Tag in String"
    },
    {
        "question_id": 611,
        "question_title": "Valid Triangle Number"
    },
    {
        "question_id": 609,
        "question_title": "Find Duplicate File in System"
    },
    {
        "question_id": 606,
        "question_title": "Construct String from Binary Tree"
    },
    {
        "question_id": 605,
        "question_title": "Can Place Flowers"
    },
    {
        "question_id": 604,
        "question_title": "Design Compressed String Iterator"
    },
    {
        "question_id": 600,
        "question_title": "Non-negative Integers without Consecutive Ones"
    },
    {
        "question_id": 599,
        "question_title": "Minimum Index Sum of Two Lists"
    },
    {
        "question_id": 598,
        "question_title": "Range Addition II"
    },
    {
        "question_id": 594,
        "question_title": "Longest Harmonious Subsequence"
    },
    {
        "question_id": 593,
        "question_title": "Valid Square"
    },
    {
        "question_id": 592,
        "question_title": "Fraction Addition and Subtraction"
    },
    {
        "question_id": 591,
        "question_title": "Tag Validator"
    },
    {
        "question_id": 588,
        "question_title": "Design In-Memory File System"
    },
    {
        "question_id": 587,
        "question_title": "Erect the Fence"
    },
    {
        "question_id": 583,
        "question_title": "Delete Operation for Two Strings"
    },
    {
        "question_id": 582,
        "question_title": "Kill Process"
    },
    {
        "question_id": 581,
        "question_title": "Shortest Unsorted Continuous Subarray"
    },
    {
        "question_id": 576,
        "question_title": "Out of Boundary Paths"
    },
    {
        "question_id": 575,
        "question_title": "Distribute Candies"
    },
    {
        "question_id": 573,
        "question_title": "Squirrel Simulation"
    },
    {
        "question_id": 572,
        "question_title": "Subtree of Another Tree"
    },
    {
        "question_id": 568,
        "question_title": "Maximum Vacation Days"
    },
    {
        "question_id": 567,
        "question_title": "Permutation in String"
    },
    {
        "question_id": 566,
        "question_title": "Reshape the Matrix"
    },
    {
        "question_id": 565,
        "question_title": "Array Nesting"
    },
    {
        "question_id": 564,
        "question_title": "Find the Closest Palindrome"
    },
    {
        "question_id": 563,
        "question_title": "Binary Tree Tilt"
    },
    {
        "question_id": 562,
        "question_title": "Longest Line of Consecutive One in Matrix"
    },
    {
        "question_id": 561,
        "question_title": "Array Partition"
    },
    {
        "question_id": 560,
        "question_title": "Subarray Sum Equals K"
    },
    {
        "question_id": 557,
        "question_title": "Reverse Words in a String III"
    },
    {
        "question_id": 556,
        "question_title": "Next Greater Element III"
    },
    {
        "question_id": 555,
        "question_title": "Split Concatenated Strings"
    },
    {
        "question_id": 554,
        "question_title": "Brick Wall"
    },
    {
        "question_id": 553,
        "question_title": "Optimal Division"
    },
    {
        "question_id": 552,
        "question_title": "Student Attendance Record II"
    },
    {
        "question_id": 551,
        "question_title": "Student Attendance Record I"
    },
    {
        "question_id": 550,
        "question_title": "Shortest Path to Get Food"
    },
    {
        "question_id": 549,
        "question_title": "Binary Tree Longest Consecutive Sequence II"
    },
    {
        "question_id": 548,
        "question_title": "Split Array with Equal Sum"
    },
    {
        "question_id": 547,
        "question_title": "Number of Provinces"
    },
    {
        "question_id": 546,
        "question_title": "Remove Boxes"
    },
    {
        "question_id": 545,
        "question_title": "Boundary of Binary Tree"
    },
    {
        "question_id": 544,
        "question_title": "Output Contest Matches"
    },
    {
        "question_id": 543,
        "question_title": "Diameter of Binary Tree"
    },
    {
        "question_id": 542,
        "question_title": "01 Matrix"
    },
    {
        "question_id": 541,
        "question_title": "Reverse String II"
    },
    {
        "question_id": 540,
        "question_title": "Single Element in a Sorted Array"
    },
    {
        "question_id": 539,
        "question_title": "Minimum Time Difference"
    },
    {
        "question_id": 538,
        "question_title": "Convert BST to Greater Tree"
    },
    {
        "question_id": 537,
        "question_title": "Complex Number Multiplication"
    },
    {
        "question_id": 536,
        "question_title": "Construct Binary Tree from String"
    },
    {
        "question_id": 535,
        "question_title": "Encode and Decode TinyURL"
    },
    {
        "question_id": 533,
        "question_title": "Lonely Pixel II"
    },
    {
        "question_id": 532,
        "question_title": "K-diff Pairs in an Array"
    },
    {
        "question_id": 531,
        "question_title": "Lonely Pixel I"
    },
    {
        "question_id": 530,
        "question_title": "Minimum Absolute Difference in BST"
    },
    {
        "question_id": 529,
        "question_title": "Minesweeper"
    },
    {
        "question_id": 528,
        "question_title": "Swapping Nodes in a Linked List"
    },
    {
        "question_id": 527,
        "question_title": "Word Abbreviation"
    },
    {
        "question_id": 526,
        "question_title": "Beautiful Arrangement"
    },
    {
        "question_id": 525,
        "question_title": "Contiguous Array"
    },
    {
        "question_id": 524,
        "question_title": "Longest Word in Dictionary through Deleting"
    },
    {
        "question_id": 523,
        "question_title": "Continuous Subarray Sum"
    },
    {
        "question_id": 522,
        "question_title": "Longest Uncommon Subsequence II"
    },
    {
        "question_id": 521,
        "question_title": "Longest Uncommon Subsequence I"
    },
    {
        "question_id": 520,
        "question_title": "Detect Capital"
    },
    {
        "question_id": 519,
        "question_title": "Widest Pair of Indices With Equal Range Sum"
    },
    {
        "question_id": 518,
        "question_title": "Coin Change II"
    },
    {
        "question_id": 517,
        "question_title": "Super Washing Machines"
    },
    {
        "question_id": 516,
        "question_title": "Longest Palindromic Subsequence"
    },
    {
        "question_id": 515,
        "question_title": "Find Largest Value in Each Tree Row"
    },
    {
        "question_id": 514,
        "question_title": "Freedom Trail"
    },
    {
        "question_id": 513,
        "question_title": "Find Bottom Left Tree Value"
    },
    {
        "question_id": 512,
        "question_title": "Maximum Alternating Subarray Sum"
    },
    {
        "question_id": 511,
        "question_title": "All Paths from Source Lead to Destination"
    },
    {
        "question_id": 510,
        "question_title": "Count Subarrays With More Ones Than Zeros"
    },
    {
        "question_id": 509,
        "question_title": "Inorder Successor in BST II"
    },
    {
        "question_id": 508,
        "question_title": "Most Frequent Subtree Sum"
    },
    {
        "question_id": 507,
        "question_title": "Perfect Number"
    },
    {
        "question_id": 506,
        "question_title": "Relative Ranks"
    },
    {
        "question_id": 505,
        "question_title": "The Maze II"
    },
    {
        "question_id": 504,
        "question_title": "Base 7"
    },
    {
        "question_id": 503,
        "question_title": "Next Greater Element II"
    },
    {
        "question_id": 502,
        "question_title": "IPO"
    },
    {
        "question_id": 501,
        "question_title": "Find Mode in Binary Search Tree"
    },
    {
        "question_id": 500,
        "question_title": "Keyboard Row"
    },
    {
        "question_id": 499,
        "question_title": "The Maze III"
    },
    {
        "question_id": 498,
        "question_title": "Diagonal Traverse"
    },
    {
        "question_id": 496,
        "question_title": "Next Greater Element I"
    },
    {
        "question_id": 495,
        "question_title": "Teemo Attacking"
    },
    {
        "question_id": 494,
        "question_title": "Target Sum"
    },
    {
        "question_id": 493,
        "question_title": "Reverse Pairs"
    },
    {
        "question_id": 492,
        "question_title": "Construct the Rectangle"
    },
    {
        "question_id": 491,
        "question_title": "Non-decreasing Subsequences"
    },
    {
        "question_id": 490,
        "question_title": "The Maze"
    },
    {
        "question_id": 489,
        "question_title": "Kth Smallest Instructions"
    },
    {
        "question_id": 488,
        "question_title": "Zuma Game"
    },
    {
        "question_id": 487,
        "question_title": "Max Consecutive Ones II"
    },
    {
        "question_id": 486,
        "question_title": "Predict the Winner"
    },
    {
        "question_id": 485,
        "question_title": "Max Consecutive Ones"
    },
    {
        "question_id": 484,
        "question_title": "Find Permutation"
    },
    {
        "question_id": 483,
        "question_title": "Smallest Good Base"
    },
    {
        "question_id": 482,
        "question_title": "License Key Formatting"
    },
    {
        "question_id": 481,
        "question_title": "Magical String"
    },
    {
        "question_id": 480,
        "question_title": "Sliding Window Median"
    },
    {
        "question_id": 479,
        "question_title": "Largest Palindrome Product"
    },
    {
        "question_id": 477,
        "question_title": "Total Hamming Distance"
    },
    {
        "question_id": 476,
        "question_title": "Number Complement"
    },
    {
        "question_id": 475,
        "question_title": "Heaters"
    },
    {
        "question_id": 474,
        "question_title": "Ones and Zeroes"
    },
    {
        "question_id": 473,
        "question_title": "Matchsticks to Square"
    },
    {
        "question_id": 472,
        "question_title": "Concatenated Words"
    },
    {
        "question_id": 471,
        "question_title": "Encode String with Shortest Length"
    },
    {
        "question_id": 469,
        "question_title": "Convex Polygon"
    },
    {
        "question_id": 468,
        "question_title": "Validate IP Address"
    },
    {
        "question_id": 467,
        "question_title": "Unique Substrings in Wraparound String"
    },
    {
        "question_id": 466,
        "question_title": "Count The Repetitions"
    },
    {
        "question_id": 465,
        "question_title": "Optimal Account Balancing"
    },
    {
        "question_id": 464,
        "question_title": "Can I Win"
    },
    {
        "question_id": 463,
        "question_title": "Island Perimeter"
    },
    {
        "question_id": 462,
        "question_title": "Minimum Moves to Equal Array Elements II"
    },
    {
        "question_id": 461,
        "question_title": "Hamming Distance"
    },
    {
        "question_id": 460,
        "question_title": "LFU Cache"
    },
    {
        "question_id": 459,
        "question_title": "Repeated Substring Pattern"
    },
    {
        "question_id": 458,
        "question_title": "Poor Pigs"
    },
    {
        "question_id": 457,
        "question_title": "Circular Array Loop"
    },
    {
        "question_id": 456,
        "question_title": "132 Pattern"
    },
    {
        "question_id": 455,
        "question_title": "Assign Cookies"
    },
    {
        "question_id": 454,
        "question_title": "4Sum II"
    },
    {
        "question_id": 453,
        "question_title": "Minimum Moves to Equal Array Elements"
    },
    {
        "question_id": 452,
        "question_title": "Minimum Number of Arrows to Burst Balloons"
    },
    {
        "question_id": 451,
        "question_title": "Sort Characters By Frequency"
    },
    {
        "question_id": 450,
        "question_title": "Delete Node in a BST"
    },
    {
        "question_id": 449,
        "question_title": "Serialize and Deserialize BST"
    },
    {
        "question_id": 448,
        "question_title": "Find All Numbers Disappeared in an Array"
    },
    {
        "question_id": 447,
        "question_title": "Number of Boomerangs"
    },
    {
        "question_id": 446,
        "question_title": "Arithmetic Slices II - Subsequence"
    },
    {
        "question_id": 445,
        "question_title": "Add Two Numbers II"
    },
    {
        "question_id": 444,
        "question_title": "Sequence Reconstruction"
    },
    {
        "question_id": 443,
        "question_title": "String Compression"
    },
    {
        "question_id": 442,
        "question_title": "Find All Duplicates in an Array"
    },
    {
        "question_id": 441,
        "question_title": "Arranging Coins"
    },
    {
        "question_id": 440,
        "question_title": "K-th Smallest in Lexicographical Order"
    },
    {
        "question_id": 439,
        "question_title": "Ternary Expression Parser"
    },
    {
        "question_id": 438,
        "question_title": "Find All Anagrams in a String"
    },
    {
        "question_id": 437,
        "question_title": "Path Sum III"
    },
    {
        "question_id": 436,
        "question_title": "Find Right Interval"
    },
    {
        "question_id": 435,
        "question_title": "Non-overlapping Intervals"
    },
    {
        "question_id": 434,
        "question_title": "Number of Segments in a String"
    },
    {
        "question_id": 433,
        "question_title": "Minimum Genetic Mutation"
    },
    {
        "question_id": 432,
        "question_title": "All O`one Data Structure"
    },
    {
        "question_id": 425,
        "question_title": "Word Squares"
    },
    {
        "question_id": 424,
        "question_title": "Longest Repeating Character Replacement"
    },
    {
        "question_id": 423,
        "question_title": "Reconstruct Original Digits from English"
    },
    {
        "question_id": 422,
        "question_title": "Valid Word Square"
    },
    {
        "question_id": 421,
        "question_title": "Maximum XOR of Two Numbers in an Array"
    },
    {
        "question_id": 420,
        "question_title": "Strong Password Checker"
    },
    {
        "question_id": 419,
        "question_title": "Battleships in a Board"
    },
    {
        "question_id": 418,
        "question_title": "Sentence Screen Fitting"
    },
    {
        "question_id": 417,
        "question_title": "Pacific Atlantic Water Flow"
    },
    {
        "question_id": 416,
        "question_title": "Partition Equal Subset Sum"
    },
    {
        "question_id": 415,
        "question_title": "Add Strings"
    },
    {
        "question_id": 414,
        "question_title": "Third Maximum Number"
    },
    {
        "question_id": 413,
        "question_title": "Arithmetic Slices"
    },
    {
        "question_id": 412,
        "question_title": "Fizz Buzz"
    },
    {
        "question_id": 411,
        "question_title": "Minimum Unique Word Abbreviation"
    },
    {
        "question_id": 410,
        "question_title": "Split Array Largest Sum"
    },
    {
        "question_id": 409,
        "question_title": "Longest Palindrome"
    },
    {
        "question_id": 408,
        "question_title": "Valid Word Abbreviation"
    },
    {
        "question_id": 407,
        "question_title": "Trapping Rain Water II"
    },
    {
        "question_id": 406,
        "question_title": "Queue Reconstruction by Height"
    },
    {
        "question_id": 405,
        "question_title": "Convert a Number to Hexadecimal"
    },
    {
        "question_id": 404,
        "question_title": "Sum of Left Leaves"
    },
    {
        "question_id": 403,
        "question_title": "Frog Jump"
    },
    {
        "question_id": 402,
        "question_title": "Remove K Digits"
    },
    {
        "question_id": 401,
        "question_title": "Binary Watch"
    },
    {
        "question_id": 400,
        "question_title": "Nth Digit"
    },
    {
        "question_id": 399,
        "question_title": "Evaluate Division"
    },
    {
        "question_id": 398,
        "question_title": "Random Pick Index"
    },
    {
        "question_id": 397,
        "question_title": "Integer Replacement"
    },
    {
        "question_id": 396,
        "question_title": "Rotate Function"
    },
    {
        "question_id": 395,
        "question_title": "Longest Substring with At Least K Repeating Characters"
    },
    {
        "question_id": 394,
        "question_title": "Decode String"
    },
    {
        "question_id": 393,
        "question_title": "UTF-8 Validation"
    },
    {
        "question_id": 392,
        "question_title": "Is Subsequence"
    },
    {
        "question_id": 391,
        "question_title": "Perfect Rectangle"
    },
    {
        "question_id": 390,
        "question_title": "Elimination Game"
    },
    {
        "question_id": 389,
        "question_title": "Find the Difference"
    },
    {
        "question_id": 388,
        "question_title": "Longest Absolute File Path"
    },
    {
        "question_id": 387,
        "question_title": "First Unique Character in a String"
    },
    {
        "question_id": 386,
        "question_title": "Lexicographical Numbers"
    },
    {
        "question_id": 385,
        "question_title": "Mini Parser"
    },
    {
        "question_id": 384,
        "question_title": "Shuffle an Array"
    },
    {
        "question_id": 383,
        "question_title": "Ransom Note"
    },
    {
        "question_id": 382,
        "question_title": "Linked List Random Node"
    },
    {
        "question_id": 381,
        "question_title": "Insert Delete GetRandom O(1) - Duplicates allowed"
    },
    {
        "question_id": 380,
        "question_title": "Insert Delete GetRandom O(1)"
    },
    {
        "question_id": 379,
        "question_title": "Design Phone Directory"
    },
    {
        "question_id": 378,
        "question_title": "Kth Smallest Element in a Sorted Matrix"
    },
    {
        "question_id": 377,
        "question_title": "Combination Sum IV"
    },
    {
        "question_id": 376,
        "question_title": "Wiggle Subsequence"
    },
    {
        "question_id": 375,
        "question_title": "Guess Number Higher or Lower II"
    },
    {
        "question_id": 374,
        "question_title": "Guess Number Higher or Lower"
    },
    {
        "question_id": 373,
        "question_title": "Find K Pairs with Smallest Sums"
    },
    {
        "question_id": 372,
        "question_title": "Super Pow"
    },
    {
        "question_id": 371,
        "question_title": "Sum of Two Integers"
    },
    {
        "question_id": 370,
        "question_title": "Range Addition"
    },
    {
        "question_id": 369,
        "question_title": "Plus One Linked List"
    },
    {
        "question_id": 368,
        "question_title": "Largest Divisible Subset"
    },
    {
        "question_id": 367,
        "question_title": "Valid Perfect Square"
    },
    {
        "question_id": 366,
        "question_title": "Find Leaves of Binary Tree"
    },
    {
        "question_id": 365,
        "question_title": "Water and Jug Problem"
    },
    {
        "question_id": 364,
        "question_title": "Nested List Weight Sum II"
    },
    {
        "question_id": 363,
        "question_title": "Max Sum of Rectangle No Larger Than K"
    },
    {
        "question_id": 362,
        "question_title": "Design Hit Counter"
    },
    {
        "question_id": 361,
        "question_title": "Bomb Enemy"
    },
    {
        "question_id": 360,
        "question_title": "Sort Transformed Array"
    },
    {
        "question_id": 359,
        "question_title": "Logger Rate Limiter"
    },
    {
        "question_id": 358,
        "question_title": "Rearrange String k Distance Apart"
    },
    {
        "question_id": 357,
        "question_title": "Count Numbers with Unique Digits"
    },
    {
        "question_id": 356,
        "question_title": "Line Reflection"
    },
    {
        "question_id": 355,
        "question_title": "Design Twitter"
    },
    {
        "question_id": 354,
        "question_title": "Russian Doll Envelopes"
    },
    {
        "question_id": 353,
        "question_title": "Design Snake Game"
    },
    {
        "question_id": 352,
        "question_title": "Data Stream as Disjoint Intervals"
    },
    {
        "question_id": 351,
        "question_title": "Android Unlock Patterns"
    },
    {
        "question_id": 350,
        "question_title": "Intersection of Two Arrays II"
    },
    {
        "question_id": 349,
        "question_title": "Intersection of Two Arrays"
    },
    {
        "question_id": 348,
        "question_title": "Design Tic-Tac-Toe"
    },
    {
        "question_id": 347,
        "question_title": "Top K Frequent Elements"
    },
    {
        "question_id": 346,
        "question_title": "Moving Average from Data Stream"
    },
    {
        "question_id": 345,
        "question_title": "Reverse Vowels of a String"
    },
    {
        "question_id": 344,
        "question_title": "Reverse String"
    },
    {
        "question_id": 343,
        "question_title": "Integer Break"
    },
    {
        "question_id": 342,
        "question_title": "Power of Four"
    },
    {
        "question_id": 341,
        "question_title": "Flatten Nested List Iterator"
    },
    {
        "question_id": 340,
        "question_title": "Longest Substring with At Most K Distinct Characters"
    },
    {
        "question_id": 339,
        "question_title": "Nested List Weight Sum"
    },
    {
        "question_id": 338,
        "question_title": "Counting Bits"
    },
    {
        "question_id": 337,
        "question_title": "House Robber III"
    },
    {
        "question_id": 336,
        "question_title": "Palindrome Pairs"
    },
    {
        "question_id": 335,
        "question_title": "Self Crossing"
    },
    {
        "question_id": 334,
        "question_title": "Increasing Triplet Subsequence"
    },
    {
        "question_id": 333,
        "question_title": "Largest BST Subtree"
    },
    {
        "question_id": 332,
        "question_title": "Reconstruct Itinerary"
    },
    {
        "question_id": 331,
        "question_title": "Verify Preorder Serialization of a Binary Tree"
    },
    {
        "question_id": 330,
        "question_title": "Patching Array"
    },
    {
        "question_id": 329,
        "question_title": "Longest Increasing Path in a Matrix"
    },
    {
        "question_id": 328,
        "question_title": "Odd Even Linked List"
    },
    {
        "question_id": 327,
        "question_title": "Count of Range Sum"
    },
    {
        "question_id": 326,
        "question_title": "Power of Three"
    },
    {
        "question_id": 325,
        "question_title": "Maximum Size Subarray Sum Equals k"
    },
    {
        "question_id": 324,
        "question_title": "Wiggle Sort II"
    },
    {
        "question_id": 323,
        "question_title": "Number of Connected Components in an Undirected Graph"
    },
    {
        "question_id": 322,
        "question_title": "Coin Change"
    },
    {
        "question_id": 321,
        "question_title": "Create Maximum Number"
    },
    {
        "question_id": 320,
        "question_title": "Generalized Abbreviation"
    },
    {
        "question_id": 319,
        "question_title": "Bulb Switcher"
    },
    {
        "question_id": 318,
        "question_title": "Maximum Product of Word Lengths"
    },
    {
        "question_id": 317,
        "question_title": "Shortest Distance from All Buildings"
    },
    {
        "question_id": 316,
        "question_title": "Remove Duplicate Letters"
    },
    {
        "question_id": 315,
        "question_title": "Count of Smaller Numbers After Self"
    },
    {
        "question_id": 314,
        "question_title": "Binary Tree Vertical Order Traversal"
    },
    {
        "question_id": 313,
        "question_title": "Super Ugly Number"
    },
    {
        "question_id": 312,
        "question_title": "Burst Balloons"
    },
    {
        "question_id": 311,
        "question_title": "Sparse Matrix Multiplication"
    },
    {
        "question_id": 310,
        "question_title": "Minimum Height Trees"
    },
    {
        "question_id": 309,
        "question_title": "Best Time to Buy and Sell Stock with Cooldown"
    },
    {
        "question_id": 308,
        "question_title": "Range Sum Query 2D - Mutable"
    },
    {
        "question_id": 307,
        "question_title": "Range Sum Query - Mutable"
    },
    {
        "question_id": 306,
        "question_title": "Additive Number"
    },
    {
        "question_id": 305,
        "question_title": "Number of Islands II"
    },
    {
        "question_id": 304,
        "question_title": "Range Sum Query 2D - Immutable"
    },
    {
        "question_id": 303,
        "question_title": "Range Sum Query - Immutable"
    },
    {
        "question_id": 302,
        "question_title": "Smallest Rectangle Enclosing Black Pixels"
    },
    {
        "question_id": 301,
        "question_title": "Remove Invalid Parentheses"
    },
    {
        "question_id": 300,
        "question_title": "Longest Increasing Subsequence"
    },
    {
        "question_id": 299,
        "question_title": "Bulls and Cows"
    },
    {
        "question_id": 298,
        "question_title": "Binary Tree Longest Consecutive Sequence"
    },
    {
        "question_id": 297,
        "question_title": "Serialize and Deserialize Binary Tree"
    },
    {
        "question_id": 296,
        "question_title": "Best Meeting Point"
    },
    {
        "question_id": 295,
        "question_title": "Find Median from Data Stream"
    },
    {
        "question_id": 294,
        "question_title": "Flip Game II"
    },
    {
        "question_id": 293,
        "question_title": "Flip Game"
    },
    {
        "question_id": 292,
        "question_title": "Nim Game"
    },
    {
        "question_id": 291,
        "question_title": "Word Pattern II"
    },
    {
        "question_id": 290,
        "question_title": "Word Pattern"
    },
    {
        "question_id": 289,
        "question_title": "Game of Life"
    },
    {
        "question_id": 288,
        "question_title": "Unique Word Abbreviation"
    },
    {
        "question_id": 287,
        "question_title": "Find the Duplicate Number"
    },
    {
        "question_id": 286,
        "question_title": "Walls and Gates"
    },
    {
        "question_id": 285,
        "question_title": "Inorder Successor in BST"
    },
    {
        "question_id": 284,
        "question_title": "Peeking Iterator"
    },
    {
        "question_id": 283,
        "question_title": "Move Zeroes"
    },
    {
        "question_id": 282,
        "question_title": "Expression Add Operators"
    },
    {
        "question_id": 281,
        "question_title": "Zigzag Iterator"
    },
    {
        "question_id": 280,
        "question_title": "Wiggle Sort"
    },
    {
        "question_id": 279,
        "question_title": "Perfect Squares"
    },
    {
        "question_id": 278,
        "question_title": "First Bad Version"
    },
    {
        "question_id": 277,
        "question_title": "Find the Celebrity"
    },
    {
        "question_id": 276,
        "question_title": "Paint Fence"
    },
    {
        "question_id": 275,
        "question_title": "H-Index II"
    },
    {
        "question_id": 274,
        "question_title": "H-Index"
    },
    {
        "question_id": 273,
        "question_title": "Integer to English Words"
    },
    {
        "question_id": 272,
        "question_title": "Closest Binary Search Tree Value II"
    },
    {
        "question_id": 271,
        "question_title": "Encode and Decode Strings"
    },
    {
        "question_id": 270,
        "question_title": "Closest Binary Search Tree Value"
    },
    {
        "question_id": 269,
        "question_title": "Alien Dictionary"
    },
    {
        "question_id": 268,
        "question_title": "Missing Number"
    },
    {
        "question_id": 267,
        "question_title": "Palindrome Permutation II"
    },
    {
        "question_id": 266,
        "question_title": "Palindrome Permutation"
    },
    {
        "question_id": 265,
        "question_title": "Paint House II"
    },
    {
        "question_id": 264,
        "question_title": "Ugly Number II"
    },
    {
        "question_id": 263,
        "question_title": "Ugly Number"
    },
    {
        "question_id": 261,
        "question_title": "Graph Valid Tree"
    },
    {
        "question_id": 260,
        "question_title": "Single Number III"
    },
    {
        "question_id": 259,
        "question_title": "3Sum Smaller"
    },
    {
        "question_id": 258,
        "question_title": "Add Digits"
    },
    {
        "question_id": 257,
        "question_title": "Binary Tree Paths"
    },
    {
        "question_id": 256,
        "question_title": "Paint House"
    },
    {
        "question_id": 255,
        "question_title": "Verify Preorder Sequence in Binary Search Tree"
    },
    {
        "question_id": 254,
        "question_title": "Factor Combinations"
    },
    {
        "question_id": 253,
        "question_title": "Meeting Rooms II"
    },
    {
        "question_id": 252,
        "question_title": "Meeting Rooms"
    },
    {
        "question_id": 251,
        "question_title": "Flatten 2D Vector"
    },
    {
        "question_id": 250,
        "question_title": "Count Univalue Subtrees"
    },
    {
        "question_id": 249,
        "question_title": "Group Shifted Strings"
    },
    {
        "question_id": 248,
        "question_title": "Strobogrammatic Number III"
    },
    {
        "question_id": 247,
        "question_title": "Strobogrammatic Number II"
    },
    {
        "question_id": 246,
        "question_title": "Strobogrammatic Number"
    },
    {
        "question_id": 245,
        "question_title": "Shortest Word Distance III"
    },
    {
        "question_id": 244,
        "question_title": "Shortest Word Distance II"
    },
    {
        "question_id": 243,
        "question_title": "Shortest Word Distance"
    },
    {
        "question_id": 242,
        "question_title": "Valid Anagram"
    },
    {
        "question_id": 241,
        "question_title": "Different Ways to Add Parentheses"
    },
    {
        "question_id": 240,
        "question_title": "Search a 2D Matrix II"
    },
    {
        "question_id": 239,
        "question_title": "Sliding Window Maximum"
    },
    {
        "question_id": 238,
        "question_title": "Product of Array Except Self"
    },
    {
        "question_id": 237,
        "question_title": "Delete Node in a Linked List"
    },
    {
        "question_id": 236,
        "question_title": "Lowest Common Ancestor of a Binary Tree"
    },
    {
        "question_id": 235,
        "question_title": "Lowest Common Ancestor of a Binary Search Tree"
    },
    {
        "question_id": 234,
        "question_title": "Palindrome Linked List"
    },
    {
        "question_id": 233,
        "question_title": "Number of Digit One"
    },
    {
        "question_id": 232,
        "question_title": "Implement Queue using Stacks"
    },
    {
        "question_id": 231,
        "question_title": "Power of Two"
    },
    {
        "question_id": 230,
        "question_title": "Kth Smallest Element in a BST"
    },
    {
        "question_id": 229,
        "question_title": "Majority Element II"
    },
    {
        "question_id": 228,
        "question_title": "Summary Ranges"
    },
    {
        "question_id": 227,
        "question_title": "Basic Calculator II"
    },
    {
        "question_id": 226,
        "question_title": "Invert Binary Tree"
    },
    {
        "question_id": 225,
        "question_title": "Implement Stack using Queues"
    },
    {
        "question_id": 224,
        "question_title": "Basic Calculator"
    },
    {
        "question_id": 223,
        "question_title": "Rectangle Area"
    },
    {
        "question_id": 222,
        "question_title": "Count Complete Tree Nodes"
    },
    {
        "question_id": 221,
        "question_title": "Maximal Square"
    },
    {
        "question_id": 220,
        "question_title": "Contains Duplicate III"
    },
    {
        "question_id": 219,
        "question_title": "Contains Duplicate II"
    },
    {
        "question_id": 218,
        "question_title": "The Skyline Problem"
    },
    {
        "question_id": 217,
        "question_title": "Contains Duplicate"
    },
    {
        "question_id": 216,
        "question_title": "Combination Sum III"
    },
    {
        "question_id": 215,
        "question_title": "Kth Largest Element in an Array"
    },
    {
        "question_id": 214,
        "question_title": "Shortest Palindrome"
    },
    {
        "question_id": 213,
        "question_title": "House Robber II"
    },
    {
        "question_id": 212,
        "question_title": "Word Search II"
    },
    {
        "question_id": 211,
        "question_title": "Design Add and Search Words Data Structure"
    },
    {
        "question_id": 210,
        "question_title": "Course Schedule II"
    },
    {
        "question_id": 209,
        "question_title": "Minimum Size Subarray Sum"
    },
    {
        "question_id": 208,
        "question_title": "Implement Trie (Prefix Tree)"
    },
    {
        "question_id": 207,
        "question_title": "Course Schedule"
    },
    {
        "question_id": 206,
        "question_title": "Reverse Linked List"
    },
    {
        "question_id": 205,
        "question_title": "Isomorphic Strings"
    },
    {
        "question_id": 204,
        "question_title": "Count Primes"
    },
    {
        "question_id": 203,
        "question_title": "Remove Linked List Elements"
    },
    {
        "question_id": 202,
        "question_title": "Happy Number"
    },
    {
        "question_id": 201,
        "question_title": "Bitwise AND of Numbers Range"
    },
    {
        "question_id": 200,
        "question_title": "Number of Islands"
    },
    {
        "question_id": 199,
        "question_title": "Binary Tree Right Side View"
    },
    {
        "question_id": 198,
        "question_title": "House Robber"
    },
    {
        "question_id": 191,
        "question_title": "Number of 1 Bits"
    },
    {
        "question_id": 190,
        "question_title": "Reverse Bits"
    },
    {
        "question_id": 189,
        "question_title": "Rotate Array"
    },
    {
        "question_id": 188,
        "question_title": "Best Time to Buy and Sell Stock IV"
    },
    {
        "question_id": 187,
        "question_title": "Repeated DNA Sequences"
    },
    {
        "question_id": 186,
        "question_title": "Reverse Words in a String II"
    },
    {
        "question_id": 179,
        "question_title": "Largest Number"
    },
    {
        "question_id": 174,
        "question_title": "Dungeon Game"
    },
    {
        "question_id": 173,
        "question_title": "Binary Search Tree Iterator"
    },
    {
        "question_id": 172,
        "question_title": "Factorial Trailing Zeroes"
    },
    {
        "question_id": 171,
        "question_title": "Excel Sheet Column Number"
    },
    {
        "question_id": 170,
        "question_title": "Two Sum III - Data structure design"
    },
    {
        "question_id": 169,
        "question_title": "Majority Element"
    },
    {
        "question_id": 168,
        "question_title": "Excel Sheet Column Title"
    },
    {
        "question_id": 167,
        "question_title": "Two Sum II - Input Array Is Sorted"
    },
    {
        "question_id": 166,
        "question_title": "Fraction to Recurring Decimal"
    },
    {
        "question_id": 165,
        "question_title": "Compare Version Numbers"
    },
    {
        "question_id": 164,
        "question_title": "Maximum Gap"
    },
    {
        "question_id": 163,
        "question_title": "Missing Ranges"
    },
    {
        "question_id": 162,
        "question_title": "Find Peak Element"
    },
    {
        "question_id": 161,
        "question_title": "One Edit Distance"
    },
    {
        "question_id": 160,
        "question_title": "Intersection of Two Linked Lists"
    },
    {
        "question_id": 159,
        "question_title": "Longest Substring with At Most Two Distinct Characters"
    },
    {
        "question_id": 158,
        "question_title": "Read N Characters Given read4 II - Call Multiple Times"
    },
    {
        "question_id": 157,
        "question_title": "Read N Characters Given Read4"
    },
    {
        "question_id": 156,
        "question_title": "Binary Tree Upside Down"
    },
    {
        "question_id": 155,
        "question_title": "Min Stack"
    },
    {
        "question_id": 154,
        "question_title": "Find Minimum in Rotated Sorted Array II"
    },
    {
        "question_id": 153,
        "question_title": "Find Minimum in Rotated Sorted Array"
    },
    {
        "question_id": 152,
        "question_title": "Maximum Product Subarray"
    },
    {
        "question_id": 151,
        "question_title": "Reverse Words in a String"
    },
    {
        "question_id": 150,
        "question_title": "Evaluate Reverse Polish Notation"
    },
    {
        "question_id": 149,
        "question_title": "Max Points on a Line"
    },
    {
        "question_id": 148,
        "question_title": "Sort List"
    },
    {
        "question_id": 147,
        "question_title": "Insertion Sort List"
    },
    {
        "question_id": 146,
        "question_title": "LRU Cache"
    },
    {
        "question_id": 145,
        "question_title": "Binary Tree Postorder Traversal"
    },
    {
        "question_id": 144,
        "question_title": "Binary Tree Preorder Traversal"
    },
    {
        "question_id": 143,
        "question_title": "Reorder List"
    },
    {
        "question_id": 142,
        "question_title": "Linked List Cycle II"
    },
    {
        "question_id": 141,
        "question_title": "Linked List Cycle"
    },
    {
        "question_id": 140,
        "question_title": "Word Break II"
    },
    {
        "question_id": 139,
        "question_title": "Word Break"
    },
    {
        "question_id": 138,
        "question_title": "Copy List with Random Pointer"
    },
    {
        "question_id": 137,
        "question_title": "Single Number II"
    },
    {
        "question_id": 136,
        "question_title": "Single Number"
    },
    {
        "question_id": 135,
        "question_title": "Candy"
    },
    {
        "question_id": 134,
        "question_title": "Gas Station"
    },
    {
        "question_id": 133,
        "question_title": "Clone Graph"
    },
    {
        "question_id": 132,
        "question_title": "Palindrome Partitioning II"
    },
    {
        "question_id": 131,
        "question_title": "Palindrome Partitioning"
    },
    {
        "question_id": 130,
        "question_title": "Surrounded Regions"
    },
    {
        "question_id": 129,
        "question_title": "Sum Root to Leaf Numbers"
    },
    {
        "question_id": 128,
        "question_title": "Longest Consecutive Sequence"
    },
    {
        "question_id": 127,
        "question_title": "Word Ladder"
    },
    {
        "question_id": 126,
        "question_title": "Word Ladder II"
    },
    {
        "question_id": 125,
        "question_title": "Valid Palindrome"
    },
    {
        "question_id": 124,
        "question_title": "Binary Tree Maximum Path Sum"
    },
    {
        "question_id": 123,
        "question_title": "Best Time to Buy and Sell Stock III"
    },
    {
        "question_id": 122,
        "question_title": "Best Time to Buy and Sell Stock II"
    },
    {
        "question_id": 121,
        "question_title": "Best Time to Buy and Sell Stock"
    },
    {
        "question_id": 120,
        "question_title": "Triangle"
    },
    {
        "question_id": 119,
        "question_title": "Pascal's Triangle II"
    },
    {
        "question_id": 118,
        "question_title": "Pascal's Triangle"
    },
    {
        "question_id": 117,
        "question_title": "Populating Next Right Pointers in Each Node II"
    },
    {
        "question_id": 116,
        "question_title": "Populating Next Right Pointers in Each Node"
    },
    {
        "question_id": 115,
        "question_title": "Distinct Subsequences"
    },
    {
        "question_id": 114,
        "question_title": "Flatten Binary Tree to Linked List"
    },
    {
        "question_id": 113,
        "question_title": "Path Sum II"
    },
    {
        "question_id": 112,
        "question_title": "Path Sum"
    },
    {
        "question_id": 111,
        "question_title": "Minimum Depth of Binary Tree"
    },
    {
        "question_id": 110,
        "question_title": "Balanced Binary Tree"
    },
    {
        "question_id": 109,
        "question_title": "Convert Sorted List to Binary Search Tree"
    },
    {
        "question_id": 108,
        "question_title": "Convert Sorted Array to Binary Search Tree"
    },
    {
        "question_id": 107,
        "question_title": "Binary Tree Level Order Traversal II"
    },
    {
        "question_id": 106,
        "question_title": "Construct Binary Tree from Inorder and Postorder Traversal"
    },
    {
        "question_id": 105,
        "question_title": "Construct Binary Tree from Preorder and Inorder Traversal"
    },
    {
        "question_id": 104,
        "question_title": "Maximum Depth of Binary Tree"
    },
    {
        "question_id": 103,
        "question_title": "Binary Tree Zigzag Level Order Traversal"
    },
    {
        "question_id": 102,
        "question_title": "Binary Tree Level Order Traversal"
    },
    {
        "question_id": 101,
        "question_title": "Symmetric Tree"
    },
    {
        "question_id": 100,
        "question_title": "Same Tree"
    },
    {
        "question_id": 99,
        "question_title": "Recover Binary Search Tree"
    },
    {
        "question_id": 98,
        "question_title": "Validate Binary Search Tree"
    },
    {
        "question_id": 97,
        "question_title": "Interleaving String"
    },
    {
        "question_id": 96,
        "question_title": "Unique Binary Search Trees"
    },
    {
        "question_id": 95,
        "question_title": "Unique Binary Search Trees II"
    },
    {
        "question_id": 94,
        "question_title": "Binary Tree Inorder Traversal"
    },
    {
        "question_id": 93,
        "question_title": "Restore IP Addresses"
    },
    {
        "question_id": 92,
        "question_title": "Reverse Linked List II"
    },
    {
        "question_id": 91,
        "question_title": "Decode Ways"
    },
    {
        "question_id": 90,
        "question_title": "Subsets II"
    },
    {
        "question_id": 89,
        "question_title": "Gray Code"
    },
    {
        "question_id": 88,
        "question_title": "Merge Sorted Array"
    },
    {
        "question_id": 87,
        "question_title": "Scramble String"
    },
    {
        "question_id": 86,
        "question_title": "Partition List"
    },
    {
        "question_id": 85,
        "question_title": "Maximal Rectangle"
    },
    {
        "question_id": 84,
        "question_title": "Largest Rectangle in Histogram"
    },
    {
        "question_id": 83,
        "question_title": "Remove Duplicates from Sorted List"
    },
    {
        "question_id": 82,
        "question_title": "Remove Duplicates from Sorted List II"
    },
    {
        "question_id": 81,
        "question_title": "Search in Rotated Sorted Array II"
    },
    {
        "question_id": 80,
        "question_title": "Remove Duplicates from Sorted Array II"
    },
    {
        "question_id": 79,
        "question_title": "Word Search"
    },
    {
        "question_id": 78,
        "question_title": "Subsets"
    },
    {
        "question_id": 77,
        "question_title": "Combinations"
    },
    {
        "question_id": 76,
        "question_title": "Minimum Window Substring"
    },
    {
        "question_id": 75,
        "question_title": "Sort Colors"
    },
    {
        "question_id": 74,
        "question_title": "Search a 2D Matrix"
    },
    {
        "question_id": 73,
        "question_title": "Set Matrix Zeroes"
    },
    {
        "question_id": 72,
        "question_title": "Edit Distance"
    },
    {
        "question_id": 71,
        "question_title": "Simplify Path"
    },
    {
        "question_id": 70,
        "question_title": "Climbing Stairs"
    },
    {
        "question_id": 69,
        "question_title": "Sqrt(x)"
    },
    {
        "question_id": 68,
        "question_title": "Text Justification"
    },
    {
        "question_id": 67,
        "question_title": "Add Binary"
    },
    {
        "question_id": 66,
        "question_title": "Plus One"
    },
    {
        "question_id": 65,
        "question_title": "Valid Number"
    },
    {
        "question_id": 64,
        "question_title": "Minimum Path Sum"
    },
    {
        "question_id": 63,
        "question_title": "Unique Paths II"
    },
    {
        "question_id": 62,
        "question_title": "Unique Paths"
    },
    {
        "question_id": 61,
        "question_title": "Rotate List"
    },
    {
        "question_id": 60,
        "question_title": "Permutation Sequence"
    },
    {
        "question_id": 59,
        "question_title": "Spiral Matrix II"
    },
    {
        "question_id": 58,
        "question_title": "Length of Last Word"
    },
    {
        "question_id": 57,
        "question_title": "Insert Interval"
    },
    {
        "question_id": 56,
        "question_title": "Merge Intervals"
    },
    {
        "question_id": 55,
        "question_title": "Jump Game"
    },
    {
        "question_id": 54,
        "question_title": "Spiral Matrix"
    },
    {
        "question_id": 53,
        "question_title": "Maximum Subarray"
    },
    {
        "question_id": 52,
        "question_title": "N-Queens II"
    },
    {
        "question_id": 51,
        "question_title": "N-Queens"
    },
    {
        "question_id": 50,
        "question_title": "Pow(x, n)"
    },
    {
        "question_id": 49,
        "question_title": "Group Anagrams"
    },
    {
        "question_id": 48,
        "question_title": "Rotate Image"
    },
    {
        "question_id": 47,
        "question_title": "Permutations II"
    },
    {
        "question_id": 46,
        "question_title": "Permutations"
    },
    {
        "question_id": 45,
        "question_title": "Jump Game II"
    },
    {
        "question_id": 44,
        "question_title": "Wildcard Matching"
    },
    {
        "question_id": 43,
        "question_title": "Multiply Strings"
    },
    {
        "question_id": 42,
        "question_title": "Trapping Rain Water"
    },
    {
        "question_id": 41,
        "question_title": "First Missing Positive"
    },
    {
        "question_id": 40,
        "question_title": "Combination Sum II"
    },
    {
        "question_id": 39,
        "question_title": "Combination Sum"
    },
    {
        "question_id": 38,
        "question_title": "Count and Say"
    },
    {
        "question_id": 37,
        "question_title": "Sudoku Solver"
    },
    {
        "question_id": 36,
        "question_title": "Valid Sudoku"
    },
    {
        "question_id": 35,
        "question_title": "Search Insert Position"
    },
    {
        "question_id": 34,
        "question_title": "Find First and Last Position of Element in Sorted Array"
    },
    {
        "question_id": 33,
        "question_title": "Search in Rotated Sorted Array"
    },
    {
        "question_id": 32,
        "question_title": "Longest Valid Parentheses"
    },
    {
        "question_id": 31,
        "question_title": "Next Permutation"
    },
    {
        "question_id": 30,
        "question_title": "Substring with Concatenation of All Words"
    },
    {
        "question_id": 29,
        "question_title": "Divide Two Integers"
    },
    {
        "question_id": 28,
        "question_title": "Find the Index of the First Occurrence in a String"
    },
    {
        "question_id": 27,
        "question_title": "Remove Element"
    },
    {
        "question_id": 26,
        "question_title": "Remove Duplicates from Sorted Array"
    },
    {
        "question_id": 25,
        "question_title": "Reverse Nodes in k-Group"
    },
    {
        "question_id": 24,
        "question_title": "Swap Nodes in Pairs"
    },
    {
        "question_id": 23,
        "question_title": "Merge k Sorted Lists"
    },
    {
        "question_id": 22,
        "question_title": "Generate Parentheses"
    },
    {
        "question_id": 21,
        "question_title": "Merge Two Sorted Lists"
    },
    {
        "question_id": 20,
        "question_title": "Valid Parentheses"
    },
    {
        "question_id": 19,
        "question_title": "Remove Nth Node From End of List"
    },
    {
        "question_id": 18,
        "question_title": "4Sum"
    },
    {
        "question_id": 17,
        "question_title": "Letter Combinations of a Phone Number"
    },
    {
        "question_id": 16,
        "question_title": "3Sum Closest"
    },
    {
        "question_id": 15,
        "question_title": "3Sum"
    },
    {
        "question_id": 14,
        "question_title": "Longest Common Prefix"
    },
    {
        "question_id": 13,
        "question_title": "Roman to Integer"
    },
    {
        "question_id": 12,
        "question_title": "Integer to Roman"
    },
    {
        "question_id": 11,
        "question_title": "Container With Most Water"
    },
    {
        "question_id": 10,
        "question_title": "Regular Expression Matching"
    },
    {
        "question_id": 9,
        "question_title": "Palindrome Number"
    },
    {
        "question_id": 8,
        "question_title": "String to Integer (atoi)"
    },
    {
        "question_id": 7,
        "question_title": "Reverse Integer"
    },
    {
        "question_id": 6,
        "question_title": "Zigzag Conversion"
    },
    {
        "question_id": 5,
        "question_title": "Longest Palindromic Substring"
    },
    {
        "question_id": 4,
        "question_title": "Median of Two Sorted Arrays"
    },
    {
        "question_id": 3,
        "question_title": "Longest Substring Without Repeating Characters"
    },
    {
        "question_id": 2,
        "question_title": "Add Two Numbers"
    },
    {
        "question_id": 1,
        "question_title": "Two Sum"
    }
]